اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEmbedded (4, 5) pairs of explicit 7-stage Runge-Kutta methods with FSAL property
88
0
0.0
(
0
)
تأليف
Misha Stepanov
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Five 4-dimensional families of embedded (4, 5) pairs of explicit 7-stage Runge-Kutta methods with FSAL property (a_7j = b_j, 1 <= j <= 7, c_7 = 1) are derived. Previously known pairs satisfy simplifying assumption sum_j a_ij c_j = c_i^2 / 2, i >= 3, and constitute two of these families. Three families consist of non-FSAL pairs of 6-stage methods, as the 7th stage is not used.
قيم البحث
اقرأ أيضاً
Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were proposed and analyzed in [8]. These specially designed methods use reduced precision or the implicit computations and full precision fo
r the explicit computations. We develop a FORTRAN code to solve a nonlinear system of ordinary differential equations using the mixed precision additive Runge-Kutta (MP-ARK) methods on IBM POWER9 and Intel x86_64 chips. The convergence, accuracy, runtime, and energy consumption of these methods is explored. We show that these MP-ARK methods efficiently produce accurate solutions with significant reductions in runtime (and by extension energy consumption).
In this work we consider a mixed precision approach to accelerate the implemetation of multi-stage methods. We show that Runge-Kutta methods can be designed so that certain costly intermediate computations can be performed as a lower-precision comput
ation without adversely impacting the accuracy of the overall solution. In particular, a properly designed Runge-Kutta method will damp out the errors committed in the initial stages. This is of particular interest when we consider implicit Runge-Kutta methods. In such cases, the implicit computation of the stage values can be considerably faster if the solution can be of lower precision (or, equivalently, have a lower tolerance). We provide a general theoretical additive framework for designing mixed precision Runge-Kutta methods, and use this framework to derive order conditions for such methods. Next, we show how using this approach allows us to leverage low precision computation of the implicit solver while retaining high precision in the overall method. We present the behavior of some mixed-precision implicit Runge-Kutta methods through numerical studies, and demonstrate how the numerical results match with the theoretical framework. This novel mixed-precision implicit Runge-Kutta framework opens the door to the design of many such methods.
This study computes the gradient of a function of numerical solutions of ordinary differential equations (ODEs) with respect to the initial condition. The adjoint method computes the gradient approximately by solving the corresponding adjoint system
numerically. In this context, Sanz-Serna [SIAM Rev., 58 (2016), pp. 3--33] showed that when the initial value problem is solved by a Runge--Kutta (RK) method, the gradient can be exactly computed by applying an appropriate RK method to the adjoint system. Focusing on the case where the initial value problem is solved by a partitioned RK (PRK) method, this paper presents a numerical method, which can be seen as a generalization of PRK methods, for the adjoint system that gives the exact gradient.
We categorify the RK family of numerical integration methods (explicit and implicit). Namely we prove that if a pair of ODEs are related by an affine map then the corresponding discrete time dynamical systems are also related by the map. We show that
in practice this works well when the pairs of related ODEs come from the coupled cell networks formalism and, more generally, from fibrations of networks of manifolds.
We construct a family of embedded pairs for optimal strong stability preserving explicit Runge-Kutta methods of order $2 leq p leq 4$ to be used to obtain numerical solution of spatially discretized hyperbolic PDEs. In this construction, the goals in
clude non-defective methods, large region of absolute stability, and optimal error measurement as defined in [5,19]. The new family of embedded pairs offer the ability for strong stability preserving (SSP) methods to adapt by varying the step-size based on the local error estimation while maintaining their inherent nonlinear stability properties. Through several numerical experiments, we assess the overall effectiveness in terms of precision versus work while also taking into consideration accuracy and stability.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
