</p>
<p>
- The following publication explains in great detail the
- implementation of algorithms and data structures of the hp
- component of deal.II:
+ The following publications explain in great detail the
+ implementation of algorithms and data structures of the hp and multigrid
+ components of deal.II:
<ol>
<li value="1"> <p>
<a
<br>
ACM Trans. Math. Softw., vol. 36, pp. 4/1-31, 2009
</p>
+ <li value="2"> <p>
+ <a href="http://www.math.tamu.edu/~kanschat"
+ target="_top">G. Kanschat</a>
+ <br>
+ <strong>Multi-level methods for discontinuous Galerkin FEM on locally refined meshes</strong>
+ <br>
+ Comput. & Struct., vol. 82, pp. 2437-2445, 2004
+ </p>
</ol>
<p>
comparison with respect to many different metrics of the
benchmarks in SPEC CPU2006, including <acronym>deal.II</acronym>:
<ol>
- <li value="2"> <p>
+ <li value="3"> <p>
<strong>Special Issue: SPEC CPU2006 analysis (Editor: John Henning)
</strong>
<br>
</p>
</ol>
- <p>The ideas behind the adaptive multigrid implementation and the matrices used are described in:
- <ol>
- <li value="3"> <p>
- <a href="http://www.math.tamu.edu/~kanschat"
- target="_top">G. Kanschat</a>
- <br>
- <strong>Multi-level methods for discontinuous Galerkin FEM on locally refined meshes</strong>
- <br>
- Comput. & Struct., vol. 82, pp. 2437-2445, 2004
- </p>
- </ol>
<a name="2010" />
<h3>Publications in 2010</h3>