On computing root polynomials and minimal bases of matrix pencils

Noferini, Vanni;Van Dooren, Paul
(2023) Linear Algebra and Its Applications — Vol. 658, p. 86-115 (2023)

Files

NoferiniV22.pdf
  • Open Access
  • Adobe PDF
  • 495.12 KB
Download

Details

Authors
  • Noferini, Vanniorcid-logoAalto University,Finland
    Author
  • Van Dooren, PaulUCLouvain
    Author
Abstract
We revisit the notion of root polynomials, thoroughly studied in (Dopico and Noferini, 2020 [9]) for general polynomial matrices, and show how they can efficiently be computed in the case of a matrix pencil . The method we propose makes extensive use of the staircase algorithm, which is known to compute the left and right minimal indices of the Kronecker structure of the pencil. In addition, we show here that the staircase algorithm, applied to the expansion , constructs a block triangular pencil from which a minimal basis and a maximal set of root polynomials at the eigenvalue , can be computed in an efficient manner.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Noferini, V., & Van Dooren, P. (2023). On computing root polynomials and minimal bases of matrix pencils. Linear Algebra and Its Applications, 658, 86-115. https://doi.org/10.1016/j.laa.2022.10.025 (Original work published 2023)