From 357208ae32cf8285983498329308e66c776e16a7 Mon Sep 17 00:00:00 2001
From: guido <guido@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Tue, 22 Feb 2000 15:40:48 +0000
Subject: [PATCH] minor extensions

git-svn-id: https://svn.dealii.org/trunk@2461 0785d39b-7218-0410-832d-ea1e28bc413d
---
 deal.II/doc/toc.html | 16 +++++++++++-----
 1 file changed, 11 insertions(+), 5 deletions(-)

diff --git a/deal.II/doc/toc.html b/deal.II/doc/toc.html
index 1e02f74344..6733f30039 100644
--- a/deal.II/doc/toc.html
+++ b/deal.II/doc/toc.html
@@ -39,7 +39,7 @@
     </p>
 
     <p>
-    <acronym>deal.II</acronym> emerged from the work at the
+    <acronym>deal.II</acronym> emerged from work at the
     <a href="http://gaia.iwr.uni-heidelberg.de" target="_top">
     Numerical Methods Group</a> of the University of Heidelberg, which
     is at the forefront of adaptive finite element methods and error
@@ -64,9 +64,9 @@
 	 </p>
 
     <li> <p>
-         Handling of locally refined grids, including algorithms to
-         adaptively refine them, using error indicators and
-         estimators.
+         Handling of locally refined grids, including different adaptive
+	 refinement strategies based on local error indicators and
+         error estimators.
 	 </p>
 
     <li> <p>
@@ -76,7 +76,9 @@
 	 </p>
 
     <li> <p>
-         Extensive documentation: about 200 pages of tutorials,
+         Extensive documentation: all documentation is available online
+	 in a logical tree structure to allow fast access to the information
+	 you need. In a printed version it comprises about 200 pages of tutorials,
          several reports, and far more than 1,000 pages of programming
          interface documentation with explanations of all classes,
          functions, and variables.
@@ -85,11 +87,15 @@
     <li> <p>
          Modern software techniques that make access to the complex
          data structures and algorithms as transparent as possible.
+	 The use of object oriented programming allows for program
+	 structures similar to the structures in mathematical analysis.
 	 </p>
 
     <li> <p>
          Fast algorithms that enable you to solve problems with
          up to several millions of degrees of freedom quickly.
+	 As opposed to programming symbolic algebra packages the penalty
+	 for readability is low.
 	 </p>
 
     <li> <p>
-- 
2.39.5