Package no.uib.cipr.matrix

Examples of no.uib.cipr.matrix.DenseMatrix

12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
import java.io.FileWriter;

public class MatrixVectorIoTest extends TestCase {

  public void testWriteRead() throws Exception {
    DenseMatrix mat = new DenseMatrix(new double[][] {{1.1,1.2},{1.3,1.4}});
    File matrixFile = new File("TestMatrixFile");
    BufferedWriter out = new BufferedWriter(new FileWriter(matrixFile));
    MatrixVectorWriter writer = new MatrixVectorWriter(out);
    MatrixInfo mi = new MatrixInfo(false, MatrixInfo.MatrixField.Real, MatrixInfo.MatrixSymmetry.General);
    writer.printMatrixInfo(mi);
    writer.printMatrixSize(new MatrixSize(mat.numRows(), mat.numColumns(), mat.numColumns() * mat.numRows()), mi);
    writer.printArray(mat.getData());
    writer.close();
    Matrix newMat = new DenseMatrix(new MatrixVectorReader(new FileReader(matrixFile)));

    MatrixTestAbstract.assertEquals(mat, newMat);
  }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
        c.factor(L.copy());

    assert I != null;
        c.solve(I);

        Matrix J = I.mult(L, new DenseMatrix(n, n));
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j)
                if (i != j)
                    assertEquals(J.get(i, j), 0, 1e-10);
                else
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
        DenseCholesky c = new DenseCholesky(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)
            for (int j = 0; j < n; ++j)
                if (i != j)
                    assertEquals(J.get(i, j), 0, 1e-10);
                else
View Full Code Here
33
34
35
36
37
38
39
40
    @Override
    protected void createPrimary() throws Exception {
        int n = Utilities.getInt(1, max);
        int m = Utilities.getInt(1, max);
        A = new DenseMatrix(n, m);
        Ad = Utilities.populate(A);
    }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
        // The issue here is that we should not allow matrices with more than
        // Integer.MAX_VALUE entries.
        boolean exceptionThrown = false;
        try
        {
            Matrix m = new DenseMatrix(Integer.MAX_VALUE, 2);
        }
        catch (IllegalArgumentException e)
        {
            exceptionThrown = true;
        }
        finally
        {
            assertTrue(exceptionThrown);
        }

        exceptionThrown = false;
        try
        {
            Matrix m = new DenseMatrix(Integer.MAX_VALUE, 3);
        }
        catch (IllegalArgumentException e)
        {
            exceptionThrown = true;
        }
        finally
        {
            assertTrue(exceptionThrown);
        }

        exceptionThrown = false;
        try
        {
            Matrix m = new DenseMatrix(Integer.MAX_VALUE - 10, 3);
        }
        catch (IllegalArgumentException e)
        {
            exceptionThrown = true;
        }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
        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)
            for (int j = 0; j < n; ++j)
                if (i != j)
                    assertEquals(J.get(i, j), 0, 1e-10);
                else
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
        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)
            for (int j = 0; j < n; ++j)
                if (i != j)
                    assertEquals(J.get(i, j), 0, 1e-10);
                else
View Full Code Here
42
43
44
45
46
47
48
        assertEquals(A, QL.factorize(A));
    }

    public void testFactor() {
        QL ql = new QL(A.numRows(), A.numColumns());
        assertEquals(A, ql.factor(new DenseMatrix(A)));
    }
View Full Code Here
47
48
49
50
51
52
53
54
55
56
        assertEquals(A, ql.factor(new DenseMatrix(A)));
    }

    public void testRepeatFactor() {
        QL ql = new QL(A.numRows(), A.numColumns());
        ql.factor(new DenseMatrix(A));
        assertEquals(A, ql);
        ql.factor(new DenseMatrix(A));
        assertEquals(A, ql);
    }
View Full Code Here
64
65
66
67
68
69
70
        assertEquals(Ar, QL.factorize(Ar));
    }

    public void testFactorNonSquare() {
        QL ql = new QL(Ar.numRows(), Ar.numColumns());
        assertEquals(Ar, ql.factor(new DenseMatrix(Ar)));
    }
View Full Code Here
TOP

Related Classes of no.uib.cipr.matrix.DenseMatrix

  • cc.mallet.grmm.test.TestNormalFactor
  • gov.sandia.dfgleic.TSQR$TSQRIteration
  • no.uib.cipr.matrix.BandCholeskyTest
  • no.uib.cipr.matrix.BandLUTest
  • no.uib.cipr.matrix.DenseCholeskyTest
  • no.uib.cipr.matrix.DenseLUTest
  • no.uib.cipr.matrix.DenseMatrixTest
  • no.uib.cipr.matrix.distributed.DistIterativeSolverTest
  • no.uib.cipr.matrix.distributed.DistIterativeSolverTest$ColumnDistIterativeSolver
  • no.uib.cipr.matrix.distributed.DistIterativeSolverTest$RowDistIterativeSolver
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.