Runge–Kutta methods

All labels observed (7)

Label	Occurrences
Runge–Kutta methods canonical	4
midpoint Runge–Kutta method	2
Lobatto Runge–Kutta methods	1
Radau Runge–Kutta methods	1
Runge–Kutta–Fehlberg methods	1
Runge–Kutta–Nyström methods	1
stochastic Runge–Kutta methods	1

How this entity was disambiguated

This entity first appeared as the object of triple T2815526 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Runge–Kutta methods
Context triple: [Euler’s method for numerical integration, isSpecialCaseOf, Runge–Kutta methods]

A. Euler’s method for numerical integration
Euler’s method for numerical integration is a simple first-order numerical procedure used to approximate solutions to ordinary differential equations by stepping forward in small increments.
B. Godunov-type schemes
Godunov-type schemes are a class of finite-volume numerical methods for solving hyperbolic conservation laws that use Riemann solvers to accurately capture shock waves and discontinuities.
C. Milstein method
The Milstein method is a numerical scheme for solving stochastic differential equations that improves on the Euler–Maruyama method by including derivative terms of the diffusion coefficient for higher accuracy.
D. Crank–Nicolson scheme
The Crank–Nicolson scheme is a finite difference method for numerically solving time-dependent partial differential equations, especially parabolic ones like the heat equation, known for its second-order accuracy and unconditional stability.
E. Euler–Maruyama method
The Euler–Maruyama method is a basic time-stepping scheme for numerically approximating solutions to stochastic differential equations, widely used in simulations of systems with noise such as Langevin dynamics.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Runge–Kutta methods
Target entity description: Runge–Kutta methods are a family of iterative techniques for numerically solving ordinary differential equations with higher accuracy than simple one-step schemes.

A. Euler’s method for numerical integration
Euler’s method for numerical integration is a simple first-order numerical procedure used to approximate solutions to ordinary differential equations by stepping forward in small increments.
B. Godunov-type schemes
Godunov-type schemes are a class of finite-volume numerical methods for solving hyperbolic conservation laws that use Riemann solvers to accurately capture shock waves and discontinuities.
C. Milstein method
The Milstein method is a numerical scheme for solving stochastic differential equations that improves on the Euler–Maruyama method by including derivative terms of the diffusion coefficient for higher accuracy.
D. Crank–Nicolson scheme
The Crank–Nicolson scheme is a finite difference method for numerically solving time-dependent partial differential equations, especially parabolic ones like the heat equation, known for its second-order accuracy and unconditional stability.
E. Euler–Maruyama method
The Euler–Maruyama method is a basic time-stepping scheme for numerically approximating solutions to stochastic differential equations, widely used in simulations of systems with noise such as Langevin dynamics.
F. None of above. chosen

Statements (50)

Predicate	Object
instanceOf	family of methods ⓘ method for ordinary differential equations ⓘ numerical method ⓘ
appliedTo	autonomous differential equations ⓘ non-autonomous differential equations ⓘ systems of ordinary differential equations ⓘ
comparedTo	Euler method ⓘ linked to: Euler’s method for numerical integration
definedBy	nodes ⓘ set of stages ⓘ stage coefficients ⓘ weights ⓘ
developedInPeriod	late 19th century ⓘ
field	numerical analysis ⓘ
hasAdvantage	flexible order selection ⓘ higher accuracy than simple Euler schemes ⓘ simple step-by-step implementation ⓘ
hasDisadvantage	implicit variants require solving nonlinear systems ⓘ may require small step sizes for stiff problems ⓘ
hasExample	Heun method ⓘ linked to: Heun’s method Ralston method ⓘ classical fourth-order Runge–Kutta method ⓘ midpoint Runge–Kutta method ⓘ linked to: Runge–Kutta methods
hasParameterization	Butcher tableau ⓘ
hasProperty	do not require past-step history ⓘ global error of order p for a pth-order method ⓘ local truncation error of order p+1 for a pth-order method ⓘ single-step dependence on previous value ⓘ
hasSubclass	Gauss–Legendre Runge–Kutta methods ⓘ linked to: Gaussian quadrature rules Lobatto Runge–Kutta methods ⓘ linked to: Runge–Kutta methods Radau Runge–Kutta methods ⓘ linked to: Runge–Kutta methods Runge–Kutta–Fehlberg methods ⓘ linked to: Runge–Kutta methods Runge–Kutta–Nyström methods ⓘ linked to: Runge–Kutta methods diagonally implicit Runge–Kutta methods ⓘ embedded Runge–Kutta methods ⓘ explicit Runge–Kutta methods ⓘ implicit Runge–Kutta methods ⓘ strong stability preserving Runge–Kutta methods ⓘ symplectic Runge–Kutta methods ⓘ
namedAfter	Carl Runge ⓘ Martin Kutta ⓘ
property	higher-order accuracy ⓘ iterative ⓘ one-step method ⓘ
relatedConcept	Butcher group ⓘ Taylor series methods ⓘ linear multistep methods ⓘ order conditions ⓘ stability region ⓘ
usedFor	initial value problems ⓘ numerical solution of ordinary differential equations ⓘ

How these facts were elicited

Referenced by (11)

Full triples — surface form annotated when it differs from this entity's canonical label.

Euler’s method for numerical integration → isSpecialCaseOf → Runge–Kutta methods ⓘ

Picard iteration → contrastWith → Runge–Kutta methods ⓘ

Godunov-type schemes → timeIntegration → Runge–Kutta methods ⓘ

Runge–Kutta methods → hasSubclass → Runge–Kutta–Fehlberg methods ⓘ