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

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

doi:10.1016/0024-3795(86)90223-5

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

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

Department of Electrical Engineering

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	205-221
Number of pages	17
Journal	Linear Algebra and Its Applications
Volume	76
Issue number	C
DOIs	https://doi.org/10.1016/0024-3795(86)90223-5
Publication status	Published - 1986 Apr

All Science Journal Classification (ASJC) codes

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

Access to Document

10.1016/0024-3795(86)90223-5

Cite this

@article{f409ccec42da4d42a373bed6cee773f5,

title = "A fast method for computing the principal nth roots of complex matrices",

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.",

author = "Tsay, {Yih T.} and Shieh, {Leang S.} and Tsai, {Jason S.H.}",

note = "Funding Information: *This work was supported in part by the U.S. Army Research Office, under contract 29-89Km37, and U.S. Army Missile Command, under contract DAAH 01.85C-Alll.",

year = "1986",

month = apr,

doi = "10.1016/0024-3795(86)90223-5",

language = "English",

volume = "76",

pages = "205--221",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier Inc.",

number = "C",

}

TY - JOUR

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

AU - Tsay, Yih T.

AU - Shieh, Leang S.

AU - Tsai, Jason S.H.

N1 - Funding Information: *This work was supported in part by the U.S. Army Research Office, under contract 29-89Km37, and U.S. Army Missile Command, under contract DAAH 01.85C-Alll.

PY - 1986/4

Y1 - 1986/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=46149134939&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46149134939&partnerID=8YFLogxK

U2 - 10.1016/0024-3795(86)90223-5

DO - 10.1016/0024-3795(86)90223-5

M3 - Article

AN - SCOPUS:46149134939

VL - 76

SP - 205

EP - 221

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

SN - 0024-3795

IS - C

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this