We revisit recent algorithms for computing matrix square roots and relate them to Newton iteration. New iterations are derived and a stability analysis is performed. A suitable scaling of an algorithm based on cyclic reduction is introduced, which removes the slow convergence of this iteration encountered in certain cases.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据
分享论文
