Householder transformation

Target entity: Householder transformation
Context triple: [Schmidt orthogonalization, relatedTo, Householder transformation]

• A. 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.
• B. 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.
• 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. Walsh–Hadamard transform
  The Walsh–Hadamard transform is an orthogonal, non-sinusoidal signal transform that decomposes data into a basis of square-wave-like functions, widely used in communications, coding theory, and signal processing.
• E. Hermite normal form
  Hermite normal form is a canonical matrix form used in linear algebra and number theory to uniquely represent integer matrices and solve systems of linear Diophantine equations.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Householder transformation
Target entity description: 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.

• A. 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.
• B. 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.
• 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. Walsh–Hadamard transform
  The Walsh–Hadamard transform is an orthogonal, non-sinusoidal signal transform that decomposes data into a basis of square-wave-like functions, widely used in communications, coding theory, and signal processing.
• E. Hermite normal form
  Hermite normal form is a canonical matrix form used in linear algebra and number theory to uniquely represent integer matrices and solve systems of linear Diophantine equations.
• F. None of above. chosen