scholarly journals Some Matrix Iterations for Computing Matrix Sign Function

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
F. Soleymani ◽  
E. Tohidi ◽  
S. Shateyi ◽  
F. Khaksar Haghani

Some iterative methods are introduced and demonstrated for finding the matrix sign function. It is analytically shown that the new schemes are asymptotically stable. Convergence analysis along with the error bounds of the main proposed method is established. Different numerical experiments are employed to compare the behavior of the new schemes with the existing matrix iterations of the same type.

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
F. Soleymani ◽  
Predrag S. Stanimirović ◽  
Igor Stojanović

We define and investigate a globally convergent iterative method possessing sixth order of convergence which is intended to calculate the polar decomposition and the matrix sign function. Some analysis of stability and computational complexity are brought forward. The behaviors of the proposed algorithms are illustrated by numerical experiments.


1995 ◽  
Vol 40 (8) ◽  
pp. 1330-1348 ◽  
Author(s):  
C.S. Kenney ◽  
A.J. Laub

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
F. Soleymani ◽  
P. S. Stanimirović ◽  
S. Shateyi ◽  
F. Khaksar Haghani

This study presents a matrix iterative method for finding the sign of a square complex matrix. It is shown that the sequence of iterates converges to the sign and has asymptotical stability, provided that the initial matrix is appropriately chosen. Some illustrations are presented to support the theory.


Sign in / Sign up

Export Citation Format

Share Document