Generalizations of the constrained mock-Chebyshev least squares in two variables: tensor product vs total degree polynomial interpolation

DOI10.1016/j.aml.2021.107732zbMath1487.65016OpenAlexW3207260881MaRDI QIDQ2060814

F. Di Tommaso, Federico Nudo, Francesco Dell'Accio

Publication date: 13 December 2021

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2021.107732

zbMATH Keywords

Chebyshev-Lobatto nodesmock-Chebyshev interpolationconstrained least squaresmock-Padua interpolationtensor product interpolation

Mathematics Subject Classification ID

Numerical interpolation (65D05) Approximation by polynomials (41A10)

Related Items

Polynomial mapped bases: theory and applications ⋮ High-degree splines from discrete Fourier transforms: robust methods to obtain the boundary conditions ⋮ Padua points and fake nodes for polynomial approximation: old, new and open problems ⋮ Constrained mock-Chebyshev least squares quadrature ⋮ Product integration rules by the constrained mock-Chebyshev least squares operator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the constrained mock-Chebyshev least-squares
• 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
• A fast algorithm for computing the mock-Chebyshev nodes
• Treating the Gibbs phenomenon in barycentric rational interpolation and approximation via the S-Gibbs algorithm
• Polynomial interpolation via mapped bases without resampling
• Bivariate Lagrange interpolation at the Padua points: The ideal theory approach
• Uniform weighted approximation on the square by polynomial interpolation at Chebyshev nodes
• Multivariate approximation at fake nodes
• On the Gibbs Phenomenon and Its Resolution