In linear algebra, the Schur decomposition, or Schur triangulation, named after Issai Schur, is a matrix decomposition that expresses any complex square matrix as unitarily similar to an upper triangular matrix. The diagonal entries of that upper triangular matrix are exactly the eigenvalues of the original matrix, so the decomposition makes the full spectrum of a matrix visible directly on its diagonal. The Schur decomposition underlies many numerically stable algorithms for computing eigenvalues, since triangular matrices are far easier to work with than general ones. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
Attributed To
Source Schur Decomposition (Wikipedia)
In Branch
Source Schur Decomposition (Wikipedia)
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Schur Decomposition (Wikipedia)
In Branch: Linear Algebra, Lead sentence
In linear algebra, the Schur decomposition or Schur triangulation, named after Issai Schur, is a matrix decomposition.
Attributed To: Issai Schur, Lead paragraph
In linear algebra, the Schur decomposition or Schur triangulation, named after Issai Schur, is a matrix decomposition. It allows one to write an arbitrary
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.