A fast algorithm for computing the mock-Chebyshev nodes

DOI10.1016/j.cam.2019.07.001zbMath1436.41002OpenAlexW2954651625WikidataQ127524730 ScholiaQ127524730MaRDI QIDQ1989186

Bayram Ali Ibrahimoglu

Publication date: 24 April 2020

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2019.07.001

zbMATH Keywords

interpolationRunge phenomenonmock-Chebyshev interpolation

Mathematics Subject Classification ID

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

Related Items

Product integration rules by the constrained mock-Chebyshev least squares operator ⋮ Generalizations of the constrained mock-Chebyshev least squares in two variables: tensor product vs total degree polynomial interpolation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lebesgue functions and Lebesgue constants in polynomial interpolation
• On the constrained mock-Chebyshev least-squares
• On the optimal Lebesgue constants for polynomial interpolation
• Exponentially-convergent strategies for defeating the Runge phenomenon for the approximation of non-periodic functions. II: Multi-interval polynomial schemes and multidomain Chebyshev interpolation
• 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
• Fehlerfortpflanzung bei Interpolation
• On certain multivariate Vandermonde determinants whose variables separate
• Auswertung der Normen von Interpolationsoperatoren
• Optimal Lebesgue Constant for Lagrange Interpolation
• On a certain class of Lebesgue constants