The Role of Elimination Trees in Sparse Factorization (Q3474026): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0611010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077309453 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:01, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Role of Elimination Trees in Sparse Factorization |
scientific article |
Statements
The Role of Elimination Trees in Sparse Factorization (English)
0 references
1990
0 references
sparse matrix
0 references
Cholesky factor
0 references
reordering
0 references
symbolic factorization
0 references
numerical factorization
0 references
elimination trees
0 references
large sparse matrix factorization
0 references
intersection graph representation of chordal graphs
0 references
