A fast method for computing the principal nth roots of complex matrices

Yih T. Tsay, Leang S. Shieh, Jason S.H. Tsai

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)

Abstract

Based on the generalized continued-fraction method for finding the nth roots of real numbers, this paper presents a fast computation method for finding the principal nth roots of complex matrices. Computation algorithms with high convergence rates are developed, and their global convergence properties are investigated from the viewpoint of systems theory.

Original languageEnglish
Pages (from-to)205-221
Number of pages17
JournalLinear Algebra and Its Applications
Volume76
Issue numberC
DOIs
Publication statusPublished - 1986 Apr

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'A fast method for computing the principal nth roots of complex matrices'. Together they form a unique fingerprint.

Cite this