| /external/eigen/bench/spbench/ |
| 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...] |
| 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...] |
| 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...] |
| /external/eigen/test/ |
| sparse_solver.h | 13 template<typename Solver, typename Rhs, typename DenseMat, typename DenseRhs>
14 void check_sparse_solving(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const DenseMat& dA, const DenseRhs& db)
16 typedef typename Solver::MatrixType Mat;
24 solver.compute(A);
25 if (solver.info() != Success)
27 std::cerr << "sparse solver testing: factorization failed (check_sparse_solving)\n";
31 x = solver.solve(b);
32 if (solver.info() != Success
[all...] |
| 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...] |
| 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
|
| /external/dng_sdk/source/ |
| dng_tone_curve.h | 57 void Solve (dng_spline_solver &solver) const;
|
| dng_tone_curve.cpp | 121 void dng_tone_curve::Solve (dng_spline_solver &solver) const
124 solver.Reset ();
129 solver.Add (fCoord [index].h,
134 solver.Solve ();
|
| /external/opencv3/modules/core/test/ |
| test_conjugate_gradient.cpp | 44 static void mytest(cv::Ptr<cv::ConjGradSolver> solver,cv::Ptr<cv::MinProblemSolver::Function> ptr_F,cv::Mat& x,
46 solver->setFunction(ptr_F);
48 double res=solver->minimize(x);
86 cv::Ptr<cv::ConjGradSolver> solver=cv::ConjGradSolver::create();
93 mytest(solver,ptr_F,x,etalon_x,etalon_res);
102 mytest(solver,ptr_F,x,etalon_x,etalon_res);
|
| test_downhill_simplex.cpp | 46 static void mytest(cv::Ptr<cv::DownhillSolver> solver,cv::Ptr<cv::MinProblemSolver::Function> ptr_F,cv::Mat& x,cv::Mat& step,
48 solver->setFunction(ptr_F);
50 solver->setInitStep(step);
52 solver->getInitStep(settedStep);
56 double res=solver->minimize(x);
61 double tol=1e-2;//solver->getTermCriteria().epsilon;
84 cv::Ptr<cv::DownhillSolver> solver=cv::DownhillSolver::create();
92 mytest(solver,ptr_F,x,step,etalon_x,etalon_res);
102 mytest(solver,ptr_F,x,step,etalon_x,etalon_res);
|
| /external/ceres-solver/ |
| import_ceres_upstream.sh | 18 declare -r temp_repo="/tmp/ceres-solver"
21 https://ceres-solver.googlesource.com/ceres-solver \
42 echo "URL: https://ceres-solver.googlesource.com/ceres-solver/+archive/$commit.tar.gz" >> $temp_readme
|
| patch_from_client.sh | 18 declare -r temp_repo="/tmp/ceres-solver"
20 /usr/local/google/home/sameeragarwal/ceres-solver -b testing\
41 echo "URL: https://ceres-solver.googlesource.com/ceres-solver/+/$commit" >> $temp_readme
|
| /external/ceres-solver/internal/ceres/ |
| symmetric_linear_solver_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
33 // old Conjugate Gradients solver.
70 ConjugateGradientsSolver solver(options);
72 solver.Solve(A.get(), b.data(), per_solve_options, x.data());
127 ConjugateGradientsSolver solver(options);
129 solver.Solve(A.get(), b.data(), per_solve_options, x.data());
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/MLCPSolvers/ |
| btMLCPSolver.h | 59 btMLCPSolver( btMLCPSolverInterface* solver);
62 void setMLCPSolver(btMLCPSolverInterface* solver)
64 m_solver = solver;
|
| /external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/bullet/ |
| 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...] |
| 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);
|
| /external/ceres-solver/scripts/ |
| make_release | 3 # Ceres Solver - A fast non-linear least squares minimizer
5 # http://code.google.com/p/ceres-solver/
41 TMP="/tmp/ceres-solver-$1"
42 DOCS_TMP="/tmp/ceres-solver-docs-$1"
54 VERSION_IN_SPEC=$(grep '^Version:' scripts/ceres-solver.spec | \
84 echo "ERROR: Version string from scripts/ceres-solver.spec, which is"
107 tar -cvzf "ceres-solver-$1.tar.gz" "ceres-solver-$1"
117 - Upload /tmp/ceres-solver-$1.tar.gz
119 - Update the release string in scripts/ceres-solver.spec if this is a R
[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/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/Dynamics/ |
| btSimpleDynamicsWorld.h | 76 virtual void setConstraintSolver(btConstraintSolver* solver);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| 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...] |
| GaussNewtonOptimizer.java | 32 * Gauss-Newton least-squares solver.
109 DecompositionSolver solver = useLU ? local
112 final double[] dX = solver.solve(b);
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 565 static inline void run(SolverType& solver, const MatrixType& mat, int options)
573 MatrixType& eivecs = solver.m_eivec;
574 VectorType& eivals = solver.m_eivalues;
643 solver.m_info = Success;
644 solver.m_isInitialized = true;
645 solver.m_eigenvectorsOk = computeEigenvectors;
665 static inline void run(SolverType& solver, const MatrixType& mat, int options)
676 MatrixType& eivecs = solver.m_eivec;
677 VectorType& eivals = solver.m_eivalues;
718 solver.m_info = Success
[all...] |
| /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 | |
