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

<<11121314151617

  /external/ceres-solver/internal/ceres/
compressed_col_sparse_matrix_utils_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
evaluator.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
graph_algorithms_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
implicit_schur_complement.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
incomplete_lq_factorization.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
incomplete_lq_factorization_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
jet_quaternion_integration_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
local_parameterization_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
program.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
residual_block.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
runtime_numeric_diff_cost_function_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
schur_eliminator_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
sparse_normal_cholesky_solver.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
triplet_sparse_matrix.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
visibility_based_preconditioner.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
visibility_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
trust_region_minimizer.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
80 Solver::Summary* summary) {
196 VLOG(1) << "Terminating: Maximum solver time reached.";
265 "than Solver::Options::max_num_consecutive_invalid_steps: %d",
316 Solver::Summary inner_iteration_summary;
evaluator_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
32 // solver and num_eliminate_blocks (for schur-based solvers).
450 // takes care of this, but we don't want to invoke the solver here.
511 // In the pairs, the first argument is the linear solver type, and the second
schur_eliminator.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
160 // solver [See Agarwal et al, Bundle Adjustment in the Large, ECCV
  /external/ceres-solver/include/ceres/
problem.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
54 class Solver;
284 // ordering, rendering the jacobian or residuals returned from the solver
295 // ordering, rendering the jacobian or residuals returned from the solver
425 friend class Solver;
covariance.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
147 // to better numerical behaviour of the Solver, it will also expose
loss_function.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
356 // Solver::Options options;
  /external/eigen/Eigen/src/PardisoSupport/
PardisoSupport.h 176 eigen_assert(m_initialized && "Pardiso solver is not initialized.");
190 eigen_assert(m_initialized && "Pardiso solver is not initialized.");
245 m_iparm[0] = 1; // No solver default
416 * \brief A sparse direct LU factorization and solver based on the PARDISO library
466 * \brief A sparse direct Cholesky (LLT) factorization and solver based on the PARDISO library
525 * \brief A sparse direct Cholesky (LDLT) factorization and solver based on the PARDISO library
  /external/eigen/Eigen/src/PaStiXSupport/
PaStiXSupport.h 16 * \brief Interface to the PaStix solver
151 eigen_assert(m_isInitialized && "Pastix solver is not initialized.");
434 * \brief Sparse direct LU solver based on PaStiX library
549 * \brief A sparse direct supernodal Cholesky (LLT) factorization and solver based on the PaStiX library
630 * \brief A sparse direct supernodal Cholesky (LLT) factorization and solver based on the PaStiX library
  /external/eigen/Eigen/src/Core/products/
TriangularSolverMatrix.h 36 /* Optimized triangular solver with multiple right hand side and the triangular matrix on the left
178 /* Optimized triangular solver with multiple left hand sides and the trinagular matrix on the right
252 // triangular solver kernel

Completed in 467 milliseconds

<<11121314151617