David,
So I have some confusions about this:Say, if the values at subdivison points
are computed exactly according finite element shape functions. then for
high order finite elements, I can build more patches than the finite element
order, and also the more patches I build, the closer of visualization to
my originally computed solution (ignore the memory consumption at this point).
The difference would be confined within very small linear subdivision patches.
Disregard the memory consumption, I can even recover my solution in the
visualization as closely as I want as long as I build enough subdivision
patches.
Correct. This is exactly what happens -- we evaluate the shape functions
exactly at these subdivision points, and your visualization program then
displays a piecewise (bi-)linear interpolation of the real higher polynomial
degree solution on a finer mesh.
Best
W.
--
------------------------------------------------------------------------
Wolfgang Bangerth email: [email protected]
www: http://www.math.tamu.edu/~bangerth/
--
The deal.II project is located at http://www.dealii.org/
For mailing list/forum options, see
https://groups.google.com/d/forum/dealii?hl=en
---
You received this message because you are subscribed to the Google Groups "deal.II User Group" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
