A variant of the finite superelement method for computing viscous incompressible flows

A variant of the finite superelement method (FSEM) is proposed for computing viscous incompressible convection-dominated flows on a triangular unstructured mesh. To construct the high-order FSEM scheme, vector polynomial test functions (SE basis) are calculated in each grid cell by solving the linearized Navier-Stokes equations with special boundary conditions in the form of basis functions in the trace space.     

Laplace–Beltrami enhancement for unstructured two-dimensional meshes having dendritic elements and boundary node movement

The Laplace–Beltrami mesh enhancement algorithm of Hansen et al. ,  and  has been implemented and broadened to include meshes containing dendritic elements and allowing for boundary node movement. This implementation operates on an unstructured two-dimensional mesh by forming an equivalent weak statement using finite element interpolation, assembly, and solution ideas to iteratively place those nodes allowed to move. Moving boundary nodes are constrained to follow the boundary geometry described as a Wilson–Fowler spline (e.g., [3, Section 2.1.3.1]). Implementation details concerning the element basis set modifications, the metric tensor for dendritic element treatment and boundary node movement are presented. Laplacian (e.g., [6]) enhancement is included as a special case. Results are presented which illustrate the algorithm for three test problems.     

ALTERING CONNECTIVITY WITH LARGE DEFORMATION MESH FOR LAGRANGIAN METHOD AND ITS APPLICATION IN MULTIPLE MATERIAL SIMULATION

A new approach for treating the mesh with Lagrangian scheme of finite volume method is presented. It has been proved that classical Lagrangian method is difficult to cope with large deformation in tracking material particles due to severe distortion of cells, and the changing connectivity of the mesh seems especially attractive for solving such issues. The mesh with large deformation based on computational geometry is optimized by using new method. This paper develops a processing system for arbitrary polygonal unstructured grid, the intelligent variable grid neighborhood technologies is utilized to improve the quality of mesh in calculation process, and arbitrary polygonal mesh is used in the Lagrangian finite volume scheme. The performance of the new method is demonstrated through series of numerical examples, and the simulation capability is efficiently presented in coping with the systems with large deformations.     

A Study on CFL Conditions for the DG Solution of Conservation Laws on Adaptive Moving Meshes

The selection of time step plays a crucial role in improving stability and efficiency in the Discontinuous Galerkin (DG) solution of hyperbolic conservation laws on adaptive moving meshes that typically employs explicit stepping. A commonly used selection of time step is a direct extension based on Courant-Friedrichs-Levy (CFL) conditions established for fixed and uniform meshes. In this work, we provide a mathematical justification for those time step selection strategies used in practical adaptive DG computations. A stability analysis is presented for a moving mesh DG method for linear scalar conservation laws. Based on the analysis, a new selection strategy of the time step is proposed, which takes into consideration the coupling of the $α$-function (that is related to the eigenvalues of the Jacobian matrix of the flux and the mesh movement velocity) and the heights of the mesh elements. The analysis also suggests several stable combinations of the choices of the $α$-function in the numerical scheme and in the time step selection. Numerical results obtained with a moving mesh DG method for Burgers' and Euler equations are presented. For comparison purpose, numerical results obtained with an error-based time step-size selection strategy are also given.     

The hierarchical preconditioning on unstructured three-dimensional grids with locally refined regions

This paper presents two hierarchically preconditioned methods for the fast solution of mesh equations that approximate three-dimensional-elliptic boundary value problems on quasiuniform triangulations above all aiming at the numerical investigation of the previously suggested algorithms. Furthermore, improving the practical applicability of the methods unstructured three-dimensional grids possessing locally refined regions are considered. Based on the fictitious space approach, the original problem can be adaptively embedded into an auxiliary one in which hanging nodes occur. We implemented the corresponding Yserentant preconditioned conjugate gradient method as well as the BPX-preconditioned cg-iteration having nearly optimal computational costs. Several numerical examples demonstrate the efficiency of the artificially constructed hierarchical methods.     

Grid approximation of a parabolic convection-diffusion equation on a priori adapted grids: ε-uniformly convergent schemes

The boundary value problem for a singularly perturbed parabolic convection-diffusion equation is considered. A finite difference scheme on a priori (sequentially) adapted grids is constructed and its convergence is examined. The construction of the scheme on a priori adapted grids is based on a majorant of the singular component of the grid solution that makes it possible to a priori find a subdomain in which the grid solution should be further refined given the perturbation parameter ε, the size of the uniform mesh in x, the desired accuracy of the grid solution, and the prescribed number of iterations K used to refine the solution. In the subdomains where the solution is refined, the grid problems are solved on uniform grids. The error of the solution thus constructed weakly depends on ε. The scheme converges almost ε-uniformly; namely, it converges under the condition N ^?1 = o(ε^v), where v = v(K) can be chosen arbitrarily small when K is sufficiently large. If a piecewise uniform grid is used instead of a uniform one at the final Kth iteration, the difference scheme converges ε-uniformly. For this piecewise uniform grid, the ratio of the mesh sizes in x on the parts of the mesh with a constant size (outside the boundary layer and inside it) is considerably less than that for the known ε-uniformly convergent schemes on piecewise uniform grids.     

CONSERVATION OF THREE—POINT COMPACT SCHEMES ON SINGLE AND MULTIBLOCK PATCHED GRIDS FOR HYPERBOLIC PROBLEMS

For nonlinear hyperbloic problems,Conservation of the numerical scheme is important for convergence to the correct weak solutions.In this paper the the conservation of the well-known compact scheme up to fourth order of accuracy on a single and uniform grid is studied,and a conservative interface treatment is derived for compact schemes on patched grids .For a pure initial value problem,the compact scheme is shown to be equivalent to a scheme in the usual conservative form .For the case of a mixed initial boundary value problem,the compact scheme is conservative only if the rounding errors are small enough.For a pactched grid interface,a conservative interface condition useful for mesh fefiement and for parallel computation is derived and its order of local accuracy is analyzed.     

Hybrid Surface Mesh Adaptation for Climate Modeling

Solution-driven mesh adaptation is becoming quite popular for spatial error control in the numerical simulation of complex computational physics applications, such as climate modeling. Typically, spatial adaptation is achieved by element subdivision （h adaptation） with a primary goal of resolving the local length scales of interest. A sec- ond, less-popular method of spatial adaptivity is called ＂mesh motion＂ （r adaptation）; the smooth repositioning of mesh node points aimed at resizing existing elements to capture the local length scales. This paper proposes an adaptation method based on a combination of both element subdivision and node point repositioning （rh adaptation）. By combining these two methods using the notion of a mobility function, the proposed approach seeks to increase the flexibility and extensibility of mesh motion algorithms while providing a somewhat smoother transition between refined regions than is pro- duced by element subdivision alone. Further, in an attempt to support the requirements of a very general class of climate simulation applications, the proposed method is designed to accommodate unstructured, polygonal mesh topologies in addition to the most popular mesh types.     

Numerical simulation and convergence analysis for a system of nonlinear singularly perturbed differential equations arising in population dynamics

In this article, we consider a system of nonlinear singularly perturbed differential equations with two different parameters. To solve this system, we develop a weighted monotone hybrid scheme on a nonuniform mesh. The proposed scheme is a combination of the midpoint scheme and the upwind scheme involving the weight parameters. The weight parameters enable the method to switch automatically from the midpoint scheme to the upwind scheme as the nodal points start moving from the inner region to the outer region. The nonuniform mesh in particular the adaptive grid is constructed using the idea of equidistributing a positive monitor function involving the solution gradient. The method is shown to be second order convergent with respect to the small parameters. Numerical experiments are presented to show the robustness of the proposed scheme and indicate that the estimate is optimal.     

Optimal adaptive grids of least-squares finite element methods in two spatial dimensions

This article concerns a procedure to generate optimal adaptive grids for convection dominated problems in two spatial dimensions based on least-squares finite element approximations. The procedure extends a one dimensional equidistribution principle which minimizes the interpolation error in some norms. The idea is to select two directions which can reflect the physics of the problems and then apply the one dimensional equidistribution principle to the chosen directions. Model problems considered are the two dimensional convection-diffusion problems where boundary and interior layers occur. Numerical results of model problems illustrating the efficiency of the proposed scheme are presented. In addition, to avoid skewed mesh in the optimal grids generated by the algorithm, an unstructured local mesh smoothing will be considered in the least-squares approximations. Comparisons with the Gakerkin finite element method will also be provided.     

薄板的局部Petrov-Galerkin方法

利用薄板控制微分方程的等效积分对称弱形式和对变量(挠度)采用移动最小二乘近似函数进行插值,研究了薄板弯曲问题的无网格局部Petrov-Galerkin方法．这是一种真正的无网格方法,它不需要任何有限元或边界元网格,不管这种网格是用于能量积分还是进行插值的目的．所有的积分都在规则形状的子域及其边界上进行,并用罚因子法施加本质边界条件．数值例子表明,无网格局部Petrov-Galerkin法不但能够求解二阶微分方程的边值问题,而且求解四阶微分方程的边值问题也很有效,也具有收敛快、稳定性好、对挠度和内力都具有精度高的特点．     

基于不光滑边界的变系数抛物型方程的高精度紧格式

本文讨论基于不光滑边界的变系数抛物型方程求解的高精度紧格式.首先构造一般变系数抛物型方程的高精度紧格式,并在理论上证明格式具有空间方向四阶精度.然后针对非光滑边界条件,引入局部网格加密技巧在奇异点附近进行不均匀的网格加密.数值实验以期权定价中Black-Scholes偏微分方程的求解为例,验证高精度紧格式用于光滑边界条件的微分方程离散可以达到四阶精度.对于处理非光滑边界条件,网格局部加密技巧能有效的提高数值解精度,使得高精度紧格式用于定价欧式期权可以接近四阶精度.     

A new two grid variational multiscale method for steady‐state natural convection problem

A two‐grid variational multiscale method based on two local Gauss integrations for solving the stationary natural convection problem is presented in this article. A significant feature of the method is that we solve the natural convection problem on a coarse mesh using finite element variational multiscale method based on two local Gauss integrations firstly, and then find a fine grid solution by solving a linearized problem on a fine grid. In the computation, we introduce two local Gauss integrations as a stabilizing term to replace the projection operator without adding other variables. The stability estimates and convergence analysis of the new method are derived. Ample numerical experiments are performed to validate the theoretical predictions and demonstrate the efficiency of the new method. Copyright © 2016 John Wiley & Sons, Ltd.     

三维弹性问题无网格分析的奇异杂交边界点方法

提出了一种求解三维线弹性问题的奇异杂交边界点方法．将修正变分原理与移动最小二乘法结合起来,利用了前者的降维优势和后者的无网格特性．使用刚体位移法处理方法中的强奇异积分,提出了一种自适应的积分方案,解决了原有的杂交边界点方法中存在的“边界层效应”．在该方法中,将基本解的源点直接布在边界上,避免了在正则化杂交边界点法中不确定参数的选取．三维弹性力学问题算例体现了这些特点．结果表明该方法与已知的精确解符合较好,同时研究了影响该方法精度的一些参数．     

A nine-point scheme with explicit weights for diffusion equations on distorted meshes

In this paper, for the structured quadrilateral mesh we derive a nine-point difference scheme which has five cell-centered unknowns and four vertex unknowns. The vertex unknowns are treated as intermediate ones and are expressed as a linear combination of the neighboring cell-centered unknowns, which reduces the scheme to a cell-centered one with a local stencil involving nine cell-centered unknowns. The coefficients in the linear combination are known as the weights and two types of new weights are proposed. These new weights are neither discontinuity dependent nor mesh topology dependent, have explicit expressions, can reduce to the one-dimensional harmonic-average weights on the nonuniform rectangular meshes, and moreover, are easily extended to the unstructured polygonal meshes and non-matching meshes. Both the derivation of the nine-point scheme and that of new weights satisfy the linearity preserving criterion. Numerical experiments show that, with these new weights, the nine-point difference scheme and its simple extension have a nearly second order accuracy on many highly distorted meshes, including structured quadrilateral meshes, unstructured polygonal meshes and non-matching meshes.     

Mesh Spacing Estimates and Efficiency Considerations for Moving Mesh Systems

Adaptive numerical methods for solving partial differential equations (PDEs) that control the movement of grid points are called moving mesh methods. In this paper, these methods are examined in the case where a separate PDE, that depends on a monitor function, controls the behavior of the mesh. This results in a system of PDEs: one controlling the mesh and another solving the physical problem that is of interest. For a class of monitor functions resembling the arc length monitor, a trade off between computational efficiency in solving the moving mesh system and the accuracy level of the solution to the physical PDE is demonstrated. This accuracy is measured in the density of mesh points in the desired portion of the domain where the function has steep gradient. The balance of computational efficiency versus accuracy is illustrated numerically with both the arc length monitor and a monitor that minimizes certain interpolation errors. Physical solutions with steep gradients in small portions of their domain are considered for both the analysis and the computations.     

On 2D structured mesh generation by using mappings

A grid generation problem in two‐dimensional domains is considered by using a quasi‐conformal mapping of the parametric domain with a given square mesh onto the physical domain where the grid is required. To this end, a harmonic mapping is first applied, which, by the Radó theorem, is a diffeomorphism subject to some known conditions. However, the discrete harmonic mapping may produce folded meshes on a nonconvex domain with a strongly bent boundary. We demonstrate that it is caused by the truncation error. With the aim of controlling grid node location, an additional mapping is used. The Dirichlet problem for the universal elliptic partial differential equations is solved to construct the mapping. This allows to produce unfolded grids with a prescribed cell shape. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1072–1091, 2011     

Front tracking for two-phase flow in reservoir simulation by adaptive mesh

In this article, an algorithm for the numerical approximation of two-phase flow in porous media by adaptive mesh is presented. A convergent and conservative finite volume scheme for an elliptic equation is proposed, together with the finite difference schemes, upwind and MUSCL, for a hyperbolic equation on grids with local refinement. Hence, an IMPES method is applied in an adaptive composite grid to track the front of a moving solution. An object-oriented programmation technique is used. The computational results for different examples illustrate the efficiency of the proposed algorithm. © 1997 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 13: 673–697, 1997     

A fast finite difference method for biharmonic equations on irregular domains and its application to an incompressible Stokes flow

Biharmonic equations have many applications, especially in fluid and solid mechanics, but is difficult to solve due to the fourth order derivatives in the differential equation. In this paper a fast second order accurate algorithm based on a finite difference discretization and a Cartesian grid is developed for two dimensional biharmonic equations on irregular domains with essential boundary conditions. The irregular domain is embedded into a rectangular region and the biharmonic equation is decoupled to two Poisson equations. An auxiliary unknown quantity Δu along the boundary is introduced so that fast Poisson solvers on irregular domains can be used. Non-trivial numerical examples show the efficiency of the proposed method. The number of iterations of the method is independent of the mesh size. Another key to the method is a new interpolation scheme to evaluate the residual of the Schur complement system. The new biharmonic solver has been applied to solve the incompressible Stokes flow on an irregular domain.      

A higher-order hybrid spline difference method on adaptive mesh for solving singularly perturbed parabolic reaction–diffusion problems with robin-boundary conditions

We propose a hybrid numerical scheme to discretize a class of singularly perturbed parabolic reaction–diffusion problems with robin-boundary conditions on an equidistributed grid. The hybrid difference scheme is developed by using a modified backward difference scheme in time, a combination of the cubic spline and exponential spline difference scheme in space. The proposed scheme uses a cubic spline difference scheme for the discretization of robin-boundary conditions. For the time discretization of the problem, we use the standard uniform mesh while a layer adapted equidistributed grid is generated for the spatial discretization. By equidistributing a curvature-based monitor function, the spatial adaptive grid is able to capture the presence of parabolic boundary layers without using any prior information about the solution. Parameter uniform error estimates are derived to illustrate an optimal convergence of first-order in time and second-order in space for the proposed discretization. The accuracy of the proposed scheme is confirmed by the numerical experiments that underpin the theoretical analysis.