Generalizations of the constrained mock-Chebyshev least squares in two variables: tensor product vs total degree polynomial interpolation
From MaRDI portal
Publication:2060814
DOI10.1016/j.aml.2021.107732zbMath1487.65016MaRDI 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
Chebyshev-Lobatto nodes; mock-Chebyshev interpolation; constrained least squares; mock-Padua interpolation; tensor product interpolation
Related Items
Padua points and fake nodes for polynomial approximation: old, new and open problems, Polynomial mapped bases: theory and applications, High-degree splines from discrete Fourier transforms: robust methods to obtain the boundary conditions, 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