Hi, all: As stated in the title, what I mean is actually that whether the values at subdivision points on the small patches built are computed exactly from the finite element shape functions. I have read the documentation about build_patches, but it seems to be not explained clearly about the way it gets its values at subdivision points.
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. But if the values at subdivision points are not computed according the shape functions, but by some other interpolation schemes, it might be a different story. Could anyone please tell me how the values at those subdivision points are achieved? Thanks for any help. Best regards, David. -- 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.
