A low-order block preconditioner for saddle point linear systems
- 148 Downloads
A preconditioner is proposed for the large and sparse linear saddle point problems, which is based on a low-order three-by-three block saddle point form. The eigenvalue distribution and an upper bound of the degree of the minimal polynomial for the preconditioned matrix are discussed. Numerical results show that the optimal convergence behavior can be achieved when the new preconditioner is used to accelerate the convergence rate of Krylov subspace methods such as GMRES.
KeywordsSaddle point problem Preconditioner Eigenvalue distribution
Mathematics Subject Classification65F10 65F08 65F50
The authors would like to express their great thankfulness to the referees for the comments and constructive suggestions very much, which are valuable in improving the quality of the original paper.
- Bergen AR, Vittal V (1986) Power systems analysis. Prentice Hall, Englewood CliffsGoogle Scholar
- Brezzi F, Fortin M (1991) Mixed and hybrid finite element methods. Springer series in computational mathematics, vol 15. Springer, New YorkGoogle Scholar
- Glowinski R (1984) Numerical methods for nonlinear variational problems. Springer series in computational physics, Springer, BerlinGoogle Scholar
- Ke Y-F, Ma C-F (2016) Spectrum analysis of a more general augmentation block preconditioner for generalized saddle point matrices. BIT 56:489–500Google Scholar
- Wright SJ (1997) Primal dual interior point methods. SIAM, Philadelphia, PAGoogle Scholar