首页> 外文期刊>International journal of mathematics and mathematical sciences >Inversion Free Algorithms for Computing the Principal Square Root of a Matrix
【24h】

Inversion Free Algorithms for Computing the Principal Square Root of a Matrix

机译:计算矩阵主平方根的无反演算法

获取原文
       

摘要

New algorithms are presented about the principal square root of ann×nmatrixA. In particular, all the classical iterative algorithms require matrix inversion at every iteration. The proposed inversion free iterative algorithms are based on the Schulz iteration or the Bernoulli substitution as a special case of the continuous time Riccati equation. It is certified that the proposed algorithms are equivalent to the classical Newton method. An inversion free algebraic method, which is based on applying the Bernoulli substitution to a special case of the continuous time Riccati equation, is also proposed.
机译:提出了关于ann×nmatrixA的主平方根的新算法。特别是,所有经典的迭代算法在每次迭代时都需要矩阵求逆。所提出的无逆迭代算法基于Schulz迭代或Bernoulli替代,作为连续时间Riccati方程的特例。证明所提出的算法等效于经典的牛顿法。还提出了一种将伯努利替换法应用于连续时间Riccati方程的特殊情况的无反代数方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号