求解混合三角多项式方程组的直接GBQ方法

许多科学与工程领域,我们经常需要求混合三角多项式方程组的全部解.一般来说,混合三角多项式方程组可以通过变量替换及增加二次多项式转化为多项式方程组,进而利用数值方法进行求解,但这种转化会增大问题的规模从而增加计算量.在本文中,我们不将问题转化,考虑利用直接同伦方法求解,并给出基于GBQ方法构造的初始方程组及同伦定理的证明.数值实验结果表明我们构造的直接同伦方法较已有的直接同伦方法更加有效.     

Birkhoff型三角插值

1 引言 Birkhoff三角插值是近年来比较活跃的一个研究课题,涉及Birkhoff三角插值的研究文献也很多(如G.G.Lorentz~([1]),沈燮昌~([2])等综合性文章).     

Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids

The chromatic polynomial P_G(q) of a loopless graph G is known to be non-zero (with explicitly known sign) on the intervals (−∞,0), (0,1) and (1,32/27]. Analogous theorems hold for the flow polynomial of bridgeless graphs and for the characteristic polynomial of loopless matroids. Here we exhibit all these results as special cases of more general theorems on real zero-free regions of the multivariate Tutte polynomial Z_G(q,v). The proofs are quite simple, and employ deletion–contraction together with parallel and series reduction. In particular, they shed light on the origin of the curious number 32/27.     

连续可导函数类的最优拉格朗日插值

在构造拉格朗日插值算法时,插值结点的选择是十分重要的.给定一个足够光滑的函数,如果结点选择的不好,当插值结点个数趋于无穷时,插值函数不收敛于函数本身.例如龙格现象:对于龙格函数f(x)=1/1+25x^2,如果拉格朗日插值的结点取[-1,1]上的等距结点,那么逼近的误差会随着结点个数增多而趋于无穷大⑴,由此可知插值结点的选择尤为重要.     

High dimensional polynomial interpolation on sparse grids

We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on numerical experiments for d = 10 using up to 652 065 interpolation points. This revised version was published online in June 2006 with corrections to the Cover Date.     

三奇次散乱点多项式自然样条插值

为解决较为复杂的三变量散乱数据插值问题,提出了一种三元多项式自然样条插值方法.在使得对一种带自然边界条件的目标泛函极小的情况下,用Hilbert空间样条函数方法,构造出了插值问题的解,并可表为一个分块三元三奇次多项式.其表示形式简单,且系数可由系数矩阵对称的线性代数方程组确定.     

Inherited Fuzzy Interpolation Based on the Inherited Lower-upper Factorization

In this paper, a new scheme is proposed to find the fuzzy interpolation polynomial. In this case, the nodes are crisp data and the values are fuzzy numbers. In order to obtain the interpolation polynomial, a linear system is solved with crisp coefficients matrix and fuzzy right hand side. Then, the inherited lower-upper (LU) triangular factorization and inherited interpolation are applied to solve this system. The examples illustrate the applicability, simplicity and efficiency of the proposed method.     

A lacunary interpolation algorithm on arbitrary points

Here, the following lacunary interpolation problem is considered: to find the polynomial which together with its second and third derivatives agrees on arbitrary points with the corresponding values of a given function. The representation of the polynomial depends on the solution of a linear algebraic system. The method is constructed on this observation. The error analysis shows that it behaves like the corresponding Lagrange interpolation problem with an equivalent number of conditions. Some applications are shown.     

On a new kind of Birkhoff type trigonometric interpolation

In this paper we introduce a new kind of Birkhoff type interpolation of functions with period 2. We find necessary and sufficient conditions for regularity of this new interpolation problem. Moreover, a closed form expression for the interpolation polynomial is given.This work was supported by China State Major Key Project for Basic Researchers.     

Computational schemes of the Davidon-Fletcher-Powell method in infinite-dimensional space

The disadvantage of the extension of the Davidon-Fletcher-Powell method to infinite-dimensional space is that the information to be stored in the computer increases with the number of iterations. In this paper, a computational scheme is proposed to remove this disadvantage and make the extension method more practicable. The linear operator which determines the direction of one-dimensional search in the method is formulated by integral kernels to derive the scheme. Furthermore, polynomial interpolation methods are proposed to save computer storage. The computational scheme which is presented here and the polynomial interpolation method are successfully applied to an optimal control problem.The authors would like to thank Dr. N. Adachi for valuable discussion. Computations were carried out at the computing centers of Osaka University, Kyoto University, and Tokyo University.     

巴拿赫空间中线性离散时间系统的多项式二分性

本文给出了巴拿赫空间中线性差分方程的两个多项式二分性概念, 使其在相应空间中的范数的增长速度不快于指数型增长. 并用实例阐释了相关概念之间的关系. 借助于指数二分性的研究方法讨论了多项式二分性的特征, 所得结论推广了指数稳定性及指数二分性中的一些已有结果.     

n维散乱数据带自然边界条件多元多项式样条插值

考虑n维散乱数据Hermit-Birkhoff型插值问题,在使给定的目标泛极小的条件下,构造了一种带自然边界条件的多元多项式样条函数插值方法.重点研究了插值问题解的特征,存在唯一性和构造方法,并讨论了收敛性及误差,最后给出了一些数值算例对方法进行验证.     

Interpolation algorithm of Leverrier–Faddev type for polynomial matrices

We investigated an interpolation algorithm for computing outer inverses of a given polynomial matrix, based on the Leverrier–Faddeev method. This algorithm is a continuation of the finite algorithm for computing generalized inverses of a given polynomial matrix, introduced in [11]. Also, a method for estimating the degrees of polynomial matrices arising from the Leverrier–Faddeev algorithm is given as the improvement of the interpolation algorithm. Based on similar idea, we introduced methods for computing rank and index of polynomial matrix. All algorithms are implemented in the symbolic programming language MATHEMATICA , and tested on several different classes of test examples.     

FAST DENSE MATRIX METHOD FOR THE SOLUTION OF INTEGRAL EQUATIONS OF THE SECOND KIND

We present a fast algorithm based on polynomial interpolation to approximate matrices arising from the discretization of second-kind integral equations where the kernel function is either smooth, non-oscillatory and possessing only a finite number of singularities or a product of such function with a highly oscillatory coefficient function. Contrast to wavelet-like approximations, ourapproximation matrix is not sparse. However, the approximation can be construced in O(n) operations and requires O(n) storage, where n is the number of quadrature points used in the discretization. Moreover, the matrix-vector multiplication cost is of order O(nlogn). Thus our scheme is well suitable for conjugate gradient type methods. Our numerical results indicate that the algorithm is very accurate and stable for high degree polynomial interpolation.     

一种广义插值法

本文考虑一种广义插值问题，插值条件为小区间上的积分值，以弥补现有的插值方法在L2空间不再适用的不足，除了多项式插值外，还讨论了两种一次样条插值方法。     

多项式插值与Rolle定理

本文利用多项式插值 ,对微分学和积分学中的一些典型题目 ,给出了统一的处理方法 .这种方法易于模仿 ,有一定的适用性 .     

一类含三角形图的伴随多项式的根

We denote h(G,x) as the adjoint polynomial of graph G. In [5], Ma obtained the interpolation properties of the roots of adjoint polynomial of graphs containing triangles. By the properties, we prove the non-zero root of adjoint polynomial of Dn and Fn are single multiple.     

Small perturbations of polynomial meshes

We show that the property of being a (weakly) admissible mesh for multivariate polynomials is preserved by small perturbations on real and complex Markov compacts. Applications are given to smooth transformations of polynomial meshes and to polynomial interpolation.     

Limit theorems of the theory of discrete periodic splines

It is known from the discrete harmonic analysis that the interpolation problem with equidistant interpolation points has a unique solution. If the right-hand sides in the interpolation problem are fixed, the spline depends on two parameters: the spline order and the number of points located between neighboring interpolation points. We find explicit expressions for the limits of interpolation spllines with respect to each parameter separately and show that both repeated limits exist. We also prove that these repeated limits are equal and their value is an interpolation trigonometric polynomial. Bibliography: 10 titles. Illustrations: 2 figures.     

散乱数据带自然边界条件三元多项式样条插值

为解决4维散乱数据Hermit-Birkhoff型插值问题,在使给定的目标泛极小的条件下,构造了一种带自然边界条件的三元多项式样条函数方法.研究了插值问题解的特征,存在唯一性,收敛性及误差,最后给出了一些数值算例.