OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:diagonal_
(Results
1 - 5
of
5
) sorted by null
/external/ceres-solver/internal/ceres/
levenberg_marquardt_strategy.cc
76
if (
diagonal_
.rows() != num_parameters) {
77
diagonal_
.resize(num_parameters, 1);
80
jacobian->SquaredColumnNorm(
diagonal_
.data());
82
diagonal_
[i] = min(max(
diagonal_
[i], min_diagonal_), max_diagonal_);
86
lm_diagonal_ = (
diagonal_
/ radius_).array().sqrt();
levenberg_marquardt_strategy.h
77
Vector
diagonal_
; //
diagonal_
= diag(J'J)
member in class:ceres::internal::LevenbergMarquardtStrategy
78
// Scaled copy of
diagonal_
. Stored here as optimization to prevent
81
Vector lm_diagonal_; // lm_diagonal_ =
diagonal_
/ radius_;
dogleg_strategy.cc
109
if (
diagonal_
.rows() != n) {
110
diagonal_
.resize(n, 1);
121
jacobian->SquaredColumnNorm(
diagonal_
.data());
123
diagonal_
[i] = min(max(
diagonal_
[i], min_diagonal_), max_diagonal_);
125
diagonal_
=
diagonal_
.array().sqrt();
161
// diagonal scaling matrix D defined by sqrt(
diagonal_
).
172
gradient_.array() /=
diagonal_
.array();
184
(gradient_.array() /
diagonal_
.array()).matrix()
[
all
...]
levenberg_marquardt_strategy_test.cc
58
diagonal_
(diagonal) {
71
EXPECT_NEAR(per_solve_options.D[i],
diagonal_
[i], kTolerance)
72
<< i << " " << per_solve_options.D[i] << " " <<
diagonal_
[i];
78
const double*
diagonal_
;
member in class:ceres::internal::RegularizationCheckingLinearSolver
dogleg_strategy.h
119
Vector
diagonal_
; // sqrt(diag(J^T J))
member in class:ceres::internal::DoglegStrategy
Completed in 6245 milliseconds