7374757677787980818283
public void testLowerPackCholesky() { int n = L.numRows(); PackCholesky c = new PackCholesky(n, false); c.factor(L.copy()); c.solve(I); Matrix J = I.mult(L, new DenseMatrix(n, n)); for (int i = 0; i < n; ++i)
90919293949596979899100
public void testUpperPackCholesky() { int n = U.numRows(); PackCholesky c = new PackCholesky(n, true); c.factor(U.copy()); c.solve(I); Matrix J = I.mult(U, new DenseMatrix(n, n)); for (int i = 0; i < n; ++i)
107108109110111112113114115116117
public void testLowerPackCholeskyrcond() { int n = L.numRows(); PackCholesky c = new PackCholesky(n, false); c.factor(L.copy()); c.rcond(L); } public void testUpperPackCholeskyrcond() {
116117118119120121122123124125
public void testUpperPackCholeskyrcond() { int n = U.numRows(); PackCholesky c = new PackCholesky(n, true); c.factor(U.copy()); c.rcond(U); } }