Constrained mock-Chebyshev least squares approximation for Hermite interpolation
Abstract This paper addresses the challenge of function approximation using Hermite interpolation on equally spaced nodes. In this setting, standard polynomial interpolation suffers from the Runge phenomenon. To mitigate this issue, we propose an extension of the constrained mock-Chebyshev least squares approximation technique to Hermite interpolation. This approach leverages both function and derivative evaluations, resulting in more accurate approximations. Numerical experiments are implemented in order to illustrate the effectiveness of the proposed method.
Authors
- Federico Nudo (ORCID: https://orcid.org/0000-0003-4418-3817)
- Francesco Dell’Accio (ORCID: https://orcid.org/0000-0003-4879-894X)
- Francisco Marcellán (ORCID: https://orcid.org/0000-0003-4331-4475)
Institutions
- University of Padua (IT)
- Istituto per le Applicazioni del Calcolo Mauro Picone (IT)
- National Research Council (IT)
- University of Calabria (IT)
- Universidad Carlos III de Madrid (ES)
Publication Details
- Journal
- Numerical Algorithms
- Published
- 2025-03-22
- DOI
- https://doi.org/10.1007/s11075-025-02051-7
- Citations
- 3
- Primary Topic
- Advanced Numerical Analysis Techniques
- Type
- article
- Field-Weighted Citation Impact
- 4.00