Comparisons of best approximations with Chebyshev expansions for functions with logarithmic endpoint singularities

From MaRDI portal
Publication:6076944

DOI10.1007/S11075-023-01538-5arXiv2108.03836OpenAlexW4379881598MaRDI QIDQ6076944FDOQ6076944


Authors: Xiaolong Zhang Edit this on Wikidata


Publication date: 17 October 2023

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: The best polynomial approximation and Chebyshev approximation are both important in numerical analysis. In tradition, the best approximation is regarded as more better than the Chebyshev approximation, because it is usually considered in the uniform norm. However, it not always superior to the latter noticed by Trefethen cite{Trefethen11sixmyths,Trefethen2020} for the algebraic singularity function. Recently Wang cite{Wang2021best} have proved it in theory. In this paper, we find that for the functions with logarithmic regularities, the pointwise errors of Chebyshev approximation are smaller than the ones of the best approximations except only in the very narrow boundaries at the same degree. The pointwise error for Chebyshev series, truncated at the degree n is O(nkappa) (kappa=min2gamma+1,2delta+1), but is worse by one power of n in narrow boundary layer near the weak singular endpoints. Theorems are given to explain this effect.


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




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Comparisons of best approximations with Chebyshev expansions for functions with logarithmic endpoint singularities

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