Parallel solution of symmetric positive definite systems based on decomposition into overlapping blocks (Q1395302)
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: Parallel solution of symmetric positive definite systems based on decomposition into overlapping blocks |
scientific article; zbMATH DE number 1940666
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel solution of symmetric positive definite systems based on decomposition into overlapping blocks |
scientific article; zbMATH DE number 1940666 |
Statements
Parallel solution of symmetric positive definite systems based on decomposition into overlapping blocks (English)
0 references
1 July 2003
0 references
The authors propose a parallel iterative solver for large sparse symmetric positive definite systems of linear equations based on a new convergence theory of the conjugate gradient method combined with quasioptimal preconditioning strategies. Estimates of the parallel efficiency are presented together with the results of numerical experiments conducted on serial and parallel computers.
0 references
system of linear equations
0 references
conjugate gradient method
0 references
preconditioning
0 references
sparse matrix
0 references
convergence
0 references
numerical experiments
0 references
parallel computation
0 references
0.92705894
0 references
0 references
0.9024534
0 references
0.8983186
0 references
0.8980284
0 references
0.89390594
0 references
