Godunov's method
E680772
conservative scheme
finite volume method
method for hyperbolic partial differential equations
numerical method
shock-capturing scheme
Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
All labels observed (5)
| Label | Occurrences |
|---|---|
| Godunov's scheme | 2 |
| Godounov | 1 |
| Godunov method | 1 |
| Godunov's method canonical | 1 |
| Godunov's method for hyperbolic PDEs | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7678176 — 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: Godunov's method Context triple: [Godunov-type schemes, basedOn, Godunov's method]
-
A.
Gauss–Seidel method
The Gauss–Seidel method is an iterative numerical technique used to solve systems of linear equations, particularly in large, sparse problems arising in scientific and engineering computations.
-
B.
Picard iteration
Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
-
C.
Jacobi method
The Jacobi method is an iterative numerical algorithm used to solve systems of linear equations by repeatedly updating each variable using values from the previous iteration.
-
D.
Richardson iteration
Richardson iteration is an early iterative method for solving linear systems and other operator equations, based on repeated relaxation steps to progressively improve an approximate solution.
-
E.
Successive Over-Relaxation
Successive Over-Relaxation is an iterative numerical method that accelerates the convergence of the Gauss–Seidel algorithm for solving large systems of linear equations by introducing a relaxation factor.
- 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: Godunov's method Target entity description: Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
-
A.
Gauss–Seidel method
The Gauss–Seidel method is an iterative numerical technique used to solve systems of linear equations, particularly in large, sparse problems arising in scientific and engineering computations.
-
B.
Picard iteration
Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
-
C.
Jacobi method
The Jacobi method is an iterative numerical algorithm used to solve systems of linear equations by repeatedly updating each variable using values from the previous iteration.
-
D.
Richardson iteration
Richardson iteration is an early iterative method for solving linear systems and other operator equations, based on repeated relaxation steps to progressively improve an approximate solution.
-
E.
Successive Over-Relaxation
Successive Over-Relaxation is an iterative numerical method that accelerates the convergence of the Gauss–Seidel algorithm for solving large systems of linear equations by introducing a relaxation factor.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
conservative scheme
ⓘ
finite volume method ⓘ method for hyperbolic partial differential equations ⓘ numerical method ⓘ shock-capturing scheme ⓘ |
| appliesTo |
Euler equations of gas dynamics
ⓘ
linked to:
Euler equations
magnetohydrodynamics equations ⓘ shallow water equations ⓘ traffic flow models ⓘ |
| basedOn |
Riemann problem at cell interfaces
ⓘ
finite volume discretization ⓘ |
| canBeExtendedTo | higher-order Godunov-type schemes ⓘ |
| category |
computational fluid dynamics
ⓘ
computational physics ⓘ numerical analysis ⓘ |
| computes | numerical fluxes at cell interfaces ⓘ |
| designedFor |
contact discontinuities
ⓘ
discontinuous solutions ⓘ shock waves ⓘ |
| ensures |
conservation of energy
ⓘ
conservation of mass ⓘ conservation of momentum ⓘ |
| hasOrderOfAccuracy |
first order in space
ⓘ
first order in time ⓘ |
| hasProperty |
L1-contractive for scalar convex conservation laws
ⓘ
monotone for scalar convex conservation laws ⓘ |
| introducedBy | Sergei K. Godunov ⓘ |
| introducedIn | 1959 ⓘ |
| isSpecialCaseOf |
Godunov-type finite volume schemes
ⓘ
linked to:
Godunov-type schemes
|
| namedAfter | Sergei K. Godunov ⓘ |
| preserves | conservation form of PDEs ⓘ |
| relatedTo |
ENO schemes
ⓘ
HLL Riemann solver ⓘ
linked to:
Godunov-type schemes
HLLC Riemann solver ⓘ MUSCL scheme ⓘ Roe scheme ⓘ
linked to:
Askey scheme
TVD schemes ⓘ WENO schemes ⓘ
linked to:
Godunov-type schemes
|
| requires | CFL stability condition ⓘ |
| solves | local Riemann problems at each cell interface ⓘ |
| timeDiscretization | explicit time stepping ⓘ |
| usedFor |
computational fluid dynamics
ⓘ
gas dynamics simulations ⓘ solving hyperbolic conservation laws ⓘ solving systems of hyperbolic PDEs ⓘ |
| uses |
approximate Riemann solvers
ⓘ
exact Riemann solvers ⓘ |
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: Godunov's method Description of subject: Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
Referenced by (6)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Godunov's method
subject linked to:
Godunov
linked to: Godunov's method
linked to: Godunov's method
linked to: Godunov's method
linked to: Godunov's method