An efficient method to integrate polynomials over polytopes and curved solids
From MaRDI portal
Publication:2005155
DOI10.1016/J.CAGD.2020.101914zbMATH Open1450.65027OpenAlexW3043834975MaRDI QIDQ2005155FDOQ2005155
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
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
- The extended/generalized finite element method: An overview of the method and its applications
- A finite element method for crack growth without remeshing
- Title not available (Why is that?)
- Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
- On calculating with B-splines
- High degree efficient symmetrical Gaussian quadrature rules for the triangle
- The mimetic finite difference method for elliptic problems
- BASIC PRINCIPLES OF VIRTUAL ELEMENT METHODS
- The Numerical Evaluation of B-Splines
- Quadrature schemes for arbitrary convex/concave volumes and integration of weak form in enriched partition of unity methods
- 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
- Strong and weak arbitrary discontinuities in spectral finite elements
- Geometric integration over irregular domains with application to level-set methods
- An accurate, robust, and easy-to-implement method for integration over arbitrary polyhedra: application to embedded interface methods
- On the flexibility of agglomeration based physical space discontinuous Galerkin discretizations
- Integration on a convex polytope
- Pythagorean-hodograph curves. Algebra and geometry inseparable
- Fast numerical integration on polytopic meshes with applications to discontinuous Galerkin finite element methods
- The octant of a sphere as a non-degenerate triangular Bézier patch
- Title not available (Why is that?)
- \(hp\)-version discontinuous Galerkin methods on polygonal and polyhedral meshes
- Integration and homogeneous functions
- Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
- Extended virtual element method for the Laplace problem with singularities and discontinuities
- A high-order discontinuous Galerkin method for level set problems on polygonal meshes
Cited In (20)
- 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
- Quadrature-free polytopic discontinuous Galerkin methods for transport problems
- An adaptive numerical integration algorithm for polygons
- First Moments of a Polyhedron Clipped by a Paraboloid
- Numerical integration of polynomials and discontinuous functions on irregular convex polygons and polyhedrons
- Robust numerical integration on curved polyhedra based on folded decompositions
- 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
- Adaptive quadrature/cubature rule: application to polytopes
- Boundary integration of polynomials over an arbitrary linear hexahedron in Euclidean three-dimensional space
- An accurate, robust, and easy-to-implement method for integration over arbitrary polyhedra: application to embedded interface methods
- 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
- Title not available (Why is that?)
Uses Software
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)
