Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems (Q1260793)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
scientific article

    Statements

    Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems (English)
    0 references
    25 August 1993
    0 references
    General recurrences for the Padé table are presented. These recurrences form a basis for fast algorithms for non-Hermitian Toeplitz systems. Relations to continued fractions are also discussed. Numerical results are not given.
    0 references
    0 references
    recurrences
    0 references
    Padé table
    0 references
    fast algorithms
    0 references
    non-Hermitian Toeplitz systems
    0 references
    continued fractions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers