Inversion Free Algorithms for Computing the Principal Square Root of a Matrix
Joint Authors
Adam, Maria
Assimakis, Nicholas
Source
International Journal of Mathematics and Mathematical Sciences
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-06-18
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract EN
New algorithms are presented about the principal square root of an n×n matrix A.
In particular, all the classical iterative algorithms require matrix inversion at every iteration.
The proposed inversion free iterative algorithms are based on the Schulz iteration or the Bernoulli substitution as a special case of the continuous time Riccati equation.
It is certified that the proposed algorithms are equivalent to the classical Newton method.
An inversion free algebraic method, which is based on applying the Bernoulli substitution to a special case of the continuous time Riccati equation, is also proposed.
American Psychological Association (APA)
Assimakis, Nicholas& Adam, Maria. 2014. Inversion Free Algorithms for Computing the Principal Square Root of a Matrix. International Journal of Mathematics and Mathematical Sciences،Vol. 2014, no. 2014, pp.1-8.
https://search.emarefa.net/detail/BIM-485174
Modern Language Association (MLA)
Assimakis, Nicholas& Adam, Maria. Inversion Free Algorithms for Computing the Principal Square Root of a Matrix. International Journal of Mathematics and Mathematical Sciences No. 2014 (2014), pp.1-8.
https://search.emarefa.net/detail/BIM-485174
American Medical Association (AMA)
Assimakis, Nicholas& Adam, Maria. Inversion Free Algorithms for Computing the Principal Square Root of a Matrix. International Journal of Mathematics and Mathematical Sciences. 2014. Vol. 2014, no. 2014, pp.1-8.
https://search.emarefa.net/detail/BIM-485174
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-485174