Mathematical Software (TOMS)


Search Issue
enter search term and/or author name


ACM Transactions on Mathematical Software (TOMS), Volume 14 Issue 3, Sept. 1988

Exception handling in scientific computing
T. E. Hull, M. S. Cohen, J. T. M. Sawshuk, D. B. Wortman
Pages: 201-217
DOI: 10.1145/44128.44129
This paper describes some simple programming language facilities for raising and handling exceptions, and demonstrates, with a number of examples, their effectiveness in a scientific computing environment. Only a small number of...

Dagwood: a system for manipulating polynomials given by straight-line programs
Timothy S. Freeman, Gregory M. Imirzian, Erich Kaltofen, Lakshman Yagati
Pages: 218-240
DOI: 10.1145/44128.214376
We discuss the design, implementation, and benchmarking of a system that can manipulate symbolic expressions represented by their straight-line computations. Our system is capable of performing rational arithmetic on, evaluating,...

Solution of large, dense symmetric generalized eigenvalue problems using secondary storage
Roger G. Grimes, Horst D. Simon
Pages: 241-256
DOI: 10.1145/44128.44130
This paper describes a new implementation of algorithms for solving large, dense symmetric eigen-problems AX = BX&Lgr;, where the matrices A and B are too large to fit in the...

Algorithm 664: A Gauss algorithm to solve systems with large, banded matrices using random-access disk storage
Géza Schrauf
Pages: 257-260
DOI: 10.1145/44128.214379
A FORTRAN 77 implementation of a Gauss algorithm with partial pivoting for banded matrices is described. The algorithm keeps only part of the matrix that is necessary for the actual computation in memory. This allows large systems to be solved...

Generating gamma variates
Do Le Minh
Pages: 261-266
DOI: 10.1145/44128.214382
An algorithm to generate variates having a gamma distribution with shape parameter greater than one is presented in this paper. This algorithm is faster than Schmeiser and Lal's G4PE, which is the fastest one currently available, yet is equally...

Remarks on implementation of O(n1/2τ) assignment algorithms
Iain S. Duff, Torbjörn Wiberg
Pages: 267-287
DOI: 10.1145/44128.44131
We examine an implementation and a number of modifications of a 1973 algorithm of Hopcroft and Karp for permuting a sparse matrix so that there are no zeros on the diagonal. We describe our implementation of the original Hopcroft and Karp...

Remark on “Algorithm 346: F-Test Probabilities”
R. S. Cormack, I. D. Hill
Pages: 288-289
DOI: 10.1145/44128.356244

ACM Algorithms Policy
Fred T. Krogh
Pages: 290-293
DOI: 10.1145/44128.356245

Corrigendum: “Interpolation with Interval and Point Tension Controls Using Cubic Weighted v-Splines”
Thomas A. Foley
Page: 297
DOI: 10.1145/44128.356246