Hi Praveen,
- At this point, the performance depends on the
transform_real_to_unit_cell (which might be slow due to Newton
iterations) and the polynomial evaluation of fe.shape_value and to
some extent the virtual function call of the latter. It depends on
your polynomial space whether this
Hello Martin
> Regarding the performance of your code, there are several fundamental
> problems:
> - You run the constructor of Quadrature (allocates memory) and FEValues
> (allocates lots of memory, evaluates a number of things you don't need) that
> are both not made for use within the
Hello all
I wrote a semi-lagrangian code for advection which requires tracing
characteristics back in time and locating cell where it lies at previous time.
The simplest scheme would be like this
xf = x - a(x,t)*dt
u(x,t+dt) = u(xf, t)
My solution is in FE_Q(2). For each dof (x), I make a
