% 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”.

@INPROCEEDINGS{Basermann:155238,
      author       = {Basermann, Achim and Steffen, Bernhard},
      title        = {{N}ew {P}reconditioned {S}olvers for {L}arge {S}parse
                      {E}igenvalue {P}roblems on {M}assively {P}arallel
                      {C}omputers},
      address      = {Philadelphia, Pa.},
      publisher    = {Society for Industrial and Applied Mathematics},
      reportid     = {FZJ-2014-04412},
      isbn         = {0-89871-395-1},
      pages        = {8 p.},
      year         = {1997},
      comment      = {Proceedings of the Eighth SIAM Conference on Parallel
                      Processing for Scientific Computing, PPSC 1997},
      booktitle     = {Proceedings of the Eighth SIAM
                       Conference on Parallel Processing for
                       Scientific Computing, PPSC 1997},
      abstract     = {We present preconditioned solvers to find a few eigenvalues
                      and eigenvectors of large dense or sparse symmetric matrices
                      based on the Jacobi-Davidson (JD) method by G. L. G.
                      Sleijpen and H. A. van der Vorst. For preconditioning, we
                      apply a new adaptive approach using the QMR iteration. To
                      parallelize the solvers, we divide the interesting part of
                      the spectrum into a few overlapping intervals and
                      asynchronously exchange eigenvector approximations from
                      neighboring intervals to keep the solutions separated. Per
                      interval, matrix-vector and vector-vector operations of the
                      JD iteration are parallelized by determining a data
                      distribution and a communication scheme from an automatic
                      analysis of the sparsity pattern of the matrix. We
                      demonstrate the efficiency of these parallelization
                      strategies by timings on an Intel Paragon and a Cray T3E
                      system with matrices from real applications.},
      month         = {Mar},
      date          = {1997-03-14},
      organization  = {Eighth SIAM Conference on Parallel
                       Processing for Scientific Computing,
                       Minneapolis (USA), 14 Mar 1997 - 17 Mar
                       1997},
      keywords     = {Parallelverarbeitung (gbv)},
      cin          = {ZAM / JSC},
      cid          = {I:(DE-Juel1)VDB62 / I:(DE-Juel1)JSC-20090406},
      pnm          = {899 - ohne Topic (POF2-899)},
      pid          = {G:(DE-HGF)POF2-899},
      typ          = {PUB:(DE-HGF)8 / PUB:(DE-HGF)7},
      url          = {https://juser.fz-juelich.de/record/155238},
}