We present a two-stage error estimation scheme for the fast multipole method (FMM). This scheme can be applied to any particle system. It incorporates homogeneous as well as inhomogeneous distributions. The FMM error as a consequence of the finite representation of the multipole expansions and the operator error is correlated with an absolute or relative user-requested energy threshold. Such a reliable error control is the basis for making reliable simulations in computational physics. Our FMM program on the basis of the two-stage error estimation scheme is available on request
Evaluating the energy of a system of N bodies interacting via a pairwise potential is naïvely an O(N...
The approximate computation of all gravitational forces between N interacting particles via the fast...
Numerical study of the multipole expansion for the multilevel fast multipole algorithm (MLFMA) is pr...
We present a two-stage error estimation scheme for the fast multipole method (FMM). This scheme can ...
The simulation of pairwise interactions in huge particle ensembles is a vital issue in scientific re...
Fast summation methods like the FMM are the backbone of a multitude of simulations in MD, astrophysi...
We introduce and demonstrate a new error control scheme for the computation of far-zone interactions...
The matrix-vector multiplication encountered in the iterative solution of scattering problems can be...
. Rapid evaluation of potentials in particle systems is an important, time-consuming step in many ph...
The computational error of the multilevel fast multipole algorithm is studied. The error convergence...
A number of physics problems can be modeled by a set of N elements which have pair-wise interactions...
A number of computational techniques are described that reduce the effort related to the continuous ...
The fast multipole method is an algorithm first developed to approximately solve the N-body problem ...
We present a new fast multipole method for particle simulations. The main feature of our algorithm i...
We present a new error control method that provides the truncation numbers as well as the required d...
Evaluating the energy of a system of N bodies interacting via a pairwise potential is naïvely an O(N...
The approximate computation of all gravitational forces between N interacting particles via the fast...
Numerical study of the multipole expansion for the multilevel fast multipole algorithm (MLFMA) is pr...
We present a two-stage error estimation scheme for the fast multipole method (FMM). This scheme can ...
The simulation of pairwise interactions in huge particle ensembles is a vital issue in scientific re...
Fast summation methods like the FMM are the backbone of a multitude of simulations in MD, astrophysi...
We introduce and demonstrate a new error control scheme for the computation of far-zone interactions...
The matrix-vector multiplication encountered in the iterative solution of scattering problems can be...
. Rapid evaluation of potentials in particle systems is an important, time-consuming step in many ph...
The computational error of the multilevel fast multipole algorithm is studied. The error convergence...
A number of physics problems can be modeled by a set of N elements which have pair-wise interactions...
A number of computational techniques are described that reduce the effort related to the continuous ...
The fast multipole method is an algorithm first developed to approximately solve the N-body problem ...
We present a new fast multipole method for particle simulations. The main feature of our algorithm i...
We present a new error control method that provides the truncation numbers as well as the required d...
Evaluating the energy of a system of N bodies interacting via a pairwise potential is naïvely an O(N...
The approximate computation of all gravitational forces between N interacting particles via the fast...
Numerical study of the multipole expansion for the multilevel fast multipole algorithm (MLFMA) is pr...