The Barnett approximation in the theory of hydrodynamic fluctuations

The Langevin dynamics and fluctuational-dissipative relationships for the hydrodynamic fluctuations for systems which are described in the third Barnett order with respect to the gradients of the hydrodynamic variables are generalized on the basis of a kinetic approach.     

Buchbesprechungen

Ohne Zusammenfassung

---

Book reviews

     

Electron traps and positive DLTS signals in VPE GaAs MESFETs

Capacitance DLTS measurements have been performed in VPE GaAs MESFETs prepared on Bridgman Cr-doped and LEC undoped semi-insulating substrates. A band of electron traps not intrinsically related to the VPE growth process and accumulating near the metal (gate) — semiconductor interface was detected in all the samples. Deeper regions into the channel were free from any detectable trap. Near pinch-off conditions, a positive capacitance signal was found to dominate the DLTS spectra only in the case of samples prepared on Cr-doped substrates. The hypothesis of this positive transient being related to changes in the occupation of surface states in the ungated surface access regions has been checked by comparing experimental and calculated dependencies of the signal amplitude on reverse gate voltage. Unexplained discrepancies, together with the absence of positive signal in MESFETs prepared on LEC undoped substrates, suggest the possibility of hole emission from hole traps within the bulk of the device.     

The complexity of cutting complexes

This paper investigates the combinatorial and computational aspects of certain extremal geometric problems in two and three dimensions. Specifically, we examine the problem of intersecting a convex subdivision with a line in order to maximize the number of intersections. A similar problem is to maximize the number of intersected facets in a cross-section of a three-dimensional convex polytope. Related problems concern maximum chains in certain families of posets defined over the regions of a convex subdivision. In most cases we are able to prove sharp bounds on the asymptotic behavior of the corresponding extremal functions. We also describe polynomial algorithms for all the problems discussed.Bernard Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant No. MCS83-03925. Herbert Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862.     

Truncated Newton method for sparse unconstrained optimization using automatic differentiation

When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.