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 …

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 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) …

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 …

In this article, we first introduce the necessary and sufficient conditions for the existence of
the Hermitian positive definite solution group of a system of nonlinear matrix equations X 1 p …

In this paper, an improvement to the mid-point method is contributed for finding the square
root of a matrix as well as its inverse. To this aim, an iteration scheme to find this matrix …

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 computing the Karcher mean of n positive definite matrices is proposed,
based on the majorization-minimization (MM) principle. The proposed MM algorithm is …

We investigate the stability of the matrix arithmetic-geometric mean (AGM) iteration. We
show that the classical formulation of this iteration may be not stable (a necessary and …

In this paper, two relaxed gradient-based algorithms for solving the linear matrix equation
AXB+ CXD= F AXB+ CXD= F and finding the Hermitian and skew-Hermitian solutions are …