From: wolf <wolf@0785d39b-7218-0410-832d-ea1e28bc413d>
Date: Mon, 5 Jun 2000 14:18:55 +0000 (+0000)
Subject: SparseMatrix::el
X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=231890e31a64cf2490be00cf3c8d4f203ef3f6cf;p=dealii-svn.git

SparseMatrix::el


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

diff --git a/deal.II/doc/news/2000/c-3-0.html b/deal.II/doc/news/2000/c-3-0.html
index afb35d0ab4..0d51eafc68 100644
--- a/deal.II/doc/news/2000/c-3-0.html
+++ b/deal.II/doc/news/2000/c-3-0.html
@@ -73,6 +73,20 @@
 <h3>lac</h3>
 
 <ol>
+  <li> <p>
+       New: there is now a function
+       <code class="member">SparseMatrix::el</code> that does mostly
+       the same as <code class="member">SparseMatrix::operator()</code>,
+       but returns a zero if elements of the matrix are accessed that
+       are not in the sparsity pattern. Thus, the new function allows
+       to actually traverse rows or columns of the matrix without
+       taking care of the sparsity pattern, while
+       <code class="member">SparseMatrix::operator()</code> should be
+       used to write algorithms more efficiently.
+       <br>
+       (WB 2000/06/02)
+       </p>
+
   <li> <p>
        Fix: 
        <code class="member">SparsityPattern::print_gnuplot</code>