Computational aspects of the Jordan canonical form
Beelen , T.;Van Dooren, Paul
(1990) Reliable Numerical Computation — ISBN: [0-19-853564-3], p. 57-72, published
Files
No attached file found for this publication.
Details
Authors
Beelen , T.Philips Research
Author
Van Dooren, PaulUCLouvain
Author
Abstract
In this paper we discuss algorithmic aspects of the computation of the Jordan canonical form. Inspired by the Golub & Wilkinson paper [9] on the computation of the Jordan canonical form, an O(n 3 ) algorithm was developed by Beelen & Van Dooren [3] for computing the Kronecker structure of an arbitrary pencil B Gamma 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 I Gamma A.
Beelen, T., & Van Dooren, P. (1990). Computational aspects of the Jordan canonical form. In M. Cox and S. Hammarling (ed.), Reliable Numerical Computation (p. p. 57-72). Oxford Univ Press. https://hdl.handle.net/2078.5/40793