اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدChoice of Interior Penalty Coefficient for Interior Penalty Discontinuous Galerkin Method for Biots System by Employing Machine Learning
91
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, the optimal choice of the interior penalty parameter of the discontinuous Galerkin finite element methods for both the elliptic problems and the Biots systems are studied by utilizing the neural network and machine learning. It is crucial to choose the optimal interior penalty parameter, which is not too small or not too large for the stability, robustness, and efficiency of the numerical discretized solutions. Both linear regression and nonlinear artificial neural network methods are employed and compared using several numerical experiments to illustrate the capability of our proposed computational framework. This framework is an integral part of a developing automated numerical simulation platform because it can automatically identify the optimal interior penalty parameter. Real-time feedback could also be implemented to update and improve model accuracy on the fly.
قيم البحث
اقرأ أيضاً
In this paper we analyze the convergence properties of two-level and W-cycle multigrid solvers for the numerical solution of the linear system of equations arising from hp-version symmetric interior penalty discontinuous Galerkin discretizations of s
econd-order elliptic partial differential equations on polygonal/polyhedral meshes. We prove that the two-level method converges uniformly with respect to the granularity of the grid and the polynomial approximation degree p, provided that the number of smoothing steps, which depends on p, is chosen sufficiently large. An analogous result is obtained for the W-cycle multigrid algorithm, which is proved to be uniformly convergent with respect to the mesh size, the polynomial approximation degree, and the number of levels, provided the number of smoothing steps is chosen sufficiently large. Numerical experiments are presented which underpin the theoretical predictions; moreover, the proposed theoretical assumptions are not fully satisfied.
This paper proposes and analyzes two fully discrete mixed interior penalty discontinuous Galerkin (DG) methods for the fourth order nonlinear Cahn-Hilliard equation. Both methods use the backward Euler method for time discretization and interior pena
lty discontinuous Galerkin methods for spatial discretization. They differ from each other on how the nonlinear term is treated, one of them is based on fully implicit time-stepping and the other uses the energy-splitting time-stepping. The primary goal of the paper is to prove the convergence of the numerical interfaces of the DG methods to the interface of the Hele-Shaw flow. This is achieved by establishing error estimates that depend on $epsilon^{-1}$ only in some low polynomial orders, instead of exponential orders. Similar to [14], the crux is to prove a discrete spectrum estimate in the discontinuous Galerkin finite element space. However, the validity of such a result is not obvious because the DG space is not a subspace of the (energy) space $H^1$ and it is larger than the finite element space. This difficult is overcome by a delicate perturbation argument which relies on the discrete spectrum estimate in the finite element space proved in cite{Feng_Prohl04}. Numerical experiment results are also presented to gauge the theoretical results and the performance of the proposed fully discrete mixed DG methods.
We consider a finite element method with symmetric stabilisation for the discretisation of the transient convection--diffusion equation. For the time-discretisation we consider either the second order backwards differentiation formula or the Crank-Ni
colson method. Both the convection term and the associated stabilisation are treated explicitly using an extrapolated approximate solution. We prove stability of the method and the $tau^2 + h^{p+{frac12}}$ error estimates for the $L^2$-norm under either the standard hyperbolic CFL condition, when piecewise affine ($p=1$) approximation is used, or in the case of finite element approximation of order $p ge 1$, a stronger, so-called $4/3$-CFL, i.e. $tau leq C h^{4/3}$. The theory is illustrated with some numerical examples.
In this paper we consider the semi-discretization in space of a first order scalar transport equation. For the space discretization we use standard continuous finite elements. To obtain stability we add a penalty on the jump of the gradient over elem
ent faces. We recall some global error estimates for smooth and rough solutions and then prove a new local error estimate for the transient linear transport equation. In particular we show that in the stabilized method the effect of non-smooth features in the solution decay exponentially from the space time zone where the solution is rough so that smooth features will be transported unperturbed. Locally the $L^2$-norm error converges with the expected order $O(h^{k+frac12})$. We then illustrate the results numerically. In particular we show the good local accuracy in the smooth zone of the stabilized method and that the standard Galerkin fails to approximate a solution that is smooth at the final time if discontinuities have been present in the solution at some time during the evolution.
We present a parallel computing strategy for a hybridizable discontinuous Galerkin (HDG) nested geometric multigrid (GMG) solver. Parallel GMG solvers require a combination of coarse-grain and fine-grain parallelism to improve time to solution perfor
mance. In this work we focus on fine-grain parallelism. We use Intels second generation Xeon Phi (Knights Landing) many-core processor. The GMG method achieves ideal convergence rates of $0.2$ or less, for high polynomial orders. A matrix free (assembly free) technique is exploited to save considerable memory usage and increase arithmetic intensity. HDG enables static condensation, and due to the discontinuous nature of the discretization, we developed a matrix vector multiply routine that does not require any costly synchronizations or barriers. Our algorithm is able to attain 80% of peak bandwidth performance for higher order polynomials. This is possible due to the data locality inherent in the HDG method. Very high performance is realized for high order schemes, due to good arithmetic intensity, which declines as the order is reduced.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
