12345qiupeng
/
gtsam
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Some comments

release/4.3a0
dellaert 2015-02-13 16:07:32 +01:00
parent 91ea8e3bd7
commit a4aa7b9f45
2 changed files with 6 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
gtsam/inference/EliminateableFactorGraph.h
View File

@ -128,7 +128,8 @@ namespace gtsam {
OptionalOrderingType orderingType = boost::none) const;
/** Do multifrontal elimination of all variables to produce a Bayes tree. If an ordering is not
* provided, the ordering provided by COLAMD will be used.
* provided, the ordering will be computed using either COLAMD or METIS, dependeing on
* the parameter orderingType (Ordering::COLAMD or Ordering::METIS)
*
* <b> Example - Full Cholesky elimination in COLAMD order: </b>
* \code

4
gtsam/nonlinear/LevenbergMarquardtOptimizer.cpp
View File

@ -242,8 +242,10 @@ void LevenbergMarquardtOptimizer::iterate() {
bool systemSolvedSuccessfully;
try {
// ============ Solve is where most computation happens !! =================
delta = solve(dampedSystem, state_.values, params_);
systemSolvedSuccessfully = true;
// =========================================================================
} catch (IndeterminantLinearSystemException) {
systemSolvedSuccessfully = false;
}
@ -267,7 +269,9 @@ void LevenbergMarquardtOptimizer::iterate() {
if (linearizedCostChange >= 0) { // step is valid
// update values
gttic(retract);
// ============ This is where the solution is updated ====================
newValues = state_.values.retract(delta);
// =======================================================================
gttoc(retract);
// compute new error