High-density properties of hard spheres within a modified Percus-Yevick theory: The role of thermodynamic consistency

Using an integral-equation approach based upon an approximation for the tail function, the equilibrium properties of a system of hard spheres are studied with special concern for the behavior in the region of close packing. The closure adopted is such that full, internal consistency is ensured in the thermodynamics of the model with respect to both the two zero-separation theorems as well as to the more standard virial and fluctuation routes to the equation of state. The scheme also makes use of the continuity properties of the tail function and of the cavity distribution function at contact. These properties are explictly tested in the low-density limit up to the fourth derivative. The theory generates an equilibrium branch bounded on the high-density side by a point corresponding to a packing fraction0.78, a value which closely matches Rogers' least upper bound for the densest packing of spheres. The pair structure of the fluid in the state of random close packing is also compared to the type of local order predicted by the theory at similar densities.     

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison

We consider the following global optimization problems for a Lipschitz functionf implicitly defined on an interval [a, b]. Problem P: find a globally-optimal value off and a corresponding point; Problem Q: find a set of disjoint subintervals of [a, b] containing only points with a globally-optimal value and the union of which contains all globally optimal points. A two-phase algorithm is proposed for Problem P. In phase I, this algorithm obtains rapidly a solution which is often globally-optimal. Moreover, a sufficient condition onf for this to be the case is given. In phase II, the algorithm proves the-optimality of the solution obtained in phase I or finds a sequence of points of increasing value containing one with a globally-optimal value. The new algorithm is empirically compared (on twenty problems from the literature) with a best possible algorithm (for which the optimal value is assumed to be known), with a passive algorithm and with the algorithms of Evtushenko, Galperin, Shen and Zhu, Piyavskii, Timonov and Schoen. For small, the new algorithm requires only a few percent more function evaluations than the best possible one. An extended version of Piyavskii's algorithm is proposed for problem Q. A sufficient condition onf is given for the globally optimal points to be in one-to-one correspondance with the obtained intervals. This result is achieved for all twenty test problems.The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426, FCAR grant 89EQ4144 and partially by AFOSR grant 0066. We thank Nicole Paradis for her help in drawing the figures.     

Convergence rates of a global optimization algorithm

Second order conditions for the (pseudo-) convexity of a function restricted to an affine subspace are obtained by extending those already known for functions on ⁿ . These results are then used to analyse the (pseudo-) convexity of potential functions of the type introduced by Karmarkar.This research was completed while the first author was on sabbatical leave at the Département d'Informatiques et de Recherche Opérationelle, Université de Montréal, and supported by NSERC (grant Q015807). This research was also supported by NSERC (grants A8312 and A5408) and la Coopération franco-québécoise (project 20-02-13).     

Some exact expressions for the mean and higher moments of functions of sample moments

Examples of exact expressions for the moments (mainly of the mean) of functions of sample moments are given. These provide checks on alternative developments such as asymptotic series for n, and simulation processes. Exact expressions are given for the mean of the square of the sample coefficient of variation, particularly in uniform sampling; Frullani integrals studied by G. H. Hardy arise. It should be kept in mind that exact results for (joint) moment generating functions (mgfs) are of interest as they produce a means of obtaining exact results for (cross) moments—including moments with negative indices. Thus an exact expression for the joint mgf of the 1st two noncentral moments can be used to obtain the mean of the (c.v.)² (but not for the mean of the c..). A general expression is given for the moment generating function of the sample variance. The limitations of Fisher's symbolic formula for the characteristic function of sample moments (or more general statistics) are noted.This research was sponsored by the Applied Mathematical Sciences Research program, Office of Energy Research, U. S. Department of Energy under contract DE-AC0584OR21400 with the Martin Marietta Energy Systems. Inc.     

A long-time tail for random walk in random scenery

Consider a simple random walk on ^d whose sites are colored black or white independently with probabilityq, resp. 1–q. Walk and coloring are independent. Letn _k be the number of steps by the walk between itskth and (k+1) th visits to a black site (i.e., the length of itskth white run), and let _k =E(n _k )–q ^–1. Our main result is a proof that (*) lim _k k ^d/2 _k = (1 –q)q ^{d/2 – 2}(d/2) ^d/2. Since it is known thatq ^{– 1} _k =E(n ₁ n _{k + 1} B) –E(n ₁ B)E(n _{k + 1} B), withB the event that the origin is black, (*) exhibits a long-time tail in the run length autocorrelation function. Numerical calculations of _k (1k100) ind=1, 2, and 3 show that there is an oscillatory behavior of _k for smallk. This damps exponentially fast, following which the power law sets in fairly rapidly. We prove that if the coloring is not independent, but is convex in the sense of FKG, then the decay of _k cannot be faster than (*).     

Partition function zeros for the one-dimensional ordered plasma in Dirichlet boundary conditions

We consider the grand canonical partition function for the ordered one-dimensional, two-component plasma at fugacity in an applied electric fieldE with Dirichlet boundary conditions. The system has a phase transition from a low-coupling phase with equally spaced particles to a high-coupling phase with particles clustered into dipolar pairs. An exact expression for the partition function is developed. In zero applied field the zeros in the plane occupy the imaginary axis from –i to –i_c and i_c to i for some _c. They also occupy the diamond shape of four straight lines from ±i_c to _c and from ±i_c to –_c. The fugacity acts like a temperature or coupling variable. The symmetry-breaking field is the applied electric fieldE. A finite-size scaling representation for the partition in scaled coupling and scaled electric field is developed. It has standard mean field form. When the scaled coupling is real, the zeros in the scaled field lie on the imaginary axis and pinch the real scaled field axis as the scaled coupling increases. The scaled partition function considered as a function of two complex variables, scaled coupling and scaled field, has zeros on a two-dimensional surface in a domain of four real variables. A numerical discussion of some of the properties of this surface is presented.     

Numerical solution of minimax problems of optimal control,part 1

This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P).For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.This research was supported by the National Science Foundation, Grant No. ENG-79-18667, and by Wright-Patterson Air Force Base, Contract No. F33615-80-C3000. This paper is a condensation of the investigations reported in Refs. 1–7. The authors are indebted to E. M. Coker and E. M. Sims for analytical and computational assistance.     

Nonequilibrium fluctuations in μ space

The properties of fluctuations in space in or outside thermal equilibrium are obtained by solving hierarchies of equations derived either from the Liouville or the Master equation. In particular we study the one-, two-, etc., time correlation functions that describe the spatial and temporal behavior of the fluctuations in space. Explicit solutions are obtained for a dilute gas. The Langevin approach is briefly discussed. Our results are compared with those obtained in the extensive literature, which is reviewed in some detail.     

Root determination by use of Padé approximants

In this paper we describe a new technique for generating iteration formulas — of arbitrary order — for determining a zero (assumed simple) of a functionf, assumed analytic in a region containing the zero. The 1/p Padé Approximant (p0) to the functiong(t)f(z) is formed wherez=w+t, using the Taylor series forf at the pointw, an approxination to the zero off. The value oft for which the 1/p Padé Approximant vanishes provides the basis of iteration formulas of orderp+2.Some known iteration formulas, e.g., Newton-Raphson's, Halley's and Kiss's of order of convergence two, three and four, are directly obtained by settingp=0,1 and 2, respectively.     

A bound on the number of bound states in the Schrödinger equation

A boundS _l is given for the number of bound statesn _i in thelth partial wave corresponding to a spherically symmetric potential in non-relativistic quantum mechanics. This bound is given by whereV _a(l, r) is the attractive part of the effective potentialV(r)+l(l+1)/r ². Extensive comparative study ofS _i and the Bargmann inequality is made.