有理插值型求积公式的存在性与收敛性

构造两种奇点预先给定的有理插值型求积公式(RIQFs),在一定条件下证明其存在唯一性和收敛性,结果推广了普通的插值型求积公式和Gauss型求积公式.     

带重结点的H_m~T(θ)型求积公式

本文讨论了2π周期函数的正常积分带重结点的具有最大三角精度m-1的HTm(θ)型求积公式;当结点组取定后,得到了求积公式具体的型,并且构造出HTm(θ)型求积公式.     

Cotes数值求积公式的校正

本文研究了Cotes数值求积公式代数精度的问题,给出了Cotes求积公式余项"中间点"的渐进性定理.利用该定理得到了改进的Cotes求积公式,并证明了改进后的Cotes求积公式比原来的公式具有较高的代数精度.     

一类轴对称平面域上的求积公式

§1 引 言 设二维区域Ω,权函数p(x,y)0,(x,y)∈Ω。寻求以下的求积公式 y≈sum from j=1 to N(c_j(x_j,y_j)), (1.1)使其具有m次代数精度而结点数N为最小,其中c_j为权系数,(x_j,y_j)为结点,j=1,2,…N。我们称具有这种性质的求积公式为具有m次代数精度的最少结点求积公式,简称为最少结点求积公式。 研究各种求积公式中结点数下界,以及构造出各种区域上最少结点求积公式是很有意义的问题。由于求积公式的结点数下界对于固定的代数精度而言,是随积分区域而变化的。因此,只能对各种具体的区域来研究结点数下界的问题。例如和H.Moller     

球域上的某种意义下的最佳求积公式

关于高维球域上的求积公式,美国的Stroud曾利用代数方法构造了“乘积型求积公式”(见[1])。所谓区域R_n上的求积公式为“乘积型公式”,意即它是由n次迭加一维求积公式所产生的公式。这种公式所用结点个数随着维数的增大而迅速增大,所以对于大维数的积分不宜去构造“乘积型求积公式”。本文应用[2]中给出的矩形域、立方域上的最佳边界型求积公式,给出构造球域上求积公式的一种方法。这种方法的优点是对n维球域的求积公式,只须用一个n-1维的边界型求积公式和一个一维求积公式     

基于Thiele型连分式的数值积分

基于Thiele型连分式构造求积公式,这类求积公式能再生由Thiele型连分式前三项渐近式的线性组合所表示的任意有理函数,接着算出求积余项,并推导出分母在给定区间上无零点的充分条件.更进一步,通过等分给定区间,构造相应的复化求积公式,并算出求积余项.研究表明,在若干条件满足的前提下,复化求积公式序列能一致收敛于积分真值,一些数值算例说明了这一点.     

一类高维沙德意义下的最佳求积公式

Schoenberg,I.J.证明了由一元自然样条插值得到的求积公式和沙德意义下最佳求积公式是一致的。后者是指在具有同样代数精度的求积公式中其余项的皮亚诺核最小者。从而样条插值型求积公式是定积分在一定意义下的最佳逼近。李岳生教授提出了一类多元     

关于求积公式序列收敛性的注记

利用Romberg递推求积算法,证明当子区间数目趋于无穷大时,复化求积公式序列一致收敛于积分真值,证明过程与插值型求积公式序列如Gauss型求积公式序列一致收敛不同.     

一类广义Gauss型求积公式

基于被积函数在n次第一类和第二类Chebyshev多项式的零点处的差商,该本构造了两种Gauss型求积公式. 这些求积公式包含了某些已知结果作为特例.更重要的是这些新结果与Gauss-Turan求积公式有密切的联系.     

含Cauchy核奇异积分高精度求积公式

用分离奇异性方法构造了具有高代数精度的含Cauchy核奇异积分的Gauss-Kronrod求积公式,给出了计算求积系数的简洁方法和表达式,导出了求积公式余项表达式.对求积公式在计算机上用Matlab编程进行了数值实验,数值实验结果与理论分析一致.     

An Error Analysis and Convergence of a Quadrature Formula to Invert Laplace Transforms

The use of an expression for the exponential function exp(st)in Bromwich's integral, which incorporates a Padé approximation,yields a well known quadrature formula and its error terms.The error is then analysed for rational, transcendental andnon-rational Laplace transforms respectively and a convergencescheme is presented for rational transforms.     

Quadrature formulas for Bessel polynomials

A quadrature formula is a formula computing a definite integration by evaluation at finite points. The existence of certain quadrature formulas for orthogonal polynomials is related to interesting problems such as Waring’s problem in number theory and spherical designs in algebraic combinatorics. Sawa and Uchida proved the existence and the non-existence of certain rational quadrature formulas for the weight functions of certain classical orthogonal polynomials. Classical orthogonal polynomials belong to the Askey-scheme, which is a hierarchy of hypergeometric orthogonal polynomials. Thus, it is natural to extend the work of Sawa and Uchida to other polynomials in the Askey-scheme. In this article, we extend the work of Sawa and Uchida to the weight function of the Bessel polynomials. In the proofs, we use the Riesz–Shohat theorem and Newton polygons. It is also of number theoretic interest that proofs of some results are reduced to determining the sets of rational points on elliptic curves.     

Orthogonal rational functions and quadrature on the real half line

In this paper we generalize the notion of orthogonal Laurent polynomials to orthogonal rational functions. Orthogonality is considered with respect to a measure on the positive real line. From this, Gauss-type quadrature formulas are derived and multipoint Padé approximants for the Stieltjes transform of the measure. Convergence of both the quadrature formula and the multipoint Padé approximants is discussed.     

Chebyshev series method for computing weighted quadrature formulas

In this paper we study convergence and computation of interpolatory quadrature formulas with respect to a wide variety of weight functions. The main goal is to evaluate accurately a definite integral, whose mass is highly concentrated near some points. The numerical implementation of this approach is based on the calculation of Chebyshev series and some integration formulas which are exact for polynomials. In terms of accuracy, the proposed method can be compared with rational Gauss quadrature formula.     

The best quadrature formula based on Hermite information for the class KW~2[a,b]

The best quadrature formula has been found in the following sense:for afunction whose norm of the second derivative is bounded by a given constant and thebest quadrature formula for the approximate evaluation of integration of that function canminimize the worst possible error if the values of the function and its derivative at certainnodes are known.The best interpolation formula used to get the quadrature formula aboveis also found.Moreover,we compare the best quadrature formula with the open compoundcorrected trapezoidal formula by theoretical analysis and stochastic experiments.     

Asymptotics for Stieltjes polynomials,padé-type approximants,and Gauss-Kronrod quadrature

We study the asymptotic properties of Stieltjes polynomials outside the support of the measure as well as the asymptotic behaviour of their zeros. These properties are used to estimate the rate of convergence of sequences of rational functions, whose poles are partially fixed, which approximate Markovtype functions. An estimate for the speed of convergence of the Gauss-Kronrod quadrature formula in the case of analytic functions is also given.     

Two new formulas for the numerical evaluation of the Hilbert Transform

We develop two algorithms for the numerical evaluation of the semi-infinite Hilbert Transform of functions with a given algebraic behaviour at the origin and at infinity. The first algorithm is connected with a Gauss-Jacobi type quadrature formula for unbounded intervals; the second is based on a rational Bernstein-type operator. Error estimates for different classes of functions are shown. Finally numerical examples are given, comparing the rules among themselves.     

The best quadrature formula based on Hermite information for the class <Emphasis Type="Italic">KW</Emphasis><Superscript>2</Superscript> [<Emphasis Type="Italic">a,b</Emphasis>]

The best quadrature formula has been found in the following sense: for a function whose norm of the second derivative is bounded by a given constant and the best quadrature formula for the approximate evaluation of integration of that function can minimize the worst possible error if the values of the function and its derivative at certain nodes are known. The best interpolation formula used to get the quadrature formula above is also found. Moreover, we compare the best quadrature formula with the open compound corrected trapezoidal formula by theoretical analysis and stochastic experiments.     

Quadrature and orthogonal rational functions

Classical interpolatory or Gaussian quadrature formulas are exact on sets of polynomials. The Szegő quadrature formulas are the analogs for quadrature on the complex unit circle. Here the formulas are exact on sets of Laurent polynomials. In this paper we consider generalizations of these ideas, where the (Laurent) polynomials are replaced by rational functions that have prescribed poles. These quadrature formulas are closely related to certain multipoint rational approximants of Cauchy or Riesz–Herglotz transforms of a (positive or general complex) measure. We consider the construction and properties of these approximants and the corresponding quadrature formulas as well as the convergence and rate of convergence.     

An analog to Gaussian quadrature implemented on a specific trigonometric basis

A new quadrature formula implemented on a nonstandard basis of trigonometric functions is constructed. The quadrature is comparable in accuracy to a Gaussian quadrature formula and is used with the same class of functions. However, this quadrature differs greatly from that for periodic functions, which is also based on trigonometric functions.