Author:
Wang Jinmei,Yin Lizi,Wang Ke
Abstract
The Kaczmarz method is presented for solving saddle point systems. The convergence is analyzed. Numerical examples, compared with classical Krylov subspace methods, SOR-like method (2001) and recent modified SOR-like method (2014), show that the Kaczmarz algorithm is efficient in convergence rate and CPU time.
Reference13 articles.
1. On generalized successive overrelaxation methods for augmented linear systems
2. Numerical solution of saddle point problems
3. Regularized DPSS preconditioners for non-Hermitian saddle point problems
4. A relaxed deteriorated PSS preconditioner for nonsymmetric saddle point problems from the steady Navier–Stokes equation
5. Chiu J., Davidson L., Dutta A., Gou J., Loy K.C., Thom M., Trenev D., Efficient and robust solution strategies for saddle-point systems, University of Minnesota, Institute for Mathematics and Its Applications (2014). Retrieved from the University of Minnesota Digital Conservancy. http://hdl.handle.net/11299/181496.