| /external/ceres-solver/internal/ceres/ |
| schur_jacobi_preconditioner.h | 47 #include "ceres/preconditioner.h"
57 // This class implements the SCHUR_JACOBI preconditioner for Structure
67 // Preconditioner::Options options;
71 // SchurJacobiPreconditioner preconditioner(
73 // preconditioner.Update(A, NULL);
74 // preconditioner.RightMultiply(x, y);
78 // Initialize the symbolic structure of the preconditioner. bs is
80 // to determine the sparsity structure of the preconditioner matrix.
85 const Preconditioner::Options& options);
88 // Preconditioner interface
[all...] |
| visibility_based_preconditioner.h | 58 #include "ceres/preconditioner.h"
72 // structure of the preconditioner matrix is determined by analyzing
90 // the same cluster occur contiguously, the preconditioner matrix will
92 // clusters. Thus in analogy with the Jacobi preconditioner we refer
93 // to this as the CLUSTER_JACOBI preconditioner.
96 // preconditioner by considering the interaction between clusters and
103 // preconditioner. The detailed reasoning for this construction is
109 // preconditioner matrix is a block tridiagonal matrix, and thus the
110 // name for the preconditioner.
120 // VisibilityBasedPreconditioner preconditioner(
[all...] |
| block_jacobi_preconditioner.h | 35 #include "ceres/preconditioner.h"
44 // A block Jacobi preconditioner. This is intended for use with
46 // the preconditioner, create one by passing a BlockSparseMatrix "A"
50 // Before each use of the preconditioner in a solve with conjugate gradients,
52 // inspected to construct the preconditioner. The vector D is applied as the
60 // Preconditioner interface
73 // The block structure of the matrix this preconditioner is for (e.g. J).
|
| preconditioner.h | 46 class Preconditioner : public LinearOperator {
62 // If possible, how many threads the preconditioner can use.
97 virtual ~Preconditioner();
99 // Update the numerical value of the preconditioner for the linear
127 // This templated subclass of Preconditioner serves as a base class for
131 class TypedPreconditioner : public Preconditioner {
148 // Wrap a SparseMatrix object as a preconditioner.
155 // Preconditioner interface
|
| preconditioner.cc | 31 #include "ceres/preconditioner.h"
37 Preconditioner::~Preconditioner() {
|
| iterative_schur_complement_solver.cc | 45 #include "ceres/preconditioner.h"
100 // matrix with the block diagonal of the matrix F'F as the preconditioner.
109 Preconditioner::Options preconditioner_options;
143 LOG(FATAL) << "Unknown Preconditioner Type";
150 cg_per_solve_options.preconditioner = preconditioner_.get();
|
| visibility_based_preconditioner.cc | 59 // preconditioner construction. Move these higher up into the Options
69 const Preconditioner::Options& options)
78 << "Unknown preconditioner type: " << options_.type;
99 LOG(FATAL) << "Unknown preconditioner type";
132 // preconditioner. It clusters cameras using their scene
134 // preconditioner matrix.
148 // preconditioner. It clusters cameras using using the scene
173 // Allocate storage for the preconditioner matrix.
210 // preconditioner or not.
212 // A pair of cameras contribute a cell to the preconditioner if the
[all...] |
| iterative_schur_complement_solver.h | 44 class Preconditioner;
66 // running CG on the Normal Equations with an SSOR preconditioner. For
84 scoped_ptr<Preconditioner> preconditioner_;
|
| cgnr_solver.h | 40 class Preconditioner;
62 scoped_ptr<Preconditioner> preconditioner_;
|
| implicit_schur_complement.h | 93 // preconditioner indicates whether the inverse of the matrix F'F
94 // should be computed or not as a preconditioner for the Schur
99 ImplicitSchurComplement(int num_eliminate_blocks, bool preconditioner);
|
| schur_jacobi_preconditioner.cc | 50 const Preconditioner::Options& options)
57 << "SCHUR_JACOBI preconditioner.";
93 // Update the values of the preconditioner matrix and factorize it.
|
| linear_solver.h | 150 preconditioner(NULL),
189 // simplest form a preconditioner is a matrix M such that instead
198 // A null preconditioner is equivalent to an identity matrix being
199 // used a preconditioner.
200 LinearOperator* preconditioner; member in struct:ceres::internal::LinearSolver::PerSolveOptions
|
| conjugate_gradients_solver.cc | 120 // Apply preconditioner
121 if (per_solve_options.preconditioner != NULL) {
123 per_solve_options.preconditioner->RightMultiply(r.data(), z.data());
|
| visibility_based_preconditioner_test.cc | 174 // << "Preconditioner block " << i << " " << j << " differs "
239 // Preconditioner::Options options_;
265 // // Multiplication by the inverse of the preconditioner.
|
| cgnr_solver.cc | 67 cg_per_solve_options.preconditioner = preconditioner_.get();
|
| conjugate_gradients_solver.h | 47 // linear sytems. Optionally it can use a preconditioner also to
|
| implicit_schur_complement.cc | 45 bool preconditioner)
47 preconditioner_(preconditioner),
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IterativeSolverBase.h | 25 typedef typename internal::traits<Derived>::Preconditioner Preconditioner;
62 * Currently, this function mostly call analyzePattern on the preconditioner. In the future
76 * Currently, this function mostly call factorize on the preconditioner.
95 * Currently, this function mostly initialized/compute the preconditioner. In the future
129 /** \returns a read-write reference to the preconditioner for custom configuration. */
130 Preconditioner& preconditioner() { return m_preconditioner; } function in class:Eigen::IterativeSolverBase
132 /** \returns a read-only reference to the preconditioner. */
133 const Preconditioner& preconditioner() const { return m_preconditioner; function in class:Eigen::IterativeSolverBase
[all...] |
| BasicPreconditioners.h | 16 * \brief A preconditioner based on the digonal entries
19 * In other words, this preconditioner neglects all off diagonal entries and, in Eigen's language, solves for:
26 * This preconditioner is suitable for both selfadjoint and general problems.
121 * \brief A naive preconditioner which approximates any matrix as the identity matrix
|
| BiCGSTAB.h | 22 * \param precond A preconditioner being able to efficiently solve for an
28 template<typename MatrixType, typename Rhs, typename Dest, typename Preconditioner>
30 const Preconditioner& precond, int& iters,
100 typedef _Preconditioner Preconditioner;
112 * \tparam _Preconditioner the type of the preconditioner. Default is DiagonalPreconditioner
165 typedef _Preconditioner Preconditioner;
|
| ConjugateGradient.h | 21 * \param precond A preconditioner being able to efficiently solve for an
26 template<typename MatrixType, typename Rhs, typename Dest, typename Preconditioner>
29 const Preconditioner& precond, int& iters,
90 typedef _Preconditioner Preconditioner;
104 * \tparam _Preconditioner the type of the preconditioner. Default is DiagonalPreconditioner
157 typedef _Preconditioner Preconditioner;
|
| /external/eigen/Eigen/ |
| IterativeLinearSolvers | 19 * - DiagonalPreconditioner - also called JAcobi preconditioner, work very well on diagonal dominant matrices.
|
| SuperLUSupport | 37 * - class SuperILU: a supernodal sequential incomplete LU factorization (to be used as a preconditioner for iterative methods).
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| GMRES.h | 26 * \param precond preconditioner used
55 template<typename MatrixType, typename Rhs, typename Dest, typename Preconditioner>
56 bool gmres(const MatrixType & mat, const Rhs & rhs, Dest & x, const Preconditioner & precond,
213 typedef _Preconditioner Preconditioner;
225 * \tparam _Preconditioner the type of the preconditioner. Default is DiagonalPreconditioner
281 typedef _Preconditioner Preconditioner;
|
| /external/eigen/Eigen/src/SVD/ |
| JacobiSVD.h | 62 /*** preconditioner using FullPivHouseholderQR ***/
149 /*** preconditioner using ColPivHouseholderQR ***/
245 /*** preconditioner using HouseholderQR ***/
471 * \li NoQRPreconditioner allows not to use a QR preconditioner at all. This is useful if you know that you will only be computing
472 * JacobiSVD decompositions of square matrices. Non-square matrices require a QR preconditioner. Using this option will result in
545 * available with the (non-default) FullPivHouseholderQR preconditioner.
564 * available with the (non-default) FullPivHouseholderQR preconditioner.
707 "JacobiSVD: can't compute thin U or thin V with the FullPivHouseholderQR preconditioner. "
708 "Use the ColPivHouseholderQR preconditioner instead.");
[all...] |
