An improved algorithm for the computation of Kronecker's canonical form of a singular pencil

Linear Algebra and Its Applications

Volumn 105, Issue C, 1988, Pages 9-65

  Beelen, Th ^a   Van Dooren, P ^b  

^a PHILIPS RESEARCH LABORATORIES   (Germany)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003100869     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(88)90003-1     Document Type: Article

References (24)

1. A generalized state-space approach for embedding a polynomial matrix into a unimodular matrix
2. A class of fast staircase algorithms for generalized state-space systems
3. Polynomial matrices and feedback
4. Computation of zeros of linear multivariable systems
5. On the computation of the canonical pencil of a linear system
6. RGSVD—an algorithm for computing the Kronecker structure and reducing subspaces of singular A − λB pencils
7. Matrix Pencils
8. Algebraische Reduction der Schaaren bilinear Formen
9. AB-Algorithm and its modifications for the spectral problems of linear pencils of matrices
10. Observers for multivariable systems
11. An algorithm for the generalized matrix eigenvalue problem
12. Properties of numerical algorithms related to computing controllability
13. The computation of Kronecker's canonical form of a singular pencil
14. The generalized eigenstructure problem in linear system theory
15. Deadbeat control: A special inverse eigenvalue problem
16. A reduced observer for descriptor systems
17. Linear differential equations and Kronecker's canonical form
18. Kronecker's canonical form and the QZ algorithm