# On Solving the Poisson Equation with Discontinuities on Irregular Interfaces: GFM and VIM.

1. IntroductionThe Poisson equations with discontinuities across irregular interfaces emerge in applications such as multiphase flows with and without phase change, in heat transfer, in electrokinetics, or in the modeling of biomolecules' electrostatics. Several numerical methods have been proposed to solve this system, each with their own advantages and disadvantages. One approach is in the context of Discontinuous Galerkin methods, an extension of the finite element method (FEM); e.g., see [1-12] and the references therein. Finite element methods lead to symmetric positive definite linear systems that can be efficiently solved with fast iterative solvers [13]. In addition, FEM-type approaches can derive and use a priori error estimates to refine the mesh where higher resolution is needed. However, FEM-type methods rely on the quality of the underlying mesh, which is often difficult to obtain in cases where the irregular domain undergoes large deformations. In this case, it is challenging to generate a mesh with elements that pass a quality measure needed to ensure accurate solutions.

Differential quadrature method is worth mentioning as presented in [14, 15]. There Lagrange interpolation and/or modified cubic B-splines are used, depending on boundary conditions, to approximate the solution to two-dimensional nonlinear hyperbolic partial differential equations. Irregular interfaces and discontinuities were, however, not studied there.

Another approach is within the context of finite difference methods (FDM); e.g., see [16-25] and the references therein. For finite difference methods the grid is Cartesian (uniform or adaptive), which leads to a straightforward grid generation process. However, interfaces must be represented by other means and the treatment of boundary conditions requires additional considerations.

In order to capture the interface and enforce the correct boundary conditions, several approaches have been explored. The immersed boundary method (for example, [26-30]) uses the [delta]-formulation that smears out the solution profile across the interface. This produces algorithms that are straightforward to implement since they are similar to solving the same equations on a regular domain. However, the smearing of the solution introduces O(1) errors near the interface. The immerse interface method (IIM) (see, for example, [31-37]) is a sharp interface method that leads to second-order accurate solution, albeit it is not a robust second-order method since it reaches its order by minimizing the truncation error. The method leads to neither symmetric nor positive definite linear systems and the application of the immerse interface method may be difficult in three spatial dimensions.

In [20], Liu et al. introduced a Ghost-Fluid Methodology (a finite difference approach) that treats the jump condition in a dimension-by-dimension framework. This leads to a linear system that is symmetric positive definite and the jump conditions only affect the right-hand side of the linear system, leading to an easy-to-implement method. However, the GFM suffers a loss in accuracy due to smearing of the tangential derivative of the discontinuity at the interface caused by this dimension-by-dimension framework, as indicated in [20].

The Voronoi Interface Method (VIM) [38] avoids the loss of accuracy of the GFM of [20] by constructing local Voronoi partitioning near the interface. The cells adjacent to the interface therefore have their faces orthogonal to the fluxes of the solution, hence providing a configuration that can leverage the Ghost-Fluid Methodology to its fullest. The advantage is therefore that the solution is second-order accurate. A drawback is that the solution is computed at the cells' center of the Voronoi partition and an additional interpolation step is required, if the solution is needed on the original Cartesian mesh. As is the case of GFM of [20], the linear system is symmetric positive definite and only its right-hand side is modified by the jump conditions. Finally, we note that even though the construction of a global Voronoi partition may be difficult and costly, the construction of a local partition, i.e., only for cells that are adjacent to the interface, is straightforward. In [38], the authors used the Voro++ library of [39].

In this paper we highlight the performance of both GFM and VIM. It is worth noting that both methods are unconditionally stable since they are implicit. Both methods have also shown that they can handle high ratios of discontinuity in their coefficients.

2. Governing Equations and Numerical Methods

We consider the Poisson equation with variable coefficient and discontinuities (jumps) across an irregular interface, r, which splits the computational domain Q into two domains [[OMEGA].sup.+] and [[OMEGA].sup.-], both in [R.sup.n], n [member of] N. The governing equation is

[nabla] x ([beta][nabla]u) = f for [x.bar] [member of] [[OMEGA].sup.+] [union] [[OMEGA].sup.-], (1)

where f = f([x.bar]) and [beta] = [beta]([x.bar]) are given. Here, [beta] is bounded from below by a positive constant and f is in [L.sup.2]([OMEGA]). This equation is supplemented by jump conditions on the irregular interface,

[u] = a,

[[beta][nabla]u x [n.bar] = h, (2)

where [mathematical expression not reproducible] denotes a jump in u across [GAMMA]. The functions a = a([x.bar]) and h = h([x.bar]) are given. Either Dirichlet, Neumann, or Robin boundary conditions can be imposed at the boundaries of the computational domain, [partial derivative][OMEGA]. In order to represent the irregular interface, we use the signed distance level-set function, [phi], which is positive inside [[OMEGA].sup.+], negative inside [[OMEGA].sup.-], and zero on [GAMMA]. The outward normal to the irregular interface can be computed from the level-set function by

[n.bar] = ([n.sub.1], [n.sub.2], [n.sub.3]) = [nabla][phi]/[absolute value of [nabla][phi]]. (3)

2.1. The Ghost-Fluid Method. A detailed description of the Ghost-Fluid Method is given in [20], we will explore here the main aspects in two spatial dimensions. The discontinuity in [[beta][u.sub.n], where [u.sub.n] refers to the derivative in the normal direction to the interface, is [[beta][u.sub.n]].sub.[GAMMA]] = [[beta][u.sub.x]].sub.[GAMMA]] [n.sub.1] + [[beta][u.sub.y]].sub.[GAMMA]] [n.sub.2]. The discontinuity in [beta][u.sub.t], where [u.sub.t] refers to the derivative in the tangential direction to the interface, is [[beta][u.sub.t]].sub.[GAMMA]] = [[beta][u.sub.x]].sub.[GAMMA]] [n.sub.2] - [[beta][u.sub.y]].sub.[GAMMA]] [n.sub.1]. These equations lead to [[beta][u.sub.x]].sub.[GAMMA]] = [[beta][u.sub.n]].sub.[GAMMA]][n.sub.1] + [[beta][u.sub.t]].sub.[GAMMA]][n.sub.2] and [[beta][u.sub.y]].sub.[GAMMA]] = [[beta][u.sub.n]].sub.[GAMMA]][n.sub.2] - [[beta][u.sub.t]].sub.[GAMMA]][n.sub.1]. However, in order to devise a method in a dimension-by-dimension framework, the Ghost-Fluid Method smears out the discontinuity in the tangential derivative leading to the simplification [[beta][u.sub.x]].sub.[GAMMA]] = [[beta][u.sub.n]].sub.[GAMMA]][n.sub.1] and [[beta][u.sub.y]].sub.[GAMMA]] = [[beta][u.sub.n]].sub.[GAMMA]][n.sub.1]. The discretization at each grid point i, j is then given by

[mathematical expression not reproducible], (4)

where [[beta].sub.i+1/2,j] = ([[beta].sub.i] + [[beta].sub.i+1])/2 if [x.sub.i,j] and [[beta].sub.i+1/,j] are on the same side of the interface or by [mathematical expression not reproducible] otherwise, where is the value of [phi] of the node in [[OMEGA].sup.+] and [[phi].sup.-] is the value of [phi] of the node in [[OMEGA].sup.-]. Here [[beta].sup.[+ or -]] refers to the value of [beta] adjacent to the interface in the [[OMEGA].sup.[+ or -]] domain and [increment of x] and [DELTA]y are the cells' sizes in the x-and y-directions, respectively. The left-hand side thus gives the same symmetric positive definite matrix as the one generated by the standard five-point stencil discretization of the Poisson equation on regular domains and only the right-hand side is altered when a discontinuity occurs. Furthermore, [F.sup.x] = [F.sup.L] + [F.sup.R] and [F.sup.y] = [F.sup.B] + [F.sup.T] are only activated if there is a discontinuity present in the local five point stencil. Here, [F.sup.L] and [F.sup.R] and the contribution from the left and right grid points to the current grid point and [F.sup.B] and [F.sup.T] are the contributions from the bottom and top grid points.

We give the details for [F.sup.L] and [F.sup.R] in the x-direction, referring the reader to the original paper [20] for the description for [F.sup.B] and [F.sup.T] in the y-direction, since they follow the same procedure. If [[phi].sub.i-1,j] and [[phi].sub.i,j] have opposite signs, define [theta] = [mathematical expression not reproducible], where [a.sub.i,j] is the jump at the grid node and [mathematical expression not reproducible]. [F.sup.L] is then defined as

[mathematical expression not reproducible]. (5)

Similarly, if [[phi].sub.i-1,j] and [[phi].sub.i,j] have opposite signs, define [theta] = [mathematical expression not reproducible]. [F.sup.R] is then defined as

[mathematical expression not reproducible]. (6)

The Ghost-Fluid Method leads to a symmetric positive definite linear systems that captures the discontinuity in the normal derivative while smearing out the discontinuity in the tangential direction to the interface.

2.2. The Voronoi Interface Method. We present a summary of the method and refer the reader to [38] for a detailed description. For a given set of seeds, the Voronoi cell of a seed is defined as the points of space that are closer to that seed than any other. The union of the Voronoi cells is a tessellation of space, and the first step for the Voronoi Interface Method is to generate the Voronoi mesh associated with the background mesh chosen, which in our case is a uniform Cartesian grid. The seeds are of two types,

(i) if a cell of the background mesh is not crossed by the irregular interface r, its center is a seed of the Voronoi mesh,

(ii) if a cell of the background mesh is crossed by the irregular interface r, we locate the projection of its center onto the interface and generate two seeds located on either side of the projected point at a distance [DELTA] = min([increment of x], [DELTA]y)/5.

The Voronoi partition associated with those seeds is constructed using a simple geometric algorithm. We refer the reader to the Voro++ library [39] for an efficient tool to compute Voronoi partitions in both two and three spatial dimensions.

Equation (1) is then discretized on the Voronoi mesh using a finite volume approach. The complete derivation is presented in [38] and leads to the discretization of the interaction between point i and point j

[mathematical expression not reproducible] (7)

where any variable of the form [[gamma].sub.k] would be the quantity [gamma] at point k, [d.sub.ij] is the distance between i and j, [s.sub.ij] is the length of the face between i and j, [[??].sub.ij] = 2[[beta].sub.i][[beta].sub.j]/([[beta].sub.i] + [[beta].sub.j]), and Vol([C.sub.i]) is the volume of the Voronoi cell associated with point i. The discontinuities at the interface only affect the right-hand side of the linear system where the irregular interface is located and the system is symmetric positive definite.

We remark that the solution is provided at the center of the Voronoi cells. If the solution is needed on the original background mesh, then an interpolation step is required. This can be done, for example, with least square interpolations and it does not impact the order of accuracy of the solution as long as the order of the polynomial interpolants is high enough. In this article, we work with second-order polynomial interpolants.

3. Numerical Experiments: Results

We present a pair of two-dimensional numerical examples where the two methods are compared. Both examples have a star shaped irregular interface. The first example has a coefficient [beta] that is constant in the whole domain. This example has a constant discontinuity in the solution across the irregular interface but neither a discontinuity in the normal nor tangential derivatives at the interface. The second example has a [beta] coefficient that is not constant and has a discontinuity across the irregular interface. This example has a nonconstant discontinuity in the solution and nonconstant discontinuities in the normal and tangential components of the gradient of the solution at the irregular interface.

3.1. Constant [beta]-Coefficient. Let us consider V x ([beta][nabla]u) = f(x, y) in two spatial dimensions in [OMEGA] = [[-1, 1].sup.2] with the level set function [phi] = [square root of [x.sup.2] + [y.sup.2] + 0.5 + 0.15 cos (5 arctan (y/x)). We take [beta] = 1 when [phi] < 0 and an exact solution of u = cos(x)cos(y). For the region [phi] > 0, we take [beta] = 1 and the exact solution to be u = cos(x)cos(y) + 1. A representation of the solution and the Voronoi mesh are given in Figure 1. The comparison of the Ghost-Fluid Method and the Voronoi Interface Method is shown in Table 1 for the maximum error in the solution, in Table 2 for the average error in the solution, in Table 3 for the maximum error of the gradient, and in Table 4 for the average error of the gradient. For the Voronoi Interface Method, we present the errors on both the Voronoi mesh and the Cartesian mesh. For the Voronoi mesh, the gradients are computed on the faces of the Voronoi cells. For example, the solution only experiences a constant discontinuity in its solution and no discontinuities in its normal or tangential derivatives nor is there a discontinuity in the [beta] coefficient, which is constant in the entire domain. Both methods give second-order accuracy in the solution in the [L.sup.[infinity]]-and [L.sup.1] -norms and the solution's gradient in the [L.sup.1]-norm. However, the Voronoi method gives first-order accuracy for the gradient of the solution in the [L.sup.[infinity]]-norm while the GFM gives second-order accuracy for such simplified problems. A likely explanation for this difference is that the fluxes in the volume of fluid derivation for the Voronoi Interface Method are not necessarily computed at the center of the faces between two points. We also observe that the interpolation from the Voronoi mesh to the Cartesian mesh does not impact the solution itself but affects its gradient. However, the order of accuracy is conserved. We conclude that for such simple problems the GFM is preferable.

3.2. Nonconstant [beta]-Coefficient. Let us consider [nabla] x ([beta][nabla]u) = f(x, y) in two spatial dimensions in [OMEGA] = [[-1, 1].sup.2] with the level set function [phi] = [square root of [x.sup.2] + [y.sup.2]] + 0.5 + 0.15 cos(5 arctan (y/ x)). We set [beta] = [y.sup.2] ln (x + 2) + 4 and the exact solution to u = [e.sup.x] in the region where [phi] [less than or equal to] 0. In the region where [phi] > 0, we set [beta] = [e.sup.-y] and the exact solution to u = cos(x)sin(y). Figure 2 provides a representation of the solution and of the diffusion coefficient. The comparison of the Ghost-Fluid Method and the Voronoi Interface Method is shown in Table 5 for the maximum error in the solution, in Table 6 for the average error in the solution, in Table 7 for the maximum error of the gradient, and in Table 8 for the average error of the gradient. Again, for the Voronoi Interface Method we present the results on both the Voronoi and the Cartesian meshes. For example, there is a nonconstant discontinuity in the solution, a nonconstant discontinuity in the normal derivative of the solution to the interface, a nonconstant discontinuity in the tangential derivative of the solution to the interface, a discontinuity in the [beta] coefficient across the interface, and a [beta] coefficient that is not constant in each domain as in the previous example. The Ghost-Fluid Method is only first-order accurate in both the [L.sup.[infinity]]- and the [L.sup.1]-norm, as well as in the [L.sup.1]-norm for the gradient of the solution. However, it is not consistent in the [L.sup.[infinity]]-norm for the gradient of the solution. This example is a case where the lack of orthogonality between the cells' faces and the solution's fluxes lowers the accuracy of the GFM's dimension-by-dimension approach. The Voronoi Interface Method provides a solution to that drawback and, therefore, produces a second-order accurate solution in the [L.sup.[infinity]] and [L.sup.1]-norms, and first-order accurate (resp., second-order accurate) gradients in the [L.sup.[infinity]] (resp., [L.sup.1]-) norm. Similarly to the previous example, we observe a decrease in accuracy for the gradient computed on the Cartesian mesh after the interpolation step, but the order of accuracy is conserved. The solution itself does not suffer from the interpolation step. For this type of complex problems, the Voronoi Interface Method is able to provide a second-order accurate solution and consistent gradient that the Ghost-Fluid Method cannot produce. VIM is therefore the recommended approach.

4. Conclusion

This paper has considered the numerical solution of the Poisson equation with jump conditions across an irregular interface. In particular, we have compared the results obtained with the Ghost-Fluid Method and the Voronoi Interface Method. The Ghost-Fluid Method imposes the jump conditions in a dimension-by-dimension framework, leading to a linear system that is symmetric positive definite in which the jump conditions only affect the right-hand side. However, the dimension-by-dimension approach forces a smearing of the tangential quantities in the jump, leading to a loss of accuracy unless both the discontinuity in the solution and the variable coefficient [beta] are constant. The Voronoi Interface method solves that problem by constructing a Voronoi partition for cells adjacent to the interface. A finite volume discretization over those cells produces discretized fluxes that are orthogonal to the cells' faces themselves and aligned with the normal direction to the interface. The Ghost-Fluid philosophy can therefore be readily applied, resulting in a linear system that is also symmetric positive definite with only its right-hand side affected by the jump conditions. The resulting solution is second-order accurate (versus first-order accurate in the general case of the Ghost-Fluid Method) and the solution's gradient is first-order accurate (versus zeroth-order accurate in the case of the Ghost-Fluid Method). The Voronoi Interface Method can therefore be considered superior in general. In the particular case where both the discontinuity across the interface is constant and the variable coefficient [beta] is constant over each subdomains and across the interface, the Ghost-Fluid Method gives a second-order accurate solution and also second-order accurate gradient, giving this approach an advantage over the Voronoi Interface Method. The likely reason is that the discrete fluxes for the Voronoi Interface Method are not located at the center of the faces between two points. Finally, the Voronoi Interface Method provides the solution at the center of the Voronoi cells. An interpolation step is required if the solution on the original Cartesian mesh is needed which can, for example, be carried out with least square interpolations. The order of accuracy is then preserved though the quality of the gradient of the solution is impacted.

https://doi.org/10.1155/2018/9216703

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Disclosure

The present address of Arthur Guittet is Google LLC, 1600 Amphitheatre Parkway Mountain View, CA 94043.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this article.

Acknowledgments

The research of A. Helgadottir was supported by the University of Iceland Research Fund 2015 under HI14090070. The researches of A. Guittet and F. Gibou were supported in part by the NSF under DMS-1412695 and DMREF-1534264.

References

[1] I. Babuska, "The finite element method for elliptic equations with discontinuous coefficients," Commputing, vol. 5, pp. 207-213, 1970.

[2] J. H. Bramble and J. T. King, "A finite element method for interface problems in domains with smooth boundaries and interfaces," Advances in Computational Mathematics, vol. 6, no. 2, pp. 109-138, 1996.

[3] Z. Chen and J. Zou, "Finite element methods and their convergence for elliptic and parabolic interface problems," Numerische Mathematik, vol. 79, no. 2, pp. 175-202, 1998.

[4] M. Dryja, "A Neumann-Neumann algorithm for a mortar discretization of elliptic problems with discontinuous coefficients," Numerische Mathematik, vol. 99, no. 4, pp. 645-656, 2005.

[5] J. Huang and J. Zou, "A mortar element method for elliptic problems with discontinuous coefficients," IMA Journal of Numerical Analysis (IMAJNA), vol. 22, no. 4, pp. 549-576, 2002.

[6] B. P. Lamichhane and B. I. Wohlmuth, "Mortar finite elements for interface problems," Computing, vol. 72, no. 3-4, pp. 333-348, 2004.

[7] A. Hansbo and P. Hansbo, "A finite element method for the simulation of strong and weak discontinuities in solid mechanics," Computer Methods Applied Mechanics and Engineering, vol. 193, no. 33-35, pp. 3523-3540, 2004.

[8] A. Hansbo and P. Hansbo, "An unfitted finite element method, based on Nitsche's method, for elliptic interface problems," Computer Methods Applied Mechanics and Engineering, vol. 191, no. 47-48, pp. 5537-5552, 2002.

[9] J.-H. Song, P. M. A. Areias, and T. Belytschko, "A method for dynamic crack and shear band propagation with phantom nodes," International Journal for Numerical Methods in Engineering, vol. 67, no. 6, pp. 868-893, 2006.

[10] J. Dolbow and I. Harari, "An efficient finite element method for embedded interface problems," International Journal for Numerical Methods in Engineering, vol. 78, no. 2, pp. 229-252, 2009.

[11] S. Gross and A. Reusken, "An extended pressure finite element space for two-phase incompressible flows with surface tension," Journal of Computational Physics, vol. 224, no. 1, pp. 40-58, 2007.

[12] L. Parussini and V. Pediroda, "Fictitious domain approach with hp-finite element approximation for incompressible fluid flow," Journal of Computational Physics, vol. 228, no. 10, pp. 3891-3910, 2009.

[13] Y. Saad, Iterative Methods for Sparse Linear Systems, SIAM, NY, USA, 2nd edition, 2003.

[14] R. Jiwari, "Lagrange interpolation and modified cubic B-spline differential quadrature methods for solving hyperbolic partial differential equations with Dirichlet and Neumann boundary conditions," Computer Physics Communications, vol. 193, pp. 55-65, 2015.

[15] S. Pandit, R. Jiwari, K. Bedi, and M. E. Koksal, "Haar wavelets operational matrix based algorithm for computational modelling of hyperbolic type wave equations," Engineering Computations (Swansea, Wales), vol. 34, no. 8, pp. 2793-2814, 2017.

[16] R. J. LeVeque and Z. Li, "Immersed interface methods for Stokes flow with elastic boundaries or surface tension," SIAM Journal on Scientific Computing, vol. 18, no. 3, pp. 709-735, 1997.

[17] Z. Tan, D. V. Le, Z. Li, K. M. Lim, and B. C. Khoo, "An immersed interface method for solving incompressible viscous flows with piecewise constant viscosity across a moving elastic membrane," Journal of Computational Physics, vol. 227, no. 23, pp. 9955-9983, 2008.

[18] J. T. Beale and A. T. Layton, "On the accuracy of finite difference methods for elliptic problems with interfaces," Communications in Applied Mathematics and Computational Science, vol. 1, pp. 91-119, 2006.

[19] A. Wiegmann and K. P. Bube, "The explicit-jump immersed interface method: finite difference method for pdes with piecewise smooth solutions," SIAM Journal on Numerical Analysis, vol. 37, no. 3, pp. 827-862, 2000.

[20] X.-D. Liu, R. P. Fedkiw, and M. Kang, "A boundary condition capturing method for Poisson's equation on irregular domains," Journal of Computational Physics, vol. 160, no. 1, pp. 151-178, 2000.

[21] F. Gibou, R. P. Fedkiw, L.-T. Cheng, and M. Kang, "A second-order-accurate symmetric discretization of the Poisson equation on irregular domains," Journal of Computational Physics, vol. 176, no. 1, pp. 205-227, 2002.

[22] F. Gibou and R. Fedkiw, "A fourth order accurate discretization for the Laplace and heat equations on arbitrary domains, with applications to the Stefan problem," Journal of Computational Physics, vol. 202, no. 2, pp. 577-601, 2005.

[23] Z. Jomaa and C. Macaskill, "The Shortley-Weller embedded finite-difference method for the 3D Poisson equation with mixed boundary conditions," Journal of Computational Physics, vol. 229, no. 10, pp. 3675-3690, 2010.

[24] I.-L. Chern and Y.-C. Shu, "A coupling interface method for elliptic interface problems," Journal of Computational Physics, vol. 225, no. 2, pp. 2138-2174, 2007.

[25] Y. C. Zhou, S. Zhao, M. Feig, and G. W. Wei, "High order matched interface and boundary method for elliptic equations with discontinuous coefficients and singular sources," Journal of Computational Physics, vol. 213, no. 1, pp. 1-30, 2006.

[26] C. S. Peskin, "Flow patterns around heart valves: a numerical method," Journal of Computational Physics, vol. 10, no. 2, pp. 252-271, 1972.

[27] C. S. Peskin, "Numerical analysis of blood flow in the heart," Journal of Computational Physics, vol. 25, no. 3, pp. 220-252, 1977.

[28] C. S. Peskin, "The immersed boundary method," Acta Numerica, vol. 11, pp. 479-517, 2002.

[29] C. S. Peskin and B. F. Printz, "Improved volume conservation in the computation of flows with immersed elastic boundaries," Journal of Computational Physics, vol. 105, no. 1, pp. 33-46, 1993.

[30] M. Sussman, P. Smereka, and S. Osher, "A level set approach for computing solutions to incompressible two-phase flow," Journal of Computational Physics, vol. 114, no. 1, pp. 146-159, 1994.

[31] R. J. LeVeque and Z. L. Li, "The immersed interface method for elliptic equations with discontinuous coefficients and singular sources," SIAM Journal on Numerical Analysis, vol. 31, no. 4, pp. 1019-1044, 1994.

[32] L. Adams and T. P. Chartier, "New geometric immersed interface multigrid solvers," SIAM Journal on Scientific Computing, vol. 25, no. 5, pp. 1516-1533, 2004.

[33] L. Adams and T. P. Chartier, "A comparison of algebraic multigrid and geometric immersed interface multigrid methods for interface problems," SIAM Journal on Scientific Computing, vol. 26, no. 3, pp. 762-784, 2005.

[34] L. Adams and Z. Li, "The immersed interface/multigrid methods for interface problems," SIAM Journal on Scientific Computing, vol. 24, no. 2, pp. 463-479, 2002.

[35] L. Adams and T. Chartier, "A decomposed Immersed Interface method for variable coefficient elliptic equations with non-smooth and discontinuous solutions," Journal of Computational Physics, vol. 197, no. 1, pp. 364-386, 2004.

[36] Z. Li and K. Ito, The Immersed Interface Method: Numerical Solutions of PDEs Involving Interfaces and Irregular Domains, vol. 33, SIAM, Philadelphia, NC, USA, 2006.

[37] T. Y. Hou, Z. Li, S. Osher, and H. Zhao, "A hybrid method for moving interface problems with application to the Hele-Shaw flow," Journal of Computational Physics, vol. 134, no. 2, pp. 236-252, 1997.

[38] A. Guittet, M. Lepilliez, S. Tanguy, and F. Gibou, "Solving elliptic problems with discontinuities on irregular domains--the Voronoi interface method," Journal of Computational Physics, vol. 298, pp. 747-765, 2015.

[39] C. H. Rycroft, "VORO++: a three-dimensional voronoi cell library in C++," Chaos, vol. 19, 2009.

Asdis Helgadottir (iD), (1) Arthur Guittet, (2) and Frederic Gibou (2,3)

(1) Faculty of Industrial Engineering, Mechanical Engineering and Computer Science Department, University of Iceland, Reykjavik 107, Iceland

(2) Mechanical Engineering Department, University of California, Santa Barbara, CA 93106, USA

(3) Computer Science Department, University of California, Santa Barbara, CA 93106, USA

Correspondence should be addressed to Asdis Helgadottir; asdishe@hi.is

Received 15 May 2018; Accepted 3 October 2018; Published 17 October 2018

Guest Editor: Manoj Kumar

Caption: FIGURE 1: Left: visualization of the exact solution, for example, shown in Section 3.1. Right: example of a Voronoi mesh generated.

Caption: FIGURE 2: Visualization of the exact solution u (left) and of the diffusion coefficient [beta] (right), for example, shown in Section 3.2.

TABLE 1: Comparison of the [L.sup.[infinity]] error in the solution for the Ghost-Fluid Method and the Voronoi Interface Method, for example, shown in Section 3.1. Ghost-Fluid Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.[infinity]] 0.25 2.627 x [10.sup.-3] -- 0.125 6.587 x [10.sup.-4] 2.00 0.0625 1.648 x [10.sup.-4] 2.00 0.03125 4.121 x [10.sup.-5] 2.00 0.015625 1.030 x [10.sup.-5] 2.00 0.0078125 2.576 x [10.sup.-6] 2.00 0.00390625 6.439 x [10.sup.-7] 2.00 Voronoi Interface Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.[infinity]] 0.25 3.709 x [10.sup.-3] -- 0.125 6.172 x [10.sup.-4] 2.59 0.0625 1.565 x [10.sup.-4] 1.98 0.03125 4.016 x [10.sup.-5] 1.96 0.015625 1.020 x [10.sup.-5] 1.98 0.0078125 2.598 x [10.sup.-6] 1.97 0.00390625 6.591 x [10.sup.-7] 1.98 VIM Interpolated dx [[parallel] u - [u.sub.h] Order [parallel].sub.[infinity]] 0.25 4.098 x [10.sup.-1] -- 0.125 5.901 x [10.sup.-2] 2.80 0.0625 1.788 x [10.sup.-4] 8.37 0.03125 4.030 x [10.sup.-5] 2.15 0.015625 1.023 x [10.sup.-5] 1.98 0.0078125 2.656 x [10.sup.-6] 1.95 0.00390625 6.655 x [10.sup.-7] 2.00 TABLE 2: Comparison of the L1 error in the solution for the Ghost- Fluid Method and the Voronoi Interface Method, for example, shown in Section 3.1. Ghost-Fluid Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.1]] 0.25 9.010 x [10.sup.-4] -- 0.125 2.597 x [10.sup.-4] 1.79 0.0625 6.940 x [10.sup.-5] 1.90 0.03125 1.792 x [10.sup.-5] 1.95 0.015625 4.552 x [10.sup.-6] 1.98 0.0078125 1.147 x [10.sup.-6] 1.99 0.00390625 2.879 x [10.sup.-7] 1.99 Voronoi Interface Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.1]] 0.25 1.790 x [10.sup.-2] -- 0.125 2.918 x [10.sup.-3] 5.04 0.0625 7.365 x [10.sup.-5] 4.31 0.03125 1.848 x [10.sup.-5] 2.00 0.015625 4.625 x [10.sup.-6] 1.98 0.0078125 1.156 x [10.sup.-6] 1.98 0.00390625 2.890 x [10.sup.-7] 1.99 VIM Interpolated dx [[parallel] u - [u.sub.h] Order [parallel].sub.1]] 0.25 4.694 x [10.sup.-2] -- 0.125 1.417 x [10.sup.-3] 5.04 0.0625 7.130 x [10.sup.-5] 4.31 0.03125 1.780 x [10.sup.-5] 2.00 0.015625 4.518 x [10.sup.-6] 1.98 0.0078125 1.142 x [10.sup.-6] 1.98 0.00390625 2.871 x [10.sup.-7] 1.99 TABLE 3: Comparison of the [L.sup.[infinity]] error in the gradient of the solution for the Ghost-Fluid Method and the Voronoi Interface Method, for example, shown in Section 3.1. Ghost-Fluid Method dx [[parallel] [nabla] - [nabla] [u.sub.h] Order [parallel].sub.[infinity]] 0.25 4.829 x [10.sup.-3] -- 0.125 1.398 x [10.sup.-3] 1.79 0.0625 3.776 x [10.sup.-4] 1.89 0.03125 9.866 x [10.sup.-5] 1.94 0.015625 2.530 x [10.sup.-5] 1.96 0.0078125 6.419 x [10.sup.-6] 1.98 0.00390625 1.618 x [10.sup.-6] 1.99 Voronoi Interface Method dx [[parallel] [nabla] - [nabla] [u.sub.h] Order [parallel].sub.[infinity]] 0.25 8.160 x [10.sup.-3] -- 0.125 1.550 x [10.sup.-3] 2.40 0.0625 5.192 x [10.sup.-4] 1.58 0.03125 4.367 x [10.sup.-4] 0.25 0.015625 2.551 x [10.sup.-4] 0.78 0.0078125 1.376 x [10.sup.-4] 0.89 0.00390625 8.580 x [10.sup.-5] 0.68 VIM Interpolated dx [[parallel] [nabla] - [nabla] [u.sub.h] Order [parallel].sub.[infinity]] 0.25 1.872 x [10.sup.-0] -- 0.125 3.666 x [10.sup.-1] 2.35 0.0625 4.180 x [10.sup.-2] 3.13 0.03125 2.082 x [10.sup.-2] 1.01 0.015625 1.037 x [10.sup.-2] 1.00 0.0078125 5.195 x [10.sup.-3] 0.99 0.00390625 2.597 x [10.sup.-3] 1.00 TABLE 4: Comparison of the [L.sup.1] error in the gradient of the solution for the Ghost-Fluid method and the Voronoi Interface Method, for example, shown in Section 3.1. Ghost-Fluid Method dx [[parallel] [nabla] - [nabla] [u.sub.h] Order [parallel].sub.1] 0.25 3.636 x [10.sup.-3] -- 0.125 8.704 x [10.sup.-4] 2.06 0.0625 2.155 x [10.sup.-4] 2.01 0.03125 5.343 x [10.sup.-5] 2.01 0.015625 1.331 x [10.sup.-5] 2.01 0.0078125 3.322 x [10.sup.-6] 2.00 0.00390625 8.298 x [10.sup.-7] 2.00 Voronoi Interface Method dx [[parallel] [nabla] - [nabla] [u.sub.h] Order [parallel].sub.1] 0.25 2.575 x [10.sup.-3] -- 0.125 3.490 x [10.sup.-4] 2.88 0.0625 7.553 x [10.sup.-5] 2.21 0.03125 1.711 x [10.sup.-5] 2.14 0.015625 4.126 x [10.sup.-6] 2.05 0.0078125 9.930 x [10.sup.-7] 2.05 0.00390625 2.465 x [10.sup.-7] 2.01 VIM Interpolated dx [[parallel] [nabla] - [nabla] [u.sub.h] Order [parallel].sub.1] 0.25 3.797 x [10.sup.-1] -- 0.125 2.908 x [10.sup.-1] 3.71 0.0625 5.617 x [10.sup.-3] 2.37 0.03125 1.474 x [10.sup.-3] 1.93 0.015625 3.707 x [10.sup.-4] 1.99 0.0078125 9.345 x [10.sup.-5] 1.99 0.00390625 2.350 x [10.sup.-5] 1.99 TABLE 5: Comparions of the [L.sup.[infinity]] error in the solution for the Ghost-Fluid Method and the Voronoi Interface Method, for example, shown in Section 3.2. Ghost-Fluid Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.[infinity]] 0.25 6.254 x [10.sup.-1] -- 0.125 4.063 x [10.sup.-1] 0.62 0.0625 2.493 x [10.sup.-1] 0.70 0.03125 1.474 x [10.sup.-1] 0.76 0.015625 8.488 x [10.sup.-2] 0.80 0.0078125 4.802 x [10.sup.-2] 0.82 0.00390625 1.481 x [10.sup.-2] 0.84 Voronoi Interface Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.[infinity]] 0.25 9.802 x [10.sup.-3] -- 0.125 2.560 x [10.sup.-3] 1.94 0.0625 7.709 x [10.sup.-4] 1.73 0.03125 2.370 x [10.sup.-4] 1.70 0.015625 5.560 x [10.sup.-5] 2.09 0.0078125 1.413 x [10.sup.-5] 1.98 0.00390625 3.618 x [10.sup.-6] 1.97 VIM Interpolated dx [[parallel] u - [u.sub.h] Order [parallel].sub.[infinity]] 0.25 6.044 x [10.sup.-1] -- 0.125 9.178 x [10.sup.-2] 2.72 0.0625 7.041 x [10.sup.-4] 7.03 0.03125 2.160 x [10.sup.-4] 1.70 0.015625 4.929 x [10.sup.-5] 2.13 0.0078125 1.293 x [10.sup.-5] 1.93 0.00390625 3.377 x [10.sup.-6] 1.94 TABLE 6: Comparison of the [L.sup.1] error in the solution for the Ghost-Fluid Method and the Voronoi Interface Method, for example, shown in Section 3.2. Ghost-Fluid Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.1] 0.25 6.446 x [10.sup.-2] -- 0.125 3.393 x [10.sup.-2] 0.93 0.0625 1.692 x [10.sup.-2] 1.00 0.03125 7.908 x [10.sup.-3] 1.10 0.015625 3.982 x [10.sup.-3] 0.99 0.0078125 2.155 x [10.sup.-3] 0.89 0.00390625 1.035 x [10.sup.-3] 1.06 Voronoi Interface Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.1] 0.25 2.291 x [10.sup.-3] -- 0.125 4.022 x [10.sup.-4] 2.51 0.0625 1.038 x [10.sup.-4] 1.95 0.03125 2.985 x [10.sup.-5] 1.80 0.015625 7.243 x [10.sup.-6] 2.04 0.0078125 1.790 x [10.sup.-6] 2.02 0.00390625 4.509 x [10.sup.-7] 1.99 VIM Interpolated dx [[parallel] u - [u.sub.h] Order [parallel].sub.1] 0.25 4.557 x [10.sup.-2] -- 0.125 2.041 x [10.sup.-3] 4.48 0.0625 9.891 x [10.sup.-5] 4.37 0.03125 2.718 x [10.sup.-5] 1.86 0.015625 6.729 x [10.sup.-6] 2.01 0.0078125 1.717 x [10.sup.-6] 1.97 0.00390625 4.401 x [10.sup.-7] 1.96 TABLE 7: Comparison of the [L.sup.[infinity]] error in the gradient of the solution for the Ghost-Fluid Method and the Voronoi Interface Method, for example, shown in Section 3.2. Ghost-Fluid Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.[infinity]] 0.25 1.259 -- 0.125 1.227 0.04 0.0625 1.139 0.11 0.03125 1.156 -0.02 0.015625 1.188 -0.04 0.0078125 1.205 -0.02 0.00390625 1.214 -0.01 Voronoi Interface Method dx [[parallel] u - [u.sub.h] Order [parallel].sub.[infinity]] 0.25 1.309 x [10.sup.-2] -- 0.125 9.931 x [10.sup.-3] 0.55 0.0625 2.954 x [10.sup.-3] 1.60 0.03125 1.589 x [10.sup.-3] 0.89 0.015625 1.038 x [10.sup.-3] 0.62 0.0078125 5.177 x [10.sup.-4] 1.00 0.00390625 3.194 x [10.sup.-4] 0.70 VIM Interpolated dx [[parallel] u - [u.sub.h] Order [parallel].sub.[infinity]] 0.25 2.658 x [10.sup.-0] -- 0.125 6.334 x [10.sup.-1] 2.07 0.0625 8.950 x [10.sup.-2] 2.82 0.03125 4.373 x [10.sup.-2] 1.03 0.015625 2.155 x [10.sup.-2] 1.02 0.0078125 1.070 x [10.sup.-2] 1.01 0.00390625 5.329 x [10.sup.-3] 1.01 TABLE 8: Comparison of the [L.sup.1] error in the gradient of the solution for the Ghost-Fluid Method and the Voronoi Interface Method, for example, shown in Section 3.2. Ghost-Fluid Method dx [[parallel] [nabla] u - [nabla] Order [u.sub.h] [parallel].sub.1] 0.25 2.611 x [10.sup.-1] -- 0.125 1.438 x [10.sup.-1] 0.86 0.0625 7.136 x [10.sup.-2] 1.01 0.03125 3.922 x [10.sup.-2] 0.86 0.015625 2.019 x [10.sup.-2] 0.96 0.0078125 1.033 x [10.sup.-2] 0.97 0.00390625 5.222 x [10.sup.-3] 0.98 Voronoi Interface Method dx [[parallel] [nabla] u - [nabla] Order [u.sub.h] [parallel].sub.1] 0.25 2.126 x [10.sup.-3] -- 0.125 6.395 x [10.sup.-4] 1.73 0.0625 1.957 x [10.sup.-4] 1.71 0.03125 6.409 x [10.sup.-5] 1.61 0.015625 1.593 x [10.sup.-5] 2.01 0.0078125 4.132 x [10.sup.-6] 1.95 0.00390625 1.099 x [10.sup.-6] 1.91 VIM Interpolated dx [[parallel] [nabla] u - [nabla] Order [u.sub.h] [parallel].sub.1] 0.25 3.895 x [10.sup.-1] -- 0.125 3.400 x [10.sup.-2] 3.52 0.0625 5.631 x [10.sup.-3] 2.59 0.03125 1.464 x [10.sup.-3] 1.94 0.015625 3.713 x [10.sup.-4] 1.98 0.0078125 9.359 x [10.sup.-5] 1.99 0.00390625 2.358 x [10.sup.-5] 1.99

Printer friendly Cite/link Email Feedback | |

Title Annotation: | Research Article; Ghost-Fluid Method, Voronoi Interface Method |
---|---|

Author: | Helgadottir, Asdis; Gibou, Arthur Guitteand Frederic |

Publication: | International Journal of Differential Equations |

Article Type: | Report |

Date: | Jan 1, 2018 |

Words: | 6748 |

Previous Article: | Application of Optimal Homotopy Asymptotic Method to Some Well-Known Linear and Nonlinear Two-Point Boundary Value Problems. |

Next Article: | Well-Posedness and Numerical Study for Solutions of a Parabolic Equation with Variable-Exponent Nonlinearities. |

Topics: |