Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2014, Article ID 613840, 8 pages
http://dx.doi.org/10.1155/2014/613840
Research Article

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

1Department of Electronic Engineering, Technological Educational Institute of Central Greece, 3rd km Old National Road Lamia-Athens, 35100 Lamia, Greece
2Department of Computer Science and Biomedical Informatics, University of Thessaly, 2-4 Papasiopoulou Street, 35100 Lamia, Greece

Received 13 February 2014; Revised 13 May 2014; Accepted 13 May 2014; Published 18 June 2014

Academic Editor: Ram U. Verma

Copyright © 2014 Nicholas Assimakis and Maria Adam. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. A. Bini, N. J. Higham, and B. Meini, “Algorithms for the matrix pth root,” Numerical Algorithms, vol. 39, no. 4, pp. 349–378, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. C.-H. Guo and N. J. Higham, “A Schur-Newton method for the matrix pth root and its inverse,” SIAM Journal on Matrix Analysis and Applications, vol. 28, no. 3, pp. 788–804, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. N. J. Higham, “Newton's method for the matrix square root,” Mathematics of Computation, vol. 46, no. 174, pp. 537–549, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. P. Laasonen, “On the iterative solution of the matrix equation AX2I=0,” Mathematical Tables and Other Aids to Computation, vol. 12, pp. 109–116, 1958. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. D. G. Lainiotis, N. D. Assimakis, and S. K. Katsikas, “Fast and stable algorithm for computing the principal square root of a complex matrix,” Neural, Parallel & Scientific Computations, vol. 1, no. 4, pp. 467–476, 1993. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. L. S. Shieh, S. R. Lian, and B. C. Mcinnis, “Fast and stable algorithms for computing the principal square root of a complex matrix,” IEEE Transactions on Automatic Control, vol. 32, no. 9, pp. 820–822, 1987. View at Google Scholar
  7. J. S. H. Tsai, L. S. Shieh, and R. E. Yates, “Fast and stable algorithms for computing the principal nth root of a complex matrix and the matrix sector function,” Computers & Mathematics with Applications, vol. 15, no. 11, pp. 903–913, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  8. E. Deadman, N. J. Higham, and R. Ralha, “Blocked schur algorithms for computing the matrix square root,” in Proceedings of the 11th International Conference on Applied Parallel and Scientific Computing (PARA '12), vol. 7782 of Lecture Notes in Computer Science, pp. 171–182, Springer, 2013. View at Google Scholar
  9. R. E. Kalman and R. S. Bucy, “New results in linear filtering and prediction theory,” Journal of Basic Engineering, Transactions of the ASME D, vol. 83, pp. 95–107, 1961. View at Google Scholar
  10. B. Yuttanan and C. Nilrat, “Roots of Matrices,” Songklanakarin Journal of Science and Technology, vol. 27, no. 3, pp. 659–665, 2005. View at Google Scholar
  11. C. S. Kenney and R. B. Leipnik, “Numerical integration of the differential matrix Riccati equation,” IEEE Transactions on Automatic Control, vol. 30, no. 10, pp. 962–970, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. D. G. Lainiotis, “Partitioned Riccati solutions and integration-free doubling algorithms,” IEEE Transactions on Automatic Control, vol. 21, no. 5, pp. 677–689, 1976. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. X. Zhan, “Computing the extremal positive definite solutions of a matrix equation,” SIAM Journal on Scientific Computing, vol. 17, no. 5, pp. 1167–1174, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. M. Adam and N. Assimakis, Matrix Equations Solutions Using Riccati Equation Theory and Applications, LAMPERT Academic Publishing, 2012.
  15. M. Adam, N. Assimakis, G. Tziallas, and F. Sanida, “Riccati equation solution method for the computation of the solutions of X+ATX1A=Q and XATX1A=Q,” The Open Applied Informatics Journal, vol. 3, pp. 22–33, 2009. View at Google Scholar
  16. N. Assimakis and M. Adam, “Iterative and algebraic algorithms for the computation of the steady state Kalman filter gain,” ISRN Applied Mathematics, vol. 2014, Article ID 417623, 10 pages, 2014. View at Publisher · View at Google Scholar
  17. D. R. Vaughan, “A nonrecursive algebraic solution for the discrete time Riccati equation,” IEEE Transactions on Automatic Control, vol. 15, no. 5, pp. 597–599, 1970. View at Google Scholar