public void run() { for (int c = firstColumn; --c >= lastColumn;) { ((DenseDoubleMatrix1D) viewColumn(c)).dct(scale); } } });
public void run() { for (int c = firstColumn; --c >= lastColumn;) { ((DenseDoubleMatrix1D) viewColumn(c)).dht(); } } });
/** * Creates the interpolation (prolongation) matrix based on the * non-smoothed aggregates */ private SparseCCDoubleMatrix2D createInterpolationMatrix(int[] pt, int c) { SparseCCMDoubleMatrix2D If = new SparseCCMDoubleMatrix2D(pt.length, c); for (int i = 0; i < pt.length; ++i) if (pt[i] != -1) If.setQuick(i, pt[i], 1); return (SparseCCDoubleMatrix2D) (new SparseCCDoubleMatrix2D(If.rows(), If.columns()).assign(If)); }
/** * Constructs a matrix with the given shape, each cell initialized with * zero. */ public DoubleMatrix2D make(int rows, int columns) { if (this == sparse) { return new SparseDoubleMatrix2D(rows, columns); } else { return new DenseDoubleMatrix2D(rows, columns); } }
/** * Constructs a matrix with the given shape, each cell initialized with * zero. */ public DoubleMatrix1D make(int size) { if (this == sparse) return new SparseDoubleMatrix1D(size); return new DenseDoubleMatrix1D(size); }
public void run() { for (int c = firstColumn; --c >= lastColumn;) { ((DenseDoubleMatrix1D) viewColumn(c)).idht(scale); } } });
public void run() { for (int c = firstColumn; c < lastColumn; c++) { ((DenseDoubleMatrix1D) viewColumn(c)).idct(scale); } } });
public void run() { for (int c = firstColumn; c < lastColumn; c++) { ((DenseDoubleMatrix1D) viewColumn(c)).idht(scale); } } });
public void run() { for (int c = firstColumn; --c >= lastColumn;) { ((DenseDoubleMatrix1D) viewColumn(c)).dst(scale); } } });
public void run() { for (int c = firstColumn; --c >= lastColumn;) { ((DenseDoubleMatrix1D) viewColumn(c)).idst(scale); } } });
public void run() { for (int c = firstColumn; c < lastColumn; c++) { ((DenseDoubleMatrix1D) viewColumn(c)).dht(); } } });