A minimax approximation 
to a function 
from a prescribed class 
minimizes the greatest absolute
error over the domain 
, so
 |
where 
is the supremum norm. Thus the error
is minimized uniformly over 
. When 
is the class of polynomials
of a specified degree, 
is a minimax polynomial,
and it can be computed under suitable conditions by the Remez
algorithm.
