On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices (Q3806668): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0909057 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026930830 / rank | |||
Normal rank | |||
Latest revision as of 21:14, 19 March 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
