- Function approximation
The need for function approximations arises in many branches of
applied mathematics , andcomputer science in particular. In general, a function approximation problem asks us to select a function among a well-defined class that closely matches ("approximates") a target function in a task-specific way.One can distinguish two major classes of function approximation problems: First, for known target functions
approximation theory is the branch ofnumerical analysis that investigates how certain known functions (for example,special function s) can be approximated by a specific class of functions (for example,polynomial s orrational function s) that often have desirable properties (inexpensive computation, continuity, integral and limit values, etc.).Second, the target function, call it "g", may be unknown; instead of an explicit formula, only a set of points of the form ("x", "g"("x")) is provided. Depending on the structure of the domain and
codomain of "g", several techniques for approximating "g" may be applicable. For example, if "g" is an operation on thereal number s, techniques ofinterpolation ,extrapolation ,regression analysis , andcurve fitting can be used. If the codomain of "g" is a finite set, one is dealing with a classification problem instead.To some extent the different problems (regression, classification) have received a unified treatment in
statistical learning theory , where they are viewed assupervised learning problems.ee also
*
Radial basis function network External links
* [http://www.hedengren.net/research/isat.htm In Situ Adaptive Tabulation] : Nonlinear function approximation with multiple linear regions adapted under error control.
Wikimedia Foundation. 2010.