Ein Algorithmus zur Rationalen Interpolation
In this paper an algorithm for the rational interpolation is proposed that avoids the pitfalls of having to divide by zero in calculating the inverse difference quotients. It also helps to detect unattainable points. The resulting function is a general continued fraction and it is evaluated by a Homer-scheme just as a polynomial or an (ordinary) continued fraction.
Unable to display preview. Download preview PDF.
- Haverkamp, R.: Beiträge zur Stetigkeit rationaler Interpolierender. Habilitationsschrift Münster 1977Google Scholar
- Meinguet, J.: On the solubility of the Cauchy interpolation problem. In Approximation theory, ed. by A. Talbot, London and New York, Academic Press 1970, p. 137–163Google Scholar
- Perron, O.: Die Lehre von den Kettenbrüchen. Band 1, Stuttgart, B.G. Teubner 1954Google Scholar
- Thacher, H.C.: Private mündliche Mitteilung im Aug. 1973Google Scholar