Centered -discrepancy of random sampling and Latin hypercube design, and construction of uniform designs

In this paper properties and construction of designs under a centered version of the -discrepancy are analyzed. The theoretic expectation and variance of this discrepancy are derived for random designs and Latin hypercube designs. The expectation and variance of Latin hypercube designs are significantly lower than that of random designs. While in dimension one the unique uniform design is also a set of equidistant points, low-discrepancy designs in higher dimension have to be generated by explicit optimization. Optimization is performed using the threshold accepting heuristic which produces low discrepancy designs compared to theoretic expectation and variance.

     

On Analogs of the Tits Alternative for Groups of Homeomorphisms of the Circle and of the Line

In [1] G. Margulis proved Ghys's conjecture stating the validity of the following analog of the Tits alternative: either the group of homeomorphisms of the circle possesses a free subgroup with two generators or there is an invariant probabilistic measure on S ¹ . In the present paper, we prove the following strengthening of Margulis's statement: an invariant probabilistic measure for a group exists if and only if the quotient group does not contain a free subgroup with two generators (here is some specific subgroup of G defined in a canonical way). We also formulate and prove analogs of the Tits alternative for groups of homeomorphisms of the line.     

The Rate of Convergence for Subexponential Distributions and Densities

A distribution function F on the nonnegative real line is called subexponential if lim_x(1-F ^*n (x)/(1 - F(x)) = n for all n 2, where F ^*n denotes the nfold Stieltjes convolution of F with itself. In this paper, we consider the rate of convergence in the above definition and in its density analogue. Among others we discuss the asymptotic behavior of the remainder term R _n (x) defined by R _n (x) = 1 - F*n(x) - n(1 - F(x)) and of its density analogue r_n (x) = -(R_n (x))'. Our results complement and complete those obtained by several authors. In an earlier paper, we obtained results of the form _n(x) = O(1)f(x)R(x), where f is the density of F and R(x) = ₀ ^x (1-F(y))dy. In this paper, among others we obtain asymptotic expressions of the form R _n(x)= ₂ ⁿ R₂(x) + O(1)(-f'(x))R²(x) where f' is the derivative of f.     

Mapping Class Groups of Nonorientable Surfaces

We obtain a finite set of generators for the mapping class group of a nonorientable surface with punctures. We then compute the first homology group of the mapping class group and certain subgroups of it. As an application we prove that the image of a homomorphism from the mapping class group of a nonorientable surface of genus at least nine to the group of real-analytic diffeomorphisms of the circle is either trivial or of order two.     

MERIT FUNCTION AND GLOBAL ALGORITHM FOR BOX CONSTRAINED VARIATIONAL INEQUALITIES

1 IntroductionWe consider tlie variational inequality problelll, deuoted by VIP(X, F), wliicli is to find avector x* E X such thatF(X*)"(X -- X-) 2 0, VX E X, (1)where F: R" - R" is any vector-valued f11uction and X is a uonelllpty subset of R'.This problem has important applicatiolls. in equilibriun1 modeIs arising in fields such asecououtics, transportatioll scieuce alld operations research. See [1]. There exist mauy lllethodsfor solviug tlie variational li1equality problem VIP(X. …     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

On Generating Discrete Orthogonal Bivariate Polynomials

In this paper we present an algorithm for recursively generating orthogonal bivariate polynomials on a discrete set S ². For this purpose we employ commuting pairs of real symmetric matrices H, K ^n×n to obtain, in a certain sense, a two dimensional Hermitian Lanczos method. The resulting algorithm relies on a recurrence having a slowly growing length. Practical implementation issues an applications are considered. The method can be generalized to compute orthogonal polynomials depending on an arbitrary number of variables.     

Constructing Invariant Fairness Measures for Surfaces

The paper proposes a rational method to derive fairness measures for surfaces. It works in cases where isophotes, reflection lines, planar intersection curves, or other curves are used to judge the fairness of the surface. The surface fairness measure is derived by demanding that all the given curves should be fair with respect to an appropriate curve fairness measure. The method is applied to the field of ship hull design where the curves are plane intersections. The method is extended to the case where one considers, not the fairness of one curve, but the fairness of a one parameter family of curves. Six basic third order invariants by which the fairing measures can be expressed are defined. Furthermore, the geometry of a plane intersection curve is studied, and the variation of the total, the normal, and the geodesic curvature and the geodesic torsion is determined.     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008