相关论文: Analysis of error localization of Chebyshev spectr…

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…

Spectral differentiations are basic ingredients of spectral methods. In this work, we analyze the pointwise rate of convergence of spectral differentiations for functions containing singularities and show that the deteriorations of the…

For a function that is analytic on and around an interval, Chebyshev polynomial interpolation provides spectral convergence. However, if the function has a singularity close to the interval, the rate of convergence is near one. In these…

As one myth of polynomial interpolation and quadrature, Trefethen [30] revealed that the Chebyshev interpolation of $|x-a|$ (with $|a|<1 $) at the Clenshaw-Curtis points exhibited a much smaller error than the best polynomial approximation…

In this work, we study superconvergence properties for some high-order orthogonal polynomial interpolations.The results are two-folds: When interpolating function values, we identify those points where the first and second derivatives of…

Previous works show convergence of rational Chebyshev approximants to the Pad\'e approximant as the underlying domain of approximation shrinks to the origin. In the present work, the asymptotic error and interpolation properties of rational…

Motivated by comparing the convergence behavior of Gegenbauer projections and best approximations, we study the optimal rate of convergence for Gegenbauer projections in the maximum norm. We show that the rate of convergence of Gegenbauer…

Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For…

We analyze decay of Chebyshev coefficients and local Chebyshev approximations for functions of finite regularity on finite intervals, focusing on the framework where the interval length tends to zero while the number of approximation nodes…

Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…

Based on the Hilb type formula between Jacobi polynomials and Bessel functions, optimal decay rates on Jacobi expansion coefficients are derived, by applying van der Corput type lemmas, for functions of logarithmatic singularities, which…

The constrained mock-Chebyshev least squares operator is a linear approximation operator based on an equispaced grid of points. Like other polynomial or rational approximation methods, it was recently introduced in order to defeat the Runge…

Deep unfolding is a promising deep-learning technique, whose network architecture is based on expanding the recursive structure of existing iterative algorithms. Although convergence acceleration is a remarkable advantage of deep unfolding,…

In applied mathematics, especially in optimization, functions are often only provided as so called "Black-Boxes" provided by software packages, or very complex algorithms, which make automatic differentation very complicated or even…

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…

A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of…

The Chebyshev points are commonly used for spectral differentiation in non-periodic domains. The rounding error in the Chebyshev approximation to the $n$-the derivative increases at a rate greater than $n^{2m}$ for the $m$-th derivative.…

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…

In this paper, we derive optimality conditions (Chebyshev approximation) for multivariate functions. The theory of Chebyshev (uniform) approximation for univariate functions is very elegant. The optimality conditions are based on the notion…

A scaled Chebyshev node distribution is studied in this paper. It is proved that the node distribution is optimal for interpolation in $C_M^{s+1}[-1,1]$, the set of $(s+1)$-time differentiable functions whose $(s+1)$-th derivatives are…