- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 489295, 6 pages
A Parameterized Splitting Preconditioner for Generalized Saddle Point Problems
1School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China
2Key Laboratory of Numerical Simulation of Sichuan Province University, Neijiang Normal University, Neijiang, Sichuan 641112, China
Received 4 January 2013; Revised 31 March 2013; Accepted 1 April 2013
Academic Editor: P. N. Shivakumar
Copyright © 2013 Wei-Hua Luo and Ting-Zhu Huang. 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.
By using Sherman-Morrison-Woodbury formula, we introduce a preconditioner based on parameterized splitting idea for generalized saddle point problems which may be singular and nonsymmetric. By analyzing the eigenvalues of the preconditioned matrix, we find that when α is big enough, it has an eigenvalue at 1 with multiplicity at least , and the remaining eigenvalues are all located in a unit circle centered at 1. Particularly, when the preconditioner is used in general saddle point problems, it guarantees eigenvalue at 1 with the same multiplicity, and the remaining eigenvalues will tend to 1 as the parameter . Consequently, this can lead to a good convergence when some GMRES iterative methods are used in Krylov subspace. Numerical results of Stokes problems and Oseen problems are presented to illustrate the behavior of the preconditioner.
In some scientific and engineering applications, such as finite element methods for solving partial differential equations [1, 2], and computational fluid dynamics [3, 4], we often consider solutions of the generalized saddle point problems of the form where , , and are positive semidefinite, , and . When , (1) is a general saddle point problem which is also a researching object for many authors.
It is well known that when the matrices , and are large and sparse, the iterative methods are more efficient and attractive than direct methods assuming that (1) has a good preconditioner. In recent years, a lot of preconditioning techniques have arisen for solving linear system; for example, Saad  and Chen  have comprehensively surveyed some classical preconditioning techniques, including ILU preconditioner, triangular preconditioner, SPAI preconditioner, multilevel recursive Schur complements preconditioner, and sparse wavelet preconditioner. Particularly, many preconditioning methods for saddle problems have been presented recently, such as dimensional splitting (DS) , relaxed dimensional factorization (RDF) , splitting preconditioner , and Hermitian and skew-Hermitian splitting preconditioner .
Among these results, Cao et al.  have used splitting idea to give a preconditioner for saddle point problems where the matrix is symmetric and positive definite and is of full row rank. According to his preconditioner, the eigenvalues of the preconditioned matrix would tend to 1 when the parameter . Consequently, just as we have seen from those examples of , preconditioner has guaranteed a good convergence when some iterative methods were used.
In this paper, being motivated by , we use the splitting idea to present a preconditioner for the system (1), where may be nonsymmetric and singular (when ). We find that, when the parameter is big enough, the preconditioned matrix has the eigenvalue at 1 with multiplicity at least , and the remaining eigenvalues are all located in a unit circle centered at 1. Particularly, when the precondidtioner is used in some general saddle point problems (namely, ), we see that the multiplicity of the eigenvalue at 1 is also at least , but the remaining eigenvalues will tend to 1 as the parameter .
The remainder of the paper is organized as follows. In Section 2, we present our preconditioner based on the splitting idea and analyze the bound of eigenvalues of the preconditioned matrix. In Section 3, we use some numerical examples to show the behavior of the new preconditioner. Finally, we draw some conclusions and outline our future work in Section 4.
2. A Parameterized Splitting Preconditioner
Now we consider using splitting idea with a variable parameter to present a preconditioner for the system (1).
Firstly, it is evident that when , the system (1) is equivalent to Let Then the coefficient matrix of (2) can be expressed by . Multiplying both sides of system (2) from the left with matrix , we have Hence, we obtain a preconditioned linear system from (1) using the idea of splitting and the corresponding preconditioner is Now we analyze the eigenvalues of the preconditioned system (4).
Theorem 1. The preconditioned matrix has an eigenvalue at 1 with multiplicity at least . The remaining eigenvalues satisfy where , and satisfies
we can easily get
which implies the preconditioned matrix has an eigenvalue at 1 with multiplicity at least .
For the remaining eigenvalues, let with ; then we have By multiplying both sides of this equality from the left with , we can get
This completes the proof of Theorem 1.
Remark 2. From Theorem 1, we can get that when parameter is big enough, the modulus of nonnil eigenvalues will be located in interval .
Remark 3. In Theorem 1, if the matrix , then for nonnil eigenvalues we have
Figures 1, 2, and 3 are the eigenvalues plots of the preconditioned matrices obtained with our preconditioner. As we can see in the following numerical experiments, this good phenomenon is useful for accelerating convergence of iterative methods in Krylov subspace.
Additionally, for the purpose of practically executing our preconditioner we should efficiently deal with the computation of . This can been tackled by the well-known Sherman-Morrison-Woodbury formula: where , and are invertible matrices, , and are any matrices, and are any positive integers.
3. Numerical Examples
In this section, we give numerical experiments to illustrate the behavior of our preconditioner. The numerical experiments are done by using MATLAB 7.1. The linear systems are obtained by using finite element methods in the Stokes problems and steady Oseen problems, and they are respectively the cases of(1), which is caused by using Q2-Q1 FEM;(2), which is caused by using Q1-P0 FEM.
Furthermore, we compare our preconditioner with that of  in the case of general saddle point problems (namely, ). For the general saddle point problem,  has presented the preconditioner with as a parameter and has proved that when is symmetric positive definite, the preconditioned matrix has an eigenvalue 1 with multiplicity at , and the remaining eigenvalues satisfy where , are positive singular values of the matrix .
All these systems can be generalized by using IFISS software package  (this is a free package that can be downloaded from the site http://www.maths.manchester.ac.uk/~djs/ifiss/). We use restarted GMRES(20) as the Krylov subspace method, and we always take a zero initial guess. The stopping criterion is where is the residual vector at the th iteration.
In the whole course of computation, we always replace in (14) with (16) and use the factorization of to tackle , where is a corresponding vector in the iteration. Concretely, let ; then we complete the matrix-vector product by in MATLAB term. In the following tables, the denotation norm (, fro) means the Frobenius form of the matrix . The total time is the sum of LU time and iterative time, and the LU time is the time to compute LU factorization of .
From Tables 1, 2, 3, 4, 5, 6, 7, and 8 we can see that these results are in agreement with the theoretical analyses (13) and (19), respectively. Additionally, comparing with the results in Tables 9, 10, 11, and 12, we find that, although the iterations used in Case 1 (either for the preconditioner of  or our preconditioner) are less than those in Case 2, the time spent by Case 1 is much more than that of Case 2. This is because the density of the coefficient matrix generalized by Q2-Q1 FEM is much larger than that generalized by Q1-P0 FEM. This can be partly illustrated by Tables 13 and 14, and the others can be illustrated similarly.
In this paper, we have introduced a splitting preconditioner for solving generalized saddle point systems. Theoretical analysis showed the modulus of eigenvalues of the preconditioned matrix would be located in interval when the parameter is big enough. Particularly when the submatrix , the eigenvalues will tend to 1 as the parameter . These performances are tested by some examples, and the results are in agreement with the theoretical analysis.
There are still some future works to be done: how to properly choose a parameter so that the preconditioned matrix has better properties? How to further precondition submatrix to improve our preconditioner?
The authors would express their great thankfulness to the referees and the editor Professor P. N. Shivakumar for their helpful suggestions for revising this paper. The authors would like to thank H. C. Elman, A. Ramage, and D. J. Silvester for their free IFISS software package. This research is supported by Chinese Universities Specialized Research Fund for the Doctoral Program (20110185110020), Sichuan Province Sci. & Tech. Research Project (2012GZX0080), and the Fundamental Research Funds for the Central Universities.
- F. Brezzi and M. Fortin, Mixed and Hybrid Finite Element Methods, vol. 15 of Springer Series in Computational Mathematics, Springer, New York, NY, USA, 1991.
- Z. Chen, Q. Du, and J. Zou, “Finite element methods with matching and nonmatching meshes for Maxwell equations with discontinuous coefficients,” SIAM Journal on Numerical Analysis, vol. 37, no. 5, pp. 1542–1570, 2000.
- H. C. Elman, D. J. Silvester, and A. J. Wathen, Finite Elements and Fast Iterative Solvers: With Applications in Incompressible Fluid Dynamics, Numerical Mathematics and Scientific Computation, Oxford University Press, New York, NY, USA, 2005.
- C. Cuvelier, A. Segal, and A. A. van Steenhoven, Finite Element Methods and Navier-Stokes Equations, vol. 22 of Mathematics and its Applications, D. Reidel, Dordrecht, The Netherlands, 1986.
- Y. Saad, Iterative Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 2nd edition, 2003.
- K. Chen, Matrix Preconditioning Techniques and Applications, vol. 19 of Cambridge Monographs on Applied and Computational Mathematics, Cambridge University Press, Cambridge, UK, 2005.
- M. Benzi and X.-P. Guo, “A dimensional split preconditioner for Stokes and linearized Navier-Stokes equations,” Applied Numerical Mathematics, vol. 61, no. 1, pp. 66–76, 2011.
- M. Benzi, M. Ng, Q. Niu, and Z. Wang, “A relaxed dimensional factorization preconditioner for the incompressible Navier-Stokes equations,” Journal of Computational Physics, vol. 230, no. 16, pp. 6185–6202, 2011.
- Y. Cao, M.-Q. Jiang, and Y.-L. Zheng, “A splitting preconditioner for saddle point problems,” Numerical Linear Algebra with Applications, vol. 18, no. 5, pp. 875–895, 2011.
- V. Simoncini and M. Benzi, “Spectral properties of the Hermitian and skew-Hermitian splitting preconditioner for saddle point problems,” SIAM Journal on Matrix Analysis and Applications, vol. 26, no. 2, pp. 377–389, 2004.
- H. C. Elman, A. Ramage, and D. J. Silvester, “Algorithm 886: IFISS, a Matlab toolbox for modelling incompressible flow,” ACM Transactions on Mathematical Software, vol. 33, no. 2, article 14, 2007.