A scalable parallel algorithm for incomplete factor preconditioning (Q2719261)
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: A scalable parallel algorithm for incomplete factor preconditioning |
scientific article; zbMATH DE number 1608921
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A scalable parallel algorithm for incomplete factor preconditioning |
scientific article; zbMATH DE number 1608921 |
Statements
21 June 2001
0 references
incomplete factorization
0 references
preconditioning
0 references
numerical examples
0 references
parallel computation
0 references
incomplete LU-factorization
0 references
algorithm
0 references
graph partitioning
0 references
two-level ordering strategy
0 references
0.9213966
0 references
0.91954553
0 references
0.91864634
0 references
0.91362554
0 references
0.9122741
0 references
0.9096414
0 references
0.90832824
0 references
0.9081636
0 references
A scalable parallel algorithm for incomplete factor preconditioning (English)
0 references
The paper deals with a parallel algorithm for computing incomplete factor preconditioners. It is shown that the algorithm attains a high degree of parallelism through graph partitioning and a two-level ordering strategy. Adequate experimental results are presented.
0 references
