Robustness and perturbations of minimal bases II: The case with given row degrees
Froil\'an M. Dopico, Paul Van Dooren

TL;DR
This paper extends the analysis of minimal bases in polynomial matrices to cases with inhomogeneous row degree bounds, demonstrating generic properties and robustness under perturbations using new trimmed Sylvester matrices.
Contribution
It generalizes previous results to inhomogeneous row degrees, introducing trimmed Sylvester matrices and proving generic minimal basis properties and perturbation robustness.
Findings
Polynomial matrices are generically minimal bases with specified row degrees.
Right minimal indices differ at most by one and sum to the total degree.
Minimal bases are robust under perturbations and vary smoothly.
Abstract
This paper studies generic and perturbation properties inside the linear space of polynomial matrices whose rows have degrees bounded by a given list of natural numbers, which in the particular case is just the set of polynomial matrices with degree at most . Thus, the results in this paper extend to a much more general setting the results recently obtained in [Van Dooren & Dopico, Linear Algebra Appl. (2017), http://dx.doi.org/10.1016/j.laa.2017.05.011] only for polynomial matrices with degree at most . Surprisingly, most of the properties proved in [Van Dooren & Dopico, Linear Algebra Appl. (2017)], as well as their proofs, remain to a large extent unchanged in this general setting of row degrees bounded by a list that can be arbitrarily inhomogeneous provided the well-known Sylvester matrices of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
