Algorithms for solving Hermite interpolation problems using the fast Fourier transform

DOI10.1016/J.CAM.2009.07.027zbMath1215.33009OpenAlexW2027138531MaRDI QIDQ607238

Alicia Cachafeiro, Elías Berriochoa

Publication date: 19 November 2010

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.2009.07.027

zbMATH Keywords

fast Fourier transformtrigonometric interpolationLaurent polynomialsHermite interpolationSobolev type inner products

Mathematics Subject Classification ID

Numerical interpolation (65D05) Numerical methods for discrete and fast Fourier transforms (65T50) Algorithms for approximation of functions (65D15) Numerical methods for trigonometric approximation and interpolation (65T40) Other special orthogonal polynomials and functions (33C47) Orthogonal polynomials and functions associated with root systems (33C52)

Related Items (7)

Rate of convergence of Hermite-Fejér interpolation on the unit circle ⋮ An extension of Fejér's condition for Hermite interpolation ⋮ Hermite interpolation on the unit circle considering up to the second derivative ⋮ An interpolation problem on the circle between Lagrange and Hermite problems ⋮ Some improvements to the Hermite-Fejér interpolation on the circle and bounded interval ⋮ A new kind of Hermite interpolation using non-uniform nodes on the unit circle ⋮ Gibbs-Wilbraham oscillation related to an Hermite interpolation problem on the unit circle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on mean convergence of interpolatory processes
• Fourier and barycentric formulae for equidistant Hermite trigonometric interpolation
• On general Hermite trigonometric interpolation
• Trigonometric wavelets for Hermite interpolation
• On Hermite-Birkhoff interpolation
• A note on Hermite-Fejér interpolation for the unit circle

This page was built for publication: Algorithms for solving Hermite interpolation problems using the fast Fourier transform