January 1974 - Vol. 17 No. 1
Features
Syntax-directed least-errors analysis for context-free languages: a practical approach
A least-errors recognizer is developed informally using the well-known recognizer of Earley, along with elements of Bellman's dynamic programming. The analyzer takes a…
A fast method for solving a class of tridiagonal linear systems
The solution of linear systems having real, symmetric, diagonally dominant, tridiagonal coefficient matrices with constant diagonals is considered. It is proved that the…
A method of bivariate interpolation and smooth surface fitting based on local procedures
A method is designed for interpolating values given at points of a rectangular grid in a plane by a smooth bivariate function z = z(x, y). The interpolating function is a…
Tridiagonalization by permutations
Tridiagonalizing a matrix by similarity transformations is an important computational tool in numerical linear algebra. Consider the class of sparse matrices which can be…
Computation of Legendre series coefficients
LEGSER approximates the first N + 1 coefficients Bn of the Legendre series expansion of a function ƒ(x) having known Chebyshev series coefficients An. Several…
A new family of clipping algorithms is described. These algorithms are able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing…
In his interesting contribution to the study of the conversion of limited-entry decision tables to flowcharts or sequential testing procedures, Verhelst [1] presents two…
A numbering system for combinations
It is often necessary to generate the sequence of combinations of s things chosen from among n things, or to generate a random member of this sequence. Various algorithms…