@article{BREIDEN2026247,
title = {Tree-based meshfree generalization of the Finite Volume Method},
journal = {Computational Particle Mechanics},
volume = {15},
pages = {247-273},
year = {2026},
issn = {2196-4386},
doi = {https://doi.org/10.1016/j.cpms.2026.04.008},
url = {https://www.sciencedirect.com/science/article/pii/S2196438626001695},
author = {F. Breiden and M.A. Schweitzer and C. Albrecht},
keywords = {Finite Volume Method (FVM), Finite Volume Particle Method (FVPM), Cost reduction, Parallelization, Load-balancing, Meshfree, Computational Fluid Dynamics (CFD)},
abstract = {The Finite Volume Particle Method (FVPM) is a meshfree generalization of the Finite Volume Method (FVM). It can handle a wide range of computational fluid dynamic problems including free surfaces, moving domains and shock fronts. Combining the particle method advantages with those of FVM, FVPM is conservative, stable and non-oscillating near shock fronts. Although this method is very promising, its typical realizations are computationally overly expensive and not trivial to parallelize. This paper aims to overcome this issue and make FVPM practically applicable to large high dimensional industrial problems. To this end, we significantly lower the computational costs and enable efficient parallelization by introducing an underlying tree structure and adaptive, dynamic load balancing. The underlying tree not only allows efficient particle memory handling but also improves particle movement efficiency, which substantially reduces the runtime. Standard particle method problems of artificial holes and particle crowding can entirely be avoided. This parallel tree-based approach hence highly expands the scope of possible FVPM applications. We verify this approach in numerical benchmark testcases, show it stability, and present its performant scaling behavior in two and three dimensional scenarios.}
}