May 1, 2011
4:47 p.m.
On Sun, May 1, 2011 at 2:23 AM, Robert Cimrman <cimr...@ntc.zcu.cz> wrote:
Yes, sfepy cannot do hanging nodes, so i implemented the uniform refinement.
My understanding of the paper is that the algorithm implements tetrahedral refinement *without* hanging nodes. So in that case, sfepy can do local refinement just fine.
The order p has to be the same in all elements of a field. It can be > 2, but then the quadratures and lagrangian basis limit its usefullness for now.
Right, I see. Thanks for the clarification.
Ondrej