Interface | Description |
---|---|
AnyMatrix |
Interface defining very basic matrix operations.
|
DecompositionSolver |
Interface handling decomposition algorithms that can solve A × X = B.
|
FieldDecompositionSolver<T extends FieldElement<T>> |
Interface handling decomposition algorithms that can solve A × X = B.
|
FieldMatrix<T extends FieldElement<T>> |
Interface defining field-valued matrix with basic algebraic operations.
|
FieldMatrixChangingVisitor<T extends FieldElement<?>> |
Interface defining a visitor for matrix entries.
|
FieldMatrixDecomposer<T extends FieldElement<T>> |
Interface for all algorithms providing matrix decomposition.
|
FieldMatrixPreservingVisitor<T extends FieldElement<?>> |
Interface defining a visitor for matrix entries.
|
FieldVector<T extends FieldElement<T>> |
Interface defining a field-valued vector with basic algebraic operations.
|
FieldVectorChangingVisitor<T extends FieldElement<?>> |
This interface defines a visitor for the entries of a vector.
|
FieldVectorPreservingVisitor<T extends FieldElement<?>> |
This interface defines a visitor for the entries of a vector.
|
MatrixDecomposer |
Interface for all algorithms providing matrix decomposition.
|
RealLinearOperator |
This class defines a linear operator operating on real (
double )
vector spaces. |
RealMatrix |
Interface defining a real-valued matrix with basic algebraic operations.
|
RealMatrixChangingVisitor |
Interface defining a visitor for matrix entries.
|
RealMatrixPreservingVisitor |
Interface defining a visitor for matrix entries.
|
RealVectorChangingVisitor |
This interface defines a visitor for the entries of a vector.
|
RealVectorPreservingVisitor |
This interface defines a visitor for the entries of a vector.
|
RiccatiEquationSolver |
An algebraic Riccati equation is a type of nonlinear equation that arises in
the context of infinite-horizon optimal control problems in continuous time
or discrete time.
|
SparseRealMatrix |
Marker interface for
RealMatrix implementations that require sparse backing storage |
Class | Description |
---|---|
AbstractFieldMatrix<T extends FieldElement<T>> |
Basic implementation of
FieldMatrix methods regardless of the underlying storage. |
AbstractRealMatrix |
Basic implementation of RealMatrix methods regardless of the underlying storage.
|
Array2DRowFieldMatrix<T extends FieldElement<T>> |
Implementation of FieldMatrix
FieldElement [][] array to store entries. |
Array2DRowRealMatrix |
Implementation of
RealMatrix using a double[][] array to
store entries. |
ArrayFieldVector<T extends FieldElement<T>> |
This class implements the
FieldVector interface with a FieldElement array. |
ArrayRealVector |
This class implements the
RealVector interface with a double array. |
BlockFieldMatrix<T extends FieldElement<T>> |
Cache-friendly implementation of FieldMatrix using a flat arrays to store
square blocks of the matrix.
|
BlockRealMatrix |
Cache-friendly implementation of RealMatrix using a flat arrays to store
square blocks of the matrix.
|
CholeskyDecomposer |
Matrix decomposer using Cholseky decomposition.
|
CholeskyDecomposition |
Calculates the Cholesky decomposition of a matrix.
|
ComplexEigenDecomposition |
Given a matrix A, it computes a complex eigen decomposition AV = VD.
|
ConjugateGradient |
This is an implementation of the conjugate gradient method for
RealLinearOperator . |
DefaultFieldMatrixChangingVisitor<T extends FieldElement<T>> |
Default implementation of the
FieldMatrixChangingVisitor interface. |
DefaultFieldMatrixPreservingVisitor<T extends FieldElement<T>> |
Default implementation of the
FieldMatrixPreservingVisitor interface. |
DefaultIterativeLinearSolverEvent |
A default concrete implementation of the abstract class
IterativeLinearSolverEvent . |
DefaultRealMatrixChangingVisitor |
Default implementation of the
RealMatrixChangingVisitor interface. |
DefaultRealMatrixPreservingVisitor |
Default implementation of the
RealMatrixPreservingVisitor interface. |
DiagonalMatrix |
Implementation of a diagonal matrix.
|
EigenDecomposition |
Calculates the eigen decomposition of a real matrix.
|
FieldLUDecomposer<T extends FieldElement<T>> |
Matrix decomposer using LU-decomposition.
|
FieldLUDecomposition<T extends FieldElement<T>> |
Calculates the LUP-decomposition of a square matrix.
|
FieldQRDecomposer<T extends CalculusFieldElement<T>> |
Matrix decomposer using QR-decomposition.
|
FieldQRDecomposition<T extends CalculusFieldElement<T>> |
Calculates the QR-decomposition of a field matrix.
|
IterativeLinearSolver |
This abstract class defines an iterative solver for the linear system A
· x = b.
|
IterativeLinearSolverEvent |
This is the base class for all events occurring during the iterations of a
IterativeLinearSolver . |
JacobiPreconditioner |
This class implements the standard Jacobi (diagonal) preconditioner.
|
LUDecomposer |
Matrix decomposer using LU-decomposition.
|
LUDecomposition |
Calculates the LUP-decomposition of a square matrix.
|
MatrixUtils |
A collection of static methods that operate on or return matrices.
|
OpenMapRealMatrix |
Sparse matrix implementation based on an open addressed map.
|
OpenMapRealVector |
This class implements the
RealVector interface with a
OpenIntToDoubleHashMap backing store. |
OrderedComplexEigenDecomposition |
Given a matrix A, it computes a complex eigen decomposition A = VDV^{T}.
|
OrderedEigenDecomposition |
Given a matrix A, it computes an eigen decomposition A = VDV^{T}.
|
PreconditionedIterativeLinearSolver |
This abstract class defines preconditioned iterative solvers.
|
QRDecomposer |
Matrix decomposer using QR-decomposition.
|
QRDecomposition |
Calculates the QR-decomposition of a matrix.
|
RealMatrixFormat |
Formats a
nxm matrix in components list format
"{{a00,a01, ...,
a0m-1},{a10,
a11, ..., a1m-1},{...},{
an-10, an-11, ...,
an-1m-1}}". |
RealVector |
Class defining a real-valued vector with basic algebraic operations.
|
RealVectorFormat |
Formats a vector in components list format "{v0; v1; ...; vk-1}".
|
RectangularCholeskyDecomposition |
Calculates the rectangular Cholesky decomposition of a matrix.
|
RiccatiEquationSolverImpl |
This solver computes the solution using the following approach:
1.
|
RRQRDecomposition |
Calculates the rank-revealing QR-decomposition of a matrix, with column pivoting.
|
SemiDefinitePositiveCholeskyDecomposition |
Calculates the Cholesky decomposition of a positive semidefinite matrix.
|
SingularValueDecomposer |
Matrix decomposer using Singular Value Decomposition.
|
SingularValueDecomposition |
Calculates the compact Singular Value Decomposition of a matrix.
|
SparseFieldMatrix<T extends FieldElement<T>> |
Sparse matrix implementation based on an open addressed map.
|
SparseFieldVector<T extends FieldElement<T>> |
This class implements the
FieldVector interface with a OpenIntToFieldHashMap backing store. |
SparseRealVector |
Marker class for RealVectors that require sparse backing storage
|
SymmLQ |
Implementation of the SYMMLQ iterative linear solver proposed by Paige and Saunders (1975).
|
Enum | Description |
---|---|
DependentVectorsHandler |
Enumerate to specify how dependent vectors should be handled in
MatrixUtils.orthonormalize(List, double, DependentVectorsHandler) and
MatrixUtils.orthonormalize(Field, List, CalculusFieldElement, DependentVectorsHandler) . |
Copyright © 2016-2022 CS GROUP. All rights reserved.