Computing several eigenvalues of nonlinear eigenvalue problems by selection
From MaRDI portal
Publication:2177537
Abstract: Computing more than one eigenvalue for (large sparse) one-parameter polynomial and general nonlinear eigenproblems, as well as for multiparameter linear and nonlinear eigenproblems, is a much harder task than for standard eigenvalue problems. We present simple but efficient selection methods based on divided differences to do this. In contrast to locking techniques, it is not necessary to keep converged eigenvectors in the search space, so that the entire search space may be devoted to new information. The techniques are applicable to many types of matrix eigenvalue problems; standard deflation is possible only for linear one-parameter problems. The methods are easy to understand and implement. Although divided differences are well-known in the context of nonlinear eigenproblems, the proposed selection techniques are new for one-parameter problems. For multiparameter problems, we improve on and generalize our previous work. We also show how to use divided differences in the framework of homogeneous coordinates, which may be appropriate for generalized eigenvalue problems with infinite eigenvalues. While the approaches are valuable alternatives for one-parameter nonlinear eigenproblems, they seem the only option for multiparameter problems.
Several selection criteria for computing eigenvalues for nonlinear one-parameter and linear and nonlinear multi-parameter eigenvalue problems are given. Remarkably, in the case of nonlinear problems, the methods work directly on the original problem and linearizations are not needed. The approach can be successfully applied to general nonlinear eigenproblems.
Recommendations
Cites work
- A block Newton method for nonlinear eigenvalue problems
- A Jacobi--Davidson Type Method for a Right Definite Two-Parameter Eigenvalue Problem
- A Jacobi--Davidson Type Method for the Two-Parameter Eigenvalue Problem
- A Jacobi--Davidson type SVD method
- A Jacobi-Davidson type method for the generalized singular value problem
- A Sylvester–Arnoldi type method for the generalized eigenvalue problem with two‐by‐two operator determinants
- Alternatives to the Rayleigh Quotient for the Quadratic Eigenvalue Problem
- An algorithm for the complete solution of quadratic eigenvalue problems
- An Arnoldi method for nonlinear eigenvalue problems
- Backward error and condition of polynomial eigenvalue problems
- Harmonic and refined Rayleigh-Ritz for the polynomial eigenvalue problem
- Homogeneous Jacobi-Davidson
- Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Locking and restarting quadratic eigenvalue solvers
- Matrix algorithms. Vol. 2: Eigensystems
- NLEVP, a collection of nonlinear eigenvalue problems
- Nonequivalence deflation for the solution of matrix latent value problems
- Nonlinear eigenvalue problems: Newton-type methods and nonlinear Rayleigh functionals
- Numerical methods for nonlinear two-parameter eigenvalue problems
- Numerical solutions for large sparse quadratic eigenvalue problems
- On reducing infinite eigenvalues of regular pencils by a nonequivalence transformation
- On the singular two-parameter eigenvalue problem
- Perturbation theory for homogeneous polynomial eigenvalue problems
- Residual Inverse Iteration for the Nonlinear Eigenvalue Problem
- Robust successive computation of eigenpairs for nonlinear eigenvalue problems
- SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- Subspace methods for three‐parameter eigenvalue problems
- The nonlinear eigenvalue problem
Cited in
(4)
This page was built for publication: Computing several eigenvalues of nonlinear eigenvalue problems by selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177537)
