Constraint preconditioners for solving singular saddle point problems (Q1758407): 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.2012.08.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066263304 / rank | |||
Normal rank | |||
Latest revision as of 18:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constraint preconditioners for solving singular saddle point problems |
scientific article |
Statements
Constraint preconditioners for solving singular saddle point problems (English)
0 references
9 November 2012
0 references
The authors study constraint preconditioners for solving singular saddle point problems. They show that constraint preconditioners are constructed by proper splittings, and the corresponding generalized minimal residual method can determine the least squares solutions at breakdown. They also analyze properties of the preconditioned matrices, in particular their eigenvalue distributions.
0 references
singular saddle point system
0 references
constraint preconditioner
0 references
least squares solution
0 references
GMRES
0 references
convergence
0 references
eigenvalue distributions
0 references
generalized minimal residual method
0 references
