اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAdaptive Finite Element Solution of the Porous Medium Equation in Pressure Formulation
60
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A lack of regularity in the solution of the porous medium equation poses a serious challenge in its theoretical and numerical studies. A common strategy in theoretical studies is to utilize the pressure formulation of the equation where a new variable called the mathematical pressure is introduced. It is known that the new variable has much better regularity than the original one and Darcys law for the movement of the free boundary can be expressed naturally in this new variable. The pressure formulation has not been used in numerical studies. The goal of this work is to study its use in the adaptive finite element solution of the porous medium equation. The MMPDE moving mesh strategy is employed for adaptive mesh movement while linear finite elements are used for spatial discretization. The free boundary is traced explicitly by integrating Darcys law with the Euler scheme. Numerical results are presented for three two-dimensional examples. The method is shown to be second-order in space and first-order in time in the pressure variable. Moreover, the convergence order of the error in the location of the free boundary is almost second-order in the maximum norm. However, numerical results also show that the convergence order of the method in the original variable stays between first-order and second-order in the $L^1$ norm or between 0.5th-order and first-order in the $L^2$ norm. Nevertheless, the current method can offer some advantages over numerical methods based on the original formulation for situations with large exponents or when a more accurate location of the free boundary is desired.
قيم البحث
اقرأ أيضاً
We present a stabilized finite element method for the numerical solution of cavitation in lubrication, modeled as an inequality-constrained Reynolds equation. The cavitation model is written as a variable coefficient saddle-point problem and approxim
ated by a residual-based stabilized method. Based on our recent results on the classical obstacle problem, we present optimal a priori estimates and derive novel a posteriori error estimators. The method is implemented as a Nitsche-type finite element technique and shown in numerical computations to be superior to the usually applied penalty methods.
In this paper, we study an adaptive finite element method for a class of a nonlinear eigenvalue problems that may be of nonconvex energy functional and consider its applications to quantum chemistry. We prove the convergence of adaptive finite elemen
t approximations and present several numerical examples of micro-structure of matter calculations that support our theory.
We propose a weak Galerkin(WG) finite element method for solving the one-dimensional Burgers equation. Based on a new weak variational form, both semi-discrete and fully-discrete WG finite element schemes are established and analyzed. We prove the ex
istence of the discrete solution and derive the optimal order error estimates in the discrete $H^1$-norm and $L^2$-norm, respectively. Numerical experiments are presented to illustrate our theoretical analysis.
In this paper, we develop an iterative scheme to construct multiscale basis functions within the framework of the Constraint Energy Minimizing Generalized Multiscale Finite Element Method (CEM-GMsFEM) for the mixed formulation. The iterative procedur
e starts with the construction of an energy minimizing snapshot space that can be used for approximating the solution of the model problem. A spectral decomposition is then performed on the snapshot space to form global multiscale space. Under this setting, each global multiscale basis function can be split into a non-decaying and a decaying parts. The non-decaying part of a global basis is localized and it is fixed during the iteration. Then, one can approximate the decaying part via a modified Richardson scheme with an appropriately defined preconditioner. Using this set of iterative-based multiscale basis functions, first-order convergence with respect to the coarse mesh size can be shown if sufficiently many times of iterations with regularization parameter being in an appropriate range are performed. Numerical results are presented to illustrate the effectiveness and efficiency of the proposed computational multiscale method.
In this work, we present an adaptive unfitted finite element scheme that combines the aggregated finite element method with parallel adaptive mesh refinement. We introduce a novel scalable distributed-memory implementation of the resulting scheme on
locally-adapted Cartesian forest-of-trees meshes. We propose a two-step algorithm to construct the finite element space at hand by means of a discrete extension operator that carefully mixes aggregation constraints of problematic degrees of freedom, which get rid of the small cut cell problem, and standard hanging degree of freedom constraints, which ensure trace continuity on non-conforming meshes. Following this approach, we derive a finite element space that can be expressed as the original one plus well-defined linear constraints. Moreover, it requires minimum parallelization effort, using standard functionality available in existing large-scale finite element codes. Numerical experiments demonstrate its optimal mesh adaptation capability, robustness to cut location and parallel efficiency, on classical Poisson $hp$-adaptivity benchmarks. Our work opens the path to functional and geometrical error-driven dynamic mesh adaptation with the aggregated finite element method in large-scale realistic scenarios. Likewise, it can offer guidance for bridging other scalable unfitted methods and parallel adaptive mesh refinement.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
