Assert(u2.size()==dof2.n_dofs(),
ExcDimensionMismatch(u2.size(),dof2.n_dofs()));
- dealii::Vector<typename Vector::value_type> cache;
+ Vector<typename VectorType::value_type> cache;
// Looping over the finest common
// mesh, this means that source and
constraints_and_b_v_are_compatible(constraints, boundary_values);
// set up mass matrix and right hand side
- dealii::Vector<double> vec (dof.n_dofs());
+ Vector<double> vec (dof.n_dofs());
SparsityPattern sparsity;
{
DynamicSparsityPattern dsp (dof.n_dofs(), dof.n_dofs());
sparsity.copy_from (dsp);
}
SparseMatrix<double> mass_matrix (sparsity);
- dealii::Vector<double> tmp (mass_matrix.n());
+ Vector<double> tmp (mass_matrix.n());
// If the constraint matrix does not conflict with the given boundary
// values (i.e., it either does not contain boundary values or it contains
// of the number of
// components of the
// function
- dealii::Vector<double> function_values (fe.n_components());
+ Vector<double> function_values (fe.n_components());
if (fe.n_components() == 1)
function_values(0)
= boundary_function.value (cell->vertex(direction));
// points. have two arrays for scalar and vector functions to use the
// more efficient one respectively
std::vector<double> dof_values_scalar;
- std::vector<dealii::Vector<double> > dof_values_system;
+ std::vector<Vector<double> > dof_values_system;
dof_values_scalar.reserve (DoFTools::max_dofs_per_face (dof));
dof_values_system.reserve (DoFTools::max_dofs_per_face (dof));
// allocating temporary if possible
if (dof_values_system.size() < fe.dofs_per_face)
dof_values_system.resize (fe.dofs_per_face,
- dealii::Vector<double>(fe.n_components()));
+ Vector<double>(fe.n_components()));
else
dof_values_system.resize (fe.dofs_per_face);
void resize_vectors (const unsigned int n_q_points,
const unsigned int n_components);
- std::vector<dealii::Vector<Number> > function_values;
+ std::vector<Vector<Number> > function_values;
std::vector<std::vector<Tensor<1,spacedim,Number> > > function_grads;
std::vector<double> weight_values;
- std::vector<dealii::Vector<double> > weight_vectors;
+ std::vector<Vector<double> > weight_vectors;
- std::vector<dealii::Vector<Number> > psi_values;
+ std::vector<Vector<Number> > psi_values;
std::vector<std::vector<Tensor<1,spacedim,Number> > > psi_grads;
std::vector<Number> psi_scalar;
std::vector<double> tmp_values;
- std::vector<dealii::Vector<double> > tmp_vector_values;
+ std::vector<Vector<double> > tmp_vector_values;
std::vector<Tensor<1,spacedim> > tmp_gradients;
std::vector<std::vector<Tensor<1,spacedim> > > tmp_vector_gradients;
const unsigned int n_components)
{
function_values.resize (n_q_points,
- dealii::Vector<Number>(n_components));
+ Vector<Number>(n_components));
function_grads.resize (n_q_points,
std::vector<Tensor<1,spacedim,Number> >(n_components));
weight_values.resize (n_q_points);
weight_vectors.resize (n_q_points,
- dealii::Vector<double>(n_components));
+ Vector<double>(n_components));
psi_values.resize (n_q_points,
- dealii::Vector<Number>(n_components));
+ Vector<Number>(n_components));
psi_grads.resize (n_q_points,
std::vector<Tensor<1,spacedim,Number> >(n_components));
psi_scalar.resize (n_q_points);
tmp_values.resize (n_q_points);
tmp_vector_values.resize (n_q_points,
- dealii::Vector<double>(n_components));
+ Vector<double>(n_components));
tmp_gradients.resize (n_q_points);
tmp_vector_gradients.resize (n_q_points,
std::vector<Tensor<1,spacedim> >(n_components));
void
get_locally_owned_indicators (const parallel::distributed::Triangulation<dim,spacedim> &tria,
const VectorType &criteria,
- dealii::Vector<typename VectorType::value_type> &locally_owned_indicators)
+ Vector<typename VectorType::value_type> &locally_owned_indicators)
{
Assert (locally_owned_indicators.size() == tria.n_locally_owned_active_cells(),
ExcInternalError());
// vector of indicators the
// ones that correspond to
// cells that we locally own
- dealii::Vector<typename VectorType::value_type>
+ Vector<typename VectorType::value_type>
locally_owned_indicators (tria.n_locally_owned_active_cells());
get_locally_owned_indicators (tria,
criteria,
// vector of indicators the
// ones that correspond to
// cells that we locally own
- dealii::Vector<typename VectorType::value_type>
+ Vector<typename VectorType::value_type>
locally_owned_indicators (tria.n_locally_owned_active_cells());
get_locally_owned_indicators (tria,
criteria,
if (refine_cells || coarsen_cells)
{
- dealii::Vector<typename VectorType::value_type> tmp (criteria);
+ Vector<typename VectorType::value_type> tmp (criteria);
if (refine_cells)
{
std::nth_element (tmp.begin(), tmp.begin()+refine_cells,
// error, which is what we have to sum
// up and compare with
// @p{fraction_of_error*total_error}.
- dealii::Vector<typename VectorType::value_type> tmp;
+ Vector<typename VectorType::value_type> tmp;
tmp = criteria;
const double total_error = tmp.l1_norm();
std::sort (tmp.begin(), tmp.end(), std::greater<double>());
// compute thresholds
- typename dealii::Vector<typename VectorType::value_type>::const_iterator
+ typename Vector<typename VectorType::value_type>::const_iterator
pp=tmp.begin();
for (double sum=0;
(sum<top_fraction*total_error) && (pp!=(tmp.end()-1));
double top_threshold = ( pp != tmp.begin () ?
(*pp+*(pp-1))/2 :
*pp );
- typename dealii::Vector<typename VectorType::value_type>::const_iterator
+ typename Vector<typename VectorType::value_type>::const_iterator
qq=(tmp.end()-1);
for (double sum=0;
(sum<bottom_fraction*total_error) && (qq!=tmp.begin());