Solvability Theory and Iteration Method for One Self-Adjoint Polynomial Matrix Equation

被引:7
|
作者
Jia, Zhigang [1 ]
Zhao, Meixiang [1 ]
Wang, Minghui [2 ]
Ling, Sitao [3 ]
机构
[1] Jiangsu Normal Univ, Sch Math & Stat, Xuzhou 221116, Peoples R China
[2] Qingdao Univ Sci & Technol, Dept Math, Qingdao 266061, Peoples R China
[3] China Univ Min & Technol, Coll Sci, Xuzhou 221116, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
POSITIVE-DEFINITE SOLUTIONS; DISCRETE-TIME; PERTURBATION ANALYSIS; DOUBLING-ALGORITHM; BACKWARD ERROR;
D O I
10.1155/2014/681605
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The solvability theory of an important self-adjoint polynomial matrix equation is presented, including the boundary of its Hermitian positive definite (HPD) solution and some sufficient conditions under which the (unique or maximal) HPD solution exists. The algebraic perturbation analysis is also given with respect to the perturbation of coefficient matrices. An efficient general iterative algorithm for the maximal or unique HPD solution is designed and tested by numerical experiments.
引用
收藏
页数:7
相关论文
共 50 条