Uses of Interface
org.ojalgo.matrix.task.SolverTask
Packages that use SolverTask
Package
Description
-
Uses of SolverTask in org.ojalgo.matrix.decomposition
Subinterfaces of SolverTask in org.ojalgo.matrix.decompositionModifier and TypeInterfaceDescriptioninterfaceCholesky<N extends Comparable<N>>Cholesky: [A] = [L][L]H (or [R]H[R])static interfaceEigenvalue.Spectral<N extends Comparable<N>>“Spectral decomposition” refers specifically to the orthogonal/unitary eigen-decomposition of a normal matrix (most commonly Hermitian / symmetric).interfaceLDL<N extends Comparable<N>>LDL: [A] = [L][D][L]H (or [R]H[D][R])interfaceLDU<N extends Comparable<N>>LDU: [A] = [L][D][U] ( [PL][L][D][U][PU] )interfaceLU<N extends Comparable<N>>LU: [A] = [L][U]static interfaceMatrixDecomposition.Solver<N extends Comparable<N>>interfaceQR<N extends Comparable<N>>QR: [A] = [Q][R] Decomposes [this] into [Q] and [R] where: [Q] is an orthogonal matrix (orthonormal columns).interfaceSingularValue<N extends Comparable<N>>Singular Value: [A] = [U][S][V]T Decomposes [this] into [U], [S] and [V] where: [U] is an orthogonal matrix.Classes in org.ojalgo.matrix.decomposition that implement SolverTaskModifier and TypeClassDescriptionfinal classQuasi-Definite LDL (QDLDL) sparse decomposition. -
Uses of SolverTask in org.ojalgo.matrix.task
Methods in org.ojalgo.matrix.task that return SolverTaskModifier and TypeMethodDescriptionSolverTask.Factory.make(int numberOfEquations, int numberOfVariables, int numberOfSolutions, boolean symmetric, boolean positiveDefinite) SolverTask.Factory.make(MatrixStore<N> templateBody, MatrixStore<N> templateRHS) abstract SolverTask<N> SolverTask.Factory.make(Structure2D templateBody, Structure2D templateRHS, boolean symmetric, boolean positiveDefinite) -
Uses of SolverTask in org.ojalgo.matrix.task.iterative
Classes in org.ojalgo.matrix.task.iterative that implement SolverTaskModifier and TypeClassDescriptionfinal classConjugate Gradient solver for symmetric positive-definite systems [A][x]=[b].final classStationary Gauss–Seidel iteration for solving [A][x]=[b] with non-zero diagonal entries.classBase class for iterative solvers of large linear systems [A][x]=[b].final classStationary Jacobi iteration for solving [A][x]=[b] with non-zero diagonal entries.final classMinimal Residual (MINRES) solver for symmetric (possibly indefinite) square systems.classLightweight mutable wrapper around a list ofEquationrows that delegates solving to anIterativeSolverTask.final classExperimental parallelised stationary iteration based on Gauss–Seidel-style in-place updates.final classQuasi-Minimal Residual (QMR) solver for general nonsymmetric square systems.