| /external/ceres-solver/internal/ceres/ |
| runtime_numeric_diff_cost_function.h | 31 // Create CostFunctions as needed by the least squares framework with jacobians
71 // the "residuals" argument and not the "jacobians". Any data written to the
72 // jacobians by the base cost_function is overwritten.
|
| c_api_test.cc | 114 double** jacobians) {
122 if (jacobians == NULL) {
125 if (jacobians[0] != NULL) {
126 jacobians[0][0] = - x * exp(m * x + c); // dr/dm
128 if (jacobians[1] != NULL) {
129 jacobians[1][0] = - exp(m * x + c); // dr/dc
|
| compressed_row_jacobian_writer.h | 55 // the cost functions, use scratch space to store the jacobians temporarily
65 double **jacobians,
|
| program_evaluator.h | 43 // residual jacobians are written directly into their final position in the
51 // // Prepare the jacobians array for use as the destination of a call to
56 // double** jacobians);
68 // // Write the block jacobians from a residual block evaluation to the
72 // double** jacobians,
189 // Prepare block jacobians if requested.
199 // Evaluate the cost, residuals, and jacobians.
217 // Store the jacobians, if they were requested.
|
| numeric_diff_test_utils.cc | 66 double *jacobians[2] = { &dydx1[0], &dydx2[0] }; local
72 &jacobians[0]));
136 double *jacobians[2] = { &dydx1[0], &dydx2[0] }; local
142 &jacobians[0]));
|
| gradient_checking_cost_function.cc | 101 double** jacobians) const {
102 if (!jacobians) {
109 // Make space for the jacobians of the two methods.
141 // Accumulate the error message for all the jacobians, since it won't get
145 // Copy the original jacobian blocks into the jacobians array.
146 if (jacobians[k] != NULL) {
147 MatrixRef(jacobians[k],
|
| gradient_checking_cost_function.h | 43 // Creates a CostFunction that checks the jacobians that cost_function computes
75 // jacobians obtained by numerically differentiating them. For more
|
| block_jacobian_writer.h | 34 // makes a jacobians array which has direct pointers into the block sparse
67 double** /* jacobians */,
70 // position by the outside evaluate call, thanks to the jacobians array
|
| evaluator_test.cc | 62 double** jacobians) const {
66 if (jacobians) {
68 // The jacobians here are full sized, but they are transformed in the
71 // from these jacobians. Put values in the jacobian that make this
72 // obvious; in particular, make the jacobians like this:
79 // between Jacobians of different residuals for the same parameter.
80 if (jacobians[k] != NULL) {
81 MatrixRef jacobian(jacobians[k],
544 double** jacobians) const {
550 if (jacobians != NULL)
[all...] |
| covariance_test.cc | 137 double** jacobians) const {
142 if (jacobians == NULL) {
146 if (jacobians[0] != NULL) {
147 copy(jacobian_.begin(), jacobian_.end(), jacobians[0]);
176 double** jacobians) const {
181 if (jacobians == NULL) {
185 if (jacobians[0] != NULL) {
186 copy(jacobian1_.begin(), jacobian1_.end(), jacobians[0]);
189 if (jacobians[1] != NULL) {
190 copy(jacobian2_.begin(), jacobian2_.end(), jacobians[1])
[all...] |
| trust_region_minimizer_test.cc | 319 double** jacobians) const {
332 if (jacobians == NULL) {
337 if (jacobians[i] != NULL) {
354 jacobians[i][dim] = 0.;
357 jacobians[i][dim] -= u[dim] / norm_u;
361 jacobians[i][dim] += v[dim] / norm_v;
|
| cost_function_to_functor_test.cc | 64 scoped_array<double> jacobians(new double[num_parameters * num_residuals]);
80 jacobian_blocks[i] = jacobians.get() + num_parameters * num_residuals;
108 EXPECT_NEAR(jacobians[i], actual_jacobians[i], kTolerance)
110 << jacobians[i] << " " << actual_jacobians[i];
|
| c_api.cc | 85 double** jacobians) const {
89 jacobians);
|
| compressed_row_jacobian_writer.cc | 157 double **jacobians,
202 jacobians[argument] + r * parameter_block_size;
|
| problem_test.cc | 67 double** jacobians) const {
88 double** jacobians) const {
111 double** jacobians) const {
315 double** jacobians) const {
795 double** jacobians) const {
803 if (jacobians == NULL) {
808 if (jacobians[j] != NULL) {
809 MatrixRef(jacobians[j], kNumResiduals, kNumResiduals) =
[all...] |
| /external/ceres-solver/examples/ |
| curve_fitting.c | 129 double** jacobians) {
137 if (jacobians == NULL) {
140 if (jacobians[0] != NULL) {
141 jacobians[0][0] = - x * exp(m * x + c); /* dr/dm */
143 if (jacobians[1] != NULL) {
144 jacobians[1][0] = - exp(m * x + c); /* dr/dc */
|
| fields_of_experts.cc | 56 double** jacobians) const {
63 if (jacobians != NULL) {
65 if (jacobians[i] != NULL) {
66 jacobians[i][0] = filter_[i];
|
| denoising.cc | 76 double** jacobians) const {
79 if (jacobians != NULL && jacobians[0] != NULL) {
80 jacobians[0][0] = sqrta_;
|
| /external/ceres-solver/include/ceres/ |
| gradient_checker.h | 33 // that it is computing reasonable derivatives. It compares the Jacobians
94 // between the Jacobians. If the Jacobians differ by more than
99 // results: On return, the two Jacobians (and other information)
103 // Jacobians is less than error_tolerance.
|
| numeric_diff_cost_function.h | 32 // Create CostFunctions as needed by the least squares framework with jacobians
200 double** jacobians) const {
219 if (!jacobians) {
257 if (N ## block && jacobians[block] != NULL) { \
268 jacobians[block])) { \
|
| autodiff_cost_function.h | 32 // Jacobians computed via automatic differentiation. For more
199 double** jacobians) const {
200 if (!jacobians) {
212 jacobians);
|
| conditioned_cost_function.h | 86 double** jacobians) const;
|
| normal_prior.h | 67 double** jacobians) const;
|
| cost_function_to_functor.h | 43 // double** jacobians) const;
50 // jacobians.
689 internal::FixedArray<double> jacobians(num_residuals * kNumParameters);
693 // Build a set of arrays to get the residuals and jacobians from
696 double* jacobian_ptr = jacobians.get();
|
| /external/ceres-solver/include/ceres/internal/ |
| autodiff.h | 138 // the Jacobian parameters, meaning that those Jacobians will not be computed.
213 T **jacobians) {
291 if (jacobians[i]) { \
296 jacobians[i]); \
|
