On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices (Q3806668)

From MaRDI portal
Revision as of 21:14, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
scientific article

    Statements

    On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices (English)
    0 references
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    ordering algorithms
    0 references
    numerical stability
    0 references
    Gaussian elimination with partial pivoting
    0 references
    QR factorization
    0 references
    finite- element matrices
    0 references
    0 references