Meshfree method for solving the elliptic Monge-Ampre
equation with Dirichlet boundary**footnotemark: *
Abstract
We prove the convergence of meshfree method for solving the elliptic Monge-Ampre equation with Dirichlet boundary on the bounded domain. error is obtained based on the kernel-based trial spaces generated by the compactly supported radial basis functions. We obtain the convergence result when the testing discretization is finer than the trial discretization. The convergence rate depend on the regularity of the solution, the smoothness of the computing domain, and the approximation of scaled kernel-based spaces. The presented convergence theory covers a wide range of kernel-based trial spaces including stationary approximation and non-stationary approximation. An extension to non-Dirichlet boundary condition is in a forthcoming paper.
keywords:
Monge-Ampre equation; Meshfree method; Radial basis functions; Convergence rate1 Introduction
We consider the meshfree method for numerically solving the Monge-Ampre equation with Dirichlet boundary condition:
(1.1) | |||||
(1.2) |
here is a strictly convex polygonal domain with a smooth boundary , is a strictly positive function, and is the determinant of the Hessian matrix . This equation is usually augmented by the convexity constraint of , which implies that the equation is elliptic. The numerical solution of Monge-Ampre equation is an very active topic of research. Many researchers developed kinds of numerical methods and analyzed their convergence, such as the finite difference methods [1, 2], finite element methods [3, 4], and spline methods [5]. In order to design a certain type of numerical method which can avoid the tedious mesh generation and the domain integration and can be capable of dealing with any irregular distribution of nodes, some meshfree methods based radial basis functions have been researched, which is started from 2013 in the paper [6]. And from then on, a series of meshfree methods have been proposed for solving the elliptic Monge-Ampre equation [7, 8, 9, 10]. Unfortunately, the convergence theory of meshfree method has not been proven yet. The present paper will prove the convergence of meshfree method for the Monge-Ampre equation. To simplify the proof, we only consider the case of taking :
(1.3) | |||||
(1.4) |
We will rely the Bhmer/Schaback’s nonlinear discretization theory [11, 12] and the ideas of the latest paper [13], which discussed the convergence of unsymmetric radial basis functions method for second order quasilinear elliptic equations.
The paper is organized as follows. Section 2 is devoted to some notation and an introduction of kernel-based trial spaces generated by compactly supported radial basis functions. Section 3 introduces the well-posed theory of the Monge-Ampre equation and its meshfree discretization. Section 4 is the theoretical analysis of convergence.
2 Radial basis functions trial spaces
A translation-invariant kernel such as the strictly positive definite radial function will generate a reproducing kernel Hilbert space, the so-called native space . But we will make use of the native space which defined in and described by Fourier transform. consists of all functions with
(2.1) |
Hence, if the Fourier transform of has the algebraic decay condition
(2.2) |
for two fixed constants , then the native space will be norm equivalent to the Sobolev space . Thus, with a radial function satisfied (2.2) and a scaling parameter we can construct a scaled radial function
(2.3) |
Thus we can consider the finite dimensional kernel-based trial space generated by . Let and be some data sites which are arranged on the domain and its boundary respectively. Then the whole of centers are , which can used to construct a trial space and determine its degrees of freedom. We denote as the unit ball in defined by using a number of diffeomorphisms and are open sets such that . Some measures are defined as follows:
Using the scaled radial function as basis functions, then the radial basis functions trial space is
(2.4) |
In the later theoretical analysis, we need two important auxiliary results: inverse inequality and sampling inequality. The following inverse inequality has been proved for RBF approximation in the reference [13] on the bounded domains.
Lemma 2.1.
(inverse inequality) Let be a bounded domain satisfying an interior cone condtion. Let be quasi-uniform in the sense that . For all dependent functions of the form there exists a constant such that
(2.5) |
Lemma 2.2.
(sampling inequality) Suppose is a bounded domain with an interior cone condition. Let and constants . Then there are positive constant , such that
(2.6) |
holds for every discrete set with fill distance at most and every . Here is the function evaluation operator at the data sites .
3 Meshfree discretization
3.1 Well-posedness
There are several theories which describe the regularity and the well-posedness of the Monge-Ampre equation [16, 17, 18], for example the existence theorem from [18]:
Theorem 3.1.
In the later discussion, we always assume that the conditions of Theorem 3.1 are satisfied. And we assume that the solution of the equations (1.3)-(1.4) has the higher regularity with such that . Of course, according to Sobolev inequality from section 5.6.3 of [19]. In addition, is Frchet differentiable in , and
(3.1) |
Obviously, the convex property of implies that the linear operator is uniformly elliptic. Thus, we can obtain a prior bounds of the fully nonlinear problem (1.3)-(1.4) by utilizing the prior estimate of the linear elliptic problem
(3.2) | |||||
(3.3) |
here .
Theorem 3.2.
Proof.
The inequality (3.4) is obvious because can be bounded by
With the help of the priori inequality of linear elliptic problems (for example Corollary 8.7 of [20],), we have
Then by using Taylor formula and Lipschitz continuity of , we have
This yields the result (3.6). In addition,
Setting yields (3.7). ∎
3.2 Collocation
We are now consider the meshfree collocation for the Monge-Ampre equation (1.3)-(1.4). Denote and , we use a set with and as collocation points, and use
to represent the fill distance of the data sites and respectively. Obviously, they have the parallel definitions with and on trial side. Hence choose . Then we can construct a approximate function with the form
which satisfies
(3.8) | ||||
(3.9) |
(3.8)-(3.9) is a meshfree discretization of the equation (1.3)-(1.4), but with a nonsquare nonlinear systems. Let and be the function evaluation operators at the data sites and respectively, then the nonlinear systems (3.8)-(3.9) can also be rewritten as
(3.10) | ||||
(3.11) |
Because the nonlinear systems (3.10)-(3.11) is overdetermined, thus we only require that one of the nonlinear numerical methods is clever enough to produce a with the given tolerance
(3.12) |
This can be done by residual minimization
(3.13) |
4 Convergence analysis
The following theorem is our main theoretical result which proves the convergence rate of meshfree method for the Monge-Ampre equation (1.3)-(1.4).
Theorem 4.1.
Let be a uniformly convex domain has a boundary with . In the equation (1.3)-(1.4), let be strictly positive and . We denote the unique solution of (1.3)-(1.4) as , . Assume the radius of the ball to be small enough to satisfy (3.5). Let be quasi-uniform in the sense that . Let the collocation sites also be quasi-uniform. Let and be the fill distance of the data sites and respectively, and . Suppose is the collocation solution of (3.8)-(3.9) obtained by choosing
(4.1) |
If the testing discretizations is finer than the trial discretization and satisfies condition
(4.2) |
then there exists a constant such that
Proof.
We want to bound the error between the solution and its approximation . We can use the radial basis functions interpolant as a transition. The interpolant is a map defined by
for the unknown coefficients are determined by solving the above linear system. Then the error between the solution and its approximation can be split into
The first term on the right-hand side is the radial basis functions interpolation error, which can be easily obtained by using the sampling inequality (Lemma 2.2) and the stability of (Lemma 5.1 of [13]), namely
(4.3) |
Hence, our main task in this proof is to bound the second term on the right-hand side.
Choosing and squaring both sides of (3.6), we have
Then we can bound the two terms on the right-hand side separately. For the first term, using Lemma 2.2, the inequality (3.7), Lemma 2.1, and the stability of radial basis functions interpolation (Lemma 5.1 of [13]) yields
For the boundary term, we denote . From Lemma 2.2, the trace theorem (Theorem 8.7 of [21]), the Sobolev imbedding theorems (Theorem 4.12 of [22]), the quasi-uniform property of , and the quasi-uniform property of ,we can bound
By using the condition (4.2), combining both above results with the interpolation error (4.3) and setting , we obtain the convergence rate. ∎
5 Conclusions
Although the meshfree method has been used for solving the Monge-Ampre equation for a long time, we proved the convergence of this method until now in this paper. The theoretical convergence was established by using the regularity theory of the solution, the inverse inequality, the sampling inequality, and the approximation property of the radial basis functions trial spaces. However, the convergence rate is currently not yet optimal and deserve refinement.
References
References
- [1] A.M. Oberman, Wide stencil finite difference schemes for the elliptic Monge-Ampre equations and functions of the eigenvalues of the Hessian, Dyn. Syst. Ser. B, 2008, (10)1: 221–238.
- [2] J.-D. Benamou, B.D. Froese, and A.M. Oberman, Two numerical methods for the elliptic Monge-Ampre equation, ESAIM: Mathematical Modelling and Numerical Analysis, 2010, 44(4): 737–758.
- [3] X. Feng, and M. Neilan, Mixed finite element methods for the fully nonlinear Monge-Ampre equation based on the vanishing moment method, SIAM J. Numer. Anal., 2009, 47: 1226–1250.
- [4] S.C. Brenner, T. Gudi, M. Neilan, and L.Y. Sung, penalty methods for the fully nonlinear Monge-Ampre equation, Math. Comput., 2011, 80: 1979–1995.
- [5] M.J. Lai, and J. Lee, Trivariate spline collocation methods for numerical solution to 3D Monge-Ampre equation, J. Sci. Comput., 2023, 95:56.
- [6] Z. Liu, and Y. He, Solving the elliptic Monge-Ampre equation by Kansa’s method, Eng. Anal. Bound. Elem., 2013, 37: 84–88.
- [7] Z. Liu, and Y. He, Cascadic meshfree method for the elliptic Monge-Ampre equation, Eng. Anal. Bound. Elem., 2013, 37(7): 990–996.
- [8] Z. Liu, and Y. He, An iterative meshfree method for the elliptic Monge-Ampre equation in 2D, Numer. Methods Partial Differential Equations, 2014, 30(5): 1507–1517.
- [9] K. Bhmer, and R. Schaback, A meshfree method for solving the Monge-Ampre equation, Numer. Algorithm, 2019, 82: 539–551.
- [10] Z. Liu, and Q. Xu, On multiscale RBF collocation methods for solving the Monge-Ampre equation, Mathematical Problems in Engineering, 2020: 1748037.
- [11] K. Bhmer, Numerical Methods for Nonlinear Elliptic Differential Equations: A Synopsis, Oxford University Press, New York, USA, 2010.
- [12] K. Bhmer, and R. Schaback, A nonlinear discretization theory, J. Comput. Appl. Math., 2013, 254: 204–219.
- [13] Z. Liu, and Q. Xu, error estimates of unsymmetric RBF collocation for second order quasilinear elliptic equations, Commun. Nonlinear Sci. Numer. Simulat., 2023, 127:107563.
- [14] F.J. Narcowich, J.D. Ward, and H. Wendland, Sobolev error estimates and a Bernstein inequality for scattered data interpolation via radial basis functions, Constr. Approx., 2006, 24: 175–186.
- [15] C. Rieger, R. Schaback, and B. Zwicknagl, Sampling and stability, Mathematical Methods for Curves and Surfaces, Lecture Notes in Computer Science, Springer, New York, 2010, 5862: 347–369.
- [16] L.A. Caffarelli, L. Nirenberg, and J. Spruck, The Dirichlet problem for nonlinear second order elliptic equations I. Monge-Ampre equation. Commun. Pure Appl. Math., 1984, 37: 369–402.
- [17] X.-J. Wang, Regularity for Monge-Ampre equation near the boundary, Analysis, 1996, 16: 101-107.
- [18] A. Figalli, The Monge-Ampre equation and its applications, European Mathematical Society, 2017.
- [19] L.C. Evans, Partial Differential Equations, 2nd ed., American Mathematical Society, Providence, RI, 2010.
- [20] D. Gilbarg, D., and N.S. Trudinger, Elliptic Partial Differential Equations of Second Order, Grundlehren Math. Wiss. 224, Springer, Berlin, 2001.
- [21] J. Wloka, Partial Differential Equations, Cambridge University Press, Cambridge, UK, 1987.
- [22] R.A. Adams, and P. Fournier, Sobolev Spaces, Pure and Applied Mathematics, 2nd ed.; Academic Press: New York, NY, USA, 2003.