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

1 2 3 4 5 6 7 891011>>

  /external/eigen/Eigen/src/Core/arch/Default/
Settings.h 34 /** Defines the maximal width of the blocks used in the triangular product and solver
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IterativeSolverBase.h 42 /** Initialize the solver with matrix \a A for further \c Ax=b solving.
60 /** Initializes the iterative solver for the sparcity pattern of the matrix \a A for further solving \c Ax=b problems.
74 /** Initializes the iterative solver with the numerical values of the matrix \a A for further solving \c Ax=b problems.
93 /** Initializes the iterative solver with the matrix \a A for further solving \c Ax=b problems.
ConjugateGradient.h 96 * \brief A conjugate gradient solver for sparse self-adjoint problems
110 * This class can be used as the direct solver classes. Here is a typical usage example:
168 /** Initialize the solver with matrix \a A for further \c Ax=b solving.
  /external/ceres-solver/
Android.mk 1 # Ceres Solver - A fast non-linear least squares minimizer
3 # http://code.google.com/p/ceres-solver/
138 internal/ceres/solver.cc \
  /external/ceres-solver/internal/ceres/
dense_qr_solver.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
159 // We always succeed, since the QR solver returns the best solution
dogleg_strategy.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
49 // using a direct solver leads to numerical failure.
iterative_schur_complement_solver.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
99 // Instantiate a conjugate gradient solver that runs on the Schur complement
levenberg_marquardt_strategy_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
52 // Linear solver that takes as input a vector and checks that the
residual_block.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
63 // more general non-linear solver.
trust_region_minimizer_test.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
210 // if the solver converges to the optimal values or not.
213 Solver::Options solver_options;
248 Solver::Summary summary;
388 Solver::Options options;
390 Solver::Summary summary;
block_jacobian_writer.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
49 // Since we expect to use a Schur type linear solver to solve the LM step, take
compressed_row_jacobian_writer.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
137 // Solver::Options::use_block_amd = true.
line_search_minimizer.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
92 Solver::Summary* summary) {
218 VLOG(1) << "Terminating: Maximum solver time reached.";
  /external/eigen/unsupported/test/
polynomialsolver.cpp 30 template<int Deg, typename POLYNOMIAL, typename SOLVER>
31 bool aux_evalSolver( const POLYNOMIAL& pols, SOLVER& psolve )
36 typedef typename SOLVER::RootsType RootsType;
  /external/eigen/Eigen/src/Eigenvalues/
SelfAdjointEigenSolver.h 541 static inline void run(SolverType& solver, const MatrixType& mat, int options)
550 MatrixType& eivecs = solver.m_eivec;
551 VectorType& eivals = solver.m_eivalues;
606 solver.m_info = NumericalIssue;
607 solver.m_isInitialized = true;
608 solver.m_eigenvectorsOk = computeEigenvectors;
654 solver.m_info = Success;
655 solver.m_isInitialized = true;
656 solver.m_eigenvectorsOk = computeEigenvectors;
676 static inline void run(SolverType& solver, const MatrixType& mat, int options
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 39 /// solver stack. If no nodes can be proven allocable then the node with
40 /// the lowest estimated spill cost is selected and push to the solver stack
111 /// @param solver A reference to the solver which is using this heuristic.
112 Briggs(HeuristicSolverImpl<Briggs> &solver) :
113 HeuristicBase<Briggs>(solver) {}
  /external/ceres-solver/examples/
fields_of_experts.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
fields_of_experts.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
snavely_reprojection_error.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
  /external/ceres-solver/include/ceres/
autodiff_local_parameterization.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
c_api.h 1 /* Ceres Solver - A fast non-linear least squares minimizer
3 * http://code.google.com/p/ceres-solver/
ordered_groups.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
sized_cost_function.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/
numeric_diff.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
variadic_evaluate.h 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/

Completed in 870 milliseconds

1 2 3 4 5 6 7 891011>>