Computational aspects of the geometric mean of two matrices: a survey
Open Access
- 4 September 2024
- journal article
- review article
- Published by Springer Nature in Acta Scientiarum Mathematicarum
- Vol. 90 (3-4) , 349-389
Abstract
Algorithms for the computation of the (weighted) geometric mean G of two positive definite matrices are described and discussed. For large and sparse matrices the problem of computing the product $$y=Gb$$ , and of solving the linear system $$Gx=b$$ , without forming G, is addressed. An analysis of the conditioning is provided. Substantial numerical experimentation is carried out to test and compare the performances of these algorithms in terms of CPU time, numerical stability, and number of iterative steps.
Keywords
Funding Information
- Universitá di Perugia (AIDMIX)
- Gruppo Nazionale per il Calcolo Scientifico
This publication has 71 references indexed in Scilit:
- Algorithms for Approximating Means of Semi-infinite Quasi-Toeplitz Matrices2021
- Computing the matrix geometric mean: Riemannian versus Euclidean conditioning, implementation techniques, and a Riemannian BFGS methodNumerical Linear Algebra with Applications, 2020
- State-of-the-Art Sparse Direct Solvers2020
- Optimal solvers for linear systems with fractional powers of sparse SPD matricesNumerical Linear Algebra with Applications, 2018
- The geometric mean of two matrices from a computational viewpointNumerical Linear Algebra with Applications, 2015
- Numerical approximation to the fractional derivative operatorNumerische Mathematik, 2013
- A new investigation of the extended Krylov subspace method for matrix function evaluationsNumerical Linear Algebra with Applications, 2010
- Log‐Euclidean metrics for fast and simple calculus on diffusion tensorsMagnetic Resonance in Medicine, 2006
- A rigorous framework for diffusion tensor calculusMagnetic Resonance in Medicine, 2004
- Means of positive linear operatorsMathematische Annalen, 1980