A numerical study of Newton interpolation with extremely high degrees
From MaRDI portal
Publication:4568266
DOI10.14736/kyb-2018-2-0279zbMath1449.65010arXiv1609.08839OpenAlexW2963286998MaRDI QIDQ4568266
Oliver Vogel, Michael Breuß, Friedemann Kemm
Publication date: 15 June 2018
Published in: Kybernetika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.08839
Chebyshev nodespolynomial interpolationNewton interpolationinterpolation nodesfast Leja pointsLeja ordering
Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton interpolation at Leja points
- Fast Leja points
- On the evaluation of polynomial coefficients
- Adaptive Richardson iteration based on Leja points
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- On the inversion of the Vandermonde matrix
- Stability Analysis of Algorithms for Solving Confluent Vandermonde-Like Systems
- High Degree Polynomial Interpolation in Newton Form
- A practical guide to splines.
This page was built for publication: A numerical study of Newton interpolation with extremely high degrees