The matrix sign function

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

1999 ◽  
Vol 09 (01) ◽  
pp. 147-158 ◽  
Author(s):  
PETER BENNER ◽  
JOSÉ M. CLAVER ◽  
ENRIQUE S. QUINTANA-ORTI

In this paper we study the solution of stable generalized Lyapunov matrix equations with large-scale, dense coefficient matrices. Our iterative algorithms, based on the matrix sign function, only require scalable matrix algebra kernels which are highly efficient on parallel distributed architectures. This approach avoids therefore the difficult parallelization of direct methods based on the QZ algorithm. The experimental analtsis reports a remarkable performance of our solvers on an IBM SP2 platform.


Sign in / Sign up

Export Citation Format

Share Document