2015
DOI: 10.1016/j.amc.2014.11.100
|View full text |Cite
|
Sign up to set email alerts
|

On semi-convergence of the Uzawa–HSS method for singular saddle-point problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
5
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(5 citation statements)
references
References 32 publications
0
5
0
Order By: Relevance
“…We use left preconditioning with GMRES as a Krylov subspace method. We compare the elapsed CPU time (s) (CPU) and the number of iterations (IT) of the NMSS preconditioner with GMRES without preconditioning and GMRES method with GMSS preconditioner [17], Uzawa-HSS and PU-STS preconditioners [19,24,25]. In these examples, all of the optimal parameters are provided experimentally.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We use left preconditioning with GMRES as a Krylov subspace method. We compare the elapsed CPU time (s) (CPU) and the number of iterations (IT) of the NMSS preconditioner with GMRES without preconditioning and GMRES method with GMSS preconditioner [17], Uzawa-HSS and PU-STS preconditioners [19,24,25]. In these examples, all of the optimal parameters are provided experimentally.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Let A ∈ R n×n be positive definite, B ∈ R n×m , rank(B) = r < m < n and α, β > 0 be given constants. Assume that A = P + S is a dominant positive define and skew-Hermitian splitting of A. Letã,b, andc are defined as in Theorem 4.2 and α, β > 0 satisfy(24) or(25). Then all eigenvalues of the NMSS-preconditioned matrix P −1 NMSS A are located in a circle centered at (1, 0) with radius 1.Theorem 5.4 Under the hypotheses of Lemma 5.3.…”
mentioning
confidence: 97%
“…From (21), we get the following corollary. [38] proposed the Uzawa-HSS method and applied it for singular saddle point problems [39]. Recently, Miao and Cao [40] studied the semiconvergence of the generalized local HSS method established by Zhu [41] for singular saddle point problems; Zhou and Zhang [42] discussed the semiconvergence of the GMSSOR method which derived by Zhang et al in [43] for singular saddle point problems.…”
Section: Convergence Of the Gasor Methodsmentioning
confidence: 99%
“…This means that the MGSSP preconditioner outperforms the other five preconditioners for the GMRES method, which is congruous with the results of Table 2. (1) with the following coefficient sub-matrices [40]:…”
Section: Numerical Experimentsmentioning
confidence: 99%