Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

四阶非线性边值问题解的存在性与上下解方法

该文讨论四阶常微分方程边值问题u^(4)(t)=f(t,u,u″), t∈［0,1］,u(0)=u(1)=u″(0)=u″(1)=0解的存在性, 其中f(t,u,v):［0,1］×R×R→R为Carathéodory函数. 在不限制f关于u,v的增长阶, 不假定f关于u,v的单调性的一般情形下, 用上下解方法获得了解的存在性结果,并讨论了单调迭代求解的有效性.     

具P-Laplacian算子型周期边值问题解的存在性

本文利用拓扑度理论和一些分析技巧讨论了具p—Laplacian算子型周期边值问题(φp(χ’))’+d/dt gradF(χ)+gradG(χ)=e(t),χ(0)=χ(T),χ’(0)=χ’(T)解的存在性,在对阻尼项d/dtgradF(χ)没有任何限制的前提下,给出了解存在的充分条件.     

链环的trip矩阵

ZULLI L首先构造了一个用于计算纽结Kauffman尖括号多项式的模2矩阵,纽结的trip矩阵.为了构造链环的trip矩阵,引入了一个带标识的穿有m个孔的圆盘来取代纽结情形下的圆盘,其中m为链环的分支数.主要结果为:定理若状态S是从状态AA…A经过i1,i2,…,ip位置上的标记替换(A换成B)而得的状态.设Ts是将trip矩阵T的左上角的n×n子块中ai1i1,ai2i2,…,aipip之值进行替换(0→1或1→0)所得的矩阵,则#(L|S)=n+m-秩(Ts).因此计算链环Kauffman尖括号多项式就归结为计算一组模2矩阵的秩.     

Zero Dissipative, Explicit Numerov-Type Methods for Second Order IVPs with Oscillating Solutions

New explicit, zero dissipative, hybrid Numerov type methods are presented in this paper. We derive these methods using an alternative which avoids the use of costly high accuracy interpolatory nodes. We only need the Taylor expansion at some internal points then. The method is of sixth algebraic order at a cost of seven stages per step while their phase lag order is fourteen. The zero dissipation condition is satisfied, so the methods possess an non empty interval of periodicity. Numerical results over some well known problems in physics and mechanics indicate the superiority of the new method.     

关于振动模态参数识别的注记

回顾了关于整体拟合的分母多项式系数的争议,论证了Richardson文献中所提供的参数精度不高的原因并非源于Richardson的错误.指出一个经典考核算例的仿真传递函数生成公式不同于复模态理论提供的公式,讨论了两者之间的关系.表1,参9.     

级数小于1的亚纯函数的Borel例外值

证明了当超越亚纯函数的级小于1时，其Norel例外值最多只有一个．由于存在任何级的整函数，因此一个例外值总可达到，故所得结果不能再改进。     

On the counting function of the lattice profile of periodic sequences

The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period.     

矩阵方程AXB=D的最小二乘Hermite解及其加权最佳逼近

本中,我们讨论了矩阵方程AXB=D的最小二乘Hermite解,通过运用广义奇异值分解(GSVD)，获得了解的通式。此外,对于给定矩阵F，也得到了它的加权最佳逼近表达式。     

Polynomial Reproduction in Subdivision

We study conditions on the matrix mask of a vector subdivision scheme ensuring that certain polynomial input vectors yield polynomial output again. The conditions are in terms of a recurrence formula for the vectors which determine the structure of polynomial input with this property. From this recurrence, we obtain an algorithm to determine polynomial input of maximal degree. The algorithm can be used in the design of masks to achieve a high order of polynomial reproduction.