Stabilized starting algorithms for collocation Runge-Kutta methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Symplectic Runge-Kutta Collocation Methods for Hamiltonian Wave Equations

A number of conservative PDEs, like various wave equations, allow for a multi-symplectic formulation which can be viewed as a generalization of the symplectic structure of Hamiltonian ODEs. We show that Gauss-Legendre collocation in space and time leads to multi-symplectic integrators, i.e., to numerical methods that preserve a symplectic conservation law similar to the conservation of symplect...

متن کامل

University of Cambridge Runge{kutta{collocation Methods for Systems of Functional-diierential and Functional Equations Runge{kutta{collocation Methods for Systems of Functional-diierential and Functional Equations

Systems of functional-diierential and functional equations occur in many biological, control and physics problems. They also include functional diierential equations of neutral type as special cases. In this paper we present a numerical method that is based on the continuous extension of the Runge{Kutta method (for ordinary diierential equations) and the collocation method (for functional equat...

متن کامل

Runge - Kutta Methods page RK 1 Runge - Kutta Methods

Literature For a great deal of information on Runge-Kutta methods consult J.C. Butcher, Numerical Methods for Ordinary Differential Equations, second edition, Wiley and Sons, 2008, ISBN 9780470723357. That book also has a good introduction to linear multistep methods. In these notes we refer to this books simply as Butcher. The notes were written independently of the book which accounts for som...

متن کامل

Accelerated Runge-Kutta Methods

Standard Runge-Kutta methods are explicit, one-step, and generally constant step-size numerical integrators for the solution of initial value problems. Such integration schemes of orders 3, 4, and 5 require 3, 4, and 6 function evaluations per time step of integration, respectively. In this paper, we propose a set of simple, explicit, and constant step-size Accerelated-Runge-Kutta methods that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2003

ISSN: 0898-1221

DOI: 10.1016/s0898-1221(03)80027-5