A finite difference exponential approximation method

Abstract

The algorithm described in this paper is essentially a Jacobi-like procedure employing Householder and Jacobi orthogonal similarity transformations successively on a real symmetric matrix to obtain, in the limit, a diagonal matrix of eigenvalues. The columns of the product matrix of all the orthogonal transformations, taken in the proper order, form a complete orthonormal set of eigenvectors.