Elmor L. Peterson

Learn More
Data from spaceborne integrated circuits and ground-based ion bombardment experiments establish that logic devices ranging from memories to microprocessors are susceptible to single event-induced errors (1). The circuit level upset mechanism for static and dynamic RAMs is understood (2), and recently comparable mechanisms responsible for the single event(More)
A "posynomial" is a (generalized) polynomial with arbitrary real exponents, but positive coefficients and positive independent variables. Each posynomial program in which a posynomial is to be minimized subject to only inequality posynomial constraints is termed a "reversed geometric program". The study of each reversed geometric program is reduced to the(More)
Discrete analytic functions are coinplex valued functions defined at points of the z-plane with integer coordinates. The real and imaginary parts of these functions are required to satisfy difference equations analogous to the Cauchy-Riemann equations. The pseudo power z() is a discrete analytic function which is asymptotic to the ordinary power z for large(More)
Kochenberger and Woolsley have introduced slack variables into the constraints of a geometric program and have added their reciprocals to the objective function. They find this augmented program advantageous for numerical minimization^ In this paper the augmented program is used to give a relatively simple proof of the "refined duality theory of geometric(More)
F.E. Clark has shown that if at least one of the feasible solution sets for a pair of dual linear programming problems is nonempty then at least one of them is both nonempty and unbounded. Subsequently, M. Avriel and A.C. Williams have obtained the same result in the more general context of (prototype posynomial) geometric programming. In this paper we show(More)