Abstract
Using a polynomial description of rational interpolation with prescribed poles a simple purely algebraic proof of a Neville-Aitken recurrence formula for rational interpolants with prescribed poles is presented. It is used to compute the general Cauchy-Vandermonde determinant explicitly in terms of the nodes and poles involved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Gasca, J.J. Martinez and G. Mühlbach, Computation of rational interpolants with prescribed poles, J. Comput. Appl. Math. 26 (1989) 297–309.
G. Mühlbach, Neville-Aitken algorithms for interpolation of Čebyšev-systems in the sense of Newton and in the generalized sense of Hermite, in:Theory of Approximation with Applications, eds. A.G. Law and B.N. Sahney (Academic Press, New York, 1976) pp. 200–212.
G. Mühlbach, Newton- und Hermite-Interpolation mit Čebyšev-Systemen, ZAMM 54 (1976) 200–212.
G. Mühlbach, Computation of Cauchy-Vandermonde determinants, to appear in J. Number Theory.
G. Mühlbach and L. Reimers, Linear extrapolation by rational functions, exponentials and logarithmic functions, J. Comput. Appl. Math. 17 (1987) 329–344.
J. Walsh,Interpolation and Approximation by Rational Functions in the Complex Domain, Amer. Math. Soc. Colloq. Publ. 20 (AMS, Providence, RI, 1960).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Carstensen, C., Mühlbach, G. The Neville-Aitken formula for rational interpolants with prescribed poles. Numer Algor 3, 133–141 (1992). https://doi.org/10.1007/BF02141923
Issue Date:
DOI: https://doi.org/10.1007/BF02141923