Constraint preconditioners for solving singular saddle point problems
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.
scientific article; zbMATH DE number 6104516