Abstract
We present a class of new preconditioners based on the incomplete Givens orthogonalization (IGO) methods for solving large sparse systems of linear equations. In the new methods, instead of dropping entries and accepting fill-ins according to the magnitudes of values and the sparsity patterns, we adopt a diagonal compensation strategy, in which the dropped entries are re-used by adding to the main diagonal entries of the same rows of the incomplete upper-triangular factors, possibly after suitable relaxation treatments, so that certain constraints on the preconditioning matrices are further satisfied. This strategy can make the computed preconditioning matrices possess certain desired properties, e.g., having the same weighted row sums as the target matrices. Theoretical analysis shows that these modified incomplete Givens orthogonalization (MIGO) methods can preserve certain useful properties of the original matrix, and numerical results are used to verify the stability, the accuracy, and the efficiency of the MIGO methods employed to precondition the Krylov subspace iteration methods such as GMRES. Both theoretical and numerical studies show that the MIGO methods may have the potential to present high-quality preconditioners for large sparse nonsymmetric matrices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Axelsson O (1997) Iterative solution methods. Cambridge University Press, Cambridge
Bai Z-Z (2000) Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems. Appl Math Comput 109: 273–285
Bai Z-Z, Duff IS, Wathen AJ (2001) A class of incomplete orthogonal factorization methods I: methods and theories. BIT Numer Math 41: 53–70
Bai Z-Z, Duff IS, Yin J-F (2009) Numerical study on incomplete orthogonal factorization preconditioners. J Comput Appl Math 226: 22–41
Bai Z-Z, Golub GH, Ng MK (2003) Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAM J Matrix Anal Appl 24: 603–626
Bai Z-Z, Jin C-H (2003) Column-decomposed relaxation methods for the overdetermined systems of linear equations. Intern J Appl Math 13: 71–82
Bai Z-Z, Li G-Q, Lu L-Z (2004) Combinative preconditioners of modified incomplete Cholesky factorization and Sherman-Morrison-Woodbury update for self-adjoint elliptic Dirichlet-periodic boundary value problems. J Comput Math 22: 833–856
Bai Z-Z, Yin J-F, Su Y-F (2006) A shift-splitting preconditioner for non-Hermitian positive definite matrices. J Comput Math 24: 539–552
Bai Z-Z, Zhang S-L (2002) A regularized conjugate gradient method for symmetric positive definite system of linear equations. J Comput Math 20: 437–448
Björck A (1996) Numerical methods for least squares problems. SIAM, Philadelphia
Duff IS, Erisman AM, Reid JK (1986) Direct methods for sparse matrices. Oxford University Press, London
Dupont T, Kendall R, Rachford HH Jr (1968) An approximate factorization procedure for solving selfadjoint elliptic difference equations. SIAM J Numer Anal 5: 559–573
Golub GH, van Loan CF (1996) Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore and London
Gustafsson I (1978) A class of first order factorization methods. BIT Numer Math 18: 142–156
Manteuffel TA (1980) An incomplete factorization technique for positive definite linear systems. Math Comput 34: 473–497
Matrix Market, http://math.nist.gov/MatrixMarket/data/, Test Matrices Database Maintained by NIST, Gaithersburg, MD
Meijerink JA, van der Vorst HA (1977) An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math Comput 31: 148–162
Meijerink JA, van der Vorst HA (1981) Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems. J Comput Phys 44: 134–155
Papadopoulos AT, Duff IS, Wathen AJ (2005) A class of incomplete orthogonal factorization methods. II: implementation and results. BIT Numer Math 45: 159–179
Saad Y (1988) Preconditioning techniques for nonsymmetric and indefinite linear systems. J Comput Appl Math 24: 89–105
Saad Y (1994) ILUT: a dual threshold incomplete ILU factorization. Numer Linear Algebra Appl 1: 387–402
Saad Y (1996) Iterative methods for sparse linear systems. PWS Publishing Company, Boston
Saad Y, Schultz MH (1986) GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J Sci Stat Comput 7: 856–869
Saylor P (1974) Second order strongly implicit symmetric factorization methods for the solution of elliptic difference equations. SIAM J Numer Anal 11: 894–908
Stone HL (1968) Iterative solution of implicit approximations of multidimensional partial differential equations. SIAM J Numer Anal 5: 530–558
van der Vorst HA (2003) Iterative Krylov methods for large linear systems. Cambridge University Press, Cambridge
Wang X-G, Gallivan KA, Bramley R (1997) CIMGS: an incomplete orthogonal factorization preconditioner. SIAM J Sci Comput 18: 516–536
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by C.C. Douglas.
Z.-Z. Bai was supported by The National Basic Research Program (No. 2005CB321702), The China Outstanding Young Scientist Foundation (No. 10525102) and The National Natural Science Foundation (No. 10471146), P.R. China.
Rights and permissions
About this article
Cite this article
Bai, ZZ., Yin, JF. Modified incomplete orthogonal factorization methods using Givens rotations. Computing 86, 53–69 (2009). https://doi.org/10.1007/s00607-009-0065-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-009-0065-4