A fast method for computing the principal \(n\)-th roots of complex matrices (Q1085563)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3982400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast method for computing the principal \(n\)-th roots of complex matrices |
scientific article; zbMATH DE number 3982400 |
Statements
A fast method for computing the principal \(n\)-th roots of complex matrices (English)
0 references
1986
0 references
A quadratically convergent algorithm for the computation of the principal n-th root of complex matrices is developed by starting from a well-known continued fraction method for determining the n-th root of a positive real number. A main tool in the derivation of the first-mentioned algorithm consists in the use of certain properties of block circulant matrices. There is a numerical example for the case \(n=5\). With an error tolerance of 10(-10) the principal 5th root is obtained after 10 iterations.
0 references
principal n-th root of complex matrices
0 references
continued fraction method
0 references
block circulant matrices
0 references
numerical example
0 references
0 references
0.8483962416648865
0 references
0.8199204206466675
0 references
0.8062947392463684
0 references
