Live briefing
Everything about SLEPc
SLEPc is a software library for the parallel computation of eigenvalues and eigenvectors of large, sparse matrices. It can be seen as a module of PETSc that provides solvers for different types of eigenproblems, including linear and nonlinear, as well as the SVD. Recent versions also include support for matrix functions. It uses the MPI standard for parallelization. Both real and complex arithmetic are supported, with single, double and quadruple precision. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: SLEPcA 5-minute orientation
- Pick up a classic book: Манастирот Слепче каj ПрилепThe most-reprinted book on the subject
- Read the landmark paper: SLEPcCited 969 times
- Go sideways: List of numerical analysis topicsA closely related topic
- Go sideways: Arnoldi iterationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
SLEPc
Parallel Krylov Solvers for the Polynomial Eigenvalue Problem in SLEPc
Non-linear eigenvalue problems with GetDP and SLEPc: Eigenmode computations of frequency-dispersive photonic open structures
A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
Improvements to SLEPc in Releases 3.14–3.18
Harnessing GPU Power from High-level Libraries: Eigenvalues of Integral Operators with SLEPc
Modelling the Earth's geomagnetic environment on Cray machines using PETSc and SLEPc
Recent additions to SLEPc, the Scalable Library for Eigenvalue Problem computations
📚 Books worth reading
- 📕Манастирот Слепче каj ПрилепNikola Mitrevski · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- List of numerical analysis topics This is a list of numerical analysis topics. Validated numerics Iterative method Rate of convergence — the speed at which a convergent sequence approaches…
- Arnoldi iteration In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of an iterative method. Arnoldi finds an approximation…
- LOBPCG Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is a matrix-free method for finding the largest (or smallest) eigenvalues and the corresponding…
- Henk van der Vorst Hendrik "Henk" Albertus van der Vorst (born 5 May 1944, Venlo) is a Dutch mathematician and Emeritus Professor of Numerical Analysis at Utrecht University…
- Nonlinear eigenproblem In mathematics, a nonlinear eigenproblem, sometimes nonlinear eigenvalue problem, is a generalization of the (ordinary) eigenvalue problem to equations…
- Lanczos algorithm The Lanczos algorithm is an iterative method devised by Cornelius Lanczos that is an adaptation of power methods to find the m "most useful" (tending towards…
- Iterative method In computational mathematics, an iterative method is a mathematical procedure that uses an initial value to generate a sequence of improving approximate…
- Quadratic eigenvalue problem In mathematics, the quadratic eigenvalue problem (QEP), is to find scalar eigenvalues λ {\displaystyle \lambda } , left eigenvectors y {\displaystyle y}…