A globally convergent variant of mid-point method for finding the matrix sign
- 37 Downloads
In this research, an efficient variant of mid-point iterative method is given for computing the sign of a square complex matrix having no pure imaginary eigenvalues. It is proven that the method is new and has global convergence with high order of convergence seven. To justify the effectiveness of the new scheme, several comparisons for matrices of different sizes are worked out to show that the new method is efficient.
KeywordsMatrix sign Mid-point method Global convergence Iterative methods High order
Mathematics Subject Classification65F60
- Iannazzo B (2007) Numerical solution of certain nonlinear matrix equations, Ph.D. thesis, Dipartimento di Matematica, Università di PisaGoogle Scholar
- Soleymani F, Sharifi M, Shateyi S, Khaksar F (2014) Haghani, an algorithm for computing geometric mean of two hermitian positive definite matrices via matrix sign. Abs Appl Anal 2014:1–6Google Scholar