This paper presents rapidly convergent and more stable recursive algorithms for finding the principal nth root of a complex matrix and the associated matrix sector function. The developed algorithms significantly improve the computational aspects of finding the principal nth root of a matrix and the matrix sector function. Thus, the developed algorithms will enhance the capabilities of the existing computational algorithms such as the principal nth root algorithm, the matrix sign algorithm and the matrix sector algorithm for developing applications to control system problems.
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics