The set of Fortran subroutines given here is an implementation of the algorithm [3] for finding the eigenvectors x and eigenvalues )~ such that A x = hx, where'A is a real skew-symmetric matrix or a real tridiagonal symmetric matrix with a constant diagonal. The algorithm uses only orthogonal similarity transformations and is believed to be the most efficient procedure available for computing all the eigenvalues or the complete eigensystem for the indicated classes of matrices.
No takes yet. Share an insight, caveat, or question.
Ward et al. (1978) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: