release/4.3a0
Frank Dellaert 2011-10-22 19:56:26 +00:00
parent fbafbaa892
commit fabde56642
14 changed files with 18 additions and 26 deletions

View File

@ -11,9 +11,8 @@
/** /**
* @file GaussianMultifrontalSolver.cpp * @file GaussianMultifrontalSolver.cpp
* @brief
* @author Richard Roberts * @author Richard Roberts
* @created Oct 21, 2010 * @date Oct 21, 2010
*/ */
#include <gtsam/3rdparty/Eigen/Eigen/Dense> #include <gtsam/3rdparty/Eigen/Eigen/Dense>

View File

@ -11,9 +11,8 @@
/** /**
* @file GaussianMultifrontalSolver.h * @file GaussianMultifrontalSolver.h
* @brief
* @author Richard Roberts * @author Richard Roberts
* @created Oct 21, 2010 * @date Oct 21, 2010
*/ */
#pragma once #pragma once
@ -26,7 +25,8 @@
namespace gtsam { namespace gtsam {
/** This solver uses multifrontal elimination to solve a GaussianFactorGraph, /**
* This solver uses multifrontal elimination to solve a GaussianFactorGraph,
* i.e. a sparse linear system. Underlying this is a junction tree, which is * i.e. a sparse linear system. Underlying this is a junction tree, which is
* eliminated into a Bayes tree. * eliminated into a Bayes tree.
* *
@ -53,7 +53,7 @@ protected:
public: public:
/** /**
* Construct the solver for a factor graph. This builds the elimination * Construct the solver for a factor graph. This builds the junction
* tree, which already does some of the work of elimination. * tree, which already does some of the work of elimination.
*/ */
GaussianMultifrontalSolver(const FactorGraph<GaussianFactor>& factorGraph, bool useQR = false); GaussianMultifrontalSolver(const FactorGraph<GaussianFactor>& factorGraph, bool useQR = false);

View File

@ -11,9 +11,8 @@
/** /**
* @file SequentialSolver.cpp * @file SequentialSolver.cpp
* @brief
* @author Richard Roberts * @author Richard Roberts
* @created Oct 19, 2010 * @date Oct 19, 2010
*/ */
#include <gtsam/3rdparty/Eigen/Eigen/Dense> #include <gtsam/3rdparty/Eigen/Eigen/Dense>

View File

@ -13,7 +13,7 @@
* @file SequentialSolver.h * @file SequentialSolver.h
* @brief Solves a GaussianFactorGraph (i.e. a sparse linear system) using sequential variable elimination. * @brief Solves a GaussianFactorGraph (i.e. a sparse linear system) using sequential variable elimination.
* @author Richard Roberts * @author Richard Roberts
* @created Oct 19, 2010 * @date Oct 19, 2010
*/ */
#pragma once #pragma once

View File

@ -12,7 +12,7 @@
/** /**
* @file HessianFactor.cpp * @file HessianFactor.cpp
* @author Richard Roberts * @author Richard Roberts
* @created Dec 8, 2010 * @date Dec 8, 2010
*/ */
#include <sstream> #include <sstream>

View File

@ -13,7 +13,7 @@
* @file HessianFactor.h * @file HessianFactor.h
* @brief Contains the HessianFactor class, a general quadratic factor * @brief Contains the HessianFactor class, a general quadratic factor
* @author Richard Roberts * @author Richard Roberts
* @created Dec 8, 2010 * @date Dec 8, 2010
*/ */
#pragma once #pragma once

View File

@ -11,9 +11,8 @@
/** /**
* @file JacobianFactor.cpp * @file JacobianFactor.cpp
* @brief
* @author Richard Roberts * @author Richard Roberts
* @created Dec 8, 2010 * @date Dec 8, 2010
*/ */
#include <gtsam/base/debug.h> #include <gtsam/base/debug.h>

View File

@ -11,9 +11,8 @@
/** /**
* @file JacobianFactor.h * @file JacobianFactor.h
* @brief
* @author Richard Roberts * @author Richard Roberts
* @created Dec 8, 2010 * @date Dec 8, 2010
*/ */
#pragma once #pragma once

View File

@ -11,9 +11,8 @@
/** /**
* @file testCholeskyFactor.cpp * @file testCholeskyFactor.cpp
* @brief
* @author Richard Roberts * @author Richard Roberts
* @created Dec 15, 2010 * @date Dec 15, 2010
*/ */
#include <vector> #include <vector>

View File

@ -11,9 +11,8 @@
/** /**
* @file testVectorValues.cpp * @file testVectorValues.cpp
* @brief
* @author Richard Roberts * @author Richard Roberts
* @created Sep 16, 2010 * @date Sep 16, 2010
*/ */
#include <boost/assign/std/vector.hpp> #include <boost/assign/std/vector.hpp>

View File

@ -13,7 +13,7 @@
* @file timeFactorOverhead.cpp * @file timeFactorOverhead.cpp
* @brief Compares times of solving large single-factor graphs with their multi-factor equivalents. * @brief Compares times of solving large single-factor graphs with their multi-factor equivalents.
* @author Richard Roberts * @author Richard Roberts
* @created Aug 20, 2010 * @date Aug 20, 2010
*/ */
#include <gtsam/linear/GaussianFactorGraph.h> #include <gtsam/linear/GaussianFactorGraph.h>

View File

@ -13,7 +13,7 @@
* @file timeSLAMlike.cpp * @file timeSLAMlike.cpp
* @brief Times solving of random SLAM-like graphs * @brief Times solving of random SLAM-like graphs
* @author Richard Roberts * @author Richard Roberts
* @created Aug 30, 2010 * @date Aug 30, 2010
*/ */
#include <gtsam/linear/GaussianFactorGraph.h> #include <gtsam/linear/GaussianFactorGraph.h>
@ -141,6 +141,6 @@ int main(int argc, char *argv[]) {
* @file timeSLAMlike.cpp * @file timeSLAMlike.cpp
* @brief * @brief
* @author Richard Roberts * @author Richard Roberts
* @created Aug 30, 2010 * @date Aug 30, 2010
*/ */

View File

@ -11,9 +11,8 @@
/** /**
* @file Ordering.cpp * @file Ordering.cpp
* @brief
* @author Richard Roberts * @author Richard Roberts
* @created Sep 2, 2010 * @date Sep 2, 2010
*/ */
#include "Ordering.h" #include "Ordering.h"

View File

@ -11,9 +11,8 @@
/** /**
* @file Ordering.h * @file Ordering.h
* @brief
* @author Richard Roberts * @author Richard Roberts
* @created Sep 2, 2010 * @date Sep 2, 2010
*/ */
#pragma once #pragma once