// grid_reordering.cc,v 1.27 2002/05/28 07:43:22 wolf Exp
// Version:
//
-// Copyright (C) 2000, 2001, 2002, 2003 by the deal.II authors
+// Copyright (C) 2000, 2001, 2002, 2003, 2004 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
{2,6},
{3,7}
};
-
-
- // Starting at emination node
- // (for edges) and chosing
- // clockwise order
-// TODO: HERE
- static const unsigned int nodes_on_face[6][4] =
- {
- {0,1,2,3},
- {0,4,5,1},
- {1,5,6,2},
- {3,2,6,7},
- {0,3,7,4},
- {4,7,6,5}
- };
}
// $Id$
// Version: $Name$
//
-// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003 by the deal.II authors
+// Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
VECTOR* Vr = this->memory.alloc (); VECTOR& r = *Vr; r.reinit (x);
double length = x.l2_norm ();
- double old_length = 0.;
double old_value = value;
x.scale(1./length);
solver.solve (A_s, y, x, prec);
// Compute absolute value of eigenvalue
- old_length = length;
length = y.l2_norm ();
// do a little trick to compute the sign