Yes, if that's the case, it should be possible.

r.

----- Reply message ----- From: "Ondrej Certik" <ond...@certik.cz> To: <sfepy...@googlegroups.com> Subject: tetrahedral refinement Date: Sun, May 1, 2011 18:47

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

-- You received this message because you are subscribed to the Google Groups "sfepy-devel" group. To post to this group, send email to sfepy...@googlegroups.com. To unsubscribe from this group, send email to sfepy-devel...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sfepy-devel?hl=en.