Some generalizations of the new SOR-like method for solving symmetric saddle-point problems.

Saddle-point problems arise in many areas of scientific computing and engineering applications. Research on the efficient numerical methods of these problems has become a hot topic in recent years. In this paper, we propose some generalizations of the new SOR-like method based on the original method. Convergence of these methods is discussed under suitable restrictions on iteration parameters. Numerical experiments are given to show that these methods are effective and efficient.