【24h】

A fast reliable algorithm for solving the matrix equation x-A*XA=C

机译:用于求解矩阵方程x-A * XA = C的快速可靠算法

获取原文

摘要

In this paper, a fast reliable algorithm is proposed for computing the positive definite solution of the matrix equation X-A* XA=C based on the nice properties of doubling transformation. The convergence theorem shows that the iterative sequences generated by new algorithm are monotonically increasing and quadratically convergent to the positive definite solution of that matrix equation.
机译:本文基于加倍变换的优良性质,提出了一种计算矩阵方程X-A * XA = C的正定解的快速可靠算法。收敛定理表明,新算法生成的迭代序列单调递增,二次收敛于该矩阵方程的正定解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号