A new iterative scheme has been constructed for finding minimal solution of a rational matrix equation of the form X + A*X −1 A = I. The new method is inversion-free per computing step. The convergence of the method has been studied and tested via numerical experiments.
展开▼
机译:构造了一种新的迭代方案,以寻找形式为X + A * X -1 sup> A = I的有理矩阵方程的最小解。该新方法在每个计算步骤中都是无反转的。该方法的收敛性已经通过数值实验进行了研究和测试。
展开▼