Minimax approximation algorithm
A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error. For example, given a function defined on the interval and a degree bound , a minimax polynomial approximation algorithm will find a polynomial of degree at most to minimize
- Comment
- enA minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error. For example, given a function defined on the interval and a degree bound , a minimax polynomial approximation algorithm will find a polynomial of degree at most to minimize
- Has abstract
- enA minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error. For example, given a function defined on the interval and a degree bound , a minimax polynomial approximation algorithm will find a polynomial of degree at most to minimize
- Is primary topic of
- Minimax approximation algorithm
- Label
- enMinimax approximation algorithm
- Link from a Wikipage to an external page
- mathworld.wolfram.com/MinimaxApproximation.html
- Link from a Wikipage to another Wikipage
- Category:Numerical analysis
- Chebyshev series
- Mathematical function
- Remez algorithm
- Taylor series
- Weierstrass approximation theorem
- SameAs
- 4rdTn
- m.0csfcx
- Q6865376
- Subject
- Category:Numerical analysis
- WasDerivedFrom
- Minimax approximation algorithm?oldid=1046794977&ns=0
- WikiPageLength
- 3098
- Wikipage page ID
- 4882595
- Wikipage revision ID
- 1046794977
- WikiPageUsesTemplate
- Template:Reflist