QrDecomposition<T>
Models & Types ยท AiDotNet.DecompositionMethods.MatrixDecomposition
Performs QR decomposition on a matrix, factoring it into an orthogonal matrix Q and an upper triangular matrix R.
Inheritance: MatrixDecompositionBase<T> โ QrDecomposition<T>
For Beginners
QR decomposition breaks down a matrix into two parts - Q (which has perpendicular columns with length 1) and R (which is triangular with zeros below the diagonal). This is useful for solving equations and other matrix operations. Think of it like factoring a number into its prime components, but for matrices.
How It Works
QR decomposition factors a matrix A into the product of an orthogonal matrix Q and an upper triangular matrix R. This decomposition is widely used in solving linear systems, computing eigenvalues, and least squares problems. Multiple algorithms are available, each with different performance characteristics.
Real-world applications:
- Solving systems of linear equations
- Computing eigenvalues and eigenvectors
- Least squares regression in statistics
Constructors
| Constructor | Summary |
|---|---|
QrDecomposition(Matrix<T> matrix, QrAlgorithmType qrAlgorithm) |
Creates a new QR decomposition of the specified matrix. |
Properties
| Property | Summary |
|---|---|
Matrix<T> Q { get; set; } |
Gets the orthogonal matrix Q from the decomposition. |
Matrix<T> R { get; set; } |
Gets the upper triangular matrix R from the decomposition. |
Methods
| Method | Summary |
|---|---|
Vector<T> Solve(Vector<T> b) |
Solves the linear system Ax = b using the QR decomposition. |