Approximation theory: Difference between revisions
Jump to navigation
Jump to search
imported>Igor Grešovnik No edit summary |
imported>Hendra I. Nurdin mNo edit summary |
||
| Line 1: | Line 1: | ||
{{subpages}} | |||
In [[mathematics]], '''approximation theory''' is concerned with how [[Function (mathematics)|functions]] can be best [[approximation|approximated]] with simpler functions, and with quantitatively characterising the [[approximation error|errors]] introduced thereby. What is meant by ''best'' and ''simpler'' will depend on the application. | In [[mathematics]], '''approximation theory''' is concerned with how [[Function (mathematics)|functions]] can be best [[approximation|approximated]] with simpler functions, and with quantitatively characterising the [[approximation error|errors]] introduced thereby. What is meant by ''best'' and ''simpler'' will depend on the application. | ||
Revision as of 17:09, 24 November 2007
In mathematics, approximation theory is concerned with how functions can be best approximated with simpler functions, and with quantitatively characterising the errors introduced thereby. What is meant by best and simpler will depend on the application.
Approximation theory has many applications, especially in numerical computation, physics, engineering and computer science. Of particular interest in computer science is approximating functions in a computer mathematical library, using operations that can be performed on the computer (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 approximations.