| /external/eigen/test/ |
| spqr_support.cpp | 35 SPQR<MatrixType> solver; local
40 solver.compute(A);
41 if (solver.info() != Success)
47 x = solver.solve(b);
48 if (solver.info() != Success)
54 //Compare with a dense solver
|
| sparseqr.cpp | 51 SparseQR<MatrixType, COLAMDOrdering<int> > solver; local
55 solver.compute(A);
57 solver.factorize(A); // this checks that calling analyzePattern is not needed if the pattern do not change.
58 if (solver.info() != Success)
64 x = solver.solve(b);
65 if (solver.info() != Success)
74 //Compare with a dense QR solver
78 VERIFY_IS_EQUAL(dqr.rank(), solver.rank());
79 if(solver.rank()==A.cols()) // full rank
86 Q = solver.matrixQ()
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| UnivariateRealSolverUtils.java | 43 * solver is used.
62 * solver is used.
67 * @param absoluteAccuracy the accuracy to be used by the solver
73 * default solver
80 UnivariateRealSolver solver = LazyHolder.FACTORY.newDefaultSolver(); local
81 solver.setAbsoluteAccuracy(absoluteAccuracy);
82 return solver.solve(f, x0, x1);
235 /** Cached solver factory */
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| GaussNewtonOptimizer.java | 32 * Gauss-Newton least-squares solver.
109 DecompositionSolver solver = useLU ? local
112 final double[] dX = solver.solve(b);
|
| NonLinearConjugateGradientOptimizer.java | 53 /** solver to use in the line search (may be null). */
54 private UnivariateRealSolver solver; field in class:NonLinearConjugateGradientOptimizer
71 solver = null;
85 * Set the solver to use during line search.
86 * @param lineSearchSolver solver to use during line search, may be null
87 * to remove an already registered solver and fall back to the
88 * default {@link BrentSolver Brent solver}.
91 this.solver = lineSearchSolver;
122 if (solver == null) {
123 solver = new BrentSolver()
[all...] |
| /external/eigen/bench/spbench/ |
| sp_solver.cpp | 28 //SparseLU<SparseMatrix<double, ColMajor> > solver;
29 // SuperLU<SparseMatrix<double, ColMajor> > solver;
30 ConjugateGradient<SparseMatrix<double, ColMajor>, Lower,IncompleteCholesky<double,Lower> > solver; local
35 // solver.iparm(IPARM_THREAD_NBR) = 4;
74 // solver.set_restart(374);
95 solver.compute(A);
96 // solver.analyzePattern(A);
97 // solver.factorize(A);
98 if (solver.info() != Success) {
99 std::cout<< "The solver failed \n"
[all...] |
| test_sparseLU.cpp | 26 // SparseLU<SparseMatrix<scalar, ColMajor>, AMDOrdering<int> > solver;
28 // SparseLU<SparseMatrix<scalar, ColMajor>, MetisOrdering<int> > solver;
31 SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<int> > solver; local
70 // solver.isSymmetric(true);
72 // solver.compute(A);
73 solver.analyzePattern(A);
78 solver.factorize(A);
83 x = solver.solve(b);
90 cout << "Number of nonzeros in the factor : " << solver.nnzL() + solver.nnzU() << std::endl;
[all...] |
| spbenchsolver.h | 83 int best_time_id; // id of the best solver for the current system
107 out <<" <SOLVER ID='" << EIGEN_UMFPACK << "'>\n";
110 out << " </SOLVER> \n";
113 out <<" <SOLVER ID='" << EIGEN_SUPERLU << "'>\n";
116 out << " </SOLVER> \n";
119 out <<" <SOLVER ID='" << EIGEN_CHOLMOD_SIMPLICIAL_LLT << "'>\n";
122 out << " </SOLVER> \n";
124 out <<" <SOLVER ID='" << EIGEN_CHOLMOD_SUPERNODAL_LLT << "'>\n";
127 out << " </SOLVER> \n";
129 out <<" <SOLVER ID='" << EIGEN_CHOLMOD_LDLT << "'>\n";
315 UmfPackLU<SpMat> solver; local
323 SuperLU<SpMat> solver; local
332 PastixLU<SpMat> solver; local
341 PardisoLU<SpMat> solver; local
348 SparseLU<SpMat, COLAMDOrdering<int> > solver; local
354 SparseLU<SpMat, MetisOrdering<int> > solver; local
362 BiCGSTAB<SpMat> solver; local
368 BiCGSTAB<SpMat, IncompleteLUT<Scalar> > solver; local
382 GMRES<SpMat, IncompleteLUT<Scalar> > solver; local
392 SimplicialLDLT<SpMat, Lower> solver; local
400 CholmodDecomposition<SpMat, Lower> solver; local
410 PastixLDLT<SpMat, Lower> solver; local
419 PardisoLDLT<SpMat, Lower> solver; local
432 SimplicialLLT<SpMat, Lower> solver; local
441 CholmodDecomposition<SpMat, Lower> solver; local
455 PastixLLT<SpMat, Lower> solver; local
464 PardisoLLT<SpMat, Lower> solver; local
472 ConjugateGradient<SpMat, Lower> solver; local
[all...] |
| /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/bullet/ |
| CollisionDispatcherTest.java | 51 btSequentialImpulseConstraintSolver solver = new btSequentialImpulseConstraintSolver(); local
52 btDiscreteDynamicsWorld collisionWorld = new btDiscreteDynamicsWorld(dispatcher, broadphase, solver, collisionConfiguration);
53 return new BulletWorld(collisionConfiguration, dispatcher, broadphase, solver, collisionWorld);
|
| BulletWorld.java | 49 public final btConstraintSolver solver; field in class:BulletWorld
58 final btBroadphaseInterface broadphase, final btConstraintSolver solver, final btCollisionWorld world, final Vector3 gravity) {
62 this.solver = solver;
69 final btBroadphaseInterface broadphase, final btConstraintSolver solver, final btCollisionWorld world) {
70 this(collisionConfiguration, dispatcher, broadphase, solver, world, new Vector3(0, -10, 0));
77 solver = new btSequentialImpulseConstraintSolver();
78 collisionWorld = new btDiscreteDynamicsWorld(dispatcher, broadphase, solver, collisionConfiguration);
137 if (solver != null) solver.dispose()
[all...] |
| BasicBulletTest.java | 61 btConstraintSolver solver; field in class:BasicBulletTest
129 solver = new btSequentialImpulseConstraintSolver();
130 collisionWorld = new btDiscreteDynamicsWorld(dispatcher, broadphase, solver, collisionConfiguration);
200 solver.dispose();
|
| CharacterTest.java | 55 btSequentialImpulseConstraintSolver solver = new btSequentialImpulseConstraintSolver(); local
56 btDiscreteDynamicsWorld collisionWorld = new btDiscreteDynamicsWorld(dispatcher, sweep, solver, collisionConfiguration);
59 return new BulletWorld(collisionConfiguration, dispatcher, sweep, solver, collisionWorld);
|
| SoftMeshTest.java | 53 btSequentialImpulseConstraintSolver solver = new btSequentialImpulseConstraintSolver(); local
54 btSoftRigidDynamicsWorld dynamicsWorld = new btSoftRigidDynamicsWorld(dispatcher, broadphase, solver,
62 return new BulletWorld(collisionConfiguration, dispatcher, broadphase, solver, dynamicsWorld);
|
| SoftBodyTest.java | 63 btSequentialImpulseConstraintSolver solver = new btSequentialImpulseConstraintSolver(); local
64 btSoftRigidDynamicsWorld dynamicsWorld = new btSoftRigidDynamicsWorld(dispatcher, broadphase, solver,
72 return new BulletWorld(collisionConfiguration, dispatcher, broadphase, solver, dynamicsWorld);
|
| OcclusionCullingTest.java | 285 btSequentialImpulseConstraintSolver solver = new btSequentialImpulseConstraintSolver(); local
287 btDiscreteDynamicsWorld collisionWorld = new btDiscreteDynamicsWorld(dispatcher, broadphase, solver, collisionConfig);
288 return new BulletWorld(collisionConfig, dispatcher, broadphase, solver, collisionWorld);
|
| /external/ceres-solver/internal/ceres/ |
| solver.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
33 #include "ceres/solver.h"
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)
334 Solver solver; local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/ |
| EventState.java | 151 // If an ODE solver is setup with an EventHandler that return STOP
154 // solver from the final state reached at the event with the same
160 // less than epsilon after the solver start in the first step should be ignored,
242 final BrentSolver solver = new BrentSolver(convergence); local
250 // shift ta to make sure ga and gb get opposite signs and the solver won't complain
270 solver.solve(maxIterationCount, f, ta, tb) :
271 solver.solve(maxIterationCount, f, tb, ta);
|
| /prebuilts/eclipse/mavenplugins/tycho/tycho-dependencies-m2repo/org/eclipse/tycho/tycho-bundles-external/0.20.0/eclipse/plugins/ |
| org.sat4j.core_2.3.5.v201308161310.jar | |
| org.sat4j.pb_2.3.5.v201308161310.jar | |
| /prebuilts/tools/common/m2/repository/org/eclipse/tycho/tycho-bundles-external/0.18.1/eclipse/plugins/ |
| org.sat4j.core_2.3.5.v20130525.jar | |
| org.sat4j.pb_2.3.5.v20130525.jar | |
| /external/v8/benchmarks/ |
| navier-stokes.js | 33 var solver = null; variable
37 solver.update();
42 solver = new FluidField(null);
43 solver.setResolution(128, 128);
44 solver.setIterations(20);
45 solver.setDisplayFunction(function(){});
46 solver.setUICallback(prepareFrame);
47 solver.reset();
52 solver = null;
|
| /external/opencv/ml/include/ |
| ml.h | 551 CvSVMSolver* solver; member in class:CvSVM
[all...] |
| /external/opencv3/apps/traincascade/ |
| old_ml.hpp | 556 CvSVMSolver* solver; member in class:CvSVM
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.sat4j.core_2.2.0.v20100429.jar | |
