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.
Computational aspects of the geometric mean of two matrices: a survey
Bini D. A.
;Iannazzo B.
2024
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
