Say how much faster the result is :-)

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

diff --git a/deal.II/doc/news/changes.h b/deal.II/doc/news/changes.h
index 210c49a359dadd087715cc0f68848753628b69bc..bed76caf08e2cae04b98df2d1e5606435528cc01 100644 (file)
--- a/deal.II/doc/news/changes.h
+++ b/deal.II/doc/news/changes.h
@@ -218,7 +218,8 @@ an integer id of the current thread.
 inefficient in that it accessed random elements of the matrix in its
 inner loop. It has been replaced by the algorithm given in the book
 by Yves Saad: "Iterative methods for sparse linear systems", second
-edition, in section 10.3.2.
+edition, in section 10.3.2. The code is now about 8 times faster than
+before.
 <br>
 (WB 2008/2/29)
 </li>