|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectorg.ojalgo.matrix.jama.JamaQR
public final class JamaQR
JamaQR
| Constructor Summary | |
|---|---|
JamaQR()
|
|
| Method Summary | |
|---|---|
boolean |
compute(MatrixStore<Double> aStore)
|
boolean |
equals(BasicMatrix aMtrx,
NumberContext aCntxt)
|
boolean |
equals(MatrixStore<Double> aStore,
NumberContext aCntxt)
|
JamaMatrix |
getInverse()
The output must be a "right inverse" and a "generalised inverse". |
JamaMatrix |
getQ()
|
JamaMatrix |
getR()
|
int |
getRank()
|
MatrixStore<Double> |
invert(MatrixStore<Double> aStore)
A convenience method that produces exactly the same result as if you first call MatrixDecomposition.compute(MatrixStore) and then MatrixDecomposition.getInverse(). |
boolean |
isComputed()
|
boolean |
isFullRank()
The QR decompostion always exists, even if the matrix does not have full rank, so the compute method will never fail. |
boolean |
isFullSize()
|
boolean |
isSolvable()
|
void |
reset()
|
JamaMatrix |
solve(MatrixStore<Double> aRHS)
|
Future<DecomposeAndSolve<Double>> |
solve(MatrixStore<Double> aBody,
MatrixStore<Double> aRHS)
Will solve [aBody][X]=[aRHS] concurrently by first calling MatrixDecomposition.compute(MatrixStore) using [aBody], and then
MatrixDecomposition.solve(MatrixStore) using [aRHS]. |
String |
toString()
|
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface org.ojalgo.matrix.decomposition.MatrixDecomposition |
|---|
compute, equals, invert, solve, solve |
| Constructor Detail |
|---|
public JamaQR()
| Method Detail |
|---|
public boolean equals(MatrixStore<Double> aStore,
NumberContext aCntxt)
equals in interface MatrixDecomposition<Double>public JamaMatrix getInverse()
MatrixDecomposition
getInverse in interface MatrixDecomposition<Double>BasicMatrix.invert()public JamaMatrix getQ()
getQ in interface QR<Double>public JamaMatrix getR()
getR in interface QR<Double>public int getRank()
getRank in interface QR<Double>public boolean isComputed()
isComputed in interface MatrixDecomposition<Double>MatrixDecomposition.compute(MatrixStore),
MatrixDecomposition.isSolvable()public boolean isFullRank()
QR
isFullRank in interface QR<Double>public boolean isFullSize()
isFullSize in interface MatrixDecomposition<Double>public boolean isSolvable()
isSolvable in interface MatrixDecomposition<Double>MatrixDecomposition.solve(MatrixStore)
(computation was successful); false if notMatrixDecomposition.solve(MatrixStore),
MatrixDecomposition.isComputed()public void reset()
reset in interface MatrixDecomposition<Double>public String toString()
toString in class Objectpublic final boolean compute(MatrixStore<Double> aStore)
compute in interface MatrixDecomposition<Double>aStore - A matrix to decompose
public final boolean equals(BasicMatrix aMtrx,
NumberContext aCntxt)
equals in interface MatrixDecomposition<Double>public final MatrixStore<Double> invert(MatrixStore<Double> aStore)
MatrixDecompositionMatrixDecomposition.compute(MatrixStore) and then MatrixDecomposition.getInverse().
invert in interface MatrixDecomposition<Double>public JamaMatrix solve(MatrixStore<Double> aRHS)
solve in interface MatrixDecomposition<Double>
public final Future<DecomposeAndSolve<Double>> solve(MatrixStore<Double> aBody,
MatrixStore<Double> aRHS)
MatrixDecompositionMatrixDecomposition.compute(MatrixStore) using [aBody], and then
MatrixDecomposition.solve(MatrixStore) using [aRHS]. If either of the input [aBody]
or [aRHS] is set to null the corresponing calculation is skipped.
solve in interface MatrixDecomposition<Double>aBody - The equation system bodyaRHS - The equation system right hand side
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||