اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHigh-order low-storage explicit Runge-Kutta schemes for equations with quadratic nonlinearities
51
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show in this paper that third- and fourth-order low storage Runge-Kutta algorithms can be built specifically for quadratic nonlinear operators, at the expense of roughly doubling the time needed for evaluating the temporal derivatives. The resulting algorithms are especially well suited for computational fluid dynamics. Examples are given for the Henon-Heiles Hamiltonian system and, in one and two space dimensions, for the Burgers equation using both a pseudo-spectral code and a spectral element code, respectively. The scheme is also shown to be practical in three space solving the incompressible Euler equation using a fully parallelized pseudo-spectral code.
قيم البحث
اقرأ أيضاً
When evolving in time the solution of a hyperbolic partial differential equation, it is often desirable to use high order strong stability preserving (SSP) time discretizations. These time discretizations preserve the monotonicity properties satisfie
d by the spatial discretization when coupled with the first order forward Euler, under a certain time-step restriction. While the allowable time-step depends on both the spatial and temporal discretizations, the contribution of the temporal discretization can be isolated by taking the ratio of the allowable time-step of the high order method to the forward Euler time-step. This ratio is called the strong stability coefficient. The search for high order strong stability time-stepping methods with high order and large allowable time-step had been an active area of research. It is known that implicit SSP Runge-Kutta methods exist only up to sixth order. However, if we restrict ourselves to solving only linear autonomous problems, the order conditions simplify and we can find implicit SSP Runge-Kutta methods of any linear order. In the current work we aim to find very high linear order implicit SSP Runge-Kutta methods that are optimal in terms of allowable time-step. Next, we formulate an optimization problem for implicit-explicit (IMEX) SSP Runge-Kutta methods and find implicit methods with large linear stability regions that pair with known explicit SSP Runge-Kutta methods of orders plin=3,4,6 as well as optimized IMEX SSP Runge-Kutta pairs that have high linear order and nonlinear orders p=2,3,4. These methods are then tested on sample problems to verify order of convergence and to demonstrate the sharpness of the SSP coefficient and the typical behavior of these methods on test problems.
High order spatial discretizations with monotonicity properties are often desirable for the solution of hyperbolic PDEs. These methods can advantageously be coupled with high order strong stability preserving time discretizations. The search for high
order strong stability time-stepping methods with large allowable strong stability coefficient has been an active area of research over the last two decades. This research has shown that explicit SSP Runge--Kutta methods exist only up to fourth order. However, if we restrict ourselves to solving only linear autonomous problems, the order conditions simplify and this order barrier is lifted: explicit SSP Runge--Kutta methods of any linear order exist. These methods reduce to second order when applied to nonlinear problems. In the current work we aim to find explicit SSP Runge--Kutta methods with large allowable time-step, that feature high linear order and simultaneously have the optimal fourth order nonlinear order. These methods have strong stability coefficients that approach those of the linear methods as the number of stages and the linear order is increased. This work shows that when a high linear order method is desired, it may be still be worthwhile to use methods with higher nonlinear order.
We present unconditionally energy stable Runge-Kutta (RK) discontinuous Galerkin (DG) schemes for solving a class of fourth order gradient flows. Our algorithm is geared toward arbitrarily high order approximations in both space and time, while energ
y dissipation remains preserved without imposing any restriction on time steps and meshes. We achieve this in two steps. First, taking advantage of the penalty free DG method introduced by Liu and Yin [J Sci. Comput. 77:467--501, 2018] for spatial discretization, we reformulate an extended linearized ODE system by the energy quadratization (EQ) approach. Second, we apply an s-stage algebraically stable RK method for temporal discretization. The resulting fully discrete DG schemes are linear and unconditionally energy stable. In addition, we introduce a prediction-correction procedure to improve both the accuracy and stability of the scheme. We illustrate the effectiveness of the proposed schemes by numerical tests with benchmark problems.
Implicit-Explicit (IMEX) schemes are widely used for time integration methods for approximating solutions to a large class of problems. In this work, we develop accurate a posteriori error estimates of a quantity of interest for approximations obtain
ed from multi-stage IMEX schemes. This is done by first defining a finite element method that is nodally equivalent to an IMEX scheme, then using typical methods for adjoint-based error estimation. The use of a nodally equivalent finite element method allows a decomposition of the error into multiple components, each describing the effect of a different portion of the method on the total error in a quantity of interest.
We construct eight implicit-explicit (IMEX) Runge-Kutta (RK) schemes up to third order of the type in which all stages are implicit so that they can be used in the zero relaxation limit in a unified and convenient manner. These all-stages-implicit (A
SI) schemes attain the strong-stability-preserving (SSP) property in the limiting case, and two are SSP for not only the explicit part but also the implicit part and the entire IMEX scheme. Three schemes can completely recover to the designed accuracy order in two sides of the relaxation parameter for both equilibrium and non-equilibrium initial conditions. Two schemes converge nearly uniformly for equilibrium cases. These ASI schemes can be used for hyperbolic systems with stiff relaxation terms or differential equations with some type constraints.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
