LOCAL AND PARALLEL FINITE ELEMENT ALGORITHMS FOR THE NAVIER-STOKES PROBLEM

Based on two-grid discretizations, in this paper, some new local and parallel finiteelement algorithms are proposed and analyzed for the stationary incompressible Navier-Stokes problem. These algorithms are motivated by the observation that for a solutionto the Navier-Stokes problem, low frequency components can be approximated well by arelatively coarse grid and high frequency components can be computed on a fine grid bysome local and parallel procedure. One major technical tool for the analysis is some locala priori error estimates that are also obtained in this paper for the finite element solutionson general shape-regular grids.     

Local and parallel finite element algorithms for the stokes problem

Based on two-grid discretizations, some local and parallel finite element algorithms for the Stokes problem are proposed and analyzed in this paper. These algorithms are motivated by the observation that for a solution to the Stokes problem, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. One technical tool for the analysis is some local a priori estimates that are also obtained in this paper for the finite element solutions on general shape-regular grids. Y. He was partially subsidized by the NSF of China 10671154 and the National Basic Research Program under the grant 2005CB321703; A. Zhou was partially supported by the National Science Foundation of China under the grant 10425105 and the National Basic Research Program under the grant 2005CB321704; J. Li was partially supported by the NSF of China under the grant 10701001. J. Xu was partially supported by Alexander von Humboldt Research Award for Senior US Scientists, NSF DMS-0609727 and NSFC-10528102.     

Two-grid stabilized algorithms for the steady Navier–Stokes equations with damping

This paper presents and studies three two-grid stabilized quadratic equal-order finite element algorithms based on two local Gauss integrations for the steady Navier–Stokes equations with damping. In these algorithms, we first solve a stabilized nonlinear problem on a coarse grid, and then pass the coarse grid solution to a fine grid and solve a stabilized linear problem. Using some nonlinear analysis techniques, we analyze stability of the algorithms and derive optimal order error estimates of the approximate solutions. Theoretical and numerical results show that, when the algorithmic parameters are chosen appropriately, the accuracy of the approximate solutions computed by our two-grid stabilized algorithms is comparable to that of solving a fully stabilized nonlinear problem on the same fine grid; however, our two-grid algorithms save a large amount of CPU time than the one-grid stabilized algorithm.     

非定常Stokes方程的全离散稳定化有限元格式

本文研究二维非定常Stokes方程全离散稳定化有限元方法.首先给出关于时间向后一步Euler半离散格式,然后直接从该时间半离散格式出发,构造基于两局部高斯积分的稳定化全离散有限元格式,其中空间用P_1—P_1元逼近,证明有限元解的误差估计.本文的研究方法使得理论证明变得更加简便,也是处理非定常Stokes方程的一种新的途径.     

Local and parallel algorithms for fourth order problems discretized by the Morley–Wang–Xu element method

This paper systematically studies numerical solution of fourth order problems in any dimensions by use of the Morley–Wang–Xu (MWX) element discretization combined with two-grid methods (Xu and Zhou (Math Comp 69:881–909, 1999)). Since the coarse and fine finite element spaces are nonnested, two intergrid transfer operators are first constructed in any dimensions technically, based on which two classes of local and parallel algorithms are then devised for solving such problems. Following some ideas in (Xu and Zhou (Math Comp 69:881–909, 1999)), the intrinsic derivation of error analysis for nonconforming finite element methods of fourth order problems (Huang et al. (Appl Numer Math 37:519–533, 2001); Huang et al. (Sci China Ser A 49:109–120, 2006)), and the error estimates for the intergrid transfer operators, we prove that the discrete energy errors of the two classes of methods are of the sizes O(h + H ²) and O(h + H ²(H/h)^(d−1)/2), respectively. Here, H and h denote respectively the mesh sizes of the coarse and fine finite element triangulations, and d indicates the space dimension of the solution region. Numerical results are performed to support the theory obtained and to compare the numerical performance of several local and parallel algorithms using different intergrid transfer operators.     

A parallel two-level finite element variational multiscale method for the Navier–Stokes equations

A combination method of two-grid discretization approach with a recent finite element variational multiscale algorithm for simulation of the incompressible Navier–Stokes equations is proposed and analyzed. The method consists of a global small-scale nonlinear Navier–Stokes problem on a coarse grid and local linearized residual problems in overlapped fine grid subdomains, where the numerical form of the Navier–Stokes equations on the coarse grid is stabilized by a stabilization term based on two local Gauss integrations at element level and defined by the difference between a consistent and an under-integrated matrix involving the gradient of velocity. By the technical tool of local a priori estimate for the finite element solution, error bounds of the discrete solution are estimated. Algorithmic parameter scalings are derived. Numerical tests are also given to verify the theoretical predictions and demonstrate the effectiveness of the method.     

A parallel finite element variational multiscale method based on fully overlapping domain decomposition for incompressible flows

Based on fully overlapping domain decomposition and a recent variational multiscale method, a parallel finite element variational multiscale method for convection dominated incompressible flows is proposed and analyzed. In this method, each processor computes a local finite element solution in its own subdomain using a global mesh that is locally refined around its own subdomain, where a stabilization term based on two local Gauss integrations is adopted to stabilize the numerical form of the Navier–Stokes equations. Using the technical tool of local a priori estimate for the finite element solution, error bounds of the discrete solution are estimated. Algorithmic parameter scalings are derived. Numerical tests are also given to verify the theoretical predictions and demonstrate the effectiveness of the method. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 856–875, 2015     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Second order modified method of characteristics mixed defect-correction finite element method for time dependent Navier–Stokes problems

In this paper, a second order modified method of characteristics defect-correction (SOMMOCDC) mixed finite element method for the time dependent Navier–Stokes problems is presented. In this method, the hyperbolic part (the temporal and advection term) are treated by a second order characteristics tracking scheme, and the non-linear term is linearized at the same time. Then, we solve the equations with an added artificial viscosity term and correct this solution by using the defect-correction technique. The error analysis shows that this method has a good convergence property. In order to show the efficiency of the SOMMOCDC mixed finite element method, we first present some numerical results of an analytical solution problem, which agrees very well with our theoretical results. Then, we give some numerical results of lid-driven cavity flow with the Reynolds number Re = 5,000, 7,500 and 10,000. From these numerical results, we can see that the schemes can result in good accuracy, which shows that this method is highly efficient.     

O(dlog?N)-Quantics Approximation of N-d Tensors in High-Dimensional Numerical Modeling

In the present paper, we discuss the novel concept of super-compressed tensor-structured data formats in high-dimensional applications. We describe the multifolding or quantics-based tensor approximation method of O(dlog N)-complexity (logarithmic scaling in the volume size), applied to the discrete functions over the product index set {1,…,N}^⊗d , or briefly N-d tensors of size N ^d , and to the respective discretized differential-integral operators in ℝ ^d . As the basic approximation result, we prove that a complex exponential sampled on an equispaced grid has quantics rank 1. Moreover, a Chebyshev polynomial, sampled over a Chebyshev Gauss–Lobatto grid, has separation rank 2 in the quantics tensor format, while for the polynomial of degree m over a Chebyshev grid the respective quantics rank is at most 2m+1. For N-d tensors generated by certain analytic functions, we give a constructive proof of the O(dlog Nlog ε ⁻¹)-complexity bound for their approximation by low-rank 2-(dlog N) quantics tensors up to the accuracy ε>0. In the case ε=O(N ^−α ), α>0, our approach leads to the quantics tensor numerical method in dimension d, with the nearly optimal asymptotic complexity O(d/αlog ² ε ⁻¹). From numerical examples presented here, we observe that the quantics tensor method has proved its value in application to various function related tensors/matrices arising in computational quantum chemistry and in the traditional finite element method/boundary element method (FEM/BEM). The tool apparently works.     

A second-order finite element variational multiscale scheme for the fully discrete unsteady Navier–Stokes equations

In this report, we present and study a fully discrete finite element variational multiscale scheme for the unsteady incompressible Navier–Stokes equations where high Reynolds numbers are allowed. The scheme uses conforming finite element pairs for spatial discretization and a three-point difference formula for temporal discretization which is of second-order, where a stabilization term based on two local Gauss integrations is employed to stabilize the numerical scheme. We prove stability of the scheme, derive a priori error estimates for the fully discrete solution, and finally, give some numerical results to verify the theoretical predictions and demonstrate the effectiveness of the proposed numerical scheme.     

不可压缩流动的并行数值方法

不可压缩流动的数值模拟是计算流体力学的重要组成部分. 基于有限元离散方法, 本文设计了不可压缩Navier-Stokes (N-S)方程支配流的若干并行数值算法. 这些并行算法可归为两大类: 一类是基于两重网格离散方法, 首先在粗网格上求解非线性的N-S方程, 然后在细网格的子区域上并行求解线性化的残差方程, 以校正粗网格的解; 另一类是基于新型完全重叠型区域分解技巧, 每台处理器用一局部加密的全局多尺度网格计算所负责子区域的局部有限元解. 这些并行算法实现简单, 通信需求少, 具有良好的并行性能, 能获得与标准有限元方法相同收敛阶的有限元解. 理论分析和数值试验验证了并行算法的高效性     

Low‐order stabilized finite element methods for the unsteady Stokes/Navier‐Stokes equations with friction boundary conditions

In this paper, we consider low‐order stabilized finite element methods for the unsteady Stokes/Navier‐Stokes equations with friction boundary conditions. The time discretization is based on the Euler implicit scheme, and the spatial discretization is based on the low‐order element (P₁−P₁ or P₁−P₀) for the approximation of the velocity and pressure. Moreover, some error estimates for the numerical solution of fully discrete stabilized finite element scheme are obtained. Finally, numerical experiments are performed to confirm our theoretical results.     

Convergence analysis of the FEM approximation of the first order projection method for incompressible flows with and without the inf-sup condition

In this paper we obtain convergence results for the fully discrete projection method for the numerical approximation of the incompressible Navier–Stokes equations using a finite element approximation for the space discretization. We consider two situations. In the first one, the analysis relies on the satisfaction of the inf-sup condition for the velocity-pressure finite element spaces. After that, we study a fully discrete fractional step method using a Poisson equation for the pressure. In this case the velocity-pressure interpolations do not need to accomplish the inf-sup condition and in fact we consider the case in which equal velocity-pressure interpolation is used. Optimal convergence results in time and space have been obtained in both cases.     

Local and parallel finite element algorithms based on two-grid discretizations

A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorithms are motivated by the observation that, for a solution to some elliptic problems, low frequency components can be approximated well by a relatively coarse grid and high frequency components can be computed on a fine grid by some local and parallel procedure. The theoretical tools for analyzing these methods are some local a priori and a posteriori estimates that are also obtained in this paper for finite element solutions on general shape-regular grids. Some numerical experiments are also presented to support the theory.

     

Convergence analysis of a projection semi-implicit coupling scheme for fluid–structure interaction problems

In this paper, we provide a convergence analysis of a projection semi-implicit scheme for the simulation of fluid–structure systems involving an incompressible viscous fluid. The error analysis is performed on a fully discretized linear coupled problem: a finite element approximation and a semi-implicit time-stepping strategy are respectively used for space and time discretization. The fluid is described by the Stokes equations, the structure by the classical linear elastodynamics equations (linearized elasticity, plate or shell models) and all changes of geometry are neglected. We derive an error estimate in finite time and we prove that the time discretization error for the coupling scheme is at least ${\sqrt{\delta t}}In this paper, we provide a convergence analysis of a projection semi-implicit scheme for the simulation of fluid–structure systems involving an incompressible viscous fluid. The error analysis is performed on a fully discretized linear coupled problem: a finite element approximation and a semi-implicit time-stepping strategy are respectively used for space and time discretization. The fluid is described by the Stokes equations, the structure by the classical linear elastodynamics equations (linearized elasticity, plate or shell models) and all changes of geometry are neglected. We derive an error estimate in finite time and we prove that the time discretization error for the coupling scheme is at least ?{dt}{\sqrt{\delta t}}. Finally, some numerical experiments that confirm the theoretical analysis are presented.     

非定常的热传导-对流问题的非线性Galerkin混合元法(Ⅱ):向后一步的Euler全离散化格式

In this paper, a fully discrete format of nonlinear Galerkin mixed element method with backward one-step Euler discretization of time for the non stationary conduction-convection problems is presented. The scheme is based on two finite element spaces XH and Xh for the approximation of the velocity, defined respectively on a coarse grid with grids size H and another fine grid with grid size h<< H, a finite element space Mh for the approximation of the pressure and two finite element spaces AH and Wh, for the approximation of the temperature,also defined respectivply on the coarse grid with grid size H and another fine grid with grid size h. The existence and the convergence of the fully discrete mixed element solution are shown. The scheme consists in using standard backward one step Euler-Galerkin fully discrete format at first L0 steps (L0 2) on fine grid with grid size h, but using nonlinear Galerkin mixed element method of backward one step Euler-Galerkin fully discrete format through L0 + 1 step to end step. We have proved that the fully discrete nonlinear Galerkin mixed element procedure with respect to the coarse grid spaces with grid size H holds superconvergence.     

An Adaptive Local (AL) Basis for Elliptic Problems with Complicated Discontinuous Coefficients

We develop a generalized finite element method for the discretization of elliptic partial differential equations in heterogeneous media. In [5] a semidiscrete method has been introduced to set up an adaptive local finite element basis (AL basis) on a coarse mesh with mesh size H which, typically, does not resolve the matrix of the media while the textbook finite element convergence rates are preserved. This method requires O(log(1/H)^d+1) basis functions per mesh point where d denotes the spatial dimension of the computational domain. We present a fully discrete version of this method, where the AL basis is constructed by solving finite-dimensional localized problems, and which preserves the optimal convergence rates. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Two‐level Newton iterative method for the 2D/3D steady Navier‐Stokes equations

A combination method of the Newton iteration and two‐level finite element algorithm is applied for solving numerically the steady Navier‐Stokes equations under the strong uniqueness condition. This algorithm is motivated by applying the m Newton iterations for solving the Navier‐Stokes problem on a coarse grid and computing the Stokes problem on a fine grid. Then, the uniform stability and convergence with respect to ν of the two‐level Newton iterative solution are analyzed for the large m and small H and h << H. Finally, some numerical tests are made to demonstrate the effectiveness of the method. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2012     

Local and Parallel Finite Element Algorithms Based on Two-Grid Discretizations for Nonlinear Problems

In this paper, some local and parallel discretizations and adaptive finite element algorithms are proposed and analyzed for nonlinear elliptic boundary value problems in both two and three dimensions. The main technique is to use a standard finite element discretization on a coarse grid to approximate low frequencies and then to apply some linearized discretization on a fine grid to correct the resulted residual (which contains mostly high frequencies) by some local/parallel procedures. The theoretical tools for analyzing these methods are some local a priori and a posteriori error estimates for finite element solutions on general shape-regular grids that are also obtained in this paper.