Minimax approximation algorithm (original) (raw)

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