Searched refs:solver (Results 1 - 25 of 35) sorted by relevance

12

/external/eigen/bench/spbench/
H A Dspbenchsolver.h83 int best_time_id; // id of the best solver for the current system
214 void call_solver(Solver &solver, const int solver_id, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX,std::ofstream& statbuf) argument
225 solver.compute(A);
226 if (solver.info() != Success)
239 x = solver.solve(b);
240 if (solver.info() == NumericalIssue)
279 void call_directsolver(Solver& solver, const int solver_id, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX, std::string& statFile) argument
283 call_solver(solver, solver_id, A, b, refX,statbuf);
289 void call_itersolver(Solver &solver, const int solver_id, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>& refX, std::string& statFile) argument
291 solver
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...]
H A Dtest_sparseLU.cpp26 // 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
[all...]
H A Dsp_solver.cpp28 //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 faile
[all...]
/external/eigen/test/
H A Dsparse_solver.h14 void check_sparse_solving(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const DenseMat& dA, const DenseRhs& db) argument
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)
34 std::cerr << "sparse solver testing: solving failed\n";
37 VERIFY(oldb.isApprox(b) && "sparse solver testing: the rhs should not be modified!");
42 solver.analyzePattern(A);
43 solver
73 check_sparse_solving_real_cases(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const Rhs& refX) argument
112 check_sparse_determinant(Solver& solver, const typename Solver::MatrixType& A, const DenseMat& dA) argument
128 check_sparse_abs_determinant(Solver& solver, const typename Solver::MatrixType& A, const DenseMat& dA) argument
183 check_sparse_spd_solving(Solver& solver) argument
243 check_sparse_spd_determinant(Solver& solver) argument
277 check_sparse_square_solving(Solver& solver) argument
328 check_sparse_square_determinant(Solver& solver) argument
344 check_sparse_square_abs_determinant(Solver& solver) argument
[all...]
H A Dsparseqr.cpp51 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
[all...]
H A Dspqr_support.cpp35 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
H A Deigensolver_generic.cpp118 Eigen::EigenSolver<MatrixXd> solver(A);
120 V(0,0) = solver.eigenvectors()(0,0).real();
/external/ceres-solver/
H A Dimport_ceres_upstream.sh18 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
H A Dpatch_from_client.sh18 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/
H A Dsymmetric_linear_solver_test.cc3 // 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());
H A Dunsymmetric_linear_solver_test.cc3 // 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(),
H A Dpolynomial.cc3 // 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();
H A Dschur_complement_solver_test.cc3 // 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/
H A Dmake_release5 # 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 RC
H A Dceres-solver.spec1 Name: ceres-solver
11 URL: http://ceres-solver.org/
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
H A DUnivariateRealSolverUtils.java43 * 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();
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/
H A DNonLinearConjugateGradientOptimizer.java53 /** 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
[all...]
H A DGaussNewtonOptimizer.java32 * Gauss-Newton least-squares solver.
109 DecompositionSolver solver = useLU ?
112 final double[] dX = solver.solve(b);
/external/eigen/Eigen/src/Eigenvalues/
H A DSelfAdjointEigenSolver.h543 static inline void run(SolverType& solver, const MatrixType& mat, int options) argument
552 MatrixType& eivecs = solver.m_eivec;
553 VectorType& eivals = solver.m_eivalues;
613 solver.m_info = NumericalIssue;
614 solver.m_isInitialized = true;
615 solver.m_eigenvectorsOk = computeEigenvectors;
666 solver.m_info = Success;
667 solver.m_isInitialized = true;
668 solver.m_eigenvectorsOk = computeEigenvectors;
688 static inline void run(SolverType& solver, cons argument
[all...]
/external/v8/benchmarks/
H A Dnavier-stokes.js33 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/jmonkeyengine/engine/src/bullet-native/
H A DjmePhysicsSpace.cpp93 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
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/
H A DEventState.java151 // 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);
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);
/external/eigen/unsupported/test/
H A DNonLinearOptimization.cpp291 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
[all...]
/external/opencv/cv/src/
H A Dcvcalibration.cpp1453 CvLevMarq solver;
1545 // 1. initialize intrinsic parameters & LM solver
1588 solver.init( nparams, 0, cvTermCriteria(CV_TERMCRIT_ITER+CV_TERMCRIT_EPS,30,DBL_EPSILON) );
1591 double* param = solver.param->data.db;
1592 uchar* mask = solver.mask->data.ptr;
1621 cvGetRows( solver.param, &_ri, NINTRINSIC + i*6, NINTRINSIC + i*6 + 3 );
1622 cvGetRows( solver.param, &_ti, NINTRINSIC + i*6 + 3, NINTRINSIC + i*6 + 6 );
1636 bool proceed = solver.updateAlt( _param, _JtJ, _JtErr, _errNorm );
1637 double *param = solver.param->data.db, *pparam = solver
[all...]
/external/ceres-solver/jni/
H A DApplication.mk3 # http://code.google.com/p/ceres-solver/

Completed in 471 milliseconds

12