A study comparing the performance of several computer programs for integrating systems of ordinary differential equations is reported. The integration methods represented include multistep methods (predictor-correctors), single …
Phyllis Fox
Pages 941-948
Two algorithms are presented in the form of Fortran subroutines. Each subroutine computes the radix and number of digits of the floating-point numbers and whether rounding or chopping is done by the machine on which it is run …
Michael A. Malcolm
Pages 949-951
An algorithm is described based on Newton's method which simultaneously approximates all zeros of a polynomial with only real zeros. The algorithm, which is conceptually suitable for parallel computation, determines its own starting …
Merrell L. Patrick
Pages 952-955
Most current programming languages treat computation over different classes of objects (e.g. numbers, strings, labels and functions). For correct compilation and execution, the following question then arises: is a program properly …
Henry F. Ledgard
Pages 956-966
The constructs of a simple programming language are introduced and described informally in terms of values and side-effects. A translator is defined which translates the language into flowcharts for a simple machine. The action …
Peter Henderson
Pages 967-973
Two new algorithms for deriving optimal and near-optimal flowcharts from limited entry decision tables are presented. Both take into account rule frequencies and the time needed to test conditions. One of the algorithms, called …
M. Verhelst
Pages 974-980
In list processing there is typically a growing demand for space during program execution. This paper examines the practical implications of this growth within a virtual memory computer system, proposes two new garbage collection …
H. D. Baecker
Pages 981-986
A method for generating values of continuous symmetric random variables that is relatively fast, requires essentially no computer memory, and is easy to use is developed. The method, which uses a uniform zero-one random number …
John S. Ramberg, Bruce W. Schmeiser
Pages 987-990
David L. March
Pages 991-992
Wayne Fullerton
Pages 993-995
W. Fullerton
Pages 993-995
In an earlier paper by Lum, Yuen, and Dodd [1] experimental results comparing six commonly used key-to-address transformation techniques were presented. One transformation in that study referred to as “Lin's method” is an elaborate …
V. Y. Lum, P. S. T. Yuen
Pages 996-997
This note concerns the recent paper by Hu [2] dealing with doubly-chained trees of the type introduced by Sussenguth [9]. In the second part of the paper, Hu deals with the problem of constructing an optimum weighted doubly-chained …
Steve Kennedy
Pages 997-998
E.W. Dijkstra [1] presented an algorithm whereby
N mainly independent computers, with a common data store as their sole means of communication, could contend for exclusive control of any given resource (storage, I/O, etc.). To …
Murray A. Eisenberg, Michael R. McGuire
Page 999
J.A. Moorer's “Music and Computer Composition” [1] was a distressing communication. While I realize that musical expertise is probably beyond the realm of the editorial staff, I must object to both the naiveté and faulty reasoning …
Stephen W. Smoliar
Pages 1000-1001
Pages 1007-1008
Jean E. Sammet
Page 939
D. L. March
Pages 991-992
