slepc-3.11.2 2019-07-30
Report Typos and Errors

Polynomial Eigenvalue Problem Solvers - PEP: Examples NLEVP

The Polynomial Eigenvalue Problem (PEP) solver is the object provided by SLEPc for specifying a polynomial eigenvalue problem. Apart from the specific solvers for this type of problems, there is an EPS-based solver, i.e., it uses a solver from EPS to solve a generalized eigenproblem obtained after linearization.

As in the other solver objects, users can set various options at runtime via the options database (e.g., -pep_nev 4 -pep_type linear). Options can also be set directly in application codes by calling the corresponding routines (e.g., PEPSetDimensions() / PEPSetType()).

ex16.c: Simple quadratic eigenvalue problem
ex17.c: Solves a polynomial eigenproblem P(l)x = 0 with matrices loaded from a file
ex28.c: A quadratic eigenproblem defined using shell matrices
ex38.c: Spectrum slicing on quadratic symmetric eigenproblem
makefile