How much faster does the best polynomial approximation converge than Legendre projection?
From MaRDI portal
Publication:1996234
DOI10.1007/s00211-021-01173-zzbMath1475.41007arXiv2001.01985OpenAlexW3126368577MaRDI QIDQ1996234
Publication date: 3 March 2021
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.01985
rate of convergencepolynomial approximationbest approximationLegendre polynomialChebyshev polynomial
Related Items
Optimal error estimates for Legendre expansions of singular functions with fractional derivatives of bounded variation ⋮ Spectral convergence of probability densities for forward problems in uncertainty quantification ⋮ Pointwise error estimates and local superconvergence of Jacobi expansions ⋮ Analysis of Error Localization of Chebyshev Spectral Approximations ⋮ Comparisons of best approximations with Chebyshev expansions for functions with logarithmic endpoint singularities ⋮ A static memory sparse spectral method for time-fractional PDEs ⋮ New error bounds for Legendre approximations of differentiable functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prolate spheroidal wave functions of order zero. Mathematical tools for bandlimited approximation
- A fast and simple algorithm for the computation of Legendre coefficients
- Szegö's conjecture on Lebesgue constants for Legendre series
- The h, p and h-p versions of the finite element method in 1 dimension. I. The error analysis of the p-version
- A new and sharper bound for Legendre expansion of differentiable functions
- Optimal decay rates on the asymptotics of orthogonal polynomial expansions for functions of limited regularities
- On the Optimal Estimates and Comparison of Gegenbauer Expansion Coefficients
- Sharp Error Bounds for Jacobi Expansions and Gegenbauer--Gauss Quadrature of Analytic Functions
- On Error Bounds for Orthogonal Polynomial Expansions and Gauss-Type Quadrature
- Spectral Methods
- Some Error Estimates for the p-Version of the Finite Element Method
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Spectral Methods for Time-Dependent Problems
- Gauss, Landen, Ramanujan, the Arithmetic-Geometric Mean, Ellipses, π, and the Ladies Diary
- Efficient Spectral-Galerkin Method I. Direct Solvers of Second- and Fourth-Order Equations Using Legendre Polynomials
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- Polynomial Approximation of Piecewise Analytic Functions
- Optimal error estimates for Chebyshev approximations of functions with limited regularity in fractional Sobolev-type spaces
- Inequalities for the perimeter of an ellipse
- On the convergence rates of Legendre approximation
- Spectral Methods
- A Comparison of “Best” Polynomial Approximations with Truncated Chebyshev Series Expansions