Reduction and Normal Forms of Matrix Pencils
Olivier Verdier

TL;DR
This paper introduces an invariant-based reduction process for matrix pencils that enables the direct derivation of classical canonical forms, such as Kronecker and strangeness forms, without relying on basis choices.
Contribution
It defines invariants and reduction methods for matrix pencils directly invariantly, facilitating the construction of canonical forms without basis dependence.
Findings
Invariant reduction process relates to canonical forms.
Invariants determine subspace dimensions and regularity.
Constructs Kronecker and strangeness canonical forms invariantly.
Abstract
Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables, or linear combination of the equations. This change of variables or equations is associated to a group action. The invariants corresponding to this group action are well known, namely the Kronecker indices and divisors. Similarly, for another group action corresponding to the weak equivalence, a complete set of invariants is also known, among others the strangeness. We show how to define those invariants in a directly invariant fashion, i.e. without using a basis or an extra Euclidean structure. To this end, we will define a reduction process which produces a new system out of the original one. The various invariants may then be defined from…
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.
Taxonomy
TopicsMatrix Theory and Algorithms · Numerical methods for differential equations · Advanced Numerical Methods in Computational Mathematics
