Revisiting matrix squaring
Given an \(n\times n\) complex valued matrix \(A\), the author proposes an algorithm to find its spectral radius \(\rho(A)\) and critical ratio \(\kappa(A)\), i.e. the ratio of the second eigenvalue versus the first in magnitude, based on matrix squaring. The reason why such algorithm is raised in place of the conventional power method lies on the fact that it derives an upper bound of \(\rho(A)\) independent of \(\kappa(A)\). However the matrix squaring has some drawbacks, among which is the computational complexity. The fast multiplication of matrices is assumed to apply.
- Rectangular matrix multiplication revisited
- On the Matrix Square Root
- A note on computing the matrix square root
- Approach to square roots applying square matrices
- On the computation of a matrix inverse square root
- On the square root of quadratic matrices
- Sums of squares of matrices
- Iterative methods for computing the matrix square root
This page was built for publication: Revisiting matrix squaring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176519)
