A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method which aims to find an approximation such that the maximum error is minimized. Suppose we seek to approximate the function f(x) by a function p(x) on the interval . Then a minimax approximation algorithm will aim to minimize
Read more about Minimax Approximation Algorithm: Polynomial Approximations