A new fast algorithm for computing the mock-Chebyshev nodes

DOI10.1016/J.APNUM.2024.03.002MaRDI QIDQ7031606zbMATH OpenFDO

Authors Bayram Ali Ibrahimoglu

Publication date 6 February 2025

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APNUM.2024.03.002

zbMATH Keywords

interpolationmock-Chebyshev pointsmock-Padua points

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Numerical interpolation (65D05)

Review text

Mock-Chebyshev points on an interval is a set of points asymptotically distributed like the Chebyshev weight of the first kind and therefore are better suited for polynomial interpolation since they result in a smaller Lebesgue constant. In a previous paper, [J. Comput. Appl. Math. 373, Article ID 112336, 9 p. (2020; Zbl 1436.41002)], the author has presented a fast \(O(n)\) algorithm to generate \(n+1\) such points. The algorithm is based on exploiting the ratio between successive distances between the points. In this paper a modification to estimate this ratio is proposed and its properties, including the associated Lebesgue constant, are analysed.\N\NIt results in a subset close to Chebyshev-Lobatto points taken from a sufficiently large set of equidistant points. The result is a stable and fast \(O(n)\) algorithm like the previous version. A review of other methods to generate mock-Chebyshev points is included and the methods are compared in the numerical simulations.\N\NAlso the bivariate case is briefly considered to compute mock-Padua points.

Cites work

• A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm
• A fast algorithm for computing the mock-Chebyshev nodes
• A new approach for constructing mock-Chebyshev grids
• Barycentric rational interpolation with no poles and high rates of approximation
• Bivariate Lagrange interpolation at the Padua points: the generating curve approach
• Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
• Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. I: Single-interval schemes
• Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. II: Multi-interval polynomial schemes and multidomain Chebyshev interpolation
• Fehlerfortpflanzung bei Interpolation
• scientific article; zbMATH DE number 4161349 (Why is no real title available?)
• scientific article; zbMATH DE number 3179593 (Why is no real title available?)
• scientific article; zbMATH DE number 194167 (Why is no real title available?)
• Impossibility of fast stable approximation of analytic functions from equispaced samples
• Lebesgue functions and Lebesgue constants in polynomial interpolation
• On a certain class of Lebesgue constants
• On the constrained mock-Chebyshev least-squares
• Polynomial interpolation via mapped bases without resampling
• Sharp bounds for Lebesgue constants of barycentric rational interpolation at equidistant points
• Spectral Methods in MATLAB
• Über empirische Funktionen und die Interpolation zwischen äquidistanten Ordinaten.

Cited in

(3)

• New results on the constrained mock-Chebyshev least squares operator
• Constrained mock-Chebyshev least squares approximation for Hermite interpolation
• A fast algorithm for computing mock-Chebyshev nodes with reduced uniform grid size

This page was built for publication: A new fast algorithm for computing the mock-Chebyshev nodes

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