HomeSort by relevance Sort by last modified time
    Searched full:solver (Results 101 - 125 of 535) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/ceres-solver/internal/ceres/
compressed_row_jacobian_writer.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
56 // program. This is useful when Solver::Options::use_block_amd =
gradient_checking_cost_function.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
46 // controlled with relative_step_size. See solver.h for a better explanation of
linear_solver.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
104 LOG(FATAL) << "Unknown linear solver type :"
reorder_program.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
66 // If the linear solver type is SPARSE_SCHUR and support for
blas.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
block_evaluate_preparer.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
block_evaluate_preparer.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
callbacks.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
covariance.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
covariance_impl.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
detect_structure.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
dynamic_compressed_row_jacobian_writer.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
GMRES.h 222 * \brief A GMRES solver for sparse square problems
234 * This class can be used as the direct solver classes. Here is a typical usage example:
240 * GMRES<SparseMatrix<double> > solver(A);
241 * x = solver.solve(b);
242 * std::cout << "#iterations: " << solver.iterations() << std::endl;
243 * std::cout << "estimated error: " << solver.error() << std::endl;
245 * x = solver.solve(b);
254 * solver.setMaxIterations(1);
257 * x = solver.solveWithGuess(b,x);
258 * std::cout << i << " : " << solver.error() << std::endl
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
UnivariateRealSolverImpl.java 63 * Construct a solver with given iteration count and accuracy.
89 * Construct a solver with given iteration count and accuracy.
141 * <p>A solver may require that the interval brackets a single zero root.
151 * or the solver detects convergence problems otherwise.
154 * satisfy the requirements specified by the solver
164 * <p>A solver may require that the interval brackets a single zero root.
175 * or the solver detects convergence problems otherwise.
178 * satisfy the requirements specified by the solver
UnivariateRealSolverUtils.java 43 * 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(); local
81 solver.setAbsoluteAccuracy(absoluteAccuracy);
82 return solver.solve(f, x0, x1);
235 /** Cached solver factory */
  /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/
EstimationProblem.java 27 * <p>An estimation problem, as seen by a solver is a set of
34 * the parameters are adjusted. The purpose of the solver is to reduce
  /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
CholeskyDecomposition.java 66 * Get a solver for finding the A &times; X = B solution in least square sense.
67 * @return a solver
QRDecomposition.java 72 * Get a solver for finding the A &times; X = B solution in least square sense.
73 * @return a solver
  /external/ceres-solver/cmake/
CeresConfigVersion.cmake.in 1 # Ceres Solver - A fast non-linear least squares minimizer
3 # http://code.google.com/p/ceres-solver/
FindSphinx.cmake 1 # Ceres Solver - A fast non-linear least squares minimizer
3 # http://code.google.com/p/ceres-solver/
UpdateCacheVariable.cmake 1 # Ceres Solver - A fast non-linear least squares minimizer
3 # http://code.google.com/p/ceres-solver/
  /external/ceres-solver/config/ceres/internal/
config.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
  /external/ceres-solver/examples/
bundle_adjuster.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
125 void SetLinearSolver(Solver::Options* options) {
141 void SetOrdering(BALProblem* bal_problem, Solver::Options* options) {
226 void SetMinimizerOptions(Solver::Options* options) {
244 Solver::Options* options) {
320 Solver::Options options;
324 Solver::Summary summary;
random.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
  /external/ceres-solver/include/ceres/internal/
disable_warnings.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/

Completed in 816 milliseconds

1 2 3 45 6 7 8 91011>>