Welcome to HPMug2oMmNrOfxWQHLiEksa6s0hFu9Ox348d7QefarYlaFR5ArkhOwm3Da1pmxmxCtenj1+6luWD#r#n+EPn9L6Ce+9onqnMlT+i! Today is

HPMug2oMmNrOfxWQHLiEksa6s0hFu9Ox348d7QefarYlaFR5ArkhOwm3Da1pmxmxCtenj1+6luWD#r#n+EPn9L6Ce+9onqnMlT+i ›› 2016, Vol. 32 ›› Issue (1): 48-53.DOI: 10.3969/j.issn.1009-0479.2016.01.010

Previous Articles     Next Articles

Uzawa-AOR Methods for Solution to Saddle Point Problems

SHEN Xuzhu a,LI Qingqin b,WANG Yue a   

  1. (a.Public Courses Department; b.Human Resources Department,  Kunming Metallurgy College,Kunming 650033,China)
  • Received:2015-12-08 Online:2016-04-20 Published:2016-04-20

Abstract:

Saddle point linear system is a symmetric and indefinite linear system,which comes from the optimization problem,the least sduare problem and so on. In practical applications,the system is usually large,and the coefficient matrix is sparse,so we should use the iterative method to solve the problem. Uzawa algorithm is an effective method for solving the saddle point problem,the algorithm is simple,but it is slow in convergence. In this paper, it is of great interest to develop an efficient iterative method for solving the saddle point problems.  Based on iterative scheme,we present a new Uzawa一AOP method and prove the convergence of the proposed method.  Actually,the new method can be considered as an inexact iteration method with the Uzawa as the outer iteration and the AOP as the inner iteration.  Numerical examples are used to illustrate the efficiency of the new iteration method.

Key words: saddle point problems, iterative method, Uzawa一AOP method, convergence

CLC Number: