<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-05603220</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-09T18:19:13+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A non-intrusive mesh partitioning algorithm for conforming Finite Element simulations on fractured domains</title>
            <author role="crp">
              <persName>
                <forename type="first">Florian</forename>
                <surname>Feppon</surname>
              </persName>
              <email type="md5">d91d95d4470e0f04b1a3f7e1aefc2fbb</email>
              <email type="domain">kuleuven.be</email>
              <idno type="idhal" notation="numeric">1197511</idno>
              <idno type="halauthorid" notation="string">1040431-1197511</idno>
              <affiliation ref="#struct-177790"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Noa</forename>
                <surname>Pauwels</surname>
              </persName>
              <idno type="halauthorid">4111741-0</idno>
              <affiliation ref="#struct-177790"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Charles</forename>
                <surname>Dapogny</surname>
              </persName>
              <idno type="halauthorid">33805-0</idno>
              <affiliation ref="#struct-1005052"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Martin</forename>
                <surname>Averseng</surname>
              </persName>
              <idno type="halauthorid">1265228-0</idno>
              <affiliation ref="#struct-396"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Florian</forename>
                <surname>Feppon</surname>
              </persName>
              <email type="md5">152f1d55cf551d72f568756ef0e65af5</email>
              <email type="domain">gmail.com</email>
            </editor>
            <funder ref="#projanr-153186"/>
            <funder ref="#projanr-72296"/>
            <funder>VSC (Flemish Supercomputer Center), funded by the Research Foundation Flanders (FWO) and the Flemish Government</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2026-04-27 09:15:04</date>
              <date type="whenModified">2026-04-29 03:14:29</date>
              <date type="whenReleased">2026-04-27 17:01:57</date>
              <date type="whenProduced">2026-04-27</date>
              <date type="whenEndEmbargoed">2026-04-27</date>
              <ref type="file" target="https://hal.science/hal-05603220v1/document">
                <date notBefore="2026-04-27"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-05603220v1/file/fractured_mesh_partitioning.pdf" id="file-5603220-4801441">
                <date notBefore="2026-04-27"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="588195">
                <persName>
                  <forename>Florian</forename>
                  <surname>Feppon</surname>
                </persName>
                <email type="md5">152f1d55cf551d72f568756ef0e65af5</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-05603220</idno>
            <idno type="halUri">https://hal.science/hal-05603220</idno>
            <idno type="halBibtex">feppon:hal-05603220</idno>
            <idno type="halRefHtml">2026</idno>
            <idno type="halRef">2026</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-5603220-4801441"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-ANGERS">Université d'Angers</idno>
            <idno type="stamp" n="LAREMA" corresp="UNIV-ANGERS">Laboratoire Angevin de Recherche en Mathématiques</idno>
            <idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
            <idno type="stamp" n="LJLL" corresp="SORBONNE-UNIVERSITE">Laboratoire Jacques-Louis Lions</idno>
            <idno type="stamp" n="CHL">Centre Henri Lebesgue</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS" corresp="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="UP-SCIENCES">Université Paris Cité - Faculté des Sciences</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
          </seriesStmt>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A non-intrusive mesh partitioning algorithm for conforming Finite Element simulations on fractured domains</title>
                <author role="crp">
                  <persName>
                    <forename type="first">Florian</forename>
                    <surname>Feppon</surname>
                  </persName>
                  <email type="md5">d91d95d4470e0f04b1a3f7e1aefc2fbb</email>
                  <email type="domain">kuleuven.be</email>
                  <idno type="idhal" notation="numeric">1197511</idno>
                  <idno type="halauthorid" notation="string">1040431-1197511</idno>
                  <affiliation ref="#struct-177790"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Noa</forename>
                    <surname>Pauwels</surname>
                  </persName>
                  <idno type="halauthorid">4111741-0</idno>
                  <affiliation ref="#struct-177790"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Charles</forename>
                    <surname>Dapogny</surname>
                  </persName>
                  <idno type="halauthorid">33805-0</idno>
                  <affiliation ref="#struct-1005052"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Martin</forename>
                    <surname>Averseng</surname>
                  </persName>
                  <idno type="halauthorid">1265228-0</idno>
                  <affiliation ref="#struct-396"/>
                </author>
              </analytic>
              <monogr>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Fractured media</term>
                <term xml:lang="en">Finite Element Method</term>
                <term xml:lang="en">Conforming meshes</term>
                <term xml:lang="en">Domain partitioning</term>
                <term xml:lang="en">Graph partitioning</term>
                <term xml:lang="en">Cannot-link constraints</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-na">Computer Science [cs]/Numerical Analysis [cs.NA]</classCode>
              <classCode scheme="halTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halOldTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halTreeTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>This article introduces a novel strategy for assembling the finite element matrices of boundary value problems posed in arbitrary 2d and 3d fractured domains with existing third-party solvers, used in a non intrusive manner. For numerical accuracy, the fractured geometry is represented by a conforming mesh; the discontinuous nature of the solution raises the need to create copies of the degrees of freedom of the finite element space according to the topology of the fracture: duplication across regular regions, triplication at Y junctions\dots This task is difficult to carry out in a general way which is compatible with the non intrusive use of an external finite element solver, as ``degenerate'' configurations associated to physically coincident, yet topologically disjoint nodes are often incompatible with standard softwares. To overcome this issue, our method leverages a constrained graph partitioning algorithm that constructs a minimal partition of the fractured geometry, into a set of non overlapping ``regular'' subdomains. Standard finite element kernels can operate independently on each region, and the resulting local contributions are glued into a global stiffness matrix thanks to a suitable label mapping attached to the partition. We demonstrate the robustness of the method through several 2d and 3d numerical examples featuring intricate crack patterns and multi-screen geometries. The proposed framework is implemented in the open-source library PyMedit.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="regrouplaboratory" xml:id="struct-177790" status="VALID">
          <orgName>Department of Computer Science [KU Leuven]</orgName>
          <orgName type="acronym">KU-CS</orgName>
          <desc>
            <address>
              <addrLine>Departement Computerwetenschappen Celestijnenlaan 200A B-3001 Leuven</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">https://wms.cs.kuleuven.be/cs/english</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300656" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1005052" status="VALID">
          <idno type="IdRef">099222221</idno>
          <idno type="ISNI">0000000101748385</idno>
          <idno type="RNSR">199712644L</idno>
          <idno type="ROR">https://ror.org/04xmteb38</idno>
          <orgName>Laboratoire Jacques-Louis Lions</orgName>
          <orgName type="acronym">LJLL (UMR_7598)</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Sorbonne-Université, Boîte courrier 187 - 75252 Paris Cedex 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ljll.math.upmc.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7598" active="#struct-441569" type="direct"/>
            <relation name="UMR_7598" active="#struct-557826" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-396" status="VALID">
          <idno type="IdRef">090959531</idno>
          <idno type="ISNI">0000000100733771</idno>
          <idno type="RNSR">200012173L</idno>
          <idno type="ROR">https://ror.org/036j0y719</idno>
          <idno type="Wikidata">Q51780518</idno>
          <orgName>Laboratoire Angevin de Recherche en Mathématiques</orgName>
          <orgName type="acronym">LAREMA</orgName>
          <date type="start">2000-01-01</date>
          <desc>
            <address>
              <addrLine>Université d'Angers, LAREMA - Faculté des Sciences, 2 Boulevard Lavoisier - 49045 Angers CEDEX 01</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://math.univ-angers.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR6093" active="#struct-74911" type="direct"/>
            <relation name="UMR6093" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300656" status="VALID">
          <idno type="ROR">https://ror.org/05f950310</idno>
          <orgName>Catholic University of Leuven = Katholieke Universiteit Leuven</orgName>
          <orgName type="acronym">KU Leuven</orgName>
          <desc>
            <address>
              <addrLine>Oude Markt 13 - bus 5005, 3000 Leuven</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">http://www.kuleuven.be/english/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-557826" status="VALID">
          <idno type="IdRef">236453505</idno>
          <idno type="ISNI">0000 0004 7885 7602</idno>
          <idno type="ROR">https://ror.org/05f82e368</idno>
          <orgName>Université Paris Cité</orgName>
          <orgName type="acronym">UPCité</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>85 boulevard Saint-Germain75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://u-paris.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-74911" status="VALID">
          <idno type="IdRef">026402920</idno>
          <idno type="ISNI">0000000122483363</idno>
          <idno type="ROR">https://ror.org/04yrqp957</idno>
          <orgName>Université d'Angers</orgName>
          <orgName type="acronym">UA</orgName>
          <date type="start">1971-10-25</date>
          <desc>
            <address>
              <addrLine>Université d'Angers - 40 Rue de Rennes, BP 73532 - 49035 Angers CEDEX 01</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-angers.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-153186" status="VALID">
          <idno type="anr">ANR-24-CE40-2216</idno>
          <orgName>STOIQUES</orgName>
          <desc>Optimisation de forme et topologique : Questions importantes et sujets émergents</desc>
          <date type="start">2024</date>
        </org>
        <org type="anrProject" xml:id="projanr-72296" status="VALID">
          <idno type="anr">ANR-22-CE46-0006</idno>
          <orgName>StableProxies</orgName>
          <desc>Traitement numérique stable de la géométrie et calcul haute-performance sur des données géométriques hétérogènes</desc>
          <date type="start">2022</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>