2001
DOI: 10.1137/s0036144500381988
|View full text |Cite
|
Sign up to set email alerts
|

The Quadratic Eigenvalue Problem

Abstract: We survey the quadratic eigenvalue problem, treating its many applications, its mathematical properties, and a variety of numerical solution techniques. Emphasis is given to exploiting both the structure of the matrices in the problem (dense, sparse, real, complex, Hermitian, skew-Hermitian) and the spectral properties of the problem. We classify numerical methods and catalogue available software.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
943
0
13

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 1,173 publications
(959 citation statements)
references
References 124 publications
3
943
0
13
Order By: Relevance
“…For these systems, a quadratic eigenvalue problem [4] must be solved to obtain a coherent modal description of the problem, using left and right complex modes. In this paper, we propose to extend the symmetric properness condition to non symmetric systems.…”
Section: Introductionmentioning
confidence: 99%
“…For these systems, a quadratic eigenvalue problem [4] must be solved to obtain a coherent modal description of the problem, using left and right complex modes. In this paper, we propose to extend the symmetric properness condition to non symmetric systems.…”
Section: Introductionmentioning
confidence: 99%
“…In this case R max = 0.052 m, f max approximate 3 GHz. According to the recursion step introduced by (17), two solutions are presented in Table 1. Solution 1 carries segmentation from f L , whereas Solution 2 performs reversely.…”
Section: Numerical Results and Discussionmentioning
confidence: 99%
“…Compared to the mature level of the techniques for the linear system [17], the development of second-order techniques is a relatively new topic, but has raised growing interest, including Second Order Arnoldi [18], Second order dominant pole identification [19] and Quadratic Arnoldi algorithm [11]. In this paper, Quadratic Arnoldi algorithm (Q-arnoldi) are adopted as the numerical method, in terms of its remarkable feature of favoring the convergence to the particular eigenvalues using the strategies of implicit restarting or purging [17].…”
Section: Dominant Pole Identification Using Q-arnolimentioning
confidence: 99%
See 1 more Smart Citation
“…In many applications, the study of spectral properties of matrix polynomials is a central topic [8,21,22,24,34,38]. A common technique to find the eigenvalues of a matrix polynomial is converting to a linear problem using the following method.…”
Section: Linearizations Of Matrix Polynomialsmentioning
confidence: 99%