Search from over 60,000 research works

Advanced Search

Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners

[thumbnail of pivot_R3_nlaa.pdf]
Preview
pivot_R3_nlaa.pdf - Accepted Version (403kB) | Preview
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Scott, J. orcid id iconORCID: https://orcid.org/0000-0003-2130-1091 and Tuma, M. (2017) Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners. Numerical Linear Algebra with Applications, 24 (5). e2099. ISSN 1099-1506 doi: 10.1002/nla.2099

Abstract/Summary

Sparse symmetric indefinite linear systems of equations arise in numerous practical applications. In many situations, an iterative method is the method of choice but a preconditioner is normally required for it to be effective. In this paper, the focus is on a class of incomplete factorization algorithms that can be used to compute preconditioners for symmetric indefinite systems. A limited memory approach is employed that incorporates a number of new ideas with the goal of improving the stability, robustness and efficiency of the preconditioner. These include the monitoring of stability as the factorization proceeds and the incorporation of pivot modifications when potential instability is observed. Numerical experiments involving test problems arising from a range of real-world applications demonstrate the effectiveness of our approach.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/70341
Item Type Article
Refereed Yes
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
Publisher John Wiley and Sons
Download/View statistics View download statistics for this item

Downloads

Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar