diff options
| author |  Gael Guennebaud <g.gael@free.fr> | 2018-06-07 14:43:02 +0200 |
|---|---|---|
| committer | Gael Guennebaud <g.gael@free.fr> | 2018-06-07 14:43:02 +0200 |
| commit | b3fd93207bea08fc459be46f84fd6bbe18b19523 (patch) | |
| tree | a4607c9e0c086ada062606cd04c54ed6255b412a /unsupported/Eigen/src/LevenbergMarquardt | |
| parent | 405859f18dac56f324e1d93ca8721d5f7fd22c62 (diff) | |
Fix typos found using codespell
Diffstat (limited to 'unsupported/Eigen/src/LevenbergMarquardt')
| -rw-r--r-- | unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h | 2 | ||||
| -rw-r--r-- | unsupported/Eigen/src/LevenbergMarquardt/LevenbergMarquardt.h | 4 |
2 files changed, 3 insertions, 3 deletions
diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h index ae9d793b1..123485817 100644 --- a/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h +++ b/unsupported/Eigen/src/LevenbergMarquardt/LMqrsolv.h @@ -73,7 +73,7 @@ void lmqrsolv( qtbpj = -givens.s() * wa[k] + givens.c() * qtbpj; wa[k] = temp; - /* accumulate the tranformation in the row of s. */ + /* accumulate the transformation in the row of s. */ for (i = k+1; i<n; ++i) { temp = givens.c() * s(i,k) + givens.s() * sdiag[i]; sdiag[i] = -givens.s() * s(i,k) + givens.c() * sdiag[i]; diff --git a/unsupported/Eigen/src/LevenbergMarquardt/LevenbergMarquardt.h b/unsupported/Eigen/src/LevenbergMarquardt/LevenbergMarquardt.h index 995427978..5f64501be 100644 --- a/unsupported/Eigen/src/LevenbergMarquardt/LevenbergMarquardt.h +++ b/unsupported/Eigen/src/LevenbergMarquardt/LevenbergMarquardt.h @@ -233,9 +233,9 @@ class LevenbergMarquardt : internal::no_assignment_operator /** * \brief Reports whether the minimization was successful - * \returns \c Success if the minimization was succesful, + * \returns \c Success if the minimization was successful, * \c NumericalIssue if a numerical problem arises during the - * minimization process, for exemple during the QR factorization + * minimization process, for example during the QR factorization * \c NoConvergence if the minimization did not converge after * the maximum number of function evaluation allowed * \c InvalidInput if the input matrix is invalid |