In mathematics, the quadratic eigenvalue problem (QEP), is to find scalar eigenvalues λ {\displaystyle \lambda } , left eigenvectors y {\displaystyle y} and right eigenvectors x {\displaystyle x} such that
where Q ( λ ) = λ 2 M + λ C + K {\displaystyle Q(\lambda )=\lambda ^{2}M+\lambda C+K} , with matrix coefficients M , C , K ∈ C n × n {\displaystyle M,\,C,K\in \mathbb {C} ^{n\times n}} and we require that M ≠ 0 {\displaystyle M\,\neq 0} , (so that we have a nonzero leading coefficient). There are 2 n {\displaystyle 2n} eigenvalues that may be infinite or finite, and possibly zero. This is a special case of a nonlinear eigenproblem. Q ( λ ) {\displaystyle Q(\lambda )} is also known as a quadratic polynomial matrix.