Examples of numEntries()

Examples of no.uib.cipr.matrix.io.MatrixSize.numEntries()

128
129
130
131
132
133
134
135
136
137
138
            for (int i = 0; i < size.numEntries(); ++i) {
                if (row[i] != column[i])
                    set(column[i], row[i], entry[i]);
            }
        else if (info.isSkewSymmetric())
            for (int i = 0; i < size.numEntries(); ++i) {
                if (row[i] != column[i])
                    set(column[i], row[i], -entry[i]);
            }
    }
View Full Code Here

Examples of no.uib.cipr.matrix.io.MatrixSize.numEntries()

124
125
126
127
128
129
130
131
132
133
134
        // Read the entries, in either coordinate or array format
        if (info.isCoordinate()) {

            // Read coordinate data
            int nz = size.numEntries();
            int[] row = new int[nz];
            int[] column = new int[nz];
            double[] entry = new double[nz];
            r.readCoordinate(row, column, entry);
View Full Code Here

Examples of no.uib.cipr.matrix.io.MatrixSize.numEntries()

93
94
95
96
97
98
99
100
101
102
103
        MatrixSize size = r.readMatrixSize(info);
        numRows = size.numRows();
        numColumns = size.numColumns();

        // Start reading entries
        int numEntries = size.numEntries();
        int[] row = new int[numEntries];
        int[] column = new int[numEntries];
        double[] entry = new double[numEntries];
        r.readCoordinate(row, column, entry);
View Full Code Here

Examples of no.uib.cipr.matrix.io.MatrixSize.numEntries()

129
130
131
132
133
134
135
136
137
138
139
        // Create the sparse matrix structure
        construct(nz);

        // Insert the entries
        for (int i = 0; i < size.numEntries(); ++i)
            set(row[i], column[i], entry[i]);

        // Put in extra entries from symmetry or skew symmetry
        if (info.isSymmetric())
            for (int i = 0; i < numEntries; ++i) {
View Full Code Here

Examples of no.uib.cipr.matrix.io.MatrixSize.numEntries()

215
216
217
218
219
220
221
222
223
224
225
      MatrixSize size = r.readMatrixSize(info);
      numRows = size.numRows();
      numColumns = size.numColumns();
      links = new Linked();

      int nz = size.numEntries();
      int[] row = new int[nz];
      int[] column = new int[nz];
      double[] entry = new double[nz];
      r.readCoordinate(row, column, entry);
      r.add(-1, row);
View Full Code Here

Examples of no.uib.cipr.matrix.io.MatrixSize.numEntries()

91
92
93
94
95
96
97
98
99
100
101
        MatrixSize size = r.readMatrixSize(info);
        numRows = size.numRows();
        numColumns = size.numColumns();

        // Start reading entries
        int numEntries = size.numEntries();
        int[] row = new int[numEntries];
        int[] column = new int[numEntries];
        double[] entry = new double[numEntries];
        r.readCoordinate(row, column, entry);
View Full Code Here

Examples of no.uib.cipr.matrix.io.MatrixSize.numEntries()

127
128
129
130
131
132
133
134
135
136
137
        // Create the sparse matrix structure
        construct(nz);

        // Insert the entries
        for (int i = 0; i < size.numEntries(); ++i)
            set(row[i], column[i], entry[i]);

        // Put in extra entries from symmetry or skew symmetry
        if (info.isSymmetric())
            for (int i = 0; i < numEntries; ++i) {
View Full Code Here

Examples of no.uib.cipr.matrix.io.VectorSize.numEntries()

76
77
78
79
80
81
82
83
84
85
86
        // Read the entries
        if (info.isCoordinate()) {

            // Read coordinate data
            int nz = size.numEntries();
            int[] index = new int[nz];
            double[] entry = new double[nz];
            r.readCoordinate(index, entry);

            // Shift indices from 1-offset to 0-offset
View Full Code Here

Examples of types.SparseVector.numEntries()

83
84
85
86
87
88
89
90
91
92
93
    double correctUpdate = Math.exp(-alpha);
    for (int instInd = 0; instInd < trainingData.size(); instInd++) {
      ClassificationInstance inst = trainingData.get(instInd);
      for (int y = 0; y < yAlphabet.size(); y++) {
        SparseVector fv = fxy.apply(inst.x, y);
        for (int i = 0; i < fv.numEntries(); i++) {
          if (fv.getIndexAt(i) == bestFeature) {
            if (y == inst.y)
              w[instInd] *= correctUpdate;
            else
              w[instInd] *= wrongUpdate;
View Full Code Here

Examples of types.SparseVector.numEntries()

113
114
115
116
117
118
119
120
121
122
123
      ClassificationInstance inst = trainingData.get(instInd);
      total += w[instInd];
      for (int y = 0; y < yAlphabet.size(); y++) {
        SparseVector fv = fxy.apply(inst.x, y);
        if (y == inst.y) {
          for (int i = 0; i < fv.numEntries(); i++) {
            correct[fv.getIndexAt(i)] += w[instInd];
          }
        } else {
          for (int i = 0; i < fv.numEntries(); i++) {
            wrongs[fv.getIndexAt(i)] += w[instInd];
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.