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: Godunov-type schemes | Statement: [Euler equations, solvedBy, Godunov-type schemes]

Target entity: Godunov-type schemes
Context triple: [Euler equations, solvedBy, Godunov-type schemes]

• A. 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.
• 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. 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.
• D. Lax equivalence theorem
  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.
• 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.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Godunov-type schemes
Triple: [Euler equations, solvedBy, 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.

Target entity: Godunov-type schemes
Target entity description: 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.

• A. 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.
• 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. 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.
• D. Lax equivalence theorem
  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.
• 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