diff --git a/gtsam/linear/GaussianMultifrontalSolver.cpp b/gtsam/linear/GaussianMultifrontalSolver.cpp index cfc2636a5..9e80b7c29 100644 --- a/gtsam/linear/GaussianMultifrontalSolver.cpp +++ b/gtsam/linear/GaussianMultifrontalSolver.cpp @@ -11,9 +11,8 @@ /** * @file GaussianMultifrontalSolver.cpp - * @brief * @author Richard Roberts - * @created Oct 21, 2010 + * @date Oct 21, 2010 */ #include diff --git a/gtsam/linear/GaussianMultifrontalSolver.h b/gtsam/linear/GaussianMultifrontalSolver.h index 0f0e43c61..71a4c0c20 100644 --- a/gtsam/linear/GaussianMultifrontalSolver.h +++ b/gtsam/linear/GaussianMultifrontalSolver.h @@ -11,9 +11,8 @@ /** * @file GaussianMultifrontalSolver.h - * @brief * @author Richard Roberts - * @created Oct 21, 2010 + * @date Oct 21, 2010 */ #pragma once @@ -26,7 +25,8 @@ 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 * eliminated into a Bayes tree. * @@ -53,7 +53,7 @@ protected: 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. */ GaussianMultifrontalSolver(const FactorGraph& factorGraph, bool useQR = false); diff --git a/gtsam/linear/GaussianSequentialSolver.cpp b/gtsam/linear/GaussianSequentialSolver.cpp index 252d1d7aa..bfff98e0f 100644 --- a/gtsam/linear/GaussianSequentialSolver.cpp +++ b/gtsam/linear/GaussianSequentialSolver.cpp @@ -11,9 +11,8 @@ /** * @file SequentialSolver.cpp - * @brief * @author Richard Roberts - * @created Oct 19, 2010 + * @date Oct 19, 2010 */ #include diff --git a/gtsam/linear/GaussianSequentialSolver.h b/gtsam/linear/GaussianSequentialSolver.h index 9c625d9c3..cb0b76ec8 100644 --- a/gtsam/linear/GaussianSequentialSolver.h +++ b/gtsam/linear/GaussianSequentialSolver.h @@ -13,7 +13,7 @@ * @file SequentialSolver.h * @brief Solves a GaussianFactorGraph (i.e. a sparse linear system) using sequential variable elimination. * @author Richard Roberts - * @created Oct 19, 2010 + * @date Oct 19, 2010 */ #pragma once diff --git a/gtsam/linear/HessianFactor.cpp b/gtsam/linear/HessianFactor.cpp index 6b75ce6d3..0ac280407 100644 --- a/gtsam/linear/HessianFactor.cpp +++ b/gtsam/linear/HessianFactor.cpp @@ -12,7 +12,7 @@ /** * @file HessianFactor.cpp * @author Richard Roberts - * @created Dec 8, 2010 + * @date Dec 8, 2010 */ #include diff --git a/gtsam/linear/HessianFactor.h b/gtsam/linear/HessianFactor.h index df1633642..f2de0be4c 100644 --- a/gtsam/linear/HessianFactor.h +++ b/gtsam/linear/HessianFactor.h @@ -13,7 +13,7 @@ * @file HessianFactor.h * @brief Contains the HessianFactor class, a general quadratic factor * @author Richard Roberts - * @created Dec 8, 2010 + * @date Dec 8, 2010 */ #pragma once diff --git a/gtsam/linear/JacobianFactor.cpp b/gtsam/linear/JacobianFactor.cpp index 5c315c43d..2295213ec 100644 --- a/gtsam/linear/JacobianFactor.cpp +++ b/gtsam/linear/JacobianFactor.cpp @@ -11,9 +11,8 @@ /** * @file JacobianFactor.cpp - * @brief * @author Richard Roberts - * @created Dec 8, 2010 + * @date Dec 8, 2010 */ #include diff --git a/gtsam/linear/JacobianFactor.h b/gtsam/linear/JacobianFactor.h index dd9eb3996..aba1cfdf1 100644 --- a/gtsam/linear/JacobianFactor.h +++ b/gtsam/linear/JacobianFactor.h @@ -11,9 +11,8 @@ /** * @file JacobianFactor.h - * @brief * @author Richard Roberts - * @created Dec 8, 2010 + * @date Dec 8, 2010 */ #pragma once diff --git a/gtsam/linear/tests/testHessianFactor.cpp b/gtsam/linear/tests/testHessianFactor.cpp index 2e35515f3..d776cc8c6 100644 --- a/gtsam/linear/tests/testHessianFactor.cpp +++ b/gtsam/linear/tests/testHessianFactor.cpp @@ -11,9 +11,8 @@ /** * @file testCholeskyFactor.cpp - * @brief * @author Richard Roberts - * @created Dec 15, 2010 + * @date Dec 15, 2010 */ #include diff --git a/gtsam/linear/tests/testVectorValues.cpp b/gtsam/linear/tests/testVectorValues.cpp index 9e348c628..82b6c2dac 100644 --- a/gtsam/linear/tests/testVectorValues.cpp +++ b/gtsam/linear/tests/testVectorValues.cpp @@ -11,9 +11,8 @@ /** * @file testVectorValues.cpp - * @brief * @author Richard Roberts - * @created Sep 16, 2010 + * @date Sep 16, 2010 */ #include diff --git a/gtsam/linear/tests/timeFactorOverhead.cpp b/gtsam/linear/tests/timeFactorOverhead.cpp index 2607cab25..a843efd84 100644 --- a/gtsam/linear/tests/timeFactorOverhead.cpp +++ b/gtsam/linear/tests/timeFactorOverhead.cpp @@ -13,7 +13,7 @@ * @file timeFactorOverhead.cpp * @brief Compares times of solving large single-factor graphs with their multi-factor equivalents. * @author Richard Roberts - * @created Aug 20, 2010 + * @date Aug 20, 2010 */ #include diff --git a/gtsam/linear/tests/timeSLAMlike.cpp b/gtsam/linear/tests/timeSLAMlike.cpp index 60213c52c..d5e8a5904 100644 --- a/gtsam/linear/tests/timeSLAMlike.cpp +++ b/gtsam/linear/tests/timeSLAMlike.cpp @@ -13,7 +13,7 @@ * @file timeSLAMlike.cpp * @brief Times solving of random SLAM-like graphs * @author Richard Roberts - * @created Aug 30, 2010 + * @date Aug 30, 2010 */ #include @@ -141,6 +141,6 @@ int main(int argc, char *argv[]) { * @file timeSLAMlike.cpp * @brief * @author Richard Roberts - * @created Aug 30, 2010 + * @date Aug 30, 2010 */ diff --git a/gtsam/nonlinear/Ordering.cpp b/gtsam/nonlinear/Ordering.cpp index 8733af955..d8b5eac7e 100644 --- a/gtsam/nonlinear/Ordering.cpp +++ b/gtsam/nonlinear/Ordering.cpp @@ -11,9 +11,8 @@ /** * @file Ordering.cpp - * @brief * @author Richard Roberts - * @created Sep 2, 2010 + * @date Sep 2, 2010 */ #include "Ordering.h" diff --git a/gtsam/nonlinear/Ordering.h b/gtsam/nonlinear/Ordering.h index b1ffd5017..79a9aa436 100644 --- a/gtsam/nonlinear/Ordering.h +++ b/gtsam/nonlinear/Ordering.h @@ -11,9 +11,8 @@ /** * @file Ordering.h - * @brief * @author Richard Roberts - * @created Sep 2, 2010 + * @date Sep 2, 2010 */ #pragma once