有向树的几个组合问题

本文计算有n个结点,m个叶子和具有叶路径长度为s的有向树的个数,以及n个结点,结点路径总长度为r的有向树个数。从而,解决了有向树的叶路径总长度,结点路径总长度的计算问题。     

一类新的插值结点

有界单连通区域Ｇ，其边界θＧ＝Г∈（１，α），α〉０。本计算节以广义Ｆａｂｅｒ多项式φｎ（ｚ）的零点为插值结点的Ｌａｇｒａｎｇｅ插值多项式的逼近性质，得到了它对Ａ（Ｇ↑－）中的函数的一致逼近阶和平均逼近阶的估计，并且得到了它对Ｅ＾ｐ（Ｇ）中函数的平均逼近阶的估计，还指出关于平均逼近阶的估计是不可改进的。     

实数轴上Grünwald插值算子的收敛性

考虑了拓展插值结点取值范围后的Gruenwald插值算子在实数轴上的收敛性，证明了将结点范围扩大到全实轴后，即取为Hermite多项式的零点，对任意点x∈(-∞,∞)，有Gn(f，x)→f(x)，n→∞，其中，f(x)为实数轴上任一满足|f(x)|=O(e^x^2/2)的连续函数．     

SOLVABILITY OF FORWARD-BACKWARD SDES AND THE NODAL SET OF HAMILTON-JACOBI-BELLMAN EQUATIONS

The solvability of a class of forward-backward stochastic differential equations (SDEs for short) over an arbitrarily prescribed time duration is studied. The authors design a stochastic relaxed control problem, with both drift and difftusion all being controlled, so that the solvability problem is converted to a problem of finding the nodal set of the viscosity solution to a certain Hamilton-Jacobi-Bellman equation. This method overcomes the fatal difficulty encountered in the traditional contraction mapping approach to the existence theorem of such SDEs.     

组合线性算子

本文给出一种构造组合线性逼近算子的方法，由此可得到具有特殊逼近性质的线性算子．     

关于矩阵切触有理插值

1 矩阵切触插值连分式 设实区间[a,b]中由不同点组成的插值结点为x_1,x_2,…,x_n,它们的重数分别为a_1,a_2,… ,a_n,M=sum from i=l to n(a_i-1),与之对应的待插值矩阵集为 {A_i~(k):k=0,1,…,a_i-1,i=1,2,…,n,A_i~(k)=A~(k)(x_i)∈R~(d×d)}. 设方阵A=(a_(ij)),它的广义矩阵逆定义为 A~(-1)= A/‖A‖~2 (A≠0) (1.1)     

|x|在调整的第三类Chebyshev结点的有理逼近问题研究CSCD

1引言非光滑函数|x|在逼近论中起着非常重要的作用.Bernstein[1]在1913年,最先用n次代数多项式逼近|x|,得到确切的逼近阶为E(|x|)=O(1/n).Newman[2]在1964年发现R(|x|)远远优于其多项式的最佳逼近E(|x|).     

第三型伯恩斯坦插值过程的双结点修正

In this work,the well-known problem put forward by S N Bernstein in 1930 is studied in a deep step.An operator is constructed by revising double interpolation nodes.It is proved that the operator converges to arbitrary continuous functions uniformly and the convergence order is the best.     

A Kind of Generalization of the Curve Type Node Configuration in R^S（S 〉 2）

A kind of generalization of the Curve Type Node Configuration is given in this paper,and it is called the generalized node configuration CTNCB in RS(S＞2).The related multivariate polynomial interpolation problem is discussed.It is proved that the CTNCB is an appropriate node configuration for the polynomial space PSn (S＞2).And the expressions of the multivariate Vandermonde determinants that are related to the Odd Curve Type Node Configuration in R2 are also obtained.