On the preconditioning of matrices with skew-symmetric splittings Article DOI:
Cite this article as: Golub, G.H. & Vanderstraeten, D. Numerical Algorithms (2000) 25: 223. doi:10.1023/A:1016637813615 Abstract
The rates of convergence of iterative methods with standard preconditioning techniques usually degrade when the skew-symmetric part
S of the matrix is relatively large. In this paper, we address the issue of preconditioning matrices with such large skew-symmetric parts. The main idea of the preconditioner is to split the matrix into its symmetric and skew-symmetric parts and to “invert” the (shifted) skew-symmetric matrix. Successful use of the method requires the solution of a linear system with matrix I+ S. An efficient method is developed using the normal equations, preconditioned by an incomplete orthogonal factorization.
Numerical experiments on various systems arising in physics show that the reduction in terms of iteration count compensates for the additional work per iteration when compared to standard preconditioners.
preconditioning skew-symmetry incomplete orthogonal factorization References
O. Axelsson, A survey of preconditioned iterative methods for linear systems of algebraic equations, BIT 25 (1985) 166–187.
Iterative Solution Methods
(Cambridge Univ. Press, Cambridge, 1994).
A Survey of Preconditioned Iterative Methods
(Longman Scientific & Technical, London, 1995).
P. Concus and G.H. Golub, A generalized conjugate gradient method for non-symmetric systems of linear equations, in:
Second Internat. Symposium on Computing Methods in Applied Sciences and Engineering, 1975, p. 10.
I.S. Duff, R.G. Grimes and J.G. Lewis, User's guide for the harwell-boeing sparse matrix collection, Technical Report TR/PA/92/86, CERFACS, France (1992).
M. Eiermann, W. Niethammer and R.S. Varga, Acceleration of relaxation methods for non-Hermitian linear systems, SIAM J. Math. Anal. Appl. 13 (1992) 979–991.
G.H. Golub and C.F. Van Loan,
, 3rd ed. (Johns Hopkins Univ. Press, Baltimore, MD, 1996).
G.H. Golub and A. Wathen, An iteration for indefinite systems and its application to the Navier-Stokes equations, SIAM J. Sci. Comput. 19 (1998) 530–539.
A. Jennings and M.A. Ajiz, Incomplete methods for solving
, SIAM J. Sci. Statist. Comput. 5 (1984) 978–987.
W. Niethammer and R.S. Varga, Relaxation methods for non-Hermitian linear systems, Results Math. 16 (1989) 308–320.
B. Nour Omid, W.S. Dunbar and A.D. Woodbury, Lanczos and Arnoldi methods for the solution of convection-diffusion equations, Comput. Methods Appl. Mech. Engrg. 45 (1991) 75–95.
Y. Saad, Preconditioning techniques for indefinite and nonsymmetric linear systems, J. Comput. Appl. Math. 24 (1988) 89–105.
Y. Saad, ILUT: A dual treshold incomplete ILU factorization, Numer. Linear Algebra Appl. 1 (1994) 387–402.
Iterative Methods for Sparse Linear Systems (PWS Publishing Company, 1996).
G.W. Stewart, Two algorithms for the efficient computation of truncated pivoted QR approximations of sparse matrices, Technical Report TR–98–12, Computer Science Department, University of Maryland (1998).
H.A. van der Vorst, A generalized Lanczos scheme, Math. Comp. 39 (1982) 559–561.
X. Wang, K.A. Gallivan and R. Bramley, CIMGS: An incomplete orthogonal factorization preconditioner, SIAM J. Sci. Comput. 18 (1997) 516–536.
Z. Zlatev, Comparison of two pivotal strategies in sparse plane rotations, Comput. Math. Appl. 8 (1982) 119–135.
Z. Zlatev and H.B. Nielson, Solving large and sparse linear least squares problems by conjugate gradient algorithm, Comput. Math. Appl. 15 (1988) 185–202.
Google Scholar Copyright information
© Kluwer Academic Publishers 2000