We discuss AOR type iterative methods for solving non-Hermitian linear systems based on
Hermitian splitting and skew-Hermitian splitting. Convergence domains of iterative matrices …

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 …

Bisection (of a real interval) is a well known algorithm to compute eigenvalues of symmetric
matrices. Given an initial interval [a, b], convergence to an eigenvalue which has size much …

In this paper, we generalize the Jacobi eigenvalue algorithm to compute all eigenvalues and
eigenvectors of a dual quaternion Hermitian matrix and show the convergence. We also …

In this paper, we present a new iterative method for solving a linear system, whose
coefficient matrix is an M-matrix. This method includes four parameters that are obtained by …

In this work, we consider a rational approximation of the exponential function to design an
algorithm for computing matrix exponential in the Hermitian case. Using partial fraction …

This paper aims at solving the Hermitian SDC problem, which is the simultaneous
diagonalization via *-congruence of a finite collection of Hermitian matrices. The matrices do …

The matrix exponential plays a fundamental role in the solution of differential systems which
appear in different science fields. This paper presents an efficient method for computing …

It is known that the matrix square root has a significant role in linear algebra computations
arisen in engineering and sciences. Any matrix with no eigenvalues in R-has a unique …

The inexact Rayleigh quotient iteration (RQI) is used for computing the smallest eigenpair of
a large Hermitian matrix. Under certain condition, the method was proved to converge …