Uses of Interface
org.ojalgo.matrix.decomposition.MatrixDecomposition
Packages that use MatrixDecomposition
-
Uses of MatrixDecomposition in org.ojalgo.matrix
Fields in org.ojalgo.matrix declared as MatrixDecomposition -
Uses of MatrixDecomposition in org.ojalgo.matrix.decomposition
Classes in org.ojalgo.matrix.decomposition with type parameters of type MatrixDecompositionModifier and TypeInterfaceDescriptionstatic interface
MatrixDecomposition.Factory<D extends MatrixDecomposition<?>>
Subinterfaces of MatrixDecomposition in org.ojalgo.matrix.decompositionModifier and TypeInterfaceDescriptioninterface
Bidiagonal<N extends Comparable<N>>
A general matrix [A] can be factorized by similarity transformations into the form [A]=[LQ][D][RQ] -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 [LQ] (m-by-r) or (m-by-m) is orthogonal [RQ] (n-by-r) or (n-by-n) is orthogonal r = min(m,n)interface
Cholesky<N extends Comparable<N>>
Cholesky: [A] = [L][L]H (or [R]H[R])interface
Eigenvalue<N extends Comparable<N>>
[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).static interface
Eigenvalue.Generalised<N extends Comparable<N>>
interface
Hessenberg<N extends Comparable<N>>
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/unitaryinterface
LDL<N extends Comparable<N>>
LDL: [A] = [L][D][L]H (or [R]H[D][R])interface
LDU<N extends Comparable<N>>
LDU: [A] = [L][D][U] ( [PL][L][D][U][PU] )interface
LU<N extends Comparable<N>>
LU: [A] = [L][U]static interface
MatrixDecomposition.Determinant<N extends Comparable<N>>
static interface
MatrixDecomposition.EconomySize<N extends Comparable<N>>
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 Comparable<N>>
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 Comparable<N>>
static interface
MatrixDecomposition.Pivoting<N extends Comparable<N>>
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 Comparable<N>>
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 Comparable<N>>
static interface
MatrixDecomposition.Values<N extends Comparable<N>>
Eigenvalue and Singular Value decompositions can calculate the "values" only.interface
QR<N extends Comparable<N>>
QR: [A] = [Q][R] Decomposes [this] into [Q] and [R] where: [Q] is an orthogonal matrix (orthonormal columns).interface
SingularValue<N extends Comparable<N>>
Singular Value: [A] = [U][D][V]T Decomposes [this] into [U], [D] and [V] where: [U] is an orthogonal matrix.interface
Tridiagonal<N extends Comparable<N>>
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.Classes in org.ojalgo.matrix.decomposition that implement MatrixDecompositionModifier and TypeClassDescription(package private) class
AbstractDecomposition<N extends Comparable<N>>
(package private) class
BidiagonalDecomposition<N extends Comparable<N>>
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) class
CholeskyDecomposition<N extends Comparable<N>>
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) class
DeferredTridiagonal<N extends Comparable<N>>
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) class
DynamicEvD<N extends Comparable<N>>
(package private) static final class
(package private) class
EigenvalueDecomposition<N extends Comparable<N>>
(package private) class
GeneralEvD<N extends Comparable<N>>
(package private) static final class
Eigenvalues and eigenvectors of a real matrix.(package private) final class
GeneralisedEvD<N extends Comparable<N>>
(package private) class
GenericDecomposition<N extends Comparable<N>>
AbstractDecomposition(package private) class
HermitianEvD<N extends Comparable<N>>
Eigenvalues and eigenvectors of a real matrix.(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) class
HessenbergDecomposition<N extends Comparable<N>>
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) class
InPlaceDecomposition<N extends Comparable<N>>
(package private) class
LDLDecomposition<N extends Comparable<N>>
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) class
LUDecomposition<N extends Comparable<N>>
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) class
QRDecomposition<N extends Comparable<N>>
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) final class
(package private) class
In many ways similar to InPlaceDecomposition but this class is hardwired to work with double[][] data.(package private) class
Eigenvalues and eigenvectors of a real matrix.(package private) static final class
(package private) static final class
(package private) static final class
(package private) final class
(package private) final class
For an m-by-n matrix A with m >= n, the QR decomposition is an m-by-n orthogonal matrix Q and an n-by-n upper triangular matrix R so that A = Q*R.(package private) final class
Singular Value Decomposition.(package private) class
Computes Q while decomposing.(package private) class
SingularValueDecomposition<N extends Comparable<N>>
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) static final class
(package private) class
TridiagonalDecomposition<N extends Comparable<N>>
Methods in org.ojalgo.matrix.decomposition with type parameters of type MatrixDecompositionModifier and TypeMethodDescriptiondefault <N extends Comparable<N>,
DN extends MatrixDecomposition<N>>
DNMatrixDecomposition.Factory.decompose
(Access2D.Collectable<N, ? super PhysicalStore<N>> matrix) Will create a new decomposition instance and directly perform the decomposition.