Arithmetic Complexity Of Direct Solvers For Banded Systems (Q4807699): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The choleski Q.I.F. algorithm for solving symmetric linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4106692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5516422 / rank
 
Normal rank

Latest revision as of 16:03, 5 June 2024

scientific article; zbMATH DE number 1916530
Language Label Description Also known as
English
Arithmetic Complexity Of Direct Solvers For Banded Systems
scientific article; zbMATH DE number 1916530

    Statements

    Arithmetic Complexity Of Direct Solvers For Banded Systems (English)
    0 references
    0 references
    0 references
    6 October 2003
    0 references
    LU-factorization
    0 references
    Cholesky factorization
    0 references
    banded systems
    0 references
    arithmetic complexity
    0 references
    partial pivoting
    0 references
    root-free symmetric elimination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers