Jose E. Roman
Abstract
This short article describes the main new features added to SLEPc, the Scalable Library for Eigenvalue Problem Computations, in the past two and a half years, corresponding to five release versions. The main novelty is the extension of the
- . 2022. Thick-restarted joint Lanczos bidiagonalization for the GSVD. Retrieved from https://arxiv.org/abs/2206.03768. Google Scholar
Cross Ref
- . 1999. LAPACK Users’ Guide (3rd ed.). SIAM, Philadelphia, PA.Google ScholarCross Ref
- . 2011. Developing algorithms and software for the parallel solution of the symmetric eigenvalue problem. J. Comput. Sci. 2, 3 (2011), 272–278. Google ScholarCross Ref
- . 2022. PETSc/TAO Users Manual Revision 3.18.
Argonne Tech. Report ANL-21/39. Google ScholarCross Ref - . 2016. Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc. SIAM J. Sci. Comput. 38, 5 (2016), S385–S411. Google ScholarCross Ref
- . 2020. A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation. BIT 60, 2 (2020), 295–318. Google ScholarDigital Library
- . 2021. NEP: A module for the parallel solution of nonlinear eigenvalue problems in SLEPc. ACM Trans. Math. Software 47, 3 (2021), 23:1–23:29. Google ScholarDigital Library
- . 2011. Parallel distributed computing using python. Adv. Water Resour. 34, 9 (2011), 1124–1139. Google ScholarCross Ref
- . 1996. Matrix Computations (3rd ed.). The Johns Hopkins University Press, Baltimore, MD.Google ScholarDigital Library
- . 2015. Subspace iteration randomization and singular value problems. SIAM J. Sci. Comput. 37, 3 (2015), A1139–A1173. Google ScholarCross Ref
- . 2011. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53, 2 (2011), 217–288. Google ScholarDigital Library
- . 2008. A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization. Electron. Trans. Numer. Anal. 31 (2008), 68–85.Google Scholar
- . 2005. SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems. ACM Trans. Math. Softw. 31, 3 (2005), 351–362. Google ScholarDigital Library
- . 2022. Acoustic modal analysis with heat release fluctuations using nonlinear eigensolvers. Retrieved from https://arxiv.org/abs/2208.08717. Google ScholarCross Ref
- . 2018. Block SS–CAA: A complex moment-based parallel nonlinear eigensolver using the block communication-avoiding Arnoldi procedure. Parallel Comput. 74 (2018), 34–48. Google ScholarDigital Library
- . 2021. KSPHPDDM and PCHPDDM: Extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners. Comput. Math. Appl. 84 (2021), 277–295. Google ScholarCross Ref
- . 2019. The eigenvalues slicing library (EVSL): Algorithms, implementation, and software. SIAM J. Sci. Comput. 41, 4 (2019), C393–C415. Google ScholarDigital Library
- . 2016. Contour Integral Spectrum Slicing Method in SLEPc.
Technical Report STR-11. Universitat Politècnica de València. Retrieved from https://slepc.upv.es.Google Scholar - . 1991. The hyperbolic singular value decomposition and applications. IEEE Trans. Signal Process. 39, 7 (1991), 1575–1588. Google ScholarDigital Library
- . 2022. SLEPc Users Manual.
Technical Report DSIC-II/24/02–Revision 3.18. D. Sistemes Informàtics i Computació, Universitat Politècnica de València. Retrieved from https://slepc.upv.es.Google Scholar - . 2014. A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc. ACM Trans. Math. Softw. 40, 2 (2014), 13:1–13:29. Google ScholarDigital Library
- . 2013. A projection method for nonlinear eigenvalue problems using contour integrals. JSIAM Lett. 5 (2013), 41–44. Google ScholarCross Ref
Index Terms
- Improvements to SLEPc in Releases 3.14–3.18
Recommendations
SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems
Special issue on the Advanced CompuTational Software (ACTS) CollectionThe Scalable Library for Eigenvalue Problem Computations (SLEPc) is a software library for computing a few eigenvalues and associated eigenvectors of a large sparse matrix or matrix pencil. It has been developed on top of PETSc and enforces the same ...
A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
In the context of large-scale eigenvalue problems, methods of Davidson type such as Jacobi-Davidson can be competitive with respect to other types of algorithms, especially in some particularly difficult situations such as computing interior eigenvalues ...
NEP: A Module for the Parallel Solution of Nonlinear Eigenvalue Problems in SLEPc
SLEPc is a parallel library for the solution of various types of large-scale eigenvalue problems. Over the past few years, we have been developing a module within SLEPc, called NEP, that is intended for solving nonlinear eigenvalue problems. These ...
Comments