Abstract. The classical approach to investigating polynomial eigenvalue problems is linearization, where the polynomial is converted into a larger matrix pencil with the same eigenvalues. For any polynomial there are infinitely many linearizations with widely varying properties, but in practice the companion forms are typically used. However, these companion forms are not always entirely satisfactory, and linearizations with special properties may sometimes be required.Given a matrix polynomial P , we develop a systematic approach to generating large classes of linearizations for P . We show how to simply construct two vector spaces of pencils that generalize the companion forms of P , and prove that almost all of these pencils are linearizations for P . Eigenvectors of these pencils are shown to be closely related to those of P . A distinguished subspace is then isolated, and the special properties of these pencils are investigated. These spaces of pencils provide a convenient arena in which to look for structured linearizations of structured polynomials, as well as to try to optimize the conditioning of linearizations [7], [8], [12].
Many applications give rise to nonlinear eigenvalue problems with an underlying structured matrix polynomial. In this paper several useful classes of structured polynomials (e.g., palindromic, even, odd) are identified and the relationships between them explored. A special class of linearizations which reflect the structure of these polynomials, and therefore preserve symmetries in their spectra, is introduced and investigated. We analyze the existence and uniqueness of such linearizations and show how they may be systematically constructed.
A wide class of matrix pencils connected with dissipative Hamiltonian descriptor systems is investigated. In particular, the following properties are shown: all eigenvalues are in the closed left half plane, the nonzero finite eigenvalues on the imaginary axis are semisimple, the index is at most two, and there are restrictions for the possible left and right minimal indices. For the case that the eigenvalue zero is not semisimple, a structurepreserving method is presented that perturbs the given system into a Lyapunov stable system.
We discuss Möbius transformations for general matrix polynomials over arbitrary fields, analyzing their influence on regularity, rank, determinant, constructs such as compound matrices, and on structural features including sparsity and symmetry. Results on the preservation of spectral information contained in elementary divisors, partial multiplicity sequences, invariant pairs, and minimal indices are presented. The effect on canonical forms such as Smith forms and local Smith forms, on relationships of strict equivalence and spectral equivalence, and on the property of being a linearization or quadratification are investigated. We show that many important transformations are special instances of Möbius transformations, and analyze a Möbius connection between alternating and palindromic matrix polynomials. Finally, the use of Möbius transformations in solving polynomial inverse eigenproblems is illustrated.
Abstract. Many applications give rise to matrix polynomials whose coefficients have a kind of reversal symmetry, a structure we call palindromic. Several properties of scalar palindromic polynomials are derived, and together with properties of compound matrices, used to establish the Smith form of regular and singular T -palindromic matrix polynomials over arbitrary fields. The invariant polynomials are shown to inherit palindromicity, and their structure is described in detail. Jordan structures of palindromic matrix polynomials are characterized, and necessary conditions for the existence of structured linearizations established. In the odd degree case, a constructive procedure for building palindromic linearizations shows that the necessary conditions are sufficient as well. The Smith form for * -palindromic polynomials is also analyzed. Finally, results for palindromic matrix polynomials over fields of characteristic two are presented.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.