A binary powering Schur algorithm for computing primary matrix roots
The authors propose a new algorithm based on the Schur normal form, for computing a primary \(p\)th root of an \(n \times n\) complex matrix. They prove that the cost of the proposed algorithm is lowered to \({\mathcal{O}}(n^2 p + n^3 \log_2 p)\) ops and the storage is lowered to \({\mathcal{O}}(n p + n^2 \log_2 p)\) real numbers.
scientific article; zbMATH DE number 5789596
scientific article