Simplex space-time meshes in thermally coupled two-phase flow simulations of mold filling

The quality of plastic parts produced through injection molding depends on many factors. Especially during the filling stage, defects such as weld lines, burrs, or insufficient filling can occur. Numerical methods need to be employed to improve product quality by means of predicting and simulating the injection molding process. In the current work, a highly viscous incompressible non-isothermal two-phase flow is simulated, which takes place during the cavity filling. The injected melt exhibits a shear-thinning behavior, which is described by the Carreau-WLF model. Besides that, a novel discretization method is used in the context of 4D simplex space-time grids [2]. This method allows for local temporal refinement in the vicinity of, e.g., the evolving front of the melt [10]. Utilizing such an adaptive refinement can lead to locally improved numerical accuracy while maintaining the highest possible computational efficiency in the remaining of the domain. For demonstration purposes, a set of 2D and 3D benchmark cases, that involve the filling of various cavities with a distributor, are presented.Comment: 14 pages, 11 Figures, 4 Table

Space-Time Discretizations Using Constrained First-Order System Least Squares (CFOSLS)

This paper studies finite element discretizations for three types of time-dependent PDEs, namely heat equation, scalar conservation law and wave equation, which we reformulate as first order systems in a least-squares setting subject to a space-time conservation constraint (coming from the original PDE). Available piece- wise polynomial finite element spaces in (n + 1)-dimensions for functional spaces from the (n + 1)-dimensional de Rham sequence for n = 3, 4 are used for the implementation of the method. Computational results illustrating the error behavior, iteration counts and performance of block-diagonal and monolithic geometric multi- grid preconditioners are presented for the discrete CFOSLS system. The results are obtained from a parallel implementation of the methods for which we report reasonable scalability

Efficient Solvers for Space-Time Discontinuous Galerkin Spectral Element Methods

In this thesis we study efficient solvers for space-time discontinuous Galerkin spectral element methods (DG-SEM). These discretizations result in fully implicit schemes of variable order in both spatial and temporal directions. The popularity of space-time DG methods has increased in recent years and entropy stable space-time DG-SEM have been constructed for conservation laws, making them interesting for these applications. The size of the nonlinear system resulting from differential equations discretized with space-time DG-SEM is dependent on the order of the method, and the corresponding Jacobian is of block form with dense blocks. Thus, the problem arises to efficiently solve these huge nonlinear systems with regards to CPU time as well as memory consumption. The lack of good solvers for three-dimensional DG applications has been identified as one of the major obstacles before high order methods can be adapted for industrial applications.It has been proven that DG-SEM in time and Lobatto IIIC Runge-Kutta methods are equivalent, in that both methods lead to the same discrete solution. This allows to implement space-time DG-SEM in two ways: Either as a full space-time system or by decoupling the temporal elements and using implicit time-stepping with Lobatto IIIC methods. We compare theoretical properties and discuss practical aspects of the respective implementations.When considering the full space-time system, multigrid can be used as solver. We analyze this solver with the local Fourier analysis, which gives more insight into the efficiency of the space-time multigrid method. The other option is to decouple the temporal elements and use implicit Runge-Kutta time-stepping methods. We suggest to use Jacobian-free Newton-Krylov (JFNK) solvers since they are advantageous memory-wise. An efficient preconditioner for the Krylov sub-solver is needed to improve the convergence speed. However, we want to avoid constructing or storing the Jacobian, otherwise the favorable memory consumption of the JFNK approach would be obsolete. We present a preconditioner based on an auxiliary first order finite volume replacement operator. Based on the replacement operator we construct an agglomeration multigrid preconditioner with efficient smoothers using pseudo time integrators. Then only the Jacobian of the replacement operator needs to be constructed and the DG method is still Jacobian-free. Numerical experiments for hyperbolic test problems as the advection, advection-diffusion and Euler equations in several dimensions demonstrate the potential of the new approach

Solver algorithm for stabilized space-time formulation of advection-dominated diffusion problem

This article shows how to develop an efficient solver for a stabilized numerical space-time formulation of the advection-dominated diffusion transient equation. At the discrete space-time level, we approximate the solution by using higher-order continuous B-spline basis functions in its spatial and temporal dimensions. This problem is very difficult to solve numerically using the standard Galerkin finite element method due to artificial oscillations present when the advection term dominates the diffusion term. However, a first-order constraint least-square formulation allows us to obtain numerical solutions avoiding oscillations. The advantages of space-time formulations are the use of high-order methods and the feasibility of developing space-time mesh adaptive techniques on well-defined discrete problems. We develop a solver for a least-square formulation to obtain a stabilized and symmetric problem on finite element meshes. The computational cost of our solver is bounded by the cost of the inversion of the space-time mass and stiffness (with one value fixed at a point) matrices and the cost of the GMRES solver applied for the symmetric and positive definite problem. We illustrate our findings on an advection-dominated diffusion space-time model problem and present two numerical examples: one with isogeometric analysis discretizations and the second one with an adaptive space-time finite element method.Comment: 24 pages, 7 figures, 2 table

Mini-Workshop: Interface Problems in Computational Fluid Dynamics

Multiple difficulties are encountered when designing algorithms to simulate flows having free surfaces, embedded particles, or elastic containers. One difficulty common to all of these problems is that the associated interfaces are Lagrangian in character, while the fluid equations are naturally posed in the Eulerian frame. This workshop explores different approaches and algorithms developed to resolve these issues