Some obsolete topics removed

git-svn-id: https://svn.dealii.org/trunk@7727 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/doc/future.html b/deal.II/doc/future.html
index defeda837b17e1e13f81b8c231fb2f4904ba9dfe..370a9a991003e580e16384f948fd1c4861063c0f 100644 (file)
--- a/deal.II/doc/future.html
+++ b/deal.II/doc/future.html
@@ -18,12 +18,12 @@
     like to implement in future versions. Among these are the following
     topics:
     <ul>
-    <li> <p>
-         <strong>Multigrid:</strong> We are working on an
+    <li> <p> <strong>Multigrid:</strong> We are working on an
          implementation of multigrid methods for
          <acronym>deal.II</acronym>. While this is running on globally
          refined grids, we are still having problems on locally
-         refined grid. We hope to have them sorted out for the next
+         refined meshes. For those, multigrid is only applicable with
+         DG methods yet. We hope to have them sorted out for the next
          major release.
         </p>
 
@@ -38,34 +38,6 @@
          however, offer advice if anyone wanted to implement this.
         </p>
 
-    <li> <p>
-         <strong>Linear solvers:</strong>
-        We already have the most common linear solvers, such as CG,
-         BiCGStab, or Minres. However, there are certainly more
-         proficient implementations of these solvers, but that would
-         need experts in this field which we certainly are not. It
-         would also be of interest to have linear solvers for more
-         complicated applications.
-        </p>
-
-    <li> <p> 
-         <strong>Faster linear algebra:</strong> The linear
-         algebra implementation in <acronym>deal.II</acronym> is quite
-         fast, at least compared to other C/C++ implementations. We
-         know that Fortran compilers can sometimes do a better job in
-         optimizing some algorithms. We therefore would like to
-         interface from C to Fortran for that purpose.
-        </p>
-        
-        <p>
-        On the other hand, we have made some initial experiments with
-        interfacing to BLAS routines on SUN, but it turned out that
-        our own implementation of the routines we tried was faster
-        than the ones in the vendor BLAS. Nevertheless, interfacing
-        to LAPACK or other libraries implementing high level
-        algorithms would be interesting.
-        </p>
-
     <li> <p>
          <strong>More output formats:</strong>
         It would be nice to have the possibility of writing output in