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: Cholesky factorization | Statement: [LINPACK, usesAlgorithm, Cholesky factorization]

Target entity: Cholesky factorization
Context triple: [LINPACK, usesAlgorithm, Cholesky factorization]

• A. Bartels–Stewart algorithm
  The Bartels–Stewart algorithm is a numerical linear algebra method that efficiently solves certain matrix equations, particularly Sylvester and Lyapunov equations, using Schur decompositions.
• B. Householder transformation
  The Householder transformation is a linear algebra technique that uses reflections to orthogonally transform vectors and matrices, commonly employed in QR decomposition and numerical algorithms.
• C. Jacobi eigenvalue algorithm
  The Jacobi eigenvalue algorithm is an iterative numerical method for computing all eigenvalues and eigenvectors of a real symmetric matrix by applying a sequence of orthogonal similarity transformations.
• D. Cauchy matrix
  A Cauchy matrix is a structured matrix whose entries are defined by the reciprocals of pairwise differences of two sequences, widely used in numerical analysis, interpolation, and algebra.
• E. Gaussian elimination
  Gaussian elimination is a fundamental algorithm in linear algebra used to solve systems of linear equations by systematically transforming matrices into row-echelon form.
• 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: Cholesky factorization
Triple: [LINPACK, usesAlgorithm, Cholesky factorization]

Cholesky factorization is a numerical linear algebra method that decomposes a symmetric positive-definite matrix into a product of a lower triangular matrix and its transpose, widely used for efficient solution of linear systems.

Target entity: Cholesky factorization
Target entity description: Cholesky factorization is a numerical linear algebra method that decomposes a symmetric positive-definite matrix into a product of a lower triangular matrix and its transpose, widely used for efficient solution of linear systems.

• A. Bartels–Stewart algorithm
  The Bartels–Stewart algorithm is a numerical linear algebra method that efficiently solves certain matrix equations, particularly Sylvester and Lyapunov equations, using Schur decompositions.
• B. Householder transformation
  The Householder transformation is a linear algebra technique that uses reflections to orthogonally transform vectors and matrices, commonly employed in QR decomposition and numerical algorithms.
• C. Jacobi eigenvalue algorithm
  The Jacobi eigenvalue algorithm is an iterative numerical method for computing all eigenvalues and eigenvectors of a real symmetric matrix by applying a sequence of orthogonal similarity transformations.
• D. Cauchy matrix
  A Cauchy matrix is a structured matrix whose entries are defined by the reciprocals of pairwise differences of two sequences, widely used in numerical analysis, interpolation, and algebra.
• E. Gaussian elimination
  Gaussian elimination is a fundamental algorithm in linear algebra used to solve systems of linear equations by systematically transforming matrices into row-echelon form.
• F. None of above. chosen