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

1 2 3 4 5 6 7 8 91011>>

  /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/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/
README 1 Ceres Solver - A non-linear least squares minimizer
3 Please see ceres-solver.pdf in docs/ for a tutorial and reference.
  /external/ceres-solver/internal/ceres/
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"
44 Solver::Options::~Options() {
49 Solver::~Solver() {}
51 void Solver::Solve(const Solver::Options& options,
53 Solver::Summary* summary) {
62 void Solve(const Solver::Options& options
65 Solver solver; local
    [all...]
solver_impl.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
39 #include "ceres/solver.h"
51 // Mirrors the interface in solver.h, but exposes implementation
53 static void Solve(const Solver::Options& options,
55 Solver::Summary* summary);
64 static Program* CreateReducedProgram(Solver::Options* options,
69 // Create the appropriate linear solver, taking into account any
71 // selected linear solver, which may be different from what the user
74 static LinearSolver* CreateLinearSolver(Solver::Options* options
    [all...]
solver_impl_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
281 Solver::Options options;
343 Solver::Options options;
417 Solver::Options options;
500 Solver::Options options;
508 Solver::Options options;
519 Solver::Options options;
530 Solver::Options options;
541 Solver::Options options
577 scoped_ptr<LinearSolver> solver; local
    [all...]
linear_solver.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
92 // See solver.h for explanation of this option.
95 // Number of internal iterations that the solver uses. This
100 // If possible, how many threads can the solver use.
104 // eliminated by the linear solver.
107 // the linear solver is informed that it should eliminate the
110 // each elimination group, the linear solver is free to choose how
124 // parameter, the solver can be told to recalculate the value of
155 // 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/
47 // This class implements an iterative solver for the linear least
51 // The algorithm used by this solver was developed in a series of
62 // possibility of solving the Newton equations in a non-linear solver
68 // a proof of this fact and others related to this solver please see
unsymmetric_linear_solver_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
66 scoped_ptr<LinearSolver> solver(LinearSolver::Create(options));
82 LOG(FATAL) << "Unknown linear solver : " << linear_solver_type;
86 solver->Solve(transformed_A.get(),
94 solver->Solve(transformed_A.get(),
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 // see solver.h for detailed information about the meaning and
54 Init(Solver::Options());
57 explicit Options(const Solver::Options& options) {
61 void Init(const Solver::Options& options) {
91 // Number of times the linear solver should be retried in case of
143 Solver::Summary* summary) = 0;
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
48 // cholesky solver.
  /external/ceres-solver/scripts/
make_release 3 # Ceres Solver - A fast non-linear least squares minimizer
5 # http://code.google.com/p/ceres-solver/
42 TMP="/tmp/ceres-solver-$1"
43 DOCS_TMP="/tmp/ceres-solver-docs-$1"
96 pdflatex -shell-escape ceres-solver && \
97 bibtex ceres-solver && \
98 pdflatex -shell-escape ceres-solver && \
99 pdflatex -shell-escape ceres-solver
100 cp $DOCS_TMP/ceres-solver.pdf "$TMP/docs/ceres-solver.pdf
    [all...]
  /external/ceres-solver/docs/
CMakeLists.txt 1 # Ceres Solver - A fast non-linear least squares minimizer
3 # http://code.google.com/p/ceres-solver/
52 -shell-escape ${CMAKE_BINARY_DIR}/docs/ceres-solver.tex
55 COMMAND ${BIBTEX_COMPILER} ceres-solver.aux
57 -shell-escape ${CMAKE_BINARY_DIR}/docs/ceres-solver.tex
61 -shell-escape ${CMAKE_BINARY_DIR}/docs/ceres-solver.tex
65 INSTALL(FILES ${CMAKE_BINARY_DIR}/docs/ceres-solver.pdf
reference-overview.tex 1 %!TEX root = ceres-solver.tex
15 \item{Solving} Configure and run the solver.
18 These two steps are mostly independent of each other. This is by design. Modeling the optimization problem should not depend on how the solver and the user should be able to switch between various solver settings and strategies without changing the way the problem is modeled. In the next two chapters (…)
helloworld.tex 1 %!TEX root = ceres-solver.tex
48 // Run the solver!
49 Solver::Options options;
53 Solver::Summary summary;
66 Ceres Solver Report: Iterations: 2, Initial cost: 1.250000e+01, \
71 Starting from a $x=5$, the solver in two iterations goes to 10~\footnote{Actually the solver ran for three iterations, and it was by looking at the value returned by the linear solver in the third iteration, it observed that the update to the parameter block was too small and declared convergence. Ceres only prints out the display at the end of an iteration, and terminates as soon as it detects convergence, which is why you only see two iterations here and not three.}. The careful reader will note that this is a linear problem and one linear solve should be enough to get the optimal value. The default configuration of the solver is aimed at non-linear problems, and for reasons of simplicity we did not change it in this example. It is indeed possible to obtain the solution to this problem using Ceres in one iteration. Also note that the solver did get very close to the optimal function value of 0 in the very first iteration. We will discuss (…)
    [all...]
further.tex 1 %!TEX root = ceres-solver.tex
introduction.tex 1 %!TEX root = ceres-solver.tex
4 Ceres Solver\footnote{For brevity, in the rest of this document we will just use the term Ceres.} is a non-linear least squares solver developed at Google. It is designed to solve small and large sparse problems accurately and efficiently~\footnote{For a gentle but brief introduction to non-liner least squares problems, please start by reading the~\hyperref[part:tutorial]{Tutorial}}. Amongst its various features is a simple but expressive API with support for automatic differentiation, robust norms, local parameterizations, automatic gradient checking, multithreading and automatic problem structure detection.
12 While there is some debate as to who invented of the method of Least Squares~\cite{stigler1981gauss}. There is no debate that it was Carl Friedrich Gauss's prediction of the orbit of the newly discovered asteroid Ceres based on just 41 days of observations that brought it to the attention of the world~\cite{tennenbaum-director}. We named our solver after Ceres to celebrate this seminal event in the history of astronomy, statistics and optimization.
14 \section{Contributing to Ceres Solver}
16 We welcome contributions to Ceres, whether they are new features, bug fixes or tests. The Ceres mailing list\footnote{\url{http://groups.google.com/group/ceres-solver}} is the best place for all development related discussions. Please consider joining it. If you have ideas on how you would like to contribute to Ceres, it is a good idea to let us know on the mailinglist before you start development. We may have suggestions that will save effort when trying to merge your work into the main branch. If you are looking for ideas, please let us know about your interest and skills and we will be happy to make a suggestion or three.
20 \section{Citing Ceres Solver}
25 Title = {Ceres Solver: Tutorial \& Reference},
42 Ceres Solver is licensed under the New BSD license, whose terms are as follows.
  /external/ceres-solver/include/ceres/
types.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
58 // TODO(keir): Considerably expand the explanations of each solver type.
64 // Solve the normal equations using a dense Cholesky solver; based
68 // Solve the normal equations using a dense QR solver; based on
72 // Solve the normal equations using a sparse cholesky solver; requires
79 // Solves the reduced linear system using a dense Cholesky solver;
83 // Solves the reduced linear system using a sparse Cholesky solver;
104 // only be used with the ITERATIVE_SCHUR solver. Requires
134 // Solver ran for max_num_iterations and terminated before th
    [all...]
iteration_callback.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
80 // than Solver::Options::min_relative_decrease. However, if the
82 // (Solver::Options:use_nonmonotonic_steps = true), then even if the
119 // Number of iterations taken by the linear solver to solve for the
127 // Time (in seconds) spent inside the trust region step solver.
135 // each iteration of the Minimizer. The solver uses the return value
140 // situation. The solver returns without updating the parameter blocks
141 // (unless Solver::Options::update_state_every_iteration is set
142 // true). Solver returns with Solver::Summary::termination_type set t
    [all...]
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
191 // solver flakiness, the trust region strategy may return a
216 // Linear least squares solver options -------------------------------------
230 // step. Currently only the SPARSE_SCHUR solver is capable of
234 // The order in which variables are eliminated in a linear solver
242 // the solver about the variable elimination ordering to use. Thi
    [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...]
  /external/ceres-solver/examples/
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;
77 // Run the solver!
78 Solver::Options options;
82 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/
44 using ceres::Solver;
81 // Run the solver!
82 Solver::Options options;
86 Solver::Summary summary;

Completed in 359 milliseconds

1 2 3 4 5 6 7 8 91011>>