Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2105.05637

A Mathematical Definition of Particle Methods

Johannes Bamme·Ivo F. Sbalzarini
View original source ↗Read source document ↗Export metadata ↓

Abstract

We provide a formal definition for a class of algorithms known as "particle methods". Particle methods are used in scientific computing. They include popular simulation methods, such as Discrete Element Methods (DEM), Molecular Dynamics (MD), Particle Strength Exchange (PSE), and Smoothed Particle Hydrodynamics (SPH), but also particle-based image processing methods, point-based computer graphics, and computational optimization algorithms using point samples. All of these rest on a common concept, which we here formally define. The presented definition of particle methods makes it possible to distinguish what formally constitutes a particle method, and what not. It also enables us to define different sub-classes of particle methods that differ with respect to their computational complexity and power. Our definition is purely formal, independent of any application. After stating the definition, we therefore illustrate how several well-known particle methods can be formalized in our framework, and we show how the formal definition can be used to formulate novel particle methods for non-canonical problems.

Explore related subjects

cs.DScs.CE

Keep this discovery

BibTeXRIS

Johannes Bamme, Ivo F. Sbalzarini. 2021-05-12. A Mathematical Definition of Particle Methods. https://arxiv.org/abs/2105.05637

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗
arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗