<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
Hi Dawid,<br>
thanks for your interest in Dune. It sounds like Dune together<br>
with the extension module dune-multidomaingrid does precisely<br>
what you need. In particular, dune-multidomaingrid does allow<br>
all the partition queries that you require, and you can also<br>
connect to SuperLU for solving.<br>
<br>
There is a short article on dune-multidomaingrid by Steffen Müthing<br>
and Peter Bastian entitled "A Metagrid approach to Subdomain<br>
Modeling". Apparently it is not freely available on the web, but I
am<br>
sure one of the authors will send you a copy (they both read this<br>
list). Meanwhile you may want to check out the general Dune<br>
documentation at <a class="moz-txt-link-freetext" href="http://www.dune-project.org/doc/index.html">http://www.dune-project.org/doc/index.html</a><br>
<br>
Don't hesitate to ask further questions.<br>
<br>
best,<br>
Oliver<br>
<br>
<br>
Am 11.03.2013 16:47, schrieb Dawid Midura:
<blockquote
cite="mid:CAB7B2=oTnJYJKdYh6Ze4ytw_t6OZgpEMuVtb0RpBmVBTXb0gjg@mail.gmail.com"
type="cite">
<div dir="ltr">Hi all,
<div><br>
</div>
<div>I'm currently working on a domain decomposition scheme for
a direct scattering problem and I'm very interested if DUNE's
grid module especially, would aid me in my work. I'm aware of
the multigrid module, however I wasn't able to find
documentation for it thus I'm not sure what capabilities
it possesses and before I look into the code I wanted to make
sure that what I need can be achieved with DUNE with relative
ease. My meshes are conformal, triangular or tetrahedral if in
3D. I'm not particularly interested in
adaptive refinement capability though it is very nice. I need
to be able to traverse all partitions, their triangles and
their vertices. I need to be able to establish a local node
IDs [0, 1, ..., N] and by local I mean with respect to the
partition the node is in. I also need to be able to check
whether a node is interior (belongs to a single parition),
interface (belongs to two or more partitions) or a boundary,
in which case I also need to know which boundary it is on. I'm
aware that DUNE provides a sparse matrix/vector library with
few iterative solvers. Does it provide some form of sparse LU
factorization such as SuperLU or UMFPACK? </div>
<div><br>
</div>
<div>Thanks in advance,</div>
<div>Dawid M.</div>
</div>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<br>
<pre wrap="">_______________________________________________
Dune mailing list
<a class="moz-txt-link-abbreviated" href="mailto:Dune@dune-project.org">Dune@dune-project.org</a>
<a class="moz-txt-link-freetext" href="http://lists.dune-project.org/mailman/listinfo/dune">http://lists.dune-project.org/mailman/listinfo/dune</a>
</pre>
</blockquote>
<br>
</body>
</html>