The Accuracy of the Chebyshev Differencing Method for Analytic Functions
Let \(f(x)\) be a differentiable function defined on \([-1,1]\). One of the most powerful procedure for the numerical calculation of the derivative \(f^\prime (x)\) is given by the Chebyshev spectral collocation process, that is by taking the derivative of an interpolating polynomial. As the authors note, the Chebyshev differencing method works best when the function \(f(x)\) can be continued into the complex plane as a function \(f(z)\) which is analytic in an open neighborhood of \([-1,1]\). In this case, an upper bound of the error, in the discrete maximum norm, can be derived. The main result of the paper states that, if \(p_N(x)\) is the polynomial interpolant of \(f(x)\) at the set of zeros \(\{ s_j \} \) or extrema \(\{ t_j \} \) of the Chebyshev polynomial \(T_N (x)\), and \(f(z)\) is analytic in an ellipse containing the interval \([-1,1]\), then \(\max _{0 \leq j \leq N}| f^\prime (s_j)- p^\prime (s_j)| \) and \(\max _{0 \leq j \leq N}| f^\prime (t_j)- p^\prime (t_j)| \) are bounded and their bounds are given explicitly. Two model functions are analyzed in detail.
- A Chebyshev differentiation method
- Numerical Differentiation by High Order Interpolation
- Hermite spectral and pseudospectral methods for numerical differentiation
- Numerical differentiation of approximated functions with limited order-of-accuracy deterioration
- scientific article; zbMATH DE number 3856280
- A Chebyshev differentiation method
- Jacobi polynomials on the Bernstein ellipse
- The errors in calculating the pseudospectral differentiation matrices for Čebyšev-Gauss-Lobatto points
- A rational approximation scheme for computing Mittag-Leffler function with discrete elliptic operator as input
- Minimizers of a free boundary problem on three-dimensional cones
- Spectral collocation in space and time for linear PDEs
- Variational framework for distance-minimizing method in data-driven computational mechanics
- Chebyshev spectral collocation in space and time for the heat equation
- Differentiation matrices for univariate polynomials
- Eigenfrequencies of fractal drums
- On the uniform convergence of the Chebyshev interpolants for solitons
- Finite difference formulas in the complex plane
- A polynomial interpolation process at quasi-Chebyshev nodes with the FFT
- Numerical proof of stability of viscous shock profiles
- Numerical Differentiation by High Order Interpolation
- Approximation of parametric derivatives by the empirical interpolation method
- Numerical proof of stability of roll waves in the small-amplitude limit for inclined thin film flow
- Superconvergence of Jacobi-Gauss-type spectral interpolation
- On exponential convergence of Gegenbauer interpolation and spectral differentiation
- Space-time spectral method for the Stokes problem
- Superconvergence points for higher-order derivative interpolation and its applications in spectral collocation method
- Deep neural network for solving differential equations motivated by Legendre-Galerkin approximation
- Asymptotic stability of sharp fronts: analysis and rigorous computation
- Convergence analysis of Hermite approximations for analytic functions
- Two-loop six-point planar massless Feynman integrals to higher orders
- Superconvergence points of Hermite spectral interpolation
- Accuracy evaluation for a number-analytic method applied to a Chaplygin problem
- Quadrature rule for Abel's equations: Uniformly approximating fractional derivatives
This page was built for publication: The Accuracy of the Chebyshev Differencing Method for Analytic Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5698739)