Asymptotic coefficients and errors for Chebyshev polynomial approximations with weak endpoint singularities: effects of different bases

DOI10.1007/S11425-021-1974-XMaRDI QIDQ2679073zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 18 January 2023

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.11841

zbMATH Keywords

interpolationleast squares methodChebyshev polynomialendpoint singularities

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Numerical interpolation (65D05) Algorithms for approximation of functions (65D15) Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70)

Abstract: When solving differential equations by a spectral method, it is often convenient to shift from Chebyshev polynomials $T_n(x)$ with coefficients $a_n$ to modified basis functions that incorporate the boundary conditions. For homogeneous Dirichlet boundary conditions, $u(pm1)=0$, popular choices include the ``Chebyshev difference basis", $varsigm{a}_n(x)equiv{T}_{n+2}(x)-T_n(x)$ with coefficients here denoted $b_n$ and the ``quadratic-factor basis functions" $varrh{o}_n(x)equiv(1-x^2)T_n(x)$ with coefficients $c_n$. If $u(x)$ is weakly singular at the boundaries, then $a_n$ will decrease proportionally to $mathcalO(A(n)/n^{kappa})$ for some positive constant $kappa$, where the $A(n)$ is a logarithm or a constant. We prove that the Chebyshev difference coefficients $b_n$ decrease more slowly by a factor of $1/n$ while the quadratic-factor coefficients $c_n$ decrease more slowly still as $mathcalO(A(n)/n^{kappa-2})$. The error for the unconstrained Chebyshev series, truncated at degree $n=N$, is $mathcalO(|A(N)|/N^{kappa})$ in the interior, but is worse by one power of $N$ in narrow boundary layers near each of the endpoints. Despite having nearly identical error emph{norms}, the error in the Chebyshev basis is concentrated in boundary layers near both endpoints, whereas the error in the quadratic-factor and difference basis sets is nearly uniform oscillations over the entire interval in $x$. Meanwhile, for Chebyshev polynomials and the quadratic-factor basis, the value of the derivatives at the endpoints is $mathcalO(N^2)$, but only $mathcalO(N)$ for the difference basis.

Recommendations

• The asymptotic Chebyshev coefficients for functions with logarithmic endpoint singularities: Mappings and singular basis functions
• On error bounds for orthogonal polynomial expansions and Gauss-type quadrature
• Large-degree asymptotics and exponential asymptotics for Fourier, Chebyshev and Hermite coefficients and Fourier transforms
• On the errors incurred calculating derivatives using Chebyshev polynomials
• Modified basis functions in spectral approximation for singular perturbation problem

Cites work

• scientific article; zbMATH DE number 3245839 (Why is no real title available?)
• scientific article; zbMATH DE number 3277020 (Why is no real title available?)
• scientific article; zbMATH DE number 3082267 (Why is no real title available?)
• A gyroscopic polynomial basis in the sphere
• Approximation theory and approximation practice
• Asymptotic Estimates of Fourier Coefficients
• Asymptotic expansion of Fourier coefficients associated to functions with low continuity
• Bernstein's asymptotic best bound for the kth derivative of a polynomial
• Chebyshev and Fourier spectral methods.
• Chebyshev and Legendre spectral methods in algebraic manipulation languages
• Chebyshev domain truncation is inferior to Fourier domain truncation for solving problems on an infinite interval
• Coefficients in Series Expansions for Certain Classes of Functions
• Convergence rates on spectral orthogonal projection approximation for functions of algebraic and logarithmatic regularities
• Error Estimates for Sine Series Expansions
• Error estimates for Clenshaw-Curtis quadrature
• Is Gauss Quadrature Better than Clenshaw–Curtis?
• Large-degree asymptotics and exponential asymptotics for Fourier, Chebyshev and Hermite coefficients and Fourier transforms
• NIST handbook of mathematical functions
• On the convergence rate of Clenshaw-Curtis quadrature for integrals with algebraic endpoint singularities
• On the convergence rates of Gauss and Clenshaw-Curtis quadrature for functions of limited regularity
• On the equivalence between basis recombination and boundary bordering formulations for spectral collocation methods in rectangular domains
• On the optimal estimates and comparison of Gegenbauer expansion coefficients
• Optimal decay rates on the asymptotics of orthogonal polynomial expansions for functions of limited regularities
• Optimal error estimates for Chebyshev approximations of functions with limited regularity in fractional Sobolev-type spaces
• Solving transcendental equations. The Chebyshev polynomial proxy and other numerical rootfinders, perturbation series, and oracles
• Spectral Methods for Time-Dependent Problems
• Stabilization techniques for spectral methods
• The Evaluation and Estimation of the Coefficients in the Chebyshev Series Expansion of a Function
• The relationships between Chebyshev, Legendre and Jacobi polynomials: the generic superiority of Chebyshev polynomials and three important exceptions

Cited in

(6)

• Decay analysis of bivariate Chebyshev coefficients for functions with limited regularity
• Optimal error estimates for Chebyshev approximations of functions with endpoint singularities in fractional spaces
• Comparisons of best approximations with Chebyshev expansions for functions with logarithmic endpoint singularities
• Analysis of Error Localization of Chebyshev Spectral Approximations
• The asymptotic Chebyshev coefficients for functions with logarithmic endpoint singularities: Mappings and singular basis functions
• A brief introduction to pseudo-spectral methods: application to diffusion problems

Describes a project that uses

Uses Software

• DLMF

This page was built for publication: Asymptotic coefficients and errors for Chebyshev polynomial approximations with weak endpoint singularities: effects of different bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679073)