Using the relation between a principal matrix square root and its inverse with the geometric
mean, we present a fast algorithm for computing the geometric mean of two Hermitian …

The purpose of this research is to present a novel scheme based on a quick iterative
scheme for calculating the matrix geometric mean of two Hermitian positive definite (HPD) …

In this work, an iterative method is developed to find the matrix sign function. It is discussed
in detail that the method is novel in comparison to its competitors from the Padé family of …

The target of this work is to present a multiplication-based iterative method for two Hermitian
positive definite matrices to find the geometric mean. The method is constructed via the …

The set of Hermitian positive-definite matrices plays fundamental roles in many disciplines
such as mathematics, numerical analysis, probability and statistics, engineering, and …

An algorithm for computing the Karcher mean of n positive definite matrices is proposed,
based on the majorization-minimization (MM) principle. The proposed MM algorithm is …

Computing the Karcher mean of symmetric positive definite matrices Page 1 Linear Algebra and
its Applications 438 (2013) 1700–1710 Contents lists available at SciVerse ScienceDirect …

The geometric mean of two matrices is considered from a computational viewpoint. Several
numerical algorithms based on different properties and representations of the geometric …

An algorithm for numerically computing an interval matrix containing the geometric mean of
two Hermitian positive definite (HPD) matrices is proposed. We consider a special …

A majorization-minimization (MM) algorithm for the Karcher mean of np× p positive definite
matrices is proposed and it is gauranteed to converge linearly. Simulations show that the …