Constraint preconditioners for solving singular saddle point problems

From MaRDI portal





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.




Cited in
(50)








This page was built for publication: Constraint preconditioners for solving singular saddle point problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758407)