Superlinearly convergent PCG algorithms for some nonsymmetric elliptic systems (Q2468128): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cam.2006.12.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981866642 / rank | |||
Normal rank | |||
Revision as of 21:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Superlinearly convergent PCG algorithms for some nonsymmetric elliptic systems |
scientific article |
Statements
Superlinearly convergent PCG algorithms for some nonsymmetric elliptic systems (English)
0 references
30 January 2008
0 references
The authors present an extension of the mesh independence superlinear convergence properties of the preconditional conjugate gradient (PCG) algorithm, previously obtained by one of the authors for nonsymmetric elliptic equations, to systems of such equations. It is based on decoupled preconditioners, which keeps the size of the auxiliary systems as in the case of a single equation.
0 references
conjugate gradient method
0 references
nonsymmetric elliptic systems
0 references
superlinear convergence
0 references
mesh independence
0 references
preconditional conjugate gradient (PCG)
0 references
