Updated documentation for step-20 Introduction section and a typo in the documentatio...

diff --git a/examples/step-20/doc/intro.dox b/examples/step-20/doc/intro.dox
index 3453818676017349685a3f005bda3e45aa0e4c89..74b1ae35697ea5cde04865256c2b10d0ccc4be40 100644 (file)
--- a/examples/step-20/doc/intro.dox
+++ b/examples/step-20/doc/intro.dox
@@ -439,14 +439,14 @@ class SchurComplement
 {
   public:
     SchurComplement (const BlockSparseMatrix<double> &A,
-                     const InverseMatrix             &Minv);
+                     const IterativeInverse<Vector<double> > &Minv);
 
     void vmult (Vector<double>       &dst,
                 const Vector<double> &src) const;
 
   private:
     const SmartPointer<const BlockSparseMatrix<double> > system_matrix;
-    const SmartPointer<const InverseMatrix>              m_inverse;
+    const SmartPointer<const IterativeInverse<Vector<double> > > m_inverse;
 
     mutable Vector<double> tmp1, tmp2;
 };

diff --git a/include/deal.II/lac/iterative_inverse.h b/include/deal.II/lac/iterative_inverse.h
index ef2c71006dc3c6c06b01a8f075f6018466c0f7b1..b6ba910ad6e78ed6393724a82a4734c07b386c69 100644 (file)
--- 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