نتایج جستجو برای: runge kutta formula

تعداد نتایج: 96623  

2013
Appanah Rao Appadu

A new explicit fourth-order six-stage Runge-Kutta scheme with low dispersion and low dissipation properties is developed. This new Runge-Kutta scheme is shown to be more efficient in terms of dispersion and dissipation properties than existing algorithms such as Runge-Kutta temporal schemes developed by Hu et al. (1996), Mead and Renaut (1999), Tselios and Simos (2005). We perform a spectral an...

1997
Nguyen Huu Cong

The aim of this paper is to design a new family of numerical methods of arbitrarily high order for systems of rst-order diierential equations which are to be termed pseudo two-step Runge-Kutta methods. By using collocation techniques, we can obtain an arbitrarily high-order stable pseudo two-step Runge-Kutta method with any desired number of implicit stages in retaining the two-step nature. In ...

Journal: :SIAM J. Numerical Analysis 2013
Michael Herty Lorenzo Pareschi Sonja Steffensen

Implicit-explicit (IMEX) Runge-Kutta methods play a major rule in the numerical treatment of differential systems governed by stiff and non-stiff terms. This paper discusses order conditions and symplecticity properties of a class of IMEX Runge–Kutta methods in the context of optimal control problems. The analysis of the schemes is based on the continuous optimality system. Using suitable trans...

Journal: :SIAM J. Scientific Computing 2009
Inmaculada Higueras José Miguel Mantas Teo Roldán

Abstract. Space discretization of some time-dependent partial differential equations gives rise to stiff systems of ordinary differential equations. In this case, implicit methods should be used and therefore, in general, nonlinear systems must be solved. The solutions to these systems are approximated by iterative schemes and, in order to obtain an efficient code, good initializers should be u...

Journal: :Adv. Comput. Math. 2000
Piet J. van der Houwen Ben P. Sommeijer

We construct A-stable and L-stable diagonally implicit Runge-Kutta methods of which the diagonal vector in the Butcher matrix has a minimal maximum norm. If the implicit Runge-Kutta relations are iteratively solved by means of the approximately factorized Newton process, then such iterated Runge-Kutta methods are suitable methods for integrating shallow water problems in the sense that the stab...

2012
Fudziah Ismail

In this paper a new embedded Singly Diagonally Implicit Runge-Kutta Nystrom fourth order in fifth order method for solving special second order initial value problems is derived. A standard set of test problems are tested upon and comparisons on the numerical results are made when the same set of test problems are reduced to first order systems and solved using the existing embedded diagonally ...

2009
J. S. C. Prentice

The RK5GL3 method is a numerical method for solving initial value problems in ordinary differential equations, and is based on a combination of a fifth-order Runge-Kutta method and 3-point Gauss-Legendre quadrature. In this paper we describe an effective local error control algorithm for RK5GL3, which uses local extrapolation with an eighth-order Runge-Kutta method in tandem with RK5GL3, and a ...

Journal: :Automatica 2007
Kenji Kashima Yutaka Yamamoto

System theory for numerical analysis has recently become a focus of research. In this paper we regard dynamics of Newton’s method as a nonlinear feedback system and derive convergence conditions, based on the internal model principle and systems of Lur’e type. We then focus our attention on the analysis of the region of absolute stability of Runge-Kutta type methods. We derive a linear matrix i...

2007
BRETT N. RYLAND ROBERT I. MCLACHLAN

Although Runge–Kutta and partitioned Runge–Kutta methods are known to formally satisfy discrete multisymplectic conservation laws when applied to multi-Hamiltonian PDEs, they do not always lead to well-defined numerical methods. We consider the case study of the nonlinear Schrödinger equation in detail, for which the previously known multisymplectic integrators are fully implicit and based on t...

Journal: :Int. J. Comput. Math. 2010
Adrian Sandu Philipp Miehe

This paper investigates numerical methods for direct decoupled sensitivity and discrete adjoint sensitivity analysis of stiff systems based on implicit Runge Kutta schemes. Efficient implementations of tangent linear and adjoint schemes are discussed for two families of methods: fully implicit three-stage Runge Kutta and singly diagonally-implicit Runge Kutta. High computational efficiency is a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید