Answers are grounded in this paper and cite their sources.
An algorithm is described for computing the eigenvalues and (optionally) the eigenvectors of either a skew-symmetrm matrix or a symmetric tndiagonal matrix with constant diagonal The algomthm uses only orthogonal similarity transformations and is believed to be the most efficmnt procedure available for computmg all the elgenvalues or the complete elgensystem.
No takes yet. Share an insight, caveat, or question.
Ward et al. (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: