Background
I propose the development of a new feature within our software framework: the implementation of the Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) algorithm as a general eigenvalue solver. This will complement our existing solvers like the Conjugate Gradient (CG) and Davidson methods, providing users with a versatile tool for solving generalized eigenvalue problem of large, sparse matrices.
See Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method | SIAM Journal on Scientific Computing for details about the algorithm.
Describe the solution you'd like
The primary objective is to implement LOBPCG as a standalone module within our software framework, ensuring it is:
- Compatible: Works seamlessly with the existing infrastructure, including data structures and interfaces. It is intended that it will be integrated into HSolver using kernel ops.
- Efficient: Optimized for performance, particularly for large and sparse matrices. It should take full advantage of heterogeneous computing devices.
- Modular: Designed to be easily maintained and extended, allowing for future improvements and integration with other solvers.
Testing and Validation:
- Create a comprehensive suite of unit tests to validate the correctness and performance of the LOBPCG implementation.
- Compare the performance and accuracy of LOBPCG with existing solvers on a set of benchmark problems.
Task list only for developers
Notice Possible Changes of Behavior (Reminder only for developers)
No response
Notice any changes of core modules (Reminder only for developers)
No response
Notice Possible Changes of Core Modules (Reminder only for developers)
No response
Additional Context
No response
Task list for Issue attackers (only for developers)
Background
I propose the development of a new feature within our software framework: the implementation of the Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) algorithm as a general eigenvalue solver. This will complement our existing solvers like the Conjugate Gradient (CG) and Davidson methods, providing users with a versatile tool for solving generalized eigenvalue problem of large, sparse matrices.
Describe the solution you'd like
The primary objective is to implement LOBPCG as a standalone module within our software framework, ensuring it is:
Testing and Validation:
Task list only for developers
Notice Possible Changes of Behavior (Reminder only for developers)
No response
Notice any changes of core modules (Reminder only for developers)
No response
Notice Possible Changes of Core Modules (Reminder only for developers)
No response
Additional Context
No response
Task list for Issue attackers (only for developers)