void
get_subface_interpolation_matrix (const FiniteElement<dim> &source_fe,
const unsigned int index,
- FullMatrix<double> &interpolation_matrix) const;
+ FullMatrix<double> &interpolation_matrix) const;
};
fill_fe_values (const Mapping<dim,spacedim> &mapping,
const typename Triangulation<dim,spacedim>::cell_iterator &cell,
const Quadrature<dim> &quadrature,
- typename Mapping<dim,spacedim>::InternalDataBase &mapping_internal,
- typename Mapping<dim,spacedim>::InternalDataBase &fe_internal,
+ typename Mapping<dim,spacedim>::InternalDataBase &mapping_internal,
+ typename Mapping<dim,spacedim>::InternalDataBase &fe_internal,
FEValuesData<dim,spacedim> &data,
CellSimilarity::Similarity &cell_similarity) const;
* copies around will then delete the pointer to the base elements.
*/
std::vector<std::pair<std_cxx1x::shared_ptr<const FiniteElement<dim,spacedim> >,
- unsigned int> >
- base_elements;
+ unsigned int> >
+ base_elements;
/**
*/
template<int dim, int spacedim>
void compute_block_renumbering (
- const FiniteElement<dim,spacedim> &fe,
+ const FiniteElement<dim,spacedim> &fe,
std::vector<unsigned int> &renumbering,
std::vector<unsigned int> &block_data,
bool return_start_indices = true);
template <int, int> class DH1,
template <int, int> class DH2,
class InVector, class OutVector>
- void interpolate (const DH1<dim,spacedim> &dof1,
+ void interpolate (const DH1<dim,spacedim> &dof1,
const InVector &u1,
- const DH2<dim,spacedim> &dof2,
+ const DH2<dim,spacedim> &dof2,
const ConstraintMatrix &constraints,
OutVector &u2);
* mapping.
*/
template <int dim, class InVector, class OutVector, int spacedim>
- void back_interpolate (const DoFHandler<dim,spacedim> &dof1,
+ void back_interpolate (const DoFHandler<dim,spacedim> &dof1,
const ConstraintMatrix &constraints1,
const InVector &u1,
- const DoFHandler<dim,spacedim> &dof2,
+ const DoFHandler<dim,spacedim> &dof2,
const ConstraintMatrix &constraints2,
OutVector &u1_interpolated);
* are involved.
*/
template <int dim, class InVector, class OutVector, int spacedim>
- void interpolation_difference(const DoFHandler<dim,spacedim> &dof1,
+ void interpolation_difference(const DoFHandler<dim,spacedim> &dof1,
const ConstraintMatrix &constraints1,
const InVector &z1,
- const DoFHandler<dim,spacedim> &dof2,
+ const DoFHandler<dim,spacedim> &dof2,
const ConstraintMatrix &constraints2,
OutVector &z1_difference);
* function.
*/
template <int dim, class InVector, class OutVector, int spacedim>
- void extrapolate (const DoFHandler<dim,spacedim> &dof1,
+ void extrapolate (const DoFHandler<dim,spacedim> &dof1,
const InVector &z1,
- const DoFHandler<dim,spacedim> &dof2,
+ const DoFHandler<dim,spacedim> &dof2,
const ConstraintMatrix &constraints,
OutVector &z2);
//@}
* can be initialized by
* <tt>DoFAccessor::set_dof_values()</tt>.
*/
- MappingQ1Eulerian (const VECTOR &euler_transform_vectors,
+ MappingQ1Eulerian (const VECTOR &euler_transform_vectors,
const DoFHandler<dim,spacedim> &shiftmap_dof_handler);
/**
*/
MappingQEulerian (const unsigned int degree,
- const VECTOR &euler_vector,
- const DoFHandler<dim,spacedim> &euler_dof_handler);
+ const VECTOR &euler_vector,
+ const DoFHandler<dim,spacedim> &euler_dof_handler);
/**
* Return a pointer to a copy of the
*/
template <typename block_number,
typename nonblock_number>
- void Tvmult (BlockVector<block_number> &dst,
+ void Tvmult (BlockVector<block_number> &dst,
const Vector<nonblock_number> &src) const;
/**
* diagonal.
*/
ChunkSparseMatrix (const ChunkSparsityPattern &sparsity,
- const IdentityMatrix &id);
+ const IdentityMatrix &id);
/**
* Destructor. Free all memory, but do not
* diagonal.
*/
ChunkSparseMatrix<number> &
- operator= (const IdentityMatrix &id);
+ operator= (const IdentityMatrix &id);
/**
* This operator assigns a scalar to
template <typename number>
ChunkSparseMatrix<number>::ChunkSparseMatrix (const ChunkSparsityPattern &c,
- const IdentityMatrix &id)
+ const IdentityMatrix &id)
:
cols(0, "ChunkSparseMatrix"),
val(0),
template <typename number>
ChunkSparseMatrix<number> &
-ChunkSparseMatrix<number>::operator= (const IdentityMatrix &id)
+ChunkSparseMatrix<number>::operator= (const IdentityMatrix &id)
{
Assert (cols->n_rows() == id.m(),
ExcDimensionMismatch (cols->n_rows(), id.m()));
template <typename ForwardIteratorVec, typename ForwardIteratorInd,
class VectorType>
void
- get_dof_values (const VectorType &global_vector,
+ get_dof_values (const VectorType &global_vector,
ForwardIteratorInd local_indices_begin,
ForwardIteratorVec local_vector_begin,
ForwardIteratorVec local_vector_end) const;
*/
void
make_sorted_row_list (const std::vector<unsigned int> &local_dof_indices,
- internals::GlobalRowsFromLocal &global_rows) const;
+ internals::GlobalRowsFromLocal &global_rows) const;
/**
* Internal helper function for
template <typename ForwardIteratorVec, typename ForwardIteratorInd,
class VectorType>
inline
-void ConstraintMatrix::get_dof_values (const VectorType &global_vector,
+void ConstraintMatrix::get_dof_values (const VectorType &global_vector,
ForwardIteratorInd local_indices_begin,
ForwardIteratorVec local_vector_begin,
ForwardIteratorVec local_vector_end) const
const unsigned int column_start,
const unsigned int column_end,
const FullMatrix<double> &local_matrix,
- unsigned int *&col_ptr,
- number *&val_ptr)
+ unsigned int *&col_ptr,
+ number *&val_ptr)
{
if (column_end == column_start)
return;
void
ConstraintMatrix::
make_sorted_row_list (const std::vector<unsigned int> &local_dof_indices,
- internals::GlobalRowsFromLocal &global_rows) const
+ internals::GlobalRowsFromLocal &global_rows) const
{
const unsigned int n_local_dofs = local_dof_indices.size();
AssertDimension (n_local_dofs, global_rows.size());
*/
void set (const unsigned int row,
const std::vector<unsigned int> &col_indices,
- const std::vector<PetscScalar> &values,
+ const std::vector<PetscScalar> &values,
const bool elide_zero_values = false);
/**
void set (const unsigned int row,
const unsigned int n_cols,
const unsigned int *col_indices,
- const PetscScalar *values,
+ const PetscScalar *values,
const bool elide_zero_values = false);
/**
*/
void add (const unsigned int row,
const std::vector<unsigned int> &col_indices,
- const std::vector<PetscScalar> &values,
+ const std::vector<PetscScalar> &values,
const bool elide_zero_values = true);
/**
void add (const unsigned int row,
const unsigned int n_cols,
const unsigned int *col_indices,
- const PetscScalar *values,
+ const PetscScalar *values,
const bool elide_zero_values = true,
const bool col_indices_are_sorted = false);
void
MatrixBase::set (const unsigned int row,
const std::vector<unsigned int> &col_indices,
- const std::vector<PetscScalar> &values,
+ const std::vector<PetscScalar> &values,
const bool elide_zero_values)
{
Assert (col_indices.size() == values.size(),
MatrixBase::set (const unsigned int row,
const unsigned int n_cols,
const unsigned int *col_indices,
- const PetscScalar *values,
+ const PetscScalar *values,
const bool elide_zero_values)
{
prepare_action(LastAction::insert);
void
MatrixBase::add (const unsigned int row,
const std::vector<unsigned int> &col_indices,
- const std::vector<PetscScalar> &values,
+ const std::vector<PetscScalar> &values,
const bool elide_zero_values)
{
Assert (col_indices.size() == values.size(),
MatrixBase::add (const unsigned int row,
const unsigned int n_cols,
const unsigned int *col_indices,
- const PetscScalar *values,
+ const PetscScalar *values,
const bool elide_zero_values,
const bool /*col_indices_are_sorted*/)
{
* in derived classes.
*/
virtual
- void vmult (Vec &dst, const Vec &src) const;
+ void vmult (Vec &dst, const Vec &src) const;
private:
* to those of the given argument and
* copy the elements.
*/
- BlockVector (const BlockVector &V);
+ BlockVector (const BlockVector &V);
/**
* Constructor. Set the number of
* see the documentation of the
* SolverBase class.
*/
- SolverBase (SolverControl &cn,
+ SolverBase (SolverControl &cn,
const MPI_Comm &mpi_communicator);
/**
* as to only allow the actual vector
* class to create it.
*/
- VectorReference (const VectorBase &vector,
+ VectorReference (const VectorBase &vector,
const unsigned int index);
public:
* second.
*/
void set (const std::vector<unsigned int> &indices,
- const std::vector<PetscScalar> &values);
+ const std::vector<PetscScalar> &values);
/**
* A collective add operation: This
* components specified by @p indices.
*/
void add (const std::vector<unsigned int> &indices,
- const std::vector<PetscScalar> &values);
+ const std::vector<PetscScalar> &values);
/**
* This is a second collective
*/
void add (const unsigned int n_elements,
const unsigned int *indices,
- const PetscScalar *values);
+ const PetscScalar *values);
/**
* Return the scalar product of two
*/
void do_set_add_operation (const unsigned int n_elements,
const unsigned int *indices,
- const PetscScalar *values,
+ const PetscScalar *values,
const bool add_values);
namespace internal
{
inline
- VectorReference::VectorReference (const VectorBase &vector,
+ VectorReference::VectorReference (const VectorBase &vector,
const unsigned int index)
:
vector (vector),
template <typename number>
SparseMatrix<number>::SparseMatrix (const SparsityPattern &c,
- const IdentityMatrix &id)
+ const IdentityMatrix &id)
:
cols(0, "SparseMatrix"),
val(0),
template <typename number>
SparseMatrix<number> &
-SparseMatrix<number>::operator= (const IdentityMatrix &id)
+SparseMatrix<number>::operator= (const IdentityMatrix &id)
{
Assert (cols->n_rows() == id.m(),
ExcDimensionMismatch (cols->n_rows(), id.m()));
void vmult_on_subrange (const unsigned int begin_row,
const unsigned int end_row,
const number *values,
- const std::size_t *rowstart,
+ const std::size_t *rowstart,
const unsigned int *colnums,
const InVector &src,
OutVector &dst,
number matrix_norm_sqr_on_subrange (const unsigned int begin_row,
const unsigned int end_row,
const number *values,
- const std::size_t *rowstart,
+ const std::size_t *rowstart,
const unsigned int *colnums,
const InVector &v)
{
number matrix_scalar_product_on_subrange (const unsigned int begin_row,
const unsigned int end_row,
const number *values,
- const std::size_t *rowstart,
+ const std::size_t *rowstart,
const unsigned int *colnums,
const InVector &u,
const InVector &v)
number residual_sqr_on_subrange (const unsigned int begin_row,
const unsigned int end_row,
const number *values,
- const std::size_t *rowstart,
+ const std::size_t *rowstart,
const unsigned int *colnums,
const InVector &u,
const InVector &b,
const unsigned int n = src.size();
somenumber *dst_ptr = dst.begin();
const somenumber *src_ptr = src.begin();
- const std::size_t *rowstart_ptr = &cols->rowstart[0];
+ const std::size_t *rowstart_ptr = &cols->rowstart[0];
// optimize the following loop for
// the case that the relaxation
Assert (src.size() == n(), ExcDimensionMismatch (src.size(), n()));
const unsigned int n = src.size();
- const std::size_t *rowstart_ptr = &cols->rowstart[0];
+ const std::size_t *rowstart_ptr = &cols->rowstart[0];
somenumber *dst_ptr = &dst(0);
// case when we have stored the position
* of the given input vector and copy
* the elements.
*/
- BlockVector (const BlockVector &V);
+ BlockVector (const BlockVector &V);
/**
* Creates a block vector
* to those of the given argument and
* copy the elements.
*/
- BlockVector (const BlockVector &V);
+ BlockVector (const BlockVector &V);
/**
* Creates a block vector
* solver control object and
* creates the solver.
*/
- SolverBase (SolverControl &cn);
+ SolverBase (SolverControl &cn);
/**
* Second constructor. This
* solver control object and
* creates the solver.
*/
- SolverDirect (SolverControl &cn,
+ SolverDirect (SolverControl &cn,
const AdditionalData &data = AdditionalData());
/**
struct InnerProd
{
Number
- operator() (const Number *&X, const Number2 *&Y, const Number &) const
+ operator() (const Number *&X, const Number2 *&Y, const Number &) const
{
return *X++ * Number(numbers::NumberTraits<Number2>::conjugate(*Y++));
}