An error-free Levison algorithm to solve integer Toeplitz system (Q1322894)

From MaRDI portal
Revision as of 13:13, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An error-free Levison algorithm to solve integer Toeplitz system
scientific article

    Statements

    An error-free Levison algorithm to solve integer Toeplitz system (English)
    0 references
    0 references
    9 October 1994
    0 references
    The author proposes to avoid the numerical instabilities in the Levinson algorithm for nonsymmetric Toeplitz systems by using exact arithmetic. To avoid very long integers he recommends to use modulo arithmetic. The computations can be carried out in parallel for several (or all desired) residual classes. The paper contains no explicit examples with large Toeplitz systems.
    0 references
    0 references
    0 references
    0 references
    0 references
    error-free Levison algorithm
    0 references
    integer Toeplitz system
    0 references
    numerical instabilities
    0 references
    Levinson algorithm
    0 references
    nonsymmetric Toeplitz systems
    0 references
    exact arithmetic
    0 references
    modulo arithmetic
    0 references