Effective Discretization of the Energy Integral and Grunsky Coefficients in Annuli

Let be an analytic Jordan curve in the complex plane. We formulate a discrete minimal energy problem in a suitable class of functions whose solution provides a geometrically fast converging approximation to the equilibrium measure of . For this purpose an extremal point system that was introduced by K. Menke in 1972 is applied. In particular, an explicit error bound for the discretization of the energy integral is computed. The key to this error estimate is a univalence criterion for Laurent series, proved by R. Kuhnau in 1972. Finally, an estimate for the discrepancy between the approximating measures and the equilibrium measure is derived from the discretization error of the energy integral.     

On the Discrepancy of Point Distributions on Spheres and Hyperbolic Spaces

 Optimal lower bounds are given for the discrepancy of point distributions w.r.t. geodesic balls on spheres and hyperbolic spaces. The mean discrepancy is estimated below by using a non-commutative version of the Fourier transform method developed by Beck for Euclidean spaces.     

A note on the existence of sequences with small star discrepancy

It was shown by Heinrich et al. [The inverse of the star-discrepancy depends linearly on the dimension, Acta Arith. 96 (2001) 279–302] that there exist point sets for which the inverse of the star discrepancy depends linearly on the dimension. In this paper we extend those results by showing that there exist point sets extensible in the modulus and the dimension for which the star discrepancy satisfies a tractability bound for all dimensions and moduli.     

On the Discrepancy of Point Distributions on Spheres and Hyperbolic Spaces

 Optimal lower bounds are given for the discrepancy of point distributions w.r.t. geodesic balls on spheres and hyperbolic spaces. The mean discrepancy is estimated below by using a non-commutative version of the Fourier transform method developed by Beck for Euclidean spaces. Received March 2, 2000; in revised form February 28, 2002 Published online August 19, 2002     

Pseudo-differential Operators,Cubature and Equidistribution on the 3D ball: An Approach Based on Orthonormal Basis Systems

In this paper, the distribution of points on a unit ball in ?³ is investigated. The ansatz is motivated by an approach for point grids on the unit sphere by Cui and Freeden. A formula for a generalized discrepancy is developed, which is then used to check the uniformity of point grids on a ball. The generalized discrepancy originates from an error bound for a quadrature (cubature) rule on the ball with uniform weights. In particular, we discuss the integration of functions from particular Sobolev spaces based on known orthonormal systems on the ball. This includes the introduction of a concept of pseudo-differential operators on the ball. Finally, different point grids are constructed on the ball and are compared by the discrepancy. Furthermore, numerical and graphical comparisons of the grids are presented.     

A bound for the distortion near the boundary in the conformal mapping of infinite strips

A bound is given for the modulus of the derivative of the function effecting the conformal transformation of an infinite strip of constant width into a strip with curvilinear boundaries which are concave in the neighborhood of an infinitely distant point.Translated from Matematicheskie Zametki, Vol.4, No. 6, pp. 723–728, December, 1968.     

Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems

The well-known star discrepancy is a common measure for the uniformity of point distributions. It is used, e.g., in multivariate integration, pseudo random number generation, experimental design, statistics, or computer graphics.     

Average equidistribution and statistical independence properties of digital inversive pseudorandom numbers over parts of the period

This article deals with the digital inversive method for generating uniform pseudorandom numbers. Equidistribution and statistical independence properties of the generated pseudorandom number sequences over parts of the period are studied based on the distribution of tuples of successive terms in the sequence. The main result is an upper bound for the average value of the star discrepancy of the corresponding point sets. Additionally, lower bounds for the star discrepancy are established. The method of proof relies on bounds for exponential sums.

     

Tractability properties of the weighted star discrepancy

Tractability properties of various notions of discrepancy have been intensively studied in the last decade. In this paper we consider the so-called weighted star discrepancy which was introduced by Sloan and Wo?niakowski. We show that under a very mild condition on the weights one can obtain tractability with s$s$-exponent zero (s$s$ is the dimension of the point set). In the case of product weights we give a condition such that the weighted star discrepancy is even strongly tractable. Furthermore, we give a lower bound for the weighted star discrepancy for a large class of weights. This bound shows that for such weights one cannot obtain strong tractability.     

The sphere problem and the L-functions

We improve the upper bound for the lattice point discrepancy of large spheres under conjectural properties of the real L-functions. In connection with this we give some new unconditional estimates for exponential and character sums of independent interest.     

Equidistribution properties of quadratic congruential pseudorandom numbers

This paper deals with the quadratic congruential method for generating uniform pseudorandom numbers. Equidistribution properties of the generated pseudorandom number sequences over parts of the period are considered based on the discrepancy of corresponding point sets. An upper bound for the average value of these discrepancies is established.     

Lower Bounds on Strip Discrepancy for Nonatomic Colorings

 A method of proof is given for obtaining lower bounds on strip discrepancy when the distributions do not have atoms. Partition the unit square into an chessboard of congruent square pixels, where n is even. Color of the pixels red, and the rest blue. For any convex set A, let be the difference between the amounts of red and blue areas in A. Under a technical local balance condition, we prove there must be a strip S, of width less than , for which , where c is a positive constant, independent of n and the coloring. The proof extends methods discovered by Alexander and further developed by Chazelle, Matoušek, and Sharir. Integral geometric notions figure prominently. (Received 21 September 1998; in final form 21 February 2000)     

Higher order derivative tests for exponential sums incorporating the Discrete Hardy–Littlewood method

This paper provides estimates for exponential sums, combining classic tools of Van der Corput type with a deep result from the modern “discrete Hardy–Littlewood method”. As an application, an improved bound for the lattice point discrepancy of a large ellipsoid of rotation is deduced.     

某些一致分布的点集序列

本文借助于“倒根函数”和矩阵构造定义了［０,１）Ｓ（Ｓ≥１）中的一些有限点集,给出了它们的偏差的上界估计,从而证明了由它们组成的点集序列是一致分布的．     

Compound inversive congruential pseudorandom numbers: an average-case analysis

The present paper deals with the compound (or generalized) inversive congruential method for generating uniform pseudorandom numbers, which has been introduced recently. Equidistribution and statistical independence properties of the generated sequences over parts of the period are studied based on the discrepancy of certain point sets. The main result is an upper bound for the average value of these discrepancies. The method of proof is based on estimates for exponential sums.

     

<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> discrepancy of generalized two-dimensional Hammersley point sets

We determine the L _p discrepancy of the two-dimensional Hammersley point set in base b. These formulas show that the L _p discrepancy of the Hammersley point set is not of best possible order with respect to the general (best possible) lower bound on L _p discrepancies due to Roth and Schmidt. To overcome this disadvantage we introduce permutations in the construction of the Hammersley point set and show that there always exist permutations such that the L _p discrepancy of the generalized Hammersley point set is of best possible order. For the L ₂ discrepancy such permutations are given explicitly. F.P. is supported by the Austrian Science Foundation (FWF), Project S9609, that is part of the Austrian National Research Network “Analytic Combinatorics and Probabilistic Number Theory”.     

Construction of scrambled polynomial lattice rules over \mathbb{F}_{2} with small mean square weighted \mathcal{L}_{2} discrepancy

The \(\mathcal{L}_{2}\) discrepancy is one of several well-known quantitative measures for the equidistribution properties of point sets in the high-dimensional unit cube. The concept of weights was introduced by Sloan and Wo?niakowski to take into account the relative importance of the discrepancy of lower dimensional projections. As known under the name of quasi-Monte Carlo methods, point sets with small weighted \(\mathcal{L}_{2}\) discrepancy are useful in numerical integration. This study investigates the component-by-component construction of polynomial lattice rules over the finite field \(\mathbb{F}_{2}\) whose scrambled point sets have small mean square weighted \(\mathcal{L}_{2}\) discrepancy. An upper bound on this discrepancy is proved, which converges at almost the best possible rate of N ^?2+δ for all δ>0, where N denotes the number of points. Numerical experiments confirm that the performance of our constructed polynomial lattice point sets is comparable or even superior to that of Sobol’ sequences.     

On an example of finite hybrid quasi-Monte Carlo point sets

In this paper, we consider finite hybrid point sets in the unit cube. The components of these stem from two well known types of low discrepancy point sets, namely Hammersley point sets on the one hand, and lattice point sets in the sense of Korobov and Hlawka on the other hand. As a quality measure, we consider the star discrepancy, which gives information about the quality of distribution of finite or infinite sequences. We present existence results for finite hybrid point sets with low discrepancy. Thereby, we make analogous results for infinite sequences more explicit in the sense that, theoretically, it is now possible to find such finite hybrid low discrepancy point sets.     

混水平均匀设计的构造

我们用离散偏差来度量部分因子设计的均匀性,本文的目的在于寻找一些构造混水平均匀设计的方法,这些方法比文献中已有的方法更简单且计算成本更低.我们得到了离散偏差的一个下界,如果一个U 型设计的离散偏差值达到这个下界,那么该设计是—个均匀设计.我们建立了均匀设计与组合设计理论中一致可分解设计之间的联系.通过一致可分解设计,我们提出了一些构造均匀设计的新方法,同时也给出了许多均匀设计存在的无穷类.     

An Upper Bound on the Binomial Process Approximation to the Exceedance Process

In this paper we deal with an approximation to the point process of exceedances over a higher threshold. We compute sharp bounds on the remainder terms when actual distributions of exceedances are replaced by appropriate generalized Pareto distributions (GPD). The bound will be formulated in terms of the von Mises function. The ultimate as well as the penultimate approximations are considered; in the latter case the shape parameter of the approximating GPD depends on the threshold.