 Research
 Open Access
 Published:
Eigenvalue bounds of the shiftsplitting preconditioned singular nonsymmetric saddlepoint matrices
Journal of Inequalities and Applications volume 2016, Article number: 256 (2016)
Abstract
For singular nonsymmetric saddlepoint problems, a shiftsplitting preconditioner was studied in (Appl. Math. Comput. 269:947955, 2015). To further show the efficiency of the shiftsplitting preconditioner, we provide eigenvalue bounds for the nonzero eigenvalues of the shiftsplitting preconditioned singular nonsymmetric saddlepoint matrices. For real parts of the eigenvalues, the bound is provided by valid inequalities. For eigenvalues having nonzero imaginary parts, the bound is a combination of two inequalities proving their clustering in a confined region of the complex plane. Finally, two numerical examples are presented to verify the theoretical results.
Introduction
Consider the large and sparse nonsymmetric saddle point problems
where \(A=A^{T}\in\mathbb{R}^{n\times n}\) is positive definite, \(B\in \mathbb{R}^{m\times n}\) is a rectangular matrix with \(m\leq n\), and \(u=[x^{T}, y^{T}]^{T}\) and \(b=[f^{T}, g^{T}]^{T}\) with x, \(f\in\mathbb{R}^{n}\) and y, \(g\in\mathbb{R}^{m}\) are the unknown and given righthand side vectors, respectively. The system of linear equations (1.1) arises from many scientific computing and engineering applications, for example, the mixed finite element discretization of the Stokes equation [2], the Lagrangetype methods for constrained optimization problems [3], the meshfree discretization of elastic mechanics equation [4], and so on. For more background information on the applications of saddlepoint problems, see [5, 6] and references therein. According to the algebraic properties of the saddlepoint matrix \(\mathcal{A}\) [5, 7], we know that the linear system (1.1) is nonsingular if the matrix B is of full row rank (i.e., \(\operatorname{rank}(B)=m\)) and is singular if the matrix B is rank deficient (i.e., \(\operatorname{rank}(B)< m\)). In this paper, we consider the singular case and always assume that \(\operatorname{rank}(B)=r< m\) and that the singular nonsymmetric saddlepoint problem (1.1) is consistent, that is, \(b\in \operatorname{range}(\mathcal{A})\).
Due to its property of large sparsity, the nonsymmetric saddlepoint problem (1.1) is suitable for solving by iterative methods. To get fast convergence rate of the iterative methods, preconditioning techniques are often used [8]. The term preconditioning is simply a means of transforming the original linear system into one that has the same solution, but which is likely to be easier to solve with an iterative solver. A lot of efficient preconditioning techniques have been studied in the past few decades; see [9] for a good survey of efficient preconditioners for saddlepoint problems. In this paper, we focus on the following shiftsplitting (SS) preconditioner [1, 10]:
where α and β are two positive parameters, and \(I_{n}\) and \(I_{m}\) are the \(n\times n\) and \(m\times m\) identity matrices, respectively. In fact, the shiftsplitting preconditioner can be induced by the following shiftsplitting iteration method:
Theoretical results in [10] and [1] show that the shiftsplitting iteration method (1.3) is convergent and semiconvergent unconditionally for solving nonsingular and singular nonsymmetric saddlepoint problems, respectively. In the particular case \(\alpha=0\), the eigenvalue distribution of the shiftsplitting preconditioned nonsingular saddlepoint matrix \(\hat{\mathcal {P}}_{SS}^{1}\mathcal{A}\) was studied in [10]. Note that, as a preconditioner, the prefactor \(\frac{1}{2}\) in the matrix \(\hat{\mathcal{P}}_{SS}\) has no effect on the preconditioned system. Thus, generally, we can use
instead of the original shiftsplitting preconditioner \(\hat{\mathcal {P}}_{SS}\) (1.2). Although \(\mathcal{P}_{SS}\) is not induced by the iteration scheme (1.3), the computational complexities of the preconditioners \(\mathcal{P}_{SS}\) and \(\hat{\mathcal{P}}_{SS}\) are almost the same. Numerical results in [1, 10] show that the shiftsplitting preconditioner (1.2) or (1.4) is very efficient. For an overview of the shiftsplitting preconditioner (1.2) and the corresponding shiftsplitting iteration method (1.3), see recent papers [11, 12] and references [13–15].
Since the spectral distribution of the preconditioned matrix is closely related to the convergence rate of Krylov subspace iteration methods [8], we hope that the resulting preconditioned saddlepoint matrices have desired eigenvalue distributions, that is, tightly clustered spectra or positive real spectra, and so on; see, for example, [7, 16–19]. To further show the efficiency of the shiftsplitting preconditioner (1.2) and (1.3), in this paper, we provide eigenvalue bounds for the nonzero eigenvalues of the shiftsplitting preconditioned singular nonsymmetric saddlepoint matrices \(\mathcal {P}_{SS}^{1}\mathcal{A}\) that depend only on the extremal eigenvalues of A and nonzero extremal singular values of B. We show that all eigenvalues having nonzero imaginary parts are located in an intersection of two circles and all nonzero real eigenvalues are located in a positive interval. Although the analysis is done for the singular case, the theoretical results of the nonsingular case can be obtained as a particular case. These theoretical results are presented in Section 2. In Section 3, we present two numerical examples to verify our theoretical results. Finally, in Section 4, we end this paper with a few concluding remarks.
Eigenvalue bounds of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\)
In this section, we study eigenvalue bounds of the shiftsplitting preconditioned saddlepoint matrix \(\mathcal{P}_{SS}^{1}\mathcal {A}\). For convenience, we first present some notation. For square matrices M and N, \(M (\preceq)\prec N\) means that \(NM\) is symmetric positive (semi)definite; \((\cdot)^{*}\) denotes the conjugate transpose of either a vector or a matrix; θ̄ stands for the conjugate of a complex number θ; \(\operatorname{Re}(\theta)\) and \(\operatorname{Im}(\theta)\) stand for the real and imaginary parts of a complex number θ; \(\rho(M)\) and \(\operatorname{null}(M)\) denote the spectral radius and the null space of the matrix M, respectively. Let the eigenvalues of the symmetric positive definite matrix A be
and the singular values of the matrix B be
We first present the eigenvalue distribution of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\) and give a bound for its nonzero eigenvalues. To this end, we first give a useful lemma.
Lemma 2.1
[11]
Assume that \(A\in\mathbb{R}^{n\times n}\) is positive definite and \(B\in\mathbb{R}^{m\times n}\) (\(m\leq n\)) has full row rank. Let the iteration matrix Γ of the shiftsplitting iteration (1.3) be
Then
Theorem 2.1
Assume that \(A\in\mathbb{R}^{n\times n}\) is symmetric positive definite and \(B\in\mathbb{R}^{m\times n}\) (\(m\leq n\)) is rank deficient with \(\operatorname{rank}(B)=r< m\). Let the shiftsplitting preconditioner \(\mathcal {P}_{SS}\) be defined as in (1.4), and \(\alpha,\beta>0\). Then the shiftsplitting preconditioned matrix \(\mathcal {P}_{SS}^{1}\mathcal{A}\) has \(mr\) zero eigenvalue values and \(n+r\) nonzero eigenvalues. Let λ be a nonzero eigenvalue of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal {A}\). Then it satisfies
that is, all nonzero eigenvalues are located inside the circle centered at \((\frac{1}{2}, 0)\) with radius \(\frac{1}{2}\).
Proof
From (2.2) we assume that the singular value decomposition of the matrix B is
where \(U\in\mathbb{R}^{m\times m}\) and \(V\in\mathbb{R}^{n\times n}\) are orthogonal matrices, and \(\tilde{B}=[\Sigma_{r}\ 0]\in\mathbb {R}^{r\times n}\) is of full row rank with \(\Sigma_{r}=\operatorname{diag}(\sigma_{1}, \sigma_{2}, \ldots,\sigma_{r})\in\mathbb{R}^{r\times r}\).
By the definition of the shiftsplitting preconditioner we have
which is similar to
where
Since V is an orthogonal matrix and A is symmetric positive definite, \(V^{T}AV\) is symmetric positive definite, too. From (2.4) we know that B̃ is of full row rank. Thus, by Lemma 2.1 we have \(\rho(\tilde{\Gamma})<1\). Therefore, from (2.5) we obtain that the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\) has \(mr\) zero eigenvalue values and \(n+r\) nonzero eigenvalues.
Now, we study a bound for the nonzero eigenvalues of the preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\). Let λ and θ be nonzero eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\) and Γ̃, respectively. Then we have
By direct computation we obtain
that is, all nonzero eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\) are located inside the circle centered at (\(\frac{1}{2}\), 0) with radius \(\frac{1}{2}\). □
In the following, we further derive bounds for the nonreal and real eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal {P}_{SS}^{1}\mathcal{A}\). Based on the singular value decomposition (2.4) and the techniques used in Theorem 2.1, we can see that the shiftsplitting preconditioned matrix \(\mathcal {P}_{SS}^{1}\mathcal{A}\) can be rewritten as
where \(\tilde{A}=V^{T}AV\), and B̃ is defined as in (2.4). Let
Equality (2.6) indicates that the nonzero eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal {A}\) are the eigenvalues of \(\tilde{\mathcal{P}}_{SS}^{1}\tilde {\mathcal{A}}\).
To further derive a bound for the nonreal eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal {A}\), we use the following lemma. Note that the conclusion of the lemma is a particular case of [20], Theorem 2.
Lemma 2.2
[20]
Assume that \(A\in\mathbb{R}^{n\times n}\) is positive definite and \(B\in\mathbb{R}^{m\times n}\) (\(m\leq n\)) has full row rank. Let
and let
be a block triangular preconditioner to \(\mathcal{A}_{+}\), where \(\hat {A}\in\mathbb{R}^{n\times n}\) and \(\hat{C}\in\mathbb{R}^{m\times m}\) are symmetric positive definite matrices. Let θ be an eigenvalue of the block triangular preconditioned matrix \(\mathcal {P}_{BT}^{1}\mathcal{A}_{+}\), and \(\tau_{n}\) be the smallest eigenvalue of the symmetric positive definite matrix \(\hat{A}^{\frac {1}{2}}A\hat{A}^{\frac{1}{2}}\). If \(1\tau_{n}\geq0\), then
If \(1\tau_{n}<0\), then all eigenvalues of the block triangular preconditioned matrix \(\mathcal{P}_{BT}^{1}\mathcal{A}_{+}\) are real.
Theorem 2.2
Assume that \(A\in\mathbb{R}^{n\times n}\) is symmetric positive definite and \(B\in\mathbb{R}^{m\times n}\) (\(m\leq n\)) is rank deficient with \(\operatorname{rank}(B)=r< m\). Let the shiftsplitting preconditioner \(\mathcal {P}_{SS}\) be defined as in (1.4), and \(\alpha,\beta>0\). Let λ be a nonzero eigenvalue having nonzero imaginary part of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal {A}\). Then it satisfies
where \(\eta_{n}\) is the smallest eigenvalue of the matrix A.
Proof
By the preceding discussions, only the eigenvalues of the matrix \(\tilde{\mathcal{P}}_{SS}^{1}\tilde{\mathcal{A}}\) (2.7) need to be studied. Consider the additional auxiliary block diagonal symmetric positive definite matrix
Then the matrix \(\tilde{\mathcal{P}}_{SS}^{1}\tilde{\mathcal{A}}\) is similar to
where \(\bar{A}=(\alpha I_{n}+\tilde{A})^{\frac{1}{2}}\tilde {A}(\alpha I_{n}+\tilde{A})^{\frac{1}{2}}\) and \(\bar{B}=\frac {1}{\sqrt{\beta}}\tilde{B}(\alpha I_{n}+\tilde{A})^{\frac {1}{2}}\). Since
we can rewrite the righthand side of (2.8) as
which is similar to
Therefore, the preconditioned matrix \(\tilde{\mathcal{P}}_{SS}^{1}\tilde{\mathcal{A}}\) is similar to the matrix \(\bar{\mathcal{P}}_{SS}^{1}\bar{\mathcal{A}}\), and we only need to provide the eigenvalue bounds for \(\bar{\mathcal {P}}_{SS}^{1}\bar{\mathcal{A}}\).
By Lemma 2.2 we need to study the smallest eigenvalue of the matrix \((I_{n}+\bar{B}^{T}\bar{B})^{\frac{1}{2}}(\bar{A}+\bar {B}^{T}\bar{B})(I_{n}+\bar{B}^{T}\bar{B})^{\frac{1}{2}}\), which is similar to \((\alpha I_{n}+\tilde{A}+\frac{1}{\beta}\tilde {B}^{T}\tilde{B})^{1}(\tilde{A}+\frac{1}{\beta}\tilde{B}^{T}\tilde {B})\). Let τ̃ be an eigenvalue of the matrix \((\alpha I_{n}+\tilde{A}+\frac{1}{\beta}\tilde{B}^{T}\tilde{B})^{1}(\tilde {A}+\frac{1}{\beta}\tilde{B}^{T}\tilde{B})\), and ṽ be the corresponding eigenvector. Then we have
from which we obtain
Let λ be a nonzero eigenvalue of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\). Then by Lemma 2.2 we have
which shows that all eigenvalues having nonzero imaginary parts of the preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\) are located in the circle centered at \((1,0)\) with radius \(\sqrt{\frac {\alpha}{\alpha+\eta_{n}}}\) strictly less than one. □
Theorem 2.2 shows that the bound for the eigenvalues having nonzero imaginary parts of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\) only depends on the parameter α and the smallest eigenvalue of the matrix A. Combining Theorem 2.1 with Theorem 2.2, we can obtain some refined bounds for the nonreal eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\) in the following theorem.
Theorem 2.3
Assume that \(A\in\mathbb{R}^{n\times n}\) is symmetric positive definite and \(B\in\mathbb{R}^{m\times n}\) (\(m\leq n\)) is rank deficient with \(\operatorname{rank}(B)=r< m\). Let the shiftsplitting preconditioner \(\mathcal {P}_{SS}\) be defined as in (1.4), and \(\alpha,\beta>0\). Then all eigenvalues λ having nonzero imaginary parts of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal {A}\) are located in the domain
where \(\eta_{n}\) is the smallest eigenvalue of the matrix A.
Theorem 2.4
Assume that \(A\in\mathbb{R}^{n\times n}\) is symmetric positive definite and \(B\in\mathbb{R}^{m\times n}\) (\(m\leq n\)) is rank deficient with \(\operatorname{rank}(B)=r< m\). Let the shiftsplitting preconditioner \(\mathcal {P}_{SS}\) be defined as in (1.4), and \(\alpha,\beta>0\). The nonzero eigenvalues λ of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\) satisfy
where \(\eta_{1}\) and \(\eta_{n}\) are the largest and the smallest eigenvalues of the matrix A, and \(\sigma_{1}\) and \(\sigma_{r}\) are the largest and smallest nonzero singular values of the matrix B, respectively.
Proof
According to the proof of Theorem 2.2, we only need to provide bounds for the real eigenvalues of the matrix \(\bar {\mathcal{P}}_{SS}^{1}\bar{\mathcal{A}}\), which is similar to \(\bar {\mathcal{A}}\bar{\mathcal{P}}_{SS}^{1}\). Consider additionally the block diagonal symmetric positive definite matrix
Then the matrix \(\bar{\mathcal{A}}\bar{\mathcal{P}}_{SS}^{1}\) is similar to
where \(\check{A}=(I_{n}+\bar{B}^{T}\bar{B})^{\frac{1}{2}}(\bar {A}+\bar{B}^{T}\bar{B})(I_{n}+\bar{B}^{T}\bar{B})^{\frac{1}{2}}\) and \(\check{B}=\bar{B}(I_{n}+\bar{B}^{T}\bar{B})^{\frac{1}{2}}\).
Let \(\check{A}=X\Lambda X^{T}\) be the eigenvalue decomposition of Ǎ with X being orthogonal and Λ being diagonal. By the proof of Theorem 2.2 we know that \(0\prec\Lambda < I_{n}\). Thus, the righthand side matrix of (2.10) is orthogonal similar to
which is further similar to
where \(Q=\check{B}X(I_{n}\Lambda)^{\frac{1}{2}}\) and \(S=\check {B}\check{B}^{T}\).
Let λ be a nonzero eigenvalue of the shiftsplitting matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\). Then by similarity we know that λ is also an eigenvalue of the matrix \(\bigl[ {\scriptsize\begin{matrix}{} \Lambda & Q^{T}\cr Q & S \end{matrix}} \bigr]\). From [21], Proposition 2.2, we have
Inequalities (2.9) indicate that
Now, we study the extreme eigenvalues of the symmetric positive definite matrix
Let the singular value decomposition of the matrix B̄ be
where \(\bar{U}\in\mathbb{R}^{r\times r}\) and \(\bar{V}\in\mathbb {R}^{n\times n}\) are orthogonal matrices, and \(\bar{\Sigma }_{r}=\operatorname{diag}(\bar{\sigma}_{1}, \bar{\sigma}_{2}, \dots,\bar{\sigma }_{r})\in\mathbb{R}^{r\times r}\) is a diagonal matrix with \(\bar {\sigma}_{1}\geq\bar{\sigma}_{2}\geq\cdots\geq\bar{\sigma }_{r}>0\) being the singular values of B̄. Then
and
where \(\bar{\sigma}_{1}^{2}\) and \(\bar{\sigma}_{r}^{2}\) are the largest and smallest eigenvalues of the matrix \(\bar{B}\bar{B}^{T}=\frac {1}{\beta}\tilde{B}(\alpha I_{n}+\tilde{A})^{1}\tilde{B}^{T}\), respectively. By [8], Theorem 1.22, we have
Then from (2.13) we obtain the inequalities
From inequalities (2.11), (2.12) and (2.14), the nonzero eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal{A}\) satisfy
Since
equalities (2.15) can be further simplified:
Thus, we complete the proof. □
Remark 2.1
We give some remarks on the obtained theoretical results.

(1)
Theorem 2.4 also presents a bound for the real eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal {P}_{SS}^{1}\mathcal{A}\). Besides, the bound given in Theorem 2.4 is much tighter than that in Theorem 2.1.

(2)
Obviously, if \(r=m\), then the nonsymmetric saddlepoint matrix \(\mathcal{A}\) is nonsingular. Then, the theoretical results presented in Theorems 2.12.4 can be extended to the nonsingular case.
Numerical experiments
In this section, we use two numerical examples to verify the estimated eigenvalue bounds of the shiftsplitting preconditioned matrices \(\mathcal{P}_{SS}^{1}\mathcal{A}\) shown in Section 2.
Example 3.1
[1]
The first test singular nonsymmetric saddlepoint problem has the following coefficient submatrices:
with
and
Here, ⊗ denotes the Kronecker product symbol, ν is a parameter, and \(h=\frac{1}{q+1}\) is the discretization meshsize.
For this example, we have \(n=2p^{2}\), \(m=p^{2}+2\), and the total number of variables is \(m+n=3p^{2}+2\). The matrix B is an augmentation of the full rank matrix B̂ with two linearly independent vectors \(b_{1}\) and \(b_{2}\). Since \(b_{1}\) and \(b_{2}\) are linear combinations of the columns of the matrix B̂, B is a rankdeficient matrix. Thus, the corresponding nonsymmetric saddlepoint matrix \(\mathcal{A}\) is singular. In order to verify the theoretical results, we only choose the case \(q=16\) and vary the parameters α and β. We choose four cases for the parameter α, that is, \(\alpha =0.1\eta_{n}, 0.4\eta_{n}, 0.7\eta_{n}, \eta_{n}\). The parameter β is obtained by the formula \(\beta=\B\_{2}^{2}/\\alpha I_{n}+A\ _{2}\), which is often used in the shiftsplitting preconditioners [11, 15].
The parameters α and β, the estimated bounds, and the exact bounds of nonzero real eigenvalues of the shiftsplitting preconditioned matrices \(\mathcal{P}_{SS}^{1}\mathcal{A}\) are listed in Table 1. In Figure 1, we plot all eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal {A}\) for Example 3.1. In particular, the nonreal eigenvalues are plotted by ‘∗’, and the real eigenvalues are plotted by ‘⋅’.
By actual computation we know that two eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal {A}\) are zero, which confirms Theorem 2.1. From Table 1 and Figure 1 we can see that the estimated bounds sharply contain the exact bounds of real eigenvalues of \(\mathcal {P}_{GSS}^{1}\mathcal{A}\) and all eigenvalues having nonzero imaginary parts are located in an intersection of two circles. These results are in good agreement with our theoretical results in Theorem 2.3 and Theorem 2.4.
Example 3.2
The second test singular nonsymmetric saddlepoint problem arises from the following Stokes equation with suitable boundary conditions:
where Ω is a bounded domain, \(\nu>0\) is the viscosity, the vector field u stands for the velocity, and p represents the pressure.
The IFISS software package developed by Elman et al. [22] is used to discretize the twodimensional Stokes equation (3.1) on the unit square domain. In actual computation, the Q2Q1 mixed finite element method on uniform grid is used to generate discretizations. For simplicity, we set the viscosity values \(\nu=1\) and take \(16\times16\) grids to obtain the test matrix. Note that the rank of the matrix B in the test nonsymmetric saddlepoint matrix is \(m1\), which means that the discretized nonsymmetric saddlepoint matrix \(\mathcal{A}\) is singular.
For the second example, the parameters α and β are chosen by the same method as in Example 3.1. That is, we consider \(\alpha=0.1\eta_{n}\), \(0.4\eta_{n}\), \(0.7\eta_{n}\), \(\eta_{n}\), and the parameters β are obtained by the formula \(\beta=\B\ _{2}^{2}/\\alpha I_{n}+A\_{2}\). By computation we obtain that only one eigenvalue of the shiftsplitting preconditioned matrix \(\mathcal {P}_{SS}^{1}\mathcal{A}\) is zero, which further confirms Theorem 2.1. In Table 2, we list the parameters α and β for the shiftsplitting preconditioner \(\mathcal{P}_{SS}\), the estimated bounds, and the exact bounds of real eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal{P}_{SS}^{1}\mathcal {A}\) for Example 3.2. Figure 2 depicts the eigenvalues of the shiftsplitting preconditioned matrix \(\mathcal {P}_{SS}^{1}\mathcal{A}\) together with the estimated circle. The numerical results presented in Table 2 and Figure 2 also coincide with our theoretical results in Theorem 2.3 and Theorem 2.4.
Conclusion
To further show the efficiency of the shiftsplitting preconditioner for singular nonsymmetric saddlepoint problems (1.1), the eigenvalue bounds of the shiftsplitting preconditioned saddlepoint matrix are studied in detail in this paper. Theoretical analysis shows that all eigenvalues having nonzero imaginary parts are located in an intersection of two circles and all nonzero real eigenvalues are located in a positive interval. Two numerical examples are presented to confirm the theoretical results. The numerical results show that the eigenvalue bounds are very sharp.
References
Chen, CR, Ma, CF: A generalized shiftsplitting preconditioner for singular saddle point problems. Appl. Math. Comput. 269, 947955 (2015)
Elman, HC, Silvester, DJ, Wathen, AJ: Finite Elements and Fast Iterative Solvers: With Applications in Incompressible Fluid Dynamics, 2nd edn. Oxford University Press, Oxford (2014)
Greif, C, Moulding, E, Orban, D: Bounds on eigenvalues of matrices arising from interiorpoint methods. SIAM J. Optim. 24, 4983 (2014)
Cao, Y, Yao, LQ, Jiang, MQ, Niu, Q: A relaxed HSS preconditioner for saddle point problems from meshfree discretization. J. Comput. Math. 31, 398421 (2013)
Benzi, M, Golub, GH, Liesen, J: Numerical solution of saddle point problems. Acta Numer. 14, 1137 (2005)
Bai, ZZ: Structured preconditioners for nonsingular matrices of block twobytwo structures. Math. Comput. 75, 791815 (2006)
Bai, ZZ: Eigenvalue estimates for saddle point matrices of Hermitian and indefinite leading blocks. J. Comput. Appl. Math. 237, 295306 (2013)
Saad, Y: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003)
Pestana, J, Wathen, AJ: Natural preconditioning and iterative methods for saddle point problems. SIAM Rev. 57, 7191 (2015)
Cao, Y, Du, J, Niu, Q: Shiftsplitting preconditioners for saddle point problems. J. Comput. Appl. Math. 272, 239250 (2014)
Cao, Y, Miao, SX: On semiconvergence of the generalized shiftsplitting iteration method for singular nonsymmetric saddle point problems. Comput. Math. Appl. 71, 15031511 (2016)
Shen, QQ, Shi, Q: Generalized shiftsplitting preconditioners for nonsingular and singular generalized saddle point problems. Comput. Math. Appl. 72, 632641 (2016)
Bai, ZZ, Yin, JF, Su, YF: A shiftsplitting preconditioner for nonHermitian positive definite matrices. J. Comput. Math. 24, 539552 (2006)
Cao, Y, Tao, HR, Jiang, MQ: Generalized shift splitting preconditioners for saddle point problems. Math. Numer. Sin. 36, 1626 (2014) (in Chinese)
Cao, Y, Li, S, Yao, LQ: A class of generalized shiftsplitting preconditioners for nonsymmetric saddle point problems. Appl. Math. Lett. 49, 2027 (2015)
Olshanskii, MA, Simoncini, V: Acquired clustering properties and solution of certain saddle point systems. SIAM J. Matrix Anal. Appl. 31, 27542768 (2010)
Shen, SQ, Huang, TZ, Yu, J: Eigenvalue estimates for preconditioned nonsymmetric saddle point matrices. SIAM J. Matrix Anal. Appl. 31, 24532476 (2010)
Notay, Y: A new analysis of block preconditioners for saddle point problems. SIAM J. Matrix Anal. Appl. 35, 143173 (2014)
Cao, Y, Jiang, MQ, Zheng, YL: A note on the positive stable block triangular preconditioner for generalized saddle point problems. Appl. Math. Comput. 218, 1107511082 (2012)
Simoncini, V: Block triangular preconditioners for symmetric saddlepoint problems. Appl. Numer. Math. 49, 6380 (2004)
Axelsson, O: Unified analysis of preconditioning methods for saddle point matrices. Numer. Linear Algebra Appl. 22, 233253 (2015)
Elman, HC, Ramage, A, Silvester, DJ: IFISS: a Matlab toolbox for modelling incompressible flow. ACM Trans. Math. Software 33, Article 14 (2007)
Acknowledgements
This work is supported by the National Natural Science Foundation of China (No. 11572210), the Natural Science Foundation of Jiangsu Province (No. BK20151272), the ‘333’ Program Talents of Jiangsu Province (No. BRA2015356), and the Six Top Talents of Jiangsu Province (No. 2014WLW029).
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
The authors contributed equally to this work. All authors have read and approved the manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Shi, Q., Shen, QQ. & Yao, LQ. Eigenvalue bounds of the shiftsplitting preconditioned singular nonsymmetric saddlepoint matrices. J Inequal Appl 2016, 256 (2016). https://doi.org/10.1186/s136600161193y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s136600161193y
MSC
 65F10
Keywords
 singular nonsymmetric saddlepoint matrix
 shiftsplitting preconditioner
 eigenvalue