Inversion Free Algorithms for Computing the Principal Square Root of a Matrix

Nicholas Assimakis and Maria Adam

International Journal of Mathematics and Mathematical Sciences, 2014, vol. 2014, 1-8

Abstract:

New algorithms are presented about the principal square root of an matrix . 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.

Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2014/613840.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2014/613840.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:613840

DOI: 10.1155/2014/613840

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().