|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object mpv2.QRDecomposition
public class QRDecomposition
QR Decomposition.
For an m-by-n matrix A with m >= n, the QR decomposition is an m-by-n orthogonal matrix Q and an n-by-n upper triangular matrix R so that A = Q*R.
The QR decompostion always exists, even if the matrix does not have full rank, so the constructor will never fail. The primary use of the QR decomposition is in the least squares solution of nonsquare systems of simultaneous linear equations. This will fail if isFullRank() returns false.
Constructor Summary | |
---|---|
QRDecomposition(JamaMatrix A)
QR Decomposition, computed by Householder reflections. |
Method Summary | |
---|---|
JamaMatrix |
getH()
Return the Householder vectors |
JamaMatrix |
getQ()
Generate and return the (economy-sized) orthogonal factor |
JamaMatrix |
getR()
Return the upper triangular factor |
boolean |
isFullRank()
Is the matrix full rank? |
JamaMatrix |
solve(JamaMatrix B)
Least squares solution of A*X = B |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public QRDecomposition(JamaMatrix A)
A
- Rectangular matrixMethod Detail |
---|
public boolean isFullRank()
public JamaMatrix getH()
public JamaMatrix getR()
public JamaMatrix getQ()
public JamaMatrix solve(JamaMatrix B)
B
- A Matrix with as many rows as A and any number of columns.
java.lang.IllegalArgumentException
- Matrix row dimensions must agree.
java.lang.RuntimeException
- Matrix is rank deficient.
|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |