Home
last modified time | relevance | path

Searched refs:solver (Results 1 – 25 of 75) sorted by relevance

123

/external/eigen/bench/spbench/
Dspbenchsolver.h214 void call_solver(Solver &solver, const int solver_id, const typename Solver::MatrixType& A, const M… in call_solver() argument
225 solver.compute(A); in call_solver()
226 if (solver.info() != Success) in call_solver()
239 x = solver.solve(b); in call_solver()
240 if (solver.info() == NumericalIssue) in call_solver()
279 void call_directsolver(Solver& solver, const int solver_id, const typename Solver::MatrixType& A, c… in call_directsolver() argument
283 call_solver(solver, solver_id, A, b, refX,statbuf); in call_directsolver()
289 void call_itersolver(Solver &solver, const int solver_id, const typename Solver::MatrixType& A, con… in call_itersolver() argument
291 solver.setTolerance(RelErr); in call_itersolver()
292 solver.setMaxIterations(MaximumIters); in call_itersolver()
[all …]
Dtest_sparseLU.cpp31 SparseLU<SparseMatrix<scalar, ColMajor>, COLAMDOrdering<int> > solver; in main() local
73 solver.analyzePattern(A); in main()
78 solver.factorize(A); in main()
83 x = solver.solve(b); in main()
90 cout << "Number of nonzeros in the factor : " << solver.nnzL() + solver.nnzU() << std::endl; in main()
Dsp_solver.cpp30 …ConjugateGradient<SparseMatrix<double, ColMajor>, Lower,IncompleteCholesky<double,Lower> > solver; in main() local
95 solver.compute(A); in main()
98 if (solver.info() != Success) { in main()
108 x = solver.solve(b); in main()
/external/eigen/test/
Dsparse_solver.h14 void check_sparse_solving(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const… in check_sparse_solving() argument
24 solver.compute(A); in check_sparse_solving()
25 if (solver.info() != Success) in check_sparse_solving()
31 x = solver.solve(b); in check_sparse_solving()
32 if (solver.info() != Success) in check_sparse_solving()
42 solver.analyzePattern(A); in check_sparse_solving()
43 solver.factorize(A); in check_sparse_solving()
44 if (solver.info() != Success) in check_sparse_solving()
50 x = solver.solve(b); in check_sparse_solving()
51 if (solver.info() != Success) in check_sparse_solving()
[all …]
Dsparseqr.cpp51 SparseQR<MatrixType, COLAMDOrdering<int> > solver; in test_sparseqr_scalar() local
55 solver.compute(A); in test_sparseqr_scalar()
57 …solver.factorize(A); // this checks that calling analyzePattern is not needed if the pattern do n… in test_sparseqr_scalar()
58 if (solver.info() != Success) in test_sparseqr_scalar()
64 x = solver.solve(b); in test_sparseqr_scalar()
65 if (solver.info() != Success) in test_sparseqr_scalar()
78 VERIFY_IS_EQUAL(dqr.rank(), solver.rank()); in test_sparseqr_scalar()
79 if(solver.rank()==A.cols()) // full rank in test_sparseqr_scalar()
86 Q = solver.matrixQ(); in test_sparseqr_scalar()
Dspqr_support.cpp35 SPQR<MatrixType> solver; in test_spqr_scalar() local
40 solver.compute(A); in test_spqr_scalar()
41 if (solver.info() != Success) in test_spqr_scalar()
47 x = solver.solve(b); in test_spqr_scalar()
48 if (solver.info() != Success) in test_spqr_scalar()
/external/ceres-solver/
DREADME.google1 URL: https://ceres-solver.googlesource.com/ceres-solver/+archive/cfb36463f9c1f806121779d651c7105ad8…
7 Ceres (http://ceres-solver.googlecode.com) is a portable non-linear
8 least squares solver, developed at Google. It is now open-source.
10 Website : https://code.google.com/p/ceres-solver/
11 Code : https://ceres-solver.googlesource.com/ceres-solver/
Dimport_ceres_upstream.sh21 https://ceres-solver.googlesource.com/ceres-solver \
/external/ceres-solver/docs/source/
Dindex.rst57 <http://ceres-solver.org/ceres-solver-1.9.0.tar.gz>`_ or clone the
62 git clone https://ceres-solver.googlesource.com/ceres-solver
67 <https://groups.google.com/forum/?fromgroups#!forum/ceres-solver>`_
70 <https://code.google.com/p/ceres-solver/issues/list>`_.
77 @misc{ceres-solver,
80 howpublished = "\url{http://ceres-solver.org}",
Dtutorial.rst29 <https://ceres-solver.googlesource.com/ceres-solver/+/master/examples/>`_
113 // Run the solver!
131 <https://ceres-solver.googlesource.com/ceres-solver/+/master/examples/helloworld.cc>`_
143 Starting from a :math:`x=5`, the solver in two iterations goes to 10
146 default configuration of the solver is aimed at non-linear problems,
149 in one iteration. Also note that the solver did get very close to the
157 <https://ceres-solver.googlesource.com/ceres-solver/+/master/examples/helloworld.cc>`_
159 .. [#f2] Actually the solver ran for three iterations, and it was
160 by looking at the value returned by the linear solver in the third
180 <https://ceres-solver.googlesource.com/ceres-solver/+/master/examples/helloworld.cc>`_
[all …]
Dcontributing.rst9 <http://groups.google.com/group/ceres-solver>`_ list is the best place
21 `Gerrit <https://ceres-solver-review.googlesource.com/>`_ to collaborate and
41 <https://ceres-solver-review.googlesource.com/>`_. You will also
50 git clone https://ceres-solver.googlesource.com/ceres-solver
65 … curl -o .git/hooks/commit-msg https://ceres-solver-review.googlesource.com/tools/hooks/commit-msg
72 * Sign into `http://ceres-solver-review.googlesource.com
73 <http://ceres-solver-review.googlesource.com>`_.
Dfaqs.rst126 #. Choosing a linear solver.
129 solver is an important decision. It affects solution quality and
149 more) use the ``ITERATIVE_SCHUR`` solver. There are a number of
194 Linear solver SPARSE_SCHUR SPARSE_SCHUR
196 Linear solver threads 1 1
197 Linear solver ordering AUTOMATIC 22106, 16
213 Linear solver 0.382
232 Linear solver 0.382
240 spent in the linear solver and the rest was mostly spent in
248 Linear solver ordering AUTOMATIC 22106, 16
[all …]
Dbuilding.rst12 <http://ceres-solver.org/ceres-solver-1.9.0.tar.gz>`_ . Or if you want
17 git clone https://ceres-solver.googlesource.com/ceres-solver
144 tar zxf ceres-solver-1.9.0.tar.gz
147 cmake ../ceres-solver-1.9.0
158 bin/simple_bundle_adjuster ../ceres-solver-1.9.0/data/problem-16-22106-pre.txt
161 ``DENSE_SCHUR`` linear solver. The output should look something like
189 Linear solver DENSE_SCHUR DENSE_SCHUR
191 Linear solver threads 1 1
192 Linear solver ordering AUTOMATIC 22106, 16
208 Linear solver 0.442
[all …]
Dversion_history.rst11 their solver configuration before calling ``Solve``.
48 #. Simpler and more informative solver termination type
50 #. New `website <http://www.ceres-solver.org>`_ based entirely on
58 #. Faster ``SPARSE_NORMAL_CHOLESKY`` solver when using ``CX_SPARSE``
80 the solver has been renamed from ``SolverTerminationType`` to
93 explanation for why the solver terminated.
96 gradient tolerance. i.e., The solver converged when
105 This has changed to an absolute tolerance, i.e. the solver
139 eigenvalue solver.
179 #. Faster ``ITERATIVE_SCHUR`` solver using template specializations.
[all …]
/external/eigen/Eigen/src/Eigenvalues/
DSelfAdjointEigenSolver.h543 static inline void run(SolverType& solver, const MatrixType& mat, int options)
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, const MatrixType& mat, int options)
[all …]
/external/ceres-solver/internal/ceres/
Dsymmetric_linear_solver_test.cc70 ConjugateGradientsSolver solver(options); in TEST() local
72 solver.Solve(A.get(), b.data(), per_solve_options, x.data()); in TEST()
127 ConjugateGradientsSolver solver(options); in TEST() local
129 solver.Solve(A.get(), b.data(), per_solve_options, x.data()); in TEST()
Dunsymmetric_linear_solver_test.cc89 scoped_ptr<LinearSolver> solver(LinearSolver::Create(options)); in TestSolver() local
91 solver->Solve(transformed_A.get(), in TestSolver()
97 solver.reset(LinearSolver::Create(options)); in TestSolver()
101 solver->Solve(transformed_A.get(), in TestSolver()
/external/eigen/doc/
DSparseLinearSystems.dox9 %Eigen currently provides a limited set of built-in solvers, as well as wrappers to external solver…
63 SolverClassName<SparseMatrix<double> > solver;
64 solver.compute(A);
65 if(solver.info()!=Success) {
69 x = solver.solve(b);
70 if(solver.info()!=Success) {
75 x1 = solver.solve(b1);
83 ConjugateGradient<SparseMatrix<double>, Eigen::Upper> solver;
84 x = solver.compute(A).solve(b);
90 SolverClassName<SparseMatrix<double> > solver;
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/
DNonLinearConjugateGradientOptimizer.java54 private UnivariateRealSolver solver; field in NonLinearConjugateGradientOptimizer
71 solver = null; in NonLinearConjugateGradientOptimizer()
91 this.solver = lineSearchSolver; in setLineSearchSolver()
122 if (solver == null) { in doOptimize()
123 solver = new BrentSolver(); in doOptimize()
164 final double step = solver.solve(lsf, 0, findUpperBound(lsf, 0, initialStep)); in doOptimize()
/external/ceres-solver/scripts/
Dmake_release54 VERSION_IN_SPEC=$(grep '^Version:' scripts/ceres-solver.spec | \
117 - Upload /tmp/ceres-solver-$1.tar.gz
119 - Update the release string in scripts/ceres-solver.spec if this is a RC
/external/v8/benchmarks/
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/unsupported/Eigen/
DPolynomials29 * \brief This module provides a QR based polynomial solver.
44 and a QR based polynomial solver.
49 solver.
98 \section QR polynomial solver class
114 …Therefore the current polynomial solver is guaranteed to provide a correct result only when the co…
126 -# a simple use of the polynomial solver is shown;
127 … the QR algorithm is presented: a polynomial with almost conjugate roots is provided to the solver.
/external/eigen/unsupported/test/
DNonLinearOptimization.cpp291 HybridNonLinearSolver<hybrj_functor> solver(functor); in testHybrj1() local
292 info = solver.hybrj1(x); in testHybrj1()
296 VERIFY_IS_EQUAL(solver.nfev, 11); in testHybrj1()
297 VERIFY_IS_EQUAL(solver.njev, 1); in testHybrj1()
300 VERIFY_IS_APPROX(solver.fvec.blueNorm(), 1.192636e-08); in testHybrj1()
324 HybridNonLinearSolver<hybrj_functor> solver(functor); in testHybrj() local
325 solver.diag.setConstant(n, 1.); in testHybrj()
326 solver.useExternalScaling = true; in testHybrj()
327 info = solver.solve(x); in testHybrj()
331 VERIFY_IS_EQUAL(solver.nfev, 11); in testHybrj()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
DUnivariateRealSolverUtils.java80 UnivariateRealSolver solver = LazyHolder.FACTORY.newDefaultSolver(); in solve() local
81 solver.setAbsoluteAccuracy(absoluteAccuracy); in solve()
82 return solver.solve(f, x0, x1); in solve()
/external/jmonkeyengine/engine/src/bullet-native/
DjmePhysicsSpace.cpp141 btConstraintSolver* solver; in createPhysicsSpace() local
154 solver = new btParallelConstraintSolver(solverThreads); in createPhysicsSpace()
156 solver = new btSequentialImpulseConstraintSolver; in createPhysicsSpace()
160 …btDiscreteDynamicsWorld* world = new btDiscreteDynamicsWorld(dispatcher, broadphase, solver, colli… in createPhysicsSpace()

123