As modern massively parallel clusters are getting larger with beefier compute nodes, traditional parallel eigensolvers, such as direct solvers, struggle keeping the pace with the hardware evolution and being able to scale efficiently due to additional layers of communication and synchronization. This difficulty is especially important when porting traditional libraries to heterogeneous computing architectures equipped with accelerators, such as Graphics Processing Unit (GPU). Recently, there have been significant scientific contributions to the development of filter-based subspace eigensolver to compute partial eigenspectrum. The simpler structure of these type of algorithms makes for them easier to avoid the communica tion and synchronizat...
We compare two approaches to compute a fraction of the spectrum of dense symmetric definite generali...
Numerically solving the Bethe-Salpeter equation for the optical polarization function is a very succ...
Iterative solvers for eigenvalue problems are often the only means of computing the extremal eigenva...
As modern massively parallel clusters are getting larger with beefier compute nodes, traditional par...
As modern massively parallel clusters are getting larger with beefier compute nodes, traditional par...
We propose to step away from the black-box approach and allow the eigensolver to accept a...
Solving dense Hermitian eigenproblems arranged in a sequence with direct solvers fails to take advan...
Solving large-scale eigenvalue problems is a central problem in many research areas, such as electro...
ChASE is a new library based on an optimized version of subspace iteration with polynomial accelerat...
This paper explores the early implementation of high- performance routines for the solution of multi...
Dense symmetric eigenproblem is one of the most significant problems in the numerical linear algebra...
This paper explores the early implementation of high-performance routines for the solution of multip...
As a recurrent problem in numerical analysis and computational science, eigenvector and eigenvalue d...
Communicated by Yasuaki Ito Solution of large-scale dense nonsymmetric eigenvalue problem is require...
Obtaining the eigenvalues and eigenvectors of large matrices is a key problem in electronic structur...
We compare two approaches to compute a fraction of the spectrum of dense symmetric definite generali...
Numerically solving the Bethe-Salpeter equation for the optical polarization function is a very succ...
Iterative solvers for eigenvalue problems are often the only means of computing the extremal eigenva...
As modern massively parallel clusters are getting larger with beefier compute nodes, traditional par...
As modern massively parallel clusters are getting larger with beefier compute nodes, traditional par...
We propose to step away from the black-box approach and allow the eigensolver to accept a...
Solving dense Hermitian eigenproblems arranged in a sequence with direct solvers fails to take advan...
Solving large-scale eigenvalue problems is a central problem in many research areas, such as electro...
ChASE is a new library based on an optimized version of subspace iteration with polynomial accelerat...
This paper explores the early implementation of high- performance routines for the solution of multi...
Dense symmetric eigenproblem is one of the most significant problems in the numerical linear algebra...
This paper explores the early implementation of high-performance routines for the solution of multip...
As a recurrent problem in numerical analysis and computational science, eigenvector and eigenvalue d...
Communicated by Yasuaki Ito Solution of large-scale dense nonsymmetric eigenvalue problem is require...
Obtaining the eigenvalues and eigenvectors of large matrices is a key problem in electronic structur...
We compare two approaches to compute a fraction of the spectrum of dense symmetric definite generali...
Numerically solving the Bethe-Salpeter equation for the optical polarization function is a very succ...
Iterative solvers for eigenvalue problems are often the only means of computing the extremal eigenva...