A look-ahead Bareiss algorithm for general Toeplitz matrices (Q1338823): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s002110050047 / 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.1007/s002110050047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983688021 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S002110050047 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:22, 10 December 2024

scientific article
Language Label Description Also known as
English
A look-ahead Bareiss algorithm for general Toeplitz matrices
scientific article

    Statements

    A look-ahead Bareiss algorithm for general Toeplitz matrices (English)
    0 references
    0 references
    21 November 1994
    0 references
    A look-ahead version of the Bareiss algorithm for the solution of Toeplitz systems is presented. The look-ahead procedure allows to treat Toeplitz systems with singular or ill-conditioned principal submatrices. Special versions for Hermitian indefinite or banded Toeplitz systems are also discussed.
    0 references
    Toeplitz matrix
    0 references
    look-ahead methods
    0 references
    fast inversion
    0 references
    Bareiss algorithm
    0 references
    ill-conditioned
    0 references
    banded Toeplitz systems
    0 references

    Identifiers