Uses of Interface
org.ojalgo.matrix.Provider2D.Rank
-
Packages that use Provider2D.Rank Package Description org.ojalgo.matrix org.ojalgo.matrix.decomposition -
-
Uses of Provider2D.Rank in org.ojalgo.matrix
Classes in org.ojalgo.matrix that implement Provider2D.Rank Modifier and Type Class Description class
BasicMatrix<N extends java.lang.Comparable<N>,M extends BasicMatrix<N,M>>
A base class for, easy to use, immutable (thread safe) matrices with a rich feature set.class
MatrixC128
A matrix (linear algebra) with ComplexNumberSet.C
elements, implemented using dual 64-bit double values.class
MatrixH256
A matrix (linear algebra) with QuaternionNumberSet.H
elements, implemented using four 64-bit double values.class
MatrixQ128
A matrix (linear algebra) with RationalNumberSet.Q
elements, implemented using dual 64-bit long values.class
MatrixR032
A matrix (linear algebra) with RealNumberSet.R
elements, approximated by 32-bit float.class
MatrixR064
A matrix (linear algebra) with RealNumberSet.R
elements, approximated by 64-bit double.class
MatrixR128
A matrix (linear algebra) with RealNumberSet.R
elements, approximated by 128-bit floating-point values (implemented using dual 64-bit double).Methods in org.ojalgo.matrix that return Provider2D.Rank Modifier and Type Method Description private Provider2D.Rank
BasicMatrix. getRankProvider()
-
Uses of Provider2D.Rank in org.ojalgo.matrix.decomposition
Subinterfaces of Provider2D.Rank in org.ojalgo.matrix.decomposition Modifier and Type Interface Description interface
Cholesky<N extends java.lang.Comparable<N>>
Cholesky: [A] = [L][L]H (or [R]H[R])interface
LDL<N extends java.lang.Comparable<N>>
LDL: [A] = [L][D][L]H (or [R]H[D][R])interface
LDU<N extends java.lang.Comparable<N>>
LDU: [A] = [L][D][U] ( [PL][L][D][U][PU] )interface
LU<N extends java.lang.Comparable<N>>
LU: [A] = [L][U]static interface
MatrixDecomposition.RankRevealing<N extends java.lang.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.interface
QR<N extends java.lang.Comparable<N>>
QR: [A] = [Q][R] Decomposes [this] into [Q] and [R] where: [Q] is an orthogonal matrix (orthonormal columns).interface
SingularValue<N extends java.lang.Comparable<N>>
Singular Value: [A] = [U][D][V]T Decomposes [this] into [U], [D] and [V] where: [U] is an orthogonal matrix.Classes in org.ojalgo.matrix.decomposition that implement Provider2D.Rank Modifier and Type Class Description (package private) class
CholeskyDecomposition<N extends java.lang.Comparable<N>>
(package private) static class
CholeskyDecomposition.C128
(package private) static class
CholeskyDecomposition.H256
(package private) static class
CholeskyDecomposition.Q128
(package private) static class
CholeskyDecomposition.R064
(package private) static class
CholeskyDecomposition.R128
(package private) class
LDLDecomposition<N extends java.lang.Comparable<N>>
(package private) static class
LDLDecomposition.C128
(package private) static class
LDLDecomposition.H256
(package private) static class
LDLDecomposition.Q128
(package private) static class
LDLDecomposition.R064
(package private) static class
LDLDecomposition.R128
(package private) class
LUDecomposition<N extends java.lang.Comparable<N>>
(package private) static class
LUDecomposition.C128
(package private) static class
LUDecomposition.H256
(package private) static class
LUDecomposition.Q128
(package private) static class
LUDecomposition.R064
(package private) static class
LUDecomposition.R128
(package private) class
QRDecomposition<N extends java.lang.Comparable<N>>
(package private) static class
QRDecomposition.C128
(package private) static class
QRDecomposition.H256
(package private) static class
QRDecomposition.Q128
(package private) static class
QRDecomposition.R064
(package private) static class
QRDecomposition.R128
(package private) class
RawCholesky
(package private) class
RawLU
(package private) class
RawQR
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) class
RawSingularValue
Singular Value Decomposition.(package private) class
SingularValueDecomposition<N extends java.lang.Comparable<N>>
(package private) static class
SingularValueDecomposition.C128
(package private) static class
SingularValueDecomposition.H256
(package private) static class
SingularValueDecomposition.Q128
(package private) static class
SingularValueDecomposition.R064
(package private) static class
SingularValueDecomposition.R128
-