نتایج جستجو برای: galerkin approximation
تعداد نتایج: 206587 فیلتر نتایج به سال:
The aim of this paper is to develop an hp-version a posteriori error analysis for the time discretization of parabolic problems by the continuous Galerkin (cG) and the discontinuous Galerkin (dG) time-stepping methods, respectively. The resulting error estimators are fully explicit with respect to the local time-steps and approximation orders. Their performance within an hp-adaptive refinement ...
In recent years, there have been extensive efforts to find the numerical methods for solving problems with interface. The main idea of this work is to introduce an efficient truly meshless method based on the weak form for interface problems. The proposed method combines the direct meshless local Petrov–Galerkin method with the visibility criterion technique to solve the interface problems. It ...
We present the mixed Galerkin discretization of distributed parameter port-Hamiltonian systems. On the prototypical example of hyperbolic systems of two conservation laws in arbitrary spatial dimension, we derive the main contributions: (i) A weak formulation of the underlying geometric (Stokes-Dirac) structure with a segmented boundary according to the causality of the boundary ports. (ii) The...
Numerical approximations are considered for a mathematical model for miscible displacement influenced by mobile and immobile water. A mixed finite element method is adopted to give a direct approximation of the velocity, the concentration in mobile water is approximated by an alternating direction Galerkin finite element method combined with the method of characteristics and the concentration i...
The convergence and optimality theory of adaptive Galerkin methods is almost exclusively based on the Dörfler marking. This entails a fixed parameter and leads to a contraction constant bounded below away from zero. For spectral Galerkin methods this is a severe limitation which affects performance. We present a dynamic marking strategy that allows for a superlinear relation between consecutive...
In this work we present a pressure-correction scheme for the incompressible Navier–Stokes equations combining a discontinuous Galerkin approximation for the velocity and a standard continuous Galerkin approximation for the pressure. The main interest of pressure-correction algorithms is the reduced computational cost compared to monolithic strategies. In this work we show how a proper discretiz...
The fractional Fokker-Planck equation is often used to characterize anomalous diffusion. In this paper, a fully discrete approximation for the nonlinear spatial fractional Fokker-Planck equation is given, where the discontinuous Galerkin finite element approach is utilized in time domain and the Galerkin finite element approach is utilized in spatial domain. The priori error estimate is derived...
The convergence and optimality theory of adaptive Galerkin methods is almost exclusively based on the Dörfler marking. This entails a fixed parameter and leads to a contraction constant bounded below away from zero. For spectral Galerkin methods this is a severe limitation which affects performance. We present a dynamic marking strategy that allows for a superlinear relation between consecutive...
The convergence and optimality theory of adaptive Galerkin methods is almost exclusively based on the Dörfler marking. This entails a fixed parameter and leads to a contraction constant bounded below away from zero. For spectral Galerkin methods this is a severe limitation which affects performance. We present a dynamic marking strategy that allows for a superlinear relation between consecutive...
Abstract. We propose a general method for the design of Discontinuous Galerkin Methods for non stationary linear equations. The method is based on a particular splitting of the bilinear forms that appear in the weak Discontinuous Galerkin Method. We prove that an appropriate time splitting gives a stable scheme whatever the order of the polynomial approximation . Various problems can be address...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید