HomeSort by relevance Sort by last modified time
    Searched full:solver (Results 1 - 25 of 418) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/ceres-solver/
README.google 1 URL: https://ceres-solver.googlesource.com/ceres-solver/+archive/0338f9a8e69582a550ef6d128e447779536d623c.tar.gz
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/
12 Docs : http://homes.cs.washington.edu/~sagarwal/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
README 1 Ceres Solver - A non-linear least squares minimizer
  /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...]
  /external/ceres-solver/docs/source/
index.rst 1 .. Ceres Solver documentation master file, created by
7 Ceres Solver
10 Ceres Solver is a portable C++ library for solving non-linear least
14 <https://ceres-solver.googlecode.com/files/ceres-solver-1.6.0.tar.gz>`_
16 <https://ceres-solver.googlesource.com/ceres-solver>`_
23 <https://groups.google.com/forum/?fromgroups#!forum/ceres-solver>`_
27 <https://code.google.com/p/ceres-solver/issues/list>`_.
29 * If you use Ceres Solver for a publication, you must cite it as:
    [all...]
version_history.rst 13 #. ``Solver::Options::sparse_linear_algebra_library`` has been renamed
14 to ``Solver::Options::sparse_linear_algebra_library_type``.
33 ``Solver::Summary`` and ``Solver::Summary::FullReport``.
51 #. Fix ``ITERATIVE_SCHUR`` solver to work correctly when the schur
76 #. ceres-solver.spec: Use cleaner, more conventional Release string
81 #. Rationalize some of the variable names in ``Solver::Options``.
83 #. Expose line search parameters in ``Solver::Options``.
160 part of it without calling the solver.
165 - ``Solver::Options::return_initial_residuals`
    [all...]
solving.rst 17 components of a nonlinear least squares solver, so before we describe
18 how to configure and use the solver, we will take a brief look at how
113 :member:`Solver::Options::trust_region_strategy_type`.
117 .. [#f1] At the level of the non-linear solver, the block
178 equations. Typically an iterative linear solver like the Conjugate
181 the iterative solver. A typical termination rule is of the form
194 the user chooses a factorization based linear solver, the exact step
196 iterative linear solver, the inexact step Levenberg-Marquardt
221 :member:`Solver::Options::dogleg_type`.
303 Setting :member:`Solver::Options::use_inner_iterations` to ``true`
    [all...]
  /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/internal/ceres/
solver_impl.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
40 #include "ceres/solver.h"
53 // Mirrors the interface in solver.h, but exposes implementation
55 static void Solve(const Solver::Options& options,
57 Solver::Summary* summary);
59 static void TrustRegionSolve(const Solver::Options& options,
61 Solver::Summary* summary);
65 const Solver::Options &options,
71 Solver::Summary* summary)
    [all...]
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...]
minimizer.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
38 #include "ceres/solver.h"
52 // see solver.h for detailed information about the meaning and
56 Init(Solver::Options());
59 explicit Options(const Solver::Options& options) {
63 void Init(const Solver::Options& options) {
122 // Number of times the linear solver should be retried in case of
184 Solver::Summary* summary);
192 Solver::Summary* summary) = 0
    [all...]
linear_solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
96 // See solver.h for information about this flag.
99 // Number of internal iterations that the solver uses. This
104 // If possible, how many threads can the solver use.
108 // eliminated by the linear solver.
111 // the linear solver is informed that it should eliminate the
114 // on. Within each elimination group, the linear solver is free to
128 // parameter, the solver can be told to recalculate the value of
159 // and a vector b, the linear solver will solve fo
    [all...]
iterative_schur_complement_solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
46 // This class implements an iterative solver for the linear least
50 // The algorithm used by this solver was developed in a series of
61 // possibility of solving the Newton equations in a non-linear solver
67 // a proof of this fact and others related to this solver please see
  /external/ceres-solver/docs/source/_themes/armstrong/
globaltoc.html 10 <h3><a href="{{ pathto(master_doc) }}">{{ _('Ceres Solver') }}</a></h3>
  /external/ceres-solver/examples/
helloworld.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 using ceres::Solver;
60 // mutated in place by the solver.
73 // Run the solver!
74 Solver::Options options;
76 Solver::Summary summary;
helloworld_analytic_diff.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 using ceres::Solver;
85 // mutated in place by the solver.
96 // Run the solver!
97 Solver::Options options;
99 Solver::Summary summary;
helloworld_numeric_diff.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
41 using ceres::Solver;
56 // mutated in place by the solver.
69 // Run the solver!
70 Solver::Options options;
72 Solver::Summary summary;
quadratic.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 using ceres::Solver;
80 // Run the solver!
81 Solver::Options options;
85 Solver::Summary summary;
quadratic_auto_diff.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
44 using ceres::Solver;
78 // Run the solver!
79 Solver::Options options;
83 Solver::Summary summary;
quadratic_numeric_diff.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
43 using ceres::Solver;
73 // Run the solver!
74 Solver::Options options;
78 Solver::Summary summary;
  /external/ceres-solver/include/ceres/
iteration_callback.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
84 // than Solver::Options::min_relative_decrease. However, if the
86 // (Solver::Options:use_nonmonotonic_steps = true), then even if the
135 // Number of iterations taken by the linear solver to solve for the
145 // Time (in seconds) spent inside the trust region step solver.
153 // each iteration of the Minimizer. The solver uses the return value
158 // situation. The solver returns without updating the parameter blocks
159 // (unless Solver::Options::update_state_every_iteration is set
160 // true). Solver returns with Solver::Summary::termination_type set t
    [all...]
types.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
60 // TODO(keir): Considerably expand the explanations of each solver type.
66 // Solve the normal equations using a dense Cholesky solver; based
70 // Solve the normal equations using a dense QR solver; based on
74 // Solve the normal equations using a sparse cholesky solver; requires
81 // Solves the reduced linear system using a dense Cholesky solver;
85 // Solves the reduced linear system using a sparse Cholesky solver;
106 // only be used with the ITERATIVE_SCHUR solver.
140 // Solver ran for max_num_iterations and terminated before th
    [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...]
  /external/eigen/Eigen/src/IterativeLinearSolvers/
BiCGSTAB.h 106 * \brief A bi conjugate gradient stabilized solver for sparse square problems
118 * This class can be used as the direct solver classes. Here is a typical usage example:
124 * BiCGSTAB<SparseMatrix<double> > solver;
125 * solver(A);
126 * x = solver.solve(b);
127 * std::cout << "#iterations: " << solver.iterations() << std::endl;
128 * std::cout << "estimated error: " << solver.error() << std::endl;
130 * x = solver.solve(b);
139 * solver.setMaxIterations(1);
142 * x = solver.solveWithGuess(b,x)
    [all...]

Completed in 646 milliseconds

1 2 3 4 5 6 7 8 91011>>