Title: A survey and comparison of contemporary algorithms for computing the matrix geometric mean
Authors: Jeuris, Ben *
Vandebril, Raf * ×
Vandereycken, Bart #
Issue Date: 2012
Publisher: Kent State University
Series Title: Electronic Transactions on Numerical Analysis vol:39 pages:379-402
Abstract: In this paper we present a survey of various algorithms for computing matrix geometric means and derive new second-order optimization algorithms to compute the Karcher mean. These new algorithms are constructed using the standard definition of the Riemannian Hessian. The survey includes the ALM list of desired properties for a geometric mean, the analytical expression for the mean of two matrices, algorithms based on the centroid computation in Euclidean (flat) space, and Riemannian optimization techniques to compute the Karcher mean (preceded by a short introduction into differential geometry). A change of metric is considered in the optimization techniques to reduce the complexity of the structures used in these algorithms. Numerical experiments are presented to compare the existing and the newly developed algorithms. We conclude that currently first-order algorithms are best suited for this optimization problem as the size and/or number of the matrices increase.
Description: Full article freely available at the homepage of Electronic Transactions on Numerical Analysis. See enclosed link.
ISSN: 1068-9613
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Numerical Analysis and Applied Mathematics Section
* (joint) first author
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
OA_survey.pdf Published 124KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science