A node elimination algorithm for cubature of high-dimensional polytopes
DOI10.1016/j.camwa.2023.06.001arXiv2207.10737OpenAlexW4380764612MaRDI QIDQ6135137
Arkadijs Slobodkins, Johannes Tausch
Publication date: 23 August 2023
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.10737
constrained optimizationmultivariate integrationnumerical cubaturenode eliminationleast-squares Newton method
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Numerical integration (65D30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial interpolation and cubature over polygons
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- The construction of symmetric cubature formulas for the square and the triangle
- Monomial cubature rules since ``Stroud: A compilation
- An encyclopaedia of cubature formulas.
- Numerical approximation of the integral fractional Laplacian
- Monomial cubature rules since ``Stroud: A compilation. II
- Computation of moderate-degree fully-symmetric cubature rules on the triangle using symmetric polynomials and algebraic solving
- Adaptive quadrature rules for Galerkin BEM
- Quadrature for parabolic Galerkin BEM with moving surfaces
- Numerical Integration in Multiple Dimensions with Designed Quadrature
- Compression of Multivariate Discrete Measures and Applications
- High degree efficient symmetrical Gaussian quadrature rules for the triangle
- Introduction to Numerical Continuation Methods
- On the Use of Compressed Polyhedral Quadrature Formulas in Embedded Interface Methods
- Spectra of Multiplication Operators as a Numerical Tool
- Boundary Element Methods
This page was built for publication: A node elimination algorithm for cubature of high-dimensional polytopes
