An alternating LHSS preconditioner for saddle point problems

Liu Qingbing
August 2012
Computational & Applied Mathematics;2012, Vol. 31 Issue 2, p339
Academic Journal
In this paper, we present a new alternating local Hermitian and skew-Hermitian Splitting preconditioner for solving saddle point problems. The spectral property of the preconditioned matrices is studies in detail. Theoretical results show all eigenvalues of the preconditioned matrices will generate two tight clusters, one is near (0, 0) and the other is near (2, 0) as the iteration parameter tends to zero from positive. Numerical experiments are given to validate the performances of the preconditioner.


Related Articles

  • Spectral Properties of the Iteration Matrix of the HSS Method for Saddle Point Problem. Qun-Fa Cui; Cui-Xia Li; Shi-LiangWu // Mathematical Problems in Engineering;2014, p1 

    We discuss spectral properties of the iteration matrix of the HSS method for saddle point problems and derive estimates for the region containing both the nonreal and real eigenvalues of the iteration matrix of the HSS method for saddle point problems.

  • PRECONDITIONED HSS-LIKE ITERATIVE METHOD FOR SADDLE POINT PROBLEMS. Qingbing Liu; Guoliang Chen; Caiqin Song // Journal of Computational Mathematics;2014, Vol. 32 Issue 4, p442 

    A new HSS-like iterative method is first proposed based on HSS-like splitting of non-Hermitian (1,1) block for solving saddle point problems. The convergence analysis for the new method is given. Meanwhile, we consider the solution of saddle point systems by preconditioned Krylov subspace method...

  • Indefinite block triangular preconditioner for symmetric saddle point problems. Wu, Shi-Liang; Li, Cui-Xia // Calcolo;Mar2013, Vol. 50 Issue 1, p1 

    In this paper, we consider an indefinite block triangular preconditioner for symmetric saddle point problems. The new eigenvalue distribution of the preconditioned matrix is derived and some corresponding results in Simoncini (Appl. Numer. Math. 49:63-80, ) and Wu et al. (Computing 84:183-208, )...

  • On generalized preconditioned Hermitian and skew-Hermitian splitting methods for saddle point problems. Chunping Pan // WSEAS Transactions on Mathematics;Dec2012, Vol. 11 Issue 12, p1147 

    In this paper, we study the iterative algorithms for saddle point problems(SPP). Bai, Golub and Pan recently studied a class of preconditioned Hermitian and skew-Hermitian splitting methods(PHSS). By further accelerating it with another parameters, using the Hermitian/skew-Hermitian splitting...

  • A relaxed splitting preconditioner for generalized saddle point problems. Cao, Yang; Miao, Shu-Xin; Cui, Yan-Song // Computational & Applied Mathematics;Oct2015, Vol. 34 Issue 3, p865 

    In this paper, a new relaxed splitting preconditioner is proposed for the generalized saddle point problems. The proposed preconditioner is based on a new matrix splitting of the coefficient matrix and is easier to be implemented than the dimensional splitting preconditioner. Eigenvalue...

  • Two iterative algorithms for solving coupled matrix equations over reflexive and anti-reflexive matrices. Dehghan, Mehdi; Hajarian, Masoud // Computational & Applied Mathematics;2012, Vol. 31 Issue 2, p353 

    No abstract available.

  • The asymptotic iteration method for the angular spheroidal eigenvalues with arbitrary complex size parameter c. Barakat, T.; Abodayeh, K.; Abdallah, B.; Al-Dossary, O. M. // Canadian Journal of Physics;Feb2006, Vol. 84 Issue 2, p121 

    The asymptotic iteration method is applied to calculate the angular spheroidal eigenvalues (c) with arbitrary complex size parameter c. It is shown that the numerical results obtained for (c) are all in excellent agreement with the available published data over the full range of...

  • Relationship of Eigenvalue Between GMPSD Iterative Matrix and Jacobi Iterative Matrix. Zhuan-De Wang; Ting-Zhu Huang; Zhong-Xi Gao // Southeast Asian Bulletin of Mathematics;2009, Vol. 33 Issue 1, p165 

    Relationship of eigenvalues between GMPSD iterative matrix and Jacobi iterative matrix for block p-cyclic case is obtained. The results in corresponding references are improved and modified.

  • COMPUTING EIGENVECTORS OF NORMAL MATRICES WITH SIMPLE INVERSE ITERATION. Zhen-yue Zhang; Tiang-wei Ouyang // Journal of Computational Mathematics;Sep2003, Vol. 21 Issue 5, p657 

    It is well-known that if we have an approximate eigenvalue ? of a normal matrix A of order n, a good approximation to the corresponding eigenvector u can be computed by one inverse iteration provided the position, say k[submax], of the largest component of u is known. In this paper we give a...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics