The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices (Q4702235)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1368529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices |
scientific article; zbMATH DE number 1368529 |
Statements
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices (English)
0 references
24 November 1999
0 references
algorithms
0 references
sparse matrices
0 references
maximum transversal
0 references
direct methods
0 references
iterative methods
0 references
preconditioning
0 references
reorderings
0 references
0.9802509
0 references
0.9112775
0 references
0.88468194
0 references
0.8745154
0 references
0.86206734
0 references
0.8558679
0 references
0.8465117
0 references
0.8432572
0 references
