Estimation of conflict-free matrix product preconditioner on vector supercomputers (Q1294595)
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: Estimation of conflict-free matrix product preconditioner on vector supercomputers |
scientific article; zbMATH DE number 1311335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimation of conflict-free matrix product preconditioner on vector supercomputers |
scientific article; zbMATH DE number 1311335 |
Statements
Estimation of conflict-free matrix product preconditioner on vector supercomputers (English)
0 references
2 September 1999
0 references
The author examines two classes of preconditioners for nonsymmetric linear systems arising from second-order difference discretization of non-selfadjoint elliptic partial differential equations. It is found that the standard ILU and MILU preconditioners suffer from degradation of performance and are sensitive to a choice to the number of grid points. The present matrix product preconditioner has good convergence property at the case of its performance.
0 references
conjugate gradient method
0 references
nonsymmetric linear systems
0 references
matrix product preconditioner
0 references
convergence
0 references
0.8025258779525757
0 references
0.7655844688415527
0 references
0.7639390826225281
0 references
0.7597942352294922
0 references
