Approximating the Matrix Sign Function Using a Novel Iterative Method
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 the...
Main Authors: | F. Soleymani, P. S. Stanimirović, S. Shateyi, F. Khaksar Haghani |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2014/105301 |
Similar Items
-
Some Matrix Iterations for Computing Matrix Sign Function
by: F. Soleymani, et al.
Published: (2014-01-01) -
A Novel Iterative Method for Polar Decomposition and Matrix Sign Function
by: F. Soleymani, et al.
Published: (2015-01-01) -
On a Cubically Convergent Iterative Method for Matrix Sign
by: M. Sharifi, et al.
Published: (2015-01-01) -
A Numerical Method for Computing the Principal Square Root of a Matrix
by: F. Soleymani, et al.
Published: (2014-01-01) -
An Algorithm for Computing Geometric Mean of Two Hermitian Positive Definite Matrices via Matrix Sign
by: F. Soleymani, et al.
Published: (2014-01-01)