Journal of Computational and Applied Mathematics
Partial singular value decomposition algorithm (Algorithm 32)
Journal of Computational and Applied Mathematics
Linear System Theory and Design
Linear System Theory and Design
Hi-index | 0.01 |
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.