A node elimination algorithm for cubature of high-dimensional polytopes
From MaRDI portal
Abstract: Node elimination is a numerical approach to obtain cubature rules for the approximation of multivariate integrals. Beginning with a known cubature rule, nodes are selected for elimination, and a new, more efficient rule is constructed by iteratively solving the moment equations. This paper introduces a new criterion for selecting which nodes to eliminate that is based on a linearization of the moment equation. In addition, a penalized iterative solver is introduced, that ensures that weights are positive and nodes are inside the integration domain. A strategy for constructing an initial quadrature rule for various polytopes in several space dimensions is described. High efficiency rules are presented for two, three and four dimensional polytopes. The new rules are compared with rules that are obtained by combining tensor products of one dimensional quadrature rules and domain transformations, as well as with known analytically constructed cubature rules.
Recommendations
- Separation, dimension, and facet algorithms for node flow polyhedra
- An adaptive numerical cubature algorithm for simplices
- Robust vertex enumeration for convex hulls in high dimensions
- Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
- Interpolation and cubature for rectangular sets of nodes
- Publication:4721511
- Adjacency method for extreme Delaunay polytopes
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
- Cubature, approximation, and isotropy in the hypercube
- Approximating polyhedra with sparse inequalities
Cites work
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- Adaptive quadrature rules for Galerkin BEM
- An encyclopaedia of cubature formulas.
- Boundary element methods
- Compression of Multivariate Discrete Measures and Applications
- Computation of moderate-degree fully-symmetric cubature rules on the triangle using symmetric polynomials and algebraic solving
- High degree efficient symmetrical Gaussian quadrature rules for the triangle
- scientific article; zbMATH DE number 4070244 (Why is no real title available?)
- scientific article; zbMATH DE number 3510699 (Why is no real title available?)
- scientific article; zbMATH DE number 3591295 (Why is no real title available?)
- scientific article; zbMATH DE number 1069610 (Why is no real title available?)
- Introduction to Numerical Continuation Methods
- Monomial cubature rules since ``Stroud: A compilation
- Monomial cubature rules since ``Stroud: A compilation. II
- Numerical approximation of the integral fractional Laplacian
- Numerical integration in multiple dimensions with designed quadrature
- On the Use of Compressed Polyhedral Quadrature Formulas in Embedded Interface Methods
- Polynomial interpolation and cubature over polygons
- Quadrature for parabolic Galerkin BEM with moving surfaces
- Spectra of Multiplication Operators as a Numerical Tool
- The construction of symmetric cubature formulas for the square and the triangle
Cited in
(4)
This page was built for publication: A node elimination algorithm for cubature of high-dimensional polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135137)
