本文研究了一类Riccati矩阵方程广义自反解的数值计算问题.利用牛顿算法将Riccati矩阵方程的广义自反解问题转化为线性矩阵方程的广义自反解或者广义自反最小二乘解问题,再利用修正共轭梯度法计算后一问题,获得了求Riccati矩阵方程的广义自反解的双迭代算法.拓宽了求解非线性矩阵方程的迭代算法.数值算例表明双迭代算法是有效的.
In this paper,a new iterative method is studied to find the generalized reflexive solution of the Riccati matrix equation.When Newton's method is applied to find the generalized reflexive solution of the Riccati matrix equation,a problem to find the generalized reflexive solutions or the generalized reflexive least-square solutions of a linear matrix equation will be derived.And then the modified conjugate gradient method is applied to solve the derived linear matrix equation.So a double iterative method is established to find the generalized reflexive solution of the Riccati matrix equation.The iterative algorithm for solving linear matrix equation is promoted.Numerical examples show that the double iterative method is effective.