% 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{BODE:860335,
      author       = {BODE, ACHIM and LIPPERT, THOMAS and SCHILLING, KLAUS and
                      UEBERHOLZ, PEER},
      title        = {{D}etermination of monopole current clusters in
                      four-dimensional quantum electrodynamics},
      journal      = {International journal of modern physics / C Computational
                      physics and physical computation C},
      volume       = {04},
      number       = {06},
      issn         = {1793-6586},
      address      = {Singapore [u.a.]},
      publisher    = {World Scientific},
      reportid     = {FZJ-2019-01110},
      pages        = {1205 - 1219},
      year         = {1993},
      abstract     = {Magnetic monopole currents are believed to have a strong
                      impact on the Monte Carlo dynamics of compact quantum
                      electrodynamics near the phase transition. We have
                      indications that updating algorithms have to form and to
                      break up monopole current clusters in order to force the
                      tunneling of the system between the coexisting phases, the
                      confined phase and the Coulomb phase. This might be
                      responsible for long lived metastabilities in the time
                      series.We present parallel numerical algorithms which allow
                      the fast identification of clusters of monopole loops, the
                      determination of their topological properties as well as
                      their visualization in the course of a Monte Carlo
                      simulation. The algorithms are implemented on the Connection
                      Machine CM-5. We compare the data parallel programming style
                      with a message passing approach. Complexity and performance
                      are discussed.},
      ddc          = {530},
      typ          = {PUB:(DE-HGF)16},
      doi          = {10.1142/S0129183193000951},
      url          = {https://juser.fz-juelich.de/record/860335},
}