Loading…

Exact subdomain and embedded interface polynomial integration in finite elements with planar cuts

The implementation of discontinuous functions occurs in many of today’s state-of-the-art partial differential equation solvers. However, in finite element methods, this poses an inherent difficulty: efficient quadrature rules available when integrating functions whose discontinuity falls in the elem...

Full description

Saved in:
Bibliographic Details
Published in:Numerical algorithms 2023-09, Vol.94 (1), p.315-350
Main Authors: Aulisa, Eugenio, Loftin, Jonathon
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c270t-5d88a295c6fcc03e107b9d8280e6bdcdeb08943ad0a383836df9f36d8acfcc843
container_end_page 350
container_issue 1
container_start_page 315
container_title Numerical algorithms
container_volume 94
creator Aulisa, Eugenio
Loftin, Jonathon
description The implementation of discontinuous functions occurs in many of today’s state-of-the-art partial differential equation solvers. However, in finite element methods, this poses an inherent difficulty: efficient quadrature rules available when integrating functions whose discontinuity falls in the element’s interior are for low order degree polynomials, not easily extended to higher order degree polynomials, and cover a restricted set of geometries. Many approaches to this issue have been developed in recent years. Among them, one of the most elegant and versatile is the equivalent polynomial technique. This method replaces the discontinuous function with a polynomial, allowing integration to occur over the entire domain rather than integrating over complex subdomains. Although eliminating the issues involved with discontinuous function integration, the equivalent polynomial tactic introduces its problems. The exact subdomain integration requires a machinery that quickly grows in complexity when increasing the polynomial degree and the geometry dimension, restricting its applicability to lower order degree finite element families. The current work eliminates this issue. We provide algebraic expressions to exactly evaluate the subdomain integral of any degree polynomial on parent finite element shapes cut by a planar interface. These formulas also apply to the exact evaluation of the embedded interface integral. We provide recursive algorithms that avoid overflow in computer arithmetic for standard finite element geometries: triangle, square, cube, tetrahedron, and prism, along with a hypercube of arbitrary dimensions.
doi_str_mv 10.1007/s11075-023-01502-3
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918494481</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918494481</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-5d88a295c6fcc03e107b9d8280e6bdcdeb08943ad0a383836df9f36d8acfcc843</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKt_wFPAczQf-5E9SqkfUPCi55BNZmvKbrYmWbT_3tgVvMnAzDC8zwzzInTN6C2jtL6LjNG6JJQLQllJOREnaMHKmpOGV-Vp7imrCRONPEcXMe4ozRivF0ivv7RJOE6tHQftPNbeYhhasBYsdj5B6LQBvB_7gx8Hp_vjcBt0cqPPPe6cdwkw9DCATxF_uvSO9732OmAzpXiJzjrdR7j6rUv09rB-XT2Rzcvj8-p-QwyvaSKllVLzpjRVZwwVkP9pGyu5pFC11lhoqWwKoS3VQuaobNd0OUttMiALsUQ38959GD8miEntxin4fFLxhsmiKQrJsorPKhPGGAN0ah_coMNBMap-rFSzlSpbqY5WKpEhMUMxi_0Wwt_qf6hvUV94fA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918494481</pqid></control><display><type>article</type><title>Exact subdomain and embedded interface polynomial integration in finite elements with planar cuts</title><source>Springer Link</source><creator>Aulisa, Eugenio ; Loftin, Jonathon</creator><creatorcontrib>Aulisa, Eugenio ; Loftin, Jonathon</creatorcontrib><description>The implementation of discontinuous functions occurs in many of today’s state-of-the-art partial differential equation solvers. However, in finite element methods, this poses an inherent difficulty: efficient quadrature rules available when integrating functions whose discontinuity falls in the element’s interior are for low order degree polynomials, not easily extended to higher order degree polynomials, and cover a restricted set of geometries. Many approaches to this issue have been developed in recent years. Among them, one of the most elegant and versatile is the equivalent polynomial technique. This method replaces the discontinuous function with a polynomial, allowing integration to occur over the entire domain rather than integrating over complex subdomains. Although eliminating the issues involved with discontinuous function integration, the equivalent polynomial tactic introduces its problems. The exact subdomain integration requires a machinery that quickly grows in complexity when increasing the polynomial degree and the geometry dimension, restricting its applicability to lower order degree finite element families. The current work eliminates this issue. We provide algebraic expressions to exactly evaluate the subdomain integral of any degree polynomial on parent finite element shapes cut by a planar interface. These formulas also apply to the exact evaluation of the embedded interface integral. We provide recursive algorithms that avoid overflow in computer arithmetic for standard finite element geometries: triangle, square, cube, tetrahedron, and prism, along with a hypercube of arbitrary dimensions.</description><identifier>ISSN: 1017-1398</identifier><identifier>EISSN: 1572-9265</identifier><identifier>DOI: 10.1007/s11075-023-01502-3</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algebra ; Algorithms ; Automation ; Complexity ; Computer Science ; Discontinuity ; Equivalence ; Finite element method ; Hypercubes ; Mathematical analysis ; Methods ; Numeric Computing ; Numerical Analysis ; Original Paper ; Partial differential equations ; Polynomials ; Quadratures ; Tetrahedra ; Theory of Computation ; Triangles</subject><ispartof>Numerical algorithms, 2023-09, Vol.94 (1), p.315-350</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c270t-5d88a295c6fcc03e107b9d8280e6bdcdeb08943ad0a383836df9f36d8acfcc843</cites><orcidid>0000-0002-1057-2198</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Aulisa, Eugenio</creatorcontrib><creatorcontrib>Loftin, Jonathon</creatorcontrib><title>Exact subdomain and embedded interface polynomial integration in finite elements with planar cuts</title><title>Numerical algorithms</title><addtitle>Numer Algor</addtitle><description>The implementation of discontinuous functions occurs in many of today’s state-of-the-art partial differential equation solvers. However, in finite element methods, this poses an inherent difficulty: efficient quadrature rules available when integrating functions whose discontinuity falls in the element’s interior are for low order degree polynomials, not easily extended to higher order degree polynomials, and cover a restricted set of geometries. Many approaches to this issue have been developed in recent years. Among them, one of the most elegant and versatile is the equivalent polynomial technique. This method replaces the discontinuous function with a polynomial, allowing integration to occur over the entire domain rather than integrating over complex subdomains. Although eliminating the issues involved with discontinuous function integration, the equivalent polynomial tactic introduces its problems. The exact subdomain integration requires a machinery that quickly grows in complexity when increasing the polynomial degree and the geometry dimension, restricting its applicability to lower order degree finite element families. The current work eliminates this issue. We provide algebraic expressions to exactly evaluate the subdomain integral of any degree polynomial on parent finite element shapes cut by a planar interface. These formulas also apply to the exact evaluation of the embedded interface integral. We provide recursive algorithms that avoid overflow in computer arithmetic for standard finite element geometries: triangle, square, cube, tetrahedron, and prism, along with a hypercube of arbitrary dimensions.</description><subject>Algebra</subject><subject>Algorithms</subject><subject>Automation</subject><subject>Complexity</subject><subject>Computer Science</subject><subject>Discontinuity</subject><subject>Equivalence</subject><subject>Finite element method</subject><subject>Hypercubes</subject><subject>Mathematical analysis</subject><subject>Methods</subject><subject>Numeric Computing</subject><subject>Numerical Analysis</subject><subject>Original Paper</subject><subject>Partial differential equations</subject><subject>Polynomials</subject><subject>Quadratures</subject><subject>Tetrahedra</subject><subject>Theory of Computation</subject><subject>Triangles</subject><issn>1017-1398</issn><issn>1572-9265</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWKt_wFPAczQf-5E9SqkfUPCi55BNZmvKbrYmWbT_3tgVvMnAzDC8zwzzInTN6C2jtL6LjNG6JJQLQllJOREnaMHKmpOGV-Vp7imrCRONPEcXMe4ozRivF0ivv7RJOE6tHQftPNbeYhhasBYsdj5B6LQBvB_7gx8Hp_vjcBt0cqPPPe6cdwkw9DCATxF_uvSO9732OmAzpXiJzjrdR7j6rUv09rB-XT2Rzcvj8-p-QwyvaSKllVLzpjRVZwwVkP9pGyu5pFC11lhoqWwKoS3VQuaobNd0OUttMiALsUQ38959GD8miEntxin4fFLxhsmiKQrJsorPKhPGGAN0ah_coMNBMap-rFSzlSpbqY5WKpEhMUMxi_0Wwt_qf6hvUV94fA</recordid><startdate>20230901</startdate><enddate>20230901</enddate><creator>Aulisa, Eugenio</creator><creator>Loftin, Jonathon</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>M7S</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><orcidid>https://orcid.org/0000-0002-1057-2198</orcidid></search><sort><creationdate>20230901</creationdate><title>Exact subdomain and embedded interface polynomial integration in finite elements with planar cuts</title><author>Aulisa, Eugenio ; Loftin, Jonathon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-5d88a295c6fcc03e107b9d8280e6bdcdeb08943ad0a383836df9f36d8acfcc843</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algebra</topic><topic>Algorithms</topic><topic>Automation</topic><topic>Complexity</topic><topic>Computer Science</topic><topic>Discontinuity</topic><topic>Equivalence</topic><topic>Finite element method</topic><topic>Hypercubes</topic><topic>Mathematical analysis</topic><topic>Methods</topic><topic>Numeric Computing</topic><topic>Numerical Analysis</topic><topic>Original Paper</topic><topic>Partial differential equations</topic><topic>Polynomials</topic><topic>Quadratures</topic><topic>Tetrahedra</topic><topic>Theory of Computation</topic><topic>Triangles</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Aulisa, Eugenio</creatorcontrib><creatorcontrib>Loftin, Jonathon</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering collection</collection><jtitle>Numerical algorithms</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Aulisa, Eugenio</au><au>Loftin, Jonathon</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Exact subdomain and embedded interface polynomial integration in finite elements with planar cuts</atitle><jtitle>Numerical algorithms</jtitle><stitle>Numer Algor</stitle><date>2023-09-01</date><risdate>2023</risdate><volume>94</volume><issue>1</issue><spage>315</spage><epage>350</epage><pages>315-350</pages><issn>1017-1398</issn><eissn>1572-9265</eissn><abstract>The implementation of discontinuous functions occurs in many of today’s state-of-the-art partial differential equation solvers. However, in finite element methods, this poses an inherent difficulty: efficient quadrature rules available when integrating functions whose discontinuity falls in the element’s interior are for low order degree polynomials, not easily extended to higher order degree polynomials, and cover a restricted set of geometries. Many approaches to this issue have been developed in recent years. Among them, one of the most elegant and versatile is the equivalent polynomial technique. This method replaces the discontinuous function with a polynomial, allowing integration to occur over the entire domain rather than integrating over complex subdomains. Although eliminating the issues involved with discontinuous function integration, the equivalent polynomial tactic introduces its problems. The exact subdomain integration requires a machinery that quickly grows in complexity when increasing the polynomial degree and the geometry dimension, restricting its applicability to lower order degree finite element families. The current work eliminates this issue. We provide algebraic expressions to exactly evaluate the subdomain integral of any degree polynomial on parent finite element shapes cut by a planar interface. These formulas also apply to the exact evaluation of the embedded interface integral. We provide recursive algorithms that avoid overflow in computer arithmetic for standard finite element geometries: triangle, square, cube, tetrahedron, and prism, along with a hypercube of arbitrary dimensions.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11075-023-01502-3</doi><tpages>36</tpages><orcidid>https://orcid.org/0000-0002-1057-2198</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1017-1398
ispartof Numerical algorithms, 2023-09, Vol.94 (1), p.315-350
issn 1017-1398
1572-9265
language eng
recordid cdi_proquest_journals_2918494481
source Springer Link
subjects Algebra
Algorithms
Automation
Complexity
Computer Science
Discontinuity
Equivalence
Finite element method
Hypercubes
Mathematical analysis
Methods
Numeric Computing
Numerical Analysis
Original Paper
Partial differential equations
Polynomials
Quadratures
Tetrahedra
Theory of Computation
Triangles
title Exact subdomain and embedded interface polynomial integration in finite elements with planar cuts
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T10%3A47%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Exact%20subdomain%20and%20embedded%20interface%20polynomial%20integration%20in%20finite%20elements%20with%20planar%20cuts&rft.jtitle=Numerical%20algorithms&rft.au=Aulisa,%20Eugenio&rft.date=2023-09-01&rft.volume=94&rft.issue=1&rft.spage=315&rft.epage=350&rft.pages=315-350&rft.issn=1017-1398&rft.eissn=1572-9265&rft_id=info:doi/10.1007/s11075-023-01502-3&rft_dat=%3Cproquest_cross%3E2918494481%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c270t-5d88a295c6fcc03e107b9d8280e6bdcdeb08943ad0a383836df9f36d8acfcc843%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2918494481&rft_id=info:pmid/&rfr_iscdi=true