A reliable modification of the cross rule for rational Hermite interpolation
The values of a rational interpolation table can be obtained by using \textit{G. Classens'} cross rule [Numer. Math. 29, 227-231 (1978; Zbl 0375.65004)]. This rule fails if certain related values of the table are equal to each other; such neighbouring entries are combined in the so- called singular blocks. The aim of this paper is the introduction of a simple recursive algorithm for computing the values of neighbours of the singular block. This allows to compute entries in the table of rational interpolants even in the presence of singular blocks. An interesting numerical example is given.
- A new approach to the rational interpolation problem
- A useful identity for the rational Hermite interpolation table
- Continued fractions associated with the Newton-Padé table
- Ein verallgemeinerter Kettenbruch-Algorithmus zur rationalen Hermite- Interpolation
- scientific article; zbMATH DE number 46250 (Why is no real title available?)
- Note on Osculatory Rational Interpolation
- On the Newton-Padé approximation problem
- On the structure of the Newton-Padé table
- The structure of the singular solution table of the M-Padé approximation problem
This page was built for publication: A reliable modification of the cross rule for rational Hermite interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688096)