Groot, E.D. de (2017) Finding best minimax approximations with the Remez algorithm. Bachelor's Thesis, Mathematics.
|
Text
BSc_Math_2017_deGroot_ED.pdf - Published Version Download (616kB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
toestemming.pdf - Other Restricted to Backend only Download (75kB) |
Abstract
The Remez algorithm is an iterative procedure which can be used to find best polynomial approximations in the minimax sense. We present and explain relevant theory on minimax approximation. After doing so, we state the Remez algorithm and give several examples created by our Matlab implementation of the algorithm. We conclude by presenting a convergence proof.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Degree programme: | Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 15 Feb 2018 08:32 |
| Last Modified: | 15 Feb 2018 08:32 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/15985 |
Actions (login required)
 |
View Item |