اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAdditive Schwarz preconditioner for the general finite volume element discretization of symmetric elliptic problems
172
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A symmetric and a nonsymmetric variant of the additive Schwarz preconditioner are proposed for the solution of a nonsymmetric system of algebraic equations arising from a general finite volume element discretization of symmetric elliptic problems with large jumps in the entries of the coefficient matrices across subdomains. It is shown in the analysis, that the convergence of the preconditioned GMRES iteration with the proposed preconditioners, depends polylogarithmically on the mesh parameters, in other words, the convergence is only weakly dependent on the mesh parameters, and it is robust with respect to the jumps in the coefficients.
قيم البحث
اقرأ أيضاً
In this paper, we present two variants of the Additive Schwarz Method for a Crouzeix-Raviart finite volume element (CRFVE) discretization of second order elliptic problems with discontinuous coefficients where the discontinuities are only across subd
omain boundaries. One preconditioner is symmetric while the other is nonsymmetric. The proposed methods are almost optimal, in the sense that the residual error estimates for the GMRES iteration in the both cases depend only polylogarithmically on the mesh parameters.
In this paper we design and analyze a uniform preconditioner for a class of high order Discontinuous Galerkin schemes. The preconditioner is based on a space splitting involving the high order conforming subspace and results from the interpretation o
f the problem as a nearly-singular problem. We show that the proposed preconditioner exhibits spectral bounds that are uniform with respect to the discretization parameters, i.e., the mesh size, the polynomial degree and the penalization coefficient. The theoretical estimates obtained are supported by several numerical simulations.
In this paper we propose a finite element method for solving elliptic equations with the observational Dirichlet boundary data which may subject to random noises. The method is based on the weak formulation of Lagrangian multiplier. We show the conve
rgence of the random finite element error in expectation and, when the noise is sub-Gaussian, in the Orlicz 2- norm which implies the probability that the finite element error estimates are violated decays exponentially. Numerical examples are included.
An $hp$ version of interface penalty finite element method ($hp$-IPFEM) is proposed for elliptic interface problems in two and three dimensions on unfitted meshes. Error estimates in broken $H^1$ norm, which are optimal with respect to $h$ and subopt
imal with respect to $p$ by half an order of $p$, are derived. Both symmetric and non-symmetric IPFEM are considered. Error estimates in $L^2$ norm are proved by the duality argument.
We present a weak finite element method for elliptic problems in one space dimension. Our analysis shows that this method has more advantages than the known weak Galerkin method proposed for multi-dimensional problems, for example, it has higher accu
racy and the derived discrete equations can be solved locally, element by element. We derive the optimal error estimates in the discrete $H^1$-norm, the $L_2$-norm and $L_infty$-norm, respectively. Moreover, some superconvergence results are also given. Finally, numerical examples are provided to illustrate our theoretical analysis.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
