A Numerical Method for Computing the Principal Square Root of a Matrix
It is shown how the mid-point iterative method with cubical rate of convergence can be applied for finding the principal matrix square root. Using an identity between matrix sign function and matrix square root, we construct a variant of mid-point method which is asymptotically stable in the neighbo...
Saved in:
Main Authors: | F. Soleymani, S. Shateyi, F. Khaksar Haghani |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2014/525087 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Some Matrix Iterations for Computing Matrix Sign Function
by: F. Soleymani, 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) -
Inversion Free Algorithms for Computing the Principal Square Root of a Matrix
by: Nicholas Assimakis, 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) -
Computing Simple Roots by an Optimal Sixteenth-Order Class
by: F. Soleymani, et al.
Published: (2012-01-01)