Alireza Ataei

Saddle point linear systems arise in many applications in computational sciences and engineering such as finite element approximations to Stokes problems, image reconstructions, tomography, genetics, statistics, and model order reductions for dynamical systems. In this paper, we present a least-squares approach to solve saddle point linear systems. The basic idea is to construct a projection matrix and transform a given saddle point linear system to a least-squares problem and then solve the least-squares problem by an iterative method such as LSMR: an iterative method for sparse least-squares problems. The proposed method rivals LSMR applied to the original problem in simplicity and ease to use. Numerical experiments demonstrate that the new iterative method is efficient and converges fast