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

Refined reference documentation

release/4.3a0
jingwuOUO 2020-12-11 01:01:40 -05:00
parent afb6ebb933
commit 55ad1f16a6
2 changed files with 13 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
gtsam/linear/AcceleratedPowerMethod.h
View File

@ -29,19 +29,21 @@ using Sparse = Eigen::SparseMatrix<double>;
* \brief Compute maximum Eigenpair with accelerated power method * \brief Compute maximum Eigenpair with accelerated power method
* *
* References : * References :
* 1) Rosen, D. and Carlone, L., 2017, September. Computational * 1) G. Golub and C. V. Loan, Matrix Computations, 3rd ed. Baltimore, Johns
* Hopkins University Press, 1996, pp.405-411
* 2) Rosen, D. and Carlone, L., 2017, September. Computational
* enhancements for certifiably correct SLAM. In Proceedings of the * enhancements for certifiably correct SLAM. In Proceedings of the
* International Conference on Intelligent Robots and Systems. * International Conference on Intelligent Robots and Systems.
* 2) Yulun Tian and Kasra Khosoussi and David M. Rosen and Jonathan P. How, * 3) Yulun Tian and Kasra Khosoussi and David M. Rosen and Jonathan P. How,
* 2020, Aug, Distributed Certifiably Correct Pose-Graph Optimization, Arxiv * 2020, Aug, Distributed Certifiably Correct Pose-Graph Optimization, Arxiv
* 3) C. de Sa, B. He, I. Mitliagkas, C. Ré, and P. Xu, “Accelerated * 4) C. de Sa, B. He, I. Mitliagkas, C. Ré, and P. Xu, “Accelerated
* stochastic power iteration,” in Proc. Mach. Learn. Res., no. 84, 2018, pp. * stochastic power iteration,” in Proc. Mach. Learn. Res., no. 84, 2018, pp.
* 58–67 * 58–67
* *
* It performs the following iteration: \f$ x_{k+1} = A * x_k - \beta * * It performs the following iteration: \f$ x_{k+1} = A * x_k - \beta *
* x_{k-1} \f$ where A is the aim matrix we want to get eigenpair of, x is the * x_{k-1} \f$ where A is the aim matrix we want to get eigenpair of, x is the
* Ritz vector * Ritz vector
* *
* Template argument Operator just needs multiplication operator * Template argument Operator just needs multiplication operator
* *
*/ */

12
gtsam/linear/PowerMethod.h
View File

@ -35,19 +35,21 @@ using Sparse = Eigen::SparseMatrix<double>;
* \brief Compute maximum Eigenpair with power method * \brief Compute maximum Eigenpair with power method
* *
* References : * References :
* 1) Rosen, D. and Carlone, L., 2017, September. Computational * 1) G. Golub and C. V. Loan, Matrix Computations, 3rd ed. Baltimore, Johns
* Hopkins University Press, 1996, pp.405-411
* 2) Rosen, D. and Carlone, L., 2017, September. Computational
* enhancements for certifiably correct SLAM. In Proceedings of the * enhancements for certifiably correct SLAM. In Proceedings of the
* International Conference on Intelligent Robots and Systems. * International Conference on Intelligent Robots and Systems.
* 2) Yulun Tian and Kasra Khosoussi and David M. Rosen and Jonathan P. How, * 3) Yulun Tian and Kasra Khosoussi and David M. Rosen and Jonathan P. How,
* 2020, Aug, Distributed Certifiably Correct Pose-Graph Optimization, Arxiv * 2020, Aug, Distributed Certifiably Correct Pose-Graph Optimization, Arxiv
* 3) C. de Sa, B. He, I. Mitliagkas, C. Ré, and P. Xu, “Accelerated * 4) C. de Sa, B. He, I. Mitliagkas, C. Ré, and P. Xu, “Accelerated
* stochastic power iteration,” in Proc. Mach. Learn. Res., no. 84, 2018, pp. * stochastic power iteration,” in Proc. Mach. Learn. Res., no. 84, 2018, pp.
* 58–67 * 58–67
* *
* It performs the following iteration: \f$ x_{k+1} = A * x_k \f$ * It performs the following iteration: \f$ x_{k+1} = A * x_k \f$
* where A is the aim matrix we want to get eigenpair of, x is the * where A is the aim matrix we want to get eigenpair of, x is the
* Ritz vector * Ritz vector
* *
* Template argument Operator just needs multiplication operator * Template argument Operator just needs multiplication operator
* *
*/ */