Generalized Iterative Methods for Solving Double Saddle Point Problem

Generalized Iterative Methods for Solving Double Saddle Point Problem

Blog Article

In this paper, we develop some stationary peavey kb1 iterative schemes in block forms for solving double saddle point problem.To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition.Moreover, using a relaxation parameter, the weighted version of the Jacobi method together with its convergence analysis are considered.Furthermore, we extend a method from the class of Gauss-Seidel iterative method and establish its convergence properties under a certain condition.In addition, the block successive overrelaxation (SOR) method is used to construct an iterative scheme to solve the mentioned double saddle point problem and its convergence properties are analyzed.

In order to illustrate the efficiency of the proposed methods, we report some numerical experiments for chromebook x360 14b a class of saddle point problems arising from the modeling of liquid crystal directors using finite elements./files/site1/files/52/2.pdf.