From adddfecd645bd790f663917d234b77c83aee22bb Mon Sep 17 00:00:00 2001 From: bangerth Date: Fri, 29 Feb 2008 23:25:55 +0000 Subject: [PATCH] Say how much faster the result is :-) git-svn-id: https://svn.dealii.org/trunk@15822 0785d39b-7218-0410-832d-ea1e28bc413d --- deal.II/doc/news/changes.h | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/deal.II/doc/news/changes.h b/deal.II/doc/news/changes.h index 210c49a359..bed76caf08 100644 --- 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.
(WB 2008/2/29) -- 2.39.5