theta-method
E413442
family of numerical methods
finite difference time discretization method
numerical time-stepping scheme
one-step method
The theta-method is a family of numerical time-stepping schemes for solving ordinary and partial differential equations that unifies explicit, implicit, and Crank–Nicolson methods through a single weighting parameter.
All labels observed (1)
| Label | Occurrences |
|---|---|
| theta-method canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4094377 — 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: theta-method Context triple: [Crank–Nicolson scheme, relatedTo, theta-method]
-
A.
Heun’s method
Heun’s method is a second-order Runge–Kutta numerical integration technique that improves on Euler’s method by using a predictor-corrector approach to achieve greater accuracy.
-
B.
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.
-
C.
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.
-
D.
Runge–Kutta methods
Runge–Kutta methods are a family of iterative techniques for numerically solving ordinary differential equations with higher accuracy than simple one-step schemes.
-
E.
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.
- 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: theta-method Target entity description: The theta-method is a family of numerical time-stepping schemes for solving ordinary and partial differential equations that unifies explicit, implicit, and Crank–Nicolson methods through a single weighting parameter.
-
A.
Heun’s method
Heun’s method is a second-order Runge–Kutta numerical integration technique that improves on Euler’s method by using a predictor-corrector approach to achieve greater accuracy.
-
B.
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.
-
C.
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.
-
D.
Runge–Kutta methods
Runge–Kutta methods are a family of iterative techniques for numerically solving ordinary differential equations with higher accuracy than simple one-step schemes.
-
E.
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.
- F. None of above. chosen
Statements (37)
| Predicate | Object |
|---|---|
| instanceOf |
family of numerical methods
ⓘ
finite difference time discretization method ⓘ numerical time-stepping scheme ⓘ one-step method ⓘ |
| appliesTo |
initial value problems
ⓘ
ordinary differential equation systems ⓘ parabolic partial differential equations ⓘ |
| basedOn | time discretization of differential equations ⓘ |
| category | single-parameter generalization of Euler and Crank–Nicolson schemes ⓘ |
| hasParameter | theta ⓘ |
| hasParameterType | weighting parameter ⓘ |
| hasProperty |
A-stability for theta ≥ 1/2 in linear test problems
ⓘ
conditionally stable for theta < 1/2 ⓘ unconditionally stable for theta ≥ 1/2 on the linear test equation ⓘ |
| hasUpdateFormula | u_{n+1} = u_n + Δt[(1−theta) f(t_n,u_n) + theta f(t_{n+1},u_{n+1})] for ODEs ⓘ |
| implementedIn | many scientific computing libraries and PDE solvers ⓘ |
| is |
explicit method when theta = 0
ⓘ
implicit method when theta ≠ 0 ⓘ |
| orderOfAccuracy |
first order for theta ≠ 1/2
ⓘ
second order for theta = 1/2 ⓘ |
| relatedTo |
Runge–Kutta methods
ⓘ
linear multistep methods ⓘ |
| requires | solution of linear or nonlinear algebraic equations for theta ≠ 0 ⓘ |
| specialCaseAtTheta |
theta = 0 gives explicit Euler method
ⓘ
theta = 1 gives implicit Euler method ⓘ theta = 1/2 gives Crank–Nicolson method ⓘ |
| thetaInRange | 0 ≤ theta ≤ 1 ⓘ |
| tradeOffs |
accuracy versus stability controlled by theta
ⓘ
stability versus numerical damping controlled by theta ⓘ |
| unifies |
Crank–Nicolson scheme
ⓘ
surface form:
Crank–Nicolson method
explicit Euler method ⓘ implicit Euler method ⓘ |
| usedFor |
solving ordinary differential equations
ⓘ
solving partial differential equations ⓘ time integration in numerical simulations ⓘ |
| usedIn |
finite difference methods for time-dependent PDEs
ⓘ
method-of-lines discretizations ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: theta-method Description of subject: The theta-method is a family of numerical time-stepping schemes for solving ordinary and partial differential equations that unifies explicit, implicit, and Crank–Nicolson methods through a single weighting parameter.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.