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

A general family of iterative methods including a free parameter is derived and proved to be
convergent for computing matrix sign function under some restrictions on the parameter …

In this paper we consider the Pad'e family of iterations for computing the matrix sign function
and the Padé family of iterations for computing the matrix p‐sector function. We prove that all …

In this article, a new matrix iterative method for computing the sign of a matrix is offered.
Convergence along with asymptotical stability of the presented method is studied. An …

Some iterative methods are introduced and demonstrated for finding the matrix sign function.
It is analytically shown that the new schemes are asymptotically stable. Convergence …

The Padé family of iterations is a well-known set of methods used to compute the matrix sign
function, which includes classical methods such as Newton's method, the Newton–Schultz …

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 target of this article is to propose a novel numerical scheme that can compete its
corresponding solvers of the same type for computing the sign matrix. To do this, a three …

In this paper we consider the Padé family of iterations [B. Laszkiewicz, K. Ziȩtak, A Padé
family of iterations for the matrix sector function and the matrix p th root, Numer. Linear …