Lax–Friedrichs scheme
E1100052
UNEXPLORED
The Lax–Friedrichs scheme is a numerical method for approximating solutions to hyperbolic partial differential equations, known for its simplicity and strong stability properties.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Lax–Friedrichs finite difference scheme | 1 |
| Lax–Friedrichs method | 1 |
| Lax–Friedrichs scheme canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T14430232 — 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: Lax–Friedrichs scheme Context triple: [Kurt Friedrichs, notableWork, Lax–Friedrichs scheme]
-
A.
Lax–Wendroff method
The Lax–Wendroff method is a numerical scheme for solving hyperbolic partial differential equations that achieves second-order accuracy in both space and time by using a Taylor series expansion and flux approximations.
-
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.
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.
-
D.
Courant–Friedrichs–Lewy condition
The Courant–Friedrichs–Lewy condition is a fundamental stability criterion in numerical analysis that restricts the time step size in discretized partial differential equations to ensure convergence of the computed solution.
-
E.
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.
- 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: Lax–Friedrichs scheme Target entity description: The Lax–Friedrichs scheme is a numerical method for approximating solutions to hyperbolic partial differential equations, known for its simplicity and strong stability properties.
-
A.
Lax–Wendroff method
The Lax–Wendroff method is a numerical scheme for solving hyperbolic partial differential equations that achieves second-order accuracy in both space and time by using a Taylor series expansion and flux approximations.
-
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.
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.
-
D.
Courant–Friedrichs–Lewy condition
The Courant–Friedrichs–Lewy condition is a fundamental stability criterion in numerical analysis that restricts the time step size in discretized partial differential equations to ensure convergence of the computed solution.
-
E.
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.
- F. None of above. chosen
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Lax–Friedrichs scheme
linked to: Lax–Friedrichs scheme