Schur decomposition

Target entity: Schur decomposition
Context triple: [LAPACK, provides, Schur decomposition]

• A. Schmidt decomposition
  The Schmidt decomposition is a mathematical technique in functional analysis and quantum information theory that expresses a bipartite vector (such as a quantum state) as a sum of orthogonal product states with nonnegative coefficients, revealing its entanglement structure.
• 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. 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.
• D. 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.
• E. 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.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Schur decomposition
Target entity description: Schur decomposition is a matrix factorization in linear algebra that expresses a square matrix as a unitary (or orthogonal) matrix times an upper triangular matrix times the inverse of the unitary matrix, revealing its eigenvalues and simplifying many numerical computations.

• A. Schmidt decomposition
  The Schmidt decomposition is a mathematical technique in functional analysis and quantum information theory that expresses a bipartite vector (such as a quantum state) as a sum of orthogonal product states with nonnegative coefficients, revealing its entanglement structure.
• 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. 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.
• D. 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.
• E. 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.
• F. None of above. chosen