Error Analysis of Approximate Operators for a Particle Method based on Voronoi Diagram
Hajime Koba, Kazuki Sato

TL;DR
This paper analyzes the errors of approximate gradient and Laplace operators in a Voronoi diagram-based particle method, providing error estimates and an example application.
Contribution
It introduces and studies new approximate operators for gradient and Laplace in a Voronoi-based particle method, with derived error estimates.
Findings
Error estimates for approximate operators are derived.
The integration region is divided into specific areas for analysis.
An example application demonstrates the main results.
Abstract
This paper considers several approximate operators used in a particle method based on a Voronoi diagram. We introduce and study our approximate operators on gradient and Laplace operators. We derive error estimates for these approximate operators by applying our weight functions. The key idea of deriving our error estimates is to divide the integration region into a ring-shaped area and some areas. In the Appendix, we give an example application of the main results of this paper.
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 · Grouting, Rheology, and Soil Mechanics
Error Analysis of Approximate Operators for a Particle Method based on Voronoi Diagram
Hajime Koba
Graduate School of Engineering Science, Osaka University,
1-3 Machikaneyamacho, Toyonaka, Osaka, 560-8531, Japan
and
Kazuki Sato
Graduate School of Engineering Science, Osaka University,
1-3 Machikaneyamacho, Toyonaka, Osaka, 560-8531, Japan
Abstract.
This paper considers several approximate operators used in a particle method based on a Voronoi diagram. We introduce and study our approximate operators on gradient and Laplace operators. We derive error estimates for these approximate operators by applying our weight functions. The key idea of deriving our error estimates is to divide the integration region into a ring-shaped area and some areas. In the Appendix, we give an example application of the main results of this paper.
Key words and phrases:
Error analysis, Error estimates, Particle method, Voronoi diagram, Voronoi decomposition
Mathematics Subject Classification:
33F05
1. Introduction
We are interested in the error analysis of approximate operators for a moving particle semi-implicit method (MPS). A moving particle semi-implicit method is a numerical method developed by Koshizuka-Oka [4]. In [4], they introduced approximate operators of gradient and Laplace operators based on a Voronoi diagram. Ishijima-Kimura [3] considered the error on the approximate operators under assumptions on their weight function. In [3], they applied the spherical symmetry of their weight function to derive their error estimates. Imoto-Tagami [1, 2] modified the approximate operators introduced in [4], and studied their error estimates for their approximate operators. In [1, 2], they derived their convergence rates of their error estimates with respect to influence radius by using assumptions on their weight function.
This paper has three purposes. The first one is to generalize the approximate operators introduced in [4, 1, 2]. More precisely, this paper standardizes their approximate operators (see Definition 1.2 for details). The second is to derive error estimates for our approximate operators. We use some properties of our weight functions (Assumption 1.1) to study the error on our operators. The key idea of deriving our error estimates is to divide the integration region into a ring-shaped area and some areas. The third is to give an application of our main results (see the Appendix for details).
Let us first introduce notations. Let be the spatial variables, and let be a multi-index, where . For each multi-index , , , and , where , , and . For each , , the symbols , , , and are defined by , ,
[TABLE]
Note that . Let be a domain, and be the closure of . For each smooth function on , we define
[TABLE]
Morevoer, for each for some and , we define
[TABLE]
The following notations are of particular importance in this study. Let be a bounded domain, and be a positive constant. Throughout this paper, we fix and . Define
[TABLE]
See Fig. 1. Let and such that if . Write
[TABLE]
For each , we define
[TABLE]
See Fig. 1. In general, we call a Voronoi region, and a Voronoi diagram (see [5]). Since
[TABLE]
we call a Voronoi cell and a Voronoi decomposition. Write
[TABLE]
By definition, we see that . Throughout this paper, we assume that
[TABLE]
Let such that . Let be such that
[TABLE]
Let such that (see Fig. 1). Throughout this paper, we fix , , , and . For each ,
[TABLE]
and for each ,
[TABLE]
We assume that for each . We call the radius of the interaction area (influence radius).
Next we introduce the assumptions of our weight functions and approximate operators.
Assumption 1.1** (Weight functions).**
Let . We call a weight function if the following five properties hold:
For almost all ,
[TABLE]
For almost all ,
[TABLE]
There is such that for all
[TABLE]
There is such that for almost all
[TABLE]
There is such that for each ,
[TABLE]
Remark that several radial functions are our weight functions. In fact, we set
[TABLE]
for some . Since for , we easily check that satisfies the properties of Assumption 1.1. Applying the spherically symmetric property of our weight function, we derive our error estimates. See Sections 3-6 for details.
Definition 1.2** (Approximate operators).**
Let be a weight function satisfying the properties of Assumption 1.1. For each , define the approximate operators as follows:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Note that , , , and .
The main results of this paper are as follows.
Theorem 1.3**.**
Let be a weight function satisfying the properties of Assumption 1.1. Then for each ,
[TABLE]
Here
[TABLE]
Theorem 1.4**.**
Let be a weight function satisfying the properties of Assumption 1.1. Assume that for some . Then for each ,
[TABLE]
Here , are the constants defined by Theorem 1.3, and
[TABLE]
Theorem 1.5**.**
Let be a weight function satisfying the properties of Assumption 1.1. Assume that for some . Then for each ,
[TABLE]
Here
[TABLE]
[TABLE]
and
[TABLE]
Theorem 1.6**.**
Let be a weight function satisfying the properties of Assumption 1.1. Assume that for some . Then for each ,
[TABLE]
Here
[TABLE]
and
[TABLE]
Remark 1.7**.**
We explain the application of our results to numerical analysis and simulation. In (MPS), means the distribution of the particles in the domain , the position of a particle, and the number of the particles in . Using our approximate operators, we can study an approximation of a fluid system, however, we need advanced techniques. From Theorems 1.3-1.6, we see that our approximate operators become better approximations when the number of particles is sufficiently large.
In Section 2, we study some properties of our weight functions. We prove Theorem 1.3 in Section 3, Theorem 1.4 in Section 4, Theorem 1.5 in Section 5, and Theorem 1.6 in Section 6. In the Appendix, we give an application of the main results of this paper.
2. Preliminaries
In this section, we recall the Taylor theorem and study some fundamental properties of our weight functions.
Lemma 2.1** (Taylor’s theorem).**
Let and . Then for each ,
[TABLE]
Here
[TABLE]
Moreover, for each ,
[TABLE]
Proof.
(Lemma 2.1) We only derive (2.1). To this end, we show that for each
[TABLE]
A direct calculation gives
[TABLE]
We now assume that . Let such that . It is easy to check that
[TABLE]
and that
[TABLE]
Thus, we have
[TABLE]
Since and , we find that
[TABLE]
Therefore, we obtain (2.2).
Let us now derive (2.1). Fix and . Since for and , we apply (2.2) to check that
[TABLE]
Therefore, the lemma follows. ∎
To derive basic properties of our weight function, we prepare the following lemma.
Lemma 2.2**.**
For each and ,
[TABLE]
For each and ,
[TABLE]
For each and ,
[TABLE]
Proof.
(Lemma 2.2) We first show . By the definition of , we find that if . Therefore, we see that for each and ,
[TABLE]
This is (2.3). Next, we derive (2.4). Let and . By the definition of , we find that if . Therefore, we observe that
[TABLE]
Finally, we prove . Let . Since and , we find that
[TABLE]
Let . By definition, we see that
[TABLE]
This shows that
[TABLE]
Since
[TABLE]
we use (2.4) to check that
[TABLE]
Thus, we have (2.5). Therefore, the lemma follows. ∎
Lemma 2.3** (Properties of weight functions).**
Let be a weight function satisfying the properties of Assumption 1.1. Then the following six assertions hold:
For each and ,
[TABLE]
For each , , and ,
[TABLE]
For each , , and ,
[TABLE]
Here denotes the Kronecker delta.
For each ,
[TABLE]
For each and ,
[TABLE]
For each and ,
[TABLE]
Proof.
(Lemma 2.3) We first show . Using a change of variables, we see that
[TABLE]
This gives
[TABLE]
Fix and . Using a change of variables with (2.14), we observe that
[TABLE]
Therefore, we obtain .
Next, we prove and . Fix , , and . From (2.15), we have
[TABLE]
Using a change of variables, we find that
[TABLE]
By (2.15), we check that
[TABLE]
Therefore, we have and .
Now, we show . Since and for , we use the Lipschitz continuity of to observe that
[TABLE]
Thus, we have (2.11).
Finally, we prove and . Using (2.6), (2.7), and (2.4), we check that
[TABLE]
This gives (2.12). Similarly, we see (2.13). Therefore, the lemma follows. ∎
3. Error Estimate
In this section, we study to prove Theorem 1.3. To this end, we introduce some notations. Let be a weight function satisfying the properties of Assumption 1.1. For each , we define
[TABLE]
It is easy to check that . Since
[TABLE]
we prove the following lemma.
Lemma 3.1**.**
For each ,
[TABLE]
Proof.
(Lemma 3.1) We first show (3.1). Since
[TABLE]
we use the mean-value theorem to see that
[TABLE]
Therefore, we have (3.1).
Secondly, we derive (3.2). From
[TABLE]
we observe that
[TABLE]
Therefore, we see (3.2).
Next, we prove (3.3). Since
[TABLE]
we use the mean-value theorem and (2.11) to check that
[TABLE]
This is (3.3).
Finally, we show (3.4). By (2.11), we find that
[TABLE]
Therefore, we have (3.4), and the lemma follows. ∎
Finally, we prove Theorem 1.3.
Proof.
(Theorem 1.3) Using Lemma 3.1, we prove Theorem 1.3. ∎
4. Error Estimate
In this section, we consider to prove Theorem 1.4. Let be a weight function satisfying the properties of Assumption 1.1. For each , we define
[TABLE]
It is easy to check that
[TABLE]
It is clear that
[TABLE]
The aim of this section is to prove the following two lemmas.
Lemma 4.1**.**
For each ,
[TABLE]
Lemma 4.2**.**
For each ,
[TABLE]
We first show Lemma 4.1. Then we prove Lemma 4.2.
Proof.
(Lemma 4.1) Fix . From the Taylor expansion, we have
[TABLE]
where . Here
[TABLE]
Multiplying both sides of (4.5) by , and then integrating with respect to , we have
[TABLE]
Here
[TABLE]
From (2.10), we see that
[TABLE]
By (2.1), we find that
[TABLE]
Combining (4.6)-(4.8) gives (4.1). Therefore, the lemma follows. ∎
Proof.
(Lemma 4.2) Let . We first show (4.2). By the mean-value theorem, we see that
[TABLE]
Therefore, we have (4.2). Note that .
Next, we derive (4.3). A direct calculation gives
[TABLE]
Here
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
Since
[TABLE]
we use the mean-value theorem and (2.12) to check that
[TABLE]
From (4.9) and (4.10), we have (4.3).
Finally, we show (4.4). From (2.11), we see that
[TABLE]
This is (4.4). Therefore, the lemma follows. ∎
Finally, we prove Theorem 1.4.
Proof.
(Theorem 1.4) Combining Lemmas 4.1 and 4.2 gives Theorem 1.4. ∎
5. Error Estimate
In this section, we estimate to prove Theorem 1.5. Let be a weight function satisfying the properties of Assumption 1.1. For each , we define
[TABLE]
We see at once that
[TABLE]
The proof of Theorem 1.5 makes use of the following two lemmas.
Lemma 5.1**.**
For each ,
[TABLE]
Lemma 5.2**.**
For each ,
[TABLE]
Here are the constants defined by Theorem 1.5.
We first show Lemma 5.1. Then we prove Lemma 5.2.
Proof.
(Lemma 5.1) Fix . From the Taylor expansion, we have
[TABLE]
where . Here
[TABLE]
Multiplying both sides of (5.5) by , and integrating with respect to , we have
[TABLE]
Here
[TABLE]
Using (2.10), (2.9), and (2.1), we find that
[TABLE]
Combining (5.6)-(5.9), we have (5.1). Therefore, the lemma follows. ∎
Proof.
(Lemma 5.2) Let . We first show (5.2). Since
[TABLE]
for , we use the mean-value theorem to see that
[TABLE]
Using , we see that
[TABLE]
A direct calculation shows that
[TABLE]
Using (5.10), we check that
[TABLE]
Therefore, the lemma follows. ∎
Finally, we prove Theorem 1.5.
Proof.
(Theorem 1.5) Using Lemmas 5.1 and 5.2, we prove Theorem 1.5. ∎
6. Error Estimate
In this section, we consider to prove Theorem 1.6. Let be a weight function satisfying the properties of Assumption 1.1. For each , we define
[TABLE]
It is easy to check that
[TABLE]
Let us attack the following two lemmas.
Lemma 6.1**.**
For each ,
[TABLE]
Lemma 6.2**.**
For each ,
[TABLE]
Here are the constants defined by Theorem 1.6.
We first show Lemma 6.1. Then we prove Lemma 6.2.
Proof.
(Lemma 6.1) Fix . Multiplying both sides of (5.5) by , and then integrating with respect to , we have
[TABLE]
Here
[TABLE]
By (2.10) and (2.9), we find that
[TABLE]
Applying (2.1), we see that
[TABLE]
Combining (6.5)-(6.8), we have (6.1). Therefore, the lemma follows. ∎
Proof.
(Lemma 6.2) Let . We first show (6.2). By the mean-value theorem, we see that
[TABLE]
Therefore, we have (6.2).
Next, we derive (6.3). A direct calculation gives
[TABLE]
Here
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
Since
[TABLE]
we use the mean-value theorem and (2.13) to check that
[TABLE]
From (6.9) and (6.10), we have (6.3).
Finally, we derive (6.4). Using (2.5) and the mean-value theorem to see that
[TABLE]
This is (6.4). Therefore, the lemma follows. ∎
Finally, we prove Theorem 1.6.
Proof.
(Theorem 1.6) Using Lemmas 6.1 and 6.2, we prove Theorem 1.6. ∎
7. Appendix: Applications of Main Results
We state an application of the main results of this paper. We consider the following case:
[TABLE]
It is easy to check that and that for each ,
[TABLE]
In this section, we assume that ,
[TABLE]
Suppose that there is such that
[TABLE]
Assume that for some . Using Theorems 1.3-1.6 and , we have the following corollary.
Corollary 7.1**.**
For each ,
[TABLE]
[TABLE]
Moreover, the following two assertions hold:
If , , , then
[TABLE]
If , , , then
[TABLE]
Proof.
(Corollary 7.1) We only show (7.2) and (7.6) since other cases are similar. Fix .
We first show (7.2). Since , it follows from Theorem 1.4 to see that
[TABLE]
By the assumptions of Section 7, we check that
[TABLE]
Therefore, we obtain (7.2).
Next we show (7.6). A direct calculation shows that
[TABLE]
and that
[TABLE]
From (7.2), we have (7.6). Therefore, Corollary 7.1 is proved. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Y. Imoto and D.Tagami, A truncation error estimate of the interpolant of a particle method based on the Voronoi decomposition , JSIAM Letters, 8 (2016), pp.29–32.
- 2[2] Y. Imoto and D.Tagami, Truncation error estimates of approximate differential operators of a particle method based on the Voronoi decomposition , JSIAM Letters, 9 (2017), pp.69–72.
- 3[3] K. Ishijima and M. Kimura, Truncation error analysis of finite difference formulae in meshfree particle methods (in Japanese), Trans, JSIAM, 20 (2010), pp.165–182.
- 4[4] S. Koshizuka, Y. Oka, Moving-Particle Semi-Implicit Method for Fragmentation of Incompressible Fluid , Nuclear Science and Engineering: 123 (1996), 421–434
- 5[5] G. Voronoi, Nouvelles applications des paramètres continus à la théorie des formes quadratiques , Journal für die Reine und Angewandte Mathematik (1908) (133): 97–178. doi:10.1515/crll.1908.133.97
