اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBeyond the Runge-Kutta-Wentzel-Kramers-Brillouin method
65
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We explore higher-dimensional generalizations of the Runge-Kutta-Wentzel-Kramers-Brillouin method for integrating coupled systems of first-order ordinary differential equations with highly oscillatory solutions. Such methods could improve the performance and adaptability of the codes which are used to compute numerical solutions to the Einstein-Boltzmann equations. We test Magnus expansion-based methods on the Einstein-Boltzmann equations for a simple universe model dominated by photons with a small amount of cold dark matter. The Magnus expansion methods achieve an increase in run speed of about 50% compared to a standard Runge-Kutta integration method. A comparison of approximate solutions derived from the Magnus expansion and the Wentzel-Kramers-Brillouin (WKB) method implies the two are distinct mathematical approaches. Simple Magnus expansion solutions show inferior long range accuracy compared to WKB. However we also demonstrate how one can improve on the standard Magnus approach to obtain a new Jordan-Magnus method. This has a WKB-like performance on simple two-dimensional systems, although its higher-dimensional generalization remains elusive.
قيم البحث
اقرأ أيضاً
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.
Strong stability preserving (SSP) Runge-Kutta methods are often desired when evolving in time problems that have two components that have very different time scales. Where the SSP property is needed, it has been shown that implicit and implicit-expli
cit methods have very restrictive time-steps and are therefore not efficient. For this reason, SSP integrating factor methods may offer an attractive alternative to traditional time-stepping methods for problems with a linear component that is stiff and a nonlinear component that is not. However, the strong stability properties of integrating factor Runge-Kutta methods have not been established. In this work we show that it is possible to define explicit integrating factor Runge-Kutta methods that preserve the desired strong stability properties satisfied by each of the two components when coupled with forward Euler time-stepping, or even given weaker conditions. We define sufficient conditions for an explicit integrating factor Runge--Kutta method to be SSP, namely that they are based on explicit SSP Runge--Kutta methods with non-decreasing abscissas. We find such methods of up to fourth order and up to ten stages, analyze their SSP coefficients, and prove their optimality in a few cases. We test these methods to demonstrate their convergence and to show that the SSP time-step predicted by the theory is generally sharp, and that the non-decreasing abscissa condition is needed in our test cases. Finally, we show that on typical total variation diminishing linear and nonlinear test-cases our new explicit SSP integrating factor Runge-Kutta methods out-perform the corresponding explicit SSP Runge-Kutta methods, implicit-explicit SSP Runge--Kutta methods, and some well-known exponential time differencing methods.
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.
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).
We introduce a new class of Runge-Kutta type methods suitable for time stepping to propagate hyperbolic solutions within tent-shaped spacetime regions. Unlike standard Runge-Kutta methods, the new methods yield expected convergence properties when st
andard high order spatial (discontinuous Galerkin) discretizations are used. After presenting a derivation of nonstandard order conditions for these methods, we show numerical examples of nonlinear hyperbolic systems to demonstrate the optimal convergence rates. We also report on the discrete stability properties of these methods applied to linear hyperbolic equations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
