共查询到18条相似文献,搜索用时 46 毫秒
1.
In this paper,a nonlinear Galerkin/Petrov-least squares mixed element (NG-PLSME) method for the stationary conduction-convection problems is presented and analyzed.The method is consistent and stable for any combination of dis-crete velocity and pressure spaces without requiring the Babuska-Brezzi stability condition.The existence, uniqueness and convergence (at optimal rate) of the NGPLSME solution is proved in the case of sufficient viscosity (or small data). 相似文献
2.
定常的热传导-对流问题的Galerkin/Petrov最小二乘混合元方法 总被引:1,自引:0,他引:1
1.引言 热传导-对流问题是大气动力学中的一个重要的方程,这个方程组也称为强迫耗散的非线性系统方程组,其较Navier-Stokes方程多了一个未知函数温度场,且温度与速度和压力之间存在着复杂的非线性关系.从热动力学可知,任何运动都会产生热量即有温度,而且温度与速度和压力之间必定互相转化,因此对该非线性系统的研究更具有实际意义.[1]先对 相似文献
3.
4.
5.
1.引言 设 R2是足够光滑的有界区域,考虑非定常的热传导-对流方程的初边值问题: 问题I.求u=(u1,u2),p,T满足:其中u是流体的速度向量,p为压力,T是温度,v>0是运动粘性系数,λ>0是Groshoff数,j=(0,1)是二维向量,x=(x1,x2). 非定常的热传导一对流方程是大气动力学中的一个重要的方程,这个方程组也称为强迫耗散的非线性系统方程组,其较Navier-Stokes方程多了一个未知函数温度场,它与速度和压力之间存在着复杂的非线性关系.从热动力学可知,任何运动都会产生… 相似文献
6.
崔明 《高等学校计算数学学报》2002,24(3):206-211
1 引 言设Ω R2为具有光滑边界的有界区域,考虑非定常的,无量纲化的,而且带有热传导的粘性不可压缩流体力学问题:问题(Ⅰ):求u=(u1,u2),p,T满足: 相似文献
7.
8.
该文给出定常的热传导-对流问题的有限元逼近的一种二重水平方法. 这种二重水平方法包括解一个小的非线性的粗网格系统、一个细网格上的线性Oseen问题和一个粗网格上的线性校正问题. 同时,给出了这种近似解的存在性和收敛性分析. 相似文献
9.
In this paper, a fully discrete format of nonlinear Galerkin mixed element method with two-step discretization of time for the non stationary conduction-convection problems is presented. The existence and the convergence of the fully discrete mixed element solution are shown. On the basis of [9] and [10], we have proved that the schemes have second-order convergence accuracy for the time discretization. 相似文献
10.
对流占优Sobolev方程的最小二乘Galerkin有限元法 总被引:5,自引:0,他引:5
郭会 《高等学校计算数学学报》2005,27(4):328-337
Sobolev方程在流体穿过裂缝岩石的渗透理论,土壤中湿气迁移问题,不同介质间的热传导问题等许多数学物理方面有着广泛的应用.在许多实际应用中,常常涉及到具有对流项Sobolev的方程.对于初值问题(1.1),[1]用标准有限元方法对此类问题进行了很好的讨论和研究.混合元方法也逐渐应用到此类问题中,参看[2]. 相似文献
11.
Yunzhang Zhang Yanren Hou Conghui Du 《Numerical Methods for Partial Differential Equations》2013,29(2):496-509
We present a posteriori error estimate for a defect correction method for approximating solutions of the stationary conduction convection problems in two dimension. The defect correction method is aiming at small viscosity ν. A reliable a posteriori error estimation is derived for the defect correction method. Finally, two numerical examples validate our theoretical results. The first example is a problem with known solution and the second example is a physical model of square cavity stationary flow. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013 相似文献
12.
L. Demkowicz J. Gopalakrishnan 《Numerical Methods for Partial Differential Equations》2011,27(1):70-105
We lay out a program for constructing discontinuous Petrov–Galerkin (DPG) schemes having test function spaces that are automatically computable to guarantee stability. Given a trial space, a DPG discretization using its optimal test space counterpart inherits stability from the well posedness of the undiscretized problem. Although the question of stable test space choice had attracted the attention of many previous authors, the novelty in our approach lies in the fact we identify a discontinuous Galerkin (DG) framework wherein test functions, arbitrarily close to the optimal ones, can be locally computed. The idea is presented abstractly and its feasibility illustrated through several theoretical and numerical examples. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010 相似文献
13.
The interpolation method by radial basis functions is used widely for solving scattered data approximation. However, sometimes it makes more sense to approximate the solution by least squares fit. This is especially true when the data are contaminated with noise. A meshfree method namely, meshless dynamic weighted least squares (MDWLS) method, is presented in this paper to solve least squares problems with noise. The MDWLS method by Gaussian radial basis function is proposed to fit scattered data with some noisy areas in the problem’s domain. Existence and uniqueness of a solution is proved. This method has one parameter which can adjusts the accuracy according to the size of noises. Another advantage of the developed method is that it can be applied to problems with nonregular geometrical domains. The new approach is applied for some problems in two dimensions and the obtained results confirm the accuracy and efficiency of the proposed method. The numerical experiments illustrate that our MDWLS method has better performance than the traditional least squares method in case of noisy data. 相似文献
14.
15.
A variant of the preconditioned conjugate gradient method to solve generalized least squares problems is presented. If the problem is min (Ax − b)TW−1(Ax − b) with A ∈ Rm×n and W ∈ Rm×m symmetric and positive definite, the method needs only a preconditioner A1 ∈ Rn×n, but not the inverse of matrix W or of any of its submatrices. Freund's comparison result for regular least squares problems is extended to generalized least squares problems. An error bound is also given. 相似文献
16.
We consider the solution of the system of linear algebraic equations which arises from the finite element discretization of boundary value problems associated to the differential operator I. The natural setting for such problems is in the Hilbert space H and the variational formulation is based on the inner product in H. We show how to construct preconditioners for these equations using both domain decomposition and multigrid techniques. These preconditioners are shown to be spectrally equivalent to the inverse of the operator. As a consequence, they may be used to precondition iterative methods so that any given error reduction may be achieved in a finite number of iterations, with the number independent of the mesh discretization. We describe applications of these results to the efficient solution of mixed and least squares finite element approximations of elliptic boundary value problems.
17.
Jean‐Pierre Croisille Isabelle Greff 《Numerical Methods for Partial Differential Equations》2002,18(3):355-373
In this article, we introduce three schemes for the Poisson problem in 2D on triangular meshes, generalizing the FVbox scheme introduced by Courbet and Croisille [1]. In this kind of scheme, the approximation is performed on the mixed form of the problem, but contrary to the standard mixed method, with a pair of trial spaces different from the pair of test spaces. The latter is made of Galerkin‐discontinuous spaces on a unique mesh. The first scheme uses as trial spaces the P1 nonconforming space of Crouzeix‐Raviart both for u and for the flux p = ?u. In the two others, the quadratic nonconforming space of Fortin and Soulie is used. An important feature of all these schemes is that they are equivalent to a first scheme in u only and an explicit representation formula for the flux p = ?u. The numerical analysis of the schemes is performed using this property. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 355–373, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/num.10003 相似文献
18.
Dana M. Bedivan George J. Fix 《Numerical Methods for Partial Differential Equations》1998,14(5):679-693
In this article least squares approximations to Volterra integral equations are considered, both with exact integration and with quadrature. Optimal error estimates are derived, and it is shown that the same order of convergence is obtained in both cases with only modest requirements on the quadrature rule used in the latter. The most important practical setting for least squares is the case of convolution kernels, and these are also studied in this article. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 679–693, 1998 相似文献