A reliable modification of the cross rule for rational Hermite interpolation (Q688096): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Ein verallgemeinerter Kettenbruch-Algorithmus zur rationalen Hermite- Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the singular solution table of the M-Padé approximation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Newton-Padé approximation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the Newton-Padé table / rank
 
Normal rank
Property / cites work
 
Property / cites work: A useful identity for the rational Hermite interpolation table / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continued fractions associated with the Newton-Padé table / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Osculatory Rational Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the rational interpolation problem / rank
 
Normal rank

Latest revision as of 11:33, 22 May 2024

scientific article
Language Label Description Also known as
English
A reliable modification of the cross rule for rational Hermite interpolation
scientific article

    Statements

    A reliable modification of the cross rule for rational Hermite interpolation (English)
    0 references
    0 references
    0 references
    14 December 1993
    0 references
    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.
    0 references
    rational interpolation table
    0 references
    cross rule
    0 references
    singular blocks
    0 references
    recursive algorithm
    0 references
    numerical example
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references