Rotation Matrix and Angles of Rotation in the Polar Decomposition
Abstract
This paper aims at computing the rotation matrix and angles of rotations using Newton and Halley’s methods in the generalized polar decomposition. The method extends the techniques of Newton’s and Halley’s methods for iteratively finding the zeros of polynomial equation of single variable to matrix rotation valued problems. It calculates and estimates the eigenvalues using Chevbyshev’s iterative method while computing the rotation matrix. The sample problems were tested on a randomly generated matrix of order from the family of matrix market. Numerical examples are given to demonstrate the validity of this work.
References
Benner, P., Nakatsukasa, Y., & Penke, C. (2022). Stable and efficient computation of generalized polar decompositions. SIAM Journal on Matrix Analysis and Applications, 43(3), 1058-1083. https://doi.org/10.1137/21M1411986
Blanchard, P., Zounon, M., Dongarra, J., & Higham, N. (2019). Parallel numerical linear algebra for future extreme-scale systems. NLAFET, University of Manchester. http://dx.doi.org/10.3030/671633
Bjorck, A. (2009). Numerical methods in scientific computing: Volume 2 (2nd ed.). SIAM.
Chen, J., & Chow, E. (2014). A stable scaling of Newton Schulz for improving the sign function of computation of a Hermittian matrix. [Preprint]. ANL/MCS-P5059-0114.
Driscoll, T. A. (n.d.). The Schwartz-Christoffel toolbox. Retrieved from https://w.w.w.math.udel.edu~driscoli/software/sc/
Golub, G., & Van Loan, C. F. (1983). Matrix computations. North Oxford Academic Publishing Co. Ltd.
Higham, N. J. (2008). Functions of matrices: theory and computation. SIAM.
Nakatsukasa, Y., Bai, Z., & Gygi, F. (2010). Optimising Halley’s iteration for computing the matrix polar decomposition. SIAM Journal on Matrix Analysis and Applications, 31(5), 2700-2720. https://doi.org/10.1137/090774999
Nakatsukasa, Y., & Higham, N. J. (2011). Backward stability of iterations for computing the polar decomposition. [MIMS E print]. 2011.103. The University of Manchester, UK.
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 Review, 58(3), 461-493. http://dx.doi.org/10.1137/140990334
Uwamusi, S. E. (2017). Extracting p-th root of a matrix with positive eigenvalues via Newton and Halley’s methods. Ilorin Journal of Science, 4(1), 1-16.
Uwamusi, S. E. (2017). Computing square root of diagonalizable matrix with positive eigenvalues and iterative solution to Nonlinear system of equation: The role of Lagrange interpolation formula. Transactions of the Nigerian Association of Mathematical Physics, 5, 65-72.
Wang, X., & Cao, Y. (2023). A numerically stable high-order Chevbyshev-Halley type multipoint iterative method for calculating matrix sign function. AIMS Mathematics, 8(5), 12456-12471. http://dx.doi.org/10.3934/math.2023625
Zielinski, P. (1995). The polar decomposition: properties, applications and algorithms. Roczniki Polskiego Twarzystwa Mathematycznego Seria III. Matematyka Stosowana XXXVIII.
This work is licensed under a Creative Commons Attribution 4.0 International License.
.jpg){kind=logo}
