From b6a1347d1dc1ec8137d10b7ba2444e4bbf7ea017 Mon Sep 17 00:00:00 2001 From: =?utf8?q?Uwe=20K=C3=B6cher?= Date: Tue, 16 Sep 2014 14:49:51 +0200 Subject: [PATCH] Updated documentation for step-20 Introduction section and a typo in the documentation for iterative_inverse.h. Detailed: In the introduction of the step-20 tutorial, Sec. Solving using the Schur complement, the IterativeInverse class is introduced and then in the following code section not used. Now the InverseMatrix is changed to IterativeInverse< .. > to match with the code of the tutorial, as used below. --- examples/step-20/doc/intro.dox | 4 ++-- include/deal.II/lac/iterative_inverse.h | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/examples/step-20/doc/intro.dox b/examples/step-20/doc/intro.dox index 3453818676..74b1ae3569 100644 --- a/examples/step-20/doc/intro.dox +++ b/examples/step-20/doc/intro.dox @@ -439,14 +439,14 @@ class SchurComplement { public: SchurComplement (const BlockSparseMatrix &A, - const InverseMatrix &Minv); + const IterativeInverse > &Minv); void vmult (Vector &dst, const Vector &src) const; private: const SmartPointer > system_matrix; - const SmartPointer m_inverse; + const SmartPointer > > m_inverse; mutable Vector tmp1, tmp2; }; diff --git a/include/deal.II/lac/iterative_inverse.h b/include/deal.II/lac/iterative_inverse.h index ef2c71006d..b6ba910ad6 100644 --- a/include/deal.II/lac/iterative_inverse.h +++ b/include/deal.II/lac/iterative_inverse.h @@ -34,7 +34,7 @@ DEAL_II_NAMESPACE_OPEN * order to approximate the action of the inverse matrix. * * Krylov space methods like SolverCG or SolverBicgstab - * become inefficient if soution down to machine accuracy is + * become inefficient if solution down to machine accuracy is * needed. This is due to the fact, that round-off errors spoil the * orthogonality of the vector sequences. Therefore, a nested * iteration of two methods is proposed: The outer method is -- 2.39.5