Quadratic eigenvalue problem

This is an old revision of this page, as edited by Youboo4 (talk | contribs) at 22:09, 9 March 2023 (Methods of solution: modified linearization notation to better match the reference). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, the quadratic eigenvalue problem[1] (QEP), is to find scalar eigenvalues , left eigenvectors and right eigenvectors such that

where , with matrix coefficients and we require that , (so that we have a nonzero leading coefficient). There are eigenvalues that may be infinite or finite, and possibly zero. This is a special case of a nonlinear eigenproblem. is also known as a quadratic polynomial matrix.

Applications

Systems of differential equations

Quadratic eigenvalue problems arise naturally in the solution of systems of second order linear differential equations without forcing:

 

Where  , and  . If all quadratic eigenvalues of   are distinct, then the solution can be written as

 

Where  ,  , and  . Stability theory for linear equations can now be applied, as the behavior of a solution depends explicitly on the (quadratic) eigenvalues.

Finite element methods

A QEP can result in part of the dynamic analysis of structures discretized by the finite element method. In this case the quadratic,   has the form  , where   is the mass matrix,   is the damping matrix and   is the stiffness matrix. Other applications include vibro-acoustics and fluid dynamics.

Methods of solution

Direct methods for solving the standard or generalized eigenvalue problems   and   are based on transforming the problem to Schur or Generalized Schur form. However, there is no analogous form for quadratic matrix polynomials. One approach is to transform the quadratic matrix polynomial to a linear matrix pencil ( ), and solve a generalized eigenvalue problem. Once eigenvalues and eigenvectors of the linear problem have been determined, eigenvectors and eigenvalues of the quadratic can be determined.

The most common linearization is the first companion linearization

 

where   is the  -by-  identity matrix, with corresponding eigenvector

 

We solve   for   and  , for example by computing the Generalized Schur form. We can then take the first   components of   as the eigenvector   of the original quadratic  .

References

  1. ^ F. Tisseur and K. Meerbergen, The quadratic eigenvalue problem, SIAM Rev., 43 (2001), pp. 235–286.