Related papers: Numerical Integration in Multiple Dimensions with …
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…
We present several new quadrature formulas in the triangle for exact integration of polynomials. The points were computed numerically with a cardinal function algorithm which imposes that the number of quadrature points $N$ be equal to the…
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…
Finite element methods usually construct basis functions and quadrature rules for multidimensional domains via tensor products of one-dimensional counterparts. While straightforward, this approach results in integration spaces larger than…
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…
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…
In this paper, we develop a quadrature framework for large-scale kernel machines via a numerical integration representation. Considering that the integration domain and measure of typical kernels, e.g., Gaussian kernels, arc-cosine kernels,…
In this note, we study a concatenation of quasi-Monte Carlo and plain Monte Carlo rules for high-dimensional numerical integration in weighted function spaces. In particular, we consider approximating the integral of periodic functions…
Let $d$ and $k$ be positive integers. Let $\mu$ be a positive Borel measure on $\mathbb{R}^2$ possessing finite moments up to degree $2d-1$. If the support of $\mu$ is contained in an algebraic curve of degree $k$, then we show that there…
A method of deriving quadrature rules has been developed which gives nodes and weights for a Gaussian-type rule which integrates functions of the form: f(x,y,t) = a(x,y,t)/((x-t)^2+y^2) + b(x,y,t)/([(x-t)^2+y^2]^{1/2}) +…
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…
Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…
We present a numerical framework for computing nested quadrature rules for various weight functions. The well-known Kronrod method extends the Gauss-Legendre quadrature by adding new optimal nodes to the existing Gauss nodes for integration…
Many applications require multi-dimensional numerical integration, often in the form of a cubature formula. These cubature formulas are desired to be positive and exact for certain finite-dimensional function spaces (and weight functions).…
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…
We propose the use of machine learning techniques to find optimal quadrature rules for the construction of stiffness and mass matrices in isogeometric analysis (IGA). We initially consider 1D spline spaces of arbitrary degree spanned over…
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to…
Calabro et al. (2017) changed the paradigm of the mass and stiffness computation from the traditional element-wise assembly to a row-wise concept, showing that the latter one offers integration that may be orders of magnitude faster.…
We present a high-order method that provides numerical integration on volumes, surfaces, and lines defined implicitly by two smooth intersecting level sets. To approximate the integrals, the method maps quadrature rules defined on…
We study the effects of numerical quadrature rules on error convergence rates when solving Maxwell-type variational problems via the curl-conforming or edge finite element method. A complete {\em a priori} error analysis for the case of…