𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Yih T. Tsay; Leang S. Shieh; Jason S.H. Tsai

Book ID
107825115
Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
698 KB
Volume
76
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Power Method for Computing Square Root
A Power Method for Computing Square Roots of Complex Matrices
✍ Mohammed A. Hasan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 188 KB

In this paper higher order convergent methods for computing square roots of nonsingular complex matrices are derived. These methods are globally convergent and are based on eigenvalue shifting and powering. Specifically, it is shown for each positive integer r G 2, a convergent method of order r can

Principal minors, Part I: A method for c
Principal minors, Part I: A method for computing all the principal minors of a matrix
✍ Kent Griffin; Michael J. Tsatsomeros πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 180 KB

An order O(2 n ) algorithm for computing all the principal minors of an arbitrary n Γ— n complex matrix is motivated and presented, offering an improvement by a factor of n 3 over direct computation. The algorithm uses recursive Schur complementation and submatrix extraction, storing the answer in a