Computational aspects of the Jordan canonical form
Theo G. J. Beelen, Paul Van Dooren · 1990
Abstract In this paper we discuss algorithmic aspects of the computation of the Jordan canonical form. Inspired by Golub and Wilkinson (1976) on the computation of the Jordan canonical form, an O(n) algorithm was developed by Beelen and Van Dooren (1988) for computing the Kronecker structure of an arbitrary pencil AB - A. Here we show how the ideas of this algorithm lead to a special algorithm for reconstructing the Jordan structure of the standard eigenvalue problem Al - A.