On computing root polynomials and minimal bases of matrix pencils
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Authors
Date
2023-02-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
30
Series
Linear Algebra and Its Applications, Volume 658, pp. 86-115
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 λE+A. 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 (λ−λ0)E+(A−λ0E), constructs a block triangular pencil from which a minimal basis and a maximal set of root polynomials at the eigenvalue λ0, can be computed in an efficient manner.Description
Funding Information: Supported by an Academy of Finland grant (Suomen Akatemian päätös 331240).Supported by an Aalto Science Institute Visitor Programme. Publisher Copyright: © 2022 The Author(s)
Keywords
Local Smith form, Matrix pencil, Maximal set, Minimal basis, Root polynomial, Smith form, Staircase algorithm
Other note
Citation
Noferini, V & Van Dooren, P 2023, ' On computing root polynomials and minimal bases of matrix pencils ', Linear Algebra and Its Applications, vol. 658, pp. 86-115 . https://doi.org/10.1016/j.laa.2022.10.025