Mathematical  Culture and Thought

Mathematical Culture and Thought

Matrix Polar Decomposition: Computations and Applications

Document Type : Review

Author
Department of Mathematics, Faculty of Science, Bu-Ali Sina University, Iran
Abstract
In this article, an important and widely used matrix decomposition is introduced. This decomposition, named the matrix polar decomposition, is actually a generalization of the polar representation of complex numbers to matrices. Several important applications of matrix polar decomposition in various fields are considered. Also, some iterative methods for computing the matrix polar decomposition and their order of convergence are mentioned.
Keywords

Subjects


[1] Björck, Å., Bowie, C., An iterative algorithm for computing the best estimate of an orthogonal matrix, SIAM J. Numer. Anal., 8 (1971), 358-364.
[2] Esmaeili, H., A modification for Kovářík’s method, Lecturas Matematicas, 27 (2006), 1-12.
[3] Esmaeili, H., A class of modifications for Kovářík’s method, Bull. Belg. Math. Soc. Simon Stevin, 15 (2008), 377-384.
[4] Esmaeili, H., A quadratically convergent class of modifications for Kovářík’s method, Bull. Belg. Math. Soc. Simon Stevin, 16 (2009), 617-622.
[5] Esmaeili, H., A class of iterative methods for computing polar decomposition, Int. J. Comput. Math., 88 (2011), 207-220.
[6] Gander, W., Algorithms for the polar decomposition, SIAM J. Sci. Comput., 11 (1990), 1102-1115.
[7] Gander, W., On Halley’s iteration method, Amer. Math. Monthly, 92 (1985), 131-134.
[8] Gower, J. C., Multivariate analysis: ordination, multidimensional scaling and allied topics, in Handbook of applicable Mathematics, vol. VI, E. H. Lioyd, ed., John Wiley, Chichester, 1984.
[9] Gower, J. C., Dijksterhuis, G. B., Procrustes Problems, Oxford University Press, 2004.
[10] Higham, N. J., Computing a nearest symmetric positive semidefinite matrix, Linear Algebra Appl., 103 (1988), 103-118.
[11] Higham, N. J., Matrix nearness problems and applications, in Applications of Matrix Theory, M. J. C. Gover, S. Barnett, eds., Oxford University Press, 1989, 1-27.
[12] Higham, N. J., Computing the polar decomposition - with applications, SIAM J. Sci. Comput., 7 (1986), 1160-1174.
[13] Horn, R. A., Johnson, C. R., Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1985.
[14] Kenney, C., Laub, A. J., On scaling Newton's method for polar decomposition and the matrix sign function, SIAM J. Matrix Anal. Appl., 13 (1992), 688-706.
[15] Kovarik, Z., Some iterative methods for improving orthogonality, SIAM J. Numer. Anal., 7 (1970), 386-389.
[16] Petcu, D., Popa, C., A new version of Kovarik's approximate orthogonalization algorithm without matrix inversion, Int. J. Comput. Math., 82 (2005), 1235-1246.
[17] Soleymani, F., Stanimirović, P. S., Stojanović, I., A novel iterative method for polar decomposition and matrix sign function, Discrete Dyn. Nat. Soc., 2015 (2015), 1-11.
[18] Soleymani, F., Khaksar Haghani, F., Shateyi, S., Several numerical methods for computing unitary polar factor of a matrix, Adv. Difference Equ., 4 (2016), 1-11.
Volume 42, Issue 2 - Serial Number 73
December 2023
Pages 205-220

  • Receive Date 29 November 2022
  • Revise Date 21 January 2023
  • Accept Date 21 January 2023
  • Publish Date 22 December 2023