diff options
author | 2014-09-21 14:20:08 +0100 | |
---|---|---|
committer | 2014-09-21 14:20:08 +0100 | |
commit | 333905b0c2e2e377744c7ed326ead34625510530 (patch) | |
tree | adaa9ce11f7413453c62f150d8084ab5b79cedf5 /Eigen/src | |
parent | 5fa69422a2d0f2d508c52e1b0eb39ed7e0d63726 (diff) |
Fix typos in docs for IterativeLinearSolvers module
Diffstat (limited to 'Eigen/src')
-rw-r--r-- | Eigen/src/IterativeLinearSolvers/BiCGSTAB.h | 2 | ||||
-rw-r--r-- | Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h | 12 |
2 files changed, 7 insertions, 7 deletions
diff --git a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h b/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h index 051940dc7..42da7d14b 100644 --- a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h +++ b/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h @@ -143,7 +143,7 @@ struct traits<BiCGSTAB<_MatrixType,_Preconditioner> > * step execution example starting with a random guess and printing the evolution * of the estimated error: * \include BiCGSTAB_step_by_step.cpp - * Note that such a step by step excution is slightly slower. + * Note that such a step by step execution is slightly slower. * * \sa class SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner */ diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h index fd9285087..1ca7e0561 100644 --- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h +++ b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h @@ -60,10 +60,10 @@ public: ~IterativeSolverBase() {} - /** Initializes the iterative solver for the sparcity pattern of the matrix \a A for further solving \c Ax=b problems. + /** Initializes the iterative solver for the sparsity pattern of the matrix \a A for further solving \c Ax=b problems. * - * Currently, this function mostly call analyzePattern on the preconditioner. In the future - * we might, for instance, implement column reodering for faster matrix vector products. + * Currently, this function mostly calls analyzePattern on the preconditioner. In the future + * we might, for instance, implement column reordering for faster matrix vector products. */ Derived& analyzePattern(const MatrixType& A) { @@ -76,7 +76,7 @@ public: /** Initializes the iterative solver with the numerical values of the matrix \a A for further solving \c Ax=b problems. * - * Currently, this function mostly call factorize on the preconditioner. + * Currently, this function mostly calls factorize on the preconditioner. * * \warning this class stores a reference to the matrix A as well as some * precomputed values that depend on it. Therefore, if \a A is changed @@ -95,8 +95,8 @@ public: /** Initializes the iterative solver with the matrix \a A for further solving \c Ax=b problems. * - * Currently, this function mostly initialized/compute the preconditioner. In the future - * we might, for instance, implement column reodering for faster matrix vector products. + * Currently, this function mostly initializes/computes the preconditioner. In the future + * we might, for instance, implement column reordering for faster matrix vector products. * * \warning this class stores a reference to the matrix A as well as some * precomputed values that depend on it. Therefore, if \a A is changed |