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

12 3 4 5 6 7 8 91011>>

  /external/ceres-solver/internal/ceres/
line_search_minimizer.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
37 #include "ceres/solver.h"
73 Solver::Summary* summary);
minimizer_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/solver.h"
51 Solver::Options solver_options;
sparse_normal_cholesky_solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 // A solver for sparse linear least squares problem based on solving
50 // cholesky solver.
trust_region_minimizer.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
35 #include "ceres/solver.h"
50 Solver::Summary* summary);
coordinate_descent_minimizer.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
41 #include "ceres/solver.h"
67 Solver::Summary* summary);
73 Solver::Summary* summary);
solver_impl_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
286 Solver::Options options;
348 Solver::Options options;
417 Solver::Options options;
500 Solver::Options options;
510 Solver::Options options;
521 Solver::Options options;
532 Solver::Options options;
543 Solver::Options options
579 scoped_ptr<LinearSolver> solver; local
    [all...]
schur_complement_solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
87 // installed. For structure from motion problems, this is solver can
93 // sparse Cholesky factorization of the Schur complement. This solver
96 // structure, it maybe better to use an iterative solver.
140 // Dense Cholesky factorization based solver.
155 // Sparse Cholesky factorization based solver.
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());
cgnr_solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
44 // A conjugate gradients on the normal equations solver. This directly solves
evaluator.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
70 *error = "Invalid Linear Solver Type. Unable to create evaluator.";
minimizer.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
42 Solver::Summary* summary) {
conjugate_gradients_solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 // Preconditioned Conjugate Gradients based solver for positive
53 // inexact Newton solver.
dense_normal_cholesky_solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
52 // equations, the solver instead solves the linear least squares
74 // library. This solver always returns a solution, it is the user's
dense_qr_solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
51 // equations, the solver instead solves the linear least squares
79 // library. This solver always returns a solution, it is the user's
  /external/clang/test/Analysis/
no-exit-cfg.c 6 // The flow-sensitive dataflow solver should work even when no block in
  /external/eigen/Eigen/
SparseCholesky 16 * Such problems can also be solved using the ConjugateGradient solver from the IterativeLinearSolvers module.
  /external/ceres-solver/
LICENSE 1 Ceres Solver - A fast non-linear least squares minimizer
3 http://code.google.com/p/ceres-solver/
  /external/ceres-solver/docs/
CMakeLists.txt 1 # Ceres Solver - A fast non-linear least squares minimizer
3 # http://code.google.com/p/ceres-solver/
  /external/eigen/bench/btl/data/
action_settings.txt 9 trisolve_vector ; "{/*1.5 triangular solver - vector (X = inv(L) X)}" ; "size" ; 4:3000
10 trisolve_matrix ; "{/*1.5 triangular solver - matrix (M = inv(L) M)}" ; "size" ; 4:3000
  /external/ceres-solver/docs/source/
tutorial.rst 37 Ceres Solver. Full working code for all the examples described in this
39 <https://ceres-solver.googlesource.com/ceres-solver/+/master/examples/>`_
99 // Run the solver!
100 Solver::Options options;
103 Solver::Summary summary;
117 <https://ceres-solver.googlesource.com/ceres-solver/+/master/examples/helloworld.cc>`_
125 Ceres Solver Report: Iterations: 2, Initial cost: 1.250000e+01, Final cost: 1.388518e-16, Termination: PARAMETER_TOLERANCE.
128 Starting from a :math:`x=5`, the solver in two iterations goes to 1
    [all...]
contributing.rst 10 <http://groups.google.com/group/ceres-solver>`_ list is the best place
22 `Gerrit <https://ceres-solver-review.googlesource.com/>`_ to collaborate and
42 <https://ceres-solver-review.googlesource.com/>`_. You will also
47 3. Clone the Ceres Solver ``git`` repository from Gerrit.
51 git clone https://ceres-solver.googlesource.com/ceres-solver
66 curl -o .git/hooks/commit-msg https://ceres-solver-review.googlesource.com/tools/hooks/commit-msg
73 * Sign into `http://ceres-solver-review.googlesource.com
74 <http://ceres-solver-review.googlesource.com>`_.
101 Submitting a change to Ceres Solver
    [all...]
  /external/eigen/unsupported/Eigen/
Polynomials 24 * \brief This module provides a QR based polynomial solver.
39 and a QR based polynomial solver.
44 solver.
93 \section QR polynomial solver class
109 Therefore the current polynomial solver is guaranteed to provide a correct result only when the complex roots \f$r_1,r_2,...,r_d\f$ have distinct moduli i.e.
121 -# a simple use of the polynomial solver is shown;
122 -# the accuracy problem with the QR algorithm is presented: a polynomial with almost conjugate roots is provided to the solver.
  /external/ceres-solver/include/ceres/
ceres.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
55 #include "ceres/solver.h"
solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
49 class Solver {
51 virtual ~Solver();
54 // the solver operates. The defaults should be suitable for a wide range of
356 // solver flakiness, the trust region strategy may return a
381 // Linear least squares solver options -------------------------------------
408 // step. Currently only the SPARSE_SCHUR solver is capable of
412 // The order in which variables are eliminated in a linear solver
420 // the solver about the variable elimination ordering to use. Thi
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/
HeuristicBase.h 20 /// 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)
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 in your derive
    [all...]

Completed in 557 milliseconds

12 3 4 5 6 7 8 91011>>