The mühlbach-neville-aitken algorithm and some extensions
1980; Springer Science+Business Media; Volume: 20; Issue: 4 Linguagem: Inglês
10.1007/bf01933638
ISSN1572-9125
Autores Tópico(s)Mathematical functions and polynomials
ResumoA new proof of the Mühlbach-Neville-Aitken algorithm for interpolation by a linear family of functions forming a Chebyshev system is given. This proof is based on Sylvester's identity for determinants. The algorithm is then applied to the general interpolation problem, and applications to orthogonal polynomials and Padé-type approximants are treated. Finally the extension to rational interpolation is also studied.
Referência(s)