A particular block Vandermonde matrix

The Vandermonde matrix is ubiquitous in mathematics and engineering. Both the Vandermonde matrix and its inverse are often encountered in control theory, in the derivation of numerical formulas, and in systems theory. In some cases block vandermonde matrices are used. Block Vandermonde matrices, considered in this paper, are constructed from a full set of solvents of a corresponding matrix polynomial. These solvents represent block poles and block zeros of a linear multivariable dynamical time-invariant system described in matrix fractions. Control techniques of such systems deal with the inverse or determinant of block vandermonde matrices. Methods to compute the inverse of a block vandermonde matrix have not been studied but the inversion of block matrices (or partitioned matrices) is very well studied. In this paper, properties of these matrices and iterative algorithms to compute the determinant and the inverse of a block Vandermonde matrix are given. A parallelization of these algorithms is also presented. The proposed algorithms are validated by a comparison based on algorithmic complexity.