High-order finite element methods for moving boundary problems with prescribed boundary evolution
Introduction
Science and engineering are replete with instances of moving boundary problems: partial differential equations posed on domains that change with time. Problems of this type, which arise in areas as diverse as fluid–structure interaction, multiphase flow physics, and fracture mechanics, are inherently challenging to solve numerically.
Broadly speaking, computational methods for moving boundary problems generally adhere to one of two paradigms. Deforming-mesh methods employ a computational mesh that deforms in concert with the moving domain, whereas fixed-mesh methods employ a stationary background mesh in which the domain is immersed. While the former approach can require that efforts be made to avoid distortions of the mesh under large deformations [1], the latter approach requires that special care be taken in order to account for any discrepancy between the exact boundary and element interfaces [2], [3]. Figs. 1–2 illustrate these two paradigms schematically.
In this study, we eliminate these difficulties by employing a universal mesh: a stationary background mesh that adapts to the geometry of the immersed domain by adjusting a small number of mesh elements in the neighborhood of the moving boundary. An example is illustrated in Fig. 3. The resulting framework admits, in a general fashion, the construction of methods that are of arbitrarily high order of accuracy in space and time, without exhibiting the aforementioned drawbacks of deforming-mesh and fixed-mesh methods. This strategy was introduced for time-independent and quasi-steady problems in [4], [5]. Here we present its extension to time-dependent problems posed on moving domains with prescribed evolution. We relegate a discussion of problems with unprescribed boundaries to future work, since the treatment of unprescribed boundaries introduces its own set of challenges–approximation of the boundary, discretization of the boundary evolution equations, and error analysis on approximate domains–that may have the undesired effect of blurring the focus of the present study.
In the process of deriving our method, we present a unified, geometric framework that puts our method and existing deforming-mesh methods on a common footing suitable for analysis. The main idea is to recast the governing equations on a sequence of cylindrical spacetime slabs that span short intervals of time. The clarity brought about by this geometric viewpoint renders the analysis of numerical methods for moving-boundary problems more tractable, as it reduces the task to a standard analysis of fixed-domain problems with time-dependent PDE coefficients.
Organization. This paper is organized as follows. We begin in Section 2 by giving an informal overview of our method, and illustrating the ideas by formulating the method for a moving boundary problem in one spatial dimension. We formulate a two-dimensional model moving boundary problem on a predefined, curved spacetime domain in Section 3, and proceed to derive its equivalent reformulation on cylindrical spacetime slabs. In Section 4 we present, in an abstract manner, the general form of a finite-element discretization of the same moving boundary problem, as well as its reformulation on cylindrical spacetime slabs. This formalism will lead to a statement of the general form of a numerical method for moving boundary problems with prescribed boundary evolution that includes our method and conventional deforming-mesh methods as special cases. We finish Section 4 by summarizing an error estimate for methods of this form, referring the reader to our companion paper [6] for its proof. In Section 5, we present the key ingredient that distinguishes our proposed method from standard approaches: the use of a universal mesh. We specialize the aforementioned error estimate to this setting to deduce that the method’s convergence rate is suboptimal by half an order when the time step and mesh spacing scale proportionately. In Section 6 we demonstrate numerically our method’s convergence rate on a prescribed-boundary variant of a classic moving-boundary problem called the Stefan problem, which asks for the evolution of a solid–liquid interface during a melting process. Some concluding remarks are given in Section 7.
Previous work. In what follows, we review some of the existing numerical methods for moving-boundary problems, beginning with deforming-mesh methods and finishing with fixed-mesh methods.
Deforming-mesh methods have enjoyed widespread success in the scientific and engineering communities, where they are best known as Arbitrary Lagrangian–Eulerian (ALE) methods. The appellation refers to the fact that in prescribing a motion of the mesh, a kinematic description of the physics is introduced that is neither Eulerian (in which the domain moves over a fixed mesh) nor Lagrangian (in which the domain does not move with respect to the mesh). The resulting formalism leads to governing equations that contain a term involving the velocity of the prescribed mesh motion that is otherwise absent in schemes on a fixed mesh [7], [8]. Early appearances of the ALE framework date back to the works of Hirt et al. [9], Hughes et al. [10], and Donea et al. [11]. ALE methods have seen use in fluid–structure interaction [12], [13], [14], [15], [16], [17], solid mechanics [18], [19], [20], [21], thermodynamics [22], [23], [24], [25], and other applications.
Relative to methods for problems with fixed domains, less attention has been directed towards the development of ALE methods of high order of accuracy and the associated error analysis. Schemes of second-order in time are well-studied [15], [16], [13], [26], [27], [28], [29], [30], though the analysis of higher-order schemes has only recently been addressed by Bonito and co-authors [31], [32], who study the spatially continuous setting with discontinuous Galerkin temporal discretizations.
One of the key challenges that ALE methods face is the maintenance of a good-quality mesh during large deformations of the domain [33], [34]. Fig. 1 illustrates a case where, using an intentionally naive choice of nodal motions, a domain deformation can lead to triangles with poor aspect ratios. In more severe cases, element inversions can occur. Such distortions are detrimental both to the accuracy of the spatial discretization and to the conditioning of the discrete governing equations [35]. For this reason, it is common to use sophisticated mesh motion strategies that involve solving systems of equations (such as those of linear elasticity) for the positions of mesh nodes [36], [37], [38], [39].
A related class of methods are spacetime methods (e.g., [40]), where the spacetime domain swept out by the moving spatial domain is discretized with straight or curved elements. These methods resemble deforming-mesh methods in the sense that spatial slices of the spacetime mesh at fixed temporal nodes constitute a mesh of the moving domain at those times. Bonnerot and Jamet [41], [42] have used a spacetime framework to construct high-order methods for the Stefan problem in one dimension. They require the use of curved elements along the moving boundary to achieve the desired temporal accuracy. Jamet [43] provides a generalization of these high-order methods to dimensions greater than one in the case that the boundary evolution is prescribed in advance. More recently, Rhebergen and Cockburn [44], [45] created hybridizable-discontinuous-Galerkin-based spacetime methods for advection–diffusion and incompressible flow problems with moving domains.
At the other extreme are fixed-mesh methods, which cover a sufficiently large domain with a mesh and evolve a numerical representation of the boundary, holding the background mesh fixed [46], [47], [48], [49]. A variety of techniques can be used to represent the boundary, including level sets [50], [2], marker particles [51], and splines [52]. Fixed mesh methods require that special care be taken in constructing the numerical partial differential operators in the neighborhood of the moving boundary, so as to avoid losses in accuracy arising from the disagreement between the moving boundary and element interfaces. Some authors [53], [54] propose adaptively refining the mesh in the neighborhood of the moving boundary to mitigate these losses. In the special case of a cartesian mesh, Gibou and Fedkiw [2] have developed a third-order method for the Stefan problem in two dimensions using extrapolation to allow finite-difference stencils to extend beyond the moving boundary.
The method presented in this paper classifies neither as a deforming-mesh method nor as a fixed-mesh method, though it shares attractive features from both categories. It exhibits the immunity to large mesh distortions enjoyed by fixed-mesh methods without sacrificing the geometric conformity offered by deforming-mesh methods. Despite its conceptual simplicity, the method has not been proposed in the literature. An idea similar to ours, dubbed a “fixed-mesh ALE” method, has recently been proposed by Baiges and Codina [55], [56], though there are several important differences. In particular, their method uses element splitting to define intermediate meshes during temporal integration, whereas our method leaves the connectivity of the mesh intact. Second, they advocate imposing boundary conditions approximately to improve efficiency; our method imposes boundary conditions exactly without extra computational effort. Finally, they focus only on low-order schemes with piecewise linear approximations to the domain deformation, while we derive schemes of arbitrarily high order.
Section snippets
Overview of the method
There are three main difficulties to overcome in constructing high-order methods for problems with moving domains: (a) since the domain is changing in time, approximations of the domain of the appropriate order need to be constructed at all times at which the time-integration scheme is evaluated, (b) the approximation space over the evolving domain generally needs to evolve in time as well, resulting in a changing set of degrees of freedom, and (c) the approximation of time-derivatives of the
The continuous problem
Consider a moving boundary problem on a bounded spacetime domain , as in Fig. 6. For each , denote by the spatial component of the spacetime slice , and denote by the boundary of . Finally, let denote the lateral boundary of the spacetime domain . We assume that is open in for each . As a regularity requirement, we assume that for every , the set can be expressed as the image of an embedding of the unit circle
Spatial discretization on short time intervals
At this point it is instructive to derive, in a systematic manner, the general form of a finite element spatial discretization of (5) obtained via Galerkin projection. We begin by spatially discretizing the weak formulation (6) and proceed by pulling the semidiscrete equations back to a cylindrical spacetime domain, and by obtaining the “hybrid” Eulerian formulation of the same semidiscrete equations. The utility of these three formulations will be evident towards the end of this section.
Universal meshes
The algorithm presented in the preceding section requires at each temporal node the selection of a family of maps , , from a fixed polygonal domain to the moving domain . Here we present a means of constructing such maps using a single, universal mesh that triangulates an ambient domain containing the domains for all times . Full details of the method are described in [5].
The essence of the method is to triangulate with a fixed
Numerical examples
In this section, we apply the proposed method to a modification of a classical moving-boundary problem: Stefan’s problem. In our modification, the evolution of the boundary is imposed through the exact solution, instead of being computed. Our aim in this example is to illustrate the convergence rate of the method with respect to the mesh spacing and time step .
We begin by demonstrating, using a one-dimensional numerical test, that the bound (38) is sharp. That is, the order of accuracy of
Conclusion
We have presented a general framework for the design of high-order finite element methods for moving boundary problems with prescribed boundary evolution. A key role in our approach was played by universal meshes, which combine the immunity to large mesh distortions enjoyed by conventional fixed-mesh methods with the geometric fidelity of deforming-mesh methods. A given accuracy in space and time may be achieved by choosing an appropriate finite element space on the universal mesh and an
Acknowledgments
This research was supported by the U.S. Department of Energy grant DE-FG02-97ER25308; Department of the Army Research Grant, grant number: W911NF-07-2-0027; and NSF Career Award, grant number: CMMI-0747089.
References (63)
- et al.
A fourth order accurate discretization for the Laplace and heat equations on arbitrary domains, with applications to the Stefan problem
J. Comput. Phys.
(2005) Unified approach to simulation on deforming elements with application to phase change problems
J. Comput. Phys.
(1982)- et al.
An arbitrary Lagrangian–Eulerian computing method for all flow speeds
J. Comput. Phys.
(1974) - et al.
Lagrangian–Eulerian finite element formulation for incompressible viscous flows
Comput. Methods Appl. Mech. Engrg.
(1981) - et al.
An arbitrary Lagrangian–Eulerian finite element method for transient dynamic fluid–structure interactions
Comput. Methods Appl. Mech. Engrg.
(1982) - et al.
ALE formulation for fluid–structure interaction problems
Comput. Methods Appl. Mech. Engrg.
(2000) - et al.
Design and analysis of ALE schemes with provable second-order time-accuracy for inviscid and viscous flow simulations
J. Comput. Phys.
(2003) - et al.
Design and analysis of robust ALE time-integrators for the solution of unsteady flow problems on moving grids
Comput. Methods Appl. Mech. Engrg.
(2004) - et al.
Provably second-order time-accurate loosely-coupled solution algorithms for transient nonlinear computational aeroelasticity
Comput. Methods Appl. Mech. Engrg.
(2006) ALE finite element computations of fluid–structure interaction problems
Comput. Methods Appl. Mech. Engrg.
(1994)
Formulation and survey of ALE method in nonlinear solid mechanics
Finite Elem. Anal. Des.
An ALE formulation based on spatial and material settings of continuum mechanics. Part 2: classification and applications
Comput. Methods Appl. Mech. Engrg.
An extended arbitrary Lagrangian–Eulerian finite element method for large deformation of solid mechanics
Finite Elem. Anal. Des
Finite element simulation of planar instabilities during solidification of an undercooled melt
J. Comput. Phys.
A moving mesh finite element method for the solution of two-dimensional Stefan problems
J. Comput. Phys.
Stability and geometric conservation laws for ALE formulations
Comput. Methods Appl. Mech. Engrg.
Stability analysis of second-order time accurate schemes for ALE–FEM
Comput. Methods Appl. Mech. Engrg.
Torsional springs for two-dimensional dynamic unstructured fluid meshes
Comput. Methods Appl. Mech. Engrg.
Mesh update strategies in parallel finite element computations of flow problems with moving boundaries and interfaces
Comput. Methods Appl. Mech. Engrg.
A third order accurate discontinuous finite element method for the one-dimensional Stefan problem
J. Comput. Phys.
A space–time hybridizable discontinuous galerkin method for incompressible flows on deforming domains
J. Comput. Phys.
Combined immersed-boundary finite-difference methods for three-dimensional complex flow simulations
J. Comput. Phys.
A sharp interface cartesian grid method for simulating flows with complex moving boundaries
J. Comput. Phys.
Front-tracking finite element method for dendritic solidification
J. Comput. Phys.
An immersed interface method for simulating the interaction of a fluid with moving boundaries
J. Comput. Phys.
An adaptive remeshing strategy for flows with moving boundaries and fluid–structure interaction
Int. J. Numer. Methods Eng.
Parameterization of planar curves immersed in triangulations with application to finite elements
Int. J. Numer. Methods Eng.
Universal meshes: a method for triangulating planar curved domains immersed in nonconforming triangulations
Int. J. Numer. Methods Eng.
Approximation of the heat equation in a variable domain with application to the Stefan problem
SIAM J. Numer. Anal.
Cited by (22)
New aspects of the CISAMR algorithm for meshing domain geometries with sharp edges and corners
2023, Computer Methods in Applied Mechanics and EngineeringCoupling finite element method with meshless finite difference method by means of approximation constraints
2023, Computers and Mathematics with ApplicationsParabolic problem for moving/evolving body with perfect contact to neighborhood
2021, Journal of Computational and Applied MathematicsCitation Excerpt :To obtain the optimal order of convergence the authors used space–time test- and trial-functions, that are aligned with the moving interface. The authors of [11] studied time-dependent problems posed on moving domains with prescribed evolution. They constructed high-order methods for problems with moving domains using pull-back mapping to a reference domain.
Moving meshes in complex configurations using the composite sliding grid method
2020, Computers and FluidsA non-iterative local remeshing approach for simulating moving boundary transient diffusion problems
2018, Finite Elements in Analysis and DesignCitation Excerpt :Similar to the ALE method, iterative nodal repositioning, edge/face swap, and mesh optimization techniques have been used in such methods to avoid the creation of tangling elements and improve their aspect ratios [39–41]. Recently, Gawlik and Lew [42] have introduced a robust technique for modeling 2D moving boundary problems that employs an iterative relaxation algorithm to adapt a stationary background mesh (universal mesh) to the evolving interface geometry [43,44]. To obviate the challenges associated with the remeshing process, one can implement meshfree techniques such as the smoothed particle hydrodynamics [45,46], element-free Galerkin method [47,48], exponential basis functions meshfree technique [49,50], and the Green's discrete transformation method [51].