| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
59 #include "ceres/collections_port.h"
60 #include "ceres/graph.h"
61 #include "ceres/linear_solver.h"
62 #include "ceres/linear_operator.h"
63 #include "ceres/suitesparse.h"
64 #include "ceres/internal/macros.h"
65 #include "ceres/internal/scoped_ptr.h"
67 namespace ceres { namespace
[all...] |
| block_jacobi_preconditioner.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/block_jacobi_preconditioner.h"
34 #include "ceres/block_sparse_matrix.h"
35 #include "ceres/block_structure.h"
36 #include "ceres/casts.h"
37 #include "ceres/integral_types.h"
38 #include "ceres/internal/eigen.h"
40 namespace ceres { namespace
135 } // namespace ceres
[all...] |
| block_random_access_dense_matrix_test.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
33 #include "ceres/block_random_access_dense_matrix.h"
34 #include "ceres/internal/eigen.h"
36 namespace ceres { namespace
115 } // namespace ceres
|
| block_random_access_sparse_matrix.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/block_random_access_sparse_matrix.h"
37 #include "ceres/internal/port.h"
38 #include "ceres/internal/scoped_ptr.h"
39 #include "ceres/mutex.h"
40 #include "ceres/triplet_sparse_matrix.h"
41 #include "ceres/types.h"
44 namespace ceres { namespace
158 } // namespace ceres
[all...] |
| block_random_access_sparse_matrix_test.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
33 #include "ceres/block_random_access_sparse_matrix.h"
34 #include "ceres/internal/eigen.h"
38 namespace ceres { namespace
150 } // namespace ceres
|
| block_structure.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/block_structure.h"
32 #include "ceres/matrix_proto.h"
34 namespace ceres { namespace
92 } // namespace ceres
|
| graph.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
36 #include "ceres/integral_types.h"
37 #include "ceres/map_util.h"
38 #include "ceres/collections_port.h"
39 #include "ceres/internal/macros.h"
40 #include "ceres/types.h"
42 namespace ceres { namespace
158 } // namespace ceres
|
| levenberg_marquardt_strategy.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/levenberg_marquardt_strategy.h"
35 #include "ceres/array_utils.h"
36 #include "ceres/internal/eigen.h"
37 #include "ceres/linear_solver.h"
38 #include "ceres/sparse_matrix.h"
39 #include "ceres/trust_region_strategy.h"
40 #include "ceres/types.h"
43 namespace ceres { namespace
[all...] |
| levenberg_marquardt_strategy_test.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/internal/eigen.h"
32 #include "ceres/internal/scoped_ptr.h"
33 #include "ceres/levenberg_marquardt_strategy.h"
34 #include "ceres/linear_solver.h"
35 #include "ceres/trust_region_strategy.h"
47 namespace ceres { namespace
157 } // namespace ceres
|
| local_parameterization.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/local_parameterization.h"
33 #include "ceres/internal/eigen.h"
34 #include "ceres/rotation.h"
37 namespace ceres { namespace
141 } // namespace ceres
|
| loss_function.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
33 #include "ceres/loss_function.h"
38 namespace ceres { namespace
157 } // namespace ceres
|
| normal_prior_test.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/normal_prior.h"
36 #include "ceres/internal/eigen.h"
37 #include "ceres/random.h"
39 namespace ceres { namespace
133 } // namespace ceres
|
| polynomial_solver.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/polynomial_solver.h"
36 #include "ceres/internal/port.h"
39 namespace ceres { namespace
183 } // namespace ceres
|
| problem_impl.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
32 // implementation (PIMPL) idiom makes it possible for Ceres internal code to
45 #include "ceres/internal/macros.h"
46 #include "ceres/internal/port.h"
47 #include "ceres/internal/scoped_ptr.h"
48 #include "ceres/problem.h"
49 #include "ceres/types.h"
51 namespace ceres { namespace
146 } // namespace ceres
[all...] |
| residual_block_utils.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/residual_block_utils.h"
36 #include "ceres/array_utils.h"
37 #include "ceres/internal/eigen.h"
38 #include "ceres/internal/port.h"
39 #include "ceres/parameter_block.h"
40 #include "ceres/residual_block.h"
41 #include "ceres/stringprintf.h"
44 namespace ceres { namespace
[all...] |
| suitesparse.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
44 #include "ceres/internal/port.h"
46 namespace ceres { namespace
156 // By virtue of the modeling layer in Ceres being block oriented,
157 // all the matrices used by Ceres are also block oriented. When
229 } // namespace ceres
|
| types.cc | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/types.h"
37 namespace ceres { namespace
209 } // namespace ceres
|
| /external/ceres-solver/docs/ |
| powell.tex | 1 %!TEX root = ceres-solver.tex
16 class F4 : public ceres::SizedCostFunction<1, 4> {
37 But this can get painful very quickly, especially for residuals involving complicated multi-variate terms. Ceres provides two ways around this problem. Numeric and automatic symbolic differentiation.
41 With its automatic differentiation support, Ceres allows you to define templated objects/functors that will compute the residual and it takes care of computing the Jacobians as needed and filling the \texttt{jacobians} arrays with them. For example, for $f_4(x)$ we define
57 some type \texttt{T}. The reason for using templates here is because Ceres will call \texttt{F4::operator<T>()}, with $\texttt{T=double}$ when just the residual is needed, and with a special type $T=\texttt{Jet}$ when the Jacobians are needed.
68 new ceres::AutoDiffCostFunction<F1, 1, 1, 1>(new F1), NULL, &x1, &x2);
70 new ceres::AutoDiffCostFunction<F2, 1, 1, 1>(new F2), NULL, &x3, &x4);
72 new ceres::AutoDiffCostFunction<F3, 1, 1, 1>(new F3), NULL, &x2, &x3)
74 new ceres::AutoDiffCostFunction<F4, 1, 1, 1>(new F4), NULL, &x1, &x4);
96 Ceres Solver Report: Iterations: 12, Initial cost: 1.075000e+02,
[all...] |
| changes.tex | 1 %!TEX root = ceres-solver.tex
9 options.linear_solver_type = ceres::DENSE_SCHUR
10 options.ordering_type = ceres::SCHUR
14 options.linear_solver_type = ceres::DENSE_SCHUR
18 options.linear_solver_type = ceres::DENSE_SCHUR;
19 options.ordering_type = ceres::USER;
30 options.linear_solver_type = ceres::DENSE_SCHUR;
31 options.ordering = new ceres::ParameterBlockOrdering;
50 \item Defines for Ceres version and ABI version.
52 \item Example Makefile for users of Ceres
[all...] |
| /external/ceres-solver/include/ceres/ |
| jet.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
150 // WARNING: Most Ceres users should not directly include this file or know the
154 // use in Ceres easier.
165 #include "ceres/fpclassify.h"
167 namespace ceres { namespace
640 // Note: This has to be in the ceres namespace for argument dependent lookup to
648 } // namespace ceres
655 struct NumTraits<ceres::Jet<T, N> > {
656 typedef ceres::Jet<T, N> Real
[all...] |
| loss_function.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
54 // measurements that are input to Ceres, has found and matched all
79 #include "ceres/internal/macros.h"
80 #include "ceres/internal/scoped_ptr.h"
81 #include "ceres/types.h"
83 namespace ceres { namespace
395 } // namespace ceres
|
| ordered_groups.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
36 #include "ceres/internal/port.h"
38 namespace ceres { namespace
174 } // namespace ceres
|
| problem.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
43 #include "ceres/internal/macros.h"
44 #include "ceres/internal/port.h"
45 #include "ceres/internal/scoped_ptr.h"
46 #include "ceres/types.h"
48 namespace ceres { namespace
284 } // namespace ceres
|
| solver.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
37 #include "ceres/crs_matrix.h"
38 #include "ceres/internal/macros.h"
39 #include "ceres/internal/port.h"
40 #include "ceres/iteration_callback.h"
41 #include "ceres/ordered_groups.h"
42 #include "ceres/types.h"
44 namespace ceres { namespace
164 // Number of threads used by Ceres for evaluating the cost an
[all...] |
| /external/ceres-solver/include/ceres/internal/ |
| fixed_array.h | 0 // Ceres Solver - A fast non-linear least squares minimizer
3 // http://code.google.com/p/ceres-solver/
38 #include "ceres/internal/macros.h"
39 #include "ceres/internal/manual_constructor.h"
41 namespace ceres { namespace
193 } // namespace ceres
|
