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

The analysis of restart DGMRES for solving singular linear systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…However, detailed analysis of these phenomena is out of the scope of this paper. Similar phenomena for "DGMRES algorithm" have recently been reported in (Zhou & Wei 2006). Generally speaking, we may take around 20, 30, 40, or 50 as a proper choice of the Krylov dimension m of the GMRES(m) solver for both cases of ε = 10 −6 and ε = 10 −2 , while m = 50 is our preference since relatively bigger m can make the iterative solver more stable, and it appears more fair to set m = 50 when comparing the convergence speed of GMRES(m, 10 −6 ) and GMRES(m, 10 −2 ).…”
Section: Efficiency and Accuracymentioning
confidence: 55%
“…However, detailed analysis of these phenomena is out of the scope of this paper. Similar phenomena for "DGMRES algorithm" have recently been reported in (Zhou & Wei 2006). Generally speaking, we may take around 20, 30, 40, or 50 as a proper choice of the Krylov dimension m of the GMRES(m) solver for both cases of ε = 10 −6 and ε = 10 −2 , while m = 50 is our preference since relatively bigger m can make the iterative solver more stable, and it appears more fair to set m = 50 when comparing the convergence speed of GMRES(m, 10 −6 ) and GMRES(m, 10 −2 ).…”
Section: Efficiency and Accuracymentioning
confidence: 55%
“…It has been further developed in several papers, say [28,29]. There are many possible variations of this algorithm.…”
Section: Computing the Group Inverse Using The Dgmres Methodsmentioning
confidence: 98%