共查询到18条相似文献，搜索用时 46 毫秒
1.
1．引言对于Navier－Stokes方程有限元数值求解方面的研究已有很多的文章和专著,多数是采用有限元Galerkin算法,例见文献[1-4]．然而,由于Navier-Stokes方程在大雷诺数时有其强的非线性性和对时间土的长期依赖性,用计算机求解Navier－Stokes方程在速度和容量方面是难以承受的．为了克服这些困难,最近人们提出了有限元非线性Galerkin算法,见文献卜8］,然而这种算法只是在某一有限时刻之后具有好的收敛速度,在初始时刻的某一区间不能达到好的收敛速度．本文应用Taylor展开技术导出了数值求解二维非定常Navier－Stokes方程的最佳… 相似文献
2.
3.
关于二维Navier-Stokes方程非线性Galerkin校正的注记 总被引：2，自引：0，他引：2
本文在对二维Navier-Stokes方程及其近似惯性流形领域估计的基础上，讨论了非线性Galerkin方法校正量的一种可能的最优选取。 相似文献
4.
引入Sobolev方程的等价积分方程,构造Sobolev方程的新的时间间断Galerkin有限元格式.该格式不仅保持有限元解在时间剖分点处的间断特性,而且避免了传统时空有限元格式中跳跃项的出现,从而降低了格式理论分析和数值模拟的复杂性.证明了Sobolev方程的时间间断而空间连续的时空有限元解的稳定性、存在唯一性、L2... 相似文献
5.
由于不可压缩Navier-Stokes方程由守恒律、扩散及约束发展方程混合构成,为测试数值方法,该文基于非结构网格,对该方程建立了DG(discontinuous Galerkin)格式,讨论了不同黏性系数υ在方腔涡流问题的数值结果,验证了该方法的有效性且不依赖于问题的维数.圆柱绕流问题的模拟结果进一步表明此方法精度高... 相似文献
6.
7.
研究对流扩散方程的时空间断Galerkin有限元方法,该方法采用时,空两个变量都允许间断的基函数,更适用于移动网格,自适应算法以及并行计算.本文利用拉格朗日欧拉方法,采用F.Brezzi数值流通量,给出对流扩散方程的间断时空有限元离散格式,并证明格式的相容性,强制性,稳定性,解的存在唯一性,以及总体误差估计. 相似文献
8.
9.
本文在初边值适当小的假设下，建立了任意三维区域中Navier－Stokes方程初边值问题整体强解的存在性定理． 相似文献
10.
11.
Ismael Herrera Robert Yates 《Numerical Methods for Partial Differential Equations》2005,21(4):672-700
Domain decomposition methods (DDM) have received much attention in recent years. They constitute the most effective means of using parallel computing resources to model continuous systems. However, combining collocation procedures with domain decomposition methods presents complications that must be overcome in order to profit from the advantages of parallel computing. The present paper belongs to a line of research in which a theory that constitutes a general and systematic formulation of discontinuous Galerkin methods (dG) is being investigated. Based on it, a new method of collocation of general applicability, TH‐collocation, was recently introduced. For a broad class of symmetric and positive continuous systems, TH‐collocation yields symmetric and positive matrices. This clears the way for applying effectively DDM and parallel computing, in combination with collocation, to such systems. In this paper the general procedure is explained with some detail and then is applied to develop an effective method for processing elliptic equations of second order. This, by the way, overcomes the difficulties encountered in a previous Herrera and Pinder's article. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005. 相似文献
12.
Bernardo Cockburn Guido Kanschat Dominik Schö tzau. 《Mathematics of Computation》2005,74(251):1067-1095
In this paper a new local discontinuous Galerkin method for the incompressible stationary Navier-Stokes equations is proposed and analyzed. Four important features render this method unique: its stability, its local conservativity, its high-order accuracy, and the exact satisfaction of the incompressibility constraint. Although the method uses completely discontinuous approximations, a globally divergence-free approximate velocity in is obtained by simple, element-by-element post-processing. Optimal error estimates are proven and an iterative procedure used to compute the approximate solution is shown to converge. This procedure is nothing but a discrete version of the classical fixed point iteration used to obtain existence and uniqueness of solutions to the incompressible Navier-Stokes equations by solving a sequence of Oseen problems. Numerical results are shown which verify the theoretical rates of convergence. They also confirm the independence of the number of fixed point iterations with respect to the discretization parameters. Finally, they show that the method works well for a wide range of Reynolds numbers.
13.
不可压缩流动的数值模拟是计算流体力学的重要组成部分. 基于有限元离散方法, 本文设计了不可压缩Navier-Stokes (N-S)方程支配流的若干并行数值算法. 这些并行算法可归为两大类: 一类是基于两重网格离散方法, 首先在粗网格上求解非线性的N-S方程, 然后在细网格的子区域上并行求解线性化的残差方程, 以校正粗网格的解; 另一类是基于新型完全重叠型区域分解技巧, 每台处理器用一局部加密的全局多尺度网格计算所负责子区域的局部有限元解. 这些并行算法实现简单, 通信需求少, 具有良好的并行性能, 能获得与标准有限元方法相同收敛阶的有限元解. 理论分析和数值试验验证了并行算法的高效性 相似文献
14.
本文给出了二维非定常N-S方程的三种数值格式,其中空间变量用谱非线性Galerkin算法进行离散,时间变量用有限差分离散,并研究了这些格式数值解的逼近精度．最后,给出了部分数值计算结果． 相似文献
15.
Daniele A. Di Pietro 《Mathematical Modelling and Numerical Analysis》2012,46(1):111-144
In this work we introduce a new class of lowest order methods for diffusive problems on general meshes with only one unknown per element. The underlying idea is to construct an incomplete piecewise affine polynomial space with optimal approximation properties starting from values at cell centers. To do so we borrow ideas from multi-point finite volume methods, although we use them in a rather different context. The incomplete polynomial space replaces classical complete polynomial spaces in discrete formulations inspired by discontinuous Galerkin methods. Two problems are studied in this work: a heterogeneous anisotropic diffusion problem, which is used to lay the pillars of the method, and the incompressible Navier-Stokes equations, which provide a more realistic application. An exhaustive theoretical study as well as a set of numerical examples featuring different difficulties are provided.https://doi.org/10.1051/m2an/2011016 相似文献
16.
A. Averbuch L. Ioffe M. Israeli L. Vozovoi 《Numerical Methods for Partial Differential Equations》1997,13(6):699-715
We present a high-order parallel algorithm, which requires only the minimum interprocessor communication dictated by the physical nature of the problem at hand. The parallelization is achieved by domain decomposition. The discretization in space is performed using the Local Fourier Basis method. The continuity conditions on the interfaces are enforced by adding homogeneous solutions. Such solutions often have fast decay properties, which can be utilized to minimize interprocessor communication. In effect, the predominant part of the computation is performed independently in the subdomains (processors) or using only local communication. A novel element of the present parallel algorithm is the incorporation of a Nonlinear Galerkin strategy to accelerate the computation and stabilize the time integration process. The basic idea of this approach consists of decomposition of the variables into large scale and small scale components with different treatment of these large and small scales. The combination of the Multidomain Fourier techniques with the Nonlinear Galerkin (NLG) algorithm is applied here to solve incompressible Navier–Stokes equations. Results are presented on direct numerical simulation of two-dimensional homogeneous turbulence using the NLG method. © 1997 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 13: 699–715, 1997 相似文献
17.
We consider a scalar advection-diffusion problem and a recently proposed discontinuous Galerkin approximation, which employs discontinuous finite element spaces and suitable bilinear forms containing interface terms that ensure consistency. For the corresponding sparse, nonsymmetric linear system, we propose and study an additive, two-level overlapping Schwarz preconditioner, consisting of a coarse problem on a coarse triangulation and local solvers associated to a family of subdomains. This is a generalization of the corresponding overlapping method for approximations on continuous finite element spaces. Related to the lack of continuity of our approximation spaces, some interesting new features arise in our generalization, which have no analog in the conforming case. We prove an upper bound for the number of iterations obtained by using this preconditioner with GMRES, which is independent of the number of degrees of freedom of the original problem and the number of subdomains. The performance of the method is illustrated by several numerical experiments for different test problems using linear finite elements in two dimensions.
18.
Imanol Garcia-Beristain Lakhdar Remaki 《Numerical Methods for Partial Differential Equations》2023,39(1):329-355
Time efficiency is one of the more critical concerns in computational fluid dynamics simulations of industrial applications. Extensive research has been conducted to improve the underlying numerical schemes to achieve time process reduction. Within this context, this paper presents a new time discretization method based on the Adomian decomposition technique for Euler equations. The obtained scheme is time-order adaptive; the order is automatically adjusted at each time step and over the space domain, leading to significant processing time reduction. The scheme is formulated in an appropriate recursive formula, and its efficiency is demonstrated through numerical tests by comparison to exact solutions and the popular Runge–Kutta-discontinuous Galerkin method. 相似文献