首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
By extending Wendlands meshless Galerkin methods using RBFs, we develop mixed methods for solving fourth-order elliptic and parabolic problems by using RBFs. Similar error estimates as classical mixed finite element methods are proved. AMS subject classification 35G15, 65N12  相似文献   

2.
In a recent work, Hiptmair [Mathematisches Institut, M9404, 1994] has constructed and analyzed a family of nonconforming mixed finite elements for second-order elliptic problems. However, his analysis does not work on the lowest order elements. In this article, we show that it is possible to construct a nonconforming mixed finite element for the lowest order case. We prove the convergence and give estimates of optimal order for this finite element. Our proof is based on the use of the properties of the so-called nonconforming bubble function to control the consistency terms introduced by the nonconforming approximation. We further establish an equivalence between this mixed finite element and the nonconforming piecewise quadratic finite element of Fortin and Soulie [J. Numer. Methods Eng., 19, 505–520, 1983]. © 1997 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 13: 445–457, 1997  相似文献   

3.
研究了参数识别问题混合有限元解的最大模误差估计.利用1阶Raviart-Thomas混合有限元离散状态和对偶状态变量,利用分片线性函数逼近控制变量,获得了状态变量和控制变量的最大模误差估计,这里控制变量的收敛阶是h~2,状态变量的收敛阶是h3/2|lnh|1/2.最后利用数值算例验证了理论结果.  相似文献   

4.
A mixed finite element method is developed for a nonlinear fourth-order elliptic problem. Optimal L2 error estimates are proved by using a special interpolation operator on the standard tensor-product finite elements of order k?1. Then two iterative schemes are presented and proved to keep the same optimal error estimates. Three numerical examples are provided to support the theoretical analysis.  相似文献   

5.
We prove existence and uniqueness results for non-linear elliptic equations with lower order terms, L1 data, and mixed boundary conditions that include as particular cases the Dirichlet and the Neumann problems. Mathematics Subject Classification (2000) 35J25, 35D05, 35J70, 35J60  相似文献   

6.
The method introduced by Ennio De Giorgi and Guido Stampacchia for the study of the regularity (L p , Marcinkiewicz or C 0,α ) of the weak solutions of Dirichlet problems hinges on the handle of inequalities concerning the integral of on the subsets where |u(x)| is greater than k. In this framework, here we give a contribution with the study of the Marcinkiewicz regularity of the gradient of infinite energy solutions of Dirichlet problems with nonregular data. Dedicated to Juan Luis Vazquez for his 60th birthday (“El verano del Patriarca”, see [19]).  相似文献   

7.
We apply the boundary integral equation method and a primal mixed finite element approach to study the weak solvability and Galerkin approximations of linear interior transmission problems arising in potential theory and elastostatics. The existence and uniqueness of solution of the resulting weak formulations and of the associated discrete schemes are derived by using the classical theory for variational problems with constraints. Suitable finite element subspaces of Lagrange type satisfying the compatibility conditions are utilized for defining the Galerkin scheme. The error analysis and corresponding rates of convergence are also provided.  相似文献   

8.
After it is shown that the classical five-point mesh-centered finite difference scheme can be derived from a low-order nodal finite element scheme by using nonstandard quadrature formulae, higher-order block mesh-centered finite difference schemes for second-order elliptic problems are derived from higher-order nodal finite elements with nonstandard quadrature formulae as before, combined to a procedure known as “transverse integration.” Numerical experiments with uniform and nonuniform meshes and different types of boundary conditions confirm the theoretical predictions, in discrete as well as continuous norms. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 439–465, 1998  相似文献   

9.
Fast solution of elliptic control problems   总被引:2,自引:0,他引:2  
Elliptic control problems with a quadratic cost functional require the solution of a system of two elliptic boundary-value problems. We propose a fast iterative process for the numerical solution of this problem. The method can be applied to very special problems (for example, Poisson equation for a rectangle) as well as to general equations (arbitrary dimensions, general region). Also, nonlinear problems can be treated. The work required is proportional to the work taken by the numerical solution of a single elliptic equation.  相似文献   

10.
Based on the work of Xu and Zhou(2000),this paper makes a further discussion on conforming finite elements approximation for Steklov eigenvalue problems,and proves a local a priori error estimate and a new local a posteriori error estimate in ||·||1,Ω0 norm for conforming elements eigenfunction,which has not been studied in existing literatures.  相似文献   

11.
Bhupen Deka Department of Mathematics, Assam University, Silchar-788011, India A finite-element discretization, independent of the locationof the interface, is proposed and analysed for linear ellipticand parabolic interface problems. We establish error estimatesof optimal order in the H1-norm and almost optimal order inthe L2-norm for elliptic interface problems. An extension toparabolic interface problems is also discussed and an optimalerror estimate in the L2(0, T;H1())-norm and an almost optimalorder estimate in the L2(0, T;L2())-norm are derived for thespatially discrete scheme. A fully discrete scheme based onthe backward Euler method is analysed and an optimal order errorestimate in the L2(0, T;H1())-norm is derived. The interfacesare assumed to be of arbitrary shape and smooth for our purpose.  相似文献   

12.
The paper is devoted to verification of accuracy of approximate solutions obtained in computer simulations. This problem is strongly related to a posteriori error estimates, giving computable bounds for computational errors and detecting zones in the solution domain where such errors are too large and certain mesh refinements should be performed. A mathematical model consisting of a linear elliptic (reaction-diffusion) equation with a mixed Dirichlet/Neumann/Robin boundary condition is considered in this work. On the base of this model, we present simple technologies for straightforward constructing computable upper and lower bounds for the error, which is understood as the difference between the exact solution of the model and its approximation measured in the corresponding energy norm. The estimates obtained are completely independent of the numerical technique used to obtain approximate solutions and are “flexible” in the sense that they can be, in principle, made as close to the true error as the resources of the used computer allow. This work was supported by the Academy Research Fellowship No. 208628 from the Academy of Finland.  相似文献   

13.
In this paper, we present a mixed covolume method for parabolic equations on triangular grids. This method use the lowest order Raviart–Thomas (R–T) mixed finite element space as the trial space. We prove the optimal order of convergence for the approximate pressure and velocity in L2-norm. Furthermore, we obtain the quasi-optimal error estimates for the approximate pressure in L-norm.  相似文献   

14.
In this article, we study the semidiscrete H 1-Galerkin mixed finite element method for parabolic problems over rectangular partitions. The well-known optimal order error estimate in the L 2-norm for the flux is of order 𝒪(h k+1) (SIAM J. Numer. Anal. 35 (2), (1998), pp. 712–727), where k ≥ 1 is the order of the approximating polynomials employed in the Raviart–Thomas element. We derive a superconvergence estimate of order 𝒪(h k+3) between the H 1-Galerkin mixed finite element approximation and an appropriately defined local projection of the flux variable when k ≥ 1. A the new approximate solution for the flux with superconvergence of order 𝒪(h k+3) is realized via a postprocessing technique using local projection methods.  相似文献   

15.
Summary. The convergence rate of Krylov subspace methods for the solution of nonsymmetric systems of linear equations, such as GMRES or FOM, is studied. Bounds on the convergence rate are presented which are based on the smallest real part of the field of values of the coefficient matrix and of its inverse. Estimates for these quantities are available during the iteration from the underlying Arnoldi process. It is shown how these bounds can be used to study the convergence properties, in particular, the dependence on the mesh-size and on the size of the skew-symmetric part, for preconditioners for finite element discretizations of nonsymmetric elliptic boundary value problems. This is illustrated for the hierarchical basis and multilevel preconditioners which constitute popular preconditioning strategies for such problems. Received May 3, 1996  相似文献   

16.
    
In this paper, we will investigate the error estimates and thesuperconvergence property of mixed finite element methods for asemilinear elliptic control problem with an integral constraint oncontrol. The state and co-state are approximated by the lowest orderRaviart-Thomas mixed finite element and the control variableis approximated by piecewise constant functions. We derive somesuperconvergence properties for the control variable and the statevariables. Moreover, we derive $L^∞$- and $H^{-1}$-errorestimates both for the control variable and the state variables.Finally, a numerical example is given to demonstrate the theoreticalresults.  相似文献   

17.
    
In this article we apply the subdomain‐Galerkin/least squares method, which is first proposed by Chang and Gunzburger for first‐order elliptic systems without reaction terms in the plane, to solve second‐order non‐selfadjoint elliptic problems in two‐ and three‐dimensional bounded domains with triangular or tetrahedral regular triangulations. This method can be viewed as a combination of a direct cell vertex finite volume discretization step and an algebraic least‐squares minimization step in which the pressure is approximated by piecewise linear elements and the flux by the lowest order Raviart‐Thomas space. This combined approach has the advantages of both finite volume and least‐squares methods. Among other things, the combined method is not subject to the Ladyzhenskaya‐Babus?ka‐Brezzi condition, and the resulting linear system is symmetric and positive definite. An optimal error estimate in the H1(Ω) × H(div; Ω) norm is derived. An equivalent residual‐type a posteriori error estimator is also given. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 738–751, 2002; Published online in Wiley InterScience (www.interscience.wiley.com); DOI 10.1002/num.10030.  相似文献   

18.
19.
In recent years, competitive domain-decomposed preconditioned iterative techniques of Krylov-Schwarz type have been developed for nonsymmetric linear elliptic systems. Such systems arise when convection-diffusion-reaction problems from computational fluid dynamics or heat and mass transfer are linearized for iterative solution. Through domain decomposition, a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow effective solution on parallel machines. A central question is how to choose these small problems and how to arrange the order of their solution. Different specifications of decomposition and solution order lead to a plethora of algorithms possessing complementary advantages and disadvantages. In this report we compare several methods, including the additive Schwarz algorithm, the classical multiplicative Schwarz algorithm, an accelerated multiplicative Schwarz algorithm, the tile algorithm, the CGK algorithm, the CSPD algorithm, and also the popular global ILU-family of preconditioners, on some nonsymmetric or indefinite elliptic model problems discretized by finite difference methods. The preconditioned problems are solved by the unrestarted GMRES method. A version of the accelerated multiplicative Schwarz method is a consistently good performer.  相似文献   

20.
This paper is concerned with some theoretical foundations for adaptive numerical methods for elliptic boundary value problems. The approximation order that can be achieved by such an adaptive method is determined by certain Besov regularity of the weak solution. We study Besov regularity for second order elliptic problems in bounded domains in ℝ d . The investigations are based on intermediate Schauder estimates and on some potential theoretic framework. Moreover, we use characterizations of Besov spaces by wavelet expansions. This work has been supported by the Deutsche Forschungsgemeinschaft (Da 360/1-1)  相似文献   

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

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