diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2021-10-06 06:44:27 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2021-10-06 06:54:05 +0300 |
| commit | df8f507f411fd71e649e9a896f53c2e574558525 (patch) | |
| tree | c248e58ff8eb31e27ca9a1aae2bc76b8bb4dd3a7 /source/blender/simulation | |
| parent | bf35dba7fbab568e857b85e9a74ae0f1eb5838f6 (diff) | |
Cleanup: spelling in comments
Diffstat (limited to 'source/blender/simulation')
| -rw-r--r-- | source/blender/simulation/intern/ConstrainedConjugateGradient.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/source/blender/simulation/intern/ConstrainedConjugateGradient.h b/source/blender/simulation/intern/ConstrainedConjugateGradient.h index c5a2827a09f..c231d511733 100644 --- a/source/blender/simulation/intern/ConstrainedConjugateGradient.h +++ b/source/blender/simulation/intern/ConstrainedConjugateGradient.h @@ -164,13 +164,13 @@ struct traits< * \brief A conjugate gradient solver for sparse self-adjoint problems with additional constraints * * This class allows to solve for A.x = b sparse linear problems using a conjugate gradient - * algorithm. The sparse matrix A must be selfadjoint. The vectors x and b can be either dense or + * algorithm. The sparse matrix A must be self-adjoint. The vectors x and b can be either dense or * sparse. * * \tparam _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix. * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower * or Upper. Default is Lower. - * \tparam _Preconditioner the type of the preconditioner. Default is DiagonalPreconditioner + * \tparam _Preconditioner the type of the pre-conditioner. Default is #DiagonalPreconditioner * * The maximal number of iterations and tolerance value can be controlled via the * setMaxIterations() and setTolerance() methods. The defaults are the size of the problem for the |