Construction Algorithms for Good Extensible Lattice Rules

Extensible (polynomial) lattice rules have the property that the number N of points in the node set may be increased while retaining the existing points. It was shown by Hickernell and Niederreiter in a nonconstructive manner that there exist generating vectors for extensible integration lattices of excellent quality for N=b,b ²,b ³,…, where b is a given integer greater than 1. Similar results were proved by Niederreiter for polynomial lattices. In this paper we provide construction algorithms for good extensible lattice rules. We treat the classical as well as the polynomial case.     

The Existence of Good Extensible Polynomial Lattice Rules

Extensible (polynomial) lattice rules have been introduced recently and they are convenient tools for quasi-Monte Carlo integration. It is shown in this paper that for suitable infinite families of polynomial moduli there exist generating parameters for extensible rank-1 polynomial lattice rules such that for all these infinitely many moduli and all dimensions s the quantity R ^(s) and the star discrepancy are small. The case of Korobov-type polynomial lattice rules is also considered.Received April 30, 2002; in revised form August 21, 2002 Published online April 4, 2003     

The Existence of Good Extensible Polynomial Lattice Rules

Extensible (polynomial) lattice rules have been introduced recently and they are convenient tools for quasi-Monte Carlo integration. It is shown in this paper that for suitable infinite families of polynomial moduli there exist generating parameters for extensible rank-1 polynomial lattice rules such that for all these infinitely many moduli and all dimensions s the quantity R ^(s) and the star discrepancy are small. The case of Korobov-type polynomial lattice rules is also considered.     

Good Lattice Rules in Weighted Korobov Spaces with General Weights

We study the problem of multivariate integration and the construction of good lattice rules in weighted Korobov spaces with general weights. These spaces are not necessarily tensor products of spaces of univariate functions. Sufficient conditions for tractability and strong tractability of multivariate integration in such weighted function spaces are found. These conditions are also necessary if the weights are such that the reproducing kernel of the weighted Korobov space is pointwise non-negative. The existence of a lattice rule which achieves the nearly optimal convergence order is proven. A component-by-component (CBC) algorithm that constructs good lattice rules is presented. The resulting lattice rules achieve tractability or strong tractability error bounds and achieve nearly optimal convergence order for suitably decaying weights. We also study special weights such as finite-order and order-dependent weights. For these special weights, the cost of the CBC algorithm is polynomial. Numerical computations show that the lattice rules constructed by the CBC algorithm give much smaller worst-case errors than the mean worst-case errors over all quasi-Monte Carlo rules or over all lattice rules, and generally smaller worst-case errors than the best Korobov lattice rules in dimensions up to hundreds. Numerical results are provided to illustrate the efficiency of CBC lattice rules and Korobov lattice rules (with suitably chosen weights), in particular for high-dimensional finance problems.     

The Number of Lattice Points Above the Catenary

For fixed c > 1 and for arbitrary and independent a,b ≧ 1 let Z ²|b( cosh(x/a)−c) ≦ y < 0}. We investigate the asymptotic behaviour of R(a,b) for a,b → ∞. In the special case b = o(a ^5/6) the lattice rest has true order of magnitude . This revised version was published online in June 2006 with corrections to the Cover Date.     

Configurations Maximizing the Number of Pairs of Hamming-Adjacent Lattice Points

The following question is considered: Which sets of k lattice points among the n^d points in a d-dimensional cube of length n maximize the number of pairs of points differing in only one coordinate? It is shown that maximal configurations for any (d, n, k) are obtained by choosing the first k points in a lexicographic ordering of the points by coordinates. Some possible generalizations of the problem are discussed.     

The Number of Lattice Rules of Specified Upper Class and Rank

The upper class of a lattice rule is a convenient entity for classification and other purposes. The rank of a lattice rule is a basic characteristic, also used for classification. By introducing a rank proportionality factor and obtaining certain recurrence relations, we show how many lattice rules of each rank exist in any prime upper class. The Sylow p-decomposition may be used to obtain corresponding results for any upper class.     

Octahedrons with Equally Many Lattice Points

Periodica Mathematica Hungarica -     

Lattice Points in Convex Bodies with Planar Points on the Boundary

 An asymptotic formula is proved for the number of lattice points in large threedimensional convex bodies. In contrast to the usual assumption the Gaussian curvature of the boundary may vanish at non-isolated points. It is only assumed that the second fundamental form vanishes at isolated points where the tangent plane is rational and some ellipticity condition holds. Received 25 April 2001     

Lattice Points in Convex Bodies with Planar Points on the Boundary

 An asymptotic formula is proved for the number of lattice points in large threedimensional convex bodies. In contrast to the usual assumption the Gaussian curvature of the boundary may vanish at non-isolated points. It is only assumed that the second fundamental form vanishes at isolated points where the tangent plane is rational and some ellipticity condition holds.     

Asymptotic of Eigenvalues and Lattice Points

dimension. elementary domains of In this work we study the spectral counting function for the p-Laplace operator in one We show the existence of a two-term Weyl-type asymptote. The method of proof is rather based on the Dirichlet lattice points problem, which enables us to obtain similar results for infinite measure.     

Distribution of Lattice Points on Hyperboloids

Consider the region Ω₀ on the hyperboloid 1 = b² + ac defined by the conditions

复合材料大层数层压矩形截面杆的扭转问题分析

本文根据有效弹性模量理论［１］，采用三维八节点等参数有限元和整体—局部方法，对复合材料大层数矩形厚截面层压杆的扭转问题及其自由边缘效应进行了分析研究，通过算例计算给出了剪切应力在横截面内的分布规律、杆的扭转变形及其在自由边缘区域层间应力的分布情况·由于本文的分析方法可根据需要仅在应力梯度较大的局部区域，按单层逐层划分单元或在单层内再细化单元，以求得单层内精确的应力场和位移场，因此能显著节约计算量与机时，为具有大层数层压杆的扭转强度计算提供了一种有效的方法·     

Lattice Points in Three-Dimensional Convex Bodies with Points of Gaussian Curvature Zero at the Boundary

 In this article we investigate the number of lattice points in a three-dimensional convex body which contains non-isolated points with Gaussian curvature zero but a finite number of flat points at the boundary. Especially, in case of rational tangential planes in these points we investigate not only the influence of the flat points but also of the other points with Gaussian curvature zero on the estimation of the lattice rest.     

Lattice Points in Three-Dimensional Convex Bodies with Points of Gaussian Curvature Zero at the Boundary

 In this article we investigate the number of lattice points in a three-dimensional convex body which contains non-isolated points with Gaussian curvature zero but a finite number of flat points at the boundary. Especially, in case of rational tangential planes in these points we investigate not only the influence of the flat points but also of the other points with Gaussian curvature zero on the estimation of the lattice rest. Received 19 June 2001; in revised form 17 January 2002 RID="a" ID="a" Dedicated to Professor Edmund Hlawka on the occasion of his 85th birthday     

Volume and Lattice Points of Reflexive Simplices

Using new number-theoretic bounds on the denominators of unit fractions summing up to one, we show that in any dimension d ≥ 4 there is only one d-dimensional reflexive simplex having maximal volume. Moreover, only these reflexive simplices can admit an edge that has the maximal number of lattice points possible for an edge of a reflexive simplex. In general, these simplices are also expected to contain the largest number of lattice points even among all lattice polytopes with only one interior lattice point. Translated in algebro-geometric language, our main theorem yields a sharp upper bound on the anticanonical degree of d-dimensional Q-factorial Gorenstein toric Fano varieties with Picard number one, e.g., of weighted projective spaces with Gorenstein singularities.     

On Quasi-thin Association Schemes with Odd Number of Points

Let (X, R) be an association scheme in the sense of P.-H. Zieschang (1996, “An Algebraic Approach to Association Schemes,” Lecture Notes in Mathematics, Vol. 1628, Springer, New York/Berlin), where X is a finite set and R is a partition of X × X. We say that (X, R) is quasi-thin if each element of R has a valency of at most two. In this paper we focus on quasi-thin association schemes with an odd number of points and obtain that (X, R) has a regular automorphism group when n_O^θ(R) is square-free.     

Lattice Points, Dedekind Sums, and Ehrhart Polynomials of Lattice Polyhedra

Abstract. Let σ be a simplex of R ^N with vertices in the integral lattice Z ^N . The number of lattice points of mσ (={mα : α ∈ σ}) is a polynomial function L(σ,m) of m ≥ 0 . In this paper we present: (i) a formula for the coefficients of the polynomial L(σ,t) in terms of the elementary symmetric functions; (ii) a hyperbolic cotangent expression for the generating functions of the sequence L(σ,m) , m ≥ 0 ; (iii) an explicit formula for the coefficients of the polynomial L(σ,t) in terms of torsion. As an application of (i), the coefficient for the lattice n -simplex of R ⁿ with the vertices (0,. . ., 0, a _j , 0,. . . ,0) (1≤ j≤ n) plus the origin is explicitly expressed in terms of Dedekind sums; and when n=2 , it reduces to the reciprocity law about Dedekind sums. The whole exposition is elementary and self-contained.     

Lattice Points, Dedekind Sums, and Ehrhart Polynomials of Lattice Polyhedra

   Abstract. Let σ be a simplex of R ^N with vertices in the integral lattice Z ^N . The number of lattice points of mσ (={mα : α ∈ σ}) is a polynomial function L(σ,m) of m ≥ 0 . In this paper we present: (i) a formula for the coefficients of the polynomial L(σ,t) in terms of the elementary symmetric functions; (ii) a hyperbolic cotangent expression for the generating functions of the sequence L(σ,m) , m ≥ 0 ; (iii) an explicit formula for the coefficients of the polynomial L(σ,t) in terms of torsion. As an application of (i), the coefficient for the lattice n -simplex of R ⁿ with the vertices (0,. . ., 0, a _j , 0,. . . ,0) (1≤ j≤ n) plus the origin is explicitly expressed in terms of Dedekind sums; and when n=2 , it reduces to the reciprocity law about Dedekind sums. The whole exposition is elementary and self-contained.