Always Chebyshev Interpolation In Elementary Function Computations
نویسنده
چکیده
A common practice for computing an elementary transcendental function nowadays has two phases: reductions of input arguments to fall into a tiny interval and polynomial approximations for the function within the interval. Typically the interval is made tiny enough so that one won’t have to go for polynomials of very high degrees for accurate approximations. Often approximating polynomials as such are taken to be the best polynomials or any others such as the Chebyshev interpolating polynomials. The best polynomial of degree n has the property that the biggest difference between it and the function is smallest among all possible polynomials of degrees no higher than n. Thus it is natural to choose the best polynomials over others. In this paper, it is proved that the best polynomial can only be more accurate by at most a fractional bit than the Chebyshev interpolating polynomial of the same degree in computing elementary functions, or in the other word the Chebyshev interpolating polynomials will do just as good as the best polynomials (which are harder to compute). Similar results were obtained in 1967 by M. J. D. Powell who, however, did not target at elementary function computations in particular and placed no assumption on the function and remarkably whose results imply accuracy differences of no more than 2 to 3 bits in the context of this paper.
منابع مشابه
Using Chebyshev polynomial’s zeros as point grid for numerical solution of nonlinear PDEs by differential quadrature- based radial basis functions
Radial Basis Functions (RBFs) have been found to be widely successful for the interpolation of scattered data over the last several decades. The numerical solution of nonlinear Partial Differential Equations (PDEs) plays a prominent role in numerical weather forecasting, and many other areas of physics, engineering, and biology. In this paper, Differential Quadrature (DQ) method- based RBFs are...
متن کاملBivariate Lagrange Interpolation at the Chebyshev Nodes
We discuss Lagrange interpolation on two sets of nodes in two dimensions where the coordinates of the nodes are Chebyshev points having either the same or opposite parity. We use a formula of Xu for Lagrange polynomials to obtain a general interpolation theorem for bivariate polynomials at either set of Chebyshev nodes. An extra term must be added to the interpolation formula to handle all poly...
متن کاملA comparison of interpolation grids over the triangle or the tetrahedron
A simple strategy for constructing a sequence of increasingly refined interpolation grids over the triangle or the tetrahedron is discussed with the goal of achieving uniform convergence and ensuring high interpolation accuracy. The interpolation nodes are generated based on a one-dimensional master grid comprised of the zeros of the Lobatto, Legendre, Chebyshev, and second-kind Chebyshev polyn...
متن کاملOn Chebyshev interpolation of analytic functions
This paper reviews the notion of interpolation of a smooth function by means of Chebyshev polynomials, and the well-known associated results of spectral accuracy when the function is analytic. The rate of decay of the error is proportional to ρ−N , where ρ is a bound on the elliptical radius of the ellipse in which the function has a holomorphic extension. An additional theorem is provided to c...
متن کاملSymbolic-Numeric Sparse Polynomial Interpolation in Chebyshev Basis and Trigonometric Interpolation
We consider the problem of efficiently interpolating an “approximate” black-box polynomial p(x) that is sparse when represented in the Chebyshev basis. Our computations will be in a traditional floating-point environment, and their numerical sensitivity will be investigated. We also consider the related problem of interpolating a sparse linear combination of “approximate” trigonometric function...
متن کامل