Abstract

Peridynamic equation of motion is usually solved numerically by using meshless approaches, Family search process is one of the most time consuming parts of a peridynamic analysis. Especially for problems which require continuous update of family members inside the hurizoli of a material point, the time spent to search for family members becomes crucial. Hence, efficient algorithms are required to reduce the computational time. In this study, various family member search algorithms suitable for peridynamic simulations are presented including brute-force search, region partitioning and tree data structures. By considering problem cases for different number of material points, computational time between different algorithms is compared and the most efficient algorithm is determined.
Original languageEnglish
Pages (from-to)1-26
Number of pages26
JournalJournal of Peridynamics and Nonlocal Modeling
Early online date3 Jan 2020
DOIs
Publication statusE-pub ahead of print - 3 Jan 2020

    Fingerprint

Keywords

  • peridynamics
  • family search
  • spatial search
  • tree structures

Cite this