An error-free Levison algorithm to solve integer Toeplitz system (Q1322894): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Willy Govaerts / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Willy Govaerts / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0096-3003(94)90043-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988973262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast inversion algorithms of Toeplitz-plus-Hankel matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Inversion of Finite Toeplitz Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving equations exactly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735040 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:43, 22 May 2024

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
    0 references