اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA simplified Cauchy-Kowalewskaya procedure for the implicit solution of generalized Riemann problems of hyperbolic balance laws
110
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Cauchy-Kowalewskaya (CK) procedure is a key building block in the design of solvers for the Generalised Rieman Problem (GRP) based on Taylor series expansions in time. The CK procedure allows us to express time derivatives in terms of purely space derivatives. This is a very cumbersome procedure, which often requires the use of software manipulators. In this paper, a simplification of the CK procedure is proposed in the context of implicit Taylor series expansion for GRP, for hyperbolic balance laws in the framework of [Journal of Computational Physics 303 (2015) 146-172]. A recursive formula for the CK procedure, which is straightforwardly implemented in computational codes, is obtained. The proposed GRP solver is used in the context of the ADER approach and several one-dimensional problems are solved to demonstrate the applicability and efficiency of the present scheme. An enhancement in terms of efficiency, is obtained. Furthermore, the expected theoretical orders of accuracy are achieved, conciliating accuracy and stability.
قيم البحث
اقرأ أيضاً
This paper addresses the three concepts of textit{ consistency, stability and convergence } in the context of compact finite volume schemes for systems of nonlinear hyperbolic conservation laws. The treatment utilizes the framework of balance laws. S
uch laws express the relevant physical conservation laws in the presence of discontinuities. Finite volume approximations employ this viewpoint, and the present paper can be regarded as being in this category. It is first shown that under very mild conditions a weak solution is indeed a solution to the balance law. The schemes considered here allow the computation of several quantities per mesh cell (e.g., slopes) and the notion of consistency must be extended to this framework. Then a suitable convergence theorem is established, generalizing the classical convergence theorem of Lax and Wendroff. Finally, the limit functions are shown to be entropy solutions by using a notion of Godunov compatibility, which serves as a substitute to the entropy condition.
In this paper, we propose a hybrid finite volume Hermite weighted essentially non-oscillatory (HWENO) scheme for solving one and two dimensional hyperbolic conservation laws. The zeroth-order and the first-order moments are used in the spatial recons
truction, with total variation diminishing Runge-Kutta time discretization. The main idea of the hybrid HWENO scheme is that we first use a shock-detection technique to identify the troubled cell, then, if the cell is identified as a troubled cell, we would modify the first order moment in the troubled cell and employ HWENO reconstruction in spatial discretization; otherwise, we directly use high order linear reconstruction. Unlike other HWENO schemes, we borrow the thought of limiter for discontinuous Galerkin (DG) method to control the spurious oscillations, after this procedure, the scheme would avoid the oscillations by using HWENO reconstruction nearby discontinuities and have higher efficiency for using linear approximation straightforwardly in the smooth regions. In addition, the hybrid HWENO scheme still keeps the compactness. A collection of benchmark numerical tests for one and two dimensional cases are performed to demonstrate the numerical accuracy, high resolution and robustness of the proposed scheme.
In this paper, a fifth-order Hermite weighted essentially non-oscillatory (HWENO) scheme with artificial linear weights is proposed for one and two dimensional hyperbolic conservation laws, where the zeroth-order and the first-order moments are used
in the spatial reconstruction. We construct the HWENO methodology using a nonlinear convex combination of a high degree polynomial with several low degree polynomials, and the associated linear weights can be any artificial positive numbers with only requirement that their summation equals one. The one advantage of the HWENO scheme is its simplicity and easy extension to multi-dimension in engineering applications for we can use any artificial linear weights which are independent on geometry of mesh. The another advantage is its higher order numerical accuracy using less candidate stencils for two dimensional problems. In addition, the HWENO scheme still keeps the compactness as only immediate neighbor information is needed in the reconstruction and has high efficiency for directly using linear approximation in the smooth regions. In order to avoid nonphysical oscillations nearby strong shocks or contact discontinuities, we adopt the thought of limiter for discontinuous Galerkin method to control the spurious oscillations. Some benchmark numerical tests are performed to demonstrate the capability of the proposed scheme.
Splitting is a method to handle application problems by splitting physics, scales, domain, and so on. Many splitting algorithms have been designed for efficient temporal discretization. In this paper, our goal is to use temporal splitting concepts in
designing machine learning algorithms and, at the same time, help splitting algorithms by incorporating data and speeding them up. Since the spitting solution usually has an explicit and implicit part, we will call our method hybrid explicit-implict (HEI) learning. We will consider a recently introduced multiscale splitting algorithms. To approximate the dynamics, only a few degrees of freedom are solved implicitly, while others explicitly. In this paper, we use this splitting concept in machine learning and propose several strategies. First, the implicit part of the solution can be learned as it is more difficult to solve, while the explicit part can be computed. This provides a speed-up and data incorporation for splitting approaches. Secondly, one can design a hybrid neural network architecture because handling explicit parts requires much fewer communications among neurons and can be done efficiently. Thirdly, one can solve the coarse grid component via PDEs or other approximation methods and construct simpler neural networks for the explicit part of the solutions. We discuss these options and implement one of them by interpreting it as a machine translation task. This interpretation successfully enables us using the Transformer since it can perform model reduction for multiple time series and learn the connection. We also find that the splitting scheme is a great platform to predict the coarse solution with insufficient information of the target model: the target problem is partially given and we need to solve it through a known problem. We conduct four numerical examples and the results show that our method is stable and accurate.
The selection of time step plays a crucial role in improving stability and efficiency in the Discontinuous Galerkin (DG) solution of hyperbolic conservation laws on adaptive moving meshes that typically employs explicit stepping. A commonly used sele
ction of time step has been based on CFL conditions established for fixed and uniform meshes. This work provides a mathematical justification for those time step selection strategies used in practical adaptive DG computations. A stability analysis is presented for a moving mesh DG method for linear scalar conservation laws. Based on the analysis, a new selection strategy of the time step is proposed, which takes into consideration the coupling of the $alpha$-function (that is related to the eigenvalues of the Jacobian matrix of the flux and the mesh movement velocity) and the heights of the mesh elements. The analysis also suggests several stable combinations of the choices of the $alpha$-function in the numerical scheme and in the time step selection. Numerical results obtained with a moving mesh DG method for Burgers and Euler equations are presented.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
