Scaled fixed point algorithm for computing the matrix square root

DOI10.24193/FPT-RO.2023.1.16MaRDI QIDQ6153347zbMATH OpenOpenAlexFDO

Authors

Publication date 19 March 2024

Published in Fixed Point Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.08471

zbMATH Keywords

fixed point algorithmmatrix square rootmatrix iteration and geometric optimization

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical solutions to equations with nonlinear operators (65J15) Numerical methods for matrix equations (65F45)

Abstract: This paper addresses the numerical solution of the matrix square root problem. Two fixed point iterations are proposed by rearranging the nonlinear matrix equation $A-X^2=0$ and incorporating a positive scaling parameter. The proposals only need to compute one matrix inverse and at most two matrix multiplications per iteration. A global convergence result is established. The numerical comparisons versus some existing methods from the literature, on several test problems, demonstrate the efficiency and effectiveness of our proposals.

Recommendations

• Iterative methods for computing the matrix square root
• Newton's method for the matrix nonsingular square root
• A note on computing the matrix square root
• On the Matrix Square Root
• The Matrix Square Root from a New Functional Perspective: Theoretical Results and Computational Issues

Cites work

• A Padé family of iterations for the matrix sector function and the matrix \(p\)th root
• A Riemannian conjugate gradient method for optimization on the Stiefel manifold
• Benchmarking optimization software with performance profiles.
• Conic geometric optimization on the manifold of positive definite matrices
• Functions of Matrices
• Implicit steepest descent algorithm for optimization with orthogonality constraints
• Invariant metrics, contractions and nonlinear matrix equations
• Matrix mathematics. Theory, facts, and formulas
• Matrix power means and the Karcher mean
• Newton's Method for the Matrix Square Root
• Nonlinear Perron-Frobenius theory
• Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
• On the matrix square root via geometric optimization
• Positive definite matrices and the S-divergence
• Stable iterations for the matrix square root
• The Riemannian Barzilai-Borwein method with nonmonotone line search and the matrix geometric mean computation
• Zolotarev iterations for the Matrix square Root

This page was built for publication: Scaled fixed point algorithm for computing the matrix square root

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153347)