Searched refs:diagonal_ (Results 1 - 7 of 7) sorted by relevance
/external/ceres-solver/internal/ceres/ |
H A D | 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();
|
H A D | 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(); 165 // diagonal scaling matrix D defined by sqrt(diagonal_). 176 gradient_.array() /= diagonal_.array(); 188 (gradient_.array() / diagonal_ [all...] |
H A D | 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_;
|
H A D | 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
|
H A D | dogleg_strategy.h | 119 Vector diagonal_; // sqrt(diag(J^T J)) member in class:ceres::internal::DoglegStrategy
|
/external/chromium_org/ui/gfx/ |
H A D | render_text.cc | 256 if (!diagonal_) 257 diagonal_.reset(new DiagonalStrike(canvas_, Point(x, y), paint_)); 258 diagonal_->AddPiece(width, paint_.getColor()); 259 } else if (diagonal_) { 265 if (diagonal_) { 266 diagonal_->Draw(); 267 diagonal_.reset();
|
H A D | render_text.h | 107 scoped_ptr<DiagonalStrike> diagonal_; member in class:gfx::internal::SkiaTextRenderer
|
Completed in 1620 milliseconds