Searching for extensible Korobov rules

Extensible lattice sequences have been proposed and studied in [F.J. Hickernell, H.S. Hong, Computing multivariate normal probabilities using rank-1 lattice sequences, in: G.H. Golub, S.H. Lui, F.T. Luk, R.J. Plemmons (Eds.), Proceedings of the Workshop on Scientific Computing (Hong Kong), Singapore, Springer, Berlin, 1997, pp. 209–215; F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138; F.J. Hickernell, H.Niederreiter, The existence of good extensible rank-1 lattices, J. Complexity 19 (2003) 286–300]. For the special case of extensible Korobov sequences, parameters can be found in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C.Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138]. The searches made to obtain these parameters were based on quality measures that look at several projections of the lattice. Because it is often the case in practice that low-dimensional projections are very important, it is of interest to find parameters for these sequences based on measures that look more closely at these projections. In this paper, we prove the existence of “good” extensible Korobov rules with respect to a quality measure that considers two-dimensional projections. We also report results of experiments made on different problems where the newly obtained parameters compare favorably with those given in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138].     

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.

     

利用有限域上2-幂零矩阵构作Cartesian认证码

给出 2 -幂零矩阵的Jordan标准型在相似变换下的稳定群的结构 ,利用有限域上 2 -幂零矩阵构作了一个Cartesian认证码 ,计算出了该认证码的参数 .在假定编码规则按等概率分布选取的条件下 ,计算出了该认证码被成功的模仿攻击的最大概率PI 及被成功的替换攻击的最大概率PS.     

Bayesian methods in global optimization

This paper reviews methods which have been proposed for solving global optimization problems in the framework of the Bayesian paradigm.     

On extrapolation of Jagerman and Stetter rules

In this paper quadrature rules introduced by Jagerman [1] and Stetter [2] are considered and asymptotic expansions for the error given. This allows to make use of the Romberg extrapolation process. Such rules can be viewed as generalizations of the well-known mid-point rule. Thus, numerical examples comparing these rules are finally presented.     

On a new stochastic global optimization algorithm based on censored observations

In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented.     

ANISOTROPIC EFFECTS OF QUASI-ISOTROPIC COMPOSITES(I)──MODELLING

ＡＮＩＳＯＴＲＯＰＩＣＥＦＦＥＣＴＳＯＦＱＵＡＳＩ－ＩＳＯＴＲＯＰＩＣＣＯＭＰＯＳＩＴＥＳ（Ｉ）──ＭＯＤＥＬＬＩＮＧＺｈｅｎｇＱｕａｎｓｈｕｉ（郑泉水），ＦａｎｇＨｕｉｙｕ（方辉宇）（ＤｅｐａｒｔｍｅｎｔｏｆＥｎｇｉｎｅｅｒｉｎｇＭｅｃｈａｎｉｃｓ...     

On the Wigner-Witmer correlation rules for a homonuclear diatomic molecule with the like atoms in identical atomic states

The problem of building the manifold of electronic states of a homonuclear diatomic molecule formed from two like atoms in identical atomic states is readdressed. A conceptually simple approach is presented by invoking a model and all the standard results originally obtained by Wigner and Witmer are reproduced.