This paper provides an iterative algorithm to jointly approximately diagonalize K Hermitian
positive definite matrices \bfΓ_1,\dots, \bfΓ_K. Specifically, it calculates the matrix B which …

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 …

Solving a linear system in a minimum time is a key factor in many scientific fields. It is
possible to reduce time of computation for a given linear system by using auto-tuning and …

It is shown that the matrix sequence generated by Euler's method starting from the identity
matrix converges to the principal p th root of a square matrix, if all the eigenvalues of the …

The Jacobi–Davidson iteration method is efficient for computing several eigenpairs of
Hermitian matrices. Although the involved correction equation in the Jacobi–Davidson …

We present an algorithm for the approximation of the dominant singular values and
corresponding right and left singular vectors of a complex symmetric matrix. The method is …

Computing all eigenvalues of a modest size matrix typically proceeds in two phases. In the
first phase, the matrix is transformed to a suitable condensed matrix format, sharing the …

Recently, some research has been devoted to finding the explicit forms of the η-Hermitian
and η-anti-Hermitian solutions of several kinds of quaternion matrix equations and their …

Trigonometric matrix functions play a fundamental role in second order differential systems.
In this article an efficient and highlyaccurate Hermite algorithm is presented for the …

Projection Method for the Decomposition of Hermitian Matrices into Pauli Matrices ( ) ( ) { } } ( )
Page 1 Projection Method for the Decomposition of Hermitian Matrices into Pauli Matrices …