Modifier and Type | Method and Description |
---|---|
static void |
ProgrammingError.throwIfNotEqualRowDimensions(Structure2D mtrx1,
Structure2D mtrx2) |
static void |
ProgrammingError.throwIfNotSquare(Structure2D mtrx) |
Modifier and Type | Method and Description |
---|---|
Structure2D[] |
NetworkBuilder.structure() |
Modifier and Type | Class and Description |
---|---|
class |
Array2D<N extends Number>
Array2D
|
Modifier and Type | Class and Description |
---|---|
class |
ComplexMatrix
ComplexMatrix
|
class |
PrimitiveMatrix
PrimitiveMatrix
|
class |
QuaternionMatrix
QuaternionMatrix
|
class |
RationalMatrix
RationalMatrix
|
Modifier and Type | Interface and Description |
---|---|
interface |
Bidiagonal<N extends Number>
A general matrix [A] can be factorized by similarity transformations into the form [A]=[Q1][D][Q2]
-1 where:
[A] (m-by-n) is any, real or complex, matrix
[D] (r-by-r) or (m-by-n) is, upper or lower, bidiagonal
[Q1] (m-by-r) or (m-by-m) is orthogonal
[Q2] (n-by-r) or (n-by-n) is orthogonal
r = min(m,n)
|
interface |
Cholesky<N extends Number>
Cholesky: [A] = [L][L]H (or [R]H[R])
|
interface |
DecompositionStore<N extends Number>
Only classes that will act as a delegate to a MatrixDecomposition implementation from this
package should implement this interface.
|
interface |
Eigenvalue<N extends Number>
[A] = [V][D][V]-1 ([A][V] = [V][D])
[A] = any square matrix.
[V] = contains the eigenvectors as columns.
[D] = a diagonal matrix with the eigenvalues on the diagonal (possibly in blocks).
|
interface |
Hessenberg<N extends Number>
Hessenberg: [A] = [Q][H][Q]T A general square matrix [A] can be decomposed by orthogonal
similarity transformations into the form [A]=[Q][H][Q]T where
[H] is upper (or lower) hessenberg matrix
[Q] is orthogonal/unitary
|
interface |
LDL<N extends Number>
LDL: [A] = [L][D][L]H (or [R]H[D][R])
|
interface |
LDU<N extends Number>
LDU: [A] = [L][D][U] ( [PL][L][D][U][PU] )
|
interface |
LU<N extends Number>
LU: [A] = [L][U]
|
interface |
MatrixDecomposition<N extends Number>
Notation used to describe the various matrix decompositions:
[A] could be any matrix.
|
static interface |
MatrixDecomposition.Determinant<N extends Number> |
static interface |
MatrixDecomposition.EconomySize<N extends Number>
Several matrix decompositions can be expressed "economy sized" - some rows or columns of the decomposed
matrix parts are not needed for the most releveant use cases, and can therefore be left out.
|
static interface |
MatrixDecomposition.Hermitian<N extends Number>
Some matrix decompositions are only available with hermitian (symmetric) matrices or different
decomposition algorithms could be used depending on if the matrix is hemitian or not.
|
static interface |
MatrixDecomposition.Ordered<N extends Number> |
static interface |
MatrixDecomposition.Pivoting<N extends Number>
The pivot or pivot element is the element of a matrix, or an array, which is selected first by an
algorithm (e.g.
|
static interface |
MatrixDecomposition.RankRevealing<N extends Number>
A rank-revealing matrix decomposition of a matrix [A] is a decomposition that is, or can be transformed
to be, on the form [A]=[X][D][Y]T where:
[X] and [Y] are square and well conditioned.
[D] is diagonal with nonnegative and non-increasing values on the diagonal.
|
static interface |
MatrixDecomposition.Solver<N extends Number> |
static interface |
MatrixDecomposition.Values<N extends Number>
Eigenvalue and Singular Value decompositions can calculate the "values" only.
|
interface |
QR<N extends Number>
QR: [A] = [Q][R] Decomposes [this] into [Q] and [R] where:
[Q] is an orthogonal matrix (orthonormal columns).
|
interface |
SingularValue<N extends Number>
Singular Value: [A] = [Q1][D][Q2]T Decomposes [this] into [Q1], [D] and [Q2] where:
[Q1] is an orthogonal matrix.
|
interface |
Tridiagonal<N extends Number>
Tridiagonal: [A] = [Q][D][Q]H Any square symmetric (hermitian) matrix [A] can be factorized by
similarity transformations into the form, [A]=[Q][D][Q]-1 where [Q] is an orthogonal (unitary)
matrix and [D] is a real symmetric tridiagonal matrix.
|
Modifier and Type | Class and Description |
---|---|
class |
HermitianEvD<N extends Number>
Eigenvalues and eigenvectors of a real matrix.
|
Modifier and Type | Field and Description |
---|---|
static Structure2D |
MatrixDecomposition.TYPICAL |
Modifier and Type | Method and Description |
---|---|
default SingularValue<N> |
SingularValue.Factory.make(Structure2D typical) |
default QR<N> |
QR.Factory.make(Structure2D typical) |
default Bidiagonal<N> |
Bidiagonal.Factory.make(Structure2D typical) |
default Eigenvalue<N> |
Eigenvalue.Factory.make(Structure2D typical) |
D |
MatrixDecomposition.Factory.make(Structure2D typical) |
SingularValue<N> |
SingularValue.Factory.make(Structure2D typical,
boolean fullSize) |
QR<N> |
QR.Factory.make(Structure2D typical,
boolean fullSize) |
Bidiagonal<N> |
Bidiagonal.Factory.make(Structure2D typical,
boolean fullSize) |
Eigenvalue<N> |
Eigenvalue.Factory.make(Structure2D typical,
boolean hermitian) |
PhysicalStore<N> |
HermitianEvD.preallocate(Structure2D template) |
PhysicalStore<N> |
HermitianEvD.preallocate(Structure2D templateBody,
Structure2D templateRHS) |
Modifier and Type | Class and Description |
---|---|
class |
Primitive32Vector2 |
class |
Primitive32Vector3 |
class |
Primitive32Vector4 |
class |
Primitive64Vector2 |
class |
Primitive64Vector3 |
class |
Primitive64Vector4 |
Modifier and Type | Interface and Description |
---|---|
interface |
ElementsSupplier<N extends Number>
An elements supplier is not (yet) a matrix, but there are several matrix related things you can do with
them:
You can query the size/shape of the (future) matrix.
You can supply the elements to an already existing matrix (or more precisely to an
TransformableRegion) or collect them using a Factory2D.
You can define a stream of additional operations to be executed when the elements are extracted.
You can get that matrix
|
interface |
MatrixStore<N extends Number>
A MatrixStore is a two dimensional store of numbers/scalars.
|
interface |
PhysicalStore<N extends Number>
PhysicalStore:s, as opposed to MatrixStore:s, are mutable.
|
interface |
TransformableRegion<N extends Number>
Primarily this represents something that can be fille and/or modified
|
Modifier and Type | Class and Description |
---|---|
class |
ColumnsSupplier<N extends Number> |
class |
GenericDenseStore<N extends Number & Scalar<N>>
A generic implementation of PhysicalStore.
|
static class |
MatrixStore.LogicalBuilder<N extends Number>
A builder that lets you logically construct matrices and/or encode element structure.
|
class |
PrimitiveDenseStore
A Double (actually double) implementation of PhysicalStore.
|
class |
RawStore
Uses double[][] internally.
|
class |
RowsSupplier<N extends Number> |
class |
SparseStore<N extends Number> |
static class |
TransformableRegion.ColumnsRegion<N extends Number> |
static class |
TransformableRegion.LimitRegion<N extends Number> |
static class |
TransformableRegion.OffsetRegion<N extends Number> |
static class |
TransformableRegion.ReceiverRegion<N extends Number> |
static class |
TransformableRegion.RowsRegion<N extends Number> |
static class |
TransformableRegion.TransposedRegion<N extends Number> |
Modifier and Type | Method and Description |
---|---|
default SparseStore<N> |
SparseStore.Factory.make(Structure2D shape) |
default I |
PhysicalStore.Factory.makeEye(Structure2D shape) |
Modifier and Type | Method and Description |
---|---|
abstract DeterminantTask<N> |
DeterminantTask.Factory.make(Structure2D template,
boolean symmetric,
boolean positiveDefinite) |
abstract InverterTask<N> |
InverterTask.Factory.make(Structure2D template,
boolean symmetric,
boolean positiveDefinite) |
abstract SolverTask<N> |
SolverTask.Factory.make(Structure2D templateBody,
Structure2D templateRHS,
boolean symmetric,
boolean positiveDefinite) |
PhysicalStore<Double> |
AbstractInverter.preallocate(Structure2D template) |
PhysicalStore<N> |
InverterTask.preallocate(Structure2D template)
Will create a PhysicalStore instance suitable for use with
InverterTask.invert(Access2D, PhysicalStore) . |
PhysicalStore<N> |
SolverTask.preallocate(Structure2D templateBody,
Structure2D templateRHS)
Will create a PhysicalStore instance suitable for use with
SolverTask.solve(Access2D, Access2D, PhysicalStore) . |
Modifier and Type | Class and Description |
---|---|
class |
ComplexNumber
ComplexNumber is an immutable complex number class.
|
static class |
ComplexNumber.Normalised |
class |
Quaternion |
static class |
Quaternion.Versor |
Modifier and Type | Interface and Description |
---|---|
interface |
Factory2D<I extends Structure2D> |
static interface |
Structure2D.Logical<S extends Structure2D,B extends Structure2D.Logical<S,?>> |
static interface |
StructureAnyD.ReducibleTo2D<R extends Structure2D> |
Modifier and Type | Interface and Description |
---|---|
interface |
Access2D<N extends Number>
2-dimensional accessor methods
|
static interface |
Access2D.Aggregatable<N extends Number> |
static interface |
Access2D.Collectable<N extends Number,R extends Mutate2D.Receiver<N>> |
static interface |
Access2D.Elements
Deprecated.
v48 Will be removed
|
static interface |
Access2D.IndexOf
Deprecated.
v48 Will be removed
|
static interface |
Access2D.Sliceable<N extends Number> |
static interface |
Access2D.Visitable<N extends Number> |
interface |
Mutate2D
2-dimensional mutator methods
|
static interface |
Mutate2D.Exchangeable
A few operations with no 1D or AnyD counterpart.
|
static interface |
Mutate2D.Fillable<N extends Number> |
static interface |
Mutate2D.Mixable<N extends Number> |
static interface |
Mutate2D.Modifiable<N extends Number> |
static interface |
Mutate2D.ModifiableReceiver<N extends Number>
A utility interface to simplify declaring to implement "everything mutable".
|
static interface |
Mutate2D.Receiver<N extends Number> |
interface |
Stream2D<N extends Number,A extends Access2D<N>,R extends Mutate2D.Receiver<N>,P extends Stream2D<N,A,R,P>> |
static interface |
Structure2D.Logical<S extends Structure2D,B extends Structure2D.Logical<S,?>> |
static interface |
Structure2D.ReducibleTo1D<R extends Structure1D> |
Modifier and Type | Class and Description |
---|---|
class |
MatrixView<N extends Number> |
Modifier and Type | Method and Description |
---|---|
B |
Structure2D.Logical.above(S... above) |
B |
Structure2D.Logical.below(S... below) |
B |
Structure2D.Logical.diagonally(S... diagonally) |
default boolean |
Mutate2D.Receiver.isAcceptable(Structure2D supplier) |
B |
Structure2D.Logical.left(S... left) |
static void |
Structure2D.loopMatching(Structure2D structureA,
Structure2D structureB,
Structure2D.RowColumnCallback callback) |
default I |
Factory2D.makeFilled(Structure2D shape,
NullaryFunction<?> supplier) |
default I |
Factory2D.makeZero(Structure2D shape) |
static <R,C> Structure2D.RowColumnMapper<R,C> |
Structure2D.mapperOf(Structure2D structure,
Structure1D.IndexMapper<R> rowMappwer,
Structure1D.IndexMapper<C> columnMappwer) |
B |
Structure2D.Logical.right(S... right) |
Constructor and Description |
---|
RowColumnMapper(Structure2D structure,
Structure1D.IndexMapper<R> rowMapper,
Structure1D.IndexMapper<C> columnMapper) |
Copyright © 2019 Optimatika. All rights reserved.