ACM Transactions on Mathematical Software (TOMS), Volume 5

Volume 5, Number 1, March 1979

• Pamela Zave, Werner C. Rheinboldt: Design of an Adaptive, Parallel Finite-Element System. 1-17
• Iain S. Duff, J. K. Reid: Some Design Features of a Sparse Matrix Code. 18-35
• Wlodzimierz Proskurowski: Numerical Solution of Helmholtz's Equation by Implicit Capacitance Matrix Methods. 36-49
• J. Michael Yohe: Software for Interval Arithmetic: A Reasonably Portable Package. 50-63
• Jorge J. Moré, Michel Cosnard: Numerical Solution of Nonlinear Equations. 64-85
• David K. Kahaner, Mark B. Wells: An Experimental Algorithm for N-Dimensional Adaptive Quadrature. 86-96
• H. D. Knoble, C. Forney Jr., F. S. Bader: An Efficient One-Way Enciphering Algorithm. 97-107
• H. D. Knoble: Algorithm 536: An Efficient One-Way Enciphering Algorithm [Z]. 108-111
• Walter R. Leeb: Algorithm 537: Characteristic Values of Mathieu's Differential Equation. 112-117
• Paul J. Nikolai: Algorithm 538: Eigenvectors, Eigenvalues of Real Generalized Symmetric Matrices by Simultaneous Iteration [F2]. 118-125

Volume 5, Number 2, June 1979

• Fred T. Krogh: ACM Algorithms Policy. 129-131
• Linus Schrage: A More Portable Fortran Random Number Generator. 132-138
• Alan George, Joseph W. H. Liu: The Design of a User Interface for a Sparse Matrix Package. 139-162
• W. H. Payne, F. M. Ives: Combination Generators. 163-172
• Carl de Boor: Efficient Computer Manipulation of Tensor Products. 173-182
• John G. Cleary: Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space. 183-192
• Harlan P. Crowder, Ron S. Dembo, John M. Mulvey: On Reporting Computational Experiments with Mathematical Software. 193-203
• Fred D. Crary: A Versatile Precompiler for Nonstandard Arithmetics. 204-217
• Keith O. Geddes: Symbolic Computation of Padé Approximants. 218-233
• Richard A. Bogen: Addendum to ``Analytically Solving Integral Equations by Using Computer Algebra''. 234-237
• Mohamed el Lozy: Remark on ``Algorithm 395: Student's t-Distribution'' and Remark on ``Algorithm 396: Student's Quantiles [S14]''. 238-239
• Keith O. Geddes: Remark on ``Algorithm 424: Clenshaw-Curtis Quadrature [O1]''. 240
• Michael R. Anderson: Remark on ``Algorithm 474: Bivariate Interpolation and Smooth Surface Fitting Based on Local Procedures''. 241
• Hiroshi Akima: Remark on ``Algorithm 526: Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points [E1]''. 242

Volume 5, Number 3, September 1979

• Lawrence F. Shampine: Storage Reduction for Runge-Kutta Codes. 245-250
• Louis W. Ehrlich: Solving the Biharmonic Equation on Irregular Regions. 251-258
• Philip E. Gill, Walter Murray, Susan M. Picken, Margaret H. Wright: The Design and Structure of a Fortran Program Library for Optimization. 259-283
• Alan George, Joseph W. H. Liu: An Implementation of a Pseudoperipheral Node Finder. 284-295
• James Michael Bennett, Robert Neff Bryan: A Single-Point Exchange Algorithm for Approximating Functions of Two Variables. 296-307
• C. L. Lawson, Richard J. Hanson, D. R. Kincaid, Fred T. Krogh: Basic Linear Algebra Subprograms for Fortran Usage. 308-323
• C. L. Lawson, Richard J. Hanson, D. R. Kincaid, Fred T. Krogh: Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]. 324-325
• Niel K. Madsen, Richard F. Sincovec: Algorithm 540: PDECOL, General Collocation Software for Partial Differential Equations [D3]. 326-351
• Paul N. Swarztrauber, Roland A. Sweet: Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]. 352-364
• Michael Steuerwalt: Certification of ``Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]''. 365-371
• John Larson: Errata: ``Efficient Calculation of the Effects of Roundoff Errors''. 372

Volume 5, Number 4, December 1979

• C. William Gear: Editor's Note. 373
• Wayne H. Enright, Mohamed S. Kamel: Automatic Partitioning of Stiff Systems and Exploiting the Resulting Structure. 374-385
• Ian Gladwell: Initial Value Routines in the NAG Library. 386-400
• Zahari Zlatev, Per Grove Thomsen: Automatic Solution of Differential Equations Based on the User of Linear Multistep Methods. 401-414
• Hans J. Stetter: Global Error Estimation in Adams PC-Codes. 415-430
• Elias N. Houstis, Theodore S. Papatheodorou: High-Order Fast Elliptic Equation Solvers. 431-441
• Linda Kaufman: Application of Dense Householder Transformation to a Sparse Matrix. 442-450
• Victor J. Rayward-Smith: On Computing the Smith Normal Form of an Integer Matrix. 451-456
• Roy H. Wampler: Solutions to Weighted Least Squares Problems by Modified Gram-Schmidt with Iterative Refinement. 457-465
• Walter Gautschi: A Computational Procedure for Incomplete Gamma Functions. 466-481
• Walter Gautschi: Algorithm 542: Incomplete Gamma Functions [S14]. 482-489
• Elias N. Houstis, Theodore S. Papatheodorou: Algorithm 543: FFT9, Fast Solution of Helmholtz-Type Partial Differential Equations [D3]. 490-493
• Roy H. Wampler: Algorithm 544: L2A and L2B, Weighted Least Squares Solutions by Modified Gram-Schmidt with Iterative Refinement [F4]. 494-499
• D. Fraser: Algorithm 545: An Optimized Mass Storage FFT [C6]. 500-517
• Richard P. Brent: Remark on ``Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]''. 518-519
• Burton Leathers: Remark on ``Algorithm 513: Analysis of In-Situ Transposition [F1]'' and Remark on ``Algorithm 467: Matrix Transposition in Place''. 520
• A. C. M. van Swieten, J. Th. M. de Hosson: Remark on ``Algorithm 475: Visible Surface Plotting Program''. 521-523
• Phyllis Fox: Remark on ``Algorithm 528: Framework for a Portable Library [Z]''. 524
• Carl de Boor: Corrigenda: ``Efficient Computer Manipulation of Tensor Products''. 525