Locating eigenvalues of quadratic matrix polynomials
In this very nice paper, the authors present some new methods to localize eigenvalues of quadratic matrix polynomials. The quadratic eigenvalue problem is one of the most important eigenvalue problems in applications (e.g., in mechanics). Locating the eigenvalues with respect to the imaginary axis, the unit circle or the real line can give useful information concerning the stability of the system. The main idea of the paper is to apply some block versions of the Gershgorin circle theorem to some classic linearization of the quadratic matrix polynomial. With this method, the authors obtain some simple sufficient conditions of the coefficient matrices of the polynomial so that its eigenvalues are located in some interesting areas of the complex plane. This allows the authors also to derive new upper and lower bounds on the eigenvalues of quadratic matrix polynomials.
- Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem
- Bounds for eigenvalues of matrix polynomials
- Damped oscillations of linear systems. A mathematical introduction
- Hamiltonian eigenvalue symmetry for quadratic operator eigenvalue problems
- scientific article; zbMATH DE number 4131067 (Why is no real title available?)
- scientific article; zbMATH DE number 4075872 (Why is no real title available?)
- scientific article; zbMATH DE number 2120941 (Why is no real title available?)
- scientific article; zbMATH DE number 3236302 (Why is no real title available?)
- scientific article; zbMATH DE number 3189385 (Why is no real title available?)
- Locating the Eigenvalues of Matrix Polynomials
- Möbius transformations of matrix polynomials
- On some metrical properties of operator matrices and matrices partitioned into blocks
- On the inertia of the block H-matrices.
- Perturbation of purely imaginary eigenvalues of Hamiltonian matrices under structured perturbations
- Perturbation theory for Hamiltonian matrices and the distance to bounded-realness
- Stability of invariant maximal semidefinite subspaces. I
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Symmetric Linearizations for Matrix Polynomials
- The autonomous linear quadratic control problem. Theory and numerical solution
- The quadratic eigenvalue problem
- Tropical roots as approximations to eigenvalues of matrix polynomials
- Vector Spaces of Linearizations for Matrix Polynomials
- Eigenvalue localization of \(G\)-stable matrix polytopes
- Computing the distance to continuous-time instability of quadratic matrix polynomials
- On the Geršgorin-type localizations for nonlinear eigenvalue problems
- On the computation of the distance to quadratic matrix polynomials that are singular at some points on the unit circle
- Localization of eigenvalues of polynomial matrices
- A survey of the progress of locating methods of complex matrices' eigenvalues and some new location theorem and their applications
- scientific article; zbMATH DE number 4112481 (Why is no real title available?)
- On nonmonic quadratic matrix polynomials with nonnegative coefficients
- Krylov Method Revisited with an Application to the Localization of Eigenvalues
- Matrices whose eigenvalues are those of a quadratic matrix polynomial
- Gershgorin type inclusion-exclusion sets for matrix polynomials
- Some results on the stability of matrix polynomials
- Stability of quaternion matrix polynomials
- Fast stability tests for Hermitian matrix polynomials
This page was built for publication: Locating eigenvalues of quadratic matrix polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2151584)
