Thank you! It helped me a lot.
(By submesh, I mean the part of mesh on each processor (I use it in
parallel). I need them to assemble constrain matrix for FETI type
method.)
Dne 2016-09-01 16:50, John Peterson napsal:
> On Thu, Sep 1, 2016 at 6:10 AM, Alena Vasatova
> wrote:
>
>> Hi,
>>
>> I
On Thu, Sep 1, 2016 at 6:10 AM, Alena Vasatova
wrote:
> Hi,
>
> I'm using libMesh by extending introduction example 4 (Solving a 2D or
> 3D Poisson Problem in Parallel), is there any easy way how to get nodes
> with Dirichlet boundary condition for each submesh? I thought I can use
> bnd_nodes_be
One way to do this would be to loop over all elements, check if they are on
a boundary ( neighbor NULL ), and then loop over all nodes that belong to
that elem.
You can then ask each node, which side it belongs to and therefore the kind
of boundary condition it has.
For the example you are referi
Hi,
I'm using libMesh by extending introduction example 4 (Solving a 2D or
3D Poisson Problem in Parallel), is there any easy way how to get nodes
with Dirichlet boundary condition for each submesh? I thought I can use
bnd_nodes_begin/end or bid_nodes_begin/end function, but I found out I
can'
