A power method for computing square roots of complex matrices
From MaRDI portal
Some 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. It is shown that for each positive integer \(r\geq 2\), a convergent method of order \(r\) can be developed.
Recommendations
Cites work
- A faster method of computing the square root of a matrix
- A faster, more stable method for comuting the pth roots of positive definite matrices
- A Schur method for the square root of a matrix
- Computing real square roots of a real matrix
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- Newton's Method for the Matrix Square Root
- Roots of real matrices
- The matrix sign function and computations in systems
Cited in
(12)- Computation of roots of real and complex matrices
- Square roots of \(3\times 3\) matrices
- Computing the square roots of a class of circulant matrices
- Numerical approximation of the product of the square root of a matrix with a vector
- Newton's method for solving the tensor square root problem
- Newton's method for the matrix nonsingular square root
- NLS breathers, rogue waves, and solutions of the Lyapunov equation for Jordan blocks
- Transformations computations: power, roots and inverse
- scientific article; zbMATH DE number 1904859 (Why is no real title available?)
- A binary powering Schur algorithm for computing primary matrix roots
- Two fixed-point iteration algorithms for solving tensor square root problem
- A hybrid Newton's method for solving tensor square root problem
This page was built for publication: A power method for computing square roots of complex matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378703)
