Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2014, Article ID 237808, 11 pages
Research Article

Some Generalizations and Modifications of Iterative Methods for Solving Large Sparse Symmetric Indefinite Linear Systems

1Department of Mathematics, National Kaohsiung Normal University, Kaohsiung 824, Taiwan
2Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX 78712, USA

Received 27 November 2013; Revised 10 January 2014; Accepted 4 February 2014; Published 3 April 2014

Academic Editor: Chi-Ming Chen

Copyright © 2014 Yu-Chien Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We discuss a variety of iterative methods that are based on the Arnoldi process for solving large sparse symmetric indefinite linear systems. We describe the SYMMLQ and SYMMQR methods, as well as generalizations and modifications of them. Then, we cover the Lanczos/MSYMMLQ and Lanczos/MSYMMQR methods, which arise from a double linear system. We present pseudocodes for these algorithms.