# Polynomial Eigenvalue Problem Solver - PEP

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() or PEPSetType()).

Examples

test1.c: Test the solution of a PEP without calling PEPSetFromOptions (based on ex16.c).
test2.c: Test the solution of a PEP from a finite element model of damped mass-spring system.
test3.c: Test PEP interface functions.
test3f.F90: Simple example to test the PEP Fortran interface.
test4.c: Solve a quadratic problem with PEPLINEAR with a user-provided EPS.
test5.c: Test PEP view and monitor functionality.
test6.c: Tests multiple calls to PEPSolve with different matrix of different size.
test7.c: Test interface functions of spectrum-slicing STOAR.
test8.c: Test interface functions of polynomial JD.
test9.c: Illustrates use of PEPSetEigenvalueComparison().
test10.c: Tests a user-defined convergence test in PEP (based on ex16.c).
test11.c: Illustrates the use of a user-defined stopping test.
test12.c: Illustrates region filtering in PEP (based on spring).
test13.c: Solve a quadratic problem with CISS.