Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2012.10304

Analytic Integration of the Newton Potential over Cuboids and an Application to Fast Multipole Methods

Matthias Kirchhart·Donat Weniger
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present simplified formulae for the analytic integration of the Newton potential of polynomials over boxes in two- and three-dimensional space. These are implemented in an easy-to-use C++ library that allows computations in arbitrary precision arithmetic which is also documented here. We describe how these results can be combined with fast multipole methods for general, non-polynomial data.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthias Kirchhart, Donat Weniger. 2020-12-18. Analytic Integration of the Newton Potential over Cuboids and an Application to Fast Multipole Methods. https://doi.org/10.1515/jnma-2020-0103

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

KEEP EXPLORING

Related papers

arXiv2026

Volume-Preserving Parameterizations via Preconditioned Nonlinear Conjugate Gradient Method

A volume-preserving parameterization is a bijective mapping that maps a 3-manifold onto a canonical domain while preserving local volume. We formulate this problem as an unconstrained nonlinear optimization problem by introducing an isovolumetric energy that quantifies volumetric distortion. This energy is minimized using a preconditioned nonlinear conjugate gradient method, which is globally convergent when the line search satisfies the strong Wolfe conditions. Numerical experiments demonstrate that the proposed method achieves improved accuracy and efficiency, and it supports applications in shape registration and volumetric deformation.

math.NA↗
arXiv2026

Convergence of Noise-Free Sampling Algorithms with Regularized Wasserstein Proximals

In this work, we investigate the convergence properties of the backward regularized Wasserstein proximal (BRWP) method for sampling a target distribution. The BRWP approach can be shown as a semi-implicit time discretization for a probability flow ODE with the score function whose density satisfies the Fokker-Planck equation of the overdamped Langevin dynamics. Specifically, the evolution of the density, hence the score function, is approximated via a kernel representation derived from the regularized Wasserstein proximal operator. By applying the dual formulation and a localized Taylor series to obtain the asymptotic expansion of this kernel formula, we establish guaranteed convergence in terms of the Kullback-Leibler divergence for the BRWP method towards a strongly log-concave target distribution. Our analysis also identifies the optimal and maximum step sizes for convergence. Furthermore, we demonstrate that the deterministic and semi-implicit BRWP scheme outperforms many classical Langevin Monte Carlo methods, such as the Unadjusted Langevin Algorithm (ULA), by offering faster convergence and reduced bias. Numerical experiments further validate the convergence analysis of the BRWP method.

math.NA↗
arXiv2026

An efficient and rigorous criterion for the admissible time step of deforming grids in generalized Lagrangian and ALE methods

It is mathematically proved that, for a grid under a boundary-preserving piecewise-smooth deformation, the positivity of the Jacobian determinant in each closed element is also a sufficient condition for the deformed grid to remain valid. Most of the proof is devoted to showing that the element-wise positivity of the Jacobian indeed induces a local isomorphism in the grid-deformation setting. This result provides users of ALE methods and of the generalized Lagrangian method with a clean answer: checking the Jacobian alone is enough to determine the validity of the deformed grid.

math.NA↗