Package mikera.matrixx

Examples of mikera.matrixx.Matrix.unsafeSet()


//        double acc=0.0;
//        for (int k=0; k<ic; k++) {
//          acc+=a.unsafeGet(i, k)*tmp[k];
//        }
        double acc=DoubleArrays.dotProduct(a.data, i*ic, tmp, 0, ic);
        result.unsafeSet(i,j,acc);
      }
    }
    return result;   
  }
 
View Full Code Here


      for (int j=0; j<cc; j++) {
        double acc=0.0;
        for (int k=0; k<ic; k++) {
          acc+=a.unsafeGet(i, k)*b.unsafeGet(k, j);
        }
        result.unsafeSet(i,j,acc);
      }
    }
    return result;   
  }
}
View Full Code Here

    Matrix l = Matrix.create(n, n);

    for (int i = 0; i < n; i++) {
      for (int j = 0; j < i; j++) {
        l.unsafeSet(i, j, m.get(i, j));
      }
      l.unsafeSet(i, i, 1.0);
    }

    // clear low elements to ensure upper triangle only is populated
View Full Code Here

    for (int i = 0; i < n; i++) {
      for (int j = 0; j < i; j++) {
        l.unsafeSet(i, j, m.get(i, j));
      }
      l.unsafeSet(i, i, 1.0);
    }

    // clear low elements to ensure upper triangle only is populated
    Matrix u = m;
    for (int i = 0; i < n; i++) {
View Full Code Here

    // clear low elements to ensure upper triangle only is populated
    Matrix u = m;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < i; j++) {
        u.unsafeSet(i, j, 0.0);
      }
    }

    return new LUPResult (l, u, p);
  }
View Full Code Here

        int n = compact ? numSingular : numCols;

        Matrix S = Matrix.create(m,n);
       
        for( int i = 0; i < numSingular; i++ ) {
            S.unsafeSet(i,i, singularValues[i]);
        }

        return S;
    }
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.