On the Complexity of Sparse Gaussian Elimination via Bordering (Q3479439)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Complexity of Sparse Gaussian Elimination via Bordering |
scientific article; zbMATH DE number 4149446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Sparse Gaussian Elimination via Bordering |
scientific article; zbMATH DE number 4149446 |
Statements
On the Complexity of Sparse Gaussian Elimination via Bordering (English)
0 references
1990
0 references
sparse Gaussian elimination
0 references
m-tree
0 references
Gaussian elimination algorithm
0 references
bordering algorithm
0 references
numerical complexity
0 references
data structures
0 references
implementation
0 references
0.7799040675163269
0 references
0.7786774039268494
0 references
0.7769708633422852
0 references
0.7734882831573486
0 references
0.7726470232009888
0 references
