A fast method for computing the principal \(n\)-th roots of complex matrices (Q1085563): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(86)90223-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007934969 / rank | |||
Normal rank | |||
Latest revision as of 18:43, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast method for computing the principal \(n\)-th roots of complex matrices |
scientific article |
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
