HomeSort by relevance Sort by last modified time
    Searched full:preconditioner (Results 26 - 43 of 43) sorted by null

12

  /external/ceres-solver/include/ceres/
types.h 99 // Trivial preconditioner - the identity matrix.
105 // Block diagonal of the Schur complement. This preconditioner may
115 // preconditioner. Requires SuiteSparse/CHOLMOD.
solver.h 385 // Type of preconditioner to use with the iterative linear solvers.
    [all...]
  /external/ceres-solver/
Android.mk 127 internal/ceres/preconditioner.cc \
  /external/ceres-solver/docs/source/
bibliography.rst 56 preconditioner for large sparse least squares problems**, *SIAM
solving.rst 629 more powerful preconditioner. In fact, we do not even need to compute
642 .. _section-preconditioner:
644 Preconditioner
657 preconditioner :math:`M` the preconditioned system is given by
663 The computational cost of using a preconditioner :math:`M` is the cost
669 preconditioner would be one for which :math:`\kappa(M^{-1}A)
671 applying this preconditioner would require solving a linear system
676 Jacobi preconditioner, but are also much more expensive.
680 preconditioner, i.e., :math:`M=\operatorname{diag}(A)`, which for
682 block Jacobi preconditioner
    [all...]
version_history.rst 94 #. Refactor the preconditioner class structure.
570 and a block Jacobi preconditioner for it.
building.rst 136 Preconditioner N/A N/A
  /external/ceres-solver/internal/ceres/
schur_eliminator.h 157 // is interested in constructing a preconditioner based on the Schur
159 // be used as a preconditioner for an Iterative Substructuring based
system_test.cc 488 #define CONFIGURE(linear_solver, sparse_linear_algebra_library_type, ordering, preconditioner) \
492 preconditioner))
CMakeLists.txt 83 preconditioner.cc
solver_impl.cc     [all...]
solver.cc 235 StringAppendF(&report, "Preconditioner %25s%25s\n",
graph_algorithms.h 86 // multilevel incomplete QR preconditioner for large sparse
  /external/ceres-solver/jni/
Android.mk 158 $(CERES_SRC_PATH)/preconditioner.cc \
  /external/eigen/doc/
TopicLinearAlgebraDecompositions.dox 230 <li><a name="note3">\b 3: </a>Our JacobiSVD is two-sided, making for proven and optimal precision for square matrices. For non-square matrices, we have to use a QR preconditioner first. The default choice, ColPivHouseholderQR, is already very reliable, but if you want it to be proven, use FullPivHouseholderQR instead.
  /external/ceres-solver/examples/
bundle_adjuster.cc 82 DEFINE_string(preconditioner, "jacobi", "Options are: "
nist.cc 93 DEFINE_string(preconditioner, "jacobi", "Options are: "
  /external/eigen/Eigen/src/SuperLUSupport/
SuperLUSupport.h 810 * using the SuperLU library. This class is aimed to be used as a preconditioner of the iterative linear solvers.

Completed in 399 milliseconds

12