% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@ARTICLE{Aliaga:17996,
author = {Aliaga, J.I. and Bientinesi, P. and Davidovic, D. and Di
Napoli, E. and Igual, F.D. and Quintana-Orti, E.S.},
title = {{S}olving dense generalized eigenproblems on multi-threaded
architectures},
journal = {Applied mathematics and computation},
volume = {218},
issn = {0096-3003},
address = {New York, NY},
publisher = {Elsevier},
reportid = {PreJuSER-17996},
pages = {11279 - 11289},
year = {2012},
note = {Record converted from VDB: 12.11.2012},
abstract = {We compare two approaches to compute a fraction of the
spectrum of dense symmetric definite generalized
eigenproblems: one is based on the reduction to tridiagonal
form, and the other on the Krylov-subspace iteration. Two
large-scale applications, arising in molecular dynamics and
material science, are employed to investigate the
contributions of the application, architecture, and
parallelism of the method to the performance of the solvers.
The experimental results on a state-of-the-art 8-core
platform, equipped with a graphics processing unit (GPU),
reveal that in realistic applications, iterative
Krylov-subspace methods can be a competitive approach also
for the solution of dense problems. (C) 2012 Elsevier Inc.
All rights reserved.},
keywords = {J (WoSType)},
cin = {JSC},
ddc = {510},
cid = {I:(DE-Juel1)JSC-20090406},
pnm = {Scientific Computing (FUEK411) / 411 - Computational
Science and Mathematical Methods (POF2-411) / Simulation and
Data Laboratory Quantum Materials (SDLQM) (SDLQM)},
pid = {G:(DE-Juel1)FUEK411 / G:(DE-HGF)POF2-411 /
G:(DE-Juel1)SDLQM},
shelfmark = {Mathematics, Applied},
typ = {PUB:(DE-HGF)16},
UT = {WOS:000305800700046},
doi = {10.1016/j.amc.2012.05.020},
url = {https://juser.fz-juelich.de/record/17996},
}