COMPUTING HIGH SPEED CONVERGENT ITERATIVE METHODS FOR THE POLAR DECOMPOSITION.
DOI:
https://doi.org/10.60787/tnamp.v24.668Keywords:
Iteration of polar coordinates, Polar decomposition, Numerical methodsAbstract
This paper presents high speed convergent iterative methods for accelerating computation process in the polar decomposition of a matrix. As a first demonstration in our illustration, we split a complex number into real and imaginary components and simultaneously iterated to convergence using Halley’s third order iterative method for polynomial equation. Utilizing the Newton and Halley’s methods for computing polar decomposition of a matrix, we further accelerated convergence using matrix condition number and determinant of a matrix with a fast LU Factorization solver for matrix inversion. The described methods are backward stable.As a further insight of our study is the computation of zonal polynomials for these matrice., Numerical examples are demonstrated with these methods.
Downloads
References
Benner,p., Nakatsukasa, Y. & Penke,C. 2021 Stable and efficient computation of generalized polar decomposition, arXiv: 2104.06659v1 [ Math NA].
Bjorck, A. 2009 Numerical methods in Scientific Computing Vol. 2, SIAM, Philadelphia.
Farquhar, N.E., Moroney,T.J., Yang, Q. & Turner,I.W. 2016 GPU accelerated vector products with applications to exponential integrators and fractional diffusion, SIAM Journal of Scientific Computing, 38(3), C127-C149.
Higham,N.I. 1986 Computing the polar decomposition- with applications, SIAM. J. Sci. Stat. Comput. Vol 7, No. 4, pp. 1160-1174.
Gander, W. 1990 Algorithms for the polar decomposition, SIAM J. Sci. Comput., 11, pp. 1102-1115.
Gwalik,E.S. 2020 Iterations for the Unitary Sign decomposition and the Unitary eigendecomposition, arXiv:2011.12449v1 [Math.NA].
James,A.T. 1964 ‘’Distributions of matrix variates and latent roots derived from normal samples,’’ Annals of Mathematical Statistics, Vol. 35, pp. 475-501.
Ortega J.M. & Rheinboldt,W.C. 2000 Iterative solution of Nonlinear equations in several variables, Classics in Applied Mathematics, Society for Industrial and Applied Mathematics, Philadelphia, USA.
Nakatsukasa, Y. & Freund,R. 2016 Computing fundamental matrix decompositions accurately via the matrix sign function in two iterations: The power of Zolotarev’s functions, SIAM J. Numer. Anal. Vol. 58, Issue: 3, pp. 461-493.
Nakatsuksa, Y. & Higham, N.J. 2021 Backward stability of iterations for computing the polar decomposition. SIAM J. Matrix Anal. Appl. Vol. 33, No. 2, pp. 460-479.
Nakatsukasa,Y., Bai, Z. & Gygi,F. 2010 Optimising the Halley’s iteration for computing the matrix polar decomposition. SIAM J. Matrix Anal. Appl. Vol. 31, No. 5, pp. 2700-2720.
Nagar,D.K., Joshi, L. & Gupta,A.K. 2012 International Scholarly Research Network, Matrix variate Pareto distribution of second kind.ISRN Probability and Statistics Vol. 2012 Article ID789273,20 Pages. DOI:10.54021/2012/789273.
Uwamusi,S.E. 2017 Extracting p-th root of a matrix with positive eigenvalues via Newton and Halley’s methods, University of Ilorin Journal of Science Vol. 4(1) , pp. 1-16. ISSN:2408-4840.
Uwamusi,S.E. 2024 Rotation matrix and Angles of rotation in the polar decomposition, Earthline Journalof Mathematical Sciences, E-ISSN:2581-8147, Vol 14(1), pp. 63-74. https:doi.org/10.34198/ejms14124.063074
Wu,L., Laeuchli,J.& Kalantzis,V. 2016 A. Stathopoulos and E. Gallopoulos, Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse, Journal of Computational Physics, 326, pp. 828-844.
https://chat.openai.com/share/c14412f1-9d87-4cd3-8353-f45683ce14a2.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 The Transactions of the Nigerian Association of Mathematical Physics
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
