A Computational Algorithm for the Eigenvectors of a Singular Matrix

In this paper a computational, non-iterative type algorithm is given to obtain the eigenvectors of a singular matrix. The algorithm yields a smaller nonsingular matrix that has exactly the same nonzero eigenvalues as the given singular matrix and only these eigenvalues. The eigenvectors for the singular matrix are constructed from the eigenvectors of the nonsingular matrix. The eigenvectors associated with the zero eigenvalues of the singular matrix are an immediate consequence of the algorithm.