Inversion of mosaic Hankel matrices via matrix polynomial systems

Abstract Heinig and Tewodors [18] give a set of components whose existence provides a necessary and sufficient condition for a mosaic Hankel matrix to be nonsingular. When this is the case, they also give a formula for the inverse in terms of these components. By converting these components into a matrix polynomial form, we show that the invertibility conditions can be described in terms of matrix rational approximants for a matrix power series determined from the entries of the mosaic matrix. In special cases these matrix rational approximations are closely related to Pade and various well-known matrix-type Pade approximants. We also show that the inversion components can be described in terms of unimodular matrix polynomials. These are shown to be closely related to the V and W matrices of Antoulas used in his study of recursiveness in linear systems. Finally, we present a recursion which allows for the efficient computation of the inversion components of all nonsingular “principal mosaic Hankel” submatrices (including the components for the matrix itself).

[1]  S. Barnett,et al.  Some extensions of Hankel and Toeplitz matrices , 1983 .

[2]  David Y. Y. Yun,et al.  Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.

[3]  Georg Heinig,et al.  Algebraic Methods for Toeplitz-like Matrices and Operators , 1984 .

[4]  B. Beckermann,et al.  A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants , 1994, SIAM J. Matrix Anal. Appl..

[5]  Martin H. Gutknecht,et al.  Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems , 1993 .

[6]  George Labahn,et al.  Inversion components of block Hankel-like matrices , 1992 .

[7]  George Labahn,et al.  On the theory and computation of nonperfect Pade´-Hermite approximants , 1992 .

[8]  I. Gohberg,et al.  Complexity of multiplication with vectors for structured matrices , 1994 .

[9]  W. Gragg,et al.  The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis , 1972 .

[10]  Georg Heinig,et al.  Kernel structure of block Hankel and Toeplitz matrices and partial realization , 1992 .

[11]  Brian D. O. Anderson,et al.  Rational interpolation and state-variable realizations , 1990 .

[12]  Stanley Cabay,et al.  Algebraic Computations of Scaled Padé Fractions , 1986, SIAM J. Comput..

[13]  A. Antoulas On recursiveness and related topics in linear systems , 1986 .

[14]  S. Cabay,et al.  A weakly stable algorithm for Pade´ approximants and the inversion of Hankel matrices , 1993 .

[15]  Keith O. Geddes,et al.  Algorithms for computer algebra , 1992 .

[16]  George Labahn,et al.  The Inverses of Block Hankel and Block Toeplitz Matrices , 1990, SIAM J. Comput..

[17]  M. Tismenetsky,et al.  Generalized Bezoutian and the inversion problem for block matrices, I. General scheme , 1986 .

[18]  Israel Gohberg,et al.  Circulants, displacements and decompositions of matrices , 1992 .