Conjugate gradient method for rank deficient saddle point problems (Q596659)
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 2085890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conjugate gradient method for rank deficient saddle point problems |
scientific article; zbMATH DE number 2085890 |
Statements
Conjugate gradient method for rank deficient saddle point problems (English)
0 references
10 August 2004
0 references
An alternative iterative method is proposed for solving rank deficient saddle point problems. The idea is to transform the rank deficient problem, in a natural way, into a smaller full rank problem, with structure as sparse as possible. The new system improves the condition greatly. Then the reduced system is solved by a preconditioned conjugate gradient method. Numerical experiments suggest that the new iterative method works well.
0 references
conjugate gradient method
0 references
saddle point problem
0 references
Navier-Stokes equation
0 references
finite element approximation
0 references
sparse scientific computing
0 references
rank deficient problem
0 references
ABS method
0 references
direct projection method
0 references
preconditioning
0 references
numerical experiments
0 references
0.8211305141448975
0 references
0.7887248396873474
0 references
0.7800920009613037
0 references
0.7689979672431946
0 references
0.7618552446365356
0 references
