// $Id$
// Version: $Name$
//
-// Copyright (C) 2005, 2006, 2007, 2008 by the deal.II authors
+// Copyright (C) 2005, 2006, 2007, 2008, 2009 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
* destructor of this object which in
* turns calls <code>MPI_Finalize</code>
* to shut down the MPI system.
- *
- * This class is used in @ref step_32
- * "step-32", for example.
*/
class MPI_InitFinalize
{
* provides a unified interface to both serial and parallel
* implementations of Trilinos, sets up the MPI communicator in case the
* programs are run in parallel, and correctly terminates all processes
- * when the destructor is called. An example usage of this class is shown
- * in the tutorial program @ref step_32 "step-32".
+ * when the destructor is called.
*/
#ifdef DEAL_II_USE_TRILINOS
namespace Trilinos
* case, an assertion is thrown.
*
* This function is used in the
- * @ref step_22 "step-22",
- * @ref step_31 "step-31", and
- * @ref step_32 "step-32" tutorial
+ * @ref step_22 "step-22", and
+ * @ref step_31 "step-31" tutorial
* programs.
*/
template <int dim, int spacedim>
the Trilinos ML package that implements an Algebraic Multigrid (AMG)
method. We will use this preconditioner to precondition the second order
operator part of the momentum equation. The ability to solve problems in
-parallel will be explored in @ref step_32 "step-32", using the same problem as
+parallel will be explored in the future tutorial program step-32, using the same problem as
discussed here.
There are various ways to extend the current program. Of particular interest
is, of course, to make it faster and/or increase the resolution of the
-program, in particular in 3d. This is the topic of the @ref step_32 "step-32"
-tutorial program which will implement strategies to solve this problem in
+program, in particular in 3d. This is the topic of the future tutorial
+program step-32
+which will implement strategies to solve this problem in
parallel on a cluster.
Another direction would be to make the fluid flow more realistic. The program
// $Id$
// Version: $Name$
//
-// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by the deal.II authors
+// Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
* (in the sense that the method compress() needs to be called before the
* pattern can be used).
*
- * This class is used in @ref step_32 "step-32".
+ * This class is used in the future step-32 tutorial program.
*
* @author Martin Kronbichler, 2008
*/
* where we have no access to the underlying representation of the matrix,
* and therefore cannot efficiently implement the condense()
* operation). This is the case discussed in @ref step_17 "step-17", @ref
- * step_18 "step-18", @ref step_31 "step-31", and @ref step_32 "step-32".
+ * step_18 "step-18" and @ref step_31 "step-31".
* </ul>
*
* In this case, one possibility is to distribute local entries to the final