public class DecompositionRQ
extends java.lang.Object
Nude::Decomposition::RQ<> rq;
rq(A);
rq.solve(b);
DecompositionQR
,
Projection
Constructor and Description |
---|
DecompositionRQ(SimpleMatrix A)
Constructor performing the actual decomposition of a matrix
![]() |
Modifier and Type | Method and Description |
---|---|
SimpleMatrix |
getQ()
Computes the orthogonal
![]() ![]() |
SimpleMatrix |
getR()
Computes the upper-triangular
![]() ![]() |
boolean |
isFullRank()
Specifies whether the input Matrix
![]() |
SimpleMatrix |
solve(SimpleMatrix B)
Computes solution Matrix
![]() ![]() |
SimpleVector |
solve(SimpleVector b)
Computes solution Vector
![]() ![]() |
public DecompositionRQ(SimpleMatrix A)
solve(SimpleVector b)
, solve(SimpleMatrix B)
,
getQ()
, and getR()
) can be used multiple times without having
to recompute the decomposition.A
- The Matrix to be decomposed.public boolean isFullRank()
public SimpleVector solve(SimpleVector b)
Remark: If you want to further improve the accuracy of your solution in case (1),
perform a correction step in the following manner:
x = rq.solve(b);
x += rq.solve(b - A*x);
b
- The right-hand-side Vector.solve(SimpleMatrix)
public SimpleMatrix solve(SimpleMatrix B)
B
- The right-hand-side Matrix for which a solution is computed column-wise.solve(SimpleVector)
public SimpleMatrix getR()
getQ()
,
solve(SimpleVector)
,
solve(SimpleMatrix)
public SimpleMatrix getQ()
getR()
,
solve(SimpleVector)
,
solve(SimpleMatrix)