matrix. However, this doesn't work in general: the elimination
of hanging node constraints could re-populate rows and columns
that had already been vacated during boundary node
- elimination. At the end of a long though process, we came to
+ elimination. At the end of a long thought process, we came to
the conclusion that it is impossible to revert the traditional
order of operations: first eliminate all hanging node
constraints, then eliminate all boundary nodes. This leads to a
<li> <p>
Changed: <code class="class">Multigrid</code>::<code
class="member">Multigrid</code> receives an argument
- determining the type of multigrid cycle istead of the minimum
+ determining the type of multigrid cycle instead of the minimum
and maximum levels. The latter were rarely used anyway and can
be modified by <code class="member">set_minlevel()</code> and
<code class="member">set_maxlevel()</code>
(WB 2005/09/09)
</p>
+ <li> <p>
+ Fixed: The linking of PETSc libraries into the static
+ <tt>libpetsc.g.a</tt> and <tt>libpetsc.a</tt> libraries
+ (located in <tt>deal.II/lib</tt>) has now been fixed.
+ <br>
+ (RH 2005/08/26)
+ </p>
+
<li> <p> New:
The step-18 example program shows how to solve a quasi-static elasticity
problem with moving meshes, and this all in parallel.
<li> <p>
Changed: <code>ParameterHandler::get_bool()</code> only accepted
"true" or "false" as boolean values, now it also considers "yes"
- and "no" as "true" and "false" respectively.
+ and "no" as "true" and "false", respectively.
<br>
(Ralf B. Schulz, 2005/07/19)
</p>
</p>
<li> <p>
- Improved: The <code class="class">QProjector</code> has functions
- <code class="class">project_to_face</code> and
- <code class="class">project_to_subface</code>
- returning a <code class="class">Quadrature</code> object
+ Improved: The <code class="class">QProjector</code> now has
+ functions <code class="class">project_to_face</code> and <code
+ class="class">project_to_subface</code> returning a <code
+ class="class">Quadrature</code> object
<br>
(GK, 2005/07/12)
</p>
<li> <p>
Fixed: The <code class="class">PETScWrappers::MPI::SparseMatrix</code>
class had functions that allow to take a pre-existing sparsity pattern
- as the basis for entry allocation. These function had an option to
+ as the basis for entry allocation. These functions had an option to
allow pre-setting these entries in the underlying data structures, but
this option was disabled by default because of unresolved questions
about its effectiveness. This has now been fixed: The code now properly
<li> <p>
Fixed: It was possible to compare iterators into different
- <code>DoFHandler</code> objects for equality and inequality as long as
- the underlying triangulation object was the same. This doesn't make much
- sense, however, and even sometimes declared to iterators equal if only
- they had the same triangulation, refinement level, and index. Comparing
- iterators into different containers is now completely disallowed.
+ <code class="class">DoFHandler</code> objects for equality and
+ inequality as long as the underlying triangulation object was
+ the same. This doesn't make much sense, however, and even
+ sometimes declared to iterators equal if only they had the same
+ triangulation, refinement level, and index. Comparing iterators
+ into different containers is now completely disallowed.
<br>
(WB, 2005/08/08)
</p>
Improved: <code
class="class">Triangulation<3></code>::<code
class="member">create_triangulation</code> now checks that all
- cell have positive volume. If not, an exception is thrown. In
+ cells have positive volume. If not, an exception is thrown. In
that case use the <code
class="class">GridReordering</code>::<code
class="member">invert_all_cells_of_negative_grid</code>
</p>
<li> <p>
- New: The <code class="class">DataOut</code>
+ New: The <code class="class">DataOut</code> class
now supports Eulerian Mappings. If a solution is computed
on a deformed mesh, the output file generated by the DataOut
now shows the solution also on the deformed mesh. This
</p>
<li> <p>
- New: The <code class="class">MappingQ1Eulerian</code>
- can now cope with different vector types fot the Euler vector.
- This is useful if it should be used with the PetSC wrapper classes.
- The desired vector type can be specified as template parameter.
+ New: The <code class="class">MappingQ1Eulerian</code> class can
+ now cope with different vector types for the Euler vector.
+ This is useful if it should be used with the PETSc wrapper
+ classes. The desired vector type can be specified as template
+ parameter.
<br>
(Oliver Kayser-Herold, 2005/05/31)
</p>