A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems
نویسندگان
چکیده
منابع مشابه
A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems
We consider the nonlinear eigenvalue problem: M(λ)x = 0, where M(λ) is a large parameter-dependent matrix. In several applications, M(λ) has a structure where the higher-order terms of its Taylor expansion have a particular low-rank structure. We propose a new Arnoldi based algorithm that can exploit this structure. More precisely, the proposed algorithm is equivalent to Arnoldi’s method applie...
متن کاملAn Arnoldi Method for Nonlinear Eigenvalue Problems
For the nonlinear eigenvalue problem T (λ)x = 0 we propose an iterative projection method for computing a few eigenvalues close to a given parameter. The current search space is expanded by a generalization of the shift-and-invert Arnoldi method. The resulting projected eigenproblems of small dimension are solved by inverse iteration. The method is applied to a rational eigenvalue problem gover...
متن کاملComputing a Partial Schur Factorization of Nonlinear Eigenvalue Problems Using the Infinite Arnoldi Method
The partial Schur factorization can be used to represent several eigenpairs of a matrix in a numerically robust way. Different adaptions of the Arnoldi method are often used to compute partial Schur factorizations. We propose here a technique to compute a partial Schur factorization of a nonlinear eigenvalue problem (NEP). The technique is inspired by the algorithm in [8], now called the infini...
متن کامل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...
متن کاملA Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems
We give the formulation of a Riemannian Newton algorithm for solving a class of nonlinear eigenvalue problems by minimizing a total energy function subject to the orthogonality constraint. Under some mild assumptions, we establish the global and quadratic convergence of the proposed method. Moreover, the positive definiteness condition of the Riemannian Hessian of the total energy function at a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2016
ISSN: 1070-5325
DOI: 10.1002/nla.2043