A straightforward 3-point quadrature formula of closed type is derived that improves on Simpson's rule. Just using the additional information of the integrand's derivative at the two endpoints we show the error is sixth order in grid spacing. Various error bounds for the quadrature formula are obtained to quantify more precisely the errors. Applications in numerical integration are given. With these error bounds, which are generally better than the usual Peano bounds, the composite formulas can be applied to integrands with lower order derivatives.
A high-order accurate quadrature rule for the discretization of boundary integral equations (BIEs) on closed smooth contours in the plane is introduced. This quadrature can be viewed as a hybrid of the spectral quadrature of Kress (1991) and the locally corrected trapezoidal quadrature of Kapur and Rokhlin (1997). The new technique combines the strengths of both methods, and attains high-order convergence, numerical stability, ease of implementation, and compatibility with the "fast" algorithms (such as the Fast Multipole Method or Fast Direct Solvers). Important connections between the punctu…
While fast multipole methods (FMMs) are in widespread use for the rapid evaluation of potential fields governed by the Laplace, Helmholtz, Maxwell or Stokes equations, their coupling to high-order quadratures for evaluating layer potentials is still an area of active research. In three dimensions, a number of issues need to be addressed, including the specification of the surface as the union of high-order patches, the incorporation of accurate quadrature rules for integrating singular or weakly singular Green's functions on such patches, and their coupling to the oct-tree data structures on w…
In this paper, we introduce and analyze arbitrarily high-order quadrature rules for evaluating the two-dimensional singular integrals of the forms \begin{align} I_{i,j} = \int_{\mathbb{R}^2}ϕ(x)\frac{x_ix_j}{|x|^{2+α}} \d x, \quad 0< α< 2 \end{align} where $i,j\in\{1,2\}$ and $ϕ\in C_c^N$ for $N\geq 2$. This type of singular integrals and its quadrature rule appear in the numerical discretization of fractional Laplacian in non-local Fokker-Planck Equations in 2D. The quadrature rules are trapezoidal rules equipped with correction weights for points around singularity. We prove the order of con…
We present new higher-order quadratures for a family of boundary integral operators re-derived using the approach introduced in [Kublik, Tanushev, and Tsai - J. Comp. Phys. 247: 279-311, 2013]. In this formulation, a boundary integral over a smooth, closed hypersurface is transformed into an equivalent volume integral defined in a sufficiently thin tubular neighborhood of the surface. The volumetric formulation makes it possible to use the simple trapezoidal rule on uniform Cartesian grids and relieves the need to use parameterization for developing quadrature. Consequently, typical point sing…
The manuscript describes a quadrature rule that is designed for the high order discretization of boundary integral equations (BIEs) using the Nyström method. The technique is designed for surfaces that can naturally be parameterized using a uniform grid on a rectangle, such as deformed tori, or channels with periodic boundary conditions. When a BIE on such a geometry is discretized using the Nyström method based on the Trapezoidal quadrature rule, the resulting scheme tends to converge only slowly, due to the singularity in the kernel function. The key finding of the manuscript is that the con…
We present convergence theory for corrected quadrature rules on uniform Cartesian grids for functions with a point singularity. We begin by deriving an error estimate for the punctured trapezoidal rule, and then derive error expansions. We define the corrected trapezoidal rules, based on the punctured trapezoidal rule, where the weights for the nodes close to the singularity are judiciously corrected based on these expansions. Then we define the composite corrected trapezoidal rules for a larger family of functions using series expansions around the point singularity and applying corrected tra…
The present work is devoted to extension of the trapezoidal rule in the space $W_2^{(2,1)}$. The optimal quadrature formula is obtained by minimizing the error of the formula by coefficients at values of the first derivative of a integrand. Using the discrete analog of the operator $\frac{d^2}{dx^{2}}-1$ the explicit formulas for the coefficients of the optimal quadrature formula are obtained. Furthermore, it is proved that the obtained quadrature formula is exact for any function of the set $\mathbf{F}=\mathrm{span}\{1,x,e^{x},e^{-x}\}$. Finally, in the space $W_2^{(2,1)}$ the square of the n…
The standard design principle for quadrature formulas is that they should be exact for integrands of a given class, such as polynomials of a fixed degree. We show how this principle fails to predict the actual behavior in four cases: Newton-Cotes, Clenshaw-Curtis, Gauss-Legendre, and Gauss-Hermite quadrature. Three further examples are mentioned more briefly.
The present paper is devoted to construction of an optimal quadrature formula for approximation of Fourier integrals in the Hilbert space $W_2^{(1,0)}[a,b]$ of non-periodic, complex valued functions. Here the quadrature sum consists of linear combination of the given function values on uniform grid. The difference between integral and quadrature sum is estimated by the norm of the error functional. The optimal quadrature formula is obtained by minimizing the norm of the error functional with respect to coefficients. In addition, analytic formulas for optimal coefficients are obtained using the…
This paper deals with the construction of an optimal quadrature formula for the approximation of Fourier integrals in the Sobolev space $L_2^{(1)}[a,b]$ of non-periodic, complex valued functions which are square integrable with first order derivative. Here the quadrature sum consists of linear combination of the given function values in a uniform grid. The difference between the integral and the quadrature sum is estimated by the norm of the error functional. The optimal quadrature formula is obtained by minimizing the norm of the error functional with respect to coefficients. Analytic formula…
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 formulas are not stable, limiting the usable order of such formulas. Existing work showed that by the use of orthogonal polynomials, stable high-order quadrature formulas with equidistant points can be developed. We improve upon such work by making use of (orthogonal) Gram polynomials and deriving an iterative algorithm, together allowing us to reduce the space-co…
We revisit the problem of extending quadrature formulas for general weight functions, and provide a generalization of Patterson's method for the constant weight function. The method can be used to compute a nested sequence of quadrature formulas for integration with respect to any continuous probability measure on the real line with finite moments. The advantages of the method include that it works directly with the moments of the underlying distribution, and that for distributions with rational moments the existence of the formulas can be verified by exact rational arithmetic.
The paper studies Sard's problem on construction of optimal quadrature formulas in the space $W_2^{(m,0)}$ by Sobolev's method. This problem consists of two parts: first calculating the norm of the error functional and then finding the minimum of this norm by coefficients of quadrature formulas. Here the norm of the error functional is calculated with the help of the extremal function. Then using the method of Lagrange multipliers the system of linear equations for coefficients of the optimal quadrature formulas in the space $W_2^{(m,0)}$ is obtained, moreover the existence and uniqueness of t…
We prove lower bounds for the worst case error of quadrature formulas that use given sample points $\X_n = \{ x_1, \dots , x_n \}$. We are mainly interested in optimal point sets $\X_n$, but also prove lower bounds that hold with high probability for sets of independently and uniformly distributed points. As a tool, we use a recent result (and extensions thereof) of Vybíral on the positive semi-definiteness of certain matrices related to the product theorem of Schur. The new technique also works for spaces of analytic functions where known methods based on decomposable kernels cannot be applie…
In the present paper, optimal quadrature formulas in the sense of Sard are constructed for numerical integration of the integral $\int_a^be^{2πiωx}φ(x)d x$ with $ω\in \mathbb{R}$ in the Sobolev space $L_2^{(m)}[a,b]$ of complex-valued functions which are square integrable with $m$-th order derivative. Here, using the discrete analogue of the differential operator $\frac{d^{2m}}{d x^{2m}}$, the explicit formulas for optimal coefficients are obtained. The order of convergence of the obtained optimal quadrature formula is $O(h^m)$. As an application, we implement the filtered back-projection (FBP…
On the error bounds of the Gauss-type quadrature formulae associated with spaces of parabolic and cubic spline functions with double equidistant knots
Faculty of Mathematics and Informatics, Sofia University ”St. Kliment Ohridski”（索非亚大学圣克利门特奥赫里斯基数学与信息学院）；Faculty of Pharmacy, Medical University of Sofia（索非亚医科大学药学院）
In this paper we illustrate that paraorthogonality on the unit circle $\mathbb{T}$ is the counterpart to orthogonality on $\mathbb{R}$ when we are interested in the spectral properties. We characterize quasi-paraorthogonal polynomials on the unit circle as the analogues of the quasi-orthogonal polynomials on $\mathbb{R}$. We analyze the possibilities of preselecting some of its zeros, in order to build positive quadrature formulas with prefixed nodes and maximal domain of validity. These quadrature formulas on the unit circle are illustrated numerically.
In this work, we study a global quadrature scheme for analytic functions on compact intervals based on function values on quasi-uniform grids of quadrature nodes. In practice it is not always possible to sample functions at optimal nodes that give well-conditioned and quickly converging interpolatory quadrature rules at the same time. Therefore, we go beyond classical interpolatory quadrature by lowering the degree of the polynomial approximant and by applying auxiliary mapping functions that map the original quadrature nodes to more suitable fake nodes. More precisely, we investigate the comb…
The implementation of the finite element method for linear elliptic equations requires to assemble the stiffness matrix and the load vector. In general, the entries of this matrix-vector system are not known explicitly but need to be approximated by quadrature rules. If the coefficient functions of the differential operator or the forcing term are irregular, then standard quadrature formulas, such as the barycentric quadrature rule, may not be reliable. In this paper we investigate the application of two randomized quadrature formulas to the finite element method for such elliptic boundary val…
In the present paper the optimal quadrature formulas in the sense of Sard are constructed for numerical integration of the integral $\int_a^b e^{2πiωx}φ(x)d x$ with $ω\in \mathbb{R}$ in the Hilbert space $W_2^{(2,1)}[a,b]$ of complex-valued functions. Furthermore, the explicit expressions for coefficients of the constructed optimal quadrature formulas are obtained. At the end of the paper some numerical results are presented.
Optimal error estimates for corrected trapezoidal rules
University of the Fraser Valley（弗雷泽河谷大学）；Department of Mathematical and Statistical Sciences, University of Alberta（阿尔伯塔大学数学与统计科学系）；University of Waterloo（滑铁卢大学）
We consider the computation of the matrix logarithm by using numerical quadrature. The efficiency of numerical quadrature depends on the integrand and the choice of quadrature formula. The Gauss--Legendre quadrature has been conventionally employed; however, the convergence could be slow for ill-conditioned matrices. This effect may stem from the rapid change of the integrand values. To avoid such situations, we focus on the double exponential formula, which has been developed to address integrands with endpoint singularity. In order to utilize the double exponential formula, we must determine…
SinCoTrap: A High-Order Locally Corrected Trapezoidal Rule for Periodic Singular Integrals in Arbitrary Dimensions
School of Mathematical Sciences, Fudan University（复旦大学数学科学学院）；Shanghai Key Laboratory for Contemporary Applied Mathematics, Fudan University and Key Laboratory of Computational Physical Sciences, Ministry of Education（复旦大学现代应用数学上海市重点实验室和教育部计算物理重点实验室）
研究任意维度下周期奇异积分，提出SinCoTrap方法，通过保留均匀张量网格并修改奇点附近权重模板，利用解析延拓导出公式，使该方法在应用中高效且对高阶精度鲁棒，误差率达\(O(h^{2p + 2 + d - s})\)。
An error estimate for the Gauss-Lobatto quadrature formula for integration over the interval $[-1, 1]$, relative to the Jacobi weight function $w^{α,β}(t)=(1-t)^α(1+t)^β$, $α,β>-1$, is obtained. This estimate holds true for functions belonging to some Sobolev-type subspaces of the weighted space $L_{w^{α,β}}^1([-1,1])$.
