guest ::
| Home > Publications database > The ChASE library on distributed and heterogeneous platforms > print |
| 001 | 811971 | ||
| 005 | 20221109161713.0 | ||
| 037 | _ | _ | |a FZJ-2016-04275 |
| 041 | _ | _ | |a English |
| 100 | 1 | _ | |a Di Napoli, Edoardo |0 P:(DE-Juel1)144723 |b 0 |e Corresponding author |u fzj |
| 111 | 2 | _ | |a Parallel Matrix Algorithms and Applications |g PMAA 16 |c Bordeaux |d 2016-07-06 - 2016-07-08 |w France |
| 245 | _ | _ | |a The ChASE library on distributed and heterogeneous platforms |
| 260 | _ | _ | |c 2016 |
| 336 | 7 | _ | |a Conference Paper |0 33 |2 EndNote |
| 336 | 7 | _ | |a Other |2 DataCite |
| 336 | 7 | _ | |a INPROCEEDINGS |2 BibTeX |
| 336 | 7 | _ | |a conferenceObject |2 DRIVER |
| 336 | 7 | _ | |a LECTURE_SPEECH |2 ORCID |
| 336 | 7 | _ | |a Conference Presentation |b conf |m conf |0 PUB:(DE-HGF)6 |s 1470913012_13972 |2 PUB:(DE-HGF) |x After Call |
| 520 | _ | _ | |a We propose to step away from the black-box approach and allow the eigensolver to accept as much information as it is available from the application. Such a strategy implies that the resulting library is tailored to the specific application, or class of applications, and loose generality of usage. On the other hand, the resulting eigensolver maximally exploits knowledge from the application and become very efficient. With this general strategy in mind, we present here a version of a Chebyshev Accelerated Subspace iteration Eigensolver (ChASE) which targets extremal eigenpairs of dense eigenproblems. In particular, ChASE focuses of on a class of applications resulting in having to solve sequences of eigenvalue problems where adjacent problems possess a certain degree of correlation. A typical example of such applications is Density Functional Theory where the solution to a non-linear partial differential equation is worked out by generating and solving dozens of algebraic eigenvalue problems in a self- consistent fashion over dozens of iterations. Similarly, any non-linear eigenvalue problem, which can be solved by the method of successive linearization, gives rise to sequences of correlated algebraic eigenproblems that are the target of ChASE. We re-design the eigensolver so as to minimize its complexity and have better control of its numerical features. Following the algorithm optimizations, we strive to adopt a strategy leading to an implementation that would lends itself to high-performance parallel computing and avoid, at the same time, issues related to portability to heterogeneous architectures. We achieve such a goal by implementing parallel kernels for the modular tasks of the eigensolver using programming strategies out of MPI, OpenMP, and CUDA. |
| 536 | _ | _ | |a 511 - Computational Science and Mathematical Methods (POF3-511) |0 G:(DE-HGF)POF3-511 |c POF3-511 |f POF III |x 0 |
| 536 | _ | _ | |a Simulation and Data Laboratory Quantum Materials (SDLQM) (SDLQM) |0 G:(DE-Juel1)SDLQM |c SDLQM |f Simulation and Data Laboratory Quantum Materials (SDLQM) |x 2 |
| 909 | C | O | |o oai:juser.fz-juelich.de:811971 |p VDB |
| 910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 0 |6 P:(DE-Juel1)144723 |
| 913 | 1 | _ | |a DE-HGF |b Key Technologies |1 G:(DE-HGF)POF3-510 |0 G:(DE-HGF)POF3-511 |2 G:(DE-HGF)POF3-500 |v Computational Science and Mathematical Methods |x 0 |4 G:(DE-HGF)POF |3 G:(DE-HGF)POF3 |l Supercomputing & Big Data |
| 914 | 1 | _ | |y 2016 |
| 915 | _ | _ | |a No Authors Fulltext |0 StatID:(DE-HGF)0550 |2 StatID |
| 920 | 1 | _ | |0 I:(DE-Juel1)JSC-20090406 |k JSC |l Jülich Supercomputing Center |x 0 |
| 980 | _ | _ | |a conf |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|