Scaled fixed point algorithm for computing the matrix square root

DOI10.24193/fpt-ro.2023.1.16arXiv2002.08471OpenAlexW3007224580MaRDI QIDQ6153347

No author found.

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

matrix square rootfixed point algorithmmatrix 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)

Cites Work

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