亚纯函数微分多项式f~kQ[f]+P[f]的零点分布

文[4]对简单形式的微分多项式fkf’+a的零点分布进行了讨论,文[1]对一般形式的微分多项式fkQ[f]+P[f]的零点分布进行了讨论.但由于极点给证明带来的困难,这些工作主要是对整函数来做的.本文证明了任一满足δ(∞,f)>k+2ΓQ+3ΓP+2/2k+2ΓQ+1的超越亚纯函数f,微分多项式fkQ[f]+P[f]在不含f,Q[f]极点和P[f]零、极点的可数个圆盘并集之外有无穷多个零点,其中k≥3Γp+2,而ΓQ,ΓP分别是f的微分多项式Q[f],P[f]的权.文[1]和[2,4,6]中的结论是本文结论的特殊情况.     

椭圆型方程的广义差分法（二次元）

在文[1]中,李荣华综合了有限元法和差分法的优点,提出了广义差分法,它既保持了差分法的计算简单性,文具有有限元法的精确性,文[2]把广义差分法推广到平面域上二阶椭圆偏微分方程的边值问题,在试探函数空间为分片一次元,检验函数空间为分片常数的情形下得到与线性有限元相同的收敛阶,本文以Poisson方程为模型,取试探函数为分片二次元,检验函数为分片常数,导出了一种二次元的广义差分法,给出最佳收敛阶估计,并做出数值实验。     

代数体函数的唯一性定理

本文讨论了代数体函数的唯一性问题,改进了何育赞在文[1]、[2]、[3]中的有关结果.     

带第三类边界条件的椭圆型方程的广义Galerkin方法

§1 引言 文[1]和[2]讨论了带第一类边界条件的二阶椭圆型方程的广义差分法(即广义Galerkin方法)。本文主要讨论带第二、三类边界条件的二阶椭圆型方程的广义Galerkin方法,就试探函数空间为分片线性函数,检验函数空间为分片常数的情形,对三角部分证明了广义Galerkin解的存在唯一性,并得到了收敛阶的估计。     

整数规划的广义填充函数算法

文[9,10]设计了直接求整数规划问题近似解的填充函数算法,但其所利用的文[2,3]的填充函数均带有参数,需要在算法过程中逐步调节。本文建立整数规划的广义填充函数的定义,说明了文[9,10]所利用的填充函数是整数规划问题的广义填充函数,并构造了一类不带参数的广义填充函数。进而本文设计了整数规划的一类不带参数的广义填充函数算法,数值试验表明算法是有效的。     

抛物方程的一种广义差分法(有限体积法)

广义差分法自1982年被提出,至今已获得很大发展（见[1]或[10],这种方法在国际上被称为有限体积（元）法（见[8],[9]）,它的主要优点是保持物理量的局部守恒性.文[3],[5]分别将三角形网格上的椭圆型方程的广义差分法（有限体积法）（见[2],[4]）推广到抛物型方程.我们知道三角形网格与四边形网格是两种基本的分割空间区域的方法,实践上使用哪一种网格,要根据空间区域的几何形状而定.文[7],[6]讨论了一般四边形网上椭圆型方程的广义差分法.本文以抛物方程为模型,取试探函数空间为一般四边形剖分上的等参双线性元,检验函数空间为对偶剖分上的分片常数,导出了一种新的有效的广义差分算法（有限体积算法）,证明了半离散与全离散格式的最佳H1误差估计.遇到的主要困难是双线性形式a（uh,Πh＊uh）     

关于整函数及其微分多项式的唯一性

本文讨论关于整函数及其微分式项式的唯一性，所得定理推广文[1],[[2]的一些结论。     

一类整函数的亏函数

1964年,庄圻泰教授在整函数的情况彻底解决了R.Nevanlinna提出的关于第二基本定理的推广问题,从而为亏函数的研究开创了道路。在文[2]中,我们用庄圻泰引进的Wronskin行列式作为工具解决了F.Nevanlinna猜想的广泛形式。本文继续用这一工具从推广文[3]中定理2出发,继而给出了一类整函数的亏函数个数。最后对庄圻泰提出的一个问题给出了肯定的回答。     

一类迭代函数方程的连续解

本文用Schauder和Banach不动点定理讨论了一类非多项式形式的迭代函数方程的连续解的存在性唯一性与稳定性,其结果推广了文[1]工作．     

再谈配方法求一类二元函数的最值

文[1]、文[2]运用配方法求形如g（x，y）=ax^2＋bxy＋cy^2＋dx＋ey＋f的二元函数最值，配方成两个一次式的平方和加上一个常数的形式，美中不足的是，文[1]、文[2]所举范例配方中的两个一次式均出现了分式或分数，这就加大了配凑系数的难度，不够自然流畅．     

Steklov特征值问题的一种有效的Legendre-Galerkin谱逼近

本文给出Steklov特征值问题基于Legendre-Galerkin逼近的一种有效的谱方法.首先利用Legendre多项式构造了一组适当的基函数使得离散变分形式中的矩阵是稀疏的,然后推导了2维及3维情形下离散变分形式基于张量积的矩阵形式,由此可以快速地计算出离散的特征值和特征向量.文章还给出了误差分析和数值试验,数值结果表明本文提出的方法是稳定和有效的.     

A weak condition for the convexity of tensor-product Bézier and B-spline surfaces

A sufficient condition for a tensor-product Bézier surface to be convex is presented. The condition does not require that the control surface itself is convex, which is known to be a very restrictive property anyway. The convexity condition is generalised toC ¹ tensor-product B-spline surfaces.     

MULTIVARIATE FOURIER SERIES OVER A CLASS OF NON TENSOR－PRODUCT PARTITION DOMAINS

This paper finds a way to extend the well-known Fourier methods,to so-called n 1 directions partition domains in n-dimension.In particular,in 2-D and 3-D cases,we study Fourier methods over 3-direction parallel hexagon partitions and 4-direction parallel paralleogram dodecahedron partitions,respectively.It has pointed that,the most concepts and results of Fourier methods on tensor-product case,such as periodicity,orthogonality of Fourier basis system,Partial sum of Fourier series and its approximation behavior,can be moved on the new non tensor-product partiton case.     

Tensor-product monotonicity preservation

This paper studies systems of tensor-product functions for which the functions they span are monotonic in any direction when their control nets are monotonic in that direction. It is shown that Bernstein polynomials and B-splines have this property but that totally positive systems in general, such as certain trigonometric and rational bases, do not. This revised version was published online in August 2006 with corrections to the Cover Date.     

近似可展曲面的构造及应用

1引言经典微分几何中Gauss曲率为零的曲面称为可展曲面,它是一种特殊的直纹面．可展曲面有且只有三种,即锥面、柱面和切线面,它对于自由曲面造型具有重要的意义．例如,如果物体外壳是可展曲面,那么它可以没有形变地展开到平面上,从而可以用平板材料无形变地设计出来．这一性质对于造船业、航空业中的外形设计具有重要的意义．关于可展曲面的微分几何性质,可以在任何一本微分几何教材中找到,例如[3]．可展曲面可以说是微分几何中比较简单的一类曲面,但是在计算机辅助几何设计(CAGD)和计算机图形学中至今还不存在简单有效的设计方法．在[1,2,5]以及它们的参考文献中     

Efficient space-time adaptivity for parabolic evolution equations using wavelets in time and finite elements in space

Considering the space-time adaptive method for parabolic evolution equations we introduced in Stevenson et al., this work discusses an implementation of the method in which every step is of linear complexity. Exploiting the tensor-product structure of the space-time cylinder, the method allows for a family of trial spaces given as spans of wavelets-in-time tensorized with finite element spaces-in-space. On spaces whose bases are indexed by double-trees, we derive an algorithm that applies the resulting bilinear forms in linear complexity. We provide extensive numerical experiments to demonstrate the linear runtime of the resulting adaptive loop.     

Spherical polyharmonics and Poisson kernels for polyharmonic functions

We introduce and develop the notion of spherical polyharmonics, which are a natural generalisation of spherical harmonics. In particular we study the theory of zonal polyharmonics, which allows us, analogously to zonal harmonics, to construct Poisson kernels for polyharmonic functions on the union of rotated balls. We find the representation of Poisson kernels and zonal polyharmonics in terms of the Gegenbauer polynomials. We show the connection between the classical Poisson kernel for harmonic functions on the ball, Poisson kernels for polyharmonic functions on the union of rotated balls, and the Cauchy-Hua kernel for holomorphic functions on the Lie ball.     

A method to calculate the distribution function when the characteristic function is known

A formula for numerical inversion of characteristic functions based on the Poisson formula is presented, and a numerical example is also given.     

On the uniqueness of solutions to the Poisson equations for average cost Markov chains with unbounded cost functions

We consider the Poisson equations for denumerable Markov chains with unbounded cost functions. Solutions to the Poisson equations exist in the Banach space of bounded real-valued functions with respect to a weighted supremum norm such that the Markov chain is geometrically ergodic. Under minor additional assumptions the solution is also unique. We give a novel probabilistic proof of this fact using relations between ergodicity and recurrence. The expressions involved in the Poisson equations have many solutions in general. However, the solution that has a finite norm with respect to the weighted supremum norm is the unique solution to the Poisson equations. We illustrate how to determine this solution by considering three queueing examples: a multi-server queue, two independent single server queues, and a priority queue with dependence between the queues.     

Nodal Bases for the Serendipity Family of Finite Elements

Using the notion of multivariate lower set interpolation, we construct nodal basis functions for the serendipity family of finite elements, of any order and any dimension. For the purpose of computation, we also show how to express these functions as linear combinations of tensor-product polynomials.