Matlab code for sorting real Schur forms
Author:
- 13 February 2002
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 9 (3) , 249-261
Abstract
In Matlab 6, there exists a command to generate a real Schur form, wheras another transforms a real Schur form into a complex one. There do not exist commands to prescribe the order in which the eigenvalues appear on the diagonal of the upper (quasi‐) triangular factor T. For the complex case, a routine is sketched in Golub and Van Loan (Matrix Computations (3rd edn). The John Hopkins University Press: Baltimore and London, 1996), that orders the diagonal of T according to their distance to a target value τ. In this technical note, we give a Matlab routine to sort real Schur forms in Matlab. It is based on a block‐swapping procedure by Bai and Demmel (Linear Algebra and Its Applications 1993; 186: 73) We also describe how to compute a partial real Schur form (see Saad (Numerical methods for large eigenvalue problems. Manchester University Press: Manchester, 1992.)) in case the matrix A is very large. Sorting real Schur forms, both partially and completely, has important applications in the computation of real invariant subspaces. Copyright © 2002 by John Wiley & Sons, Ltd.Keywords
This publication has 4 references indexed in Scilit:
- Templates for the Solution of Algebraic Eigenvalue Problems2000
- On swapping diagonal blocks in real Schur formLinear Algebra and its Applications, 1993
- Numerical Considerations in Computing Invariant SubspacesSIAM Journal on Matrix Analysis and Applications, 1992
- An algorithm for numerical determination of the structure of a general matrixBIT Numerical Mathematics, 1970