Journal of Applied Mathematics

Journal of Applied Mathematics / 2014 / Article

Research Article | Open Access

Volume 2014 |Article ID 693537 | 12 pages | https://doi.org/10.1155/2014/693537

A Numerical Convolution Representation of Potential for a Disk Surface Density in 3D

Academic Editor: Chein-Shan Liu
Received22 Apr 2014
Accepted14 Jul 2014
Published24 Jul 2014

Abstract

This study presents a numerical convolution representation of a potential induced from a disk of surface density, which has often been investigated in the center region of galaxies. The advantage of this representation is to release the softening length for the -body method and artificial boundary conditions for the spectral methods. With the help of fast Fourier transform, the computational complexity is only , where is the number of zones in one dimension. Numerical results show an almost second order of accuracy on a Cartesian coordinate system. A comparison study also demonstrates that this method can calculate the potential for disk surface density based on the uniform grids.

1. Introduction

Let us consider the Poisson equation with singular disk surface density [13] where , , , and are position, gravitational constant, Dirac symbol, and density, respectively. Hereafter, we set without loss of generality.

One possible method of solving (1) is to discretize the partial differential equation (1) using the finite difference method [46]. This discretization is where , , and for , based on the uniform mesh grids with the mesh sizes , , and in , , and directions, respectively. In this approach, the values of the potential on imposed boundaries should be calculated and a fully 3D calculation must be performed. Any numerical solutions of this partial differential problem involve unknowns, where is the number of zones in one dimension. The linear complexity of this approach is at least , for example, [7]. It seems unfeasible that a thin gaseous disk problem can directly solve the partial differential equation.

The other approach for solving (1) uses the integral form. The solution to (1) can be represented in terms of the fundamental solution, , where as The difficulties encountered in the numerical approach for solving (1) or (5) are related to the extent of the domain . The spectral method uses trigonometric bases functions and the artificial periodic boundary conditions [8]. However, the potential is not periodic in reality. A direct calculation using the -body method [1] has the total amount of complexity based on the number of mesh zones. For the -body method based on a uniform grid and using the FFT technique, the numerical complexity can be reduced from to . In other words, this produces a fast algorithm of linear complexity. Unfortunately, this method has a drawback, which is to introduce the softening parameter to overcome the singular integration where contains the origin.

The proposed method does not require the artificial periodic boundary condition and softening parameter and further improves the accuracy of the -body method. This study uses the uniform and logarithmic grid generations in Cartesian and polar coordinates, respectively. The other treatment is linear approximation for the surface density on the cell. This ensures that the proposed method is of second order in Cartesian coordinates. This study uses two examples, a disk [9] and its variation , to show numerically that the method achieves second-order accuracy. A comparison study also demonstrates that the proposed method is suitable for potentials on a thin disk.

Before the end of the section, another approach for an improvement of -body method is the fast multipole methods (FMM) [1, 10] which decomposes the region into local interactions and far-field interactions for every position. The FMM is efficient for fully three-dimensional calculations under the assumption that the far field is smooth. The FFM also relies on the ability to manipulate local multipole expansions for every box in the tree hierarchy [1113]. The proposed presentation based on the uniform grids is without the assumption of smoothness in the far-field region and does not require extra efforts on the tree hierarchy.

This paper is organized as follows. Sections 2.1 and 2.2 present the numerical methods for Cartesian and spherical coordinates, respectively. Section 4.1 presents the order of accuracy of the proposed methods as verified by a family of finite disks [9]. Section 4.2 presents a comparison with the -body calculation. Finally, we conclude this study in Section 5.

2. Methods

2.1. Cartesian Coordinates

Assume that the numerical computation domain for some number , which contains the support of the surface density, and further discretize the region uniformly as follows. Given a positive integer , define , , , and , where . Next, define the center of the cell as and , where . Hence, the domain is discretized into the cells.

We recall the -body method with fast Fourier transform (FFT). Represent the potential function of (1) as Where   According to (2), the potential is Calculate (8) using a numerical approach for the plane assuming that the support of the surface density is compact. Based on a restriction to the calculation of potentials on the plane, derive the formulae for all . Equation (8) is equal to The potential at for the -body method is approximated by That is, The approximated integral is of the first order and the fundamental function     is singular whenever . The -body method applies a softening parameter technique for with , to avoid the singularity.

To improve the calculation of (11), approximate the surface density on in (8) linearly by where and and are constant in the cell . The error of the discretization is . If a higher order accuracy is required, additional terms in the Taylor expansion in (13) can be considered.

Let By substituting (13) into (9), the potential can be approximated by where

Fortunately, the integrals of (14) can be obtained analytically with the help of the following simple formulae: The value is then equal to where the notation . The calculations of and are split into two parts by the identity and , respectively. This leads to

The forms of , , and in (16) are a type of convolution and the computational complexity can be reduced to with the help of FFT in the and directions. In the direction, the computational complexity is . This implies that the total complexity of this method is and for the plane and the whole 3D space, respectively.

2.2. Spherical and Polar Coordinates

While the method appears to be second-order-accurate for discretization on a Cartesian grid, it loses second-order accuracy using spherical polar coordinates. An algorithm for solving the Poisson equation in spherical polar coordinates has been used extensively in protostellar collapse and fragmentation calculations, where often a thin disk formed at the central core of the collapsing cloud [14]. The algorithm implemented in [15] is subsequently modified, see [16], to deal with filamentary density distributions. This method in [16] employed finite differences for the radial dependence of the potential and spherical harmonics for the angular dependence, resulting in a second-order method through convergence testing.

We are going to develop our approach for spherical coordinates , which can be reduced to polar coordinates ( ). The singular integral disappears, but the high order of accuracy is not attained because there is no explicit form for the integral of an elliptic function. Although the proposed calculation of potential has some drawbacks, it is still better than -body calculations and the method in [17].

The support of the surface density is compact, contained in a region   for some number . Confine the discretization on the radial region in logarithmic form and the azimuthal region uniformly as follows to achieve a fast calculation. Given a positive integer , define , , , , , , , and where . The effect of is to refine the mesh. Here, the proposed method for polar coordinates is of first order because a singular integration occurs (see below). Furthermore, the region     is discretized into the cells, for . For , the cells do not cover the origin and extra cells should be included. To simplify notation, denote , .

The potential function of (1) under the assumption in spherical coordinates can be expressed as where

The surface density on in (20) can be linearly approximated by where and and are constants in the cell . Equation (22) is the Taylor expansion in two dimensions and it follows that the error of the discretization is .

In this section, let Similarly for , , and on the central region . The term in (24) is for the formulation of a convolution type. According to (20) and (22), where Equation (27) can then be rewritten as

Define , where is the dimensionless radius. The evaluation of (23), (24), and (25) can be obtained with the help of the following simple integrals:

The definitions of and lead to Calculate the value of the integral The last integral in this equation is an elliptic integral, and this study uses a trapezoidal rule for its evaluation. This numerical approach approximates the value as follows: where the notation . Similarly,

3. Convergence Results

Let us denote as the area of the region in and discuss the convergence of the proposed method. The integrals of   over a region   and , for some constant , are where is a constant. Furthermore, if , then this integral is .

Lemma 1. If two compact disk densities and satisfy then their corresponding potentials and , respectively, satisfy where is a positive constant and depends on the supports of and .

Proof. Let the supports of and be contained in a finite region . Following (5) and (35), it yields that Since is finite and the lemma is obtained.

The order of accuracy between analytic and numerical solutions can be observed from the truncated errors of the disk surface and truncated density ,

The potential calculated numerically is denoted by and the analytic solution is . We estimate

We deduce the following theorem by aforementioned argument and Lemma 1.

Theorem 2. If the truncated errors of the Taylor series of the disk surface density are , where is the mesh size in one dimension and , then the errors between the numerical and analytic potential also are .

4. Numerical Results

This study verifies that the proposed method achieved is of second-order accuracy through the following two examples: a disk [9] and a nonaxisymmetric disk consisting of two superposed disks. The disk has the surface density where and is a given constant. The corresponding potential is where

4.1. Order of Accuracy

This study investigates the order of accuracy of the proposed method in norms , , and to demonstrate the convergence in total variation, energy, and pointwise senses, respectively. These norms for a function on a domain are defined as Without loss of generality for studying the order of accuracy, set the computational domain , and . Set for a disk simulation and for a disk simulation, where with and . Figure 1 presents the profiles of the surface density, the potential on plane and the residual between analytic and numerical solutions for . In Table 1, column represents the error between the analytic and numerical solutions in -norm, ,   and . Column in Table 1 represents the order of accuracy as measured by for to and similarly for . These errors show that the proposed method achieves nearly second-order accuracy. More precisely, the order of convergence is approximately or .



32
64 32/64 1.836 1.908 1.930
128 64/128 1.979 1.951 1.958
256 128/256 1.961 1.975 1.928
512 256/512 1.988 1.988 2.048


32
64 32/64 1.911 1.841 1.815
128 64/128 1.994 1.918 1.914
256 128/256 1.937 1.979 1.986
512 256/512 1.989 1.989 1.989

Continue to use the disk as an example and a unit disk as the computational domain to investigate the potential in polar coordinates. Set the value . Figure 2 presents the profiles of the surface density, potential, and the difference between analytic and numerical solutions for . According to Table 2, the order of accuracy is only approximately 1. Although the surface density at the origin is smooth, the singular elliptic integral introduces significant error there.



32
64 32/64 1.68 1.30 1.17
128 64/128 1.23 1.07 1.04
256 128/256 1.08 1.03 1.02
512 256/512 0.90 1.03 1.02

4.2. A Comparison Study

Start with And introduce a softening parameter to approximate For polar coordinates [1], the value of can be approximated by where and . Note that when ,      is undefined. Previous research has presented a way to avoid the singularity problem [1]. However, the proposed method avoids the singularity problem by directly evaluating the forces, thereby increasing the order of accuracy.

This study compares the proposed method with the -body method using the simulations of the and disks in the previous section. For Cartesian coordinates, choose the softening parameters as the mesh size . Table 3 shows the errors for the disks and that the accuracy when using the softening parameter approach for the and disks is of first order. This comparison confirms that the proposed method is more accurate and has a higher order of accuracy.



32