A block Hankel generalized confluent Vandermonde matrix
详细信息    查看全文
文摘
Vandermonde matrices are well known. They have a number of interesting properties and play a role in (Lagrange) interpolation problems, partial fraction expansions, and finding solutions to linear ordinary differential equations, to mention just a few applications. Usually, one takes these matrices square, q×q say, in which case the i  -th column is given by u(zi), where we write u(z)=(1,z,…,zq−1)鈯?/sup>. If all the zi (i=1,…,q) are different, the Vandermonde matrix is non-singular, otherwise not. The latter case obviously takes place when all zi are the same, z   say, in which case one could speak of a confluent Vandermonde matrix. Non-singularity is obtained if one considers the matrix V(z) whose i  -th column (i=1,…,q) is given by the (i−1)-th derivative u(i−1)(z)鈯?/sup>.

We will consider generalizations of the confluent Vandermonde matrix V(z) by considering matrices obtained by using as building blocks the matrices M(z)=u(z)w(z), with u(z) as above and 22d3501d0e89a0f8ef68f2dda" title="Click to view the MathML source">w(z)=(1,z,…,zr−1), together with its derivatives M(k)(z). Specifically, we will look at matrices whose ij  -th block is given by M(i+j)(z), where the indices i,j by convention have initial value zero. These in general non-square matrices exhibit a block-Hankel structure. We will answer a number of elementary questions for this matrix. What is the rank? What is the null-space? Can the latter be parametrized in a simple way? Does it depend on z  ? What are left or right inverses? It turns out that answers can be obtained by factorizing the matrix into a product of other matrix polynomials having a simple structure. The answers depend on the size of the matrix M(z) and the number of derivatives M(k)(z) that is involved. The results are obtained by mostly elementary methods, no specific knowledge of the theory of matrix polynomials is needed.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700