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

12

/external/eigen/doc/snippets/
H A DBiCGSTAB_simple.cpp5 BiCGSTAB<SparseMatrix<double> > solver; variable
6 solver.compute(A);
7 x = solver.solve(b);
8 std::cout << "#iterations: " << solver.iterations() << std::endl;
9 std::cout << "estimated error: " << solver.error() << std::endl;
11 x = solver.solve(b); // solve agai
H A DBiCGSTAB_step_by_step.cpp5 BiCGSTAB<SparseMatrix<double> > solver(A);
8 solver.setMaxIterations(1);
11 x = solver.solveWithGuess(b,x);
12 std::cout << i << " : " << solver.error() << std::endl;
14 } while (solver.info()!=Success && i<100)
/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 Dsparseqr.cpp52 SparseQR<MatrixType, COLAMDOrdering<int> > solver; local
56 solver.compute(A);
58 solver.factorize(A); // this checks that calling analyzePattern is not needed if the pattern do not change.
59 if (solver.info() != Success)
65 x = solver.solve(b);
66 if (solver.info() != Success)
75 //Compare with a dense QR solver
79 VERIFY_IS_EQUAL(dqr.rank(), solver.rank());
80 if(solver.rank()==A.cols()) // full rank
87 Q = solver
[all...]
H A Dsparse_solver.h15 void solve_with_guess(IterativeSolverBase<Solver>& solver, const MatrixBase<Rhs>& b, const Guess& g, Result &x) { argument
19 x = solver.derived().solveWithGuess(b,g) + Result::Zero(x.rows(), x.cols());
24 x = solver.derived().solveWithGuess(b.derived(),g);
29 void solve_with_guess(SparseSolverBase<Solver>& solver, const MatrixBase<Rhs>& b, const Guess& , Result& x) { argument
31 x = solver.derived().solve(b) + Result::Zero(x.rows(), x.cols());
33 x = solver.derived().solve(b);
37 void solve_with_guess(SparseSolverBase<Solver>& solver, const SparseMatrixBase<Rhs>& b, const Guess& , Result& x) { argument
38 x = solver.derived().solve(b);
42 void check_sparse_solving(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const DenseMat& dA, const DenseRhs& db) argument
53 solver
144 check_sparse_solving_real_cases(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const typename Solver::MatrixType& fullA, const Rhs& refX) argument
177 check_sparse_determinant(Solver& solver, const typename Solver::MatrixType& A, const DenseMat& dA) argument
193 check_sparse_abs_determinant(Solver& solver, const typename Solver::MatrixType& A, const DenseMat& dA) argument
256 solver_stats(const IterativeSolverBase<Derived> &solver) argument
269 check_sparse_spd_solving(Solver& solver, int maxSize = 300, int maxRealWorldSize = 100000) argument
354 check_sparse_spd_determinant(Solver& solver) argument
399 check_sparse_square_solving(Solver& solver, int maxSize = 300, int maxRealWorldSize = 100000, bool checkDeficient = false) argument
477 check_sparse_square_determinant(Solver& solver) argument
500 check_sparse_square_abs_determinant(Solver& solver) argument
532 check_sparse_leastsquare_solving(Solver& solver) argument
[all...]
H A Dspqr_support.cpp37 SPQR<MatrixType> solver; local
42 solver.compute(A);
43 if (solver.info() != Success)
49 x = solver.solve(b);
50 if (solver.info() != Success)
56 //Compare with a dense solver
H A Dincomplete_cholesky.cpp60 Eigen::IncompleteCholesky<double> > solver( A );
61 VERIFY(solver.preconditioner().info() == Eigen::Success);
62 VERIFY(solver.info() == Eigen::Success);
H A Deigensolver_generic.cpp134 Eigen::EigenSolver<MatrixXd> solver(A);
135 VERIFY_IS_EQUAL(solver.info(), NumericalIssue);
/external/dng_sdk/source/
H A Ddng_tone_curve.cpp121 void dng_tone_curve::Solve (dng_spline_solver &solver) const
124 solver.Reset ();
129 solver.Add (fCoord [index].h,
134 solver.Solve ();
H A Ddng_tone_curve.h57 void Solve (dng_spline_solver &solver) const;
/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/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
H A DHeuristicBase.h20 /// 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) argument
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 i
[all...]
/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/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/eigen/bench/
H A Ddense_solvers.cpp16 void compute_norm_equation(Solver &solver, const MatrixType &A) { argument
18 solver.compute(A.transpose()*A);
20 solver.compute(A);
25 void compute(Solver &solver, const MatrixType &A) { argument
26 solver.compute(A);
122 cout << "solver/size";
149 cout << "<tr><th>solver/size</th>" << endl;
/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/Eigen/src/Eigenvalues/
H A DSelfAdjointEigenSolver.h626 static inline void run(SolverType& solver, const MatrixType& mat, int options) argument
634 EigenvectorsType& eivecs = solver.m_eivec;
635 VectorType& eivals = solver.m_eivalues;
704 solver.m_info = Success;
705 solver.m_isInitialized = true;
706 solver.m_eigenvectorsOk = computeEigenvectors;
730 static inline void run(SolverType& solver, const MatrixType& mat, int options) argument
741 EigenvectorsType& eivecs = solver.m_eivec;
742 VectorType& eivals = solver.m_eivalues;
788 solver
[all...]
/external/eigen/unsupported/test/
H A DNonLinearOptimization.cpp292 HybridNonLinearSolver<hybrj_functor> solver(functor);
293 info = solver.hybrj1(x);
297 VERIFY_IS_EQUAL(solver.nfev, 11);
298 VERIFY_IS_EQUAL(solver.njev, 1);
301 VERIFY_IS_APPROX(solver.fvec.blueNorm(), 1.192636e-08);
325 HybridNonLinearSolver<hybrj_functor> solver(functor);
326 solver.diag.setConstant(n, 1.);
327 solver.useExternalScaling = true;
328 info = solver.solve(x);
332 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...]
H A Dcvfundam.cpp526 CvLevMarq solver(8, 0, cvTermCriteria(CV_TERMCRIT_ITER+CV_TERMCRIT_EPS, maxIters, DBL_EPSILON));
530 CvMat modelPart = cvMat( solver.param->rows, solver.param->cols, model->type, model->data.ptr );
531 cvCopy( &modelPart, solver.param );
539 if( !solver.updateAlt( _param, _JtJ, _JtErr, _errNorm ))
570 cvCopy( solver.param, &modelPart );
/external/opencv/ml/src/
H A Dmlsvm.cpp1143 solver = 0;
1164 delete solver;
1166 solver = 0;
1182 solver = 0;
1277 solver = new CvSVMSolver;
1297 ok = svm_type == C_SVC ? solver->solve_c_svc( sample_count, var_count, samples, (schar*)_responses,
1299 svm_type == NU_SVC ? solver->solve_nu_svc( sample_count, var_count, samples, (schar*)_responses,
1301 svm_type == ONE_CLASS ? solver->solve_one_class( sample_count, var_count, samples,
1303 svm_type == EPS_SVR ? solver->solve_eps_svr( sample_count, var_count, samples, (float*)_responses,
1305 svm_type == NU_SVR ? solver
[all...]
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h40 /// solver stack. If no nodes can be proven allocable then the node with
41 /// the lowest estimated spill cost is selected and push to the solver stack
112 /// @param solver A reference to the solver which is using this heuristic.
113 Briggs(HeuristicSolverImpl<Briggs> &solver) : argument
114 HeuristicBase<Briggs>(solver) {}

Completed in 1704 milliseconds

12