| /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...] |
| 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 | 52 SparseQR<MatrixType, COLAMDOrdering<int> > solver; local
56 solver.compute(A);
57 if (solver.info() != Success)
63 x = solver.solve(b);
64 if (solver.info() != Success)
73 //Compare with a dense QR solver
77 VERIFY_IS_EQUAL(dqr.rank(), solver.rank());
78 if(solver.rank()==A.cols()) // full rank
85 Q = solver.matrixQ();
|
| eigensolver_generic.cpp | 118 Eigen::EigenSolver<MatrixXd> solver(A);
120 V(0,0) = solver.eigenvectors()(0,0).real();
|
| /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/
85 LOG(FATAL) << "Unknown linear solver : " << options.type;
89 scoped_ptr<LinearSolver> solver(LinearSolver::Create(options));
91 solver->Solve(transformed_A.get(),
96 // Sparsity structure is changing, reset the solver.
97 solver.reset(LinearSolver::Create(options));
101 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/
233 Eigen::EigenSolver<Matrix> solver(companion_matrix, false);
234 if (solver.info() != Eigen::Success) {
241 *real = solver.eigenvalues().real();
248 *imaginary = solver.eigenvalues().imag();
|
| 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());
|
| /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://ceres-solver.org/
34 Ceres Solver is a portable C++ library that allows for modeling and solving
50 Notable use of Ceres Solver is for the image alignment in Google Maps and for
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 543 static inline void run(SolverType& solver, const MatrixType& mat, int options)
552 MatrixType& eivecs = solver.m_eivec;
553 VectorType& eivals = solver.m_eivalues;
608 solver.m_info = NumericalIssue;
609 solver.m_isInitialized = true;
610 solver.m_eigenvectorsOk = computeEigenvectors;
656 solver.m_info = Success;
657 solver.m_isInitialized = true;
658 solver.m_eigenvectorsOk = computeEigenvectors;
678 static inline void run(SolverType& solver, const MatrixType& mat, int options
[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 | |
| org.sat4j.pb_2.3.5.v20130525.jar | |
| /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/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
| SVGResourcesCache.cpp | 56 SVGResourcesCycleSolver solver(object, resources);
57 solver.resolveCycles();
|
| /external/eigen/unsupported/test/ |
| NonLinearOptimization.cpp | 291 HybridNonLinearSolver<hybrj_functor> solver(functor);
292 info = solver.hybrj1(x);
296 VERIFY_IS_EQUAL(solver.nfev, 11);
297 VERIFY_IS_EQUAL(solver.njev, 1);
300 VERIFY_IS_APPROX(solver.fvec.blueNorm(), 1.192636e-08);
324 HybridNonLinearSolver<hybrj_functor> solver(functor);
325 solver.diag.setConstant(n, 1.);
326 solver.useExternalScaling = true;
327 info = solver.solve(x);
331 VERIFY_IS_EQUAL(solver.nfev, 11)
[all...] |
| /external/opencv/cv/src/ |
| cvcalibration.cpp | [all...] |
