SchurDecomposition<T>
Models & Types · AiDotNet.DecompositionMethods.MatrixDecomposition
Performs Schur decomposition on a matrix, factoring it into the product of a unitary matrix and an upper triangular matrix.
Inheritance: MatrixDecompositionBase<T> → SchurDecomposition<T>
For Beginners
Schur decomposition breaks down a complex matrix into simpler parts that are easier to work with. It’s like factoring a number (e.g., 12 = 3 * 4), but for matrices. The decomposition produces two matrices: a unitary matrix (which preserves lengths and angles) and an upper triangular matrix (which has zeros below the diagonal). This makes many calculations much simpler.
How It Works
Schur decomposition factors a matrix A into the product A = USU*, where U is a unitary matrix and S is an upper triangular matrix. This decomposition is particularly useful for computing eigenvalues and for analyzing the properties of linear transformations.
Real-world applications:
- Computing eigenvalues and eigenvectors efficiently
- Solving differential equations in engineering
- Control theory and system stability analysis
Constructors
| Constructor | Summary |
|---|---|
SchurDecomposition(Matrix<T> matrix, SchurAlgorithmType algorithm) |
Initializes a new instance of the SchurDecomposition class. |
Properties
| Property | Summary |
|---|---|
Matrix<T> SchurMatrix { get; set; } |
Gets the upper triangular Schur matrix (S) from the decomposition. |
Matrix<T> UnitaryMatrix { get; set; } |
Gets the unitary matrix (U) from the decomposition. |
Methods
| Method | Summary |
|---|---|
Matrix<T> Invert() |
Computes the inverse of the original matrix using the Schur decomposition. |
Vector<T> Solve(Vector<T> b) |
Solves a system of linear equations Ax = b using the Schur decomposition. |