首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到18条相似文献,搜索用时 125 毫秒
1.
本文考虑了一种求解大Reynolds数定常Navier-Stokes方程带回溯(backtracking)技巧的两水平有限元方法.其基本思想是,首先在一粗网格上求解带有亚格子模型稳定项的Navier-Stokes方程,然后在细网格上求解一个亚格子模型稳定化的线性Newton问题,最后又回到粗网格上求解线性化的校正问题.通过适当的稳定化参数和粗细网格尺寸的选取,本文的算法能取得最优渐近收敛阶.数值实验检验了理论分析的正确性和算法的有效性.  相似文献   

2.
该文给出定常的热传导-对流问题的有限元逼近的一种二重水平方法. 这种二重水平方法包括解一个小的非线性的粗网格系统、一个细网格上的线性Oseen问题和一个粗网格上的线性校正问题. 同时,给出了这种近似解的存在性和收敛性分析.  相似文献   

3.
主要研究了一类非线性对流扩散方程的全离散特征有限元方法的两重网格算法及其误差估计.首先在网格步长为H的粗网格上计算一个较小的非线性问题,然后利用一阶牛顿迭代和粗网格解将网格步长为h的细网格上的非线性问题转化为线性问题求解.由于非线性问题的求解仅在粗网格上进行,该两重网格算法可以节省大量的计算工作量,同时具有较高的精度,证明了该两重网格算法L~2模先验误差估计结果为O(△t+h~2+H~(4-d/2)),其中d为空间维数.  相似文献   

4.
Navier-Stokes方程的一种并行两水平有限元方法   总被引:2,自引:1,他引:1  
基于区域分解技巧,提出了一种求解定常Navier-Stokes方程的并行两水平有限元方法.该方法首先在一粗网格上求解Navier-Stokes方程,然后在细网格的子区域上并行求解粗网格解的残差方程,以校正粗网格解.该方法实现简单,通信需求少.使用有限元局部误差估计,推导了并行方法所得近似解的误差界,同时通过数值算例,验证了其高效性.  相似文献   

5.
讨论了二维非定常不可压Navier-Stokes方程的两重网格方法.此方法包括在粗网格上求解一个非线性问题,在细网格上求解一个Stokes问题.采用一种新的全离散(时间离散用Crank-Nicolson格式,空间离散用混合有限元方法)格式数值求解N-S方程.证明了该全离散格式的稳定性.给出了L2误差估计.对比标准有限元方法,在保持同样精度的前提下,TGM能节省大量的计算量.  相似文献   

6.
主要针对在求解粘性Cahn-Hilliard方程时非线性项引起的时间耗时问题,提出了时间双层网格混合有限元方法.在空间上采用混合有限元方法进行离散,时间上采用Crank-Nicolson格式.首先在时间粗网格上,通过非线性牛顿迭代方法求解非线性混合有限元系统.其次基于初始迭代数值解和拉格朗日插值公式在时间细网格上求解线性混合有限元系统,然后证明了该方法的稳定性和误差估计,并通过数值算例对理论部分进行验证.结果表明,理论与数值算例相一致.  相似文献   

7.
对二维定常的不可压缩的Navier-Stokes方程的局部和并行算法进行了研究.给出的算法是多重网格和区域分解相结合的算法,它是基于两个有限元空间:粗网格上的函数空间和子区域的细网格上的函数空间.局部算法是在粗网格上求一个非线性问题,然后在细网格上求一个线性问题,并舍掉内部边界附近的误差相对较大的解.最后,基于局部算法,通过有重叠的区域分解而构造了并行算法,并且做了算法的误差分析,得到了比标准有限元方法更好的误差估计,也对算法做了数值试验,数值结果通过比较验证了本算法的高效性和合理性.  相似文献   

8.
用线性方法对半线性抛物问题进行求解。方法依赖粗、细二重网格,针对粗解在细网格上的修正提出了两种算法,算法1是乘积倍的增长精度而算法2是平方倍的增长精度,而且重复算法1、2的最后几步可以任意阶地逼近细网格上的非线性解。数值算例验证了算法的可行性和有效性。  相似文献   

9.
<正>1引言两层网格方法是用来求解非对称不定问题和非线性问题的一种非常有效的数值方法[1,2].其主要思想是,借助于两层网格空间,将细网格上的复杂问题转化为求解一个细网格空间的简单问题和一个粗网格上的问题.由于粗网格空间相对于细网格空间很小,所以减少了计算代价,并且仍能得到原问题的最优解.因此,两层网格算法被广泛研究并被用于求解多种问题,例如,求解非对称和非线性椭圆方程[1,2,3,4],非线性弹性方程[5],Navier-Stokes方程[6,7,8]及特征值问题[9,10].HSS迭代方法是求解大规模稀疏非埃尔米特正定  相似文献   

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

11.
We analyze a two grid finite element method with backtracking for the stream function formulation of the stationary Navier—Stokes equations. This two grid method involves solving one small, nonlinear coarse mesh system, one linearized system on the fine mesh and one linear correction problem on the coarse mesh. The algorithm and error analysis are presented.  相似文献   

12.
In this work, two-grid characteristic finite volume schemes for the nonlinear parabolic problem are considered. In our algorithms, the diffusion term is discretized by the finite volume method, while the temporal differentiation and advection terms are treated by the characteristic scheme. Under some conditions about the coefficients and exact solution, optimal error estimates for the numerical solution are obtained. Furthermore, the two- grid characteristic finite volume methods involve solving a nonlinear equation on coarse mesh with mesh size H, a large linear problem for the Oseen two-grid characteristic finite volume method on a fine mesh with mesh size h = O(H2) or a large linear problem for the Newton two-grid characteristic finite volume method on a fine mesh with mesh size h = 0(I log hll/2H3). These methods we studied provide the same convergence rate as that of the characteristic finite volume method, which involves solving one large nonlinear problem on a fine mesh with mesh size h. Some numerical results are presented to demonstrate the efficiency of the proposed methods.  相似文献   

13.
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.  相似文献   

14.
In this paper, we consider the effect of adding a coarse mesh correction to the two-grid algorithm for the mixed Navier–Stokes/Darcy model. The method yields both L2 and H1 optimal velocity and piezometric head approximations and an L2 optimal pressure approximation. The method involves solving one small, coupled, nonlinear coarse mesh problem, two independent subproblems (linear Navier–Stokes equation and Darcy equation) on the fine mesh, and a correction problem on the coarse mesh. Theoretical analysis and numerical tests are done to indicate the significance of this method.  相似文献   

15.
In this paper, we consider an additive Schwarz method applied to a linear, second order, nonsymmetric, indefinite problem. We discuss the solution of linear system of algebraic equations that arise from the streamline method for the above problem. An alternative linear system, which has the same solution as the system obtained by the streamline method, is derived and the GMRES method is used to solve this system. We show that the rate of convergence does not depend on the mesh size, nor on the number of local problems if the coarse mesh is fine enough.  相似文献   

16.
Navier-Stokes方程带Backtracking技巧的两重网格算法   总被引:3,自引:1,他引:2  
1 引 言考虑二维不可压 Navier-Stokes方程:  相似文献   

17.
Summary. We consider two level overlapping Schwarz domain decomposition methods for solving the finite element problems that arise from discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Standard finite element interpolation from the coarse to the fine grid may be used. Our theory requires no assumption on the substructures that constitute the whole domain, so the substructures can be of arbitrary shape and of different size. The global coarse mesh is allowed to be non-nested to the fine grid on which the discrete problem is to be solved, and neither the coarse mesh nor the fine mesh need be quasi-uniform. In addition, the domains defined by the fine and coarse grid need not be identical. The one important constraint is that the closure of the coarse grid must cover any portion of the fine grid boundary for which Neumann boundary conditions are given. In this general setting, our algorithms have the same optimal convergence rate as the usual two level overlapping domain decomposition methods on structured meshes. The condition number of the preconditioned system depends only on the (possibly small) overlap of the substructures and the size of the coarse grid, but is independent of the sizes of the subdomains. Received March 23, 1994 / Revised version received June 2, 1995  相似文献   

18.
We proposed absorbing interface conditions for the simulation of linear wave propagation on non-uniform meshes. Based on the superposition principle of second-order linear wave equations, we decompose the interface condition problem into two subproblems around the interface: for the first one the conventional artificial absorbing boundary conditions is applied, while for the second one, the local analytic solutions can be derived. The proposed interface conditions permit a two-way transmission of low-frequency waves across mesh interfaces which can be supported by both coarse and fine meshes, and perform a one-way absorption of high-frequency waves which can only be supported by fine meshes when they travel from fine mesh regions to coarse ones. Numerical examples are presented to illustrate the efficiency of the proposed absorbing interface conditions.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号