An official website of the United States government
Abstract We establish several useful estimates for a non-conforming 2-norm posed on piecewise linear surface triangulations with boundary, with the main result being a Poincaré inequality.We also obtain equivalence of the non-conforming 2-norm posed on the true surface with the norm posed on a piecewise linear approximation.Moreover, we allow for free boundary conditions.The true surface is assumed to be C 2 , 1 C^{2,1} when free conditions are present; otherwise, C 2 C^{2} is sufficient.The framework uses tools from differential geometry and the closest point map (see [G. Dziuk, Finite elements for the Beltrami operator on arbitrary surfaces, Partial Differential Equations and Calculus of Variations , Lecture Notes in Math. 1357, Springer, Berlin (1988), 142–155]) for approximating the full surface Hessian operator.We also present a novel way of applying the closest point map when dealing with surfaces with boundary.Connections with surface finite element methods for fourth-order problems are also noted.
more »
« less
The Kirchhoff plate equation on surfaces: the surface Hellan–Herrmann–Johnson method
Abstract We present a mixed finite element method for approximating a fourth-order elliptic partial differential equation (PDE), the Kirchhoff plate equation, on a surface embedded in $${\mathbb {R}}^{3}$$, with or without boundary. Error estimates are given in mesh-dependent norms that account for the surface approximation and the approximation of the surface PDE. The method is built on the classic Hellan–Herrmann–Johnson method (for flat domains), and convergence is established for $$C^{k+1}$$ surfaces, with degree $$k$$ (Lagrangian, parametrically curved) approximation of the surface, for any $$k \geqslant 1$$. Mixed boundary conditions are allowed, including clamped, simply-supported and free conditions; if free conditions are present then the surface must be at least $$C^{2,1}$$. The framework uses tools from differential geometry and is directly related to the seminal work of Dziuk, G. (1988) Finite elements for the Beltrami operator on arbitrary surfaces. Partial Differential Equations and Calculus of Variations, vol. 1357 (S. Hildebrandt & R. Leis eds). Berlin, Heidelberg: Springer, pp. 142–155. for approximating the Laplace–Beltrami equation. The analysis here is the first to handle the full surface Hessian operator directly. Numerical examples are given on nontrivial surfaces that demonstrate our convergence estimates. In addition, we show how the surface biharmonic equation can be solved with this method.
more »
« less
- Award ID(s):
- 2111474
- PAR ID:
- 10343187
- Date Published:
- Journal Name:
- IMA Journal of Numerical Analysis
- ISSN:
- 0272-4979
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We present a finite element technique for approximating the surface Hessian of a discrete scalar function on triangulated surfaces embedded in $$\R^{3}$$, with or without boundary. We then extend the method to compute approximations of the full shape operator of the underlying surface using only the known discrete surface. The method is based on the Hellan--Herrmann--Johnson (HHJ) element and does not require any ad-hoc modifications. Convergence is established provided the discrete surface satisfies a Lagrange interpolation property related to the exact surface. The convergence rate, in $L^2$, for the shape operator approximation is $O(h^m)$, where $$m \geq 1$$ is the polynomial degree of the surface, i.e. the method converges even for piecewise linear surface triangulations. For surfaces with boundary, some additional boundary data is needed to establish optimal convergence, e.g. boundary information about the surface normal vector or the curvature in the co-normal direction. Numerical examples are given on non-trivial surfaces that demonstrate our error estimates and the efficacy of the method.more » « less
-
We propose and analyze a two-scale finite element method for the Isaacs equation. The fine scale is given by the mesh size h whereas the coarse scale ε is dictated by an integro-differential approximation of the partial differential equation. We show that the method satisfies the discrete maximum principle provided that the mesh is weakly acute. This, in conjunction with weak operator consistency of the finite element method, allows us to establish convergence of the numerical solution to the viscosity solution as ε , h → 0, and ε ≳ ( h |log h |) 1/2 . In addition, using a discrete Alexandrov Bakelman Pucci estimate we deduce rates of convergence, under suitable smoothness assumptions on the exact solution.more » « less
-
We introduce a Monte Carlo method for computing derivatives of the solution to a partial differential equation (PDE) with respect to problem parameters (such as domain geometry or boundary conditions). Derivatives can be evaluated at arbitrary points, without performing a global solve or constructing a volumetric grid or mesh. The method is hence well suited to inverse problems with complex geometry, such as PDE-constrained shape optimization. Like other walk on spheres (WoS) algorithms, our method is trivial to parallelize, and is agnostic to boundary representation (meshes, splines, implicit surfaces, etc.), supporting large topological changes. We focus in particular on screened Poisson equations, which model diverse problems from scientific and geometric computing. As in differentiable rendering, we jointly estimate derivatives with respect to all parameters—hence, cost does not grow significantly with parameter count. In practice, even noisy derivative estimates exhibit fast, stable convergence for stochastic gradient-based optimization, as we show through examples from thermal design, shape from diffusion, and computer graphics.more » « less
-
We introduce a Monte Carlo method for computing derivatives of the solution to a partial differential equation (PDE) with respect to problem parameters (such as domain geometry or boundary conditions). Derivatives can be evaluated at arbitrary points, without performing a global solve or constructing a volumetric grid or mesh. The method is hence well suited to inverse problems with complex geometry, such as PDE-constrained shape optimization. Like otherwalk on spheres (WoS)algorithms, our method is trivial to parallelize, and is agnostic to boundary representation (meshes, splines, implicit surfaces,etc.), supporting large topological changes. We focus in particular on screened Poisson equations, which model diverse problems from scientific and geometric computing. As in differentiable rendering, we jointly estimate derivatives with respect to all parameters---hence, cost does not grow significantly with parameter count. In practice, even noisy derivative estimates exhibit fast, stable convergence for stochastic gradient-based optimization, as we show through examples from thermal design, shape from diffusion, and computer graphics.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1093/imanum/drab062
