An efficient method to integrate polynomials over polytopes and curved solids

DOI10.1016/J.CAGD.2020.101914MaRDI QIDQ2005155zbMATH OpenOpenAlexFDO

Authors Eric B. Chin, N. Sukumar

Publication date 7 October 2020

Published in Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cagd.2020.101914

zbMATH Keywords

Euler's homogeneous function theoremNURBS surfacespolyhedral mass propertiesBézier triangles

Mathematics Subject Classification ID

Numerical integration (65D30)

Recommendations

• Integration of polynomials over linear polyhedra in Euclidean three-dimensional space
• Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
• Boundary integration over linear polyhedra
• An accurate, robust, and easy-to-implement method for integration over arbitrary polyhedra: application to embedded interface methods
• Boundary integration of polynomials over an arbitrary linear tetrahedron in Euclidean three-dimensional space

Cites work

• scientific article; zbMATH DE number 1153207 (Why is no real title available?)
• scientific article; zbMATH DE number 914800 (Why is no real title available?)
• A finite element method for crack growth without remeshing
• A high-order discontinuous Galerkin method for level set problems on polygonal meshes
• An accurate, robust, and easy-to-implement method for integration over arbitrary polyhedra: application to embedded interface methods
• BASIC PRINCIPLES OF VIRTUAL ELEMENT METHODS
• Extended virtual element method for the Laplace problem with singularities and discontinuities
• Fast numerical integration on polytopic meshes with applications to discontinuous Galerkin finite element methods
• Geometric integration over irregular domains with application to level-set methods
• High degree efficient symmetrical Gaussian quadrature rules for the triangle
• Integration and homogeneous functions
• Integration on a convex polytope
• Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
• Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
• On calculating with B-splines
• On the flexibility of agglomeration based physical space discontinuous Galerkin discretizations
• Pythagorean-hodograph curves. Algebra and geometry inseparable
• Quadrature schemes for arbitrary convex/concave volumes and integration of weak form in enriched partition of unity methods
• Strong and weak arbitrary discontinuities in spectral finite elements
• The Numerical Evaluation of B-Splines
• The extended/generalized finite element method: An overview of the method and its applications
• The finite cell method for three-dimensional problems of solid mechanics
• The finite cell method: a review in the context of higher-order structural analysis of CAD and image-based geometric models
• The mimetic finite difference method for elliptic problems
• The octant of a sphere as a non-degenerate triangular Bézier patch
• \(hp\)-version discontinuous Galerkin methods on polygonal and polyhedral meshes

Cited in

(20)

• scientific article; zbMATH DE number 1737976 (Why is no real title available?)
• Computing integrals over polynomially defined regions and their boundaries in 2 and 3 dimensions
• Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
• An adaptive numerical integration algorithm for polygons
• Quadrature-free polytopic discontinuous Galerkin methods for transport problems
• Numerical integration of polynomials and discontinuous functions on irregular convex polygons and polyhedrons
• Robust numerical integration on curved polyhedra based on folded decompositions
• First Moments of a Polyhedron Clipped by a Paraboloid
• Algorithms for integrals of holonomic functions over domains defined by polynomial inequalities
• Virtual elements on agglomerated finite elements to increase the critical time step in elastodynamic simulations
• Algorithm and Software for Integration over a Convex Polyhedron
• Point collocation with mollified piecewise polynomial approximants for high-order partial differential equations
• Tangled finite element method for handling concave elements in quadrilateral meshes
• An accurate, robust, and easy-to-implement method for integration over arbitrary polyhedra: application to embedded interface methods
• Boundary integration of polynomials over an arbitrary linear hexahedron in Euclidean three-dimensional space
• Adaptive quadrature/cubature rule: application to polytopes
• Scaled boundary cubature scheme for numerical integration over planar regions with affine and curved boundaries
• Geometrical discretisations for unfitted finite elements on explicit boundary representations
• Exact integrations of polynomials and symmetric quadrature formulas over arbitrary polyhedral grids
• Efficient integration over polytopes

Describes a project that uses

Uses Software

• LattE

This page was built for publication: An efficient method to integrate polynomials over polytopes and curved solids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005155)