Search

Numerical mathematics is viewed as the analysis of continuous algorithms. Four of the components of numerical mathematics are discussed. These are: foundations (finite precision number systems, computational complexity), synthesis and analysis of algorithms, analysis of error, programs and program libraries. [ABSTRACT FROM AUTHOR]

A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n3 (where n is the length of the string being parsed) in general; it has an n2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick. [ABSTRACT FROM AUTHOR]

Focuses on the computational procedures of multiple covariance in statistics. Developments of an operator calculus for programming analysis of variance; Details of the basic computations for analysis-of-variance program; Illustration of analysis results through numerical example for analysis of covariance.

A computer language system has been developed which makes possible fast preparation of management reports, regardless of computational complexity or format variety. Costs are sufficiently low so that individually tailored reports can be prepared for every manager. The system requires initial preparation of large data banks containing data in elementary form. Use of two special languages, EXTRACT and MATRAN, permits selective extraction of any data subset, efficient processing through any computational sequence, and flexible presentation of results in either tabular or graphical form. Matrix algebra is used as a fundamental vehicle for accomplishing both manipulation and computation. [ABSTRACT FROM AUTHOR]

A technique for proving ruin-max norms of sorting algorithms is given. One new algorithm for finding the minimum and maximum elements of a set with fewest comparisons is proved optimal with this technique. [ABSTRACT FROM AUTHOR]

The article presents information on Association for Computing Machinery's (ACM) Special Interest Groups (SIG) and Special Interest Committees (SIC). The SIG on automata and computability theory addresses the theoretical and formal aspects of computing such as theory of automata, computational complexity and information structures. Methods used in the analysis, design, maintenance, and use of computer-based information systems are covered by the SIG on business data processing. ACM has several objectives in approving SIC on computers and the physically handicapped in August 1970 including the promotion of professional interests among computing professionals with physical disabilities.

Describes a modified form of Romberg quadrature. Less sensitivity to the accumulation of rounding errors; How the accumulation of chopping or rounding errors in the recursive evaluation of the trapezoid values introduces unnecessary noise into the computation of higher Romberg approximations; How approximations can be directly obtained from the rectangle values.

A list of bibliographical materials available to readers of Association for Computing Machinery publications. Included are "Computational Complexity: A Bibliography," by Marek I. Irland, "Bibliography on Computer Semantics," by Bertram Raphael and Ann Robinson and "An Annotated Bibliography for Computer Aided Routing and Placement," by David C. Wilson and Robert J. Smith III.