File: ftp.cso.uiuc.edu : (/pub/) math/toms/TOMS.tape
Contact: Stan Kerr (stankerr@uiuc.edu)
Updated: 28/Jan/93
Information on the public TOMS algorithms tape at CCSO.
The tape is named TOMS, its rack location is A006.
On CCSO systems, the tape can be mounted as follows:
1. On CMS: MOUNT TOMS-A006 RING OUT DEN 6250
2. On Unix: tapem -r out -d 6250 toms-a006 &
If you want to obtain an algorithm, but do not have access to CSO systems to
do the necessary tape access, please get in touch with Stan Kerr
(phone 333-5217, email stankerr@uiuc.edu) to make arrangements.
Tape characteristics:
Density 6250 BPI; unlabelled; EBCDIC code
All files consist of fixed length records of length 80, with
400 records per block (RECFM FB LRECL 80 BLKSIZE 32000)
Nearly all files consist purely of upper case letters, digits,
and punctuation. Exceptions are noted below in the directory.
The directory listing below tells, for each algorithm, which tape file(s) it
is in, how many records there are in the file, and gives a short description
of the algorithm. If the file number and record count are given as question
marks (???), this means that the algorithm has been published but has not
yet been received by CSO. (CSO generally orders the algorithms as soon as
the current issue of TOMS is received.)
All the algorithms are in FORTRAN (with a few exceptions). Most of them
should need little to no modification to run on our systems. The tape files
frequently contain a good deal of material, including the algorithm code and
test programs; sometimes code for several different versions of the
algorithm is supplied. If the authors of the algorithms have adhered to TOMS
standards, the documentation at the beginning of the algorithm file should
make it clear how to separate the pieces. If you need help, see Stan Kerr.
CSO, of course, makes no warrant at all as to the correctness or
appropriateness of any of the algorithms.
********************************
* Retrieving algorithms on CMS *
********************************
Most algorithms reside in a single file, and can be retrieved using MOVEFILE.
For example, if you wish to obtain algorithm 500 (minimization of
unconstrained multivariate functions), you find from the directory that it
is in file 8 and has 344 records. The following commands will retrieve the
file and store it in file ALG500 FORTRAN:
FI INMOVE TAP1 NL 8 (RECFM FB LRECL 80 BLKSIZE 32000
FI OUTMOVE DISK ALG500 FORTRAN A (RECFM F LRECL 80 BLKSIZE 80
MOVEFILE
The NL 8 option of "FI INMOVE" specifies the tape file number.
If you wish to retrieve algorithm 527, which occupies 2 consecutive
files, (files 35 and 36), you could use the following:
REWIND 181
TAPE FSF 34
ERASE ALG527 FORTRAN A
FI INMOVE TAP1 LABOFF (RECFM FB LRECL 80 BLKSIZE 32000 PERM
FI OUTMOVE DISK ALG527 FORTRAN A (RECFM F LRECL 80 BLKSIZE 80 PERM DISP MOD
MOVEFILE
MOVEFILE
The REWIND 181 command rewinds the tape, and TAPE FSF 34 spaces forward over
the 34 preceding files. The disk file is erased, and FI INMOVE is given with
the LABOFF option to specify that the tape is to be read without label
processing; this implies that, when a tape file is read (or written), the
system leaves the tape positioned to read (or write) the next file. The DISP
MOD option is used with FI OUTMOVE to indicate that information is to be
appended to the end of the disk file. The two MOVEFILE commands read files
35 and 36 into the disk file. In fact, additional MOVEFILE commands would
simply add more tape files onto the end of the disk file, because of the
LABOFF option used in FI INMOVE and the DISP MOD option in FI OUTMOVE.
*********************************
* Retrieving algorithms on Unix *
*********************************
Following is an example of retrieving an algorithm using one of the CSO
Unix systems.
First, the tape is mounted with the command
tapem -r out -d 6250 toms-a006 &
You will get a message on your terminal when the tape is ready for use.
(Note: On CSO Unix systems, if a tape is idle for 15 minutes, it is
automatically dismounted, so be prompt about reading it.)
To retrieve algorithm 500, as in the CMS example above, you would then do
the following commands after the tape is ready for use. Since the algorithm
is in file 8, you must skip over 7 preceding files before reading it.
mt -f toms fsf 7
dd if=toms of=alg500.f ibs=32000 cbs=80 conv=ascii
This places the algorithm in file alg500.f.
After this algorithm is read, the tape is positioned after the 8'th file.
You could use another 'mt -f toms fsf xxx' command to space forward to
another file, or you could use 'mt -f toms bsf xxx' to space backward, or
you could use 'mt -f toms rewind' to rewind the tape.
To dismount the tape, use the command
taper
The directory below gives, for each algorithm:
1. The algorithm number (from 493 upward)
2. The volume and number of TOMS in which it was published, in the
form nnm, where nn is the year (starting with 75 for vol 1) and
m is the number (1,2,3,4). For example, 783 represents issue 3
of volume 4 (1978).
3. The tape file or files in which the algorithm resides. In a
few cases (e.g., algorithms 527 and 532), the algorithm source
spans more than one tape file.
4. A brief description of the algorithm
5. A record count for the file. In a few cases (e.g. algorithm
539) this is large, so be wary of automatically trying to SAVE
the file after reading it from the tape.
Directory of Algorithms on TOMS-A006
ALG V/N FILE COUNT CONTENTS
--- --- ---- ----- -------------------------------------------------
493 752 1 721 Zeros of a real polynomial
494 753 2 155 PDEONE, solution of PDE's
495 753 3 298 Solution of an overdetermined linear system in
the Chebyshev norm
496 753 4 430 LZ alg for generalized complex eigenvalue
problem
497 754 5 607 Automatic integration of functional differential
equations
** This is routine DMRODE in UOILIB
498 754 6 348 Airy functions using Chebyshev series
approximations
** See remark in the Sep/81 issue of TOMS
499 761 7 746 An efficient scanning technique
500 761 8 344 Minimization of an unconstrained multivariate
function
** See remark in the Dec/80 issue of TOMS, which
announced a newer version. This newer
version appears in file 77 of this tape.
501 761 9 611 FORTRAN translation of algorithm 409, discrete
Chebyshev curve fit
** See remark in the Mar/78 issue of TOMS. This
remark gives a code correction.
502 761 10 328 Dependence of solution of nonlinear systems on a
parameter
503 762 11 1927 An automatic program for Fredholm integral
equations of the second kind
504 762 12 555 GERK: global error estimation for ordinary
differential equations
** This is in UOILIB under the name GERK. It
uses the Runge-Kutta-Felhberg technique,
which is also used by routine RKF45 in UOILIB
505 762 13 144 A list insertion sort for keys with arbitrary
key distribution
506 763 14 563 HQR3 and EXCHNG: calculate and order eigenvalues
of a real upper Hessenberg matrix
** See file 97 for an updated version
507 763 15 88 Procedures for quintic natural spline
interpolation
** INCOMPLETE -- see file 102 for complete
version
508 764 16 565 Matrix bandwidth and profile reduction
** Superceded by algorithm 582 in file 94
509 764 17 227 A hybrid profile reduction algorithm
** Superceded by algorithm 582 in file 94
510 764 18 326 Piecewise linear approximations to tabulated
data
511 771 19 1512 CDC 6000 routines IBESS and JBESS for Bessel fns
of first kind, pos real arg, pos order
** See the errata in the Dec/78 issue of TOMS.
512 771 20 140 Normalized algorithm for solution of positive
definite symmetric quindiagonal linear systems
513 771 21 108 Analysis of in-situ transposition
** See remark in the Dec/79 issue of TOMS. This
remark states that ACM algorithm 467 was much
better than this one.
514 772 22 76 A new method of cubic curve fitting using local
data
515 772 23 48 Generation of a vector from the lexicographical
index
516 772 24 415 Confidence intervals and point estimates based
on ranks in the 2-sample location problem
517 772 25 383 Condition number of a matrix eigenvalue without
the eigenvector
518 773 26 63 Incomplete Bessel function IO : the von Mises
distribution
519 773 27 351 3 algorithms for Kolmogorov-Smirnov
probabilities with arbitrary boundaries;
certification of alg 487
520 773 28 498 An automatic revised simplex method for
constrained resource network scheduling
521 773 29 237 Repeated integrals of the coerror function
522 774 30 1404 ESOLVE: congruence techniques for exact solution
of integer linear systems
523 774 31 368 CONVEX, a new convex hull algorithm for planar
sets
524 781 32 8424 MP: a FORTRAN multiple-precision arithmetic
package
525 781 33 2251 ADAPT: adaptive smooth curve fitting
526 782 34 1800 Bivariate interpolation and smooth surface fit
for irregularly distributed data points
(This alg is used by IMSL routine IQHSCV and by
the NCAR and DI3000 contour plotters.)
** See remark in the June/79 issue of TOMS.
This remark gives several code corrections.
527 782 35 1970 (File 1 of 2) a FORTRAN implementation of the
generalized marching algorithm
527 782 36 686 (file 2 of 2)
528 782 37 2844 Framework for a portable library
(This is the "core" of the PORT library.)
** See remark in the Dec/79 issue of TOMS. One
of the constants for the DEC version is
wrong.
529 782 38 280 Permutation to block triangular form
530 783 39 612 Eigensystem of skew-symmetric matrices and a
class of symmetric matrices
531 783 40 684 Contour plotting
532 784 41 4428 (File 1 of 4) software for roundoff analysis
532 784 42 720 (file 2 of 4)
532 784 43 612 (file 3 of 4)
532 784 44 1044 (file 4 of 4)
533 784 45 1548 NSPIV: a FORTRAN routine for sparse Gaussian
elimination with partial pivoting
534 784 46 1152 STINT: stiff ODE integrator
535 784 47 1152 QZ alg for generalized eigenproblem for complex
matrices
** See remark in Dec/82 issue of TOMS. There is
a coding error on the line marked "VAL 123"
in the source.
536 791 48 720 An efficient one-way enciphering algorithm
537 791 49 360 Characteristic values of Mathieu's differential
equation
538 791 50 1512 Eigensystems of real generalized symmetric
matrices by simultaneous iteration
539 793 51 14472 BLAS: basic linear algebra subroutines (many
versions)
** See remark in Dec/82 issue of TOMS. The
documentation for routines SROTG and DROTG is
incorrect.
540 793 52 3312 PDECOL: generalized collocation software for
partial differential equations
541 793 53 5472 Efficient FORTRAN routines for solution of
separable elliptic PDE's
542 794 54 900 Incomplete gamma functions
543 794 55 1296 FFT9: fast solution of Helmholtz-type PDE's
544 794 56 2304 L2A and L2B: weighted least squares solutions by
modified Gram-Schmidt with iterative refinement
545 794 57 2592 An optimized mass storage FFT
546 801 58 540 SOLVEBLOK: solution of an almost block diagonal
linear system
547 801 59 612 FORTRAN routines for discrete cubic spline
interpolation and smoothing
548 801 60 252 Solution of the assignment problem
549 801 61 360 Weierstrass elliptic functions
550 801 62 648 Solid polyhedron measures
551 802 63 828 A FORTRAN routine for the L1 solution of
overdetermined systems of linear equations
552 802 64 504 Solution of the constrained L1 linear
approximation problem
553 802 65 1404 M3RK, an explicit time integrator for
semidiscrete parabolic equations
554 802 66 612 BRENTM, a FORTRAN routine for solving systems of
nonlinear equations
555 802 67 1260 Chow-yorke algorithm for fixed points for zeros
of C2 maps
556 803 68 847 Exponential integrals
** This is an updated version, received Feb/84
and incorporating corrections published in
the December 1983 issue of TOMS.
557 803 69 792 PAGP, a partitioning algorithm for (linear) goal
programming problems
558 803 70 720 Multifacility location problem with rectilinear
distance by minimum cut approach
559 803 71 576 The stationary point of a quadratic function
subject to linear constraints
560 803 72 3132 JNF, Jordan normal form of a complex matrix
561 803 73 396 FORTRAN implementation of heap programs for
efficient table maintenance
562 803 74 288 Shortest path lengths
563 804 75 3610 Linearly constrained discrete l1 problems
564 804 76 115 Test problem generator for discrete linear L1
approximation problems
** This file is incomplete. A complete version
has never been received.
500 804 77 649 Correction to algorithm 500
565 811 78 3159 PDETWO, a partial differential equations
algorithm for parabolic problems with one time
and two spatial variables.
566 811 79 6760 Subroutines to test unconstrained optimization
software
567 811 80 1114 Extended range arithmetic and Legendre
polynomials
568 811 81 16891 PDS, a portable directory system
** Published in TOPLAS (Transactions on
Programming Languages and Systems) This file
contains lower case characters -- use COPYCH
rather than DEBLOCK to read it.
569 812 82 7785 COLSYS: collocation software for boundary value
ODE's
570 812 83 1538 LOPSI: a simultaneous iteration algorithm for
real matrices
571 812 84 397 Statistics for von Mises' and Fisher's
distribution of directions
572 812 85 2024 Solution of the Helmholtz equation for the
Dirichlet problem on general bounded 3-D regions
573 813 86 13860 NL2SOL -- an adpative nonlinear least squares
algorithm
** Note corrections to NL2SOL published in the
March 1983 issue of Transactions on Math
Software.
574 813 87 897 Shape-preserving osculatory quadratic splines
** This file has some bad records. You should
use the corrected version installed in UOILIB
as routines QSPLNS and QSPLNI.
575 813 88 262 Permutations for a zero-free diagonal
576 813 89 901 A FORTRAN program for solving Ax=b
577 813 90 1048 Algorithms for incomplete elliptic integrals
578 814 91 515 Solution of real linear equations in a paged
virtual store
579 814 92 260 CPSC: complex power series coefficients
580 814 93 1558 QRUP: a set of FORTRAN routines for updating QR
factorizations
** See remark in Dec/82 issue of TOMS. There
are errors in type declarations in some
routines.
581 821 94 2945 An improved algorithm for computing the singular
value decomposition
582 822 95 4835 Gibbs-Poole-Stockmeyer and Gibbs-King algorithms
for reordering sparse matrices
583 822 96 1161 LSQR: sparse linear equations and least squares
problems
584 822 97 453 CUBTRI: automatic cubature over a triangle
506 822 98 563 New version of algorithm 506: HQR3 and EXCHNG:
eigenanalysis of a real upper Hessenberg matrix
** This supercedes the version in file number
14.
585 823 99 310 A subroutine for the general interpolation and
extrapolation problems
586 823 100 11508 ITPACK 2C, a FORTRAN package for solving large
sparse linear systems by adaptive accelerated
iterative methods
587 823 101 6654 Two algorithms for the linearly constrained
least squares problem
507 823 102 249 Replacement for algorithm 507, procedures for
quintic natural spline interpolation
** This code is in ALGOL, not FORTRAN.
588 824 103 2401 Fast Hankel transforms using related and lagged
convolutions
589 824 104 1905 SICEDR: a FORTRAN subroutine for improving the
accuracy of computed matrix eigenvalues
590 824 105 2190 DSUBP and EXCHQZ: FORTRAN subroutines for
computing deflating subspaces with specified
spectrum
591 824 106 1648 A comprehensive, matrix-free algorithm for
analysis of variance
592 831 107 1395 A FORTRAN subroutine for computing the optimal
estimate of f(x)
593 831 108 5058 A package for the Helmholtz equation in
nonrectangular regions
594 831 109 5437 Software for relative error analysis
595 831 110 619 An enumerative algorithm for finding Hamiltonian
circuits in a directed graph
596 832 111 3492 A program for a locally parameterized
continuation process
597 832 112 1365 Sequence of modified Bessel functions of the
first kind
598 832 113 1274 An algorithm to compute solvents of the matrix
equation A*X**2 + B*X + C = 0
599 832 114 908 Sampling from gamma and Poisson distributions
600 832 115 1138 Translation of algorithm 507--procedures for
quintic natural spline interpolation
601 833 116 1746 A sparse matrix package -- Part II: special
cases
Part I of the package was published as Algorithm
408, which is not on this tape.
602 833 117 1108 HURRY: an acceleration algorithm for scalar
sequences and series
603 833 118 4859 COLROW and ARCECO: FORTRAN packages for solving
certain almost block diagonal linear systems by
modified alternate row and column elimination
604 833 119 1025 A FORTRAN program for the calculation of an
extremal polynomial
605 834 120 5980 PBASIC: a verifier program for American National
Standard minimal BASIC
606 834 121 5416 NITPACK: an interactive tree package
607 834 122 55560 Text exchange system: a transportable system for
management and exchange of programs/text
608 834 123 511 Approximate solution of the quadratic assignment
problem
609 834 124 4863 A portable FORTRAN subroutine for the Bickley
functions Ki-sub-n(x)
610 834 125 2910 A portable FORTRAN subroutine for derivatives of
the psi function
611 834 126 10854 Subroutines for unconstrained minimization using
a model/trust-region approach
612 841 127 2944 TRIEX: Integration Over a TRiangle Using
Nonliner EXtrapolation
613 841 128 223 Minimum spanning tree for moderate integer
weights
614 842 129 1099 A Fortran Subroutine for Numerical integration
in H-sub-p
615 842 130 1818 The Best Subset of Parameters in Least Absolute
Value Regression
616 843 131 441 Fast Computation of the Hodges-Lehman Location
Estimator
617 843 132 4065 DAFNE -- A Differential-Equations Algorithm for
Nonlinear Equations
618 843 133 1589 Fortran Subroutines for Estimating Sparse
Jacobian Matrices
619 843 134 742 Numerical Inversion of the Laplace Transform
620 844 135 3211 References and Keywords for "Collected
Algorithms from ACM"
621 844 136 2025 Software with Low Storage Requirements for
Two-Dimensional Parabolic Differential Equations
622 844 137 15883 A Simple Macro Processor
623 844 138 6496 Interpolation on the Surface of a Sphere
624 844 139 5983 Triangulation and Interpolation of Arbitrarily
Distributed Data Points in the Plane
625 844 140 4104 A Two-Dimensional Domain Processor
626 844 141 1899 TRICP -- A Contour Plot Program for Triangular
Meshes
627 851 142 2199 A Fortran Subroutine for Solving Volterra
Integral Equations
628 851 143 3040 An Algorithm for Constructing Canonical Bases of
Polynomial Ideals
629 852 144 5261 An Integral Equation Program for LaPlaces's
Equation in Three Dimensions
630 852 145 14092 BBVSCG -- A Variable Storage Algorithm for
Function Minimization
631 852 146 735 Finding a Bracketed Zero by Larkin's Method of
Rational Interpolation
632 852 147 769 A Program for the 0-1 Multiple Knapsack Problem
633 852 148 3532 An Algorithm for Linear Dependency Analysis of
Multivariate Data
634 853 149 1687 CONST and EVAL: Routines for Fitting Multinomials
in a Least Squares Sense
635 853 150 2330 An Algorithm for the Solution of Systems of Complex
Linear Equations in the l-infinity Norm with
Constraints on the Unknowns
636 854 151 2864 Fortran Subroutines for Estimating Sparse hessian
Matrices
637 854 152 10755 GENCOL: Collocation on General Domains with
Bicubic Hermite Polynomials
638 854 153 3822 INTCOL and HERMCOL: Collocation on Rectangular
Domains with Bicubic Hermit Polynomials
639 861 154 1596 To Integrate Some Infinite Oscillating Tails
640 861 155 1648 Efficient Calculation of Frequency Response
Matrices from State Space Models
641 862 156 1523 Exact Solution of General Integer Systems of
Linear Equations
642 862 157 912 A Fast Procedure for Calculating Minimum Cross-
Validation Cubic Smoothing Splines
643 862 158 1073 FEXACT: A FORTRAN Subroutine for Fisher's Exact
Test on Unordered r-by-c Contingency Tables
644 863 159 18473 A Portable Package for Bessel Functions of a
Complex Argument and Nonnegative Order
645 863 160 1064 Subroutines for Testing Programs that Compute
the Generalized Inverse of a Matrix
646 863 161 1543 PDFIND: A Routine to Find a Positive Definite
Linear Combination of Two Real Symmetric Matrices
647 864 162 977 Implementation and Relative Efficiency of
Quasirandom Sequence Generators
648 871 163 22844 NSDTST and STDTST: Routines for Assessing the
Performance of Initial Value Solvers
649 871 164 7032 A Package for Computing Trigonometric Fourier
Coefficients Based on Lyness's Algorithm
650 872 165 427 Efficient Square Root Implementation on the 68000
651 873 166 18078 Algorithm HFFT: A High-Order Fast-Direct Solution
of the Helmholtz Equation
652 873 167 13441 HOMPACK: A Suite of Codes for Globally Convergent
Homotopy Algorithms
653 873 168 4314 Translation of Algorithm 539: PC-BLAS, Basic
Linear Algebra Subprograms for Fortran Usage
with the Intel 8087, 80287 Numeric Data Processor
654 873 169 1517 Fortran Subroutines for Computing the Incomplete
Gamma Function Ratios and Their Inverse
655 874 170 3953 IQPACK: Fortran Subroutines for the Weights of
Interpolatory Quadratures
656 881 171 31803 An Extended Set of Basic Linear Algebra Subprograms:
Model Implementation and Test Programs
657 881 172 589 Software for Plotting Contour Surfaces of a
Function of Three Variables
658 881 173 10760 ODESSA -- An Ordinary Differential Equation Solver
with Explicit Simultaneous Sensitivity Analysis
659 881 174 1002 Implementing Sobol's Quasirandom Sequence Generator
660 882 175 1508 QSHEP2D: Quadratic Shepard Method for Bivariate
Interpolation of Scattered Data
661 882 176 1638 QSHEP3D: Quadratic Shepard Method for Trivariate
Interpolation of Scattered Data
662 882 177 4537 A Fortran Software Package for the Numerical
Inversion of the Laplace Transform Based on
Weeks' Method
663 882 178 4086 Translation of algorithm 539: Basic Linear
Subprograms for Fortran Usage in Fortran 200
for the Cyber 205
664 883 179 1536 A Gauss Algorithm to Solve Systems with Large
Banded Matrices Using a Random-Access Disk
Storage
665 884 180 290 MACHAR: A Subroutine to dynamically Determine
Machine Parameters
666 884 181 1386 CHABIS: A Mathematical Software Package for
Locating and Evaluating Roots of Systems of
Nonlinear Equations
667 884 182 6961 SIGMA: A Stochastic-Integration Global
Minimization Algorithm
668 884 183 448 H2PEC: Sampling from the Hypergeometric
Distribution
669 891 184 2008 BRKF45: A Fortran Subroutine for Solving First-
Order Systems of Nonstiff Initial Value Problems
for Ordinary Differential Equations
670 891 185 5782 A Runge-Kutta-Nystrom code
671 891 186 3296 FARB-E-2D: Fill Area with Bicubics on
Rectangles -- A Contour Plot Program
672 892 187 5591 Generation of Interpolatory Quadrature Rules of
the Highest Degree of Precision with Preassigned
Nodes for General Weight Functions
673 892 188 387 Dynamic Huffman Coding
674 892 189 3046 FORTRAN Codes for Estimating the One-Norm of a
Real or Complex Matrix, with Application to
Condition Estimation
675 893 190 7403 FORTRAN Subroutines for Computing the Square Root
Covariance Filter and Square Root Information
Filter in Dense or Hessenberg Forms
676 894 191 37892 ODRPACK: Software for Weighted Orthogonal Distance
Regression
677 894 192 1915 C-1 Surface Interpolation
678 894 193 288 BTPEC: Sampling from the Binomial Distribution
679 901 194 23067 A Set of Level 3 Basic Linear Algebra Subprograms
680 901 195 214 Evaluation of the Complex Error Function
681 902 196 11563 INTBIS, a Portable Interval Newton/Bisection Package
682 902 197 3090 Talbot's Method for the Laplace Inversion Problem
683 902 198 4256 A Portable Fortran Subroutine for Exponential
Integrals of a Complex Argument
684 903 199 3850 C1 and C2 Interpolation on Triangles with Quintic and
Nonic Bivariate Polynomials
685 904 200 8276 A Program for Solving Separable Elliptic Equations
686 904 201 3437 FORTRAN Subroutines for Updating the QR Decomposition
687 911 202 2084 A Decision Tree for the Numerical Solution of Initial
Value Ordinary Differential Equations
688 912 203 8817 EPDCOL: A More Efficient PDECOL code
689 912 204 10121 Discretized Collocation and Iterated Collocation for
Nonlinear Volterra Integral Equations of the Second
Kind
690 912 205 8651 Chebyshev Polynomial Software for Elliptic-Parabolic
Systems of PDE's
691 912 206 4691 Improving QUADPACK Automatic Integration Routines
692 912 207 11261 Model Implementation and Test Package for the Sparse
Basic Linear Algebra Subprograms
693 912 208 9743 A Fortran Package for Floating-Point Multiple
Precision Arithmetic
694 913 209 2038 A Collection of Test Matrices in MATLAB
695 913 210 1039 Software for a New Modified Cholesky Factorization
696 913 211 1492 An Inverse Rayleigh Iteration for Complex Band
Matrices
697 913 212 1073 Univariate Interpolation that Has the Accuracy of a
Third-Degree Polynomial
698 914 213 5609 DCUHRE--An Adaptive Multidimensional Integration
routine for a vector of integrals
699 914 214 610 A New Representation of Patterson's Quadrature
Formulae
700 914 215 4943 A FORTRAN Software Package for Sturm-Liouville
Problems
701 914 216 4484 Goliath -- A Software System for the Exact Analysis
of Rectangular Rank-Deficient Sparse Rational
Linear Systems
702 922 217 3749 A Truncated Newton Minimization Package for Large-
Scale Problems: I. Algorithm and Usage
703 922 218 4808 MEBDF: A Fortran Subroutine for Solving First-Order
Systems of Stiff Initial Value Problems for
Ordinary Differential Equations
704 922 219 4442 ABDPACK and ABBPACK - Fortran Programs for the
Solution of Almost Block Diagonal Linear Systems
Arising in Spline Collocation at Gaussian Points
with Monomial Basis Functions
705 922 220 7673 A Fortran-77 Software Package for Solving the
Sylvester Matrix Equation A*X*B**T + C*X*D**T = E
706 923 221 4400 DCUTRI: An Algorithm for Adaptive Cubature Over a
Collection of Triangles
707 923 222 1009 CONHYP: A Numerical Evaluator of the Confluent
Hypergeometric Function for Complex Arguments of
Large Magnitude
708 923 223 2237 Significant Digit Computation of the Incomplete
Beta Function Ratios
709 924 224 79476 Testing Algorithm Implementations
710 924 225 6104 Fortran Subroutines for Computing the Eigenvalues
and Eigenvectors of a General Matrix by Reduction
to General Tridiagonal Form
711 924 226 7200 BTN:Software for Parallel Unconstrained Optimization
712 924 227 239 A Normal Random Number Generator