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: Schur complement | Statement: [Schur algorithm, relatedTo, Schur complement]

Target entity: Schur complement
Context triple: [Schur algorithm, relatedTo, Schur complement]

• A. Schur decomposition
  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.
• B. Cauchy–Binet formula
  The Cauchy–Binet formula is a fundamental result in linear algebra that expresses the determinant of a product of two rectangular matrices as a sum of products of determinants of their square submatrices.
• C. Schur product theorem
  The Schur product theorem is a result in linear algebra stating that the entrywise (Hadamard) product of two positive semidefinite matrices is itself positive semidefinite.
• D. Bott–Duffin inverse
  The Bott–Duffin inverse is a generalized matrix inverse introduced by Raoul Bott and R. J. Duffin, used particularly in electrical network theory and linear algebra when the usual matrix inverse does not exist.
• E. Sylvester determinant
  The Sylvester determinant is a mathematical construct introduced by James Joseph Sylvester, typically referring to a determinant associated with resultants and elimination theory in algebra.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Schur complement
Target entity description: The Schur complement is a matrix operation that reduces a block-partitioned matrix to a smaller one, playing a key role in numerical linear algebra, optimization, and the analysis of matrix inverses and definiteness.

• A. Schur decomposition
  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.
• B. Cauchy–Binet formula
  The Cauchy–Binet formula is a fundamental result in linear algebra that expresses the determinant of a product of two rectangular matrices as a sum of products of determinants of their square submatrices.
• C. Schur product theorem
  The Schur product theorem is a result in linear algebra stating that the entrywise (Hadamard) product of two positive semidefinite matrices is itself positive semidefinite.
• D. Bott–Duffin inverse
  The Bott–Duffin inverse is a generalized matrix inverse introduced by Raoul Bott and R. J. Duffin, used particularly in electrical network theory and linear algebra when the usual matrix inverse does not exist.
• E. Sylvester determinant
  The Sylvester determinant is a mathematical construct introduced by James Joseph Sylvester, typically referring to a determinant associated with resultants and elimination theory in algebra.
• F. None of above. chosen