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: Givens rotations | Statement: [Bidiagonal matrix, isUsedWith, Givens rotations]

Target entity: Givens rotations
Context triple: [Bidiagonal matrix, isUsedWith, Givens rotations]

• A. 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.
• B. rotation group SO(3)
  The rotation group SO(3) is the group of all rotations in three-dimensional space, represented by 3×3 orthogonal matrices with determinant 1, and plays a central role in classical mechanics, quantum mechanics, and geometry.
• C. Schmidt orthogonalization
  Schmidt orthogonalization is a mathematical procedure, also known as the Gram–Schmidt process, that converts a set of linearly independent vectors into an orthonormal set spanning the same subspace.
• D. rotation group SU(2)
  The rotation group SU(2) is the Lie group of 2×2 unitary matrices with determinant 1 that serves as the double cover of the three-dimensional rotation group SO(3) and underlies the quantum theory of angular momentum and spin.
• E. 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.
• 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: Givens rotations
Triple: [Bidiagonal matrix, isUsedWith, Givens rotations]

Givens rotations are orthogonal transformations used in numerical linear algebra to introduce zeros into matrices, particularly for tasks like QR factorization and solving least squares problems.

Target entity: Givens rotations
Target entity description: Givens rotations are orthogonal transformations used in numerical linear algebra to introduce zeros into matrices, particularly for tasks like QR factorization and solving least squares problems.

• A. 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.
• B. rotation group SO(3)
  The rotation group SO(3) is the group of all rotations in three-dimensional space, represented by 3×3 orthogonal matrices with determinant 1, and plays a central role in classical mechanics, quantum mechanics, and geometry.
• C. Schmidt orthogonalization
  Schmidt orthogonalization is a mathematical procedure, also known as the Gram–Schmidt process, that converts a set of linearly independent vectors into an orthonormal set spanning the same subspace.
• D. rotation group SU(2)
  The rotation group SU(2) is the Lie group of 2×2 unitary matrices with determinant 1 that serves as the double cover of the three-dimensional rotation group SO(3) and underlies the quantum theory of angular momentum and spin.
• E. 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.
• F. None of above. chosen