On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices (Q3806668): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:38, 5 February 2024
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
1988
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
