Simpson校正公式误差的精确表示

利用带有积分余项的Taylor公式重新推导了Simpson校正公式,同时给出了其误差的精确表示,而这一结果将优于Simpson校正公式[J]中的误差估计.     

几个数值积分公式的积分型余项

本文给出几个常用的数值积分公式,如梯形公式、校正梯形公式和Simpson公式,以及对应的复合数值积分公式的积分型余项。     

Simpson不等式的改进及其应用

通过一阶导数对Simpson不等式进行了改进,并推导出了相应的数值积分公式和最佳误差限,扩大了Simpson积分公式的适用范围,最后给出了具体的数值应用.     

Ostrowski不等式的改进及其应用

通过对Ostrowski不等式的改进,扩大了Ostrowski积分公式的适用范围,将该积分公式应用于数值积分推广了经典的中点积分公式、梯形积分公式和Simpson积分公式,同时得到相应的最佳误差限,并给出了具体的数值应用.     

关于求解常微分方程的一类预估——校正方法

在[1]中,我们研究了由显式的Adams一Bashforth(A—B)公式与Nystrom公式所组合的方法,以及由隐式的Adams-Moulton(A—M)公式与广义的Milne—Simpson(M—S)公式所组合的方法,获得了具有较大的绝大稳定域的一类方法。在此基础上,本文讨论用由上述组合的显式方法作为预估公式,而将隐式组合的方法作为校正公式,构造出含有双参数的P_KEC_KE方法。对于K=4,5,6,7,8,获得了具有增大的绝大稳定域的一类方法。     

一个椭圆积分的界和Gauss常数的级数表示式(英文)

利用Gauss求积公式和Simpson3/8规则,获得了一个椭圆积分的界.建立了Gauss常数的级数表示式.     

柯特斯校正公式及其误差估计

提出了一类计算定积分的高精度柯特斯校正公式,通过两种方法进行了推导,给出了它的复化公式及其加速公式,并得到了它们的误差估计和收敛阶.数值实验验证了复化柯特斯校正公式及其加速公式的高效性.     

数值积分公式中间点的渐近性质及其应用

主要研究了三类数值积分公式的中间点的渐近性质,得到了更一般性的结果.基于中间点的渐近性质,获得了数值积分的校正公式及其条件误差估计.数值例子显示了校正公式的精度明显高于对应的计算公式.     

双轴柔性铰链单元质量矩阵的闭式解析式

采用有限元法分析柔顺机构的动力学性能时需要建立相应的柔性铰链的单元刚度矩阵和单元质量矩阵.先建立了双轴柔性铰链的数学模型,用数学归纳法推导了高阶余弦函数降阶为一次余弦函数的表达式,并求解了双轴柔性铰链单元质量矩阵的闭式解析式.比较了闭式解析式与其它数值积分如复化梯形公式、复化Simpson公式、Gauss-Legendre公式、Gauss-Chebyshev公式、Romberg积分等的积分精确度,表明采用本方法是非常适用且精确度是最高的.     

二重数值积分公式的高精度对偶公式及其应用

给出了计算二重积分的Simpson公式与两点高斯公式的对偶公式的构造过程,得到与之对应的高精度对偶修正解,提高了二重数值积分公式的计算精度,同时给出了二重积分的一种估值方法.最后,应用于几个典型的数值算例,计算结果表明：对偶修正解比对应的数值积分公式及其对偶公式的解有更高的计算精度和更快的收敛速度.     

关于高维积分优化辛卜生数值算法的余项估值

本文对于高维积分的优化复化辛卜生数值算法的余项给出了新的估值，从而改进了文［3］和文［4]的有关结果。     

On the discretisation error of the weighted Simpson rule

A method of estimating the discretisation error for the weighted Simpson rule is given. The results are used to obtain the convergence rates of a numerical method for solving integral equations with various singular kernel functions.     

Schur-convexity and the Simpson formula

The main objective of this work is to give a necessary and sufficient condition for the function defined as the difference of the Simpson quadrature rule and the arithmetic integral mean to be Schur-convex.     

A variant of Newton’s method based on Simpson’s three-eighths rule for nonlinear equations

We propose a new variant of Newton’s method based on Simpson’s three-eighth rule. It can be shown that the new method is cubically convergent.     

Error inequalities for an optimal quadrature formula

An optimal 3-point quadrature formula of closed type is derived. It is shown that the optimal quadrature formula has a better error bound than the well-known Simpson’s rule. A corrected formula is also considered. Various error inequalities for these formulas are established. Applications in numerical integration are given.     

Gregory type quadrature based on quadratic nodal spline interpolation

Summary. Using a method based on quadratic nodal spline interpolation, we define a quadrature rule with respect to arbitrary nodes, and which in the case of uniformly spaced nodes corresponds to the Gregory rule of order two, i.e. the Lacroix rule, which is an important example of a trapezoidal rule with endpoint corrections. The resulting weights are explicitly calculated, and Peano kernel techniques are then employed to establish error bounds in which the associated error constants are shown to grow at most linearly with respect to the mesh ratio parameter. Specializing these error estimates to the case of uniform nodes, we deduce non-optimal order error constants for the Lacroix rule, which are significantly smaller than those calculated by cruder methods in previous work, and which are shown here to compare favourably with the corresponding error constants for the Simpson rule. Received July 27, 1998/ Revised version received February 22, 1999 / Published online January 27, 2000     

求解时间分布阶扩散方程的两个高阶有限差分格式

基于复化Simpson公式和复化两点Gauss-Legendre公式，构造了两个求解时间分布阶扩散方程的高阶有限差分格式.不同于以往文献中提出的时间一阶或二阶格式，这两种格式在时间方向都具有三阶精度，而在分布阶和空间方向可达到四阶精度.数值结果表明，两种算法都是稳定且收敛的，从而是有效的.两种格式的收敛速率也通过数值实验进行了验证，并且通过和文献中的算法对比可以得出其更为高效,     

A discrete Fourier transform based on Simpson's rule

Fourier analysis plays a vital role in the analysis of continuous‐time signals. In many cases, we are forced to approximate the Fourier coefficients based on a sampling of the time signal. Hence, the need for a discrete transformation into the frequency domain giving rise to the classical discrete Fourier transform. In this paper, we present a transformation that arises naturally if one approximates the Fourier coefficients of a continuous‐time signal numerically using the Simpson quadrature rule. This results in a decomposition of the discrete signal into two sequences of equal length. We show that the periodic discrete time signal can be reconstructed completely from its discrete spectrum using an inverse transform. We also present many properties satisfied by this transform. Copyright © 2012 John Wiley & Sons, Ltd.     

On Gregory- and modified Gregory-type corrections to Newton—Cotes quadrature

Gregory-type formulae associated with the class of composite Newton—Cotes quadrature rules of the closed type are established. Furthermore, it is shown how these formulae can be extended by introducing mixed interpolation functions which contain a polynomial and a trigonometric part. The case of the modified Gregory rules associated with the composite Simpson quadrature rule is worked out in detail. Also the error term is analysed and the obtained rules are numerically tested.     

A nonasymptotic method for singular perturbation problems

In this paper, an approximate method for the numerical integration of singularly perturbed two-point boundary-value problems with a boundary layer on the left end of the underlying interval is presented. The method is distinguished by the following fact: the original second-order differential equation is replaced by an approximate first-order differential equation with a small deviating argument and is solved efficiently by employing the Simpson rule, coupled with the discrete invariant imbedding algorithm. The proposed method is iterative on the deviating argument. Several numerical examples have been solved to demonstrate the applicability of the method.