A new approach for constructing mock-Chebyshev grids

DOI10.1002/MMA.7741MaRDI QIDQ5015696zbMATH OpenOpenAlexFDO

Authors Bayram Ali Ibrahimoglu

Publication date 9 December 2021

Published in Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/mma.7741

zbMATH Keywords

mock-Chebyshev nodespolynomial interpolationRunge phenomenon

Mathematics Subject Classification ID

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

Recommendations

• A fast algorithm for computing the mock-Chebyshev nodes
• On the constrained mock-Chebyshev least-squares
• Divergence (Runge phenomenon) for least-squares polynomial approximation on an equispaced grid and mock-Chebyshev subset interpolation
• Generalizations of the constrained mock-Chebyshev least squares in two variables: tensor product vs total degree polynomial interpolation
• Chebyshev interpolation with approximate nodes of unrestricted multiplicity

Cited in

(8)

• A fast algorithm for computing the mock-Chebyshev nodes
• Generalizations of the constrained mock-Chebyshev least squares in two variables: tensor product vs total degree polynomial interpolation
• Constrained mock-Chebyshev least squares quadrature
• Product integration rules by the constrained mock-Chebyshev least squares operator
• Polynomial approximation of derivatives by the constrained mock-Chebyshev least squares operator
• New results on the constrained mock-Chebyshev least squares operator
• A new fast algorithm for computing the mock-Chebyshev nodes
• A fast algorithm for computing mock-Chebyshev nodes with reduced uniform grid size

This page was built for publication: A new approach for constructing mock-Chebyshev grids

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