迭代法求解实对称矩阵绝对值方程  

An Iterative Method for Absolute Value Equations Associated with Real Symmetric Matrices

作　　者：雍龙泉[1] 

机构地区：[1]陕西理工学院数学与计算机科学学院,陕西汉中723001

出　　处：《西南大学学报（自然科学版）》2012年第5期32-37,共6页Journal of Southwest University(Natural Science Edition)

基　　金：陕西省教育厅自然科学研究项目(09JK381)

摘　　要：给出了实对称矩阵绝对值方程的一个求解方法.当假设矩阵A的特征值的绝对值大于1时,绝对值方程存在唯一解,进而把绝对值方程问题转化为线性互补问题,利用不动点原理,给出了求解此类绝对值方程问题的迭代算法,并证明该算法经过有限次迭代之后收敛到原问题的一个最优解.数值实验表明此方法是有效的.Absolute value equations （AVE） are an NP-hard problem in its general form. A new method for solving absolute value equation problems with real symmetric matrices is proposed in this paper. Firstly, the existence and uniqueness theorem of the solution to the absolute value equation is presented under the condition that the absolute value of eigenvalue of A exceeds one. Next, based on the above, the absolute value equation is transformed into a linear complementarity problem. Then, using the fixed-point princi- ple, an iterative method is obtained for the absolute value equation. It is proved that this method conver- ges to an optimal solution of the original problem after finite iterations. Finally, some numerical examples are given to indicate that the method is feasible and effective.

关 键 词：绝对值方程 线性互补问题 不动点原理 

分 类 号：O221[理学—运筹学与控制论]