@Override public UpperTriangDenseMatrix copy() { return new UpperTriangDenseMatrix(this); }
@Override public UpperTriangDenseMatrix copy() { return new UpperTriangDenseMatrix(this); }
/** * Returns the upper triangular factor */ public UpperTriangDenseMatrix getU() { return new UpperTriangDenseMatrix(getLU(), false); }
/** * Returns the upper triangular factor */ public UpperTriangDenseMatrix getU() { return new UpperTriangDenseMatrix(getLU(), false); }
/** * Constructor for DenseCholesky * * @param n * Matrix size * @param upper * True for decomposing an upper symmetrical matrix, false for a * lower symmetrical matrix */ public DenseCholesky(int n, boolean upper) { this.n = n; this.upper = upper; if (upper) Cu = new UpperTriangDenseMatrix(n); else Cl = new LowerTriangDenseMatrix(n); }
/** * Constructor for DenseCholesky * * @param n * Matrix size * @param upper * True for decomposing an upper symmetrical matrix, false for a * lower symmetrical matrix */ public DenseCholesky(int n, boolean upper) { this.n = n; this.upper = upper; if (upper) Cu = new UpperTriangDenseMatrix(n); else Cl = new LowerTriangDenseMatrix(n); }
/** * Constructor for OrthogonalComputer * * @param m * Number of rows * @param n * Number of columns * @param upper * True for storing an upper triangular factor, false for a lower * triangular factor */ OrthogonalComputer(int m, int n, boolean upper) { this.m = m; this.n = n; this.k = Math.min(m, n); tau = new double[k]; Q = new DenseMatrix(m, n); if (upper) { R = new UpperTriangDenseMatrix(Math.min(m, n)); L = null; } else { L = new LowerTriangDenseMatrix(Math.min(m, n)); R = null; } }
/** * Constructor for OrthogonalComputer * * @param m * Number of rows * @param n * Number of columns * @param upper * True for storing an upper triangular factor, false for a lower * triangular factor */ OrthogonalComputer(int m, int n, boolean upper) { this.m = m; this.n = n; this.k = Math.min(m, n); tau = new double[k]; Q = new DenseMatrix(m, n); if (upper) { R = new UpperTriangDenseMatrix(Math.min(m, n)); L = null; } else { L = new LowerTriangDenseMatrix(Math.min(m, n)); R = null; } }
independent = null; Matrix Q = qrp.getQ(); Matrix R = new UpperTriangDenseMatrix(qrp.getR(), false); Matrix P = qrp.getP(); DenseVector cPlusd = (DenseVector)Q.transMult(dependent, new DenseVector(dependent.size()));
independent = null; Matrix Q = qrp.getQ(); Matrix R = new UpperTriangDenseMatrix(qrp.getR(), false); Matrix P = qrp.getP(); DenseVector cPlusd = (DenseVector)Q.transMult(dependent, new DenseVector(dependent.size()));
new UpperTriangDenseMatrix(H, i, false).solve(s, s); for (int j = 0; j < i; j++) x.add(s.get(j), v[j]);
new UpperTriangDenseMatrix(H, i, false).solve(s, s); for (int j = 0; j < i; j++) x.add(s.get(j), v[j]);