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

12/18/2020
by   Matthias Kirchhart, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2018

Numerical integration in arbitrary-precision ball arithmetic

We present an implementation of arbitrary-precision numerical integratio...
research
03/05/2022

New satellites of figure-eight orbit computed with high precision

In this paper we use a Modified Newton's method based on the Continuous ...
research
04/12/2016

Algorithmic computation of polynomial amoebas

We present algorithms for computation and visualization of amoebas, thei...
research
02/20/2022

Fast high-dimensional integration using tensor networks

The design and application of regression-free tensor network representat...
research
04/04/2023

Efficient Generic Quotients Using Exact Arithmetic

The usual formulation of efficient division uses Newton iteration to com...
research
11/12/2018

Newton: A Language for Describing Physics

This article introduces Newton, a specification language for notating th...
research
12/06/2017

Rings: an efficient Java/Scala library for polynomial rings

In this paper we briefly discuss Rings --- an efficient lightweight libr...

Please sign up or login with your details

Forgot password? Click here to reset