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 iterati...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 the variant well agrees with O（n-3logp） flops per iteration, if p is up to at least 100.展开更多
文摘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 the variant well agrees with O（n-3logp） flops per iteration, if p is up to at least 100.
