Several of you have asked me about more information about Jordan normal forms, like proofs or algorithms. There is no time in the lectures to really do the proofs and it is my experience that exercises in constructing nontrivial Jordan forms for examples is not a popular past-time for most of you. But for those interested I link here two manuscripts that may be of use: a relatively compact proof of the Jordan normal form theorem (Prof Sebastian van Strien's appendix to the M2AA1 lecture notes of last year), and
a more constructive and algorithmic approach to Jordan forms (2005 notes by Dr Stefan Friedl)

## Wednesday, 10 February 2016

Subscribe to:
Post Comments (Atom)

## No comments:

## Post a Comment