Some Matrix Iterations for Computing Matrix Sign Function
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 emplo...
Saved in:
Main Authors: | F. Soleymani, E. Tohidi, S. Shateyi, F. Khaksar Haghani |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/425654 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Numerical Method for Computing the Principal Square Root of a Matrix
by: F. Soleymani, et al.
Published: (2014-01-01) -
A Class of Steffensen-Type Iterative Methods for Nonlinear Systems
by: F. Soleymani, et al.
Published: (2014-01-01) -
A Matrix Iteration for Finding Drazin Inverse with Ninth-Order Convergence
by: A. S. Al-Fhaid, et al.
Published: (2014-01-01) -
Approximating the Inverse of a Square Matrix with Application in Computation of the Moore-Penrose Inverse
by: F. Soleymani, et al.
Published: (2014-01-01) -
Efficient Iterative Methods with and without Memory Possessing High Efficiency Indices
by: T. Lotfi, et al.
Published: (2014-01-01)