Constraint preconditioners for solving singular saddle point problems (Q1758407)
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: Constraint preconditioners for solving singular saddle point problems |
scientific article; zbMATH DE number 6104516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constraint preconditioners for solving singular saddle point problems |
scientific article; zbMATH DE number 6104516 |
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
0.8685925602912903
0 references
0.8579925894737244
0 references
0.8504366874694824
0 references
0.8466390371322632
0 references
0.8436893224716187
0 references
