A mixed precision algorithm for the matrix square root

DOI10.48550/arXiv.2607.12430MaRDI QIDQ7284017arXivFDO

Authors Bowen Gao, Daniel Kressner, Meiyue Shao

Publication date 14 July 2026

Published in arXiv

Tldr We propose a mixed precision algorithm for computing matrix square roots combining low precision Schur decomposition and iterative refinement through an approximate Newton method, which recovers full working precision accuracy under mild conditions. Numerical experiments show speedup over a fixed working-precision Schur algorithm on x86-64 architectures.

Full work available at URL https://doi.org/10.48550/arXiv.2607.12430

arXiv classification

math.NA

Cites work

• A mixed precision Jacobi SVD algorithm
• A mixed precision LOBPCG algorithm
• A multiprecision derivative-free Schur-Parlett algorithm for computing matrix functions
• A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
• Accelerating the solution of linear systems by iterative refinement in three precisions
• Accuracy and Stability of Numerical Algorithms
• Computational Methods for Linear Matrix Equations
• Computing matrix functions
• Iterative Refinement in Floating Point
• Iterative Refinement of Schur decompositions
• Iterative Solution of Nonlinear Equations in Several Variables
• Iterative refinement for singular value decomposition based on matrix multiplication
• Iterative refinement for symmetric eigenvalue decomposition
• Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
• Mixed Precision Rayleigh Quotient Iteration for Total Least Squares Problems
• Mixed precision iterative refinement for least squares with linear equality constraints and generalized least squares problems
• Mixed-Precision Paterson--Stockmeyer Method for Evaluating Polynomials of Matrices
• Recursive blocked algorithms for solving triangular systems—Part I
• Recursive blocked algorithms for solving triangular systems—Part II
• Solution of the matrix equation \(AX-XB=C\)
• Three-precision GMRES-based iterative refinement for least squares problems

This page was built for publication: A mixed precision algorithm for the matrix square root

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