Fast and stable algorithms for computing the principal \(n\)th root of a complex matrix and the matrix sector function (Q1107951): Difference between revisions

The authors review some definitions of the principal n-th root of a complex matrix and the associated matrix sector function and describe some applications of the matrix sector function. The main results of the paper are fast and stable recursive algorithms for finding the principal n-th root of a matrix and the associated sector function. By means of a perturbation analysis with suitable assumptions, it is shown that the proposed recursive algorithms are numerically more stable than the ones developed previously by the authors. However, the analysis of absolute numerical stability of the presented algorithms has not been done. The developed algorithms significantly improve the computational aspects of finding the principal n-th root of a matrix and the matrix sector function. Illustrative example is also given.