基于连分式与Newton-Padé逼近的数值积分

首先利用Newton-Pade表中部分序列推导出连分式,提出逆差商算法,算出关于高阶导数与高阶差商的连分式插值余项.接着,构造基于此类连分式的有理求积公式与相应的复化求积公式,算出相应的求积余项,研究表明,在一定条件下,求积公式序列一致收敛于积分真值.然后,为保证连分式计算顺利进行,研究连分式分母非0的充分条件.最后,若干数值算例表明,对某些函数采用新提出的复化有理求积公式计算数值积分,所得结果优于采用Simpson公式.     

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

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

类KW2[a,b]基于Hermite信息的最佳求积公式

找到了下述意义下的最佳求积公式: 对于在给定区间上二阶导数的模不超过给定常数的函数, 如果已知它在该区间上的若干点上的函数值和导数值, 则用该求积公式计算它的积分的近似值可以使最大可能的误差达到最小. 也给出了相应的最佳插值方法, 并用它来导出上述最佳求积公式. 同时, 还通过理论分析和随机数值试验把它和开型复合校正梯形公式做了比较.     

一类Gauss-Jacobi数值求积公式的极限性质

讨论了形如∫aa+h(x-a)βf(x)dx的Gauss-Jacobi求积公式,当积分区间长度趋向于零时,确定了求积公式的余项中介点η的渐近性,并给出了校正公式,比原公式提高了两次代数精度.此外,本文的结论包含了文[3]的结果.     

Cotes数值求积公式的校正

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

有理插值中不可达点的研究

通过对一元Thiele型连分式插值和二元Newton-Thiele型混合有理插值中不可达点的分析,给出了一种判断不可达点的方法.而且,对于任意给定的插值条件,通过构造带参数的Thiele型切触插值和二元Newton-Thiele型混合切触有理插值,使得不可达点变成可达点.数值例子也说明了这种方法的有效性.     

Sobolev类带权函数的基于给定信息的最佳求积公式

给出了r阶Sobo lev类KWr[a,b]带权函数的基于给定信息的最佳求积公式和它的误差估计式.这里的给定信息是指:已知函数在给定区间若干点上的函数值和直到r-1阶导数值.对r≤2,得到了最佳求积公式和误差估计式的显式结果.另外还给出了类KW2[a,b]中在节点的导数值为零的函数所组成的子类的相应的最佳求积公式.     

一道赛题的解法及问题之延伸--陕西省大学生高等数学竞赛题系列分析之四

对一道数学竞赛题,介绍欧拉公式解法,并用于求解其它问题;进而联想定积分定义设计出一种新解法,并将赛题引申,推广到复化中矩形求积公式和复化梯形求积公式情形,据此可以设计一些赛题。     

关于Newton—Thiele型二元有理插值的存在性问题

基于均差的牛顿插值多项式可以递归地实现对待插值函数的多项式逼近,而Thiele型插值连分式可以构造给定节点上的有理函数。将两者结合可以得到Newton-Thiele型二元有理插值（NTRI）算法,本文解决了NTRI算法的存在性问题,并有数值例子加以说明。     

数值积分的双侧逼近及应用

通过分析基本数值求积公式的双侧逼近现象,利用加权平均的方法构造出了比原来求积公式至少高二次代数精度新的混合型求积公式,使得积分近似值精度得到大幅度提高,并给出应用它们求数值积分的具体实例.     

Cubature Formula and Interpolation on the Cubic Domain

Several cubature formulas on the cubic domains are derived using the dis-crete Fourier analysis associated with lattice tiling, as developed in [10]. The main results consist of a new derivation of the Gaussian type cubature for the product Cheby-shev weight functions and associated interpolation polynomials on [-1,1]2, as well as new results on [-1,1]3. In particular, compact formulas for the fundamental interpo-lation polynomials are derived, based on n3/4 + (n2) nodes of a cubature formula on [-1,1]3.     

An algebraic cubature formula on curvilinear polygons

We implement in Matlab a Gauss-like cubature formula on bivariate domains whose boundary is a piecewise smooth Jordan curve (curvilinear polygons). The key tools are Green’s integral formula, together with the recent software package Chebfun to approximate the boundary curve close to machine precision by piecewise Chebyshev interpolation. Several tests are presented, including some comparisons of this new routine ChebfunGauss with the recent SplineGauss that approximates the boundary by splines.     

Symbolic-numeric Gaussian cubature rules

It is well known that Gaussian cubature rules are related to multivariate orthogonal polynomials. The cubature rules found in the literature use common zeroes of some linearly independent set of products of basically univariate polynomials. We show how a new family of multivariate orthogonal polynomials, so-called spherical orthogonal polynomials, leads to symbolic-numeric Gaussian cubature rules in a very natural way. They can be used for the integration of multivariate functions that in addition may depend on a vector of parameters and they are exact for multivariate parameterized polynomials. Purely numeric Gaussian cubature rules for the exact integration of multivariate polynomials can also be obtained.We illustrate their use for the symbolic-numeric solution of the partial differential equations satisfied by the Appell function F₂, which arises frequently in various physical and chemical applications. The advantage of a symbolic-numeric formula over a purely numeric one is that one obtains a continuous extension, in terms of the parameters, of the numeric solution. The number of symbolic-numeric nodes in our Gaussian cubature rules is minimal, namely m for the exact integration of a polynomial of homogeneous degree 2m−1.In Section 1 we describe how the symbolic-numeric rules are constructed, in any dimension and for any order. In Sections 2, 3 and 4 we explicit them on different domains and for different weight functions. An illustration of the new formulas is given in Section 5 and we show in Section 6 how numeric cubature rules can be derived for the exact integration of multivariate polynomials. From Section 7 it is clear that there is a connection between our symbolic-numeric cubature rules and numeric cubature formulae with a minimal (or small) number of nodes.     

Optimal cubature formulas for tensor products of certain classes of functions

We study the problem of constructing an optimal formula of approximate integration along a d-dimensional parallelepiped. Our construction utilizes mean values along intersections of the integration domain with n hyperplanes of dimension (d−1), each of which is perpendicular to some coordinate axis. We find an optimal cubature formula of this type for two classes of functions. The first class controls the moduli of continuity with respect to all variables, whereas the second class is the intersection of certain periodic multivariate Sobolev classes. We prove that all node hyperplanes of the optimal formula in each case are perpendicular to a certain coordinate axis and are equally spaced and the weights are equal. For specific moduli of continuity and for sufficiently large n, the formula remains optimal for the first class among cubature formulas with arbitrary positions of hyperplanes.     

Meshless cubature over the disk using thin-plate splines

In some recent papers, the construction of meshless interpolatory cubature formulas using radial basis functions has been studied. In particular, thin-plate splines allow us to conveniently use Green’s formula and give good results on scattered samples of small/moderate size over polygons. Here, we discuss the extension to meshless cubature over the disk and its practical implementation.     

A meshless like method for the approximate solution of integral equations over polygons

In this paper, a numerical scheme based on a Gauss-like cubature formula from Sammariva and Vianello (2007) [1] is introduced for approximate solution of integral equations over a polygonal domain with a piecewise straight lines boundary in R²${\mathbb{R}}^2$. The proposed technique is a meshless like method with sufficient precision, which does not require any discretization of the polygon domain or any preprocessing such as mesh refinement. The error analysis of the method is provided and some numerical experiments are also presented to evaluate the performance of the proposed algorithm.     

Solving multivariable mathematical models by the quadrature and cubature methods

The utilization and generalization of quadrature and cubature approximations for numerical solution of mathematical models of multivariable transport processes involving integral, differential, and integro-differential operators, and for numerical interpolation and extrapolation, are presented. The methodology for determination of the quadrature and cubature weights for composite operators is developed to accommodate for general functional representations. Application of these methods is demonstrated by solving two-dimensional steady-state and one-dimensional transient-state problems. The solutions are compared with exact-analytical solutions to evaluate the performance of these methods. It is demonstrated that the quadrature and cubature approximations are simple and universal; i.e., the same formula is applicable irrespective of the order of accuracy of the numerical approximation, the type of linear operator, and the number of temporal and/or spatial variables. Since the quadrature and cubature methods can produce solutions with sufficient accuracy even when using fewer discrete points, both the programming task and computational effort are reduced considerably. Therefore, the quadrature and cubature methods appear to be very practical in solving the mathematical models of a variety of transport processes. © 1994 John Wiley & Sons, Inc.     

New cubature formulae and hyperinterpolation in three variables

A new algebraic cubature formula of degree 2n+1 for the product Chebyshev measure in the d-cube with ≈n ^d /2 ^d−1 nodes is established. The new formula is then applied to polynomial hyperinterpolation of degree n in three variables, in which coefficients of the product Chebyshev orthonormal basis are computed by a fast algorithm based on the 3-dimensional FFT. Moreover, integration of the hyperinterpolant provides a new Clenshaw-Curtis type cubature formula in the 3-cube. Work supported by the National Science Foundation under Grant DMS-0604056, by the “ex-60%” funds of the Universities of Padova and Verona, and by the INdAM-GNCS.     

Construction of cubature formulae with preassigned nodes§

In this article, a technique for developing cubature rules with preassigned nodes is presented to avoid wasting of information in scientific computation. The corresponding constructive method of the cubature rule is also given. As an application of the rules, a cubature formula on disk, which was derived via the method of reproducing kernel in (Xu, Y., 2000, Constructing cubature formulae by the method of reproducing kernel. Numerische Mathematik, 85, 155–173), is reconstructed by using our technique. When the preassigned nodes are selected as the nodes of a cubature formula of lower degree, an embedded cubature formula can be easily obtained by the presented method. Furthermore, some examples are included in the article.