IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v10y1999i05ns0129183199000644.html
   My bibliography  Save this article

Fast Particle Pair Detection Algorithms For Particle Simulations

Author

Listed:
  • T. IWAI

    (Department of Materials Science, University of Erlangen-Nürnberg, Martensstr. 5, D-91058 Erlangen, Germany)

  • C.-W. HONG

    (Department of Materials Science, University of Erlangen-Nürnberg, Martensstr. 5, D-91058 Erlangen, Germany)

  • P. GREIL

    (Department of Materials Science, University of Erlangen-Nürnberg, Martensstr. 5, D-91058 Erlangen, Germany)

Abstract

New algorithms withO(N)complexity have been developed for fast particle-pair detections in particle simulations like the discrete element method (DEM) and molecular dynamic (MD). They exhibit robustness against broad particle size distributions when compared with conventional boxing methods. Almost similar calculation speeds are achieved at particle size distributions from is mono-size to 1:10 while the linked-cell method results in calculations more than 20 times. The basic algorithm, level-boxing, uses the variable search range according to each particle. The advanced method, multi-level boxing, employs multiple cell layers to reduce the particle size discrepancy. Another method, indexed-level boxing, reduces the size of cell arrays by introducing the hash procedure to access the cell array, and is effective for sparse particle systems with a large number of particles.

Suggested Citation

  • T. Iwai & C.-W. Hong & P. Greil, 1999. "Fast Particle Pair Detection Algorithms For Particle Simulations," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 10(05), pages 823-837.
    • Handle: RePEc:wsi:ijmpcx:v:10:y:1999:i:05:n:s0129183199000644
    DOI: 10.1142/S0129183199000644
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183199000644
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183199000644?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:10:y:1999:i:05:n:s0129183199000644. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.