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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.