Spectral decomposition of a matrix using the generalized sign matrix

Abstract

An algorithm for spectral decomposition is presented which does not require knowledge of eigenvalues and eigenvectors. A set of eigenprojectors are defined which covers the entire spectrum of a matrix, and special attention is given to the projection on the zero eigenvalue. Some useful applications are discussed in the paper.