Related papers: Several new quadrature formulas for polynomial int…
We present a systematic computational framework for generating positive quadrature rules in multiple dimensions on general geometries. A direct moment-matching formulation that enforces exact integration on polynomial subspaces yields…
Despite extensive research on symmetric polynomial quadrature rules for triangles, as well as approaches to their calculation, few studies have focused on non-polynomial functions, particularly on their integration using symmetric triangle…
Symmetric polynomial quadrature rules for triangles are commonly used to efficiently integrate two-dimensional domains in finite-element-type problems. While the development of such rules focuses on the maximum degree a given number of…
73 new cubature rules are found for three standard multidimensional integrals with spherically symmetric regions and weights, using direct search with a numerical zero-finder. All but four of the new rules have fewer integration points than…
We study cubature formulas for d-dimensional integrals with an arbitrary symmetric weight function of tensor product form. We present a construction that yields a high polynomial exactness: for fixed degree l=5 or l=7 and large dimension,…
We give several descriptions of positive quadrature formulas which are exact for trigonometric -, respectively, Laurent polynomials of degree less or equal $n-1-m$, $0\leq m\leq n-1$. A complete and simple description is obtained with the…
The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many…
This article presents a novel approach to enhance the accuracy of classical quadrature rules by incorporating correction terms. The proposed method is particularly effective when the position of an isolated discontinuity in the function and…
Finding suitable points for multivariate polynomial interpolation and approximation is a challenging task. Yet, despite this challenge, there has been tremendous research dedicated to this singular cause. In this paper, we begin by…
The numerical integration of an analytical function $f(x)$ using a finite set of equidistant points can be performed by quadrature formulas like the Newton-Cotes. Unlike Gaussian quadrature formulas however, higher-order Newton-Cotes…
A method is developed to compute analytically fully symmetric cubature rules on the triangle by using symmetric polynomials to express the two kinds of invariance inherent in these rules. Rules of degree up to 15, some of them new and of…
We present novel fully-symmetric quadrature rules with positive weights and strictly interior nodes of degrees up to 84 on triangles and 40 on tetrahedra. Initial guesses for solving the nonlinear systems of equations needed to derive…
When integrating functions that have poles outside the interval of integration, but are regular otherwise, it is suggested that the quadrature rule in question ought to integrate exactly not only polynomials (if any), but also suitable…
We consider quadrature formulas based on interpolation using the basis functions $1/(1+t_kx)$ $(k=1,2,3,\ldots)$ on $[-1,1]$, where $t_k$ are parameters on the interval $(-1,1)$. We investigate two types of quadratures: quadrature formulas…
Gau{\ss} cubature (multidimensional numerical integration) rules are the natural generalisation of the 1D Gau{\ss} rules. They are optimal in the sense that they exactly integrate polynomials of as high a degree as possible for a particular…
An important question in the theory of approximate integration is to study the conditions on the nodes $x_{k,n}$ and weights $w_{k,n}$ that allow an estimate of the form $$ \sup_{f\in \mathcal{B}_\gamma}|\sum_k…
Neural Networks have been widely used to solve Partial Differential Equations. These methods require to approximate definite integrals using quadrature rules. Here, we illustrate via 1D numerical examples the quadrature problems that may…
Sometimes it is necessary to obtain a numerical integration using only discretised data. In some cases, the data contains singularities which position is known but does not coincide with a discretisation point, and the jumps in the function…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…
A quadrature formula is a formula computing a definite integration by evaluation at finite points. The existence of certain quadrature formulas for orthogonal polynomials is related to interesting problems such as Waring's problem in number…