ترغب بنشر مسار تعليمي؟ اضغط هنا

Energy-preserving multi-symplectic Runge-Kutta methods for Hamiltonian wave equations

99   0   0.0 ( 0 )
 نشر من قبل Chuchu Chen
 تاريخ النشر 2019
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

It is well-known that a numerical method which is at the same time geometric structure-preserving and physical property-preserving cannot exist in general for Hamiltonian partial differential equations. In this paper, we present a novel class of parametric multi-symplectic Runge-Kutta methods for Hamiltonian wave equations, which can also conserve energy simultaneously in a weaker sense with a suitable parameter. The existence of such a parameter, which enforces the energy-preserving property, is proved under certain assumptions on the fixed step sizes and the fixed initial condition. We compare the proposed method with the classical multi-symplectic Runge-Kutta method in numerical experiments, which shows the remarkable energy-preserving property of the proposed method and illustrate the validity of theoretical results.

قيم البحث

اقرأ أيضاً

In this paper, a family of arbitrarily high-order structure-preserving exponential Runge-Kutta methods are developed for the nonlinear Schrodinger equation by combining the scalar auxiliary variable approach with the exponential Runge-Kutta method. B y introducing an auxiliary variable, we first transform the original model into an equivalent system which admits both mass and modified energy conservation laws. Then applying the Lawson method and the symplectic Runge-Kutta method in time, we derive a class of mass- and energy-preserving time-discrete schemes which are arbitrarily high-order in time. Numerical experiments are addressed to demonstrate the accuracy and effectiveness of the newly proposed schemes.
In this work we present a class of high order unconditionally strong stability preserving (SSP) implicit multi-derivative Runge--Kutta schemes, and SSP implicit-explicit (IMEX) multi-derivative Runge--Kutta schemes where the time-step restriction is independent of the stiff term. The unconditional SSP property for a method of order $p>2$ is unique among SSP methods, and depends on a backward-in-time assumption on the derivative of the operator. We show that this backward derivative condition is satisfied in many relevant cases where SSP IMEX schemes are desired. We devise unconditionally SSP implicit Runge--Kutta schemes of order up to $p=4$, and IMEX Runge--Kutta schemes of order up to $p=3$. For the multi-derivative IMEX schemes, we also derive and present the order conditions, which have not appeared previously. The unconditional SSP condition ensures that these methods are positivity preserving, and we present sufficient conditions under which such methods are also asymptotic preserving when applied to a range of problems, including a hyperbolic relaxation system, the Broadwell model, and the Bhatnagar-Gross-Krook (BGK) kinetic equation. We present numerical results to support the theoretical results, on a variety of problems.
224 - Zachary J. Grant 2020
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.
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.
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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا