default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Mathematical Software (TOMS), Volume 10, 1984
Volume 10, Number 1, March 1984
- Ian Robinson:
An Algorithm for Automatic Integration Over a Triangle Using Nonlinear Extrapolation. 1-16 - Elise de Doncker, Ian Robinson:
Algorithm 612: TRIEX: Integration Over a TRIangle Using Nonlinear EXtrapolation. 17-22 - C. William Gear, Ole Østerby:
Solving Ordinary Differential Equations with Discontinuities. 23-44 - Fred T. Krogh, Kris Stewart:
Asymptotic (h\rightarrow\infty) Absolute Stability for BDFs Applied to Stiff Differential Equations. 45-57 - Patrick W. Gaffney:
A Performance Evaluation of Some FORTRAN Subroutines for the Solution of Stiff Oscillatory Ordinary Differential Equations. 58-72 - Linda Kaufman:
Banded Eigenvalue Solvers on Vector Machines. 73-85 - Melanie L. Lenard, Michael Minkoff:
Randomly Generated Test Problems for Positive Definite Quadratic Programming. 86-96 - Cliff B. Jones:
A Significance Rule for Multiple-Precision Arithmetic. 97-107 - R. E. Haymond, James P. Jarvis, Douglas R. Shier:
Algorithm 613: Minimum Spanning Tree for Moderate Integer Weights. 108-111
Volume 10, Number 2, June 1984
- Henry D. Shapiro:
Increasing robustness in global adaptive quadrature through interval selection heuristics. 117-139 - Kris Sikorski, Frank Stenger:
Optimal quadratures in H(sub)p spaces. 140-151 - Kris Sikorski, Frank Stenger, J. Schwing:
Algorithm 614: a FORTRAN subroutine for numerical integration in H(sub)p. 152-157 - Louis B. Rall:
Differentiation in PASCAL-SC: type GRADIENT. 161-184 - Duncan H. Lawrie, Ahmed H. Sameh:
The computation and communication complexity of a parallel banded system solver. 185-195 - John K. Reid, Alan Jennings:
On solving almost block diagonal (staircase) linear systems. 196-215 - Ronald D. Armstrong, Philip O. Beck, Mabel Tam Kung:
Algorithm 615: the best subset of parameters in leasst absolute value regression. 202-206 - Petko Hr. Petkov
, Nikolai D. Christov, Mihail Mihaylov Konstantinov:
Remark on algorithm 590.: Fortran subroutines for computing deflating subspaces with specified spectrum. 207 - Fred T. Krogh:
ACM algorithms policy. 208-211
Volume 10, Number 3, September 1984
- Jack J. Dongarra, Stanley C. Eisenstat:
Squeezing the most out of an algorithm in CRAY FORTRAN. 219-230 - I. N. Molchanov, V. S. Zubatenko, L. D. Nikolenko, M. F. Yakovlev:
A program complex for solving systems of linear algebraic equations. 231-241 - Maria-Cecilia Rivara:
Design and data structure of fully adaptive, multigrid, finite-element software. 242-264 - John F. Monahan:
Algorithm 616: fast computation of the Hodges-Lehmann location estimator. 265-270 - Richard A. Kronmal, Arthur V. Peterson Jr.:
An acceptance-complement analogue of the mixture-plus-acceptance-rejection method for generating random variables. 271-281 - Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
Procedures for optimization problems with a mixture of bounds and general linear constraints. 282-298 - Filippo Aluffi-Pentini, Valerio Parisi, Francesco Zirilli:
A differential-equations algorithm for nonlinear equations. 299-316 - Filippo Aluffi-Pentini, Valerio Parisi, Francesco Zirilli:
Algorithm 617: DAFNE: a differential-equations algorithm for nonlinear equations. 317-324 - Eric Regener:
Multiprecision integer division examples using arbitrary radix. 325-328 - Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré:
Software for estimating sparse Jacobian matrices. 329-345 - Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré:
Algorithm 618: FORTRAN subroutines for estimating sparse Jacobian Matrices. 346-347 - Robert Piessens, Rudi Huysmans:
Algorithm 619: automatic numerical inversion of the Laplace transform [D5]. 348-353 - Robert Piessens:
Remark on algorithm 354: numerical inversion of Laplace transform. 354
Volume 10, Number 4, December 1984
- John R. Rice, Richard J. Hanson:
Algorithm 620: References and Keywords for Collected Algorithms of the ACM. 359-360 - Cheryl M. Black, Robert Burton, Thomas H. Miller:
The Need for an Industry Standard of Accuracy for Elementary-Function Programs. 361-366 - Amir Eiger, Kris Sikorski, Frank Stenger:
A bisection method for systems of nonlinear equations. 367-377 - Ben P. Sommeijer, P. J. van der Houwen:
Algorithm 621: Software with Low Storage Requirements for Two-Dimensional, Nonlinear, Parabolic Differential Equations. 378-396 - Alan Bundy:
A generalized interval package and its use for semantic checking. 397-409 - John R. Rice, Calvin J. Ribbens, William A. Ward:
Algorithm 622: A Simple Macroprocessor. 410-416 - Robert J. Renka:
Interpolation of data on the surface of a sphere. 417-436 - Robert J. Renka:
Algorithm 623: Interpolation on the Surface of a Sphere. 437-439 - Robert J. Renka:
Algorithm 624: Triangulation and Interpolation at Arbitrarily Distributed Points in the Plane. 440-442 - John R. Rice:
Numerical Computation with General Two-Dimensional Domains. 443-452 - John R. Rice:
Algorithm 625: A Two-Dimensional Domain Processor. 453-462 - Albrecht Preusser:
Computing contours by successive solution of quintic polynomial equations. 463-472 - Albrecht Preusser:
Algorithm 626: TRICP: a contour plot program triangular meshes. 473-475 - Burton S. Garbow:
Remark on "Algorithm 535: The QZ Algorithm to Solve the Generalized Eigenvalue Problem for Complex Matrices [F2]". 476 - Pedro Celis:
Remark: Corrections and Errors in John Ivie's Some MACSYMA Programs for Solving Recurrence Relations. 477-478
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-02 23:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
