Code orderings for the solution of sparse positive definite linear systems (Q1294571)
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: Code orderings for the solution of sparse positive definite linear systems |
scientific article; zbMATH DE number 1311317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Code orderings for the solution of sparse positive definite linear systems |
scientific article; zbMATH DE number 1311317 |
Statements
Code orderings for the solution of sparse positive definite linear systems (English)
0 references
28 February 2000
0 references
preconditioning
0 references
sparse matrix factorizations
0 references
loop-free codes
0 references
high performance computing
0 references
incomplete factorizations
0 references
direct methods
0 references
implicit reordering schemes
0 references
0.7553434371948242
0 references
0.7445874810218811
0 references
