MatrixDecompositionBase<T>
Base Classes · AiDotNet.DecompositionMethods.MatrixDecomposition
Base class for matrix decomposition algorithms that break down matrices into simpler components.
Implements: IMatrixDecomposition<T>
Known derived types: BidiagonalDecomposition<T>, CholeskyDecomposition<T>, ComplexMatrixDecomposition<T>, CramerDecomposition<T>, EigenDecomposition<T>, GramSchmidtDecomposition<T>, HessenbergDecomposition<T>, IcaDecomposition<T>, LdlDecomposition<T>, LqDecomposition<T>, LuDecomposition<T>, NmfDecomposition<T>, NormalDecomposition<T>, PolarDecomposition<T>, QrDecomposition<T>, SchurDecomposition<T>, SvdDecomposition<T>, TakagiDecomposition<T>, TridiagonalDecomposition<T>, UduDecomposition<T>
For Beginners
Matrix decomposition is like factoring a number, but for matrices. Just as we can break down 12 into 3 * 4, we can break down complex matrices into simpler matrices that are easier to work with. Different decomposition methods have different strengths and are used for different purposes in machine learning and numerical computing.
How It Works
This base class provides common functionality that all matrix decompositions need, such as:
- Storing the original matrix
- Providing numeric operations
- Implementing matrix inversion
- Solving linear systems
Properties
| Property | Summary |
|---|---|
Matrix<T> A { get; set; } |
The original matrix that was decomposed. |
Methods
| Method | Summary |
|---|---|
Matrix<T> Invert() |
Calculates the inverse of the original matrix A using the decomposition. |
Vector<T> Solve(Vector<T> b) |
Solves a linear system of equations Ax = b, where A is the decomposed matrix. |