New iterative methods for finding matrix sign function: derivation and application
- 22 Downloads
The objective of this research was to provide two new methods for the sign function of a matrix. It is discussed that the schemes are novel and present global convergence behaviors. Then, the high convergence speeds of these iterative methods are proved and confirmed for calculating the matrix sign of different types of nonsingular matrices to reveal their applicability over the existing iterative methods of the same type.
KeywordsSign function Matrix iterations Eigenvalues High order Attraction basin
Mathematics Subject Classification65F30 41A25 65F60
The authors are thankful to two anonymous referees for several corrections and comments, which directly contribute to the readability of this paper.
- Cordero A, Soleymani F, Torregrosa JR, Zaka Ullah M (2016) Approximating the matrix sign function by means of Chebyshev–Halley type method. In: proceedings of the 16th international conference on computational and mathematical methods in science and engineering. pp 396–405Google Scholar
- Company R, Egorova V, Jódar L, Soleymani F (2016) Computing prices for the American option problems with multi assets. Model Eng Human Behav XVIII:1–6Google Scholar
- Iannazzo B (2007) Numerical solution of certain nonlinear matrix equations, Ph.D. thesis, Dipartimento di Matematica. Università di Pisa, PisaGoogle Scholar
- Sharifi M, Karimi Vanani S, Khaksar Haghani F, Arab M, Shateyi S (2015) On a cubically convergent iterative method for matrix sign. Sci World J 964257:6Google Scholar