On computing root polynomials and minimal bases of matrix pencils

We revisit the notion of root polynomials, thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37–78, 2020] for general polynomial matrices, and show how they can efficiently be computed in the case of matrix pencils. The staircase algorithm implicitly computes so-called zero directions, as defined in [P. Van Dooren, Computation of zero directions of transfer functions, Proceedings IEEE 32nd CDC, 3132–3137, 1993]. However, zero directions generally do not provide the correct information on partial multiplicities and minimal indices. These indices are instead provided by two special cases of zero directions, namely, root polynomials and vectors of a minimal basis of the pencil. We show how to extract, starting from the block triangular pencil that the staircase algorithm computes, both a minimal basis and a maximal set of root polynomials in an efficient manner. Moreover, we argue that the accuracy of the computation of the root polynomials can be improved by making use of iterative refinement.

[1]  Martin Lotz,et al.  Wilkinson’s Bus: Weak Condition Numbers, with an Application to Singular Polynomial Eigenproblems , 2019, Found. Comput. Math..

[2]  Froilán M. Dopico,et al.  Fiedler Companion Linearizations and the Recovery of Minimal Indices , 2010, SIAM J. Matrix Anal. Appl..

[3]  Vanni Noferini,et al.  Fiedler-comrade and Fiedler-Chebyshev pencils , 2016, SIAM J. Matrix Anal. Appl..

[4]  V. Noferini,et al.  Root polynomials and their role in the theory of matrix polynomials , 2020, Linear Algebra and its Applications.

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

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

[7]  Vanni Noferini,et al.  Relative-error stability of numerical algorithms , 2021, ArXiv.

[8]  P. Van Dooren,et al.  A pencil approach for embedding a polynomial matrix into a unimodular matrix , 1988 .

[9]  P. Dooren.  Computation of zero directions of transfer functions , 1993 .

[10]  D. Steven Mackey,et al.  Minimal indices and minimal bases via filtrations , 2021 .

[11]  Stephan Trenn,et al.  The Quasi-Kronecker Form For Matrix Pencils , 2012, SIAM J. Matrix Anal. Appl..

[12]  N. Karcanias,et al.  The fundamental subspace sequences of matrix pencils: A toeplitz matrix unified characterization , 1998 .

[13]  P. Dooren,et al.  An improved algorithm for the computation of Kronecker's canonical form of a singular pencil , 1988 .

[14]  X. Caruso.  Numerical stability of Euclidean algorithm over ultrametric fields , 2017 .

[15]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[16]  Vanni Noferini,et al.  The behaviour of the complete eigenstructure of a polynomial matrix under a generic rational transformation , 2011, 1111.4004.

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

[18]  K. Wong.  The eigenvalue problem λTx + Sx , 1974 .

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

[20]  N. Karcanias.  Minimal Bases of Matrix Pencils: Algebraic Toeplitz Structure and Geometric Properties , 1994 .

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

[22]  Federico Poloni,et al.  Duality of matrix pencils, Wong chains and linearizations , 2015 .

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

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