return true;\r
}\r
\r
- /**\r
- * Return the Householder vectors\r
- * @deprecated\r
- * @return Lower trapezoidal matrix whose columns define the reflections\r
- */\r
- private Matrix getH()\r
- {\r
- Matrix X = new Matrix(_m, _n);\r
- double[][] H = X.getArray();\r
- for (int i = 0; i < _m; i++) {\r
- for (int j = 0; j < _n; j++) {\r
- if (i >= j) {\r
- H[i][j] = _QR[i][j];\r
- } else {\r
- H[i][j] = 0.0;\r
- }\r
- }\r
- }\r
- return X;\r
- }\r
-\r
- /**\r
- * Return the upper triangular factor\r
- * @deprecated\r
- * @return R\r
- */\r
- private Matrix getR()\r
- {\r
- Matrix X = new Matrix(_n, _n);\r
- double[][] R = X.getArray();\r
- for (int i = 0; i < _n; i++) {\r
- for (int j = 0; j < _n; j++) {\r
- if (i < j) {\r
- R[i][j] = _QR[i][j];\r
- } else if (i == j) {\r
- R[i][j] = _Rdiag[i];\r
- } else {\r
- R[i][j] = 0.0;\r
- }\r
- }\r
- }\r
- return X;\r
- }\r
-\r
- /**\r
- * Generate and return the (economy-sized) orthogonal factor\r
- * @deprecated\r
- * @return Q\r
- */\r
- private Matrix getQ()\r
- {\r
- Matrix X = new Matrix(_m, _n);\r
- double[][] Q = X.getArray();\r
- for (int k = _n - 1; k >= 0; k--) {\r
- for (int i = 0; i < _m; i++) {\r
- Q[i][k] = 0.0;\r
- }\r
- Q[k][k] = 1.0;\r
- for (int j = k; j < _n; j++) {\r
- if (_QR[k][k] != 0) {\r
- double s = 0.0;\r
- for (int i = k; i < _m; i++) {\r
- s += _QR[i][k] * Q[i][j];\r
- }\r
- s = -s / _QR[k][k];\r
- for (int i = k; i < _m; i++) {\r
- Q[i][j] += s * _QR[i][k];\r
- }\r
- }\r
- }\r
- }\r
- return X;\r
- }\r
\r
/**\r
* Least squares solution of A*X = B\r