论文部分内容阅读
Incremental Newton(IN) iteration, proposed by Iannazzo, is stable for computing the matrix pth root, and its computational cost is O(n~3p) flops per iteration. In this paper, a cost-efficient variant of IN iteration is presented. The computational cost of