Conference item
Approximate factorization constraint preconditioners for saddle-point matrices
- Abstract:
- We consider the application of the conjugate gradient method to the solution of large, symmetric indefinite linear systems. Special emphasis is put on the use of constraint preconditioners and a new factorization that can reduce the number of flops required by the preconditioning step. Results concerning the eigenvalues of the preconditioned matrix and its minimum polynomial are given. Numerical experiments validate these conclusions. © 2006 Society for Industrial and Applied Mathematics.
- Publication status:
- Published
Actions
Authors
Bibliographic Details
- Volume:
- 27
- Issue:
- 5
- Pages:
- 1555-1572
- Host title:
- SIAM JOURNAL ON SCIENTIFIC COMPUTING
- Publication date:
- 2006-01-01
- DOI:
- EISSN:
-
1095-7197
- ISSN:
-
1064-8275
- Source identifiers:
-
188319
Item Description
- Keywords:
- Pubs id:
-
pubs:188319
- UUID:
-
uuid:639192e7-e675-409a-8f3e-498a39c088ca
- Local pid:
- pubs:188319
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2006
If you are the owner of this record, you can report an update to it here: Report update to this record