Abstract
In the present paper, we proposed a new efficient rank updating methodology for evaluating the rank (or equivalently the nullity) of a sequence of block diagonal Toeplitz matrices. The results are applied to a variation of the partial realization problem. Characteristically, this sequence of block matrices is a basis for the computation of the Weierstrass canonical form of a matrix pencil that appeared in many practical numerical applications in control theory.
Original language | English |
---|---|
Pages (from-to) | 13-32 |
Number of pages | 20 |
Journal | Neural, Parallel and Scientific Computations |
Volume | 18 |
Issue number | 1 |
Publication status | Published - Mar 2010 |
Externally published | Yes |
Keywords
- Block Bidiagonal Toeplitz Matrices
- Rank Computational Algorithm