Quadratic eigenvalue problem

Quadratic eigenvalue problem

In mathematics, the "'quadratic eigenvalue problem [F. Tisseur and K. Meerbergen, The quadratic eigenvalue problem, SIAMRev., 43 (2001), pp. 235–286.] (QEP)"', is to find scalar eigenvalues lambda,, left eigenvectors y, and right eigenvectors x, such that

: Q(lambda)x = 0 ext{ and }y^ast Q(lambda) = 0,,

where Q(lambda)=lambda^2 A_2 + lambda A_1 + A_0,, with matrix coefficients A_2, , A_1, A_0 in mathbb{C}^{n imes n} and A_0, in mathbb{C}^{n imes n} and we require that A_2, eq 0, (so that we have a nonzero leading coefficient). There are 2n, eigenvalues that may be "infinite" or finite, and possibly zero. This is a special case of a nonlinear eigenproblem. Q(lambda) is also known as a quadratic matrix polynomial.

Applications

A QEP can result in part of the dynamic analysis of structures discretized by the finite element method. In this case the quadratic, Q(lambda), has the form Q(lambda)=lambda^2 M + lambda C + K,, where M, is the mass matrix, C, is the damping matrix and K, 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 Ax = lambda x and Ax = lambda B x 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 ( A-lambda B), 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 :L(lambda) = lambdaegin{bmatrix}M & 0 \0 & I_n end{bmatrix}+egin{bmatrix}C & K \-I_n & 0 end{bmatrix}, where I_n is the n-by-n identity matrix, with corresponding eigenvector :z = egin{bmatrix}lambda x \xend{bmatrix}.We solve L(lambda) z = 0 for lambda and z, for example by computing the Generalized Schur form. We can then take the first n components of z as the eigenvector x of the original quadratic Q(lambda).

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Eigenvalue, eigenvector and eigenspace — In mathematics, given a linear transformation, an Audio|De eigenvector.ogg|eigenvector of that linear transformation is a nonzero vector which, when that transformation is applied to it, changes in length, but not direction. For each eigenvector… …   Wikipedia

  • Quadratic programming — (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.The quadratic programming problem… …   Wikipedia

  • Eigenvalue algorithm — In linear algebra, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Contents 1 Characteristic polynomial 2 Power… …   Wikipedia

  • Eigenvalues and eigenvectors — For more specific information regarding the eigenvalues and eigenvectors of matrices, see Eigendecomposition of a matrix. In this shear mapping the red arrow changes direction but the blue arrow does not. Therefore the blue arrow is an… …   Wikipedia

  • Nonlinear eigenproblem — A nonlinear eigenproblem is a generalization of an ordinary eigenproblem to equations that depend nonlinearly on the eigenvalue. Specifically, it refers to equations of the form: where x is a vector (the nonlinear eigenvector ) and A is a matrix… …   Wikipedia

  • Modal analysis using FEM — The goal of modal analysis in structural mechanics is to determine the natural mode shapes and frequencies of an object or structure during free vibration. It is common to use the finite element method (FEM) to perform this analysis because, like …   Wikipedia

  • List of mathematics articles (Q) — NOTOC Q Q analog Q analysis Q derivative Q difference polynomial Q exponential Q factor Q Pochhammer symbol Q Q plot Q statistic Q systems Q test Q theta function Q Vandermonde identity Q.E.D. QED project QR algorithm QR decomposition Quadratic… …   Wikipedia

  • Matrix pencil — If are complex matrices for some nonnegative integer l, and (the zero matrix), then the matrix pencil of degree l is the matrix valued function defined on the complex numbers A particular case is a linear matrix pencil …   Wikipedia

  • Partial differential equation — A visualisation of a solution to the heat equation on a two dimensional plane In mathematics, partial differential equations (PDE) are a type of differential equation, i.e., a relation involving an unknown function (or functions) of several… …   Wikipedia

  • Convex optimization — Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. Given a real vector space X together with a convex, real valued function defined on a convex subset of X, the problem is to find …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”