Inversion Free Algorithms for Computing the Principal Square Root of a Matrix
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 sp...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2014/613840 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|