On the sublinear and superlinear rate of convergence of conjugate gradient methods (Q5934347)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1606660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the sublinear and superlinear rate of convergence of conjugate gradient methods |
scientific article; zbMATH DE number 1606660 |
Statements
On the sublinear and superlinear rate of convergence of conjugate gradient methods (English)
0 references
19 June 2001
0 references
The convergence of conjugate gradient methods for solving systems of linear equations with asymmetric positive definite matrix takes typically place in three phases, with a sublinear, linear and superlinear convergence rate, respectively. For explaining this behaviour, polynomials with \(P(0)=1\) and minimal \(\|x^s P(x)\|_{L_\infty [0,1]}\) are considered. [The case \(s=1/2\) can also be found in the analysis of cascadic multigrid methods.] The study also indicates that it can be very efficient to use different preconditioners in different phases.
0 references
convergence
0 references
conjugate gradient methods
0 references
cascadic multigrid methods
0 references
preconditioners
0 references
0.8514571189880371
0 references
0.8298768997192383
0 references
0.8298768997192383
0 references
0.8296233415603638
0 references
0.8216082453727722
0 references
