Authors | Johannes Pahlke |
---|---|

Advisors | |

University | Technische Universität Dresden |

Examination Date | 2023-05-04 |

Open Access | true |

Print Publication Date | 2023-05-04 |

Online Publication Date | 2023-05-04 |

Abstract | Mathematical definitions provide a precise, unambiguous way to formulate concepts. They also provide a common language between disciplines. Thus, they are the basis for a well-founded scientific discussion. In addition, mathematical definitions allow for deeper insights into the defined subject based on mathematical theorems that are incontrovertible under the given definition. Besides their value in mathematics, mathematical definitions are indispensable in other sciences like physics, chemistry, and computer science. In computer science, they help to derive the expected behavior of a computer program and provide guidance for the design and testing of software. Therefore, mathematical definitions can be used to design and implement advanced algorithms. One class of widely used algorithms in computer science is the class of particle-based algorithms, also known as particle methods. Particle methods can solve complex problems in various fields, such as fluid dynamics, plasma physics, or granular flows, using diverse simulation methods, including Discrete Element Methods (DEM), Molecular Dynamics (MD), Reproducing Kernel Particle Methods (RKPM), Particle Strength Exchange (PSE), and Smoothed Particle Hydrodynamics (SPH). Despite the increasing use of particle methods driven by improved computing performance, the relation between these algorithms remains formally unclear. In particular, particle methods lack a unifying mathematical definition and precisely defined terminology. This prevents the determination of whether an algorithm belongs to the class and what distinguishes the class. Here we present a rigorous mathematical definition for determining particle methods and demonstrate its importance by applying it to several canonical algorithms and those not previously recognized as particle methods. Furthermore, we base proofs of theorems about parallelizability and computational power on it and use it to develop scientific computing software. Our definition unified, for the first time, the so far loosely connected notion of particle methods. Thus, it marks the necessary starting point for a broad range of joint formal investigations and applications across fields. |

Cover Image | |

Affiliated With | Sbalzarini |

Selected By | |

Acknowledged Services | |

Publication Status | Published |

Edoc Link | |

Sfx Link | |

DOI | |

PubMed ID | |

WebOfScience Link | |

Alternative Full Text URL | https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-857760 |

Display Publisher Download Only | false |

Visible On MPI-CBG Website | true |

PDF Downloadable | true |

Created By | thuem |

Added Date | 2023-08-02 |

Last Edited By | thuem |

Last Edited Date | 2024-08-01 13:53:37.149 |

Library ID | 8588 |

Document ID | |

Entry Complete | true |

eDoc Compliant | true |

Include in Edoc Report | true |

In Pure | false |

Ready for eDoc Export | true |

Author Affiliations Complete | false |

Project Name | |

Project URL | |

Grant ID | |

Funding Programme | |

Funding Organisation |