Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2015, Article ID 649423, 11 pages
http://dx.doi.org/10.1155/2015/649423
Research Article

A Novel Iterative Method for Polar Decomposition and Matrix Sign Function

1Department of Mathematics, Islamic Azad University, Zahedan Branch, Zahedan, Iran
2Faculty of Sciences and Mathematics, University of Niš, Visegradska 33, 18000 Niš, Serbia
3Faculty of Computer Science, Goce Delčev University, Goce Delčev 89, 2000 Štip, Macedonia

Received 3 April 2015; Accepted 21 June 2015

Academic Editor: Gian I. Bischi

Copyright © 2015 F. Soleymani et al. 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. W. Gander, “On Halley's iteration method,” The American Mathematical Monthly, vol. 92, no. 2, pp. 131–134, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. F. K. Haghani and F. Soleymani, “On a fourth-order matrix method for computing polar decomposition,” Computational & Applied Mathematics, vol. 34, no. 1, pp. 389–399, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  3. N. J. Higham, Functions of Matrices: Theory and Computation, SIAM, Philadelphia, Pa, USA, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  4. J. D. Roberts, “Linear model reduction and solution of the algebraic Riccati equation by use of the sign function,” International Journal of Control, vol. 32, no. 4, pp. 677–687, 1980. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. N. J. Higham, “Computing the polar decomposition-with applications,” SIAM Journal on Scientific and Statistical Computing, vol. 7, pp. 1160–1174, 1986. View at Google Scholar
  6. Y. Nakatsukasa, Z. Bai, and F. Gygi, “Optimizing Halley's iteration for computing the matrix polar decomposition,” SIAM Journal on Matrix Analysis and Applications, vol. 31, no. 5, pp. 2700–2720, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. K. Du, “The iterative methods for computing the polar decomposition of rank-deficient matrix,” Applied Mathematics and Computation, vol. 162, no. 1, pp. 95–102, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. W. Gander, “Algorithms for the polar decomposition,” SIAM Journal on Scientific and Statistical Computing, vol. 11, no. 6, pp. 1102–1115, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  9. J. M. Gutiérrez and M. A. Hernández, “A family of Chebyshev-Halley type methods in Banach spaces,” Bulletin of the Australian Mathematical Society, vol. 55, no. 1, pp. 113–130, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. B. Iannazzo, “A family of rational iterations and its application to the computation of the matrix pth root,” SIAM Journal on Matrix Analysis and Applications, vol. 30, no. 4, pp. 1445–1462, 2008. View at Publisher · View at Google Scholar
  11. F. Soleymani, S. Shateyi, and H. Salmani, “Computing simple roots by an optimal sixteenth-order class,” Journal of Applied Mathematics, vol. 2012, Article ID 958020, 13 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  12. J. Hoste, Mathematica Demystified, McGraw-Hill, New York, NY, USA, 2009.
  13. C. Kenney and A. J. Laub, “Rational iterative methods for the matrix sign function,” SIAM Journal on Matrix Analysis and Applications, vol. 12, no. 2, pp. 273–291, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  14. A. A. Dubrulle, Frobenius Iteration for the Matrix Polar Decomposition, Hewlett-Packard Company, Palo Alto, Calif, USA, 1994.
  15. N. J. Higham, “The matrix sign decomposition and its relation to the polar decomposition,” Linear Algebra and Its Applications, vol. 212-213, pp. 3–20, 1994. View at Publisher · View at Google Scholar
  16. A. R. Soheili, F. Toutounian, and F. Soleymani, “A fast convergent numerical method for matrix sign function with application in SDEs,” Journal of Computational and Applied Mathematics, vol. 282, pp. 167–178, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. F. Soleymani, P. S. Stanimirović, S. Shateyi, and F. K. Haghani, “Approximating the matrix sign function using a novel iterative method,” Abstract and Applied Analysis, vol. 2014, Article ID 105301, 9 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  18. R. Byers and H. Xu, “A new scaling for Newton's iteration for the polar decomposition and its backward stability,” SIAM Journal on Matrix Analysis and Applications, vol. 30, no. 2, pp. 822–843, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus