scholarly journals High-Accuracy Treecode Based on Pseudoparticle Multipole Method

2003 ◽  
Vol 208 ◽  
pp. 305-314 ◽  
Author(s):  
Atsushi Kawai ◽  
Junichiro Makino

We invented the pseudoparticle multipole method (P2M2), a method to express multipole expansion by a distribution of pseudoparticles. We can use this distribution of particles to calculate high order terms in both the Barnes-Hut treecode and FMM. The primary advantage of P2M2 is that it works on GRAPE. Although the treecode has been implemented on GRAPE, we could handle terms only up to dipole, since GRAPE can calculate forces from point-mass particles only. Thus the calculation cost grows quickly when high accuracy is required. With P2M2, the multipole expansion is expressed by particles, and thus GRAPE can calculate high order terms. Using P2M2, we realized arbitrary-order treecode on MDGRAPE-2. Timing result shows MDGRAPE-2 accelerates the calculation by a factor between 20 (for low accuracy) to 150 (for high accuracy). We parallelized the code so that it runs on MDGRAPE-2 cluster. The calculation speed of the code shows close-to-linear scaling up to 16 processors for N ≳ 106.

Acta Numerica ◽  
1997 ◽  
Vol 6 ◽  
pp. 229-269 ◽  
Author(s):  
Leslie Greengard ◽  
Vladimir Rokhlin

We introduce a new version of the Fast Multipole Method for the evaluation of potential fields in three dimensions. It is based on a new diagonal form for translation operators and yields high accuracy at a reasonable cost.


1997 ◽  
Vol 06 (04) ◽  
pp. 425-447 ◽  
Author(s):  
Takeshi Fukuyama ◽  
Yuuko Kakigi ◽  
Takashi Okamura

Nontransparent models of the multipole expansion model and the two point-mass model are analyzed from the catastrophe theory. Singularity behaviours of 2n-pole moments are discussed. We apply these models to the triple quasar PG1115+080 and compare with the typical transparent model, softened power law spheroids. The multipole expansion model gives the best fit among them.


Axioms ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 88
Author(s):  
David Levin

In some applications, one is interested in reconstructing a function f from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we suggest a method for deriving high order approximation to f using a Padé-like method. Namely, we do this by fitting some Fourier coefficients of the approximant to the given Fourier coefficients of f. Given the Fourier series coefficients of a function on a rectangular domain in Rd, assuming the function is piecewise smooth, we approximate the function by piecewise high order spline functions. First, the singularity structure of the function is identified. For example in the 2D case, we find high accuracy approximation to the curves separating between smooth segments of f. Secondly, simultaneously we find the approximations of all the different segments of f. We start by developing and demonstrating a high accuracy algorithm for the 1D case, and we use this algorithm to step up to the multidimensional case.


2015 ◽  
Vol 23 (13) ◽  
pp. 16977 ◽  
Author(s):  
Zhaoli Zeng ◽  
Xueming Qu ◽  
Yidong Tan ◽  
Runtao Tan ◽  
Shulian Zhang

2017 ◽  
Vol 141 (6) ◽  
pp. EL574-EL578 ◽  
Author(s):  
Zhixiong Gong ◽  
Philip L. Marston ◽  
Wei Li ◽  
Yingbin Chai

Sign in / Sign up

Export Citation Format

Share Document