July 1969 - Vol. 12 No. 7
Features
Polynomial and spline approximation by quadratic programming
The problem of approximation to a given function, or of fitting a given set of data, where the approximating function is required to have certain of its derivatives of…
Generating pseudorandom numbers on a two’s complement machine such as the IBM 360
The familiar multiplicative congruential generator is examined in the context of the type of two's complement arithmetic used in the IBM 360 series. Different sequences…
It is shown how a novel method for computing (related) inner products can accelerate the pricing phase of LP algorithms. Other LP applications are indicated.
Some methods for contour mapping by means of a digital plotter are dicussed, and a new method is presented that is simple enough to be implemented by programs with a…
Some techniques for using pseudorandom numbers in computer simulation
An alogorithm is described by which uniform pseudorandom integers may be used to construct binary “numbers” in which the probability that each bit in the word…
Block structures, indirect addressing, and garbage collection
Programming languages have included explicit or implicit block structures to provide a naming convenience for the programmer. However, when indirect addressing is used,…
On the expected lengths of sequences generated in sorting by replacement selecting
In the replacement-selecting technique of sorting, one is interested in the ratio Lj of the expected length of the jth sequence generated by the technique to the number…