• Corpus ID: 210023829

# How fast does the best polynomial approximation converge than Legendre projection?

@article{Wang2020HowFD,
title={How fast does the best polynomial approximation converge than Legendre projection?},
author={Haiyong Wang},
journal={ArXiv},
year={2020},
volume={abs/2001.01985}
}
We compare the convergence behavior of best polynomial approximations and Legendre and Chebyshev projections and derive optimal rates of convergence of Legendre projections for analytic and differentiable functions in the maximum norm. For analytic functions, we show that the best polynomial approximation of degree n is better than the Legendre projection of the same degree by a factor of n. For differentiable functions such as piecewise analytic functions and functions of fractional smoothness…

## Figures from this paper

Optimal error estimates for Legendre approximation of singular functions with limited regularity
• Mathematics
ArXiv
• 2020
This paper concerns optimal error estimates for Legendre polynomial expansions of singular functions whose regularities are naturally characterised by a certain fractional Sobolev-type space
Spectral convergence of probability densities
• A. Sagiv
• Mathematics, Computer Science
ArXiv
• 2021
This paper provides convergence rates for PDFs using colocation and Galerkin gPC methods in all dimensions, guaranteeing exponential rates for analytic maps and provides an alternative proof strategy based on optimal-transport techniques.
On the optimal rates of convergence of Gegenbauer projections
For piecewise analytic functions, it is demonstrated that the convergence rate of the Gegenbauer projection of degree $n$ is the same as that of the best approximation of the same degree when $\lambda\leq1$ and the former is slower than the latter by a factor of $n^{\lambda-1}$ when $\ lambda>1$.
Optimal error estimates for Legendre expansions of singular functions with fractional derivatives of bounded variation
• Mathematics
• 2021
A new fractional Taylor formula for singular functions whose Caputo fractional derivatives are of bounded variation is presented, which can enrich the existing theory for p and hp methods for singular problems, and answer some open questions posed in some recent literature.
Spectral convergence of probability densities for forward problems in uncertainty quantification
• A. Sagiv
• Mathematics, Computer Science
Numerische Mathematik
• 2022
. The estimation of probability density functions (PDF) using approximate maps is a fundamental building block in computational probability. We consider forward problems in uncertainty quantiﬁcation:

## References

SHOWING 1-10 OF 38 REFERENCES
On the convergence rates of Legendre approximation
• Mathematics
Math. Comput.
• 2012
The problem of the rate of convergence of Legendre approximation is considered, and explicit barycentric weights, in terms of Gauss-Legendre points and corresponding quadrature weights, are presented that allow a fast evaluation of the Legendre interpolation formula.
Sharp Error Bounds for Jacobi Expansions and Gegenbauer-Gauss Quadrature of Analytic Functions
• Mathematics
SIAM J. Numer. Anal.
• 2013
Using an argument that can recover the best estimate for the Chebyshev expansion, various new and sharp bounds of the expansion coefficients are derived, which are featured with explicit dependence of all related parameters and valid for degree $n\ge 1$.
On Error Bounds for Orthogonal Polynomial Expansions and Gauss-Type Quadrature
• S. Xiang
• Mathematics
SIAM J. Numer. Anal.
• 2012
New asymptotics on the coefficients of f(x) expanded in forms of ultraspherical or Jacobi polynomial series are presented, which imply the rate of the decay of the coefficients and derive the truncated error bounds.
On the Optimal Estimates and Comparison of Gegenbauer Expansion Coefficients
It is shown that optimal estimates for the Gegenbauer expansion coefficients can be derived, which in particular includes Legendre coefficients as a special case, which provides an illuminating insight for the comparison of the spectral methods based on Legendre and Chebyshev expansions.
A Fast Algorithm for the Evaluation of Legendre Expansions
• Computer Science
SIAM J. Sci. Comput.
• 1991
An algorithm is presented for the rapid calculation of the values and coefficients of finite Legendre series and admits far-reaching generalizations and is currently being applied to several other problems.
A Comparison of Best'' Polynomial Approximations with Truncated Chebyshev Series Expansions
Introduction. In the numerical solution of mathematical problems it is common to represent a function of a real variable by the leading terms of its infinite Chebyshev series expansion. The purpose
Optimal error estimates for Chebyshev approximations of functions with limited regularity in fractional Sobolev-type spaces
• Mathematics
Math. Comput.
• 2019
In this paper, we introduce a new theoretical framework built upon fractional Sobolev-type spaces involving Riemann-Liouville (RL) fractional integrals/derivatives, which is naturally arisen from
Some error estimates for the p -version of the finite element method
In the p-version of the finite element method the trial and test function spaces consist of piecewise polynomial functions of sufficiently high order on a coarse partition of the domain into a few
Fast polynomial transforms based on Toeplitz and Hankel matrices
• Mathematics, Computer Science
Math. Comput.
• 2018
Numerical results show that this approach is competitive with state-of-the-art techniques, requires no precomputational cost, can be implemented in a handful of lines of code, and is easily adapted to extended precision arithmetic.