相关论文: A corrected quadrature formula and applications
Simple proofs of the midpoint, trapezoidal and Simpson's rules are proved for numerical integration on a compact interval. The integrand is assumed to be twice continuously differentiable for the midpoint and trapezoidal rules, and to be…
An optimal 3-point quadrature formula of closed type is derived. Various error inequalities are established. Applications in numerical integration are also given.
By introducing a parameter, we give a unified generalization of some quadrature rules, which not only unify the recent results about error bounds for generalized mid-point, trapezoid and Simpson's rules, but also give some new error bounds…
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…
A class of numerical quadrature rules is derived, with equally-spaced nodes, and unit weights except at a few points at each end of the series, for which "corrections" (not using any further information about the integrand) are added to the…
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…
We present a family of high order trapezoidal rule-based quadratures for a class of singular integrals, where the integrand has a point singularity. The singular part of the integrand is expanded in a Taylor series involving terms of…
An error analysis for some Newton-Cotes quadrature formulae is presented. Peano-like error bounds are obtained. They are generally, but not always, better than the usual Peano bounds.
In order to approximate the integral $I(f)=\int_a^b f(x) dx$, where $f$ is a sufficiently smooth function, models for quadrature rules are developed using a given {\it panel} of $n (n\geq 2)$ equally spaced points. These models arise from…
Quadrature formulas for $\int_a^b f(x) dx$ where derivative terms need only be evaluated at $a$ and $b$ in the composite rule are identified. Error bounds are given when $f:[a,b]\to\mathbb{R}$ satisfies $f^{(n-1)}$ is absolutely continuous…
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…
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…
This paper describes a trapezoidal quadrature method for the discretization of weakly singular, singular and hypersingular boundary integral operators with complex symmetric quadratic forms. Such integral operators naturally arise when…
Three kinds of effective error bounds of the quadrature formulas with multiple nodes that are generalizations of the well known Micchelli-Rivlin quadrature formula, when the integrand is a function analytic in the regions bounded by…
We study a new simple quadrature rule based on integrating a $C^1$ quadratic spline quasi-interpolant on a bounded interval. We give nodes and weights for uniform and non-uniform partitions. We also give error estimates for smooth functions…
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…
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.…
Results on the error bounds of quadrature methods are well known - most state that if the method has degree N, and the integrand has N derivatives, then the error is order N+1. We prove here a converse: that if the integrand fails to have N…
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…
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…