And for the record, attached is a corrected version of the MWE illustrating
the correct and intended behaviour of constraint creation for pure
p-refinement.
Number of cells: 2
Number of degrees of freedom: 11
Number of constraints: 1
On Saturday, August 27, 2016 at 9:41:41 AM UTC+2, Jean-Paul
Ha ha. Dammit, what a silly mistake :-) Thanks Wolfgang!
On Friday, August 26, 2016 at 11:08:17 PM UTC+2, Wolfgang Bangerth wrote:
>
> On 08/25/2016 02:34 AM, Jean-Paul Pelteret wrote:
> > Hi Deepak,
> >
> > Ok, so I've created a minimal working example to demonstrate what you're
> > seeing he
Hi Wolfgang,
Thanks, I figured it out finally. I was assigning a different boundary
indicator on one boundary of the domain. This was executed before the
code reached the part of calculating the hanging constraints. When I
remove that part, the number of constraints shown is non-zero (which is
On 08/26/2016 03:49 PM, Deepak GUpta wrote:
Indeed Wolfgang is right.
Can't help but respond with a smiley ;-)
I'll count that as a win ahead of my weekend!
Cheers
W.
--
Wolfgang Bangerth email:
Indeed Wolfgang is right. With the stated change, the example code of JP
works now. So I need to relate the error in mine.
Thanks Wolfgang and Jean-Paul for the help.
Best
Deepak
On 26-08-16 23:08, Wolfgang Bangerth wrote:
On 08/25/2016 02:34 AM, Jean-Paul Pelteret wrote:
Hi Deepak,
Ok, so
On 08/25/2016 02:34 AM, Jean-Paul Pelteret wrote:
Hi Deepak,
Ok, so I've created a minimal working example to demonstrate what you're
seeing here. I'm not sufficiently familiar with the p-refinement part of the
hp functionality/implementation to tell whether this is truly the expected
behaviour
Thanks Jean-Paul for creating the simple example. I ran the code and
indeed see that it does say zero constraints for the chosen example,
although I too do not know much about the hanging support points in
p-refinement.
Best,
Deepak
On 25-08-16 10:34, Jean-Paul Pelteret wrote:
Hi Deepak,
O
Hi Deepak,
Ok, so I've created a minimal working example to demonstrate what you're
seeing here. I'm not sufficiently familiar with the p-refinement part of
the hp functionality/implementation to tell whether this is truly the
expected behaviour or not. I see that the examples and description
Dear Daniel and others,
Below is the part of my code that might explain better:
*//Below is the constructor for FEM class (a part of my own library).
The part of the code below in BOLD states that I assign different order
shape functions alternatively.*
template
FEM::FEM(
Triangulatio
Deepak,
I am aware of the fact that ConstraintMatrix.n_constraints() gives the
> number of hanging nodes for h-refinement, but if I only use p-refinement,
> can it give the number of hanging support points occurring due to the
> difference in the order of bases between two adjacent elements? I
Dear All,
I am aware of the fact that ConstraintMatrix.n_constraints() gives the
number of hanging nodes for h-refinement, but if I only use p-refinement,
can it give the number of hanging support points occurring due to the
difference in the order of bases between two adjacent elements? I am
Dear All,
Thanks for your replies. Indeed I had thought of the same as suggested by
Jean and am implementing it. Thanks for helping out.
Best regards
Deepak
On Friday, July 15, 2016 at 2:02:43 PM UTC+2, Deepak Gupta wrote:
>
> Dear All,
>
> I am currently dealing with hanging support points in
> This was what I initially thought Deepak wanted, but he's doing
> p-refinement, so these aren't actually hanging nodes that he's querying.
Ah, IC.
--
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
-
Hi Matthias,
This was what I initially thought Deepak wanted, but he's doing
p-refinement, so these aren't actually hanging nodes that he's querying.
J-P
On Tuesday, July 19, 2016 at 9:52:44 AM UTC+2, Matthias Maier wrote:
>
>
> On Tue, Jul 19, 2016, at 02:33 CDT, Jean-Paul Pelteret <> wrote:
On Tue, Jul 19, 2016, at 02:33 CDT, Jean-Paul Pelteret
wrote:
> Dear Deepak,
>
> To the best of my knowledge, such functionality is not available in the
> library because, well, its not the normal type of information that one
> would be interested in. So you'll have to write the functionality
Dear Deepak,
To the best of my knowledge, such functionality is not available in the
library because, well, its not the normal type of information that one
would be interested in. So you'll have to write the functionality yourself.
What have you tried so far? How I would do it is by computing
16 matches
Mail list logo
