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: Successive Over-Relaxation | Statement: [Gauss–Seidel method, relatedTo, Successive Over-Relaxation]

Target entity: Successive Over-Relaxation
Context triple: [Gauss–Seidel method, relatedTo, Successive Over-Relaxation]

• 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. 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. Euler’s method for numerical integration
  Euler’s method for numerical integration is a simple first-order numerical procedure used to approximate solutions to ordinary differential equations by stepping forward in small increments.
• 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: Successive Over-Relaxation
Triple: [Gauss–Seidel method, relatedTo, 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.

Target entity: Successive Over-Relaxation
Target entity description: 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.

• 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. 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. Euler’s method for numerical integration
  Euler’s method for numerical integration is a simple first-order numerical procedure used to approximate solutions to ordinary differential equations by stepping forward in small increments.
• F. None of above. chosen