Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices (Q679264): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Yu.S.Eidel'man / rank
Normal rank
 
Property / author
 
Property / author: Israel Gohberg / rank
Normal rank
 
Property / author
 
Property / author: Yu.S.Eidel'man / rank
 
Normal rank
Property / author
 
Property / author: Israel Gohberg / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity algorithms for semiseparable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time varying linear systems with boundary conditions and integral operators. I: The transfer operator and its properties / rank
 
Normal rank

Latest revision as of 11:15, 27 May 2024

scientific article
Language Label Description Also known as
English
Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices
scientific article

    Statements

    Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices (English)
    0 references
    2 September 1997
    0 references
    Sums of diagonal and semiseparable matrices belong to the class of structured matrices which arises in numerical applications. Fast \(O(N)\) algorithms for their inversion were developed earlier under additional restrictions which were a source of instability. For semiseparable matrices of order one these restrictions are eliminated.
    0 references
    inversion formulas
    0 references
    linear complexity algorithm
    0 references
    semiseparable matrices
    0 references
    0 references
    0 references

    Identifiers