| Class and Description |
|---|
| AArrayMatrix
Abstract class for a Matrix backed with a single double[] data array
Dimensions are fixed, but leaves open the possibility of arbitrary indexing
|
| ADenseArrayMatrix
Abstract base class for matrices wrapping a dense (rows*cols) subset of a double[] array
|
| ADiagonalMatrix
Abstract base class for square diagonal matrices
|
| APrimitiveMatrix
Abstract base class for the small square primitive backed matrices
|
| ARectangularMatrix
Abstract class for regular rectangular matrices that maintain a final fixed row and column count.
|
| AStridedMatrix
Abstract base class for arbitrary strided matrices
|
| DenseColumnMatrix
A densely packed matrix organised in column-major format.
|
| DiagonalMatrix
Specialised diagonal matrix class, with dense double[] array storage for the leading diagonal only.
|
| IdentityMatrix
Specialised identity matrix class.
|
| IFastRows
Marker interface for matrices with fast row access
General intention is that any matrix that implements this must have a fast getRow(), typically
- O(1) time and space
- An efficient vector type returned (a strided vector or better)
|
| SparseColumnMatrix
Matrix stored as a collection of normally sparse column vectors
This format is especially efficient for:
- transposeInnerProduct() with another matrix
- access via getColumn() operation
- transpose into SparseRowMatrix
|
| SparseRowMatrix
Matrix stored as a collection of normally sparse row vectors.
|
| ZeroMatrix
Lightweight immutable zero matrix class.
|
| Class and Description |
|---|
| ADiagonalMatrix
Abstract base class for square diagonal matrices
|
| PermutationMatrix
Class representing a square permutation matrix
i.e.
|
| Class and Description |
|---|
| ADiagonalMatrix
Abstract base class for square diagonal matrices
|
| Class and Description |
|---|
| PermutationMatrix
Class representing a square permutation matrix
i.e.
|
| Class and Description |
|---|
| AArrayMatrix
Abstract class for a Matrix backed with a single double[] data array
Dimensions are fixed, but leaves open the possibility of arbitrary indexing
|
| ABandedMatrix
Abstract base class for banded matrices
Banded matrix implementations are assumed to store their data efficiently in diagonal bands,
so functions on banded matrices can be designed to exploit this fact.
|
| ABlockMatrix
Abstract base class for a large matrix constructed out of regular subMatrix blocks
|
| ABooleanMatrix
Abstract base class for matrices limited to boolean 0/1 values
Such matrices allow for various efficient representations
|
| ADenseArrayMatrix
Abstract base class for matrices wrapping a dense (rows*cols) subset of a double[] array
|
| ADiagonalMatrix
Abstract base class for square diagonal matrices
|
| ARectangularMatrix
Abstract class for regular rectangular matrices that maintain a final fixed row and column count.
|
| ASingleBandMatrix
Abstract base class to represent sparse matrices with a single non-zero band
Unlike ADiagonalMatrix, this matrix need not be square, and may have non-zero values on
an arbitrary diagonal.
|
| ASparseRCMatrix
Abstract base class for matrices that store sparse rows or columns.
|
| AStridedMatrix
Abstract base class for arbitrary strided matrices
|
| ATriangularMatrix
Abstract base class for densely packed triangular matrices (upper and lower)
|
| AVectorMatrix
Abstract base class for matrices that use a collection of Vectors
as storage for the matrix rows.
|
| BandedMatrix
Sparse banded matrix implementation.
|
| BaseStridedMatrix |
| BlockDiagonalMatrix
Class representing a square, block diagonal matrix.
|
| BroadcastVectorMatrix
Specialised class representing the broadcasting of a vector to a matrix shape.
|
| BufferMatrix
A matrix class implemented using a java.nio.DoubleBuffer
Intended for use with native libraries that require interop with buffer memory
|
| ColumnMatrix
Matrix class that wraps a vector as a single-column matrix
|
| DenseColumnMatrix
A densely packed matrix organised in column-major format.
|
| DiagonalMatrix
Specialised diagonal matrix class, with dense double[] array storage for the leading diagonal only.
|
| IdentityMatrix
Specialised identity matrix class.
|
| IFastBands
Marker interface for matrices with fast banded access.
|
| IFastColumns
Marker interface for matrices with fast column access
General intention is that any matrix that implements this must have a fast getColumn(), typically
- O(1) time and space
- An efficient vector type returned
|
| IFastRows
Marker interface for matrices with fast row access
General intention is that any matrix that implements this must have a fast getRow(), typically
- O(1) time and space
- An efficient vector type returned (a strided vector or better)
|
| ImmutableMatrix
Immutable dense matrix class
This is the immutable equivalent of mikera.matrixx.Matrix
|
| LowerTriangularMatrix
Class for a lower triangular matrix packed densely by rows.
|
| MatrixColumnView
A class representing a view of a matrix column as a vector
Used where no better implementations for getColumnView(...) on a matrix exist.
|
| MatrixRowView
A class representing a view of a matrix row as a vector.
|
| PermutationMatrix
Class representing a square permutation matrix
i.e.
|
| PermutedMatrix
Matrix class representing a permuted view of a matrix
|
| QuadtreeMatrix
A matrix implemented as a quadtree of submatrices.
|
| RowMatrix
Matrix class that wraps a vector as a single-row matrix
|
| ScalarMatrix
Immutable scalar matrix class - a diagonal matrix with an identical value along the leading diagonal.
|
| SparseColumnMatrix
Matrix stored as a collection of normally sparse column vectors
This format is especially efficient for:
- transposeInnerProduct() with another matrix
- access via getColumn() operation
- transpose into SparseRowMatrix
|
| SparseRowMatrix
Matrix stored as a collection of normally sparse row vectors.
|
| StridedMatrix
A general purpose strided matrix implementation
|
| StridedRowMatrix
A strided matrix implementation with a column stride of 1
Provides a fast, mutable subMatrix view for the dense Matrix class
|
| TransposedMatrix
Class representing a transposed view of another matrix The transposed matrix
is a reference to the underlying matrix data
|
| UpperTriangularMatrix
Class for an upper triangular matrix packed densely by columns.
|
| VectorMatrixM3
Specialised N*3 Matrix with Vector3 row components
|
| VectorMatrixMN
A matrix implemented as a composition of M length N vectors
|
| ZeroMatrix
Lightweight immutable zero matrix class.
|
| Class and Description |
|---|
| ADenseArrayMatrix
Abstract base class for matrices wrapping a dense (rows*cols) subset of a double[] array
|
| Class and Description |
|---|
| AStridedMatrix
Abstract base class for arbitrary strided matrices
|
| SparseColumnMatrix
Matrix stored as a collection of normally sparse column vectors
This format is especially efficient for:
- transposeInnerProduct() with another matrix
- access via getColumn() operation
- transpose into SparseRowMatrix
|
| SparseRowMatrix
Matrix stored as a collection of normally sparse row vectors.
|
Copyright © 2016. All rights reserved.