// $Id$
// Version: $Name$
//
-// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 by the deal.II authors
+// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
* and arrange the vertices, such
* that UCD understands them.
*
- * \begin{verbatim}
+ * @code
* for (i=0; i< n_vertices; ++i)
* out << cell->vertex(ucd_to_deal[i]);
- * \end{verbatim}
+ * @endcode
*
* As the vertex numbering in
* deal.II versions <= 5.1
* and arrange the vertices, such
* that OpenDX understands them.
*
- * \begin{verbatim}
+ * @code
* for (i=0; i< n_vertices; ++i)
* out << cell->vertex(dx_to_deal[i]);
- * \end{verbatim}
+ * @endcode
*/
static const unsigned int dx_to_deal[vertices_per_cell];
// $Id$
// Version: $Name$
//
-// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 by the deal.II authors
+// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
* Lagrangian $L=1/2 x^T A x - x^T b + l^T B_D x$, where $l$
* is a Lagrange multiplier for the constraints. The stationarity
* condition then reads
- * \begin{verbatim}
+ * @code
* [ A B_D^T ] [x] = [b ]
* [ B_D 0 ] [l] = [g_D]
- * \end{verbatim}
+ * @endcode
*
* The first equation then reads $B_D^T l = b-Ax$. On the other hand,
* if we left-multiply the first equation by $B_D^T B_D$, we obtain