Fast and stable algorithms for computing the principal nth root of a complex matrix and the matrix sector function

J. S.H. Tsai, L. S. Shieh, R. E. Yates

Research output: Contribution to journalArticlepeer-review

41 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)903-913
Number of pages11
JournalComputers and Mathematics with Applications
Volume15
Issue number11
DOIs
Publication statusPublished - 1988

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Fast and stable algorithms for computing the principal nth root of a complex matrix and the matrix sector function'. Together they form a unique fingerprint.

Cite this