default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Mathematical Software (TOMS), Volume 9, 1983
Volume 9, Number 1, March 1983
- Alexander P. Morgan:
A Method for Computing All Solutions to Systems of Polynomials Equations. 1-17 - Harvey J. Greenberg:
A Functional Description of ANALYZE: A Computer-Assisted Analysis System for Linear Programming Models. 18-56 - P. O. Beck, Leon S. Lasdon, Engquist Engquist:
A Reduced Gradient Algorithm for Nonlinear Network Problems. 57-70 - P. M. Hanson, Wayne H. Enright:
Controlling the defect in existing variable-order Adams codes for initial-value problems. 71-97 - P. W. Gaffney:
Algorithm 592: A FORTRAN Subroutine for Computing the Optimal Estimate of f(x). 98-116 - Wlodzimierz Proskurowski:
Algorithm 593: A Package for the Helmholtz Equation in Nonrectangular Planar Regions. 117-124 - John L. Larson, Mary E. Pasternak, John A. Wisniewski:
Algorithm 594: Software for Relative Error Analysis. 125-130 - Silvano Martello:
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph. 131-138 - David M. Gay:
Remark on "Algorithm 573: NL2SOL - An Adaptive Nonlinear Least-Squares Algorithm". 139 - David S. Dodson:
Corrigendum: Remark on "Algorithm 539: Basic Linear Algebra Subroutines for FORTRAN Usage". 140
Volume 9, Number 2, June 1983
- Robert Fourer:
Modeling languages versus matrix generators for linear programming. 143-183 - Ronald D. Armstrong, David S. Kung, Prabhakant Sinha, Andris A. Zoltners:
A computational study of a multiple-choice knapsack algorithm. 184-198 - Colin W. Cryer:
Minkowski matrices. 199-214 - Colin W. Cryer:
The efficient solution of linear complementarity problems for tridiagonal Minkowski matrices. 199-214 - Werner C. Rheinboldt, John V. Burkardt:
A locally parameterized continuation process. 215-235 - Werner C. Rheinboldt, John V. Burkardt:
Algorithm 596: a program for a locally parameterized. 236-241 - William J. Cody:
Algorithm 597: sequence of modified Bessel functions of the first kind. 242-245 - George J. Davis:
Algorithm 598: an algorithm to compute solvent of the matrix equation AX2 + BX + C = 0. 246-254 - Joachim H. Ahrens, K. D. Kohrt, Ulrich Dieter:
Algorithm 599: sampling from Gamma and Poisson distributions. 255-257 - John G. Herriot, Christian H. Reinsch:
Algorithm 600: translation of algorithm 507. procedures for quintic natural spline interpolation. 258-259 - U. Pape:
Remark on algorithm 562: shortest path lengths. 260 - Fred T. Krogh:
ACM algorithms policy. 261-264
Volume 9, Number 3, September 1983
- Pamela Zave, George E. Cole Jr.:
A Quantitative Evaluation of the Feasibility of, and Suitable Hardware Architectures for, an Adaptive, Parallel Finite-Element System. 271-292 - David S. Watkins, Ralph W. HansonSmith:
The Numerical Solution of Separably Stiff Systems by Precise Partitioning. 293-301 - Iain S. Duff, John K. Reid:
The Multifrontal Solution of Indefinite Sparse Symmetric Linear. 302-325 - Robert Endre Tarjan:
Space-Efficient Implementations of Graph Search Methods. 326-339 - J. M. McNamee:
A Sparse Matrix Package - Part II: Special Cases. 340-343 - J. M. McNamee:
Algorithm 601: A Sparse-Matrix Package - Part II: Special Cases. 344-345 - Theodore Fessler, William F. Ford, David A. Smith
:
HURRY: An Acceleration Algorithm for Scalar Sequences and Series. 346-354 - Theodore Fessler, William Ford, David A. Smith:
Algorithm 602: HURRY: An Acceleration Algorithm for Scalar Sequences and Series. 355-357 - J. C. Diaz, Graeme Fairweather, Patrick Keast:
FORTRAN Packages for Solving Certain Almost Block Diagonal Linear Systems by Modified Alternate Row and Column Elimination. 358-375 - J. C. Diaz, Graeme Fairweather, Patrick Keast:
Algorithm 603: COLROW and ARCECO: FORTRAN Packages for Solving Certain Almost Block Diagonal Linear Systems by Modified Alternate Row and Column Elimination. 376-380 - Frederick W. Sauer:
Algorithm 604: A FORTRAN Program for the Calculation of an Extremal Polynomial. 381-383
Volume 9, Number 4, December 1983
- Tim R. Hopkins:
Algorithm 605: PBASIC: A Verifier Program for American National Standard Minimal BASIC. 391-394 - P. W. Gaffney, J. W. Wooter, K. A. Kessel, W. R. McKinney:
NITPACK: An Interactive Tree Package. 395-417 - P. W. Gaffney, J. Wooten, K. A. Kessel, W. R. McKinney:
Algorithm 606: NITPACK: An Interactive Tree Package. 418-426 - W. V. Snyder, R. J. Hanson:
Algorithm 607: Text Exchange System: A Transportable System for Management and Exchange of Programs and other Text. 427-440 - Berthold K. P. Horn:
The Curve of Least Energy. 441-460 - David H. West:
Algorithm 608: Approximate Solution of the Quadratic Assignment Problem. 461-466 - D. E. Amos:
Uniform Asymptotic Expansions for Exponential Integrals E_n(x) and Bickley Functions Kin (x). 467-479 - D. E. Amos:
Algorithm 609: A Portable FORTRAN Subroutine for the Bickley Functions Kin (x). 480-493 - D. E. Amos:
Algorithm 610: A Portable FORTRAN Subroutine for Derivatives of the Psi Function. 494-502 - David M. Gay:
Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach. 503-524 - D. E. Amos:
Remark on "Algorithm 556: Exponential Integrals". 525
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 2024-12-17 21:02 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
