An Equal-Order DG Method for the Incompressible Navier-Stokes Equations

We introduce and analyze a discontinuous Galerkin method for the incompressible Navier-Stokes equations that is based on finite element spaces of the same polynomial order for the approximation of the velocity and the pressure. Stability of this equal-order approach is ensured by a pressure stabilization term. A simple element-by-element post-processing procedure is used to provide globally divergence-free velocity approximations. For small data, we prove the existence and uniqueness of discrete solutions and carry out an error analysis of the method. A series of numerical results are presented that validate our theoretical findings.     

Two-Level Penalty Newton Iterative Method for the 2D/3D Stationary Incompressible Magnetohydrodynamics Equations

This work is concerned with the study of two-level penalty finite element method for the 2D/3D stationary incompressible magnetohydrodynamics equations. The new method is an interesting combination of the Newton iteration and two-level penalty finite element algorithm with two different finite element pairs \(P_{1}b\)-\(P_{1}\)-\(P_{1}b\) and \(P_{1}\)-\(P_{0}\)-\(P_{1}\). Moreover, the rigorous analysis of stability and error estimate for the proposed method are given. Numerical results verify the theoretical results and show the applicability and effectiveness of the presented scheme.     

A Dynamic Penalty or Projection Method for Incompressible Fluids

In a previous work (Angot et al. in J. Comput. Appl. Math. 226:228–245, 2009), some penalty–projection methods have been tested for the numerical analysis of the Navier-Stokes equations. The purpose of this study is to introduce a variant of the penalty–projection method which allows us to compute the solutions faster than by using the previous solver. This new variant combines dynamically and alternatively a penalty procedure and a projection procedure according to the size of the divergence of the velocity. In other words, this study aims to prove that it is possible to project the intermediate velocity, computed by the first step of the penalty–projection method, only if its divergence is larger than a specified threshold. Theoretical estimates for the new method are given, which are in accordance with the numerical results provided.     

A Boundary Condition Capturing Method for Multiphase Incompressible Flow

In [6], the Ghost Fluid Method (GFM) was developed to capture the boundary conditions at a contact discontinuity in the inviscid compressible Euler equations. In [11], related techniques were used to develop a boundary condition capturing approach for the variable coefficient Poisson equation on domains with an embedded interface. In this paper, these new numerical techniques are extended to treat multiphase incompressible flow including the effects of viscosity, surface tension and gravity. While the most notable finite difference techniques for multiphase incompressible flow involve numerical smearing of the equations near the interface, see, e.g., [19, 17, 1], this new approach treats the interface in a sharp fashion.     

Accelerated Linearized Bregman Method

In this paper, we propose and analyze an accelerated linearized Bregman (ALB) method for solving the basis pursuit and related sparse optimization problems. This accelerated algorithm is based on the fact that the linearized Bregman (LB) algorithm first proposed by Stanley Osher and his collaborators is equivalent to a gradient descent method applied to a certain dual formulation. We show that the LB method requires O(1/?) iterations to obtain an ?-optimal solution and the ALB algorithm reduces this iteration complexity to $O(1/\sqrt{\epsilon})$ while requiring almost the same computational effort on each iteration. Numerical results on compressed sensing and matrix completion problems are presented that demonstrate that the ALB method can be significantly faster than the LB method.     

A Pseudospectral Multi-Domain Method for the Incompressible Navier–Stokes Equations

A pseudospectral method for the solution of incompressible flow problems based on an iterative solver involving an implicit treatment of linearized convective terms is presented. The method is designed for moderately complex geometries by means of a multi-domain approach. Key components are a Chebyshev collocation discretization, a special pressure-correction scheme and a restarted GMRES method with a preconditioner derived from a fast direct solver. The performance of the method with respect to the multi-domain functionality is investigated and compared to finite-volume approaches.     

A Coupled Level Set-Moment of Fluid Method for Incompressible Two-Phase Flows

A coupled level set and moment of fluid method (CLSMOF) is described for computing solutions to incompressible two-phase flows. The local piecewise linear interface reconstruction (the CLSMOF reconstruction) uses information from the level set function, volume of fluid function, and reference centroid, in order to produce a slope and an intercept for the local reconstruction. The level set function is coupled to the volume-of-fluid function and reference centroid by being maintained as the signed distance to the CLSMOF piecewise linear reconstructed interface. The nonlinear terms in the momentum equations are solved using the sharp interface approach recently developed by Raessi and Pitsch (Annual Research Brief, 2009). We have modified the algorithm of Raessi and Pitsch from a staggered grid method to a collocated grid method and we combine their treatment for the nonlinear terms with the variable density, collocated, pressure projection algorithm developed by Kwatra et al. (J. Comput. Phys. 228:4146–4161, 2009). A collocated grid method makes it convenient for using block structured adaptive mesh refinement (AMR) grids. Many 2D and 3D numerical simulations of bubbles, jets, drops, and waves on a block structured adaptive grid are presented in order to demonstrate the capabilities of our new method.     

A RT Mixed FEM/DG Scheme for Optimal Control Governed by Convection Diffusion Equations

In this paper, we provide a numerical scheme—RT mixed FEM/DG scheme for the constrained optimal control problem governed by convection dominated diffusion equations. A priori and a posteriori error estimates are obtained for both the state, the co-state and the control. The adaptive mesh refinement can be applied indicated by a posteriori error estimator provided in this paper. Numerical examples are presented to illustrate the theoretical analysis.     

A Strongly Conservative Hybrid DG/Mixed FEM for the Coupling of Stokes and Darcy Flow

We consider the coupling of free and porous media flow governed by Stokes and Darcy equations with the Beavers–Joseph–Saffman interface condition. This model is discretized using a divergence-conforming finite element for the velocities in the whole domain. Hybrid discontinuous Galerkin techniques and mixed methods are used in the Stokes and Darcy subdomains, respectively. The discretization achieves mass conservation in the sense of \(H(\mathrm {div},\Omega )\), and we obtain optimal velocity convergence. Numerical results are presented to validate the theoretical findings.     

A Mixed Closure-CSP Method for Solving Scheduling Problems

Scheduling problems can be viewed as a set of temporal metric and disjunctive constraints and so they can be formulated in terms of CSP techniques. In the literature, there are CSP-based methods which sequentially interleave search efforts with the application of consistency enforcing mechanisms and variable/ordering heuristics. Therefore, the number of backtrackings needed to obtain a solution is reduced. In this paper, we propose a new method that effectively integrates the CSP process into a limited closure process: not by interleaving them but rather as a part of the same process. Such an integration allows us to define more informed heuristics. These heuristics are used to limit the complete closure process to a maximum number of disjunctions, thereby reducing its complexity while at the same time reducing the search space. Some open disjunctive solutions can be maintained in the CSP process, limiting the number of backtrackings necessary, and avoiding having to know all the problem constraints in advance. Our experiments with flow-shop and job-shop instances show that this approach obtains a feasible solution/optimal solution without having to use backtracking in most cases. We also analyze the behaviour of our algorithm when some constraints are known dynamically and we demonstrate that it can provide better results than a pure CSP process.     

A Splitting Method for Unsteady Incompressible Viscous Fluids Imposing No Boundary Conditions on Pressure

We propose a time-advancing scheme for the discretization of the unsteady incompressible Navier-Stokes equations. At any time step, we are able to decouple velocity and pressure by solving some suitable elliptic problems. In particular, the problem related with the determination of the pressure does not require boundary conditions. The divergence free condition is imposed as a penalty term, according to an appropriate restatement of the original equations. Some experiments are carried out by approximating the space variables with the spectral Legendre collocation method. Due to the special treatment of the pressure, no spurious modes are generated.     

A Compact Higher Order Finite Difference Method for the Incompressible Navier–Stokes Equations

A numerical method based on compact fourth order finite difference approximations is used for the solution of the incompressible Navier–Stokes equations. Our method is implemented for two dimensional, curvilinear coordinates on orthogonal, staggered grids. Two numerical experiments confirm the theoretically expected order of accuracy.     

The Compact Discontinuous Galerkin Method for Nearly Incompressible Linear Elasticity

A compact discontinuous Galerkin method (CDG) is devised for nearly incompressible linear elasticity, through replacing the global lifting operator for determining the numerical trace of stress tensor in a local discontinuous Galerkin method (cf. Chen et al., Math Probl Eng 20, 2010) by the local lifting operator and removing some jumping terms. It possesses the compact stencil, that means the degrees of freedom in one element are only connected to those in the immediate neighboring elements. Optimal error estimates in broken energy norm, $H^1$ -norm and $L^2$ -norm are derived for the method, which are uniform with respect to the Lamé constant $\lambda .$ Furthermore, we obtain a post-processed $H(\text{ div})$ -conforming displacement by projecting the displacement and corresponding trace of the CDG method into the Raviart–Thomas element space, and obtain optimal error estimates of this numerical solution in $H(\text{ div})$ -seminorm and $L^2$ -norm, which are uniform with respect to $\lambda .$ A series of numerical results are offered to illustrate the numerical performance of our method.     

A Parallel Domain Decomposition Method for 3D Unsteady Incompressible Flows at High Reynolds Number

Numerical simulation of three-dimensional incompressible flows at high Reynolds number using the unsteady Navier–Stokes equations is challenging. In order to obtain accurate simulations, very fine meshes are necessary, and such simulations are increasingly important for modern engineering practices, such as understanding the flow behavior around high speed trains, which is the target application of this research. To avoid the time step size constraint imposed by the CFL number and the fine spacial mesh size, we investigate some fully implicit methods, and focus on how to solve the large nonlinear system of equations at each time step on large scale parallel computers. In most of the existing implicit Navier–Stokes solvers, segregated velocity and pressure treatment is employed. In this paper, we focus on the Newton–Krylov–Schwarz method for solving the monolithic nonlinear system arising from the fully coupled finite element discretization of the Navier–Stokes equations on unstructured meshes. In the subdomain, LU or point-block ILU is used as the local solver. We test the algorithm for some three-dimensional complex unsteady flows, including flows passing a high speed train, on a supercomputer with thousands of processors. Numerical experiments show that the algorithm has superlinear scalability with over three thousand processors for problems with tens of millions of unknowns.     

Strong and Auxiliary Forms of the Semi-Lagrangian Method for Incompressible Flows

We present a review of the semi-Lagrangian method for advection–diffusion and incompressible Navier–Stokes equations discretized with high-order methods. In particular, we compare the strong form where the departure points are computed directly via backwards integration with the auxiliary form where an auxiliary advection equation is solved instead; the latter is also referred to as Operator Integration Factor Splitting (OIFS) scheme. For intermediate size of time steps the auxiliary form is preferrable but for large time steps only the strong form is stable.     

A Fourth Order Scheme for Incompressible Boussinesq Equations

A fourth order finite difference method is presented for the 2D unsteady viscous incompressible Boussinesq equations in vorticity-stream function formulation. The method is especially suitable for moderate to large Reynolds number flows. The momentum equation is discretized by a compact fourth order scheme with the no-slip boundary condition enforced using a local vorticity boundary condition. Fourth order long-stencil discretizations are used for the temperature transport equation with one-sided extrapolation applied near the boundary. The time stepping scheme for both equations is classical fourth order Runge–Kutta. The method is highly efficient. The main computation consists of the solution of two Poisson-like equations at each Runge–Kutta time stage for which standard FFT based fast Poisson solvers are used. An example of Lorenz flow is presented, in which the full fourth order accuracy is checked. The numerical simulation of a strong shear flow induced by a temperature jump, is resolved by two perfectly matching resolutions. Additionally, we present benchmark quality simulations of a differentially-heated cavity problem. This flow was the focus of a special session at the first MIT conference on Computational Fluid and Solid Mechanics in June 2001.     

A Semi-Lagrangian Method for Turbulence Simulations Using Mixed Spectral Discretizations

We present a semi-Lagrangian method for integrating the three-dimensional incompressible Navier–Stokes equations. We develop stable schemes of second-order accuracy in time and spectral accuracy in space. Specifically, we employ a spectral element (Jacobi) expansion in one direction and Fourier collocation in the other two directions. We demonstrate exponential convergence for this method, and investigate the non-monotonic behavior of the temporal error for an exact three-dimensional solution. We also present direct numerical simulations of a turbulent channel-flow, and demonstrate the stability of this approach even for marginal resolution unlike its Eulerian counterpart.