ACM Transactions on Mathematical Software (TOMS), Volume 15, 1989

Volume 15, Number 1, March 1989

Iain S. Duff, Roger G. Grimes, John G. Lewis:
Sparse matrix test problems. 1-14
Jeff R. Cash:
A block 6(4) Runge-Kutta formula for nonstiff initial value problems. 15-28
Jeff R. Cash:
Algorithm 669: BRKF45: a FORTRAN subroutine for solving first-order systems of nonstiff initial value problems for ordinary differential equations. 29-30
R. W. Brankin, Ian Gladwell, J. R. Dormand, P. J. Prince, W. L. Seward:
Algorithm 670: a Runge-Kutta-Nyström code. 31-40
W. J. Cody, L. Stoltz:
Performance evaluation of programs for certain Bessel functions. 41-48
David F. Shanno, Kang-Hoh Phua:
Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming. 49-63
Michael D. Chang, Chou-Hong J. Chen, Michael Engquist:
An improved primal simplex variant for pure processing networks. 64-78
A. Preusser:
Algorithm 671: FARB-E-2D: fill area with bicubics on rectangles - a contour plot program. 79-89

Alexander P. Morgan, Andrew J. Sommese, Layne T. Watson:
Finding all isolated solutions to polynomial systems using HOMPACK. 93-122
T. N. L. Patterson:
An algorithm for generating interpolatory quadrature rules of the highest degree of precision with preassigned nodes for general weight functions. 123-136
T. N. L. Patterson:
Algorithm 672: generation of interpolatory quadrature rules of the highest degree of precision with preassigned nodes for general weight functions. 137-143
Ping Tak Peter Tang:
Table-driven implementation of the exponential function in IEEE floating-point arithmetic. 144-157
Jeffrey Scott Vitter:
Algorithm 673: Dynamic Huffman coding. 158-167
Nicholas J. Higham:
Algorithm 674: Fortran codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation. 168
Fred T. Krogh:
ACM Algorithms Policy. 169-172

Calvin J. Ribbens:
A fast adaptive grid scheme for elliptic partial differential equations. 179-197
Joseph W. H. Liu:
A graph partitioning algorithm by node separators. 198-219
Nezam Mahdavi-Amiri, Richard H. Bartels:
Constrained nonlinear least squares: an exact penalty approach with projected structured quasi-Newton updates. 220-242
M. Vanbegin, M. Verhaegen:
Algorithm 675: Fortran subroutines for computing the square root covariance filter and square root information filter in dense or Hessenberg forms. 243-256
V. Dadurkevicius:
Remark on algorithm 587. 257-261
A. Buckley:
Remark on algorithm 630. 262-274
Paul D. Domich:
Residual hermite normal form computations. 275-286
Wayne H. Enright, John D. Pryce:
Corrigenda: "Two FORTRAN Packages for Assessing Initial Value Methods". 287
D. Le:
Corrigenda: "An Efficient Derivative-Free Method for Solving Nonlinear Equations". 287
Angelo Corana, Claudio Martini, Sandro Ridella:
Corrigenda: "Minimizing Multimodal Functions of Continuous Variables with the 'Simulated Annealing' Algorithm". 287

Cleve Ashcraft, Roger Grimes:
The influence of relaxed supernode partitions on the multifrontal method. 291-309
Joseph W. H. Liu:
The multifrontal method and paging in sparse Cholesky factorization. 310-325
William F. Mitchell:
A comparison of adaptive refinement techniques for elliptic problems. 326-347
Paul T. Boggs, Janet R. Donaldson, Richard H. Byrd, Robert B. Schnabel:
Algorithm 676: ODRPACK: software for weighted orthogonal distance regression. 348-364
Laura Bacchelli Montefusco, Giulio Casciola:
Algorithm 677 C¹ surface interpolation. 365-374
George F. Corliss, Gary Krenz:
Indefinite integration with validation. 375-393
Voratas Kachitvichyanukul, Bruce W. Schmeiser:
Algorithm 678: BTPEC: sampling from the binomial distribution. 394-397

Last update Sat May 18 20:59:46 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page