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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 09:24, 30 January 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
    0 references
    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

    Identifiers