Skip to search formSkip to main contentSkip to account menu

Runge–Kutta methods

Known as: Runge kutta, Butcher table, Runge Kutta Method 
In numerical analysis, the Runge–Kutta methods are a family of implicit and explicit iterative methods, which includes the well-known routine called… 
Wikipedia (opens in a new tab)

Related topics

Related topics

38 relations
ApproximationBackward Euler methodBulirsch–Stoer algorithmCash–Karp method

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
On Multisymplecticity of Partitioned Runge-Kutta Methods
Previously, it has been shown that discretizing a multi-Hamiltonian PDE in space and time with partitioned Runge-Kutta methods… 
Highly Cited
2007
Highly Cited
2007
European Balancing Act
Wind power integration into power systems has two dimensions: an economical one related to optimization of the resources and a… 
2004
2004
Construction of General Linear Methods with Runge–Kutta Stability Properties
We describe the construction of explicit general linear methods of order p and stage order q=p with s=p+1 stages which achieve… 
1999
1999
The effective order of singly-implicit Runge-Kutta methods
The concept of effective order allows for the possibility that the result computed in a Runge-Kutta step is an approximation to… 
1998
1998
Stage Value Predictors and Efficient Newton Iterations in Implicit Runge-Kutta Methods
The prediction of stage values in implicit Runge--Kutta methods is important both for overall efficiency as well as for the… 
1998
1998
DESIRE: diagonally extended singly implicit Runge–Kutta effective order methods
To overcome known disadvantages in the use of singly-implicit methods in the solution of stiff differential equations, two… 
1997
1997
Dissipativity of Runge-Kutta methods in Hilbert spaces
This paper concerns the discretization by Runge-Kutta methods of the initial value problemut=f(u), under the dissipative… 
1996
1996
Variable stepsize continuous two-step Runge-Kutta methods for ordinary differential equations
A general class of variable stepsize continuous two-step Runge-Kutta methods is investigated. These methods depend on stage… 
1991
1991
On symmetric Runge-Kutta methods of high order
The usual characterization of symmetry for Runge-Kutta methods is that given by Stetter. In this paper an equivalent… 
1976
1976
Art of writing a Runge--Kutta code
The problem considered is the solution of u' = f(x,u) for x between a and b with u(a) given. Runge--Kutta methods and when to use… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)