Projection Methods for Nonlinear Sparse Eigenvalue Problems
نویسنده
چکیده
This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods and the automated multi–level substructuring. We do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem.
منابع مشابه
Iterative Projection Methods for Large–scale Nonlinear Eigenvalue Problems
In this presentation we review iterative projection methods for sparse nonlinear eigenvalue problems which have proven to be very efficient. Here the eigenvalue problem is projected to a subspace V of small dimension which yields approximate eigenpairs. If an error tolerance is not met then the search space V is expanded in an iterative way with the aim that some of the eigenvalues of the reduc...
متن کاملAn Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems
where T (λ) ∈ R is a family of symmetric matrices depending on a parameter λ ∈ J , and J ⊂ R is an open interval which may be unbounded. As in the linear case T (λ) = λI −A a parameter λ is called an eigenvalue of T (·) if problem (1) has a nontrivial solution x 6= 0 which is called a corresponding eigenvector. We assume that the matrices T (λ) are large and sparse. For sparse linear eigenvalue...
متن کاملEfficient Methods For Nonlinear Eigenvalue Problems Diploma Thesis
During the last years nonlinear eigenvalue problems of the type T (λ)x = 0 became more and more important in many applications with the rapid development of computing performance. In parallel the minmax theory for symmetric nonlinear eigenvalue problems was developed which reveals a strong connection to corresponding linear problems. We want to review the current theory for symmetric nonlinear ...
متن کاملRestarting iterative projection methods for Hermitian nonlinear eigenvalue problems with minmax property
In this work we present a new restart technique for iterative projection methods for nonlinear eigenvalue problems admitting minmax characterization of their eigenvalues. Our technique makes use of the minmax induced local enumeration of the eigenvalues in the inner iteration. In contrast to global numbering which requires including all the previously computed eigenvectors in the search subspac...
متن کاملAn Iterative Method for Computing the Pseudospectral Abscissa for a Class of Nonlinear Eigenvalue Problems
where A1, . . . , Am are given n × n matrices and the functions p1, . . . , pm are assumed to be entire. This does not only include polynomial eigenvalue problems but also eigenvalue problems arising from systems of delay differential equations. Our aim is to compute the -pseudospectral abscissa, i.e. the real part of the rightmost point in the -pseudospectrum, which is the complex set obtained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005