Editing Approximation theory (section)

{{Short description|Theory of getting acceptably close inexact mathematical calculations}}
{{use mdy dates|date=September 2021}}
{{Use American English|date = March 2019}}
In [[mathematics]], '''approximation theory''' is concerned with how [[function (mathematics)|function]]s can best be [[approximation|approximated]] with simpler functions, and with [[quantitative property|quantitative]]ly [[characterization (mathematics)|characterizing]] the [[approximation error|errors]] introduced thereby. What is meant by ''best'' and ''simpler'' will depend on the application.

A closely related topic is the approximation of functions by [[generalized Fourier series]], that is, approximations based upon summation of a series of terms based upon [[orthogonal polynomials]].

One problem of particular interest is that of approximating a function in a [[computer]] mathematical library, using operations that can be performed on the computer or calculator (e.g. addition and multiplication), such that the result is as close to the actual function as possible. This is typically done with [[polynomial]] or [[Rational function|rational]] (ratio of polynomials) approximations.

The objective is to make the approximation as close as possible to the actual function, typically with an accuracy close to that of the underlying computer's [[floating point]] arithmetic. This is accomplished by using a polynomial of high [[Degree of a polynomial|degree]], and/or narrowing the domain over which the polynomial has to approximate the function.
Narrowing the domain can often be done through the use of various addition or scaling formulas for the function being approximated. Modern mathematical libraries often reduce the domain into many tiny segments and use a low-degree polynomial for each segment.

{| style="float:right"
| [[Image:Logerror.png|thumb|300px|Error between optimal polynomial and log(x) (red), and Chebyshev approximation and log(x) (blue) over the interval [2, 4]. Vertical divisions are 10<sup>−5</sup>. Maximum error for the optimal polynomial is 6.07 × 10<sup>−5</sup>.]]
| [[Image:Experror.png|thumb|300px|Error between optimal polynomial and exp(x) (red), and Chebyshev approximation and exp(x) (blue) over the interval [−1, 1]. Vertical divisions are 10<sup>−4</sup>. Maximum error for the optimal polynomial is 5.47 × 10<sup>−4</sup>.]]
|}