% 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:189477,
      author       = {Basermann, Achim},
      title        = {{D}ata {D}istribution and {C}ommunication {S}chemes for
                      {S}olving {S}parse {S}ystems of {L}inear {E}quations from
                      {FE} {A}pplications by {P}arallel {CG} {M}ethods},
      volume       = {94/1},
      address      = {Clausthal-Zellerfeld},
      publisher    = {Institut für Informatik},
      reportid     = {FZJ-2015-02637},
      series       = {Informatik-Berichte},
      pages        = {155-176},
      year         = {1994},
      comment      = {Workshop über Parallelverarbeitung},
      booktitle     = {Workshop über Parallelverarbeitung},
      abstract     = {For the solution of discretized ordinary or partial
                      differential equations it is necessary to solve systems of
                      equations with coefficient matrices of different sparsity
                      pattern, depending on the discretization method; using the
                      finite element (FE) method results in largely unstructured
                      systems of equations. Iterative solvers for equation systems
                      mainly consist of matrix-vector products and vector-vector
                      operations. A frequently used iterative solver is the method
                      of conjugate gradients (CG) with different preconditioners.
                      For parallelizing this method on a multiprocessor system
                      with distributed memory, in particular the data distribution
                      and the communication scheme depending on the used data
                      structure for sparse matrices are of greatest importance for
                      the efficient execution. These schemes can be determined
                      before the execution of the solver by preprocessing the
                      symbolic structure of the sparse matrix and can be exploited
                      in each iteration. In this report, data distribution and
                      communication schemes are presented which are based on the
                      analysis of the column indices of the non-zero matrix
                      elements. Performance tests of the developed parallel CG
                      algorithms have been carried out on the distributed memory
                      system INTEL iPSC/860 of the Research Centre Jülich with
                      sparse matrices from FE models. These methods have performed
                      well for matrices of very different sparsity pattern.},
      month         = {Sep},
      date          = {1993-09-20},
      organization  = {12. Workshop über
                       Parallelverarbeitung, Lessach
                       (Austria), 20 Sep 1993 - 24 Sep 1993},
      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/189477},
}