加罚Navier—Stokes方程的最佳非线性Galerkin算法

该文提出了求解二维加罚Navier-Stokes方程的最佳非线性Galerkin算法．这个算法在于在粗网格有限元空间上求解一非线性子问题，在细网格增量有限元空间Wh上求解一线性子问题．如果线性有限元被使用及，则该算法具有和有限元Galerkin算法同阶的收敛速度．然而该文提出的算法可以节省可观的计算时间．     

外部非定常Navier-Stokes方程的非线性Galerkin算法

提出了求解外部非定常Navier-stokes方程的有限元边界元耦合的非线性Galerkin算法,证明了相应变分问题的正则性和数值解的收敛速度。收敛性分析表明如果选取粗网格尺度H是细网格尺度h的开平方数量级,则该算法提供了与古典Galerkin算法同阶的收敛速度。然而非线性Galerkin算法仅仅需要在粗网格解非线性问题,在细网格上解线性问题。因此,该算法可以节省计算工作量。     

定常不可压Navier—Stokes方程迎风格式

本文利用齐次定解条件对定常不可压Navier—Stokes方程的非线性项进行处理,给出了相应的一种迎风Galerkin有限元算法;针对这种迎风Galerkin有限元算法,在迎风参数满足一定条件下,利用其三项式具有的一些很好性质,更简单地证明了该问题解的存在唯一性。     

定常Navier—Stokes方程的Petrov—Galerkin方法

研究了定常Navier－Stokes方程的四种Petrov－Galerkin有限元方法：PG1，PG2，SD和GLS．它们都是稳定的，避免了经典混合方法中必要的Babuska－Brezzi条件．给出了各种方法有限元解的存在性、唯一性和唯一解的误差估计．     

两类变时间步长的非线性Galerkin算法的稳定性

1．引言近年来,随着计算机的飞速发展,人们越来越关心非线性发展方程解的渐进行为．为了较精确地描述解在时间t→∞时的渐进行为,人们发展了一类惯性算法,即非线性Galerkin算法．该算法是将来解空间分解为低维部分和高维部分,相应的方程可以分别投影到它们上面,它的解也相应地分解为两部分,大涡分量和小涡分量;然后核算法给出大涡分量和小涡分量之间依赖关系的一种近似,以便容易求出相应的近似解．许多研究表明,非线性Galerkin算法比通常的Galerkin算法节省可观的计算量．当数值求解微分方程时,计算机只能对已知数据进行有限位…     

二维非线性对流扩散方程特征有限元的两重网络算法

针对二维非线性对流扩散方程,构造了特征有限元两重网格算法．该算法只需要在粗网格上进行非线性迭代运算,而在所需要求解的细网格上进行一次线性运算即可．对于非线性对流占优扩散方程,不仅可以消除因对流占优项引起的数值振荡现象,还可以加快收敛速度、提高计算效率．误差估计表明只要选取粗细网格步长满足一定的关系式,就可以使两重网格解与有限元解保持同样的计算精度．算例显示:两重网格算法比特征有限元算法的收敛速度明显加快．     

非线性Galerkin算法的收敛性和复杂性

本文给出了数值求解非线性发展方程的全离散非线性Ｇａｌｅｒｋｉｎ算法,即将空间离散时的谱非线性Ｇａｌｅｒｋｉｎ算法和时间离散的Ｅｕｌｅｒ差分格式相结合,得到了显式和隐式两种全离散数值格式,相应地也考虑了显式和隐式的Ｇａｌｅｒｋｉｎ全离散格式,并分别分析了上述四种全离散格式的收敛性和复杂性,经过比较得出结论;在某些约束条件下,非线性Ｇａｌｅｒｋｉｎ算法和Ｇａｌｅｒｋｉｎ算法具有相同阶的收敛速度,然而前     

求解Hamilton-Jacobi方程的有限元方法

本文将Galerkin二次有限元应于Hamilton-Jacobi方程，得到了求解Hamilton-Jacobi方程的数值格式。这些格式是TVD型的，在更强的条件下，基半离散格式的数值解收敛于Hamilton-Jacobi方程的粘性解。数值结果表明这类格式具有较高分辨导数间断的能力。     

定常Navier-Stokes方程的一个二步算法

建立了定常Navier-Stokes方程的一个二步算法.新算法第一步先基于P1-P0有限元配对求解一个非线性Navier-Stokes方程,第二步基于P2-P1有限元配对求解一个线性化Navier-Stokes方程.相比于经典的P2-P1有限元方法,方法可以使用较少的计算时间达到相同的收敛精度.数值分析和数值实验表明了算法的有效性.     

并行间断有限元算法求解Navier-Stokes方程

间断Galerkin有限元方法非常适合在非结构网格上高精度求解Navier-Stokes方程,然而其十分耗费计算资源.为了提高计算效率,提出了高效的MIMD并行算法.采用隐式时间离散GMRES+LU SGS格式,结合多重网格方法,当地时间步长加速算法收敛.为了保证各处理器间负载平衡,采用区域分解二级图方法划分网格,实现内存合理分配,数据只在相邻处理器间传递.数值模拟了RAE2822翼型和M6黏性绕流,加速比基本呈线性变化且接近理想值.结果表明了该算法能有效减少计算时间、合理分配内存,具有较高的加速比和并行效率,适合于MIMD粗粒度科学计算.     

GLOBAL FINITE ELEMENT NONLINEAR GALERKIN METHOD FOR THE PENALIZED NAVIER-STOKES EQUATIONS GLOBAL FINITE ELEMENT NONLINEAR GALERKIN METHOD FOR THE PENALIZED NAVIER-STOKES EQUATIONS

1. IntroductionIn the numerical simulation of the Navier-Stokes equations one encounters three seriousdifficulties in the case of large Reynolds numbers f the treatment of the incomPressibility con-dition divu = 0, the treatment of the noIilinear terms and the large time integration. For thetreatment of the incoInPressibility condition, one use the penalty method in the case of finiteelemellts [1--2l and for the treatmen of the noulinar terms and the large tfor integration, oneuse the nonlin…     

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

1．引言本文的工作主要是讨论非定常的热传导一对流问题的向后一步的Euler全离散化的非线性Galerkin混合元解的存在性及其误差估计．该工作是对山中的同一问题研究的第二部分．在第一部分［1］，我们已经讨论了此问题的半离散化的情形．由于所研究的目标都是非定常的热传导一对流问题，其背景是相同的，在此将不重复了，请参考［1］．本文的安排如下，52先回顾非定常的热传导一对流问题的混合元解的经典性质．53回顾半离散化的非线性Galerkin混合元解的性质，并导出后续讨论需要的一些关于时间导数的估计．54讨论向后一步的Euler全离散化…     

A TWO-LEVEL FINITE ELEMENT GALERKIN METHOD FOR THE NONSTATIONARY NAVIER-STOKES EQUATIONS II： TIME DISCRETIZATION

In this article we consider the fully discrete two-level finite element Galerkin method for the two-dimensional nonstationary incompressible Navier-Stokes equations. This method consists in dealing with the fully discrete nonlinear Navier-Stokes problem on a coarse mesh with width $H$ and the fully discrete linear generalized Stokes problem on a fine mesh with width $h << H$. Our results show that if we choose $H=O(h^{1/2}$) this method is as the same stability and convergence as the fully discrete standard finite element Galerkin method which needs dealing with the fully discrete nonlinear Navier-Stokes problem on a fine mesh with width $h$. However, our method is cheaper than the standard fully discrete finite element Galerkin method.     

An optimal nonlinear Galerkin method with mixed finite elements for the steady Navier‐Stokes equations

An optimal nonlinear Galerkin method with mixed finite elements is developed for solving the two‐dimensional steady incompressible Navier‐Stokes equations. This method is based on two finite element spaces X_H and X_h for the approximation of velocity, defined on a coarse grid with grid size H and a fine grid with grid size h ? H, respectively, and a finite element space M_h for the approximation of pressure. We prove that the difference in appropriate norms between the solutions of the nonlinear Galerkin method and a classical Galerkin method is of the order of H⁵. If we choose H = O(h^2/5), these two methods have a convergence rate of the same order. We numerically demonstrate that the optimal nonlinear Galerkin method is efficient and can save a large amount of computational time. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 762–775, 2003.     

非定常的热传导-对流问题的非线性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.     

A Two-Grid Finite Element Approximation for Nonlinear Time Fractional Two-Term Mixed Sub-Diffusion and Diffusion Wave Equations

In this paper, we develop a two-grid method (TGM) based on the FEM for 2D nonlinear time fractional two-term mixed sub-diffusion and diffusion wave equations. A two-grid algorithm is proposed for solving the nonlinear system, which consists of two steps: a nonlinear FE system is solved on a coarse grid, then the linearized FE system is solved on the fine grid by Newton iteration based on the coarse solution. The fully discrete numerical approximation is analyzed, where the Galerkin finite element method for the space derivatives and the finite difference scheme for the time Caputo derivative with order $\alpha\in(1,2)$ and $\alpha_{1}\in(0,1)$. Numerical stability and optimal error estimate $O(h^{r+1}+H^{2r+2}+\tau^{\min\{3-\alpha,2-\alpha_{1}\}})$ in $L^{2}$-norm are presented for two-grid scheme, where $t,$ $H$ and $h$ are the time step size, coarse grid mesh size and fine grid mesh size, respectively. Finally, numerical experiments are provided to confirm our theoretical results and effectiveness of the proposed algorithm.     

NONLINEAR GALERKIN METHOD FOR NAVIER-STOKES EQUATIONS WITH STREAM-VORTICITY FORM

I Let D be a launder domain in Rz with Lipehitz continuous bodare I'. ac consider the stream-vortidty form of hmedependent Navier-stokes Muahons describing the 'flow Of a ~ incompreSSible nuid confined in Dwhere to and & are vorticity and stream function. BecaUSe the action (1) doeS not include the differentialten z, ~ tie ~ con&tion of' dab at In tthe Paper, we give a ho element n~ Galerkin ~, acs ~ is ~ an tab finite element spaceS X. and X* for the aPPmxhaation of the ~ ac v~ fUncti…     

Two‐grid methods for semilinear interface problems

In this article, we consider two‐grid finite element methods for solving semilinear interface problems in d space dimensions, for d = 2 or d = 3. We consider semilinear problems with discontinuous diffusion coefficients, which includes problems containing subcritical, critical, and supercritical nonlinearities. We establish basic quasioptimal a priori error estimates for Galerkin approximations. We then design a two‐grid algorithm consisting of a coarse grid solver for the original nonlinear problem, and a fine grid solver for a linearized problem. We analyze the quality of approximations generated by the algorithm and show that the coarse grid may be taken to have much larger elements than the fine grid, and yet one can still obtain approximation quality that is asymptotically as good as solving the original nonlinear problem on the fine mesh. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A TWO-LEVEL FINITE ELEMENT GALERKIN METHOD FOR THE NONSTATIONARY NAVIER-STOKES EQUATIONS I： SPATIAL DISCRETIZATION

In this article we consider a two-level finite element Galerkin method using mixed finite elements for the two-dimensional nonstationary incompressible Navier-Stokes equations. The method yields a $H^1$-optimal velocity approximation and a $L_2$-optimal pressure approximation. The two-level finite element Galerkin method involves solving one small, nonlinear Navier-Stokes problem on the coarse mesh with mesh size $H$, one linear Stokes problem on the fine mesh with mesh size $h << H$. The algorithm we study produces an approximate solution with the optimal, asymptotic in $h$, accuracy.