Contents of Transactions on Mathematical Software
Contents of Transactions on Mathematical Software
This file contains tables of contents from all issues of Transactions on Mathematical Software. This information is taken from the TOMS WWW page, where additional information related to the journal can be found. The tags preceding each article are those found in the TOMS BibTeX bibliography developed as part of the BibNet Project. Click on these tags to retrieve the corresponding bibliographic records.
[Rice:1975:PS]
John R. Rice,
Purpose and Scope,
pp. 1-3.
[Anonymous:1975:ADS]
Algorithms Distribution Service,
p. 4.
[Fosdick:1975:AP]
Lloyd D. Fosdick,
Algorithms Policy,
pp. 5-6.
[Anonymous:1975:PMS]
Papers from Mathematical Software II,
pp. 7-12.
[Cody:1975:FPS]
W. J. Cody,
The FUNPACK Package of Special Function Subroutines,
pp. 13-25.
[Jenkins:1975:PTP]
M. A. Jenkins and J. F. Traub,
Principles for Testing Polynomial Zerofinding Programs,
pp. 26-34.
[Parlett:1975:ICC]
B. N. Parlett and Y. Wang,
The Influence of the Compiler on the Cost of Mathematical Software---in Particular on the Cost of Triangular Factorization,
pp. 35-46.
[Glover:1975:RWA]
Fred Glover and Darwin Klingman,
Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently,
pp. 47-55.
[Ng:1975:CCM]
Edward W. Ng,
A Comparison of Computational Methods and Algorithms for the Complex Gamma Function,
pp. 56-70.
[Byrne:1975:PNS]
G. D. Byrne and A. C. Hindmarsh,
A Polyalgorithm for the Numerical Solution of Ordinary Differential Equations,
pp. 71-96.
[Powell:1975:VUM]
M. J. D. Powell,
A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives,
pp. 97-107.
[Miller:1975:SRA]
Webb Miller,
Software for Roundoff Analysis,
pp. 108-128.
[Malcolm:1975:LVG]
Michael A. Malcolm and R. Bruce Simpson,
Local Versus Global Strategies for Adaptive Quadrature,
pp. 129-146.
[Stoutemyer:1975:AOU]
David R. Stoutemyer,
Analytical Optimization Using Computer Algebraic Manipulation,
pp. 147-164.
[Barinka:1975:SEC]
Lawrence L. Barinka,
Some Experience with Constructing, Testing, and Certifying a Standard Mathematical Subroutine Library,
pp. 165-177.
[Jenkins:1975:AZR]
M. A. Jenkins,
Algorithm 493: Zeros of a Real Polynomial [C2],
pp. 178-189.
[Rice:1975:SPP]
John R. Rice,
Software Package Policy,
pp. 193-195.
[Bailey:1975:UAM]
Carl B. Bailey and Rondall E. Jones,
Usage and Argument Monitoring of Mathematical Library Routines,
pp. 196-209.
[George:1975:ARR]
James E. George,
Algorithms to Reveal the Representation of Characters, Integers, and Floating-Point Numbers,
pp. 210-216.
[Aird:1975:CAU]
T. J. Aird and Robert E. Lynch,
Computable Accurate Upper and Lower Error Bounds for Approximate Solutions of Linear Algebraic Systems,
pp. 217-231.
[Sincovec:1975:SNP]
Richard F. Sincovec and Niel K. Madsen,
Software for Nonlinear Partial Differential Equations,
pp. 232-260.
[Sincovec:1975:APS]
Richard F. Sincovec and Niel K. Madsen,
Algorithm 494: PDEONE, Solutions of Systems of Partial Differential Equations [D3],
pp. 261-263.
[Barrodale:1975:ASO]
I. Barrodale and C. Phillips,
Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4],
pp. 264-270.
[Kaufman:1975:ALA]
Linda Kaufman,
Algorithm 496: The LZ Algorithm to Solve the Generalized Eigenvalue Problem for Complex Matrices [F2],
pp. 271-281.
[Skovgaard:1975:RBF]
Ove Skovgaard,
Remark on ``Algorithm 236: Bessel Functions of the First Kind [S17]'',
pp. 282-284.
(See [Gautschi:1964:BFF].)
[Feinstein:1975:RMT]
Robert Feinstein,
Remark on ``Algorithm 483: Masked Three-Dimensional Plot Program with Rotations [J6]'',
p. 285.
(See [Watkins:1974:MTD].)
[Misra:1975:RG]
Jayadev Misra,
Remark on ``Algorithm 246: Graycode [Z]'',
p. 285.
(See [Boothroyd:1964:G, Er:1985:RG].)
[Stone:1975:PTE]
H. Stone,
Parallel Tridiagonal Equation Solvers,
pp. 289-307.
[Lambiotte:1975:STL]
Jules J. Lambiotte and Robert G. Voigt,
The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer,
pp. 308-329.
[Bus:1975:TEA]
J. C. P. Bus and T. J. Dekker,
Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function,
pp. 330-345.
[Norman:1975:CFP]
A. C. Norman,
Computing with Formal Power Series,
pp. 346-356.
[Neves:1975:AIF]
Kenneth W. Neves,
Automatic Integration of Functional Differential Equations: An Approach,
pp. 357-368.
[Neves:1975:AAI]
Kenneth W. Neves,
Algorithm 497: Automatic Integration of Functional Differential Equations [D2],
pp. 369-371.
[Prince:1975:AAF]
P. J. Prince,
Algorithm 498: Airy Functions Using Chebyshev Series Approximations,
pp. 372-379.
(See also [Razaz:1981:RAF].)
[Lewis:1975:CPF]
John Gregg Lewis,
Certification of ``Algorithm 349: Polygamma Functions with Arbitrary Precision,
pp. 380-382.
[Bromage:1975:CVS]
Gordon E. Bromage,
Certification of ``Algorithm 475: Visible Surface Plotting Program [J6]'',
pp. 381-382.
[Rice:1976:PAA]
John R. Rice,
Parallel Algorithms for Adaptive Quadrature III. Program Correctness,
pp. 1-30.
[Griss:1976:ASS]
Martin L. Griss,
The Algebraic Solution of Sparse Linear Systems via Minor Expansion,
pp. 31-49.
[Duris:1976:GCP]
Charles S. Duris,
Generating and Compounding Product-Type Newton-Coates Quadrature Formulas,
pp. 50-58.
[Bays:1976:IPR]
Carter Bays and S. D. Durham,
Improving a Poor Random Number Generator,
pp. 59-64.
[Lyness:1976:CNA]
J. N. Lyness and J. J. Kaganove,
Comments on the Nature of Automatic Quadrature Routines,
pp. 65-81.
[Kinsner:1976:AES]
W. Kinsner and E. Della Torre,
Algorithm 499: An Efficient Scanning Technique [Z],
pp. 82-86.
[Shanno:1976:AMU]
D. F. Shanno and K. H. Phua,
Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4],
pp. 87-94.
[Simpson:1976:AFT]
Joseph C. Simpson,
Algorithm 501: Fortran Translation of Algorithm 409, Discrete Chebychev Curve Fit [E2],
pp. 95-97.
[Kubicek:1976:ADS]
Milan Kubícek,
Algorithm 502: Dependence of Solution of Nonlinear Systems on a Parameter [C5],
pp. 98-107.
[Boulton:1976:REP]
D. M. Boulton,
Remark on ``Algorithm 434: Exact Probabilities for R x C Contingency Tables [G2]'',
p. 108.
(See [March:1972:EPT].)
[Duta:1976:RVS]
Lucian D. Duta,
Remark on ``Algorithm 475: Visible Surface Plotting Program [J6]'',
pp. 109-110.
(See [Wright:1974:VSP].)
[White:1976:RMS]
G. M. White and S. Goudreau and J. L. Legros,
Remark on ``Algorithm 479: A Minimal Spanning Tree Clustering Method [Z]'',
pp. 110-111.
(See [Page:1974:MST].)
[Pomeranz:1976:REC]
J. Pomeranz,
Remark on ``Algorithm 487: Exact Cumulative Distribution of the Kolmogorov-Smirnov Statistic for Small Samples [S14]'',
p. 111.
(See [Pomeranz:1974:ECD].)
[Morris:1976:RDF]
Robert Morris,
Remark on ``Algorithm 490: The Dilogarithm Function of a Real Argument [S22]'',
p. 112.
(See [Grinsberg:1975:DFR].)
[Rice:1976:TPS]
John R. Rice,
TOMS Policy Statement: The Rights of Program Authors in the Evaluation of Programs,
pp. 113-114.
[Ford:1976:DSN]
B. Ford and D. K. Sayers,
Developing a Single Numerical Algorithms Library for Different Machine Ranges,
pp. 115-131.
[Paul:1976:SEF]
George Paul and M. Wayne Wilson,
Should the Elementary Function Library Be Incorporated Into Computer Instruction Sets?,
pp. 132-142.
[Janko:1976:LIS]
Wolfgang Janko,
A List Insertion Sort for Keys With Arbitrary Key Distribution,
pp. 143-153.
[Atkinson:1976:APL]
Kendall Atkinson,
An Automatic Program for Linear Fredholm Integral Equations of the Second Kind,
pp. 154-171.
[Shampine:1976:GEE]
L. F. Shampine and H. A. Watts,
Global Error Estimates for Ordinary Differential Equations,
pp. 172-186.
[Ericksen:1976:ICP]
J. H. Ericksen and R. Wilhelmson,
Implementation of a Convective Problem Requiring Auxiliary Storage,
pp. 187-195.
[Atkinson:1976:AAP]
Kendall Atkinson,
Algorithm 503: An Automatic Program for Fredholm Integral Equations of the Second Kind [D5],
pp. 196-199.
[Shampine:1976:AGG]
L. F. Shampine and H. A. Watts,
Algorithm 504: GERK: Global Error Estimation For Ordinary Differential Equations [D],
pp. 200-203.
[Janko:1976:ALI]
Wolfgang Janko,
Algorithm 505: A List Insertion Sort for Keys with Arbitrary Key Distribution [S20],
pp. 204-206.
[Pike:1976:RIB]
Malcolm C. Pike and Jennie SooHoo,
Remark on ``Algorithm 179: Incomplete Beta Ratio [S14]'',
pp. 207-208.
(See [Ludwig:1963:IBR].)
[Anderson:1976:RIS]
Michael R. Anderson,
Remark on ``Algorithm 433: Interpolation and Smooth Curve Fitting Based on Local Procedures [E2]'',
p. 208.
(See [Akima:1972:ISC].)
[Wyatt:1976:PEP]
W. T. Wyatt, Jr. and D. W. Lozier and D. J. Orser,
A Portable Extended Precision Arithmetic Package and Library With Fortran Precompiler,
pp. 209-231.
[Gentleman:1976:AAC]
W. M. Gentleman and S. C. Johnson,
Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries,
pp. 232-241.
[Barwell:1976:CAS]
Victor Barwell and Alan George,
A Comparison of Algorithms for Solving Symmetric Indefinite Systems of Linear Equations,
pp. 242-251.
[Bartels:1976:HIU]
Richard Bartels and Alec Steingart,
Hermite Interpolation Using a Triangular Polynomial Basis,
pp. 252-256.
[Hall:1976:NSS]
C. A. Hall and R. W. Luczak and A. G. Serdy,
Numerical Solution of Steady State Heat Flow Problems Over Curved Domains,
pp. 257-274.
[Stewart:1976:AHE]
G. W. Stewart,
Algorithm 506: HQR3 and EXCHNG: Fortran Subroutines for Calculating and Ordering the Eigenvalues of a Real Upper Hessenberg Matrix [F2],
pp. 275-280.
(See also [Flamm:1982:RHE].)
[Herriot:1976:APQ]
John G. Herriot and Christian H. Reinsch,
Algorithm 507: Procedures for Quintic Natural Spline Interpolation [E1],
pp. 281-289.
(See also [Hanson:1982:RPQ].)
[Loeser:1976:SAQ]
Rudolf Loeser,
Survey on Algorithms 347, 426, and Quicksort,
pp. 290-299.
[Davies:1976:RRF]
Alan M. Davies,
Remark on ``Algorithm 450: Rosenbrock Function Minimization [E4]'',
pp. 300-301.
(See [MacHura:1973:RFM].)
[Brown:1976:RAS]
Theodore Brown,
Remark on ``Algorithm 489: The Algorithm SELECT---for Finding the ith Smallest of n Elements [M1]'',
pp. 301-304.
(See [Floyd:1975:ASF].)
[Pavlidis:1976:UAP]
Theodosios Pavlidis,
The Use of Algorithms of Piecewise Approximations for Picture Processing Applications,
pp. 305-321.
[Gibbs:1976:CSB]
Norman E. Gibbs and William G. Poole Jr. and Paul K. Stockmeyer,
A Comparison of Several Bandwidth and Profile Reduction Algorithms,
pp. 322-330.
[Mahendrarajah:1976:CTA]
A. Mahendrarajah and F. Fiala,
A Comparison of Three Algorithms for Linear Zero-One Programs,
pp. 331-334.
[Weinberger:1976:FPA]
P. J. Weinberger and L. P. Rothschild,
Factoring Polynomials Over Algebraic Number Fields,
pp. 335-350.
[Pinkert:1976:EMF]
James R. Pinkert,
An Exact Method for Finding the Roots of a Complex Polynomial,
pp. 351-363.
[Rubin:1976:PI]
Frank Rubin,
Partition of Integers,
pp. 364-374.
[Crane:1976:AMB]
H. L. Crane Jr. and Norman E. Gibbs and William G. Poole Jr. and Paul K. Stockmeyer,
Algorithm 508: Matrix Bandwidth and Profile Reduction [F1],
pp. 375-377.
(See also [Lewis:1982:RMB].)
[Gibbs:1976:AHP]
Norman E. Gibbs,
Algorithm 509: A Hybrid Profile Reduction Algorithm [F1],
pp. 378-387.
(See also [Lewis:1982:RMB].)
[Wilson:1976:APL]
D. G. Wilson,
Algorithm 510: Piecewise Linear Approximation to Tabulated Data [E2],
pp. 388-391.
[Ito:1976:RIT]
M. R. Ito,
Remark on ``Algorithm 284: Interchange of Two Blocks of Data [K2]'',
pp. 392-393.
(See [Fletcher:1966:ITB].)
[Lozy:1976:RCS]
Mohamed el Lozy,
Remark on ``Algorithm 299: Chi-Squared Integral [S15]'',
pp. 393-395.
(See [Hill:1967:CSI, Hill:1985:RCS].)
[Koppelaar:1976:RNI]
Henk Koppelaar and Peter Molenaar,
Remark on ``Algorithm 486: Numerical Inversion of Laplace Transform [D5]'',
pp. 395-396.
(See [Veillon:1974:NIL].)
[Kaufman:1976:RLA]
Linda Kaufman,
Remark on ``Algorithm 496: The LZ Algorithm to Solve the Generalized Eigenvalue Problem for Complex Matrices [F2]'',
p. 396.
(See [Kaufman:1975:ALA].)
[McClellan:1977:ESL]
Michael T. McClellan,
The Exact Solution of Linear Equations with Rational Function Coefficients,
pp. 1-25.
[Stoutemyer:1977:AEA]
David R. Stoutemyer,
Automatic Error Analysis Using Computer Algebraic Manipulation,
pp. 26-43.
[Shampine:1977:SND]
L. F. Shampine,
Stiff and Nonstiff Differential Equation Solvers, II: Detecting Stiffness with Runge-Kutta Methods,
pp. 44-53.
[Tran-Thong:1977:FPF]
Tran-Thong and Bede Liu,
Floating Point Fast Fourier Transform Computation Using Double Precision Floating Point Accumulators,
pp. 54-59.
[Gonzalez:1977:EAK]
Teofilo Gonzalez and Sartaj Sahni and W. R. Franta,
An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests,
pp. 60-64.
[Kaufman:1977:STQ]
L. Kaufman,
Some Thoughts on the QZ Algorithm for Solving the Generalized Eigenvalue Problem,
pp. 65-75.
[Amos:1977:CSI]
D. E. Amos and S. L. Daniel and M. K. Weston,
CDC 6600 Subroutines IBESS and JBESS for Bessel Functions I_\nu(x) and J_\nu(x), x\ge0,\nu\ge0,
pp. 76-92.
[Amos:1977:ACS]
D. E. Amos and S. L. Daniel and M. K. Weston,
Algorithm 511: CDC 6600 Subroutines IBESS and JBESS for Bessel Functions I_\nu(x) and J_\nu(x), x \ge 0, \nu \ge 0 [S18],
pp. 93-95.
[Benson:1977:ANA]
A. Benson and D. J. Evans,
Algorithm 512: A Normalized Algorithm for Solution of the Positive Definite Symmetric Quindiagonal Systems of Linear Equations [F4],
pp. 96-103.
[Cate:1977:AAS]
Esko G. Cate and David W. Twigg,
Algorithm 513: Analysis of In-Situ Transposition [F1],
pp. 104-110.
[Veillon:1977:RNI]
Fran\ccoise Veillon,
Remark on ``Algorithm 486: Numerical Inversion of Laplace Transform'',
p. 111.
(See [Veillon:1974:NIL].)
[Dunham:1977:RMU]
Charles Dunham,
Remark on ``Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]'',
p. 112.
(See [Shanno:1976:AMU].)
[Aird:1977:PMS]
Thomas J. Aird,
Portability of Mathematical Software Coded in Fortran,
pp. 113-127.
[Stoutemyer:1977:ASI]
David R. Stoutemyer,
Analytically Solving Integral Equations by Using Computer Algebra,
pp. 128-146.
[McClellan:1977:CAE]
Michael T. McClellan,
A Comparison of Algorithms for the Exact Solution of Linear Equations,
pp. 147-158.
[Farden:1977:SSS]
David C. Farden,
The Solution of a Special Set of Hermitian Toeplitz Linear Equations,
pp. 159-163.
[Ichida:1977:CFO]
Kozo Ichida and Takeshi Kiyono and Fujiichi Yoshimoto,
Curve Fitting by a One-Pass Method With a Piecewise Cubic Polynomial,
pp. 164-174.
[Ellis:1977:ANM]
T. M. R. Ellis and D. H. McLain,
Algorithm 514: A New Method of Cubic Curve Fitting Using Local Data [E2],
pp. 175-179.
[Buckles:1977:AGV]
B. P. Buckles and M. Lybanon,
Algorithm 515: Generation of a Vector from the Lexicographical Index [G6],
pp. 180-182.
[McKean:1977:AAO]
J. W. McKean and T. A. Ryan, Jr.,
Algorithm 516: An Algorithm for Obtaining Confidence Intervals and Point Estimates Based on Ranks in the Two Sample Location Problem [G1],
pp. 183-185.
[Chan:1977:APC]
S. P. Chan and R. Feldman and B. N. Parlett,
Algorithm 517: A Program for Computing the Condition Numbers of Matrix Eigenvalues Without Computing Eigenvectors [F2],
pp. 186-203.
[Mackay:1977:RPT]
M. Mackay and J. E. Radue,
Remark on ``Some Performance Tests of `Quicksort' and Descendants'',
p. 204.
(See [Loeser:1974:SPT].)
[Jansen:1977:RLF]
J. K. M. Jansen,
Remark on ``Algorithm 259: Legendre Functions for Arguments Larger than One'',
pp. 204-205.
(See [Gautschi:1965:LFA].)
[Friedman:1977:AFB]
Jerome H. Friedman and Jon Louis Bentley and Raphael Ari Finkel,
An Algorithm for Finding Best Matches in Logarithmic Expected Time,
pp. 209-226.
[Ito:1977:MRP]
Tetsuro Ito and Makoto Kizawa,
The Matrix Rearrangement Procedure for Graph-Theoretical Algorithms and Its Application to the Generation of Fundamental Cycles,
pp. 227-231.
[Cody:1977:CRF]
W. J. Cody and Rose M. Motley and L. Wayne Fullerton,
The Computation of Real Fractional Order Bessel Functions of the Second Kind,
pp. 232-239.
[Gautschi:1977:ERI]
Walter Gautschi,
Evaluation of Repeated Integrals of the Coerror Function,
pp. 240-252.
[Walker:1977:EMG]
Alastair J. Walker,
An Efficient Method for Generating Discrete Random Variables with General Distributions,
pp. 253-256.
[Kinderman:1977:CGR]
A. J. Kinderman and J. F. Monahan,
Computer Generation of Random Variables Using the Ratio of Uniform Deviates,
pp. 257-260.
[Cohen:1977:SSF]
Jacques Cohen and Joel Katcoff,
Symbolic Solution of Finite-Difference Equations,
pp. 261-271.
[Fateman:1977:ADC]
Richard J. Fateman,
An Algorithm for Deciding the Convergence of the Rational Iteration x_n+1 = f(x_n),
pp. 272-278.
[Hill:1977:AIB]
G. W. Hill,
Algorithm 518: Incomplete Bessel Function I_0. The Von Mises Distribution [S14],
pp. 279-284.
[Kallman:1977:ATA]
Ralph Kallman,
Algorithm 519: Three Algorithms for Computing Kolmogorov-Smirnov Probabilities with Arbitrary Boundaries and a Certification of Algorithm 487 [S14],
pp. 285-294.
[Weglarz:1977:AAR]
Jan Weglarz and Jacek Blazewicz and Wojciech Cellary and Roman Slowinski,
Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H],
pp. 295-300.
[Gautschi:1977:ARI]
Walter Gautschi,
Algorithm 521: Repeated Integrals of the Coerror Function [S15],
pp. 301-302.
[Sipala:1977:RSM]
Paolo Sipala,
Remark on ``Algorithm 408: A Sparse Matrix Package (Part I) [F4]'',
p. 303.
(See [McNamee:1971:SMP].)
[Tenney:1977:RTO]
Dennis Tenney,
Remark on ``Algorithm 219: Topological Ordering for PERT Networks'',
p. 303.
(See [Kase:1963:TOP].)
[Hillstrom:1977:STA]
Kenneth E. Hillstrom,
A Simulation Test Approach to the Evaluation of Nonlinear Optimization Algorithms,
pp. 305-315.
[Powell:1977:PQA]
M. J. D. Powell and M. A. Sabin,
Piecewise Quadratic Approximations on Triangles,
pp. 316-325.
[Skeel:1977:BLM]
Robert D. Skeel and Antony K. Kong,
Blended Linear Multistep Methods,
pp. 326-345.
[Payne:1977:NRN]
W. H. Payne,
Normal Random Numbers: Using Machine Analysis To Choose the Best Algorithm,
pp. 346-358.
[Boyce:1977:IPF]
William A. Boyce,
An Improved Program for the Full Steiner Tree Problem,
pp. 359-385.
[Cabay:1977:CTE]
S. Cabay and T. P. L. Lam,
Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations,
pp. 386-397.
[Eddy:1977:NCH]
William F. Eddy,
A New Convex Hull Algorithm for Planar Sets,
pp. 398-403.
[Cabay:1977:AEC]
S. Cabay and T. P. L. Lam,
Algorithm 522: ESOLVE, Congruence Techniques for the Exact Solution of Integer Systems of Linear Equations [F4],
pp. 404-410.
[Eddy:1977:ACN]
W. F. Eddy,
Algorithm 523: CONVEX, A New Convex Hull Algorithm for Planar Sets [Z],
pp. 411-412.
[Dinkel:1978:SAP]
John J. Dinkel and Gary A. Kochenberger and S. N. Wong,
Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects,
pp. 1-14.
[Blue:1978:PFP]
James L. Blue,
A Portable Fortran Program to Find the Euclidean Norm of a Vector,
pp. 15-23.
[Ivie:1978:SMP]
John Ivie,
Some MACSYMA Programs for Solving Recurrence Relations,
pp. 24-33.
(See also [Celis:1984:RCE].)
[Lasdon:1978:DTG]
L. S. Lasdon and A. D. Waren and A. Jain and M. Ratner,
Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming,
pp. 34-50.
[Tsao:1978:MNI]
Nai-Kuan Tsao and Rose Marie Prior,
On Multipoint Numerical Interpolation,
pp. 51-56.
[Brent:1978:FMP]
Richard P. Brent,
A Fortran Multiple-Precision Arithmetic Package,
pp. 57-70.
[Brent:1978:AMF]
Richard P. Brent,
Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1],
pp. 71-81.
(See also [Brent:1979:RMF, Brent:1980:AIB].)
[Rice:1978:AAA]
John R. Rice,
Algorithm 525: ADAPT, Adaptive Smooth Curve Fitting [E2],
pp. 82-94.
[Futrell:1978:RTA]
R. Futrell,
Remark on ``Fortran Translation of Algorithm 409: Discrete Chebychev Curve Fit [E2]'',
p. 95.
(See [Simpson:1976:AFT].)
[Skovgaard:1978:RCE]
Ove Skovgaard,
Remark on ``Algorithm 149: Complete Elliptic Integral [S21]'',
p. 95.
(See [Merner:1962:CEI].)
[Krogh:1978:AP]
Fred T. Krogh,
Algorithms Policy,
pp. 97-99.
[Ford:1978:PET]
Brian Ford,
Parametrization of the Environment for Transportable Numerical Software,
pp. 100-103.
[Fox:1978:PMS]
P. A. Fox and A. D. Hall and N. L. Schryer,
The PORT Mathematical Subroutine Library,
pp. 104-126.
[Enright:1978:IEM]
W. H. Enright,
Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations,
pp. 127-136.
[Duff:1978:ITA]
I. S. Duff and J. K. Reid,
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix,
pp. 137-147.
[Akima:1978:MBI]
Hiroshi Akima,
A Method of Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points,
pp. 148-159.
[Akima:1978:ABI]
Hiroshi Akima,
Algorithm 526: Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points [E1],
pp. 160-164.
(See also [Akima:1979:RBI, Preusser:1985:RBI].)
[Bank:1978:AFI]
Randolph E. Bank,
Algorithm 527: A Fortran Implementation of the Generalized Marching Algorithm [D3],
pp. 165-176.
[Fox:1978:AFP]
P. A. Fox and A. D. Hall and N. L. Schryer,
Algorithm 528: Framework for a Portable Library [Z],
pp. 177-188.
[Duff:1978:APB]
I. S. Duff and J. K. Reid,
Algorithm 529: Permutations To Block Triangular Form [F1],
pp. 189-192.
[Bailey:1978:ASS]
P. B. Bailey and M. K. Gordon and L. F. Shampine,
Automatic Solution of the Sturm-Liouville Problem,
pp. 193-208.
[Polak:1978:TPP]
S. J. Polak and J. Schrooten and C. Barneveld Binkhuysen,
TEDDY2, A Program Package for Parabolic Composite Region Problems,
pp. 209-227.
[Larson:1978:ECE]
John Larson and Ahmed Sameh,
Efficient Calculation of the Effects of Roundoff Errors,
pp. 228-236.
[Brown:1978:SPA]
W. S. Brown,
The Subresultant PRS Algorithm,
pp. 237-249.
[Gustavson:1978:TFA]
Fred G. Gustavson,
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition,
pp. 250-269.
[Chen:1978:PPB]
S. C. Chen and D. J. Kuck and A. H. Sameh,
Practical Parallel Band Triangular Systems Solvers,
pp. 270-277.
[Ward:1978:ECS]
R. C. Ward and L. J. Gray,
Eigensystem Computation for Skew-Symmetric and a Class of Symmetric Matrices,
pp. 278-285.
[Ward:1978:AAC]
R. C. Ward and L. J. Gray,
Algorithm 530: An Algorithm for Computing the Eigensystem of Skew-Symmetric Matrices and a Class of Symmetric Matrices [F2],
pp. 286-289.
[Snyder:1978:ACP]
William V. Snyder,
Algorithm 531: Contour Plotting [J6],
pp. 290-294.
[Coleman:1978:RSN]
John P. Coleman,
Remark on ``Algorithm 49: Spherical Neumann Function'',
p. 295.
(See [Herndon:1961:SNF].)
[Gustavson:1978:RSM]
Fred G. Gustavson,
Remark on ``Algorithm 408: A Sparse Matrix Package (Part I) [F4]'',
p. 295.
(See [McNamee:1971:SMP].)
[Schoene:1978:RMI]
Andrew Y. Schoene,
Remark on ``Algorithm 435: Modified Incomplete Gamma Function [S14]'',
pp. 296-304.
(See [Fullerton:1972:MIG].)
[Baker:1978:SAC]
Christopher T. H. Baker and Malcolm S. Keech,
Stability Analysis of Certain Runge-Kutta Procedures for Volterra Integral Equations,
pp. 305-315.
[Fairweather:1978:IRQ]
Graeme Fairweather,
An Investigation of Romberg Quadrature,
pp. 316-322.
[Shampine:1978:SPA]
Lawrence F. Shampine,
Stability Properties of Adams Codes,
pp. 323-329.
[Sherman:1978:ASG]
Andrew H. Sherman,
Algorithms for Sparse Gaussian Elimination with Partial Pivoting,
pp. 330-338.
[Tendler:1978:SSI]
Joel M. Tendler and Theodore A. Bickart and Zdenek Picel,
A Stiffly Stable Integration Process Using Cyclic Composite Methods,
pp. 339-368.
[Miller:1978:SRA]
Webb Miller and David Spooner,
Software for Roundoff Analysis, II,
pp. 369-387.
[Miller:1978:ASR]
Webb Miller and David Spooner,
Algorithm 532: Software for Roundoff Analysis [Z],
pp. 388-390.
[Sherman:1978:ANF]
Andrew H. Sherman,
Algorithm 533: NSPIV, A Fortran Subroutine for Sparse Gaussian Elimination with Partial Pivoting [F4],
pp. 391-398.
[Tendler:1978:ASS]
Joel M. Tendler and Theodore A. Bickart and Zdenek Picel,
Algorithm 534: STINT: STiff (differential equations) INTegrator [D2],
pp. 399-403.
[Garbow:1978:AQA]
Burton S. Garbow,
Algorithm 535: The QZ Algorithm to Solve the Generalized Eigenvalue Problem for Complex Matrices [F2],
pp. 404-410.
(See also [Garbow:1982:RQA, Garbow:1984:RQA].)
[Amos:1978:ECS]
Donald E. Amos,
Erratum: ``Algorithm 511: CDC 6600 Subroutines IBESS and JBESS for Bessel Functions I_\nu(x) and J_\nu(x), x\ge0,\nu\ge0 [S18]'',
p. 411.
(See [Amos:1977:ACS].)
[Zave:1979:DAP]
Pamela Zave and Werner C. Rheinboldt,
Design of an Adaptive, Parallel Finite-Element System,
pp. 1-17.
[Duff:1979:SDF]
I. S. Duff and J. K. Reid,
Some Design Features of a Sparse Matrix Code,
pp. 18-35.
[Proskurowski:1979:NSH]
Wlodzimierz Proskurowski,
Numerical Solution of Helmholtz's Equation by Implicit Capacitance Matrix Methods,
pp. 36-49.
[Yohe:1979:SIA]
J. M. Yohe,
Software for Interval Arithmetic: A Reasonably Portable Package,
pp. 50-63.
[More:1979:NSN]
Jorge J. Moré and Michel Y. Cosnard,
Numerical Solution of Nonlinear Equations,
pp. 64-85.
[Kahaner:1979:EAD]
David K. Kahaner and Mark B. Wells,
An Experimental Algorithm for N-Dimensional Adaptive Quadrature,
pp. 86-96.
[Knoble:1979:EOW]
H. D. Knoble and C. Forney, Jr. and F. S. Bader,
An Efficient One-Way Enciphering Algorithm,
pp. 97-107.
[Knoble:1979:AEO]
H. D. Knoble,
Algorithm 536: An Efficient One-Way Enciphering Algorithm [Z],
pp. 108-111.
[Leeb:1979:ACV]
Walter R. Leeb,
Algorithm 537: Characteristic Values of Mathieu's Differential Equation,
pp. 112-117.
[Nikolai:1979:AEE]
Paul J. Nikolai,
Algorithm 538: Eigenvectors and Eigenvalues of Real Generalized Symmetric Matrices by Simultaneous Iteration [F2],
pp. 118-125.
[Krogh:1979:AAP]
Fred T. Krogh,
ACM Algorithms Policy,
pp. 129-131.
[Schrage:1979:MPF]
Linus Schrage,
A More Portable Fortran Random Number Generator,
pp. 132-138.
[George:1979:DUI]
Alan George and Joseph W. H. Liu,
The Design of a User Interface for a Sparse Matrix Package,
pp. 139-162.
[Payne:1979:CG]
W. H. Payne and F. M. Ives,
Combination Generators,
pp. 163-172.
[deBoor:1979:ECM]
Carl de Boor,
Efficient Computer Manipulation of Tensor Products,
pp. 173-182.
[Cleary:1979:AAF]
John Gerald Cleary,
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space,
pp. 183-192.
[Crowder:1979:RCE]
Harlan Crowder and Ron S. Dembo and John M. Mulvey,
On Reporting Computational Experiments with Mathematical Software,
pp. 193-203.
[Crary:1979:VPN]
Fred D. Crary,
A Versatile Precompiler for Nonstandard Arithmetics,
pp. 204-217.
[Geddes:1979:SCP]
K. O. Geddes,
Symbolic Computation of Padé Approximants,
pp. 218-233.
[Bogen:1979:ASI]
Richard A. Bogen,
Addendum to ``Analytically Solving Integral Equations by Using Computer Algebra'',
pp. 234-237.
[Lozy:1979:RSD]
Mohamed el Lozy,
Remark on ``Algorithm 395: Student's t-Distribution'' and Remark on ``Algorithm 396: Student's Quantiles [S14]'',
pp. 238-239.
(See [Hill:1970:SD, Hill:1970:SQ, Hill:1981:RSD, Hill:1985:RCS].)
[Geddes:1979:RCC]
K. O. Geddes,
Remark on ``Algorithm 424: Clenshaw-Curtis Quadrature [O1]'',
p. 240.
(See [Gentleman:1972:CCQ].)
[Anderson:1979:RBI]
M. R. Anderson,
Remark on ``Algorithm 474: Bivariate Interpolation and Smooth Surface Fitting Based on Local Procedures'',
p. 241.
(See [Akima:1974:BIS].)
[Akima:1979:RBI]
Hiroshi Akima,
Remark on ``Algorithm 526: Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points [E1]'',
pp. 242-243.
(See [Akima:1978:ABI, Preusser:1985:RBI].)
[Shampine:1979:SRR]
L. F. Shampine,
Storage Reduction for Runge-Kutta Codes,
pp. 245-250.
[Ehrlich:1979:SBE]
L. W. Ehrlich,
Solving the Biharmonic Equation on Irregular Regions,
pp. 251-258.
[Gill:1979:DSF]
Philip E. Gill and Walter Murray and Susan M. Picken and Margaret H. Wright,
The Design and Structure of a Fortran Program Library for Optimization,
pp. 259-283.
[George:1979:IPN]
Alan George and Joseph W. H. Liu,
An Implementation of a Pseudoperipheral Node Finder,
pp. 284-295.
[Bennett:1979:SPE]
James Michael Bennett and Robert Neff Bryan,
A Single-Point Exchange Algorithm for Approximating Functions of Two Variables,
pp. 296-307.
[Lawson:1979:BLA]
C. L. Lawson and R. J. Hanson and D. R. Kincaid and F. T. Krogh,
Basic Linear Algebra Subprograms for Fortran Usage,
pp. 308-323.
[Lawson:1979:ABL]
C. L. Lawson and R. J. Hanson and D. R. Kincaid and F. T. Krogh,
Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1],
pp. 324-325.
(See also [Dodson:1982:RBL, Dodson:1983:CRB, Hanson:1987:ATA, Louter-Nool:1988:ATA].)
[Madsen:1979:APG]
N. K. Madsen and R. F. Sincovec,
Algorithm 540: PDECOL, General Collocation Software for Partial Differential Equations [D3],
pp. 326-351.
(See also [Hopkins:1992:RPG].)
[Swartztrauber:1979:AEF]
Paul N. Swartztrauber and Roland A. Sweet,
Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3],
pp. 352-364.
[Steuerwalt:1979:CEF]
Michael Steuerwalt,
Certification of ``Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3],
pp. 365-371.
[Larson:1979:ECE]
John Larson,
Errata: ``Efficient Calculation of the Effects of Roundoff Errors'',
p. 372.
(See [Larson:1978:ECE].)
[Gear:1979:EN]
C. W. Gear,
Editor's Note,
p. 373.
[Enright:1979:APS]
W. H. Enright and M. S. Kamel,
Automatic Partitioning of Stiff Systems and Exploiting the Resulting Structure,
pp. 374-385.
[Gladwell:1979:IVR]
Ian Gladwell,
Initial Value Routines in the NAG Library,
pp. 386-400.
[Zlatev:1979:ASD]
Zahari Zlatev and Per Grove Thomsen,
Automatic Solution of Differential Equations Based on the User of Linear Multistep Methods,
pp. 401-414.
[Stetter:1979:GEE]
Hans J. Stetter,
Global Error Estimation in Adams PC-Codes,
pp. 415-430.
[Houstis:1979:HOF]
E. N. Houstis and T. S. Papatheodorou,
High-Order Fast Elliptic Equation Solvers,
pp. 431-441.
[Kaufman:1979:ADH]
L. Kaufman,
Application of Dense Householder Transformation to a Sparse Matrix,
pp. 442-450.
[Rayward-Smith:1979:CSN]
V. J. Rayward-Smith,
On Computing the Smith Normal Form of an Integer Matrix,
pp. 451-456.
[Wampler:1979:SWL]
Roy H. Wampler,
Solutions to Weighted Least Squares Problems by Modified Gram-Schmidt with Iterative Refinement,
pp. 457-465.
[Gautschi:1979:CPI]
Walter Gautschi,
A Computational Procedure for Incomplete Gamma Functions,
pp. 466-481.
[Gautschi:1979:AIG]
W. Gautschi,
Algorithm 542: Incomplete Gamma Functions [S14],
pp. 482-489.
[Houstis:1979:AFF]
E. N. Houstis and T. S. Papatheodorou,
Algorithm 543: FFT9, Fast Solution of Helmholtz-Type Partial Differential Equations [D3],
pp. 490-493.
[Wampler:1979:ALL]
Roy H. Wampler,
Algorithm 544: L2A and L2B, Weighted Least Squares Solutions by Modified Gram-Schmidt with Iterative Refinement [F4],
pp. 494-499.
[Fraser:1979:AOM]
D. Fraser,
Algorithm 545: An Optimized Mass Storage FFT [C6],
pp. 500-517.
[Brent:1979:RMF]
R. P. Brent,
Remark on ``Algorithm 524: MP, A Fortran Multiple-Precision Arithmetic Package [A1]'',
pp. 518-519.
(See [Brent:1978:AMF, Brent:1980:AIB].)
[Leathers:1979:RAS]
Burton L. Leathers,
Remark on ``Algorithm 513: Analysis of In-Situ Transposition [F1]'' and Remark on ``Algorithm 467: Matrix Transposition in Place'',
p. 520.
(See [Cate:1977:AAS, Brenner:1973:MTP].)
[Swieten:1979:RVS]
A. C. M. van Swieten and J. Th. M. de Hosson,
Remark on ``Algorithm 475: Visible Surface Plotting Program'',
pp. 521-523.
(See [Wright:1974:VSP].)
[Fox:1979:RFP]
Phyllis Fox,
Remark on ``Algorithm 528: Framework for a Portable Library [Z]'',
p. 524.
(See [Fox:1978:AFP].)
[deBoor:1979:CCM]
Carl de Boor,
Corrigenda: ``Efficient Computer Manipulation of Tensor Products'',
p. 525.
(See [deBoor:1979:ECM].)
[Cheung:1980:CCE]
To-Yat Cheung,
Computational Comparison of Eight Methods for the Maximum Network Flow Problem,
pp. 1-16.
[Ho:1980:CST]
James K. Ho and Etienne Loute,
A Comparative Study of Two Methods for Staircase Linear Problems,
pp. 17-30.
[Michaels:1980:MPG]
William M. Michaels and Richard P. O'Neill,
A Mathematical Program Generator MPGENR,
pp. 31-44.
[Chung:1980:ACF]
Won L. Chung,
Automatic Curve Fittings Using an Adaptive Local Algorithm,
pp. 45-57.
[Clark:1980:REV]
Gordon M. Clark,
Recursive Estimation of the Variance of the Sample Average,
pp. 58-67.
[Power:1980:ISU]
Leigh R. Power,
Internal Sorting Using a Minimal Tree Merge Strategy,
pp. 68-79.
[deBoor:1980:SPS]
Carl de Boor and Richard Weiss,
SOLVEBLOK: A Package for Solving Almost Block Diagonal Linear Systems,
pp. 80-87.
[deBoor:1980:AS]
Carl de Boor and Richard Weiss,
Algorithm 546: SOLVEBLOK [F4],
pp. 88-91.
[Duris:1980:AFR]
Charles S. Duris,
Algorithm 547: FORTRAN Routines for Discrete Cubic Spline Interpolation and Smoothing [E1], [E3],
pp. 92-103.
[Carpaneto:1980:ASA]
Giorgio Carpaneto and Paolo Toth,
Algorithm 548: Solution of the Assignment Problem [H],
pp. 104-111.
[Eckhardt:1980:AWE]
Ulrich Eckhardt,
Algorithm 549: Weierstrass' Elliptic Functions [S21],
pp. 112-120.
[Messner:1980:ASP]
A. M. Messner and G. Q. Taylor,
Algorithm 550: Solid Polyhedron Measure [Z],
pp. 121-130.
[Anonymous:1980:AAD]
ACM Algorithms Distribution Service Expanded,
pp. 131-132.
[Chan:1980:NLS]
Tony F. Chan and William M. Coughran, Jr. and Eric H. Grosse and Michael T. Heath,
A Numerical Library and Its Support,
pp. 135-145.
[Brent:1980:AIB]
Richard P. Brent and Judith A. Hooper and J. Michael Yohe,
An AUGMENT Interface for Brent's Multiple Precision Arithmetic Package,
pp. 146-149.
(See [Brent:1978:AMF, Brent:1979:RMF].)
[Kedem:1980:ADC]
Gershon Kedem,
Automatic Differentiation of Computer Programs,
pp. 150-165.
[Rheinboldt:1980:DSA]
Werner C. Rheinboldt and Charles K. Mesztenyi,
On a Data Structure for Adaptive Finite Element Mesh Refinements,
pp. 166-187.
[Verwer:1980:ICS]
J. G. Verwer,
An Implementation of a Class of Stabilized Explicit Methods for the Time Integration of Parabolic Equations,
pp. 188-205.
[Munksgaard:1980:SSS]
N. Munksgaard,
Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients,
pp. 206-219.
[Abdelmalek:1980:SOS]
Nabih N. Abdelmalek,
L_1 Solution of Overdetermined Systems of Linear Equations,
pp. 220-227.
[Abdelmalek:1980:AFS]
Nabih N. Abdelmalek,
Algorithm 551: A FORTRAN Subroutine for the L_1 Solution of Overdetermined Systems of Linear Equations [F4],
pp. 228-230.
[Barrodale:1980:ASC]
I. Barrodale and F. D. K. Roberts,
Algorithm 552: Solution of the Constrained \ell_1 Linear Approximation Problem [F4],
pp. 231-235.
[Verwer:1980:AME]
J. G. Verwer,
Algorithm 553: M3RK, An Explicit Time Integrator for Semidiscrete Parabolic Equations [D3],
pp. 236-239.
[More:1980:ABF]
J. J. Moré and M. Y. Cosnard,
Algorithm 554: BRENTM, A Fortran Subroutine for the Numerical Solution of Nonlinear Equations [F5],
pp. 240-251.
[Watson:1980:ACY]
L. T. Watson and D. Fenner,
Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C^2 Maps [C5],
pp. 252-259.
[Gear:1980:RKS]
C. W. Gear,
Runge-Kutta Starters for Multistep Methods,
pp. 263-279.
[Barton:1980:TSS]
David Barton,
On Taylor Series and Stiff Equations,
pp. 280-294.
[Jackson:1980:AIV]
K. R. Jackson and R. Sacks-Davis,
An Alternative Implementation of Variable Step-Size Multistep Formulas for Stiff ODEs,
pp. 295-318.
[Gupta:1980:NAO]
G. K. Gupta,
A Note About Overhead Costs in ODE Solvers,
pp. 319-326.
[Coleman:1980:SSI]
David Coleman and Paul Holland and Neil Kaden and Virginia Klema and Stephen C. Peters,
A System of Subroutines for Iteratively Reweighted Least Squares Computations,
pp. 327-336.
[George:1980:FIM]
Alan George and Joseph W. H. Liu,
A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs,
pp. 337-358.
[Bentley:1980:GSL]
Jon Louis Bentley and James B. Saxe,
Generating Sorted Lists of Random Numbers,
pp. 359-364.
[Amos:1980:CEI]
Donald E. Amos,
Computation of Exponential Integrals,
pp. 365-377.
[Arthur:1980:PPA]
Jeffrey L. Arthur and A. Ravindran,
PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems,
pp. 378-386.
[Cheung:1980:MLP]
To-Yat Cheung,
Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach,
pp. 387-390.
[Betts:1980:CAC]
J. T. Betts,
A Compact Algorithm for Computing the Stationary Point of a Quadratic Function Subject to Linear Constraints,
pp. 391-397.
[Kaagstroem:1980:ANC]
Bo Kågström and Axel Ruhe,
An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix,
pp. 398-419.
[Amos:1980:AEI]
Donald E. Amos,
Algorithm 556: Exponential Integrals [S13],
pp. 420-428.
(See remark in [Amos:1983:REI].)
[Arthur:1980:APP]
J. L. Arthur and A. Ravindran,
Algorithm 557: PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems [H],
p. 429.
[Cheung:1980:APM]
To-Yat Cheung,
Algorithm 558: A Program for the Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach [H],
pp. 430-431.
[Betts:1980:ASP]
J. T. Betts,
Algorithm 559: The Stationary Point of a Quadratic Function Subject to Linear Constraints [E4],
pp. 432-436.
[Kaagstroem:1980:AJA]
Bo Kågström and Axel Ruhe,
Algorithm 560: JNF, An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix [F2],
pp. 437-443.
[Kahaner:1980:AFI]
D. K. Kahaner,
Algorithm 561: FORTRAN Implementation of Heap Programs for Efficient Table Maintenance [Z],
pp. 444-449.
[Pape:1980:ASP]
U. Pape,
Algorithm 562: Shortest Path Lengths [H],
pp. 450-455.
(See also [Pape:1983:RSP].)
[Harms:1980:RSM]
U. Harms and H. Kollakowski and G. Möller,
Remark on ``Algorithm 408: A Sparse Matrix Package (Part 1) [F4]'',
pp. 456-457.
(See [McNamee:1971:SMP].)
[Machura:1980:SSP]
Marek Machura and Roland A. Sweet,
A Survey of Software for Partial Differential Equations,
pp. 461-488.
[Kurator:1980:PIS]
William G. Kurator and Richard P. O'Neill,
PERUSE: An Interactive System for Mathematical Programs,
pp. 489-509.
[Brown:1980:EPB]
W. S. Brown and S. I. Feldman,
Environment Parameters and Basic Functions for Floating-Point Computation,
pp. 510-523.
[Luk:1980:CSV]
Franklin T. Luk,
Computing the Singular-Value Decomposition on the ILLIAC IV,
pp. 524-539.
[Sacks-Davis:1980:FLC]
R. Sacks-Davis,
Fixed Leading Coefficient Implementation of SD-Formulas for Stiff ODEs,
pp. 540-562.
[Bentley:1980:OET]
Jon Louis Bentley and Bruce W. Weide and Andrew C. Yao,
Optimal Expected-Time Algorithms for Closest Point Problems,
pp. 563-580.
[Campbell:1980:TAM]
J. B. Campbell,
On Temme's Algorithm for the Modified Bessel Function of the Third Kind,
pp. 581-586.
[Hoffman:1980:TPG]
K. L. Hoffman and D. R. Shier,
A Test Problem Generator for Discrete Linear L_1 Approximation Problems,
pp. 587-593.
[Bartels:1980:LCD]
Richard H. Bartels and Andrew R. Conn,
Linearly Constrained Discrete \ell_1 Problems,
pp. 594-608.
[Bartels:1980:APL]
Richard H. Bartels and Andrew R. Conn,
Algorithm 563: A Program for Linearly Constrained Discrete \ell_1 Problems,
pp. 609-614.
[Hoffman:1980:ATP]
K. L. Hoffman and D. R. Shier,
Algorithm 564: A Test Problem Generator for Discrete Linear L_1 Approximation Problems,
pp. 615-617.
[Shanno:1980:RMU]
D. F. Shanno and K. H. Phua,
Remark on ``Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]'',
pp. 618-622.
(See [Shanno:1976:AMU].)
[Hiebert:1981:EMS]
K. L. Hiebert,
An Evaluation of Mathematical Software that Solves Nonlinear Least Squares Problems,
pp. 1-16.
[More:1981:TUO]
Jorge J. Moré and Burton S. Garbow and Kenneth E. Hillstrom,
Testing Unconstrained Optimization Software,
pp. 17-41.
[Akl:1981:CCG]
Selim G. Akl,
A Comparison of Combination Generation Methods,
pp. 42-45.
[Fritsch:1981:DIU]
F. N. Fritsch and D. K. Kahaner and J. N. Lyness,
Double Integration Using One-Dimensional Adaptive Quadrature Routines: A Software Interface Problem,
pp. 46-75.
(See also [Fritsch:1981:CIU].)
[Friedman:1981:NPP]
Jerome H. Friedman and Margaret H. Wright,
A Nested Partitioning Procedure for Numerical Multiple Integration,
pp. 76-92.
[Smith:1981:ERA]
J. M. Smith and F. W. J. Olver and D. W. Lozier,
Extended-Range Arithmetic and Normalized Legendre Polynomials,
pp. 93-105.
[Melgaard:1981:GST]
David K. Melgaard and Richard F. Sincovec,
General Software for Two-Dimensional Nonlinear Partial Differential Equations,
pp. 106-125.
[Melgaard:1981:APS]
David K. Melgaard and Richard F. Sincovec,
Algorithm 565: PDETWO/PSETM/GEARB: Solution of Systems of Two-Dimensional Nonlinear Partial Differential Equations [D3],
pp. 126-135.
[More:1981:AFS]
J. J. Moré and B. S. Garbow and K. E. Hillstrom,
Algorithm 566: FORTRAN Subroutines for Testing Unconstrained Optimization Software [C5 [E4]],
pp. 136-140.
(See also [Averbukh:1994:RA].)
[Lozier:1981:AER]
D. W. Lozier and J. M. Smith,
Algorithm 567: Extended-Range Arithmetic and Normalized Legendre Polynomials [A1], [C1],
pp. 141-146.
[Golub:1981:BLM]
Gene H. Golub and Franklin T. Luk and Michael L. Overton,
A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix,
pp. 149-169.
[Wang:1981:PMT]
H. H. Wang,
A Parallel Method for Tridiagonal Equations,
pp. 170-183.
[Stewart:1981:SIA]
William J. Stewart and Alan Jennings,
A Simultaneous Iteration Algorithm for Real Matrices,
pp. 184-198.
[Hill:1981:EIR]
Geoffrey W. Hill,
Evaluation and Inversion of the Ratios of Modified Bessel Functions, I_1(x)/I_0(x) and I_1.5(x)/I_0.5(x),
pp. 199-208.
[Ascher:1981:CSB]
U. Ascher and J. Christiansen and R. D. Russell,
Collocation Software for Boundary Value ODE's,
pp. 209-222.
[Ascher:1981:ACC]
U. Ascher and J. Christiansen and R. D. Russell,
Algorithm 569: COLSYS: Collocation Software for Boundary-Value ODEs [D2],
pp. 223-229.
(See also [Hake:1986:RCC].)
[Stewart:1981:ALS]
William J. Stewart and Alan Jennings,
Algorithm 570: LOPSI: A Simultaneous Iteration Method for Real Matrices [F2],
pp. 230-232.
[Hill:1981:ASM]
Geoffrey W. Hill,
Algorithm 571: Statistics for von Mises' and Fisher's Distributions of Directions: I_1(x)/I_0(x), I_1.5(x)/I_0.5(x) and Their Inverses [S14],
pp. 233-238.
[OLeary:1981:ASH]
Dianne P. O'Leary and Olof Widlund,
Algorithm 572: Solution of the Helmholtz Equation for the Dirichlet Problem on General Bounded Three-Dimensional Regions [D3],
pp. 239-246.
[Hill:1981:RSD]
G. W. Hill,
Remark on ``Algorithm 395: Student's t-Distribution'',
pp. 247-249.
(See [Hill:1970:SD, Hill:1970:SQ, Lozy:1979:RSD].)
[Hill:1981:RSQ]
G. W. Hill,
Remark on ``Algorithm 396: Student's t-Quantiles'',
pp. 250-251.
(See [Hill:1970:SQ].)
[Fritsch:1981:CIU]
F. N. Fritsch,
Corrigendum: ``Double Integration Using One-Dimensional Adaptive Quadrature Routines: A Software Interface Problem'',
p. 252.
(See [Fritsch:1981:DIU].)
[Ukkonen:1981:CER]
Esko Ukkonen,
On the Calculation of the Effects of Roundoff Errors,
pp. 259-271.
[Linnainmaa:1981:SDP]
Seppo Linnainmaa,
Software for Doubled-Precision Floating-Point Computations,
pp. 272-283.
[Lii:1981:CBC]
K. S. Lii and K. N. Helland,
Cross-Bispectrum Computation and Variance Estimation,
pp. 284-294.
[Dew:1981:SLR]
P. M. Dew and J. E. Walsh,
A Set of Library Routines for Solving Parabolic Equations in One Space Variable,
pp. 295-314.
[Duff:1981:AOM]
I. S. Duff,
On Algorithms for Obtaining a Maximum Transversal,
pp. 315-330.
[McAllister:1981:ACS]
David F. McAllister and John A. Roulier,
An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline,
pp. 331-347.
[Dennis:1981:ANL]
John E. Dennis, Jr. and David M. Gay and Roy E. Welsch,
An Adaptive Nonlinear Least-squares Algorithm,
pp. 348-368.
[Dennis:1981:ANE]
John E. Dennis, Jr. and David M. Gay and Roy E. Welsch,
Algorithm 573: NL2SOL---An Adaptive Nonlinear Least-Squares Algorithm [E4],
pp. 369-383.
(See also [Gay:1983:RNE].)
[McAllister:1981:ASP]
D. F. McAllister and J. A. Roulier,
Algorithm 574: Shape-Preserving Osculatory Quadratic Splines [E1, E2],
pp. 384-386.
[Duff:1981:APZ]
I. S. Duff,
Algorithm 575: Permutations for a Zero-Free Diagonal [F1],
pp. 387-390.
[Barrodale:1981:AFP]
I. Barrodale and G. F. Stuart,
Algorithm 576: A FORTRAN Program for Solving Ax = b [F4],
pp. 391-397.
[Carlson:1981:AAI]
B. C. Carlson and Elaine M. Notis,
Algorithm 577: Algorithms for Incomplete Elliptic Integrals [S21],
pp. 398-403.
[Razaz:1981:RAF]
M. Razaz and J. L. Schonfelder,
Remark on ``Algorithm 498: Airy Functions Using Chebyshev Series Approximations'',
pp. 404-405.
(See [Prince:1975:AAF].)
[Shampine:1981:ETS]
Lawrence F. Shampine,
Evaluation of a Test Set for Stiff ODE Solvers,
pp. 409-420.
[Neves:1981:CIE]
Kenneth W. Neves,
Control of Interpolatory Error in Retarded Differential Equations,
pp. 421-444.
[Brown:1981:SRM]
W. S. Brown,
A Simple but Realistic Model of Floating-Point Computation,
pp. 445-480.
[Marsten:1981:DXL]
Roy E. Marsten,
The Design of the XMP Linear Programming Library,
pp. 481-497.
[Pallottino:1981:EAD]
Stefano Pallottino and Tommaso Toffoli,
An Efficient Algorithm for Determining the Length of the Longest Dead Path in a ``LIFO'' Branch-and-Bound Exploration Schema,
pp. 498-504.
[Duff:1981:MSU]
I. S. Duff,
ME28: A Sparse Unsymmetric Linear Equation Solver for Complex Equations,
pp. 505-511.
[Fornberg:1981:NDA]
Bengt Fornberg,
Numerical Differentiation of Analytic Functions,
pp. 512-526.
[Croz:1981:SLF]
J. J. Du Croz and S. M. Nugent and J. K. Reid and D. B. Taylor,
Solving Large Full Sets of Linear Equations in a Paged Virtual Store,
pp. 527-536.
[Croz:1981:ASR]
J. J. Du Croz and S. M. Nugent and J. K. Reid and D. B. Taylor,
Algorithm 578: Solution of Real Linear Equations in a Paged Virtual Store [F4],
pp. 537-541.
[Fornberg:1981:ACC]
B. Fornberg,
Algorithm 579: CPSC: Complex Power Series Coefficients [D4],
pp. 542-547.
[Buckley:1981:AQS]
A. Buckley,
Algorithm 580: QRUP: A Set of FORTRAN Routines for Updating QR Factorizations [F5],
pp. 548-549.
(See also [Buckley:1982:RQS].)
[Krogh:1982:AAP]
Fred T. Krogh,
ACM Algorithms Policy,
pp. 1-4.
[Hiebert:1982:EMS]
K. L. Hiebert,
An Evaluation of Mathematical Software That Solves Systems of Nonlinear Equations,
pp. 5-20.
[Dunham:1982:CBC]
Charles B. Dunham,
Choice of Basis for Chebyshev Approximation,
pp. 21-25.
[Deo:1982:AGF]
Narsingh Deo and G. M. Prabhu and M. S. Krishnamoorthy,
Algorithms for Generating Fundamental Cycles in a Graph,
pp. 26-42.
[Paige:1982:LAS]
Christopher C. Paige and Michael A. Saunders,
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares,
pp. 43-71.
[Chan:1982:IAC]
Tony F. Chan,
An Improved Algorithm for Computing the Singular Value Decomposition,
pp. 72-83.
[Chan:1982:AIA]
Tony F. Chan,
Algorithm 581: An Improved Algorithm for Computing the Singular Value Decomposition [F1],
pp. 84-88.
[Tracht:1982:RNR]
Allen E. Tracht,
Remark on ``Algorithm 334: Normal Random Deviates'',
p. 89.
(See [Bell:1968:NRD].)
[Shampine:1982:IRM]
L. F. Shampine,
Implementation of Rosenbrock Methods,
pp. 93-113.
[Corliss:1982:SOD]
George Corliss and Y. F. Chang,
Solving Ordinary Differential Equations Using Taylor Series,
pp. 114-144.
[Hoaglin:1982:EDA]
David C. Hoaglin and Virginia C. Klema and Stephen C. Peters,
Exploratory Data Analysis in a Study of the Performance of Nonlinear Optimization Routines,
pp. 145-162.
[Ahrens:1982:CGP]
J. H. Ahrens and U. Dieter,
Computer Generation of Poisson Deviates from Modified Normal Distributions,
pp. 163-179.
[Lewis:1982:IGP]
John G. Lewis,
Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms,
pp. 180-189.
[Lewis:1982:AGP]
John G. Lewis,
Algorithm 582: The Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms for Reordering Sparse Matrices,
pp. 190-194.
[Paige:1982:ALS]
Christopher C. Paige and Michael A. Saunders,
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems,
pp. 195-209.
[Laurie:1982:ACA]
D. P. Laurie,
Algorithm 584: CUBTRI: Automatic Cubature over a Triangle,
pp. 210-218.
(See also [Hanson:1986:RCA].)
[Flamm:1982:RHE]
David S. Flamm and Robert A. Walker,
Remark on ``Algorithm 506: HQR3 and EXCHNG: Fortran Subroutines for Calculating and Ordering the Eigenvalues of a Real Upper Hessenberg Matrix [F2]'',
pp. 219-220.
(See [Stewart:1976:AHE].)
[Lewis:1982:RMB]
John G. Lewis,
Remark on ``Algorithms 508 and 509: Matrix Bandwidth and Profile Reduction [F1] and A Hybrid Profile Reduction Algorithm [F1]'',
p. 221.
(See [Crane:1976:AMB, Gibbs:1976:AHP].)
[Ellison:1982:UUI]
E. F. D. Ellison and Gautam Mitra,
UIMP: User Interface for Mathematical Programming,
pp. 229-255.
[Schreiber:1982:NIS]
Robert Schreiber,
A New Implementation of Sparse Gaussian Elimination,
pp. 256-276.
[Sasaki:1982:EGE]
Tateaki Sasaki and Hirokazu Murao,
Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems,
pp. 277-289.
[Brezinski:1982:ASG]
C. Brezinski,
Algorithm 585: A Subroutine for the General Interpolation and Extrapolation Problems,
pp. 290-301.
[Kincaid:1982:AIF]
David R. Kincaid and John R. Respess and David M. Young and Roger G. Grimes,
Algorithm 586: ITPACK 2C: A FORTRAN Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods,
pp. 302-322.
[Hanson:1982:ATA]
Richard J. Hanson and Karen H. Haskell,
Algorithm 587: Two Algorithms for the Linearly Constrained Least Squares Problem,
pp. 323-333.
(See also [Dadurkevicius:1989:RA].)
[Hanson:1982:RPQ]
R. J. Hanson,
Remark on ``Algorithm 507: Procedures for Quintic Natural Spline Interpolation [E1]'',
p. 334.
(See [Herriot:1976:APQ].)
[Wolfe:1982:CCG]
Philip Wolfe,
Checking the Calculation of Gradients,
pp. 337-343.
[Anderson:1982:FHT]
Walter L. Anderson,
Fast Hankel Transforms Using Related and Lagged Convolutions,
pp. 344-368.
[Anderson:1982:AFH]
Walter L. Anderson,
Algorithm 588: Fast Hankel Transforms Using Related and Lagged Convolutions,
pp. 369-370.
[Dongarra:1982:ASF]
Jack J. Dongarra,
Algorithm 589: SICEDR: A FORTRAN Subroutine for Improving the Accuracy of Computed Matrix Eigenvalues,
pp. 371-375.
[Dooren:1982:ADE]
P. Van Dooren,
Algorithm 590: DSUBSP and EXCHQZ: FORTRAN Subroutines for Computing Deflating Subspaces with Specified Spectrum,
pp. 376-382.
(See also [Petkov:1984:RDE].)
[Hemmerle:1982:ACM]
William J. Hemmerle,
Algorithm 591: A Comprehensive Matrix-Free Algorithm for Analysis of Variance,
pp. 383-401.
[Garbow:1982:RQA]
B. S. Garbow,
Remark on ``Algorithm 535: The QZ Algorithm to Solve the Generalized Eigenvalue Problem for Complex Matrices [F2]'',
p. 402.
(See [Garbow:1978:AQA, Garbow:1984:RQA].)
[Dodson:1982:RBL]
David S. Dodson and Roger G. Grimes,
Remark on ``Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]'',
pp. 403-404.
(See [Lawson:1979:ABL, Dodson:1983:CRB, Hanson:1987:ATA, Louter-Nool:1988:ATA].)
[Buckley:1982:RQS]
A. Buckley,
Remark on ``Algorithm 580: QRUP: A Set of FORTRAN Routines for Updating QR Factorizations [F5]'',
p. 405.
(See [Buckley:1981:AQS].)
[Morgan:1983:MCA]
Alexander P. Morgan,
A Method for Computing All Solutions to Systems of Polynomials Equations,
pp. 1-17.
[Greenberg:1983:FDA]
Harvey Greenberg,
A Functional Description of ANALYZE: A Computer-Assisted Analysis System for Linear Programming Models,
pp. 18-56.
[Beck:1983:RGA]
P. Beck and L. Lasdon and M. Engquist,
A Reduced Gradient Algorithm for Nonlinear Network Problems,
pp. 57-70.
[Hanson:1983:CDE]
P. M. Hanson and W. H. Enright,
Controlling the defect in existing variable-order Adams codes for initial-value problems,
pp. 71-97.
[Gaffney:1983:AFS]
Patrick W. Gaffney,
Algorithm 592: A FORTRAN Subroutine for Computing the Optimal Estimate of f(x),
pp. 98-116.
[Proskurowski:1983:APH]
Wlodzimierz Proskurowski,
Algorithm 593: A Package for the Helmholtz Equation in Nonrectangular Planar Regions,
pp. 117-124.
[Larson:1983:ASR]
John L. Larson and Mary E. Pasternak and John A. Wisniewski,
Algorithm 594: Software for Relative Error Analysis,
pp. 125-130.
[Martello:1983:AEA]
Silvano Martello,
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph,
pp. 131-138.
[Gay:1983:RNE]
David M. Gay,
Remark on ``Algorithm 573: NL2SOL---An Adaptive Nonlinear Least-Squares Algorithm'',
p. 139.
(See [Dennis:1981:ANE].)
[Dodson:1983:CRB]
David S. Dodson,
Corrigendum: Remark on ``Algorithm 539: Basic Linear Algebra Subroutines for FORTRAN Usage'',
p. 140.
(See [Lawson:1979:ABL, Dodson:1982:RBL, Hanson:1987:ATA, Louter-Nool:1988:ATA].)
[Fourer:1983:MLV]
Robert Fourer,
Modeling Languages Versus Matrix Generators for Linear Programming,
pp. 143-183.
[Armstrong:1983:CSM]
R. D. Armstrong and D. S. Kung and P. Sinha and A. A. Zoltners,
A Computational Study of a Multiple-Choice Knapsack Algorithm,
pp. 184-198.
[Cryer:1983:ESL]
C. W. Cryer,
The Efficient Solution of Linear Complementarity Problems for Tridiagonal Minkowski Matrices,
pp. 199-214.
[Rheinboldt:1983:LPC]
Werner C. Rheinboldt and John V. Burkardt,
A Locally Parametrized Continuation Process,
pp. 215-235.
[Rheinboldt:1983:APL]
Werner C. Rheinboldt and John V. Burkardt,
Algorithm 596: A Program for a Locally Parametrized Continuation Process,
pp. 236-241.
[Cody:1983:ASM]
W. J. Cody,
Algorithm 597: Sequence of Modified Bessel Functions of the First Kind,
pp. 242-245.
[Davis:1983:AAC]
George J. Davis,
Algorithm 598: An Algorithm to Compute Solvents of the Matrix Equation AX^2 + BX + C = 0,
pp. 246-254.
[Ahrens:1983:ASG]
J. H. Ahrens and K. D. Kohrt and U. Dieter,
Algorithm 599: Sampling from Gamma and Poisson Distributions,
pp. 255-257.
[Herriott:1983:ATA]
John G. Herriott and Christian H. Reinsch,
Algorithm 600: Translation of Algorithm 507: Procedures for Quintic Natural Spline Interpolation,
pp. 258-259.
[Pape:1983:RSP]
U. Pape,
Remark on ``Algorithm 562: Shortest Path Lengths'',
p. 260.
(See [Pape:1980:ASP].)
[Krogh:1983:AAP]
Fred T. Krogh,
ACM Algorithms Policy,
pp. 261-264.
[Zave:1983:QEF]
Pamela Zave and George E. Cole, Jr.,
A Quantitative Evaluation of the Feasibility of, and Suitable Hardware Architectures for, an Adaptive, Parallel Finite-Element System,
pp. 271-292.
[Watkins:1983:NSS]
David S. Watkins and Ralph W. HansonSmith,
The Numerical Solution of Separably Stiff Systems by Precise Partitioning,
pp. 293-301.
[Duff:1983:MSI]
I. S. Duff and J. K. Reid,
The Multifrontal Solution of Indefinite Sparse Symmetric Linear Systems,
pp. 302-325.
[Tarjan:1983:SEI]
Robert E. Tarjan,
Space-Efficient Implementations of Graph Search Methods,
pp. 326-339.
[McNamee:1983:SMP]
J. M. McNamee,
A Sparse Matrix Package---Part II: Special Cases,
pp. 340-343.
[McNamee:1983:ASM]
J. M. McNamee,
Algorithm 601: A Sparse-Matrix Package---Part II: Special Cases,
pp. 344-345.
[Fessler:1983:HAA]
Theodore Fessler and William F. Ford and David A. Smith,
HURRY: An Acceleration Algorithm for Scalar Sequences and Series,
pp. 346-354.
[Fessler:1983:AHA]
Theodore Fessler and William F. Ford and David A. Smith,
Algorithm 602: HURRY: An Acceleration Algorithm for Scalar Sequences and Series,
pp. 355-357.
[Diaz:1983:FPS]
J. C. Diaz and G. Fairweather and P. Keast,
FORTRAN Packages for Solving Certain Almost Block Diagonal Linear Systems by Modified Alternate Row and Column Elimination,
pp. 358-375.
[Diaz:1983:ACA]
J. C. Diaz and G. Fairweather and P. Keast,
Algorithm 603: COLROW and ARCECO: FORTRAN Packages for Solving Certain Almost Block Diagonal Linear Systems by Modified Alternate Row and Column Elimination,
pp. 376-380.
(See also [Diaz:1988:RCA].)
[Sauer:1983:AFP]
Frederick W. Sauer,
Algorithm 604: A FORTRAN Program for the Calculation of an Extremal Polynomial,
pp. 381-383.
[Hopkins:1983:APV]
T. R. Hopkins,
Algorithm 605: PBASIC: A Verifier Program for American National Standard Minimal BASIC,
pp. 391-394.
[Gaffney:1983:NIT]
P. W. Gaffney and J. W. Wooten and K. A. Kessel and W. R. McKinney,
NITPACK: An Interactive Tree Package,
pp. 395-417.
[Gaffney:1983:ANI]
P. W. Gaffney and J. W. Wooten and K. A. Kessel and W. R. McKinney,
Algorithm 606: NITPACK: An Interactive Tree Package,
pp. 418-426.
[Snyder:1983:ATE]
W. V. Snyder and R. J. Hanson,
Algorithm 607: Text Exchange System: A Transportable System for Management and Exchange of Programs and other Text,
pp. 427-440.
[Horn:1983:CLE]
B. K. P. Horn,
The Curve of Least Energy,
pp. 441-460.
[West:1983:AAS]
David H. West,
Algorithm 608: Approximate Solution of the Quadratic Assignment Problem,
pp. 461-466.
[Amos:1983:UAE]
D. E. Amos,
Uniform Asymptotic Expansions for Exponential Integrals E_n(x) and Bickley Functions Ki_n(x),
pp. 467-479.
[Amos:1983:APFa]
D. E. Amos,
Algorithm 609: A Portable FORTRAN Subroutine for the Bickley Functions Ki_n(x),
pp. 480-493.
[Amos:1983:APFb]
D. E. Amos,
Algorithm 610: A Portable FORTRAN Subroutine for Derivatives of the Psi Function,
pp. 494-502.
[Gay:1983:ASU]
David M. Gay,
Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach,
pp. 503-524.
[Amos:1983:REI]
Donald E. Amos,
Remark on ``Algorithm 556: Exponential Integrals'',
p. 525.
(See [Amos:1980:AEI].)
[deDoncker:1984:AAI]
Elise de Doncker and Ian Robinson,
An Algorithm for Automatic Integration Over a Triangle Using Nonlinear Extrapolation,
pp. 1-16.
[deDoncker:1984:ATI]
Elise de Doncker and Ian Robinson,
Algorithm 612: TRIEX: Integration Over a TRIangle Using Nonlinear EXtrapolation,
pp. 17-22.
[Gear:1984:SOD]
C. W. Gear and O. Østerby,
Solving Ordinary Differential Equations with Discontinuities,
pp. 23-44.
[Krogh:1984:ARI]
Fred T. Krogh and Kris Stewart,
Asymptotic (h\rightarrow\infty) Absolute Stability for BDFs Applied to Stiff Differential Equations,
pp. 45-57.
[Gaffney:1984:PES]
Patrick W. Gaffney,
A Performance Evaluation of Some FORTRAN Subroutines for the Solution of Stiff Oscillatory Ordinary Differential Equations,
pp. 58-72.
[Kaufman:1984:BES]
Linda Kaufman,
Banded Eigenvalue Solvers on Vector Machines,
pp. 73-85.
[Lenard:1984:RGT]
Melanie L. Lenard and Michael Minkoff,
Randomly Generated Test Problems for Positive Definite Quadratic Programming,
pp. 86-96.
[Jones:1984:SRM]
Christopher B. Jones,
A Significance Rule for Multiple-Precision Arithmetic,
pp. 97-107.
[Haymond:1984:AMS]
R. E. Haymond and J. P. Jarvis and D. R. Shier,
Algorithm 613: Minimum Spanning Tree for Moderate Integer Weights,
pp. 108-111.
[Shapiro:1984:IRG]
Henry D. Shapiro,
Increasing Robustness in Global Adaptive Quadrature Through Interval Selection Heuristics,
pp. 117-139.
[Sikorski:1984:OQS]
K. Sikorski and F. Stenger,
Optimal Quadratures in H_p Spaces,
pp. 140-151.
[Sikorski:1984:AFS]
K. Sikorski and F. Stenger and J. Schwing,
Algorithm 614: A FORTRAN Subroutine for Numerical Integration in H_p,
pp. 152-160.
[Rall:1984:DPS]
L. B. Rall,
Differentiation in Pascal-SC: Type GRADIENT,
pp. 161-184.
[Lawrie:1984:CCC]
D. H. Lawrie and A. H. Sameh,
The Computation and Communication Complexity of a Parallel Banded System Solver,
pp. 185-195.
(See also [Lawrie:1985:CCC].)
[Reid:1984:SAB]
J. K. Reid and A. Jennings,
On Solving Almost Block Diagonal (Staircase) Linear Systems,
pp. 196-201.
[Armstrong:1984:ABS]
R. D. Armstrong and P. O. Beck and M. T. Kung,
Algorithm 615: The Best Subset of Parameters in Least Absolute Value Regression,
pp. 202-206.
[Petkov:1984:RDE]
P. Hr. Petkov and N. D. Christov and M. M. Konstantinov,
Remark on ``Algorithm 590: DSUBSP and EXCHQZ: FORTRAN Subroutines for Computing Deflating Subspaces with Specified Spectrum'',
p. 207.
(See [Dooren:1982:ADE].)
[Krogh:1984:AAP]
Fred T. Krogh,
ACM Algorithms Policy,
pp. 208-211.
[Dongarra:1984:SMA]
Jack J. Dongarra and Stanley C. Eisenstat,
Squeezing the Most out of an Algorithm in CRAY FORTRAN,
pp. 219-230.
[Molchanov:1984:PCS]
I. N. Molchanov and V. S. Zubatenko and L. D. Nikolenko and M. F. Yakovlev,
A Program Complex for Solving Systems of Linear Algebraic Equations,
pp. 231-241.
[Rivara:1984:DDS]
Maria-Cecilia Rivara,
Design and Data Structure of Fully Adaptive Multigrid, Finite-Element Software,
pp. 242-264.
[Monahan:1984:AFC]
J. F. Monahan,
Algorithm 616: Fast Computation of the Hodges-Lehman Location Estimator,
pp. 265-270.
(This paper reduces the previous complexity bound for the Hodges-Lehman location estimator from O(n^2 log n) to O(n log n).)
[Kronmal:1984:ACA]
R. A. Kronmal and A. V. Peterson,
An Acceptance-Complement Analogue of the Mixture-plus-Acceptance-Rejection Method for Generating Random Variables,
pp. 271-281.
[Gill:1984:POP]
Philip E. Gill and Walter Murray and Michael A. Saunders and Margaret H. Wright,
Procedures for Optimization Problems with a Mixture of Bounds and General Linear Constraints,
pp. 282-298.
[Aluffi-Pentini:1984:DEA]
Filippo Aluffi-Pentini and Valerio Parisi and Francesco Zirilli,
A Differential-Equations Algorithm for Nonlinear Equations,
pp. 299-316.
[Aluffi-Pentini:1984:ADD]
Filippo Aluffi-Pentini and Valerio Parisi and Francesco Zirilli,
Algorithm 617: DAFNE: A Differential-Equations Algorithm for Nonlinear Equations,
pp. 317-324.
[Regener:1984:MID]
Eric Regener,
Multiprecision Integer Division Examples Using Arbitrary Radix,
pp. 325-328.
(See also [BrinchHansen:1994:MLD].)
[Coleman:1984:SES]
Thomas F. Coleman and Burton S. Garbow and Jorge J. Moré,
Software for Estimating Sparse Jacobian Matrices,
pp. 329-345.
[Coleman:1984:AFS]
Thomas F. Coleman and Burton S. Garbow and Jorge J. Moré,
Algorithm 618: Fortran Subroutines for Estimating Sparse Jacobian Matrices,
pp. 346-347.
[Piessens:1984:AAN]
Robert Piessens and Rudi Huysmans,
Algorithm 619: Automatic Numerical Inversion of the Laplace Transform [D5],
pp. 348-353.
[Piessens:1984:RNI]
Robert Piessens,
Remark on ``Algorithm 486: Numerical Inversion of Laplace Transform'',
p. 354.
(See [Veillon:1977:RNI, Koppelaar:1976:RNI].)
[Rice:1984:ARK]
John R. Rice and Richard J. Hanson,
Algorithm 620: References and Keywords for Collected Algorithms of the ACM,
pp. 359-360.
(See also [Hamilton:1985:RRK, Hopkins:1990:RRK].)
[Black:1984:NIS]
Cheryl M. Black and Robert P. Burton and Thomas M. Miller,
The Need for an Industry Standard of Accuracy for Elementary-Function Programs,
pp. 361-366.
[Eiger:1984:BMS]
A. Eiger and K. Sikorski and F. Stenger,
A Bisection Method for Systems of Nonlinear Equations,
pp. 367-377.
[Sommeijer:1984:ASL]
B. P. Sommeijer and P. J. van der Houven,
Algorithm 621: Software with Low Storage Requirements for Two-Dimensional Parabolic Differential Equations,
pp. 378-396.
[Bundy:1984:GIP]
Alan Bundy,
A Generalized Interval Package and Its Use for Semantic Checking,
pp. 397-409.
[Rice:1984:ASM]
John R. Rice and Calvin Ribbens and William A. Ward,
Algorithm 622: A Simple Macroprocessor,
pp. 410-416.
[Renka:1984:IDS]
Robert J. Renka,
Interpolation of Data on the Surface of a Sphere,
pp. 417-436.
[Renka:1984:AIS]
Robert J. Renka,
Algorithm 623: Interpolation on the Surface of a Sphere,
pp. 437-439.
[Renka:1984:ATI]
Robert J. Renka,
Algorithm 624: Triangulation and Interpolation at Arbitrarily Distributed Points in the Plane,
pp. 440-442.
[Rice:1984:NCG]
John R. Rice,
Numerical Computation with General Two-Dimensional Domains,
pp. 443-452.
[Rice:1984:ATD]
John R. Rice,
Algorithm 625: A Two-Dimensional Domain Processor,
pp. 453-462.
[Preusser:1984:CCS]
Albrect Preusser,
Computing Contours by Successive Solution of Quintic Polynomial Equations,
pp. 463-472.
[Preusser:1984:ATE]
Albrect Preusser,
Algorithm 626: TRICP---A Contour Plot Program for Triangular Meshes,
pp. 473-475.
[Garbow:1984:RQA]
B. S. Garbow,
Remark on ``Algorithm 535: The QZ Algorithm to Solve the Generalized Eigenvalue Problem for Complex Matrices [F2]'',
p. 476.
(See [Garbow:1978:AQA, Garbow:1982:RQA].)
[Celis:1984:RCE]
Pedro Celis,
Remark: Corrections and Errors in John Ivie's Some MACSYMA Programs for Solving Recurrence Relations,
pp. 477-478.
(See [Ivie:1978:SMP].)
[Tomlin:1985:IPS]
J. A. Tomlin and J. S. Welch,
Integration of a Primal Simplex Network Algorithm with a Large-Scale Mathematical Programming System,
pp. 1-11.
[Davidon:1985:ESD]
William C. Davidon and Jorge Nocedal,
Evaluation of Step Directions in Optimization Algorithms,
pp. 12-19.
[Cuyt:1985:CIM]
Annie A. M. Cuyt and L. B. Rall,
Computational Implementation of the Multivariate Halley Method for Solving Nonlinear Systems of Equations,
pp. 20-36.
[Vitter:1985:RSR]
Jeffrey Scott Vitter,
Random Sampling with a Reservoir,
pp. 37-57.
[Bownds:1985:AFS]
John M. Bownds and Lee Applebaum,
Algorithm 627: A FORTRAN Subroutine for Solving Volterra Integral Equations,
pp. 58-65.
[Winkler:1985:AAC]
F. Winkler and B. Buchberger and F. Lichtenberger and H. Rolletschek,
Algorithm 628: An Algorithm for Constructing Canonical Bases of Polynomial Ideals,
pp. 66-78.
[Atkinson:1985:AIE]
Kendall E. Atkinson,
Algorithm 629: An Integral Equation