A low-order block preconditioner for saddle point linear systems (Q725823)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6912498
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A low-order block preconditioner for saddle point linear systems |
scientific article; zbMATH DE number 6912498 |
Statements
A low-order block preconditioner for saddle point linear systems (English)
0 references
2 August 2018
0 references
The paper considers solution of large sparse saddle point problems. A new preconditioner for Krylov subspace methods (e.g. GMRES) is proposed, based on describing formally the system matrix as a 3 by 3 block structured one. Then, some spectral properties of the preconditioned matrix are derived. In particular, eigenvalue distribution is studied. Furthermore, an upper bound for the degree of the minimal polynomial is provided. Based on the numerical examples, the new preconditioner can outperform other preconditioners such as HSS, RHSS, etc.
0 references
saddle point problem
0 references
block preconditioner
0 references
eigenvalue distribution
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8507322669029236
0 references
0.845950186252594
0 references
0.8424825072288513
0 references
0.8406679034233093
0 references
0.8364306688308716
0 references
