Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Lax–Richtmyer equivalence theorem | Statement: [Lax equivalence theorem, alsoKnownAs, Lax–Richtmyer equivalence theorem]

Target entity: Lax–Richtmyer equivalence theorem
Context triple: [Lax equivalence theorem, alsoKnownAs, Lax–Richtmyer equivalence theorem]

• A. Lax equivalence theorem chosen
  The Lax equivalence theorem is a fundamental result in numerical analysis stating that for a well-posed linear initial value problem, consistency and stability of a finite difference scheme together imply its convergence.
• B. 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.
• C. 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.
• D. von Neumann stability analysis
  Von Neumann stability analysis is a mathematical technique used in numerical analysis to determine the stability of finite difference schemes for solving partial differential equations by examining the growth of Fourier modes.
• 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.
• G. Unsure - the case is ambiguous/there is not enough information to decide.