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

<<11121314151617181920>>

  /external/eigen/Eigen/src/Eigenvalues/
SelfAdjointEigenSolver.h 543 static inline void run(SolverType& solver, const MatrixType& mat, int options)
552 MatrixType& eivecs = solver.m_eivec;
553 VectorType& eivals = solver.m_eivalues;
613 solver.m_info = NumericalIssue;
614 solver.m_isInitialized = true;
615 solver.m_eigenvectorsOk = computeEigenvectors;
666 solver.m_info = Success;
667 solver.m_isInitialized = true;
668 solver.m_eigenvectorsOk = computeEigenvectors;
688 static inline void run(SolverType& solver, const MatrixType& mat, int options
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
CholeskyDecompositionImpl.java 187 return new Solver(lTData);
190 /** Specialized solver. */
191 private static class Solver implements DecompositionSolver {
197 * Build a solver from decomposed matrix.
200 private Solver(final double[][] lTData) {
LUDecompositionImpl.java 228 return new Solver(lu, pivot, singular);
231 /** Specialized solver. */
232 private static class Solver implements DecompositionSolver {
244 * Build a solver from decomposed matrix.
249 private Solver(final double[][] lu, final int[] pivot, final boolean singular) {
SingularValueDecompositionImpl.java 268 return new Solver(singularValues, getUT(), getV(), getRank() == Math
272 /** Specialized solver. */
273 private static class Solver implements DecompositionSolver {
282 * Build a solver from decomposed matrix.
292 private Solver(final double[] singularValues, final RealMatrix uT,
EigenDecomposition.java 132 * Get a solver for finding the A &times; X = B solution in exact linear sense.
133 * @return a solver
SingularValueDecomposition.java 142 * Get a solver for finding the A &times; X = B solution in least square sense.
143 * @return a solver
  /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/
EventState.java 151 // If an ODE solver is setup with an EventHandler that return STOP
154 // solver from the final state reached at the event with the same
160 // less than epsilon after the solver start in the first step should be ignored,
242 final BrentSolver solver = new BrentSolver(convergence); local
250 // shift ta to make sure ga and gb get opposite signs and the solver won't complain
270 solver.solve(maxIterationCount, f, ta, tb) :
271 solver.solve(maxIterationCount, f, tb, ta);
  /external/ceres-solver/internal/ceres/
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;
polynomial.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
233 Eigen::EigenSolver<Matrix> solver(companion_matrix, false);
234 if (solver.info() != Eigen::Success) {
241 *real = solver.eigenvalues().real();
248 *imaginary = solver.eigenvalues().imag();
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
  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
BrentSolver.java 52 * Construct a solver for the given function.
66 * Construct a solver with default properties.
75 * Construct a solver with the given absolute accuracy.
77 * @param absoluteAccuracy lower bound for absolute accuracy of solutions returned by the solver
85 * Contstruct a solver with the given maximum iterations and absolute accuracy.
88 * @param absoluteAccuracy lower bound for absolute accuracy of solutions returned by the solver
NewtonSolver.java 39 * Construct a solver for the given function.
52 * Construct a solver.
  /external/ceres-solver/examples/
more_garbow_hillstrom.cc 1 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
283 Solver::Options options;
289 Solver::Summary summary;
314 Solver::Options options;
320 Solver::Summary summary;
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/eigen/Eigen/src/IterativeLinearSolvers/
ConjugateGradient.h 110 * \brief A conjugate gradient solver for sparse self-adjoint problems
124 * This class can be used as the direct solver classes. Here is a typical usage example:
182 /** 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/
70 # Ceres Solver ships with a replacement for glog that provides a
177 $(CERES_SRC_PATH)/solver.cc \
  /external/ceres-solver/jni/
Android.mk 1 # Ceres Solver - A fast non-linear least squares minimizer
3 # http://code.google.com/p/ceres-solver/
70 # Ceres Solver ships with a replacement for glog that provides a
168 $(CERES_SRC_PATH)/solver.cc \
  /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/
SimplexSolver.java 42 * Build a simplex solver with default settings.
49 * Build a simplex solver with a specified accepted amount of error
  /external/ceres-solver/cmake/
CreateCeresConfig.cmake 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/
  /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 987 milliseconds

<<11121314151617181920>>