public class SparseDoubleMatrix2D extends DoubleMatrix2D
Implementation:
Note that this implementation is not synchronized.
Uses a OpenIntDoubleHashMap
, which is a compact and performant hashing technique.
Memory requirements:
Cells that
trimToSize()
.
worst case: memory [bytes] = (1/minLoadFactor) * nonZeros * 13.
best case: memory [bytes] = (1/maxLoadFactor) * nonZeros * 13.
Where nonZeros = cardinality() is the number of non-zero cells.
Thus, a 1000 x 1000 matrix with minLoadFactor=0.25 and maxLoadFactor=0.5 and 1000000 non-zero cells consumes between 25 MB and 50 MB.
The same 1000 x 1000 matrix with 1000 non-zero cells consumes between 25 and 50 KB.
Time complexity:
This class offers expected time complexity O(1) (i.e. constant time) for the basic operations
get, getQuick, set, setQuick and size
assuming the hash function disperses the elements properly among the buckets.
Otherwise, pathological cases, although highly improbable, can occur, degrading performance to O(N) in the worst case.
As such this sparse class is expected to have no worse time complexity than its dense counterpart DenseDoubleMatrix2D
.
However, constant factors are considerably larger.
Cells are internally addressed in row-major. Performance sensitive applications can exploit this fact. Setting values in a loop row-by-row is quicker than column-by-column, because fewer hash collisions occur. Thus
for (int row=0; row < rows; row++) { for (int column=0; column < columns; column++) { matrix.setQuick(row,column,someValue); } }is quicker than
for (int column=0; column < columns; column++) { for (int row=0; row < rows; row++) { matrix.setQuick(row,column,someValue); } }
cern.colt.map
,
OpenIntDoubleHashMap
,
Serialized FormserialVersionUID
Constructor and Description |
---|
SparseDoubleMatrix2D(double[][] values)
Constructs a matrix with a copy of the given values.
|
SparseDoubleMatrix2D(int rows,
int columns)
Constructs a matrix with a given number of rows and columns and default memory usage.
|
SparseDoubleMatrix2D(int rows,
int columns,
int initialCapacity,
double minLoadFactor,
double maxLoadFactor)
Constructs a matrix with a given number of rows and columns using memory as specified.
|
Modifier and Type | Method and Description |
---|---|
DoubleMatrix2D |
assign(double value)
Sets all cells to the state specified by value.
|
DoubleMatrix2D |
assign(DoubleFunction function)
Assigns the result of a function to each cell; x[row,col] = function(x[row,col]).
|
DoubleMatrix2D |
assign(DoubleMatrix2D source)
Replaces all cell values of the receiver with the values of another matrix.
|
DoubleMatrix2D |
assign(DoubleMatrix2D y,
DoubleDoubleFunction function)
Assigns the result of a function to each cell; x[row,col] = function(x[row,col],y[row,col]).
|
int |
cardinality()
Returns the number of cells having non-zero values.
|
void |
ensureCapacity(int minCapacity)
Ensures that the receiver can hold at least the specified number of non-zero cells without needing to allocate new internal memory.
|
DoubleMatrix2D |
forEachNonZero(IntIntDoubleFunction function)
Assigns the result of a function to each non-zero cell; x[row,col] = function(x[row,col]).
|
double |
getQuick(int row,
int column)
Returns the matrix cell value at coordinate [row,column].
|
DoubleMatrix2D |
like(int rows,
int columns)
Construct and returns a new empty matrix of the same dynamic type as the receiver, having the specified number of rows and columns.
|
DoubleMatrix1D |
like1D(int size)
Construct and returns a new 1-d matrix of the corresponding dynamic type, entirelly independent of the receiver.
|
void |
setQuick(int row,
int column,
double value)
Sets the matrix cell at coordinate [row,column] to the specified value.
|
void |
trimToSize()
Releases any superfluous memory created by explicitly putting zero values into cells formerly having non-zero values;
An application can use this operation to minimize the
storage of the receiver.
|
DoubleMatrix1D |
zMult(DoubleMatrix1D y,
DoubleMatrix1D z,
double alpha,
double beta,
boolean transposeA)
Linear algebraic matrix-vector multiplication; z = alpha * A * y + beta*z.
|
DoubleMatrix2D |
zMult(DoubleMatrix2D B,
DoubleMatrix2D C,
double alpha,
double beta,
boolean transposeA,
boolean transposeB)
Linear algebraic matrix-matrix multiplication; C = alpha * A x B + beta*C.
|
aggregate, aggregate, assign, copy, equals, equals, get, getNonZeros, like, set, toArray, toString, viewColumn, viewColumnFlip, viewDice, viewPart, viewRow, viewRowFlip, viewSelection, viewSelection, viewSorted, viewStrides, zAssign8Neighbors, zMult, zMult, zSum
checkShape, checkShape, columns, rows, size, toStringShort
clone
public SparseDoubleMatrix2D(double[][] values)
The values are copied. So subsequent changes in values are not reflected in the matrix, and vice-versa.
values
- The values to be filled into the new matrix.IllegalArgumentException
- if for any 1 <= row < values.length: values[row].length != values[row-1].length.public SparseDoubleMatrix2D(int rows, int columns)
rows
- the number of rows the matrix shall have.columns
- the number of columns the matrix shall have.IllegalArgumentException
- if rows<0 || columns<0 || (double)columns*rows > Integer.MAX_VALUE.public SparseDoubleMatrix2D(int rows, int columns, int initialCapacity, double minLoadFactor, double maxLoadFactor)
OpenIntDoubleHashMap
.rows
- the number of rows the matrix shall have.columns
- the number of columns the matrix shall have.initialCapacity
- the initial capacity of the hash map.
If not known, set initialCapacity=0 or small.minLoadFactor
- the minimum load factor of the hash map.maxLoadFactor
- the maximum load factor of the hash map.IllegalArgumentException
- if initialCapacity < 0 || (minLoadFactor < 0.0 || minLoadFactor >= 1.0) || (maxLoadFactor <= 0.0 || maxLoadFactor >= 1.0) || (minLoadFactor >= maxLoadFactor).IllegalArgumentException
- if rows<0 || columns<0 || (double)columns*rows > Integer.MAX_VALUE.public DoubleMatrix2D assign(double value)
assign
in class DoubleMatrix2D
value
- the value to be filled into the cells.public DoubleMatrix2D assign(DoubleFunction function)
Example:
matrix = 2 x 2 matrix 0.5 1.5 2.5 3.5 // change each cell to its sine matrix.assign(cern.jet.math.Functions.sin); --> 2 x 2 matrix 0.479426 0.997495 0.598472 -0.350783For further examples, see the package doc.
assign
in class DoubleMatrix2D
function
- a function object taking as argument the current cell's value.Functions
public DoubleMatrix2D assign(DoubleMatrix2D source)
assign
in class DoubleMatrix2D
source
- the source matrix to copy from (may be identical to the receiver).IllegalArgumentException
- if columns() != source.columns() || rows() != source.rows()public DoubleMatrix2D assign(DoubleMatrix2D y, DoubleDoubleFunction function)
DoubleMatrix2D
Example:
// assign x[row,col] = x[row,col]y[row,col] m1 = 2 x 2 matrix 0 1 2 3 m2 = 2 x 2 matrix 0 2 4 6 m1.assign(m2, cern.jet.math.Functions.pow); --> m1 == 2 x 2 matrix 1 1 16 729For further examples, see the package doc.
assign
in class DoubleMatrix2D
y
- the secondary matrix to operate on.function
- a function object taking as first argument the current cell's value of this,
and as second argument the current cell's value of y,Functions
public int cardinality()
cardinality
in class DoubleMatrix2D
public void ensureCapacity(int minCapacity)
This method never need be called; it is for performance tuning only. Calling this method before tt>set()ing a large number of non-zero values boosts performance, because the receiver will grow only once instead of potentially many times and hash collisions get less probable.
ensureCapacity
in class AbstractMatrix
minNonZeros
- the desired minimum number of non-zero cells.public DoubleMatrix2D forEachNonZero(IntIntDoubleFunction function)
DoubleMatrix2D
forEachNonZero
in class DoubleMatrix2D
function
- a function object taking as argument the current non-zero cell's row, column and value.public double getQuick(int row, int column)
Provided with invalid parameters this method may return invalid objects without throwing any exception. You should only use this method when you are absolutely sure that the coordinate is within bounds. Precondition (unchecked): 0 <= column < columns() && 0 <= row < rows().
getQuick
in class DoubleMatrix2D
row
- the index of the row-coordinate.column
- the index of the column-coordinate.public DoubleMatrix2D like(int rows, int columns)
like
in class DoubleMatrix2D
rows
- the number of rows the matrix shall have.columns
- the number of columns the matrix shall have.public DoubleMatrix1D like1D(int size)
like1D
in class DoubleMatrix2D
size
- the number of cells the matrix shall have.public void setQuick(int row, int column, double value)
Provided with invalid parameters this method may access illegal indexes without throwing any exception. You should only use this method when you are absolutely sure that the coordinate is within bounds. Precondition (unchecked): 0 <= column < columns() && 0 <= row < rows().
setQuick
in class DoubleMatrix2D
row
- the index of the row-coordinate.column
- the index of the column-coordinate.value
- the value to be filled into the specified cell.public void trimToSize()
Background:
Cells that
trimToSize
in class AbstractMatrix
public DoubleMatrix1D zMult(DoubleMatrix1D y, DoubleMatrix1D z, double alpha, double beta, boolean transposeA)
DoubleMatrix2D
zMult
in class DoubleMatrix2D
y
- the source vector.z
- the vector where results are to be stored. Set this parameter to null to indicate that a new result vector shall be constructed.public DoubleMatrix2D zMult(DoubleMatrix2D B, DoubleMatrix2D C, double alpha, double beta, boolean transposeA, boolean transposeB)
DoubleMatrix2D
zMult
in class DoubleMatrix2D
B
- the second source matrix.C
- the matrix where results are to be stored. Set this parameter to null to indicate that a new result matrix shall be constructed.Jas4pp 1.5 © Java Analysis Studio for Particle Physics