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.

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