An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (Q1993591)
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: An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method |
scientific article; zbMATH DE number 6973251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method |
scientific article; zbMATH DE number 6973251 |
Statements
An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (English)
0 references
5 November 2018
0 references
bandwidth reduction
0 references
profile reduction
0 references
combinatorial optimization
0 references
heuristics
0 references
metaheuristics
0 references
reordering algorithms
0 references
sparse matrices
0 references
renumbering
0 references
ordering
0 references
graph labeling
0 references
conjugate gradient method
0 references
graph algorithm
0 references
sparse symmetric positive-definite linear systems
0 references
incomplete Cholesky factorization
0 references
0 references
0 references
0 references
0 references
0 references
0.85966945
0 references
0.8593699
0 references
0.8585035
0 references
0.8576779
0 references
0.8524652
0 references
0.8519555
0 references
0 references
0.8470841
0 references
0.8464778
0 references
