HomeSort by relevance Sort by last modified time
    Searched full:solvers (Results 26 - 50 of 66) sorted by null

12 3

  /external/ceres-solver/internal/ceres/
minimizer.h 48 // Interface for non-linear least squares solvers.
sparse_matrix.h 48 // stored. This has significant implications for linear solvers
symmetric_linear_solver_test.cc 31 // Tests for linear solvers that solve symmetric linear systems. Some
reorder_program.cc 320 // parameter block ordering as it sees fit. For Schur type solvers,
360 // Schur type solvers also require that their residual blocks be
CMakeLists.txt 131 # Include the specialized schur solvers.
evaluator.h 109 // algorithm and the various linear solvers.
visibility_based_preconditioner.h 134 // based solvers. Please see schur_eliminator.h for more details.
evaluator_test.cc 32 // solver and num_eliminate_blocks (for schur-based solvers).
538 // makes sense for the schur-based solvers.
solver_impl.cc 770 "solvers. If you want to use an iterative solver please "
    [all...]
solver.cc 207 "solvers. If you want to use an iterative solver please "
  /external/eigen/doc/
HiPerformance.dox 14 all kind of matrix products and triangular solvers.
TopicLinearAlgebraDecompositions.dox 6 For an introduction on linear solvers and decompositions, check this \link TutorialLinearAlgebra page \endlink.
TutorialSparse.dox 11 <tr><td>\link SparseCore_Module SparseCore \endlink</td><td>\code#include <Eigen/SparseCore>\endcode</td><td>SparseMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse triangular solvers)</td></tr>
16 <tr><td>\link IterativeLinearSolvers_Module IterativeLinearSolvers \endlink</td><td>\code#include <Eigen/IterativeLinearSolvers>\endcode</td><td>Iterative solvers to solve large general linear square problems (including self-adjoint positive definite problems)</td></tr>
337 Please, refer to the \link SparseQuickRefPage Quick Reference \endlink guide for the list of supported operations. The list of linear solvers available is \link TopicSparseSystems here. \endlink
A05_PortingFrom2To3.dox 197 \section LinearSolvers Linear solvers
  /external/eigen/unsupported/Eigen/src/SparseExtra/
MatrixMarketIterator.h 90 { // Store the upper part of the matrix. It is needed by the solvers dealing with nonsymmetric matrices ??
  /external/eigen/Eigen/src/IterativeLinearSolvers/
IterativeSolverBase.h 16 * \brief Base class for linear iterative solvers
  /external/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h 154 // state: the existing solvers destructively alter the node and edge
  /external/ceres-solver/docs/source/
version_history.rst 137 #. Better error checking and reporting for linear solvers.
234 solvers.
322 a. Schur type solvers (``SPARSE_SCHUR``, ``DENSE_SCHUR``,
630 towards developing first order/gradient based solvers.
637 slightly slower ``DENSE_SCHUR`` and ``SPARSE_SCHUR`` solvers).
tutorial.rst 716 efficiently. Ceres provides three specialized solvers (collectively
717 known as Schur-based solvers) for this task. The example code uses the
731 solvers, robust loss functions and local parameterizations see
  /external/clang/lib/StaticAnalyzer/Core/
SimpleConstraintManager.cpp 103 // None of the constraint solvers currently support non-integer types.
  /external/eigen/unsupported/Eigen/src/Polynomials/
PolynomialSolver.h 18 * \brief Defined to be inherited by polynomial solvers: it provides
  /external/ceres-solver/examples/
nist.cc 32 // set of problems to test non-linear least squares solvers.
53 // solvers:
  /external/ceres-solver/include/ceres/
solver.h 49 // Interface for non-linear least squares solvers.
399 // Type of preconditioner to use with the iterative linear solvers.
414 // DENSE_SCHUR solvers. For small to moderate sized probem EIGEN
    [all...]
  /development/perftests/panorama/feature_stab/db_vlvm/
db_utilities_poly.h 30 * \defgroup LMPolynomial (LM) Polynomial utilities (solvers, arithmetic, evaluation, etc.)
  /external/fonttools/Lib/fontTools/misc/
bezierTools.py 250 # Equation solvers.

Completed in 379 milliseconds

12 3