| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| H A D | CholeskyDecompositionImpl.java | 187 return new Solver(lTData);
191 private static class Solver implements DecompositionSolver { class in class:CholeskyDecompositionImpl
200 private Solver(final double[][] lTData) { method in class:CholeskyDecompositionImpl.Solver
|
| H A D | FieldLUDecompositionImpl.java | 219 return new Solver<T>(field, lu, pivot, singular);
223 private static class Solver<T extends FieldElement<T>> implements FieldDecompositionSolver<T> { class in class:FieldLUDecompositionImpl
247 private Solver(final Field<T> field, final T[][] lu, method in class:FieldLUDecompositionImpl.Solver
|
| H A D | LUDecompositionImpl.java | 228 return new Solver(lu, pivot, singular);
232 private static class Solver implements DecompositionSolver { class in class:LUDecompositionImpl
249 private Solver(final double[][] lu, final int[] pivot, final boolean singular) { method in class:LUDecompositionImpl.Solver
|
| H A D | QRDecompositionImpl.java | 248 return new Solver(qrt, rDiag);
252 private static class Solver implements DecompositionSolver { class in class:QRDecompositionImpl
270 private Solver(final double[][] qrt, final double[] rDiag) { method in class:QRDecompositionImpl.Solver
|
| H A D | EigenDecompositionImpl.java | 240 return new Solver(realEigenvalues, imagEigenvalues, eigenvectors);
244 private static class Solver implements DecompositionSolver { class in class:EigenDecompositionImpl
264 private Solver(final double[] realEigenvalues, method in class:EigenDecompositionImpl.Solver
|
| H A D | SingularValueDecompositionImpl.java | 268 return new Solver(singularValues, getUT(), getV(), getRank() == Math
273 private static class Solver implements DecompositionSolver { class in class:SingularValueDecompositionImpl
292 private Solver(final double[] singularValues, final RealMatrix uT, method in class:SingularValueDecompositionImpl.Solver
|
| /external/ceres-solver/internal/ceres/ |
| H A D | solver.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
54 ss << string("Solver::Options::" #x " = ") << options.x << ". "; \
56 ss << string("Solver::Options::" #x " " #OP " "#y); \
65 ss << string("Solver::Options::" #x " = ") << options.x << ". "; \
66 ss << string("Solver::Options::" #y " = ") << options.y << ". "; \
68 ss << string("Solver::Options::" #x ); \
69 ss << string(#OP " Solver::Options::" #y "."); \
81 bool CommonOptionsAreValid(const Solver::Options& options, string* error) {
96 bool TrustRegionOptionsAreValid(const Solver::Options& options, string* error) {
124 "Solver
[all...] |
| /external/ceres-solver/include/ceres/ |
| H A D | solver.h | 1 // Ceres Solver - A fast non-linear least squares minimizer
50 class CERES_EXPORT Solver { class in namespace:ceres
52 virtual ~Solver();
477 // {0: x, y} - Solver gets to decide the elimination order.
591 // Solver::Options::num_threads to the maximum number possible is
599 // Solver::Options::inner_iteration_ordering untouched.
962 Solver::Summary* summary);
966 CERES_EXPORT void Solve(const Solver::Options& options,
968 Solver::Summary* summary);
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 179 SolverT *Solver; member in class:llvm::PBQP::Graph
347 Graph() : Solver(nullptr) {}
350 Graph(GraphMetadata Metadata) : Metadata(Metadata), Solver(nullptr) {}
363 assert(!Solver && "Solver already set. Call unsetSolver().");
364 Solver = &S;
366 Solver->handleAddNode(NId);
368 Solver->handleAddEdge(EId);
373 assert(Solver && "Solver no
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| H A D | org.sat4j.core_2.2.0.v20100429.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |