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

doi:10.1016/0898-1221(88)90034-X

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

電機工程學系

研究成果: Article › 同行評審

44 引文斯高帕斯（Scopus）

摘要

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.

原文	English
頁（從 - 到）	903-913
頁數	11
期刊	Computers and Mathematics with Applications
卷	15
發行號	11
DOIs	https://doi.org/10.1016/0898-1221(88)90034-X
出版狀態	Published - 1988

All Science Journal Classification (ASJC) codes

建模與模擬
計算機理論與數學
計算數學

存取文件

10.1016/0898-1221(88)90034-X

其它文件與鏈接

Link to publication in Scopus

引用此

@article{46c1ff8164d7474d9bf26ad8959ebe7b,

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

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

author = "Tsai, {J. S.H.} and Shieh, {L. S.} and Yates, {R. E.}",

note = "Funding Information: tThis work was supported in part by the U.S. Army Research Office, under contract DAAL-03-S7-K0001, and the U.S. Army Missile R&D Command, under Contract DAAH-01-85-CAI 11, and NASA-Johnson Space Center, under Contract NAG 9-21 I.",

year = "1988",

doi = "10.1016/0898-1221(88)90034-X",

language = "English",

volume = "15",

pages = "903--913",

journal = "Computers and Mathematics with Applications",

issn = "0898-1221",

publisher = "Elsevier Limited",

number = "11",

}

TY - JOUR

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

AU - Tsai, J. S.H.

AU - Shieh, L. S.

AU - Yates, R. E.

N1 - Funding Information: tThis work was supported in part by the U.S. Army Research Office, under contract DAAL-03-S7-K0001, and the U.S. Army Missile R&D Command, under Contract DAAH-01-85-CAI 11, and NASA-Johnson Space Center, under Contract NAG 9-21 I.

PY - 1988

Y1 - 1988

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

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

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

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

U2 - 10.1016/0898-1221(88)90034-X

DO - 10.1016/0898-1221(88)90034-X

M3 - Article

AN - SCOPUS:0023827739

SN - 0898-1221

VL - 15

SP - 903

EP - 913

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

IS - 11

ER -

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

摘要

All Science Journal Classification (ASJC) codes

存取文件

其它文件與鏈接

指紋

引用此