time-stepping scheme

C7231

concept

A time-stepping scheme is a numerical method that advances the solution of time-dependent equations from one discrete time level to the next.

Try in SPARQL

All labels observed (11)

Label	Occurrences
Runge–Kutta method	2
finite difference scheme	2
one-step method	2
time-stepping scheme canonical	2
explicit Runge–Kutta method	1
finite difference time discretization method	1
initial value problem solver	1
numerical scheme for stochastic differential equations	1
numerical time-stepping scheme	1
single-step method	1
stochastic numerical scheme	1

Description generation (CDg)

The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.

Instruction

generate a one-sentence description for a given conceptual class.
# Response Format
Return only the sentence: "Description: [one-sentence description of the conceptional class]"

Input

Class: time-stepping scheme

Generated description

A time-stepping scheme is a numerical method that advances the solution of time-dependent equations from one discrete time level to the next.

Instances (9)

Instance	Via concept surface
Milstein method	stochastic numerical scheme
Heun’s method	Runge–Kutta method
classical fourth-order Runge–Kutta method	Runge–Kutta method
Euler–Maruyama method	—
theta-method	numerical time-stepping scheme
Euler’s method for numerical integration	one-step method
Grigori N. Milstein surface form: Milstein method	numerical scheme for stochastic differential equations
Crank–Nicolson scheme	finite difference scheme
Lax–Wendroff method	finite difference scheme