A Numerical Method for Computing the Principal Square Root of a Matrix
Joint Authors
Haghani, F. Khaksar
Soleymani, Fazlollah
Shateyi, Stanford
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-08-27
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
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 neighborhood of the solution.
Finally, application of the presented approach is illustrated in solving a matrix differential equation.
American Psychological Association (APA)
Soleymani, Fazlollah& Shateyi, Stanford& Haghani, F. Khaksar. 2014. A Numerical Method for Computing the Principal Square Root of a Matrix. Abstract and Applied Analysis،Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1014166
Modern Language Association (MLA)
Soleymani, Fazlollah…[et al.]. A Numerical Method for Computing the Principal Square Root of a Matrix. Abstract and Applied Analysis No. 2014 (2014), pp.1-7.
https://search.emarefa.net/detail/BIM-1014166
American Medical Association (AMA)
Soleymani, Fazlollah& Shateyi, Stanford& Haghani, F. Khaksar. A Numerical Method for Computing the Principal Square Root of a Matrix. Abstract and Applied Analysis. 2014. Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-1014166
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1014166