In this paper, by applying the real representations of complex matrices, the particular
structure of the real representations and the Moore–Penrose generalized inverse, we obtain …

Let A, B and C be three n× n nonzero Hermitian matrices. The triple (A, B, C) is called
definite if the convex hull of the joint numerical range F (A, B, C)={(x∗ Ax, x∗ Bx, x∗ Cx)∈ R …

We address the general mathematical problem of computing the inverse $ p $-th root of a
given matrix in an efficient way. A new method to construct iteration functions that allow …

The aim of this article is to develop and analyze the matrix iterative method for computing the
Moore–Penrose inverse of a given complex matrix. The theoretical analysis of the presented …

We introduce the two‐sided Rayleigh quotient shift to the QR algorithm for non‐Hermitian
matrices to achieve a cubic local convergence rate. For the singly shifted case, the two …

The aim of this paper is to propose a higher order iterative method for computing the outer
inverse A^(2)_T,S for a given matrix A. Convergence analysis along with the error bounds of …

Two iterative algorithms are presented in this paper to solve the minimal norm least squares
solution to a general linear matrix equations including the well-known Sylvester matrix …

In this work we consider the convergence behavior of a variant of Newton's method based
on the geometric mean. The convergence properties of this method for solving equations …

Some matrix equations are important in application and studying in various fields of
sciences. One of them is continuous-time algebraic Riccati matrix equation that is an …

Convergence of Two-Stage Iterative Methods for Hermitian Positive Definite Matrices Page 1
Appl. Math. Lett. Vol. 10, No. 3, pp. 79–83, 1997 Pergamon Copyright c 1997 Elsevier Science …