Related papers: Numerical quadratures for near-singular and near-h…
Highly oscillatory integrals of composite type arise in electronic engineering and their calculations is a challenging problem. In this paper, we propose two Gaussian quadrature rules for computing such integrals. The first one is…
We introduce a new type of quadrature, known as approximate Gaussian quadrature (AGQ) rules using {\epsilon}-quasiorthogonality, for the approximation of integrals of the form \int f(x)d \alpha(x). The measure {\alpha}(\cdot) can be…
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly independent functions on an interval $[a,b]$. A general theory of Chebyshev sets guarantees the existence of rules with a Gaussian property, in…
In this work we develop the Gaussian quadrature rule for weight functions involving fractional powers, exponentials and Bessel functions of the first kind. Besides the computation based on the use of the standard and the modified Chebyshev…
Some Gauss-type quadrature rules over [0, 1], which involve values and/or the derivative of the integrand at 0 and/or 1, are investigated
It is shown that quadrature formulas in many different applications can be derived from rational approximation of the Cauchy transform of a weight function. Since rational approximation is now a routine technology, this provides an easy new…
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…
A quadrature rule of a measure $\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\mu$ for all polynomials up to some fixed degree. In this…
Approximation using Fourier features is a popular technique for scaling kernel methods to large-scale problems, with myriad applications in machine learning and statistics. This method replaces the integral representation of a…
We develop efficient numerical integration methods for computing an integral whose integrand is a product of a smooth function and the Gaussian function with a small standard deviation. Traditional numerical integration methods applied to…
A new type of quadrature is developed. The Gaussian quadrature, for a given measure, finds optimal values of a function's argument (nodes) and the corresponding weights. In contrast, the Lebesgue quadrature developed in this paper, finds…
Gauss quadrature integral approximation is extended to include integrals with a measure consisting of continuous as well as discrete components. That is, we give an approximation for the integral of a function plus its sum over a discrete…
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…
A novel development is given of the theory of Gaussian quadrature, not relying on the theory of orthogonal polynomials. A method is given for computing the nodes and weights that is manifestly independent of choice of basis in the space of…
Gaussian quadrature rules are a classical tool for the numerical approximation of integrals with smooth integrands and positive weight functions. We derive and expicitly list asymptotic expressions for the points and weights of Gaussian…
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…
Approximations to the integral $\int_a^b\int_c^d f(x,y)\,dy\,dx$ are obtained under the assumption that the partial derivatives of the integrand are in an $L^p$ space, for some $1\leq p\leq\infty$. We assume ${\lVert f_{xy}\rVert}_p$ is…
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…
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,…
Iterative methods with certified convergence for the computation of Gauss--Jacobi quadratures are described. The methods do not require a priori estimations of the nodes to guarantee its fourth-order convergence. They are shown to be…