关于一般Guass-Birmoff求积公式的注

本证明了对于关联矩阵E=(E1，Ea)，其中E4满足Polya条件，在其内行不言奇序列，Ea是正则的，—般Neumann-Besself求积公式的存在性。     

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

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

一类求积公式的构造方法

本利用Euler-Maclaurin求和公式构造了一类求积公式,称为修正复合梯形公式。它和复合梯形公式的求积节点及计算量是一样的,但收敛阶有很大的提高,特别适合于计算带有种类型小波的数值积分。     

一类求积公式的构造方法

本文利用 Euler-Maclaurin求和公式构造了一类求积公式 ,称为修正复合梯形公式 .它和复合梯形公式的求积节点及计算量是一样的 ,但收敛阶有很大的提高 ,特别适合于计算带有各种类型小波的数值积分 .     

四面体的六棱求积公式

~~四面体的六棱求积公式@余志$麻城师范高中部!湖北438300     

Cotes数值求积公式的校正

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

带重结点的HTm(θ)型求积公式

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

一类广义Gauss型求积公式

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

关于一些数值求积公式的渐近性

该文给出了一些数值求积公式的渐近性质,这些公式包括求积分的矩形法则、梯形法则和抛物线法则,包含于余项中的中介点的位置当积分区间的长度趋于零时被确定,对应于该法则的校正公式被得到,它们具有较高的代数精度,我们也进行了一些数值试验,得到较满意的数值结果。     

Generalized Gaussian Birkhoff Quadrature Formulas

Existence of a generalized Gaussian Birkhoff quadrature formula is proved for a wide class of incidence matrices which satisfy the delayed Pólya conditions and contain no odd non-Hermitian sequences in the interior rows.     

基于切比雪夫节点的一类带显式系数的广义高斯求积公式(英文)

The goal here is to give a simple approach to a quadrature formula based on the divided diffierences of the integrand at the zeros of the nth Chebyshev polynomial of the first kind,and those of the（n-1）st Chebyshev polynomial of the second kind.Explicit expressions for the corresponding coefficients of the quadrature rule are also found after expansions of the divided diffierences,which was proposed in[14].     

Convergence of Gaussian Quadrature Formulas for Power Orthogonal Polynomials

In classical theorems on the convergence of Gaussian quadrature formulas for power orthogonal polynomials with respect to a weight w on I =（a,b）,a function G ∈ S（w）:= { f:∫_I | f（x）| w（x）d x < ∞} satisfying the conditions G ^2j（x） ≥ 0,x ∈（a,b）,j = 0,1,...,and growing as fast as possible as x → a + and x → b,plays an important role.But to find such a function G is often difficult and complicated.This implies that to prove convergence of Gaussian quadrature formulas,it is enough to find a function G ∈ S（w） with G ≥ 0 satisfying sup n ∑λ0knG（xkn） k=1 n<∞ instead,where the xkn ’s are the zeros of the n th power orthogonal polynomial with respect to the weight w and λ0kn ’s are the corresponding Cotes numbers.Furthermore,some results of the convergence for Gaussian quadrature formulas involving the above condition are given.     

General Gaussian Quadrature Formulas on Chebyshev Nodes

本文给出了基于（第一类及第二类）Ｃｈｅｂｙｓｈｅｖ节点的广义Ｇａｕｓ求积公式的Ｃｏｔｅｓ数的明显公式及其渐进性态．     

Quadrature Formulas Based on the Scaling Function

The scaling function corresponding to the Daubechies wavelet with two vanishing moments is used to derive new quadrature formulas. This scaling function has the smallest support among all orthonormal scaling functions with the properties M ₂ = M ₁ ² and M ₀ = 1. So, in this sense, its choice is optimal. Numerical examples are given.This work was partially supported by DFG grant GR 1777/2, by the Grant No 201/01/1200 of the CSF, by the grant MSMT 113200007 and by the grant IGS 116/5130/1 of FP TUL.     

Product Gaussian Quadrature on Circular Lunes

Resorting to recent results on subperiodic trigonometric quadrature, we provide three product Gaussian quadrature formulas exact on algebraic polynomials of degree $n$ on circular lunes. The first works on any lune, and has $n^2 +\mathcal{O}(n)$ cardinality. The other two have restrictions on the lune angular intervals, but their cardinality is $n^2/2 +\mathcal{O}(n)$.     

Gaussian Quadrature Rules with Simple Node-Weight Relations

In this paper, we consider the symmetric Gaussian and L-Gaussian quadrature rules associated with twin periodic recurrence relations with possible variations in the initial coefficient. We show that the weights of the associated Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 4. We also show that the weights of the associated L-Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 5. Special cases of these quadrature rules are given. Finally, an easy to implement procedure for the evaluation of the nodes is described.     

插值型求积公式的代数精度

借助于勒让德多项式的零点性质,证明了N阶插值型求积公式的代数精度可取N到2 N+1之间的任意整数值,计算得到了两点插值型求积公式的代数精度与求积节点位置的关系.简化了[1]中关于3次代数精度的条件的讨论.