Computation of Kronecker-like forms of a system pencil: applications, algorithms and software
Andreas Varga · 2002
Kronecker-like forms of a system pencil are useful in solving many computational problems encountered in the analysis and synthesis of linear systems. The reduction of system pencils to various Kronecker-like forms can be performed by structure preserving O(n/sup 3/) complexity numerically stable algorithms. The presented algorithms form the basis of a modular collection of LAPACK compatible FORTRAN 77 subroutines to perform the reduction of a system pencil to several Kronecker-like forms.