Lesson plan
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 f defined on the interval [a,b] and a degree bound n , a minimax polynomial approximation algorithm will find a polynomial p of degree at most n to minimize :: \max_{a \leq x \leq b}|f(x)-p(x)|.
Article summary
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 f defined on the interval [a,b] and a degree bound n , a minimax polynomial approximation algorithm will find a polynomial p of degree at most n to minimize :: \max_{a \leq x \leq b}|f(x)-p(x)|.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.