摘要：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.
