Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

The components of chi-squared statistics for goodness-of-fit tests

One obtains a formula for the transformation of a vector with a given covariance matrix. The sum of the squares of the components of the transformed vector is equal to a chi-square type quadratic form, constructed with the aid of the initial vector. Taking into account this property, one finds the components of the Pearson statistic, Pearson-Fisher statistic, etc.Translated from Veroyatnostnye Raspredeleniya i Matematicheskaya Statistika, pp. 337–350, 1986.     

Transport as a consequence of state-dependent diffusion

Overdamped particles subject to a drift in a force field with sinusoidal space dependence and also a sinusoidally modulated space-dependent diffusion, with the same period as the drift, experience a net driving force. The resulting current depends on the amplitude of the modulation of the diffusion and is a periodic function of the phase difference between the sinusoidal drift and the sinusoidal modulation of the diffusion. For small modulation amplitudes a particle subject to state-dependent noise behaves the same way as a particle subject to thermal noise but with a drift which, in addition to the sinusoidal term, contains a net force term.Dedicated to Professor Harry Thomas on the occasion of his 60th birthday