
doi: 10.1137/120867640
We show that any regular quadratic matrix polynomial can be reduced to an upper triangular quadratic matrix polynomial over the complex numbers preserving the finite and infinite elementary divisors. We characterize the real quadratic matrix polynomials that are triangularizable over the real numbers and show that those that are not triangularizable are quasi-triangularizable with diagonal blocks of sizes 1 × 1 and 2 × 2. We also derive complex and real Schur-like theorems for linearizations of quadratic matrix polynomials with nonsingular leading coefficients. In particular, we show that for any monic linearization λI + A of an n × n quadratic matrix polynomial there exists a nonsingular matrix defined in terms of n orthonormal vectors that transforms A to a companion linearization of a (quasi-)triangular quadratic matrix polynomial. This provides the foundation for designing numerical algorithms for the reduction of quadratic matrix polynomials to upper (quasi-)triangular form. © 2013 Society for Industrial and Applied Mathematics.
Quasi-triangular, Quadratic eigenvalue problem, Companion linearization, Schur theorem, Triangularization, Equivalence, Triangular
Quasi-triangular, Quadratic eigenvalue problem, Companion linearization, Schur theorem, Triangularization, Equivalence, Triangular
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 14 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
