Computing several eigenvalues of nonlinear eigenvalue problems by selection (Q2177537)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7197376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing several eigenvalues of nonlinear eigenvalue problems by selection |
scientific article; zbMATH DE number 7197376 |
Statements
Computing several eigenvalues of nonlinear eigenvalue problems by selection (English)
0 references
6 May 2020
0 references
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.
0 references
eigenvalues
0 references
selection
0 references
divided difference
0 references
deflation
0 references
locking
0 references
homogeneous coordinates
0 references
polynomial eigenvalue problem
0 references
nonlinear eigenvalue problem
0 references
multiparameter eigenvalue problem
0 references
subspace method
0 references
0 references
0 references
0 references
0.7974704504013062
0 references
0.7869901657104492
0 references
0.7606720328330994
0 references
