Flexible conjugate gradients (Q2706444)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Flexible conjugate gradients |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Flexible conjugate gradients |
scientific article |
Statements
19 March 2001
0 references
iterative methods for linear systems
0 references
convergence acceleration
0 references
preconditioning
0 references
numerical examples
0 references
conjugate gradient method
0 references
linear large sparse system
0 references
condition number
0 references
Flexible conjugate gradients (English)
0 references
The author discusses the conjugate gradient method for the numerical solution of a linear large sparse system, using preconditioning technique. To maintain the optimal convergence properties of the method, the author considers a variant of the conjugate gradient method (called flexible conjugate gradient) that performs an explicit orthogonalization of the search directions vectors. The convergence analysis shows that the convergence rate is essentially independent of the variations in the preconditioner. For problems with regular distribution of the eigenvalues for which the fast convergence is due to a nice condition number, inexact preconditioning is used. Numerical results are discussed for problems with no separated eigenvalues and also for problems with well-separated extremal eigenvalues.
0 references
