Dear Prof. Bangerth,
Thank you for your reply.
I would ideally have liked to impose the boundary conditions strongly but
it looks like doing so will not be straight-forward. I will do some
investigations into applying the boundary conditions weakly and attempt
that first.
One approach I had
I could narrow it down to the function
// same as above for has_partitioners_are_compatible == true
template <
typename VectorType,
typename std::enable_if::
value,
VectorType>::type * = nullptr>
inline void
check_vector_compatibility(
const VectorTy
Dear Maxi,
It looks like you are using a scalar finite element (FE_Q), but you
set FEEvaluation to operate on a vectorial field, i.e.,
FEEvaluation phi(data);
Notice the 4th template parameter "dim", which should be one. I agree it
is unfortunate that we do not provide a better error
Hi,
i have question regarding the kdtree class in deal ii, though it has become
a deprecated class, but for my particular problem it might be helpful.
suppose i have a class
template
class A
{
public:
A();
private:
KDTree kdtree;
};
the question is how we can get a get functio
Dear David,
How are you calculating the vorticity?
As Wolfgang and Praveen have mentioned, if you are using the
DataPostProcessor, then this will use your shape functions to calculate the
vorticity. However, your P2-P1 elements are only C0 continuous.
Consequently, your vorticity can possibly be
For approximating the inverse mass matrix I followed step-48 with some
modifications:
In the reinit-subroutine I added
data.initialize_dof_vector(inv_mass_matrix);
FEEvaluation fe_eval(data);
const unsigned int n_q_points = fe_eval.n_q_points;
for (unsign
to be precise
template
class A
{
public:
A(std::vector> &points);
const KDTree & get_kdtree() const;
double doing_something();
private:
KDTree kdtree;
};
and in my implementation i wrote
template
A::A(std::vector> &points)
{
kdtree.set_points(points);
}
template
const
Hello everyone!
This is deal.II newsletter #106.
It automatically reports recently merged features and discussions about the
deal.II finite element library.
## Below you find a list of recently proposed or merged features:
#9318: converts l_2 to LaTeX code (proposed by krishnakumarg1984)
http
> |
> |template
> classA
> {
> public:
> A(std::vector>&points);
> constKDTree&get_kdtree()const;
> doubledoing_something();
>
> private:
> KDTreekdtree;
> };
> |
> |
>
> and in my implementation i wrote
> |
> template
> A::A(std::vector>&points)
> {
> kdtree.set_points(points);
> }
>
Dear Bruno,
Thank you for your suggestions. I am going to take a look at Lethe and compare
with my implementation. In stabilized formulation, I used quadrilateral
element, instead of P2 P1 Taylor-Hood element. The used element is only C0
element. I also did not expect such a discontinuity betwe
Ernesto,
Imposing strong boundary conditions should not be overly difficult in this
case.
Just as Wolgang said you should have a look at
interpolate_boundary_values() and replace the Function object evaluations
on each cell by the function values given through
a FEValues object initialized for you
11 matches
Mail list logo
