The problem of joint approximate diagonalization of symmetric real matrices is addressed. It is reduced to an optimization problem with the restriction that the matrix of the similarity transformation ...

Abstract: The paper addresses the blind signal separation problem in the presence of sensor noise for the case where the source signals are non-stationary and/or non-white. This problem can be ...

Iterative diagonalization of large matrices to search for a subset of eigenvalues that may be of interest has become routine throughout the field of quantum chemistry. Lanczos and Davidson algorithms ...

The two-by-two Sp(2) matrix has three parameters with unit determinant. Yet, there are no established procedures for diagonalizing this matrix. It is shown that this matrix can be written as a ...

In this paper, we study the network pinning control problem in the presence of two different types of coupling: (i) node-to-node coupling among the network nodes and (ii) input-to-node coupling from ...

The diagonalization of general mass matrices is a more delicate problem when eigenvalue degeneracies exist. In this case, often overlooked in the literature, some difficulties arise related to the ...

This is a parallelized project aimed at accelerating the diagonalization of matrices through parallelization techniques. The project utilizes OpenMP to achieve a ...

Department of Cyber-Physical Systems, Clark Atlanta University, Atlanta, GA, USA. where P is some reflection (symmetric signed permutation) matrix. Like U, the generalized reflexive matrices A arise ...