The Weierstrass Canonical Form of a Regular Matrix Pencil: Numerical Issues and Computational Techniques
In the present paper, we study the derivation of the Weierstrass Canonical Form (WCF) of a regular matrix pencil. In order to compute the WCF, we use two important computational tools: a) the QZ algorithm to specify the required root range of the pencil and b) the updating technique to compute the index of annihilation. The proposed updating technique takes advantages of the already computed rank of the sequences of matrices that appears during our procedure reducing significantly the required floating-point operations.
The algorithm is implemented in a numerical stable manner, giving efficient results. Error analysis and the required complexity of the algorithm are included.
Unable to display preview. Download preview PDF.
- 1.Chen, C.T.: Linear System Theory and Design, pp. 546–550. CBS College Publishing (1984)Google Scholar
- 2.Datta, B.N.: Numerical Linear Algebra and Applications, 2nd edn. Brooks/Cole Publishing Company, United States of America (1995)Google Scholar
- 3.Gantmacher, R.F.: The theory of matrices, Chelsea, New York., U.S.A, vol. I, II (1959)Google Scholar
- 4.Kalogeropoulos, G.: Matrix Pencils and linear systems theory. PhD thesis. Control Engineering Centre, City University, London (1985)Google Scholar
- 5.Kalogeropoulos, G., Mitrouli, M.: On the computation of the Weierstrass Canonical form of a Regular Matrix Pencil. Control and Computers 20(3), 61–67 (1992)Google Scholar
- 6.Kalogeropoulos, G.I., Pantelous, A.A.: Can be linear difference descriptor systems appeared in insurance? In: Proceedings of the 7th International Conference APLIMAT 2008, Bratislava, Slovakia, pp. 467–478 (2008)Google Scholar
- 9.Leontief, W.: Input-Output Economics, 2nd edn. Oxford Univ. Press, N. Y (1986)Google Scholar