Truncation error estimates of approximate operators in a generalized particle method
Yusuke Imoto

TL;DR
This paper derives and verifies truncation error estimates for approximate operators in a generalized particle method, enhancing the understanding of its numerical accuracy and convergence behavior.
Contribution
It introduces a new regularity framework and error estimates for operators in a generalized particle method, unifying analysis across various particle techniques.
Findings
Error estimates align with theoretical convergence rates.
Numerical results confirm the accuracy of the derived estimates.
The framework applies to multiple particle methods, including SPH.
Abstract
To facilitate the numerical analysis of particle methods, we derive truncation error estimates for the approximate operators in a generalized particle method. Here, a generalized particle method is defined as a meshfree numerical method that typically includes other conventional particle methods, such as smoothed particle hydrodynamics or moving particle semi-implicit methods. A new regularity of discrete parameters is proposed via two new indicators based on the Voronoi decomposition of the domain along with two hypotheses of reference weight functions. Then, truncation error estimates are derived for an interpolant, approximate gradient operator, and approximate Laplace operator in the generalized particle method. The convergence rates for these estimates are determined based on the frequency with which they appear in the regularity and hypotheses. Finally, the estimates are computed…
| Numer. | Theor. | Numer. | Theor. | Numer. | Theor. | |
|---|---|---|---|---|---|---|
| (a) Interpolant | ||||||
| () | -0.10 | N/A | 2.02 | 2 | 2.00 | 2 |
| () | 0.05 | N/A | 2.13 | 2 | 2.01 | 2 |
| () | 0.00 | N/A | 4.20 | 2 | 7.41 | 4 |
| (b) Gradient | ||||||
| () | -0.05 | N/A | 2.11 | 2 | 2.02 | 2 |
| () | -0.02 | N/A | 2.08 | 2 | 2.03 | 2 |
| () | -0.06 | N/A | 3.56 | 2 | 7.69 | 4 |
| (c) Laplacian | ||||||
| () | -1.14 | N/A | 2.91 | 1 | 2.05 | 2 |
| () | -1.09 | N/A | 2.39 | 1 | 2.23 | 2 |
| () | -1.02 | N/A | 2.76 | 1 | 7.50 | 3 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFluid Dynamics Simulations and Interactions · Numerical methods in engineering · Dam Engineering and Safety
Truncation error estimates of approximate operators in a generalized particle method
Yusuke Imoto1
1Institute for Advanced Study, Kyoto UniversityYoshida Konoe-cho, Sakyo-ku, Kyoto 6068501, Japan
Abstract.
To facilitate the numerical analysis of particle methods, we derive truncation error estimates for the approximate operators in a generalized particle method. Here, a generalized particle method is defined as a meshfree numerical method that typically includes other conventional particle methods, such as smoothed particle hydrodynamics or moving particle semi-implicit methods. A new regularity of discrete parameters is proposed via two new indicators based on the Voronoi decomposition of the domain along with two hypotheses of reference weight functions. Then, truncation error estimates are derived for an interpolant, approximate gradient operator, and approximate Laplace operator in the generalized particle method. The convergence rates for these estimates are determined based on the frequency with which they appear in the regularity and hypotheses. Finally, the estimates are computed numerically and the results are shown to be in good agreement with the theoretical results.
Key words and phrases:
generalized particle method, truncation error estimate, approximate operator, smoothed particle hydrodynamics, moving particle semi-implicit
1. Introduction
Particle methods, such as the smoothed particle hydrodynamics (SPH) [10, 18, 19] and moving particle semi-implicit (MPS) [15, 16, 29] methods, are numerical methods for solving partial differential equations that are based on points called particles distributed in a domain. In such methods, an interpolant and several approximate differential operators are defined in terms of linear combinations of weighted interactions between neighboring particles. When such methods are applied to partial differential equations, the equations are effectively discretized in space. As the discretization procedure does not require mesh generation in the domain, particle methods can be applied to moving boundary problems, such as the deformation and destruction of structures [5, 22] and flow problems associated with free surfaces [21, 23].
The accuracy of particle methods has been widely researched. From an engineering perspective, many studies have been conducted into the convergence of such methods in practical applications, such as Amicarelli [1, 2], Fulk [9], and Quinlan et al. [25]. On the other hand, few studies in the literature have presented numerical analyses of these methods from a mathematical perspective. In the 1980s, Mas-Gallic and Ravirt [20] and Ravirt [26] provided error estimates for particle methods when applied to parabolic and hyperbolic partial differential equations on unbounded domains. In the 2000s, Moussa and Via [4] and Moussa [3] provided error estimates of nonlinear conservation lows on bounded domains. In their work, the time integrations of the particle positions and volumes were obtained by solving the differential equations with respect to advection fields. However, as their method is only applicable to problems described by solvable differential equations, it cannot be used with other problems, such as those involving the Navier–Stokes equations.
Sometime later, Ishijima and Kimura [13] developed a truncation error estimate for an approximate gradient operator in MPS. By introducing a regularity for particle distributions based on an indicator called the equivolume partition radius, they determined the conditions that depend solely on the space distributions of the particles. However, a practical limitation is that the indicator cannot be computed.
In previous works, we established truncation error estimates for an interpolant, approximate gradient operator, and approximate Laplace operator of a generalized particle method in which the particle volumes were given as Voronoi volumes [11, 12]. A generalized particle method is a numerical method that typically includes conventional particle methods, such as SPH and MPS. In previous studies, we derived truncation error estimates by introducing a regularity using an indicator known as the covering radius, which is used in the numerical analysis of meshfree methods based on moving least-square methods and radial basis functions [17, 27, 30]. Although the formulations and conditions in those works are computable, they are difficult to deploy in practical computations as the computational costs associated with particle volumes based on Voronoi decomposition are high.
The focus of the current work was to analyze particle methods under more practical conditions by extending our results to cases with commonly used particle volumes. We also introduce another indicator of particle volumes, which we refer to as a Voronoi deviation, that represents the deviation between particle volumes and Voronoi volumes. Then, utilizing the Voronoi deviation, we extend the regularity and introduce two hypotheses of reference weight functions. Using the regularity and hypotheses, we derive truncation error estimates of the interpolant, approximate gradient operator, and approximate gradient operator of the generalized particle method. Finally, we numerically analyze our estimates and compare the results to those from the theory.
The remainder of this paper is organized as follows. The interpolant and approximate operators of the generalized particle method are introduced in Section 2. A regularity describing the family of discrete parameters is discussed in Section 3, after which we propose our primary theorem with respect to the truncation error estimates and provide some corollaries. Then, the primary theorem is proven in Section 4, numerical results are detailed in Section 5, and some concluding remarks are outlined in Section 6.
In the remainder of this section, we describe some notation and define some relevant function spaces. Let , , and be the set of positive real numbers, the set of nonnegative real numbers, and the set of nonnegative integers, respectively. Let be the dimension of a space. Let be the set of all -dimensional multi-indices. If there is no ambiguity, the symbol is used to denote the following: denotes the Euclidean norm for a vector ; denotes the volume of for open set ; denotes for . For , let be . For , let be the space of real continuous functions defined in with the norm defined as
[TABLE]
For and , let be the space of functions in with derivatives up to the th order with its seminorm and norm defined as
[TABLE]
respectively. Here with multi-index .
2. Approximate operators in a generalized particle method
Let be a bounded domain in . Let be a fixed positive number. For and , we define extended domain as
[TABLE]
For , we define a particle distribution and particle volume set as
[TABLE]
[TABLE]
respectively. We refer to and as a particle and particle volume, respectively. An example of the particle distribution in is shown in Figure 1.
We define an admissible reference weight function set as
[TABLE]
we refer to as a reference weight function, and we define the influence radius as satisfying and . If there is no ambiguity, we denote as . For reference weight function and influence radius , we define the weight function as
[TABLE]
Note that the weight function satisfies
[TABLE]
and is absolutely continuous.
For , we define interpolant , approximate gradient operator , and approximate Laplace operator as
[TABLE]
respectively. Here, for and , and are index sets of particles defined as
[TABLE]
respectively.
As discussed later in Appendix A, the approximate operators (10), (11), and (12) indicate a wider class of approximate operators of particle methods that those in the SPH and MPS methods. Therefore, we refer to the approximate operators (10), (11), and (12) as generalized approximate operators and to a particle method that uses them as a generalized particle method.
3. Truncation error estimates of approximate operators
We first introduce a regularity of discrete parameters. Let be the Voronoi decomposition of associated with the particle distribution , where is the Voronoi region defined as
[TABLE]
We define a particle volume decomposition as a decomposition of associated with particle volume set defined as
[TABLE]
An example of the Voronoi decomposition of associated with the particle distribution is shown in Figure 2.
We define a covering radius for particle distribution as
[TABLE]
Moreover, we define a Voronoi deviation for the particle distribution and the particle volume set as
[TABLE]
with
[TABLE]
Then, we define a regularity for a family consisting of a particle distribution , particle volume set , and influence radius as follows:
Definition 1**.**
Family is said to be regular with order if there exists a positive constant such that
[TABLE]
Remark 2**.**
As shown in Figure 3, the covering radius becomes large in the case of a particle distribution with both dense and sparse regions. Therefore, the covering radius can be considered as an indicator representing the uniformness of particle distribution .
Remark 3**.**
A Voronoi deviation equals zero if and only if the particle volumes are given as the Voronoi volume (). Moreover, the Voronoi deviation becomes large if the particle volumes are given as values far from the Voronoi volumes. Therefore, the Voronoi deviation can be regarded as an indicator of the deviation between the particle volume set and the Voronoi volume set.
Remark 4**.**
For a given family and given constant , it is possible to determine whether or not the family is regular with order as the covering radius and Voronoi deviation are absolutely computable, as shown in Appendix B.
Next, we introduce two hypotheses of reference weight function :
Hypothesis 5**.**
For , the reference weight function satisfies for all with ,
[TABLE]
Hypothesis 6**.**
For , the reference weight function satisfies
[TABLE]
where for , is defined as
[TABLE]
Remark 7**.**
All reference functions satisfy Hypothesis 5 with . Moreover, for all and , reference weight functions satisfying Hypothesis 5 with and Hypothesis 6 with can be constructed as shown in Appendix C.
We now state a theorem that defines truncation error estimates of approximate operators in the generalized particle method with a continuous norm:
Theorem 8**.**
Suppose that family is regular with order and that reference weight function satisfies Hypothesis 5 with . Then, there exists a positive constant independent of such that
[TABLE]
In addition, if satisfies Hypothesis 6 with , then we have
[TABLE]
and if satisfies Hypothesis 6 with , then we have
[TABLE]
The proof of Theorem 8 is presented in the next section. As shown in the corollaries in Appendix A, the approximate operators commonly used in the SPH and MPS methods are valid for Theorem 8 under appropriate settings.
4. Proof of truncation error estimates
The following notation will be used in the subsequent proof of Theorem 8. Hereafter, let be a generic positive constant independent of . For , set as
[TABLE]
For and , set as
[TABLE]
For , set as
[TABLE]
We now present the following lemma.
Lemma 9**.**
Suppose that satisfies Hypothesis 5 with . Then, there exists a positive constant independent of such that
[TABLE]
[TABLE]
[TABLE]
Proof.
First, we prove (30). We fix . Then, let be the open ball in with center and radius , i.e.,
[TABLE]
From , we have . Then, for all and , we obtain the Taylor expansion of as
[TABLE]
From (10) and (34) with , we have
[TABLE]
Moreover, by Hypothesis 5, we have
[TABLE]
Because
[TABLE]
we have
[TABLE]
Moreover, we have
[TABLE]
Therefore, from (37), (39), and (40), we obtain (30).
Next, we prove (31). From (11) and (34) with , we have
[TABLE]
Because for with ,
[TABLE]
we have
[TABLE]
Hypothesis 5 with yields
[TABLE]
[TABLE]
From (38), we have
[TABLE]
Moreover, we have
[TABLE]
Therefore, from (47), (48), and (49), we obtain (31).
Finally, we prove (32). From (12) and (34) with , we have
[TABLE]
From (42), we have
[TABLE]
Hypothesis 5 with yields
[TABLE]
Therefore, we have
[TABLE]
From (38), we have
[TABLE]
Moreover, we have
[TABLE]
Therefore, from (54), (55), and (56), we obtain (32). ∎
Next, we show estimates of , , and .
Lemma 10**.**
There exists a positive constant independent of such that
[TABLE]
Proof.
We arbitrarily fix , , and particle volume decomposition and split into
[TABLE]
with
[TABLE]
Then, we estimate , , and .
First, we estimate . Because
[TABLE]
we can rewrite as
[TABLE]
From
[TABLE]
we obtain
[TABLE]
From
[TABLE]
we have
[TABLE]
Because is absolutely continuous, we have
[TABLE]
for all . Moreover, we have
[TABLE]
From (67), (68), and (69), we have
[TABLE]
Therefore, from (65) and (70), we obtain
[TABLE]
Next, we estimate . Because and , we have
[TABLE]
From (72), we have
[TABLE]
Moreover, from (68) and (69), we have
[TABLE]
Therefore, from (64) and (74), we obtain
[TABLE]
Finally, we estimate . Because
[TABLE]
we can rewrite as
[TABLE]
Because when , we estimate when . Let be -dimensional multi-indices with satisfying
[TABLE]
Then, we have, for all ,
[TABLE]
[TABLE]
By and , if , then
[TABLE]
Moreover, from , we have
[TABLE]
From (69), (81), and (82), we have
[TABLE]
Therefore, from (80), (83), and , we obtain
[TABLE]
From the estimates of , , and , we obtain
[TABLE]
Because is arbitrary, we establish (57). ∎
Lemma 11**.**
Suppose that reference weight function satisfies Hypothesis 6 with . Then, there exists a positive constant independent of such that for all and with ,
[TABLE]
Proof.
We arbitrarily fix , , particle volume decomposition , and with and split into
[TABLE]
with
[TABLE]
Then, we estimate , , and .
First, we estimate and set as (23) and as
[TABLE]
Then, from (62), we can rewrite as
[TABLE]
Because
[TABLE]
we obtain
[TABLE]
From , we have
[TABLE]
Thus, we obtain
[TABLE]
Using an argument similar to (68), if satisfies Hypothesis 6 with , then for all ,
[TABLE]
[TABLE]
Next, we estimate . By using , we can rewrite as
[TABLE]
From (93), we obtain
[TABLE]
By and , we have
[TABLE]
From (97) and (101), we obtain
[TABLE]
Finally, we estimate . Using , we can rewrite as
[TABLE]
where is
[TABLE]
For , let be -dimensional multi-indices satisfying
[TABLE]
Let be -dimensional multi-indices defined as
[TABLE]
For all , when , we have
[TABLE]
Moreover, from (79) and (107), when , we have
[TABLE]
Therefore, when , we have for all and ,
[TABLE]
From (109), we obtain
[TABLE]
Because , we have
[TABLE]
Therefore, we have
[TABLE]
Because for all ,
[TABLE]
by the same procedure as (83), we have
[TABLE]
Therefore, we obtain
[TABLE]
From the estimates of , , and , we obtain
[TABLE]
Because is arbitrary, we establish (86). ∎
Lemma 12**.**
There exists a positive constant independent of such that
[TABLE]
Proof.
We arbitrarily fix and particle volume decomposition , and split into
[TABLE]
with
[TABLE]
Then, we estimate , , , and .
From (62), we can rewrite as
[TABLE]
For all , we have
[TABLE]
From (70) and (124), we obtain
[TABLE]
From (74) and (124), we obtain
[TABLE]
For all and , we have
[TABLE]
From (83), (127), and , we obtain
[TABLE]
From (8), we obtain
[TABLE]
From the estimates of , , , and , we obtain
[TABLE]
Because is arbitrary, we establish (117). ∎
Using the lemmas defined above, we now prove Theorem 8.
Theorem 8.
By Lemmas 9, 10, and 12, we have for all
[TABLE]
Moreover, by Lemmas 9, 11, and 12, when satisfies Hypothesis 6 with , we have for all
[TABLE]
and when satisfies Hypothesis 6 with for all ,
[TABLE]
Because the family is regular, by applying (20) to (131), (132), and (133), we obtain (24), (25), and (26), respectively. We now conclude the proof of Theorem 8. ∎
5. Numerical results
Set and . Then, . We now compute the truncation errors of , which are defined as . Particle distribution is set as
[TABLE]
where is taken by and are random numbers satisfying . Particle distribution with is shown in Figure 4.
Particle volume set is defined as
[TABLE]
For , the influence radius is set as
[TABLE]
Note that if , then for all . Using the discrete parameters above, the covering radius satisfies . Moreover, the Voronoi deviation satisfies . Therefore, the family is regular with order .
For the interpolant, we consider the following three cases of reference weight functions:
[TABLE]
is the lowest order polynomial function belonging to . is the cubic B-spline commonly used in SPH and belonging to . is the lowest order polynomial function belonging to that satisfies Hypothesis 5 with .
For the approximate gradient operator, we consider the following three cases of reference weight functions:
[TABLE]
is the lowest order polynomial function belonging to and Hypothesis 6 with . is chosen so that approximate gradient operator (11) with coincides with that in SPH with the cubic B-spline (see Appendix A). is the lowest order polynomial function belonging to , Hypothesis 5 with , and Hypothesis 6 with .
For the approximate Laplace operator, we consider the following three cases of reference weight functions:
[TABLE]
is the lowest order polynomial function belonging to and Hypothesis 6 with . is chosen so that approximate Laplace operator (12) with coincides with that in SPH with the cubic B-spline (see Appendix A). is the lowest order polynomial function belonging to , Hypothesis 5 with , and Hypothesis 6 with .
The above settings were used in the computation of the following relative errors
[TABLE]
Here, the discrete norm is defined as
[TABLE]
Figure 5 shows graphs of the relative errors of (a) interpolant , (b) approximate gradient operator , and (c) approximate Laplace operator versus the influence radius with regular orders . In Figure 5, the slopes of the triangles show the theoretical convergence rates obtained via Theorem 8. Table 1 lists the numerical and theoretical convergence rates obtained from the cases of and , where the theoretical convergence rates correspond to Theorem 8. In the case of , as the settings could not be applied to Theorem 8, only numerical results without convergence were obtained. In contrast, the settings in cases and could be applied Theorem 8; thus, the numerical results with convergence were obtained. Moreover, the approximate operators with reference weight functions satisfying Hypothesis 5 with became higher convergence orders in the cases where as per Theorem 8.
6. Conclusions
We analyzed truncation errors in a generalized particle method, which is a wider class of particle methods that includes commonly used methods such as SPH and MPS. In our analysis, we introduced two indicators: the first was the covering radius, which represents the maximum radius of the Voronoi region associated with the particle distribution, while the second was the Voronoi deviation, which indicates the deviation between particle volumes and Voronoi volumes. With the covering radius and Voronoi deviation, we introduced a regularity of a family of discrete parameters, which includes the particle distribution, particle volume set, and influence radius associated with the number of particles. Moreover, we introduced two hypotheses of reference weight functions. With the regularity and hypotheses of reference weight functions, we established truncation error estimates for the continuous norm. The convergence rates are dependent on the regular order and order of the reference weight functions appearing in a hypothesis. Moreover, as it was possible to validate the conditions by calculation, we showed the numerical convergence orders were in good agreement with the theoretical ones.
In a forthcoming paper, we plan to establish error estimates of the generalized particle method for the Poisson and heat equations.
Acknowledgments
We would like to thank Drs. Daisuke Tagami and Hayato Waki for their helpful comments over the course of this work. This research was supported by JSPS KAKENHI Grant Number 17K17585 and the JSPS A3 Foresight Program.
Appendix A Description of conventional particle methods by the generalized particle method
This appendix provides a description of conventional particle methods, such as the smoothed particle hydrodynamics (SPH) [18, 24] and the moving particle semi-implicit (MPS) [16], in the context of the generalized particle method. In SPH, by using the reference weight function and parameters , for , the approximate operators are defined as
[TABLE]
By setting and , the generalized interpolant (10) coincides with (139). Moreover, because
[TABLE]
by setting
[TABLE]
and , (11) and (12) coincide with (140) and (141), respectively.
From Theorem 8, we obtain the following corollary that is a truncation error estimate of approximate operators (140) and (141).
Corollary 13**.**
Suppose that parameters satisfy
[TABLE]
and that is regular with order , where . Moreover, suppose that satisfies the following conditions;**
[TABLE]
Then, there exists a positive constant independent of such that
[TABLE]
Remark 14**.**
Note that representative reference weight functions employed in SPH, such as the cubic B-spline, quintic B-spline, and Wendland function (5-order positive definite function) [8, 18], satisfy (145).
In MPS [14], by using reference weight function and parameters for , approximate differential operators can be defined as
[TABLE]
Note that an interpolant is not defined in MPS. By setting and , the approximate gradient operator (11) coincides with (149). Moreover, by setting and , approximate Laplace operator (12) coincides with (150).
Corollary 15**.**
Suppose that
[TABLE]
Moreover, suppose that is regular with order , where . Then, there exists a positive constant independent of such that
[TABLE]
Furthermore, when satisfies Hypothesis 6 with ,
[TABLE]
Remark 16**.**
Note that the reference weight function, which is commonly used in the MPS and defined as
[TABLE]
does not satisfy . In contrast, the continuous reference weight function as introduced in [28] satisfies . However, as far as we know, no reference weight functions that also satisfy Hypothesis 6 with are proposed in MPS.
Appendix B Computational procedure of the indicators
This appendix introduces the procedures for computing the indicators introduced in this paper, namely, the covering radius (17) and Voronoi deviation (18).
The covering radius can be computed as follows. As per the methods used to construct Voronoi decompositions, such as the increment method [6], we first draw the boundaries of the Voronoi region in . Next, for each particle, we compute the maximum distance from particle to the boundary of its Voronoi region (i.e., ). Finally, we obtain the covering radius by computing the maximum of these distances.
Next, we consider the Voronoi deviation . Let be
[TABLE]
Using parameters , we set as
[TABLE]
Moreover, we set so that equation represents
[TABLE]
and
[TABLE]
Then, by considering to be , we find that the minimum value of with condition coincides with the Voronoi deviation . We therefore consider the linear problem:
[TABLE]
Here, . The solution of (159) is equivalent to the Voronoi deviation . Because is unique for , the linear problem is computable via numerical methods for linear programming problems, such as the simplex method [7].
Appendix C Construction of reference weight functions
For all , it is possible to construct a reference weight function satisfying Hypothesis 5 with as the condition of Hypothesis 5 can be rewritten to include a finite number of conditions
[TABLE]
Here, the Gauss symbol denotes the largest integer that is less than or equal to . For example, function is set as the th polynomial function:
[TABLE]
Then, if coefficients satisfy the linear equations
[TABLE]
then satisfies and Hypothesis 5 with . Therefore, to construct reference functions with Hypothesis 5 with represented by polynomial functions, the degree of the polynomial functions must be at least .
Moreover, for all , reference weight functions satisfying Hypothesis 6 with can be constructed based on the following proposition.
Proposition 17**.**
Assume that reference the weight function defined in satisfies and is represented by a polynomial function in for . Let be the minimum degree of in . Then, if , satisfies Hypothesis 6 with .
Proof.
From the assumption, can be represented by
[TABLE]
where and . Set as (23). Since
[TABLE]
and
[TABLE]
if , we have satisfies Hypothesis 6 with . ∎
This proposition means that the regularity of the reference functions around zero is important.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Amicarelli, A., Marongiu, J.C., Leboeuf, F., Leduc, J., Caro, J.: SPH truncation error in estimating a 3D function. Comput. & Fluids 44 (1), 279–296 (2011)
- 2[2] Amicarelli, A., Marongiu, J.C., Leboeuf, F., Leduc, J., Neuhauser, M., Fang, L., Caro, J.: SPH truncation error in estimating a 3D derivative. Int. J. Numer. Methods Eng. 87 (7), 677–700 (2011)
- 3[3] Ben Moussa, B.: On the convergence of SPH method for scalar conservation laws with boundary conditions. Methods Appl. Anal. 13 (1), 29–62 (2006)
- 4[4] Ben Moussa, B., Vila, J.: Convergence of SPH method for scalar nonlinear conservation laws. SIAM J. Numer. Anal. 37 (3), 863–887 (2000)
- 5[5] Benz, W., Asphaug, E.: Simulations of brittle solids using smooth particle hydrodynamics. Comput. Phys. Commun. 87 (1), 253–265 (1995)
- 6[6] Boissonnat, J.D., Yvinec, M.: Algorithmic geometry. Cambridge Univ. Press, Cambridge (1998)
- 7[7] Dantzig, G.B.: Linear programming and extensions, corrected edn. Princeton Landmarks in Mathematics. Princeton Univ. Press, Princeton (1998)
- 8[8] Dehnen, W., Aly, H.: Improving convergence in smoothed particle hydrodynamics simulations without pairing instability. Monthly Not. Roy. Astronom. Soc. 425 (2), 1068–1082 (2012)
