A binary powering Schur algorithm for computing primary matrix roots
A binary powering Schur algorithm for computing primary matrix roots
复制标题
DOI：
10.1007/s11075-009-9357-1
复制
发表时间：
2010-01
影响因子：
2.1
通讯作者：
F. Greco;B. Iannazzo
中科院分区：
文献类型：
--
作者：
F. Greco;B. Iannazzo
给出了非奇异矩阵A的原根的一种算法。特别地，它使用真实的算法计算没有非正真实的特征值的真实的矩阵的主根。该算法基于A的Schur分解，其复杂度阶数低于通常的基于Schur分解的算法，即Smith算法.
An algorithm for computing primary roots of a nonsingular matrixAis presented. In particular, it computes the principal root of a real matrix having no nonpositive real eigenvalues, using real arithmetic. The algorithm is based on the Schur decomposition ofAand has an order of complexity lower than the customary Schur based algorithm, namely the Smith algorithm.