Strongly minimal self-conjugate linearizations for polynomial and rational matrices

We prove that we can always construct strongly minimal linearizations of an arbitrary rational matrix from its Laurent expansion around the point at infinity, which happens to be the case for polynomial matrices expressed in the monomial basis. If the rational matrix has a particular self-conjugate structure we show how to construct strongly minimal linearizations that preserve it. The structures that are considered are the Hermitian and skew-Hermitian rational matrices with respect to the real line, and the para-Hermitian and para-skew-Hermitian matrices with respect to the imaginary axis. We pay special attention to the construction of strongly minimal linearizations for the particular case of structured polynomial matrices. The proposed constructions lead to efficient numerical algorithms for constructing strongly minimal linearizations. The fact that they are valid for any rational matrix is an improvement on any other previous approach for constructing other classes of structure preserving linearizations, which are not valid for any structured rational or polynomial matrix. The use of the recent concept of strongly minimal linearization is the key for getting such generality. Strongly minimal linearizations are Rosenbrock’s polynomial system matrices of the given rational matrix, but with a quadruple of linear polynomial matrices (i.e. pencils) :

[1]  P. Dooren.  The generalized eigenstructure problem in linear system theory , 1981 .

[2]  Daniel Kressner,et al.  Implicit QR algorithms for palindromic and even eigenvalue problems , 2009, Numerical Algorithms.

[3]  F. M. Dopico,et al.  LINEARIZATIONS OF SINGULAR MATRIX POLYNOMIALS AND THE RECOVERY OF MINIMAL INDICES , 2009 .

[4]  T. Kailath,et al.  Properties of the system matrix of a generalized state-space system , 1978 .

[5]  P. Lancaster.  Strongly stable gyroscopic systems , 1999 .

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

[7]  H. Faßbender,et al.  On vector spaces of linearizations for matrix polynomials in orthogonal bases , 2016, 1609.09493.

[8]  P. Dooren,et al.  The eigenstructure of an arbitrary polynomial matrix : Computational aspects , 1983 .

[9]  S. Liberty,et al.  Linear Systems , 2010, Scientific Parallel Computing.

[10]  G. Stewart,et al.  An Algorithm for Generalized Matrix Eigenvalue Problems. , 1973 .

[11]  Peter Lancaster,et al.  Lambda-matrices and vibrating systems , 2002 .

[12]  I. Zaballa,et al.  Finite and infinite structures of rational matrices: a local approach , 2015 .

[13]  S. Vologiannidis,et al.  Linearizations of Polynomial Matrices with Symmetries and Their Applications. , 2005, Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation Intelligent Control, 2005..

[14]  Sven Hammarling,et al.  An algorithm for the complete solution of quadratic eigenvalue problems , 2013, TOMS.

[15]  Doktor der Naturwissenschaften.  Palindromic and Even Eigenvalue Problems - Analysis and Numerical Methods , 2008 .

[16]  Ion Zaballa,et al.  On minimal bases and indices of rational matrices and their linearizations , 2019, ArXiv.

[17]  Volker Mehrmann,et al.  Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils , 2001, SIAM J. Sci. Comput..

[18]  Volker Mehrmann,et al.  Vector Spaces of Linearizations for Matrix Polynomials , 2006, SIAM J. Matrix Anal. Appl..

[19]  V. Mehrmann,et al.  An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems , 2012 .

[20]  J. Rosenthal.  Minimal Bases of Rational Vector Spaces and Their Importance in Algebraic Systems Theory , 2002 .

[21]  W. Wolovich.  State-space and multivariable theory , 1972 .

[22]  Mar'ia C. Quintana,et al.  Linear system matrices of rational transfer functions , 2019, 1903.05016.

[23]  Volker Mehrmann,et al.  Jordan structures of alternating matrix polynomials , 2010 .

[24]  Paul Van Dooren,et al.  Block Kronecker linearizations of matrix polynomials and their backward errors , 2017, Numerische Mathematik.

[25]  S. Furtado,et al.  Structured strong linearizations from Fiedler pencils with repetition I , 2014 .

[26]  P. Dooren.  A Generalized Eigenvalue Approach for Solving Riccati Equations , 1980 .

[27]  Nicholas J. Higham,et al.  Symmetric Linearizations for Matrix Polynomials , 2006, SIAM J. Matrix Anal. Appl..

[28]  Jr. G. Forney,et al.  Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems , 1975 .

[29]  Paul Van Dooren,et al.  Local Linearizations of Rational Matrices with Application to Rational Approximations of Nonlinear Eigenvalue Problems , 2019, Linear Algebra and its Applications.

[30]  Joos Vandewalle,et al.  On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansion , 1970 .

[31]  Froilán M. Dopico,et al.  Strong Linearizations of Rational Matrices , 2018, SIAM J. Matrix Anal. Appl..

[32]  G. M. L. Gladwell,et al.  Inverse Problems in Vibration , 1986 .

[33]  Froilán M. Dopico,et al.  Van Dooren's Index Sum Theorem and Rational Matrices with Prescribed Structural Data , 2019, SIAM J. Matrix Anal. Appl..

[34]  Leiba Rodman,et al.  Stable Invariant Lagrangian Subspaces: Factorization of Symmetric Rational Matrix Functions and Other Applications , 1990 .

[35]  T. Kailath,et al.  Properties of the system matrix of a generalized state-space system , 1980, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[36]  Rafikul Alam,et al.  Structured strong linearizations of structured rational matrices , 2020, Linear and Multilinear Algebra.

[37]  Zlatko Drmač,et al.  New Numerical Algorithm for Deflation of Infinite and Zero Eigenvalues and Full Solution of Quadratic Eigenvalue Problems , 2019, ACM Trans. Math. Softw..

[38]  R. Alam,et al.  Affine spaces of strong linearizations for rational matrices and the recovery of eigenvectors and minimal bases , 2019, Linear Algebra and its Applications.

[39]  Christian Mehl,et al.  Jacobi-like Algorithms for the Indefinite Generalized Hermitian Eigenvalue Problem , 2004, SIAM J. Matrix Anal. Appl..

[40]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[41]  André C. M. Ran,et al.  Necessary and sufficient conditions for existence of J-spectral factorization for para-Hermitian rational matrix functions , 2003, Autom..

[42]  Nicholas J. Higham,et al.  NLEVP: A Collection of Nonlinear Eigenvalue Problems , 2013, TOMS.

[43]  Volker Mehrmann,et al.  Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations , 2006, SIAM J. Matrix Anal. Appl..

[44]  Karl Meerbergen,et al.  The Quadratic Eigenvalue Problem , 2001, SIAM Rev..

[45]  Froilán M. Dopico,et al.  A simplified approach to Fiedler-like pencils via block minimal bases pencils , 2018, Linear Algebra and its Applications.

[46]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[47]  P. Dooren.  The Computation of Kronecker's Canonical Form of a Singular Pencil , 1979 .

[48]  Mar'ia C. Quintana,et al.  Strong linearizations of rational matrices with polynomial part expressed in an orthogonal basis , 2018, Linear Algebra and its Applications.

[49]  Froilán M. Dopico,et al.  Spectral equivalence of matrix polynomials and the index sum theorem , 2014 .

[50]  Heike Faßbender,et al.  Constructing symmetric structure-preserving strong linearizations , 2017, ACCA.