Overview
![](/assets/images/picto-drapeau-france-3a76576a5d60a512053b4612ab58dae5.png)
ABSTRACT
At least implicitly, functions are the daily concern of most engineers and scientists. When they are not very smooth, i.e. when they do not have a significant number of derivatives, they can be significantly complex. Although their approximation is a classic field of analysis, a large amount of the corresponding theorems, only requiring continuity and the taking into account of approximation by polynomials , is not really relevant in practice. This article presents relatively simple methods for the efficient approximation of functions with at least a few derivatives. After having provided a few reminders on the Taylor /Padé approximants, interpolation and the best polynomial approximation, it focuses on approximations via infinitely smooth interpolation, such as the polynomial interpolation between Chebyshev points and, for equidistant points, the linear rational interpolation, trigonometric interpolation and sinc interpolation.
Read this article from a comprehensive knowledge base, updated and supplemented with articles reviewed by scientific committees.
Read the articleAUTHOR
-
Jean-Paul BERRUT: Professor of numerical analysis - Department of Mathematics, University of Fribourg
INTRODUCTION
Let's start by defining the framework. Let's recall the definition: a function is a rule associating with any element of a definition set an element of an image set. In general, the definition set is a continuous subset of the real numbers, i.e. infinite and uncountable. The amount of information encompassed by the concept of a function is therefore beyond comprehension. (The elementary functions we can work with on paper make up only a tiny fraction of the whole set of functions, the few exceptions confirming the rule). In practical analytical problems, such as solving a differential equation, the unknown to be determined is or depends on a function. The information sought is therefore uncountable and the task impossible. Of course, the more differentiability is required, the more the number of possibilities decreases: for example, if we know from theory that the solution is integral, and if we can determine the countable set of its derivatives at a point, then it is known everywhere thanks to its Taylor series; the determination of the information is thus reduced to the development of an algorithm comprising a countable number of operations. Nevertheless, information remains infinite. The main task of approximation is to replace the infinite information contained in the functions with finite information determined by the fewest possible degrees of freedom.
In this article, we will be dealing with functions defined on an interval, finite or infinite; the problem of approximating functions of several variables will not be addressed. What's more, we're interested in approximation from a practical point of view, not in the theory of approximation. On the one hand, such functions can be horrible (e.g., derivable at any point), which is hardly the case in practice, and on the other hand, convergence is slow, not taking advantage of the reduction in possibilities induced by the existence of derivatives. Readers will find a wealth of theoretical literature, such as for a recent publication.
We will also restrict ourselves to infinitely derivable approximations, which we believe have many advantages. On the one hand, many of the functions used in practice are infinitely derivable, except perhaps at the extremities of their interval of definition; on the other hand, if the function has only a finite number of derivatives, the speed of convergence of the infinitely derivable interpolant automatically adapts to the highest order of differentiability; finally, the introduction of abscissas where the approximation has fewer derivatives than the approximated function seems to...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference
KEYWORDS
Taylor approximations | Padé approximations | polynomial interpolation | best approximation | Chebyshev points | trigonometric interpolation | linear barycentric rational interpolation | sinc interpolation
This article is included in
Mathematics
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Approximation of functions
Bibliography
Software
Chebfun Version 4.2 by TREFETHEN (L.N.) and the Chebfun Development Team 2011 :
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference