% 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{Berljafa:153314,
      author       = {Berljafa, Mario and Wortmann, Daniel and Di Napoli,
                      Edoardo},
      title        = {{A}n {O}ptimized and {S}calable {E}igensolver for
                      {S}equences of {E}igenvalue {P}roblems},
      reportid     = {FZJ-2014-02955},
      year         = {2014},
      note         = {20 Pages, 6 figures. Invited submission to special issue of
                      Concurrency and Computation: Practice and Experience},
      abstract     = {In many scientific applications the solution of non-linear
                      differential equations are obtained through the set-up and
                      solution of a number of successive eigenproblems. These
                      eigenproblems can be regarded as a sequence whenever the
                      solution of one problem fosters the initialization of the
                      next. In addition, some eigenproblem sequences show a
                      connection between the solutions of adjacent eigenproblems.
                      Whenever is possible to unravel the existence of such a
                      connection, the eigenproblem sequence is said to be a
                      correlated. When facing with a sequence of correlated
                      eigenproblems the current strategy amounts to solving each
                      eigenproblem in isolation. We propose a novel approach which
                      exploits such correlation through the use of an eigensolver
                      based on subspace iteration and accelerated with Chebyshev
                      polynomials (ChFSI). The resulting eigensolver, is optimized
                      by minimizing the number of matvec multiplications and
                      parallelized using the Elemental library framework.
                      Numerical results shows that ChFSI achieves excellent
                      scalability and is competitive with current dense linear
                      algebra parallel eigensolvers.},
      cin          = {JSC / IAS-1},
      cid          = {I:(DE-Juel1)JSC-20090406 / I:(DE-Juel1)IAS-1-20090406},
      pnm          = {411 - Computational Science and Mathematical Methods
                      (POF2-411)},
      pid          = {G:(DE-HGF)POF2-411},
      typ          = {PUB:(DE-HGF)25},
      eprint       = {1404.4161},
      howpublished = {arXiv:1404.4161},
      archivePrefix = {arXiv},
      SLACcitation = {$\%\%CITATION$ = $arXiv:1404.4161;\%\%$},
      url          = {https://juser.fz-juelich.de/record/153314},
}