Polynomial Eigenvalue Problem Solvers - PEP

slepc-3.17.2 2022-08-09
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()).

test1.c: Test the solution of a PEP without calling PEPSetFromOptions (based on ex16
test2.c: Test the solution of a PEP from a finite element model of
test3.c: Test PEP interface functions
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
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