矩阵方程X+A^(*)(R+B^(*)XB)^(-t)A=Q的Hermite正定解  

Hermite positive definite solution of the matrix equation X+A^(*)(R+B^(*)XB)^(-t)A=Q

作　　者：黄玉莲 罗显康[1] HUANG Yulian;LUO Xiankang(Faculty of Science,Yibin University,Yibin,Sichuan 644000,China;Yibin Nanxi Vocational and Technical School,Yibin,Sichuan 644100,China)

机构地区：[1]宜宾学院理学部,四川宜宾644000 [2]宜宾市南溪职业技术学校,四川宜宾644100

出　　处：《内江师范学院学报》2023年第12期61-67,85,共8页Journal of Neijiang Normal University

基　　金：宜宾学院高层次人才“启航”计划项目(2019QD07)。

摘　　要：非线性矩阵方程X+A^(*)(R+B^(*)XB)^(-t)A=Q(t≥1)来源于离散时间代数Riccati方程.本文给出该方程存在Hermite正定解的充分条件及上下界估计,构造了求解该矩阵方程的不动点迭代和免逆迭代算法,运用单调有界定理证明了算法的收敛性,最后通过数值算例说明所提算法对求解该矩阵方程的有效性及可行性.The nonlinear matrix equation X+A^(*)(R+B^(*)XB)^(-t)A=Q(t≥1)is derived from the discrete-time algebraic Riccati equation.The sufficient conditions for the existence of Hermite positive definite solutions and the upper and lower bounds are given.The fixed point iteration and inverse-free iteration algorithms for solving the equation are constructed and the convergence of the algorithm is proved by using the monotone boundedness theorem.Finally,two numerical examples are given to illustrate the effectiveness and feasibility of the proposed algorithm for solving the matrix equation.

关 键 词：非线性矩阵方程 RICCATI方程 HERMITE正定解 上下界 迭代算法 

分 类 号：O241.7[理学—计算数学]