X-Git-Url: http://gitweb.fperrin.net/?p=GpsPrune.git;a=blobdiff_plain;f=tim%2Fprune%2Ffunction%2Festimate%2Fjama%2FQRDecomposition.java;fp=tim%2Fprune%2Ffunction%2Festimate%2Fjama%2FQRDecomposition.java;h=199c67e5ef1df774b62834aa13db481ac1aa7a57;hp=e8aa2b7a79d8f98f689bbf6b3357c50978f80fb2;hb=92dad5df664287acb51728e9ea599f150765d34a;hpb=81843c3d8d0771bf00d0f26034a13aa515465c78

diff --git a/tim/prune/function/estimate/jama/QRDecomposition.java b/tim/prune/function/estimate/jama/QRDecomposition.java
index e8aa2b7..199c67e 100644
--- a/tim/prune/function/estimate/jama/QRDecomposition.java
+++ b/tim/prune/function/estimate/jama/QRDecomposition.java
@@ -96,79 +96,6 @@ public class QRDecomposition
 		return true;
 	}
 
-	/**
-	 * Return the Householder vectors
-	 * @deprecated
-	 * @return Lower trapezoidal matrix whose columns define the reflections
-	 */
-	private Matrix getH()
-	{
-		Matrix X = new Matrix(_m, _n);
-		double[][] H = X.getArray();
-		for (int i = 0; i < _m; i++) {
-			for (int j = 0; j < _n; j++) {
-				if (i >= j) {
-					H[i][j] = _QR[i][j];
-				} else {
-					H[i][j] = 0.0;
-				}
-			}
-		}
-		return X;
-	}
-
-	/**
-	 * Return the upper triangular factor
-	 * @deprecated
-	 * @return R
-	 */
-	private Matrix getR()
-	{
-		Matrix X = new Matrix(_n, _n);
-		double[][] R = X.getArray();
-		for (int i = 0; i < _n; i++) {
-			for (int j = 0; j < _n; j++) {
-				if (i < j) {
-					R[i][j] = _QR[i][j];
-				} else if (i == j) {
-					R[i][j] = _Rdiag[i];
-				} else {
-					R[i][j] = 0.0;
-				}
-			}
-		}
-		return X;
-	}
-
-	/**
-	 * Generate and return the (economy-sized) orthogonal factor
-	 * @deprecated
-	 * @return Q
-	 */
-	private Matrix getQ()
-	{
-		Matrix X = new Matrix(_m, _n);
-		double[][] Q = X.getArray();
-		for (int k = _n - 1; k >= 0; k--) {
-			for (int i = 0; i < _m; i++) {
-				Q[i][k] = 0.0;
-			}
-			Q[k][k] = 1.0;
-			for (int j = k; j < _n; j++) {
-				if (_QR[k][k] != 0) {
-					double s = 0.0;
-					for (int i = k; i < _m; i++) {
-						s += _QR[i][k] * Q[i][j];
-					}
-					s = -s / _QR[k][k];
-					for (int i = k; i < _m; i++) {
-						Q[i][j] += s * _QR[i][k];
-					}
-				}
-			}
-		}
-		return X;
-	}
 
 	/**
 	 * Least squares solution of A*X = B