TridiagonalDecomposition<T>
Models & Types ยท AiDotNet.DecompositionMethods.MatrixDecomposition
Represents a tridiagonal decomposition of a matrix, which decomposes a matrix A into QTQ^T, where Q is orthogonal and T is tridiagonal.
Inheritance: MatrixDecompositionBase<T> โ TridiagonalDecomposition<T>
For Beginners
A tridiagonal matrix is a special type of matrix where non-zero elements can only appear on the main diagonal and the diagonals directly above and below it. This decomposition transforms a complex matrix into this simpler form, making many calculations much faster and more efficient.
Constructors
| Constructor | Summary |
|---|---|
TridiagonalDecomposition(Matrix<T> matrix, TridiagonalAlgorithmType algorithm) |
Initializes a new instance of the TridiagonalDecomposition class. |
Properties
| Property | Summary |
|---|---|
Matrix<T> QMatrix { get; set; } |
Gets the orthogonal matrix Q in the decomposition A = QTQ^T. |
Matrix<T> TMatrix { get; set; } |
Gets the tridiagonal matrix T in the decomposition A = QTQ^T. |
Methods
| Method | Summary |
|---|---|
Matrix<T> Invert() |
Calculates the inverse of the original matrix A using the tridiagonal decomposition. |
ValueTuple<Matrix<T>, Matrix<T>> GetFactors() |
Returns the matrices Q and T from the decomposition A = QTQ^T. |
Vector<T> Solve(Vector<T> b) |
Solves the linear system Ax = b using the tridiagonal decomposition. |