scholarly journals Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions

SIAM Review ◽  
2016 ◽  
Vol 58 (3) ◽  
pp. 461-493 ◽  
Author(s):  
Yuji Nakatsukasa ◽  
Roland W. Freund
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.


Automatica ◽  
1998 ◽  
Vol 34 (2) ◽  
pp. 151-156 ◽  
Author(s):  
Enrique S. Quintana-Orti ◽  
Vicente Hernandez

Sign in / Sign up

Export Citation Format

Share Document