/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...] |
eigensolver_generic.cpp | 108 Eigen::EigenSolver<MatrixXd> solver(A); 110 V(0,0) = solver.eigenvectors()(0,0).real();
|
/external/eigen/bench/spbench/ |
spbenchsolver.h | 125 template<typename Solver, typename Scalar> 126 Stats call_solver(Solver &solver, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX) 133 solver.compute(A); 134 if (solver.info() != Success) 137 std::cerr << "Solver failed ... \n"; 145 x = solver.solve(b); 146 if (solver.info() == NumericalIssue) 149 std::cerr << "Solver failed ... \n" 297 UmfPackLU<SpMat> solver; local 306 SuperLU<SpMat> solver; local 316 PastixLU<SpMat> solver; local 326 PardisoLU<SpMat> solver; local 337 BiCGSTAB<SpMat> solver; local 345 BiCGSTAB<SpMat, IncompleteLUT<Scalar> > solver; local 363 GMRES<SpMat, IncompleteLUT<Scalar> > solver; local 375 SimplicialLDLT<SpMat, Lower> solver; local 384 CholmodDecomposition<SpMat, Lower> solver; local 395 PastixLDLT<SpMat, Lower> solver; local 405 PardisoLDLT<SpMat, Lower> solver; local 419 SimplicialLLT<SpMat, Lower> solver; local 429 CholmodDecomposition<SpMat, Lower> solver; local 445 PastixLLT<SpMat, Lower> solver; local 455 PardisoLLT<SpMat, Lower> solver; local 464 ConjugateGradient<SpMat, Lower> solver; local [all...] |
/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());
|
unsymmetric_linear_solver_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 60 scoped_ptr<LinearSolver> solver(LinearSolver::Create(options)); 85 LOG(FATAL) << "Unknown linear solver : " << options.type; 89 solver->Solve(transformed_A.get(), 97 solver->Solve(transformed_A.get(),
|
polynomial.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 165 Eigen::EigenSolver<Matrix> solver(companion_matrix, false); 166 if (solver.info() != Eigen::Success) { 173 *real = solver.eigenvalues().real(); 180 *imaginary = solver.eigenvalues().imag();
|
solver_impl_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 286 Solver::Options options; 348 Solver::Options options; 417 Solver::Options options; 500 Solver::Options options; 510 Solver::Options options; 521 Solver::Options options; 532 Solver::Options options; 543 Solver::Options options 579 scoped_ptr<LinearSolver> solver; local [all...] |
schur_complement_solver_test.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 105 scoped_ptr<LinearSolver> solver(LinearSolver::Create(options)); 113 summary = solver->Solve(A.get(), b.get(), per_solve_options, x.get());
|
solver.cc | 1 // Ceres Solver - A fast non-linear least squares minimizer 3 // http://code.google.com/p/ceres-solver/ 32 #include "ceres/solver.h" 59 Solver::Options::~Options() { 64 Solver::~Solver() {} 66 void Solver::Solve(const Solver::Options& options, 68 Solver::Summary* summary) { 77 void Solve(const Solver::Options& options 80 Solver solver; local [all...] |
/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...] |
ceres-solver.spec | 1 Name: ceres-solver 11 URL: http://code.google.com/p/ceres-solver/ 34 Ceres Solver is a portable C++ library that allows for modeling and solving 49 Notable use of Ceres Solver is for the image alignment in Google Maps and for
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
HeuristicBase.h | 20 /// solver behaviour implemented for a number of methods. 37 /// the solver which is using this heuristic. 72 /// \brief Construct an instance with a reference to the given solver. 73 /// @param solver The solver which is using this heuristic instance. 74 HeuristicBase(HeuristicSolverImpl<HImpl> &solver) 75 : s(solver), g(s.getGraph()) { } 77 /// \brief Get the solver which is using this heuristic instance. 78 /// @return The solver which is using this heuristic instance. 80 /// You can use this method to get access to the solver in your derive [all...] |
/external/eigen/Eigen/src/Eigenvalues/ |
SelfAdjointEigenSolver.h | 541 static inline void run(SolverType& solver, const MatrixType& mat, int options) 550 MatrixType& eivecs = solver.m_eivec; 551 VectorType& eivals = solver.m_eivalues; 606 solver.m_info = NumericalIssue; 607 solver.m_isInitialized = true; 608 solver.m_eigenvectorsOk = computeEigenvectors; 654 solver.m_info = Success; 655 solver.m_isInitialized = true; 656 solver.m_eigenvectorsOk = computeEigenvectors; 676 static inline void run(SolverType& solver, const MatrixType& mat, int options [all...] |
/external/jmonkeyengine/engine/src/bullet-native/ |
jmePhysicsSpace.cpp | 93 PosixThreadSupport::ThreadConstructionInfo solverConstructionInfo("solver", processCollisionTask, 141 btConstraintSolver* solver; local 151 // the default constraint solver. For parallel processing you can use a different solver (see Extras/BulletMultiThreaded) 154 solver = new btParallelConstraintSolver(solverThreads); 156 solver = new btSequentialImpulseConstraintSolver; 160 btDiscreteDynamicsWorld* world = new btDiscreteDynamicsWorld(dispatcher, broadphase, solver, collisionConfiguration); 164 //parallel solver requires the contacts to be in a contiguous pool, so avoid dynamic allocation
|
/cts/suite/cts/deviceTests/browserbench/assets/octane/ |
navier-stokes.js | 34 var solver = null; variable 39 solver.update(); 43 checkResult(solver.getDens()); 60 solver = new FluidField(null); 61 solver.setResolution(128, 128); 62 solver.setIterations(20); 63 solver.setDisplayFunction(function(){}); 64 solver.setUICallback(prepareFrame); 65 solver.reset(); 70 solver = null [all...] |
/external/chromium_org/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/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/eigen/unsupported/test/ |
NonLinearOptimization.cpp | 289 HybridNonLinearSolver<hybrj_functor> solver(functor); 290 info = solver.hybrj1(x); 294 VERIFY_IS_EQUAL(solver.nfev, 11); 295 VERIFY_IS_EQUAL(solver.njev, 1); 298 VERIFY_IS_APPROX(solver.fvec.blueNorm(), 1.192636e-08); 322 HybridNonLinearSolver<hybrj_functor> solver(functor); 323 solver.diag.setConstant(n, 1.); 324 solver.useExternalScaling = true; 325 info = solver.solve(x); 329 VERIFY_IS_EQUAL(solver.nfev, 11) [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
SVGResourcesCache.cpp | 57 SVGResourcesCycleSolver solver(object, resources); 58 solver.resolveCycles();
|
/external/opencv/cv/src/ |
cvcalibration.cpp | [all...] |
/external/ceres-solver/jni/ |
Application.mk | 1 # Ceres Solver - A fast non-linear least squares minimizer 3 # http://code.google.com/p/ceres-solver/
|
/external/opencv/ml/src/ |
mlsvm.cpp | 1143 solver = 0; 1164 delete solver; 1166 solver = 0; 1182 solver = 0; [all...] |
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
Briggs.h | 39 /// solver stack. If no nodes can be proven allocable then the node with 40 /// the lowest estimated spill cost is selected and push to the solver stack 111 /// @param solver A reference to the solver which is using this heuristic. 112 Briggs(HeuristicSolverImpl<Briggs> &solver) : 113 HeuristicBase<Briggs>(solver) {}
|