COMPUTING HIGH SPEED CONVERGENT ITERATIVE METHODS FOR THE POLAR DECOMPOSITION.

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.

Authors

Institutions

Publication Details

Journal
Afrischolar Discovery
Published
2026-04-20
DOI
https://doi.org/10.60787/tnamp.v24.668
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

COMPUTING HIGH SPEED CONVERGENT ITERATIVE METHODS FOR THE POLAR DECOMPOSITION.

Stephen Ehidiamhen Uwamusi, Uwamusi, Andrew, Esaborlupia
Afrischolar Discovery
Matrix Theory and Algorithms
article

COMPUTING HIGH SPEED CONVERGENT ITERATIVE METHODS FOR THE POLAR DECOMPOSITION.

Stephen Ehidiamhen Uwamusi, Uwamusi, Andrew, Esaborlupia
article en

Abstract

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.

Afrischolar Discovery
University of Benin (NG), Federal University of Petroleum Resource Effurun (NG)
Openalex Percentile: Top 6%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.