// $Id$
// Version: $Name$
//
-// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004 by the deal.II authors
+// Copyright (C) 1998 - 2005 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
* continuous elements with hanging nodes; in fact, most people you
* meet on conferences seem to deny this.
*
- * The function actually performing a multi-level cycle,
- * @p level_mgstep, as well as the function @p vcycle, calling it,
+ * The function actually performing a multi-level V-cycle,
+ * @p level_v_step, as well as the function @p vcycle, calling it,
* require several helper classes handed over as template parameters.
* These classes have to meet the following requirements:
*
*
* The actual work for this
* function is done in
- * @p level_mgstep.
+ * @p level_v_step.
*/
void vcycle();
* is used to solve the matrix of
* this level.
*/
- void level_mgstep (const unsigned int level);
+ void level_v_step (const unsigned int level);
/**
* Level for coarse grid solution.
-//---------------------------- multigrid.templates.h ---------------------------
+//---------------------------------------------------------------------------
// $Id$
// Version: $Name$
//
-// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004 by the deal.II authors
+// Copyright (C) 1998 - 2005 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
// to the file deal.II/doc/license.html for the text and
// further information on this license.
//
-//---------------------------- multigrid.templates.h ---------------------------
+//---------------------------------------------------------------------------
#ifndef __deal2__multigrid_templates_h
#define __deal2__multigrid_templates_h
#include <multigrid/multigrid.h>
template <class VECTOR>
void
-Multigrid<VECTOR>::level_mgstep(const unsigned int level)
+Multigrid<VECTOR>::level_v_step(const unsigned int level)
{
solution[level] = 0.;
// deallog << "recursion " << level << endl;
// do recursion
- level_mgstep(level-1);
+ level_v_step(level-1);
// reset size of the auxiliary
// vector, since it has been
// resized in the recursive call to
- // level_mgstep directly above
+ // level_v_step directly above
t[level] = 0.;
// do coarse grid correction
t[level].reinit(defect[level]);
}
- level_mgstep (maxlevel);
+ level_v_step (maxlevel);
// abort ();
}