Conjugate gradient method for rank deficient saddle point problems (Q596659): 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.1023/b:numa.0000021758.65113.f5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985511277 / rank | |||
Normal rank | |||
Revision as of 11:01, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conjugate gradient method for rank deficient saddle point problems |
scientific article |
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
