Abstract | ||
---|---|---|
The rational eigenvalue problem is an emerging class of nonlinear eigenvalue problems arising from a variety of physical applications. In this paper, we propose a linearization-based method to solve the rational eigenvalue problem. The proposed method converts the rational eigenvalue problem into a well-studied linear eigenvalue problem, and meanwhile, exploits and preserves the structure and properties of the original rational eigenvalue problem. For example, the low-rank property leads to a trimmed linearization. We show that solving a class of rational eigenvalue problems is just as convenient and efficient as solving linear eigenvalue problems. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1137/090777542 | SIAM J. Matrix Analysis Applications |
Keywords | Field | DocType |
physical application,well-studied linear eigenvalue problem,low-rank property,linearization-based method,linear eigenvalue problem,rational eigenvalue problem,rational eigenvalue problems,original rational eigenvalue problem,nonlinear eigenvalue problem,linearization | Linear algebra,Mathematical optimization,Nonlinear system,Eigenvalue perturbation,Divide-and-conquer eigenvalue algorithm,Numerical analysis,Eigenvalues and eigenvectors,Mathematics,Linearization,Inverse iteration | Journal |
Volume | Issue | ISSN |
32 | 1 | 0895-4798 |
Citations | PageRank | References |
19 | 1.01 | 11 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yangfeng Su | 1 | 235 | 22.05 |
Zhaojun Bai | 2 | 661 | 107.69 |