Parallel and superfast algorithms for Hankel systems of equations (Q920570)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parallel and superfast algorithms for Hankel systems of equations
scientific article

    Statements

    Parallel and superfast algorithms for Hankel systems of equations (English)
    0 references
    0 references
    1990
    0 references
    A unified approach for the construction of inversion algorithms for Hankel matrices is discussed which contains as special cases the Levinson type algorithms, Schur type algorithm and the fast parallel methods. The approach is based on Gohberg-Semencul type formulas and works for arbitrary Hankel matrices.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Berlekamp-Masey algorithm
    0 references
    Padé approximation
    0 references
    partial realization
    0 references
    Bézoutian
    0 references
    Toeplitz matrices
    0 references
    inversion algorithms
    0 references
    Hankel matrices
    0 references
    Levinson type algorithms
    0 references
    Schur type algorithm
    0 references
    fast parallel methods
    0 references
    Gohberg-Semencul type formulas
    0 references
    0 references
    0 references