CINXE.COM

Collected Algorithms of the ACM

<HTML><HEAD><TITLE>Collected Algorithms of the ACM</TITLE></HEAD> <BODY BGCOLOR="#fffaf0"> <CENTER> <H2><A HREF="http://www.acm.org/"> <IMG SRC="acmlogo.gif" BORDER=0 ALIGN=CENTER ALT="ACM"></A> Collected Algorithms</H2> </CENTER> <P> <HR> The <em>Collected Algorithms</em> </A>(<em>CALGO</em>) is part of a family of publications produced by the <A HREF="http://www.acm.org/">ACM</a>. </P> <P> <A NAME="Background"><H2>Background</H2></A> <P>Software associated with papers published in the <A HREF="https://dl.acm.org/journal/toms/">Transactions on Mathematical Software</A>, as well as other ACM journals are incorporated in CALGO. This software is refereed for originality, accuracy, robustness, completeness, portability, and lasting value. (See the <A HREF="https://dl.acm.org/journal/toms/algorithms-policy">TOMS Algorithms Policy</A> for details.) </P> <P>Use of ACM Algorithms is subject to the <A HREF="http://www.acm.org/publications/policies/softwarecrnotice">ACM Software Copyright and License Agreement</A> <A NAME="Contact"><H2>Contact</H2></A> <P> For further information about CALGO contact its Editor-in-Chief: <P> <A HREF="http://www.cs.kent.ac.uk/people/staff/trh/"> Tim Hopkins</A><BR><CITE> School of Computing <BR> <A HREF="http://www.kent.ac.uk/"> The University of Kent</A><BR> Canterbury <BR> Kent CT2 7NF <BR> United Kingdom <BR> +44-184-329-5884<BR> <A HREF="mailto:t.r.hopkins@kent.ac.uk">t.r.hopkins@kent.ac.uk</A> </CITE> <P></P> <HR><P> <H3>Contents</H3> <P> All algorithms numbered 493 and above, as well as a few earlier ones, may be downloaded from this server. </P> </MENU> <LI><EM>file: </EM><A HREF="./1.zip">1.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>obsolete, numerical integration, quadrature <LI><EM>title: </EM>QuadI <LI><EM>by: </EM>R.J. Herbold <LI><EM>ref: </EM>Comm. ACM 3,2 (Feb 1960) 74 <LI><EM>size: </EM>5 kB </MENU> <LI><EM>file: </EM><A HREF="./2.zip">2.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>obsolete, secant method, function zeros <LI><EM>title: </EM>Rootfinder <LI><EM>by: </EM>J. Wegstein <LI><EM>ref: </EM>Comm. ACM 3,2 (Feb 1960) 74 <LI><EM>size: </EM>12 kB </MENU> <LI><EM>file: </EM><A HREF="./3.zip">3.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>obsolete, Bairstow's method, polynomial zeros <LI><EM>title: </EM>Solution of Polynomial Equation by {Bairstow}-{Hitchcock} Method <LI><EM>by: </EM>A. A. Grau <LI><EM>ref: </EM>Comm. ACM 3,2 (Feb 1960) 74 <LI><EM>size: </EM>13 kB </MENU> <LI><EM>file: </EM><A HREF="./4.zip">4.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>bisection method, function zeros <LI><EM>title: </EM>Bisection Routine <LI><EM>by: </EM>S. Gorn <LI><EM>ref: </EM>Comm. ACM 3,3 (Mar 1960) 174 <LI><EM>size: </EM>3 kB </MENU> <LI><EM>file: </EM><A HREF="./5.zip">5.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Bessel function, series expansion <LI><EM>title: </EM>{Bessel} Function ${I}$ Series Expansion <LI><EM>by: </EM>D. S. Clarke <LI><EM>ref: </EM>Comm. ACM 3,4 (Apr 1960) 240 <LI><EM>size: </EM>1 kB </MENU> <LI><EM>file: </EM><A HREF="./6.zip">6.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>asymptotic expansion, Bessel function <LI><EM>title: </EM>{Bessel} Function ${I}$ Asymptotic Expansion <LI><EM>by: </EM>D. S. Clarke <LI><EM>ref: </EM>Comm. ACM 3,4 (Apr 1960) 240 <LI><EM>size: </EM>1 kB </MENU> <LI><EM>file: </EM><A HREF="./7.zip">7.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>obsolete, Euclidian algorithm, greatest common divisor <LI><EM>title: </EM>{Euclidian} Algorithm <LI><EM>by: </EM>R. Claussen <LI><EM>ref: </EM>Comm. ACM 3,4 (Apr 1960) 240 <LI><EM>size: </EM>1 kB </MENU> <LI><EM>file: </EM><A HREF="./100.zip">100.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>data structure, linked list, list operation <LI><EM>title: </EM>Add Item to Chain-Linked List <LI><EM>by: </EM>P. J. Kiviat <LI><EM>ref: </EM>Comm. ACM 5,6 (Jun 1962) 346 <LI><EM>size: </EM>19 kB </MENU> <LI><EM>file: </EM><A HREF="./101.zip">101.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>data structure, linked list, list operation <LI><EM>title: </EM>Remove Item From Chain-Linked List <LI><EM>by: </EM>P. J. Kiviat <LI><EM>ref: </EM>Comm. ACM 5,6 (Jun 1962) 346 <LI><EM>size: </EM>19 kB </MENU> <LI><EM>file: </EM><A HREF="./125.zip">125.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 5,10 (Oct 1962) 510 <LI><EM>keywrds: </EM>Gaussian coefficients, Gaussian quadrature, numerical integration,qd-algorithm <LI><EM>title: </EM>Weightcoeff <LI><EM>by: </EM>H. Rutishauser <LI><EM>size: </EM>3 kB </MENU> <LI><EM>file: </EM><A HREF="./133.zip">133.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 5,10 (Oct 1962) 553 <LI><EM>keywrds: </EM>pseudo-random numbers <LI><EM>title: </EM>Random <LI><EM>by: </EM>P. G. Behrenz <LI><EM>size: </EM>3 kB </MENU> <LI><EM>file: </EM><A HREF="./179.zip">179.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 6,6 (Jun 1963) 314 <LI><EM>title: </EM>Incomplete Beta Ratio <LI><EM>by: </EM>O. G. Ludwig <LI><EM>size: </EM>29 kB </MENU> <LI><EM>file: </EM><A HREF="./266.zip">266.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 8,10 (Oct 1965) 605 <LI><EM>keywrds: </EM>pseudo-random numbers <LI><EM>title: </EM>Pseudo-Random Numbers (+ remark) <LI><EM>by: </EM>M. C. Pike and I. D. Hill <LI><EM>size: </EM>5 kB </MENU> <LI><EM>file: </EM><A HREF="./280.zip">280.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 9,4 (Apr 1966) 271 <LI><EM>keywrds: </EM>Gregory quadrature, numerical integration, quadrature abscissae <LI><EM>title: </EM>Abscissas and Weights for {Gregory} Quadrature <LI><EM>by: </EM>J. H. Welsch <LI><EM>size: </EM>3 kB </MENU> <LI><EM>file: </EM><A HREF="./322.zip">322.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Fisher's F-distribution, Student's t-distribution <LI><EM>title: </EM>${F}$-Distribution <LI><EM>by: </EM>E. Dorrer <LI><EM>ref: </EM>Comm. ACM 11,2 (Feb 1968) 116 and later remarks <LI><EM>size: </EM>15 kB </MENU> <LI><EM>file: </EM><A HREF="./326.zip">326.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>biquadratic equation roots,cubic equation roots,polynomial zeros, <LI><EM>title: </EM>Roots of Low-Order Polynomial Equations <LI><EM>by: </EM>T. R. F. Nonweiler <LI><EM>ref: </EM>Comm. ACM 11,4 (Apr 1968) 269 <LI><EM>size: </EM>7kB </MENU> <LI><EM>file: </EM><A HREF="./332.zip">332.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 11,6 (Jun 1968) 436 <LI><EM>title: </EM>{Jacobi} Polynomials <LI><EM>by: </EM>B. F. W. Witte <LI><EM>size: </EM>14 kB </MENU> <LI><EM>file: </EM><A HREF="./343.zip">343.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 11,12 (Dec 1968) 820 <LI><EM>title: </EM>Eigenvalues and Eigenvectors of a Real Generator Matrix <LI><EM>by: </EM>J. Grad and M. A. Brebner <LI><EM>size: </EM>44 kB </MENU> <LI><EM>file: </EM><A HREF="./344.zip">344.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 12,1 (Jan 1969) 37 <LI><EM>title: </EM>{Student}'s $t$-Distribution <LI><EM>by: </EM>D. A. Levine <LI><EM>size: </EM>9 kB </MENU> <LI><EM>file: </EM><A HREF="./347.zip">347.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 12,3 (Mar 1969) 185 <LI><EM>title: </EM>An Efficient Algorithm for Sorting with Minimal Storage <LI><EM>by: </EM>R. C. Singleton <LI><EM>size: </EM>10 kB </MENU> <LI><EM>file: </EM><A HREF="./351.zip">351.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 12,6 (Jun 1969) 324 <LI><EM>title: </EM>Modified {Romberg} Quadrature <LI><EM>by: </EM>G. Fairweather <LI><EM>size: </EM>9 kB </MENU> <LI><EM>file: </EM><A HREF="./352.zip">352.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 12,7 (Jul 1969) 399 <LI><EM>title: </EM>Characteristic Values and Associated Solutions of {Mathieu}'s Differential Equation <LI><EM>by: </EM>D. S. Clemm <LI><EM>size: </EM>65 kB </MENU> <LI><EM>file: </EM><A HREF="./353.zip">353.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 12,8 (Aug 1969) 457 <LI><EM>title: </EM>{Filon} Quadrature <LI><EM>by: </EM>S. M. Chase and L. D. Fosdick <LI><EM>size: </EM>15 kB </MENU> <LI><EM>file: </EM><A HREF="./358.zip">358.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 12,10 (Oct 1969) 564 <LI><EM>title: </EM>Singular Value Decomposition of a Complex Matrix <LI><EM>by: </EM>P. A. Businger and G. H. Golub <LI><EM>size: </EM>47 kB </MENU> <LI><EM>file: </EM><A HREF="./359.zip">359.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 12,11 (Nov 1969) 631 <LI><EM>title: </EM>Factorial Analysis of Variance <LI><EM>by: </EM>J. R. Howell <LI><EM>size: </EM>9 kB </MENU> <LI><EM>file: </EM><A HREF="./365.zip">365.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 12,12 (Dec 1969) 686 <LI><EM>title: </EM>Complex Root Finding <LI><EM>by: </EM>H. Bach <LI><EM>size: </EM>11 kB </MENU> <LI><EM>file: </EM><A HREF="./370.zip">370.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 13,1 (Jan 1970) 49 <LI><EM>title: </EM>General Random Number Generator <LI><EM>by: </EM>E. L. Butler <LI><EM>size: </EM>5 kB </MENU> <LI><EM>file: </EM><A HREF="./379.zip">379.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 13,4 (Apr 1970) 260 <LI><EM>title: </EM>Squank ({Simpson} Quadrature Used Adaptively-Noise Killed) <LI><EM>by: </EM>J. N. Lyness <LI><EM>size: </EM>31 kB </MENU> <LI><EM>file: </EM><A HREF="./380.zip">380.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>matrix transpose <LI><EM>title: </EM>In-situ Transposition of a Rectangular Matrix <LI><EM>by: </EM>S. Laflin and M. A. Brebner <LI><EM>ref: </EM>Comm. ACM 13,5 (May 1970) 324 <LI><EM>size: </EM>3 kB </MENU> <LI><EM>file: </EM><A HREF="./382.zip">382.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>combinations of m out of n objects <LI><EM>title: </EM>Combinations of ${M}$ Out of ${N}$ Objects <LI><EM>by: </EM>P. J. Chase <LI><EM>ref: </EM>Comm. ACM 13,6 (Jun 1970) 368 <LI><EM>size: </EM>4 kB </MENU> <LI><EM>file: </EM><A HREF="./384.zip">384.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 13,6 (Jun 1970) 369 <LI><EM>title: </EM>Eigenvalues and Eigenvectors of a Real Symmetric Matrix <LI><EM>by: </EM>G. W. Stewart <LI><EM>size: </EM>15 kB </MENU> <LI><EM>file: </EM><A HREF="./385.zip">385.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 13,7 (Jul 1970) 446 <LI><EM>title: </EM>Exponential Integral ${E}_i (x)$ <LI><EM>by: </EM>K. A. Paciorek <LI><EM>size: </EM>18 kB </MENU> <LI><EM>file: </EM><A HREF="./386.zip">386.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>greatest common divisor (GCD) <LI><EM>title: </EM>Greatest Common Divisor of $n$ Integers and Multipliers <LI><EM>by: </EM>G. H. Bradley <LI><EM>ref: </EM>Comm. ACM 13,7 (July 1970) 447 <LI><EM>size: </EM>2 kB </MENU> <LI><EM>file: </EM><A HREF="./392.zip">392.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 13,9 (Sep 1970) 567 <LI><EM>title: </EM>Systems of Hyperbolic P.D.E. <LI><EM>by: </EM>R. R. Smith and D. McCall <LI><EM>size: </EM>69 kB </MENU> <LI><EM>file: </EM><A HREF="./400.zip">400.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Havie integration with expanded Rutishauser summation numerical integration, quadrature, Romberg integration <LI><EM>title: </EM>Modified {Havie} Integration <LI><EM>by: </EM>G. C. Wallick <LI><EM>ref: </EM>Comm. ACM 13,10 (Oct 1970) 622. </MENU> <LI><EM>file: </EM><A HREF="./403.zip">403.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>circular integer partitions <LI><EM>ref: </EM>Comm. ACM 14 </MENU> <LI><EM>file: </EM><A HREF="./404.zip">404.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>complex gamma function <LI><EM>ref: </EM>Comm. ACM 14 </MENU> <LI><EM>file: </EM><A HREF="./406.zip">406.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>exact solution of linear system by residue arithmetic <LI><EM>ref: </EM>Comm. ACM 14 180 </MENU> <LI><EM>file: </EM><A HREF="./407.zip">407.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>ordinary differential equations <LI><EM>ref: </EM>Comm. ACM 14 185 </MENU> <LI><EM>file: </EM><A HREF="./408.zip">408.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>sparse matrix arithmetic <LI><EM>ref: </EM>Comm. ACM 14 265 </MENU> <LI><EM>file: </EM><A HREF="./410.zip">410.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>sort <LI><EM>ref: </EM>Comm. ACM 15 357 </MENU> <LI><EM>file: </EM><A HREF="./413.zip">413.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>taylor series coefficient by contour integration <LI><EM>ref: </EM>Comm. ACM 14 669 </MENU> <LI><EM>file: </EM><A HREF="./414.zip">414.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Chebyshev Approximation by the method of Remez <LI><EM>lang: </EM>publication Algol </MENU> <LI><EM>file: </EM><A HREF="./419.zip">419.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>polynomial zeros <LI><EM>title: </EM>zeros of a complex polynomial <LI><EM>alg: </EM>Jenkins and Traub <LI><EM>ref: </EM>Comm. ACM 15 (1972) 97-99 </MENU> <LI><EM>file: </EM><A HREF="./420.zip">420.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>surface mesh plot <LI><EM>by: </EM>H. Williamson <LI><EM>ref: </EM>Comm. ACM 15 100 </MENU> <LI><EM>file: </EM><A HREF="./421.zip">421.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Complex Gamma Function with Error Control <LI><EM>by: </EM>H. Kuki <LI><EM>ref: </EM>Comm. ACM 15 (1972) 271-272 <LI><EM>size: </EM>16kB </MENU> <LI><EM>file: </EM><A HREF="./422.zip">422.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>minimal spanning tree <LI><EM>by: </EM>V. K. M. Whitney <LI><EM>ref: </EM>Comm. ACM 15 273 <LI><EM>size: </EM>12kB </MENU> <LI><EM>file: </EM><A HREF="./423.zip">423.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,4 (Apr 1972) 274 <LI><EM>title: </EM>Linear Equation Solver <LI><EM>by: </EM>C. B. Moler <LI><EM>size: </EM>8 kB </MENU> <LI><EM>file: </EM><A HREF="./424.zip">424.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,5 (May 1972) 353 <LI><EM>title: </EM>{Clenshaw}-{Curtis} Quadrature <LI><EM>by: </EM>W. M. Gentleman <LI><EM>size: </EM>19 kB </MENU> <LI><EM>file: </EM><A HREF="./425.zip">425.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,5 (May 1972) 355 <LI><EM>title: </EM>Generation of Random Correlated Normal Variables <LI><EM>by: </EM>R. L. Hurst and R. E. Knop <LI><EM>size: </EM>11 kB </MENU> <LI><EM>file: </EM><A HREF="./427.zip">427.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,5 (May 1972) 358 <LI><EM>title: </EM>{Fourier} Cosine Integral <LI><EM>by: </EM>P. Linz <LI><EM>size: </EM>13 kB </MENU> <LI><EM>file: </EM><A HREF="./429.zip">429.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,8 (Aug 1972) 776 <LI><EM>title: </EM>Localization of the Roots of a Polynomial <LI><EM>by: </EM>W. Squire <LI><EM>size: </EM>11 kB </MENU> <LI><EM>file: </EM><A HREF="./431.zip">431.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,9 (Sep 1972) 818 <LI><EM>title: </EM>A Computer Routine for Quadratic and Linear Programming Problems <LI><EM>by: </EM>A. Ravindran <LI><EM>size: </EM>14 kB </MENU> <LI><EM>file: </EM><A HREF="./432.zip">432.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>matrix Riccati equation AX + XB = C <LI><EM>ref: </EM>Comm. ACM 15 820 </MENU> <LI><EM>file: </EM><A HREF="./433.zip">433.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>univariate interpolation <LI><EM>ref: </EM>Comm. ACM 15 914 </MENU> <LI><EM>file: </EM><A HREF="./434.zip">434.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,11 (Nov 1972) 991 <LI><EM>title: </EM>Exact Probabilities for ${R \times C}$ Contingency Tables <LI><EM>by: </EM>D. L. March <LI><EM>size: </EM>9 kB </MENU> <LI><EM>file: </EM><A HREF="./435.zip">435.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,11 (Nov 1972) 993 <LI><EM>title: </EM>Modified Incomplete Gamma Function <LI><EM>by: </EM>W. Fullerton <LI><EM>size: </EM>22 kB </MENU> <LI><EM>file: </EM><A HREF="./436.zip">436.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,12 (Dec 1972) 1070 <LI><EM>title: </EM>Product Type Trapezoidal Integration <LI><EM>by: </EM>W. R. Boland <LI><EM>size: </EM>8 kB </MENU> <LI><EM>file: </EM><A HREF="./437.zip">437.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,12 (Dec 1972) 1070 <LI><EM>title: </EM>Product Type {Simpson}'s Integration <LI><EM>by: </EM>W. R. Boland <LI><EM>size: </EM>8 kB </MENU> <LI><EM>file: </EM><A HREF="./438.zip">438.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,6 (Jun 1972) 1071 <LI><EM>title: </EM>Product Type Two-point {Gauss}-{Legendre}-{Simpson}'s Integration <LI><EM>by: </EM>E. N. Houstis, W. F. Mitchell and J. R. Rice <LI><EM>size: </EM>8 kB </MENU> <LI><EM>file: </EM><A HREF="./439.zip">439.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 15,12 (Dec 1972) 1072 <LI><EM>title: </EM>Product Type Three-point {Gauss}-{Le}{\-}gendre-{Simp}{\-}son's Integration <LI><EM>by: </EM>W. R. Boland <LI><EM>size: </EM>8 kB </MENU> <LI><EM>file: </EM><A HREF="./441.zip">441.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,1 (Jan 1973) 51 <LI><EM>title: </EM>Random Deviates from the Dipole Distribution <LI><EM>by: </EM>R. E. Knop <LI><EM>size: </EM>6 kB </MENU> <LI><EM>file: </EM><A HREF="./443.zip">443.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,2 (Feb 1973) 123 <LI><EM>title: </EM>Solution of the Transcendental Equation $w e^w = x$ <LI><EM>by: </EM>F. N. Fritsch, R. E. Shafer and W. P. Gowley <LI><EM>size: </EM>14 kB </MENU> <LI><EM>file: </EM><A HREF="./446.zip">446.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,4 (Apr 1973) 254 <LI><EM>title: </EM>Ten Subroutines for the Manipulation of {Chebyshev} Series <LI><EM>by: </EM>R. Broucke <LI><EM>size: </EM>31 kB </MENU> <LI><EM>file: </EM><A HREF="./448.zip">448.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,6 (Jun 1973) 379 <LI><EM>title: </EM>Number of Multiply-Restricted Partitions <LI><EM>by: </EM>T. Beyer and D. F. Swinehart <LI><EM>size: </EM>8 kB </MENU> <LI><EM>file: </EM><A HREF="./449.zip">449.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>solution of linear programming problems in 0-1 variables <LI><EM>ref: </EM>Comm. ACM 16,7 (July 1973) 445 <LI><EM>size: </EM>12kB </MENU> <LI><EM>file: </EM><A HREF="./450.zip">450.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,8 (Aug 1973) 482 <LI><EM>title: </EM>{Rosenbrock} Function Minimization <LI><EM>by: </EM>M. MacHura and A. Mulawa <LI><EM>size: </EM>11 kB </MENU> <LI><EM>file: </EM><A HREF="./451.zip">451.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,8 (Aug 1973) 483 <LI><EM>title: </EM>Chi-Square Quantiles <LI><EM>by: </EM>R. B. Goldstein <LI><EM>size: </EM>14 kB </MENU> <LI><EM>file: </EM><A HREF="./452.zip">452.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,8 (Aug 1973) 485 <LI><EM>title: </EM>Enumerating Combinations of $m$ Out of $n$ Objects <LI><EM>by: </EM>C. N. Liu and D. T. Tang <LI><EM>size: </EM>6 kB </MENU> <LI><EM>file: </EM><A HREF="./453.zip">453.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,8 (Aug 1973) 486 <LI><EM>title: </EM>{Gaussian} Quadrature Formulas for {Bromwich}'s Integral <LI><EM>by: </EM>R. Diessens <LI><EM>size: </EM>26 kB </MENU> <LI><EM>file: </EM><A HREF="./454.zip">454.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,8 (Aug 1973) 487 <LI><EM>title: </EM>The Complex Method for Constrained Optimization <LI><EM>by: </EM>J. A. Richardson and J. L. Kuester <LI><EM>size: </EM>73 kB </MENU> <LI><EM>file: </EM><A HREF="./456.zip">456.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,9 (Sep 1973) 572 <LI><EM>title: </EM>Routing Problem <LI><EM>by: </EM>Z. Fence <LI><EM>size: </EM>15 kB </MENU> <LI><EM>file: </EM><A HREF="./458.zip">458.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>discrete linear l1 approximation <LI><EM>alg: </EM>suboptimization method of interval linear programming <LI><EM>ref: </EM>Comm. ACM 16 629 </MENU> <LI><EM>file: </EM><A HREF="./460.zip">460.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,10 (Oct 1973) 633 <LI><EM>title: </EM>Calculation of Optimum Parameters for Alternating Direction Implicit Procedures <LI><EM>by: </EM>P. E. Saylor and . D. Sebastian <LI><EM>size: </EM>9 kB </MENU> <LI><EM>file: </EM><A HREF="./461.zip">461.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,10 (Oct 1973) 635 <LI><EM>title: </EM>Cubic Spline Solutions to a Class of Functional Differential Equations <LI><EM>by: </EM>F. J. Burkowski and W. D. Hoskins <LI><EM>size: </EM>24 kB </MENU> <LI><EM>file: </EM><A HREF="./462.zip">462.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,10 (Oct 1973) 638 <LI><EM>title: </EM>Bivariate Normal Distribution <LI><EM>by: </EM>T. G. Donnelly <LI><EM>size: </EM>22 kB </MENU> <LI><EM>file: </EM><A HREF="./463.zip">463.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,10 (Oct 1973) 639 <LI><EM>title: </EM>Algorithms {SCALE}1, {SCALE}2, and {SCALE}3 for Determination of Scales on Computer Generated Plots <LI><EM>by: </EM>C. R. Lewart <LI><EM>size: </EM>15 kB </MENU> <LI><EM>file: </EM><A HREF="./467.zip">467.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,11 (Nov 1973) 692 <LI><EM>title: </EM>Matrix Transposition in Place <LI><EM>by: </EM>N. Brenner <LI><EM>size: </EM>12 kB </MENU> <LI><EM>file: </EM><A HREF="./468.zip">468.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,11 (Nov 1973) 694 <LI><EM>title: </EM>Algorithm for Automatic Numerical Integration Over a Finite Interval <LI><EM>by: </EM>T. N. L. Patterson <LI><EM>size: </EM>55 kB </MENU> <LI><EM>file: </EM><A HREF="./470.zip">470.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>Comm. ACM 16,12 (Dec 1973) 760 <LI><EM>title: </EM>Linear Systems with Almost Tridiagonal Matrix <LI><EM>by: </EM>M. Kubicek <LI><EM>size: </EM>16 kB </MENU> <LI><EM>file: </EM><A HREF="./473.zip">473.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Legendre series from Chebyshev series <LI><EM>ref: </EM>Comm. ACM 17 25 </MENU> <LI><EM>file: </EM><A HREF="./474.zip">474.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>bicubic interpolation <LI><EM>ref: </EM>Comm. ACM </MENU> <LI><EM>file: </EM><A HREF="./475.zip">475.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>surface mesh plot <LI><EM>by: </EM>Thomas Wright, NCAR <LI><EM>ref: </EM>PROC 1972 SUMMER COMPUTER SIMULATION CONFERENCE, 261-267 </MENU> <LI><EM>file: </EM><A HREF="./476.zip">476.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>spline under tension <LI><EM>ref: </EM>Comm. ACM 17 220 </MENU> <LI><EM>file: </EM><A HREF="./478.zip">478.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>L1 solution to overdetermined linear system <LI><EM>alg: </EM>simplex <LI><EM>ref: </EM>Comm. ACM 17 319 </MENU> <LI><EM>file: </EM><A HREF="./479.zip">479.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>minimal spanning tree, point clustering <LI><EM>ref: </EM>Comm. ACM 17 321 and remark in TOMS 2 110 </MENU> <LI><EM>file: </EM><A HREF="./481.zip">481.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>critical path, network, precedence networks <LI><EM>ref: </EM>Comm. ACM 17 467 </MENU> <LI><EM>file: </EM><A HREF="./483.zip">483.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>surface mesh plot <LI><EM>ref: </EM>Comm. ACM 17 520 </MENU> <LI><EM>file: </EM><A HREF="./484.zip">484.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>complex modified Bessel function of second kind, K0 and K1 <LI><EM>ref: </EM>Comm. ACM 17 524 </MENU> <LI><EM>file: </EM><A HREF="./485.zip">485.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>interpolating g-spline <LI><EM>ref: </EM>Comm. ACM 17 526 </MENU> <LI><EM>file: </EM><A HREF="./487.zip">487.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>probability of discrepancy between empirical and proposed distribution <LI><EM>alg: </EM>Durbin, Ann. Math. Stat. 389 (1968) 398 <LI><EM>ref: </EM>Comm. ACM 17 703 </MENU> <LI><EM>file: </EM><A HREF="./488.zip">488.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>normal random numbers <LI><EM>alg: </EM>Von Neuman/Forsythe/Ahrens/Dieter/Brent <LI><EM>ref: </EM>Comm. ACM 17 704 </MENU> <LI><EM>file: </EM><A HREF="./490.zip">490.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>real dilogarithm <LI><EM>ref: </EM>Comm. ACM 18 200 </MENU> <LI><EM>file: </EM><A HREF="./493.zip">493.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>polynomial zeros <LI><EM>gams: </EM>F1a1 <LI><EM>title: </EM>zeros of a real polynomial <LI><EM>alg: </EM>Jenkins and Traub <LI><EM>by: </EM>M.A. Jenkins <LI><EM>ref: </EM>ACM TOMS 1 (1975) 178-189 </MENU> <LI><EM>file: </EM><A HREF="./494.zip">494.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>partial and ordinary differential equations, method of lines <LI><EM>gams: </EM>I2a1a <LI><EM>title: </EM>systems of nonlinear parabolic partial differential equations in one space dimension <LI><EM>alg: </EM>method of lines <LI><EM>by: </EM>R.F. Sincovec and N.K. Madsen <LI><EM>ref: </EM>ACM TOMS 1 (1975) 261-263 </MENU> <LI><EM>file: </EM><A HREF="./495.zip">495.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Chebyshev solution, linear system, linear programming, simplex method <LI><EM>gams: </EM>D9a2 <LI><EM>title: </EM>overdetermined systems of linear equations in the Chebyshev norm <LI><EM>alg: </EM>a variant of the simplex method <LI><EM>by: </EM>I. Barrodale and C. Phillips <LI><EM>ref: </EM>ACM TOMS 1 (1975) 264-270 </MENU> <LI><EM>file: </EM><A HREF="./496.zip">496.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>eigenvalue, generalized eigenvalue problem <LI><EM>gams: </EM>D4b4 <LI><EM>title: </EM>generalized eigenvalue problem for complex matrices <LI><EM>alg: </EM>LZ algorithm <LI><EM>by: </EM>L.C. Kaufman <LI><EM>ref: </EM>ACM TOMS 1 (1975) 271-281 </MENU> <LI><EM>file: </EM><A HREF="./497.zip">497.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>functional differential equations, integration, one step, multistep <LI><EM>gams: </EM>I1a1a <LI><EM>title: </EM>integration of functional differential equations, such as retarded ordinary differential equations, Volterra integro-differential equations, and difference differential equations <LI><EM>by: </EM>K.W. Neves <LI><EM>ref: </EM>ACM TOMS 1 (1975) 369-371 </MENU> <LI><EM>file: </EM><A HREF="./498.zip">498.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Airy function, Chebyshev series, asymptotic or Taylor expansion <LI><EM>gams: </EM>C10d <LI><EM>title: </EM>Airy functions Ai(z), Bi(z) and derivatives for real values of z <LI><EM>alg: </EM>Chebyshev series approximations <LI><EM>by: </EM>P.J. Prince <LI><EM>ref: </EM>ACM TOMS 1 (1975) 372-379 </MENU> <LI><EM>file: </EM><A HREF="./499.zip">499.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>pattern recognition, PDE, finite difference, Laplace equation <LI><EM>gams: </EM>I2b4,P <LI><EM>title: </EM>contour scanning path for a two-dimensional region The path is designed to help accelerate the propagation of edge effects when solving two-dimensional partial differential equations using iterative methods <LI><EM>by: </EM>W. Kinsner and E.D. Torre <LI><EM>ref: </EM>ACM TOMS 2 (1976) 82-86 </MENU> <LI><EM>file: </EM><A HREF="./500.zip">500.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>minimization, optimization <LI><EM>gams: </EM>G1b1b <LI><EM>title: </EM>unconstrained minimum of multivariate function <LI><EM>alg: </EM>quasi-Newton <LI><EM>by: </EM>D.F. Shanno and K.H. Phua <LI><EM>ref: </EM>ACM TOMS 1 (1975) 87-94 </MENU> <LI><EM>file: </EM><A HREF="./501.zip">501.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>polynomial approximation, exchange algorithm, Chebyshev approximation <LI><EM>gams: </EM>K2 <LI><EM>title: </EM>best polynomial approximation to a discrete one-dimensional data set in the Chebyshev (minimax) sense <LI><EM>by: </EM>J.C. Simpson <LI><EM>ref: </EM>ACM TOMS 2 (1976) 95-97 </MENU> <LI><EM>file: </EM><A HREF="./502.zip">502.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>nonlinear equation, differentiation parameter, 1 parameter embedding <LI><EM>gams: </EM>F2 <LI><EM>title: </EM>continuation <LI><EM>alg: </EM>modified method of Davidenko, Newton's method, Adam's integration <LI><EM>by: </EM>M. Kubicek <LI><EM>ref: </EM>ACM TOMS 2 (1976) 98-107 </MENU> <LI><EM>file: </EM><A HREF="./503.zip">503.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>linear integral equations, nystrom method <LI><EM>gams: </EM>I3 <LI><EM>title: </EM>one-dimensional linear Fredholm integral equations of the second kind <LI><EM>alg: </EM>Nystrom method using Simpson's and Gauss quadrature <LI><EM>by: </EM>K. Atkinson <LI><EM>ref: </EM>ACM TOMS 2 (1976) 196-199 </MENU> <LI><EM>file: </EM><A HREF="./504.zip">504.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>ODE, IVP, global error estimation, Runge-Kutta-Fehlberg <LI><EM>gams: </EM>I1a1a <LI><EM>title: </EM>nonlinear systems of ordinary differential equations with global error estimate Integration is performed on different meshes and global extrapolation is used to estimate the global error in the more accurate solution. The integration is done using Runge-Kutta-Fehlberg methods of 4th and 5th order <LI><EM>by: </EM>L.F. Shampine and H.A. Watts <LI><EM>ref: </EM>ACM TOMS 2 (1976) 200-203 </MENU> <LI><EM>file: </EM><A HREF="./505.zip">505.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>sorting, searching, linked lists, data structure, list operation <LI><EM>gams: </EM>N6a2a <LI><EM>title: </EM>insertion sort for linked lists, insensitive to the key distribution <LI><EM>ref: </EM>ACM TOMS 2 (1976) 204-206 </MENU> <LI><EM>file: </EM><A HREF="./506.zip">506.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>eigenvalues, QR algorithm <LI><EM>gams: </EM>D4c2b <LI><EM>title: </EM>reduces an upper Hessenberg matrix to quasi-triangular form <LI><EM>alg: </EM>unitary similarity transformations <LI><EM>by: </EM>G.W. Stewart <LI><EM>ref: </EM>ACM TOMS 2 (1976) 275-280 </MENU> <LI><EM>file: </EM><A HREF="./507.zip">507.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>approximation, interpolation, spline approximation, quintic spline <LI><EM>gams: </EM>E1a <LI><EM>title: </EM>interpolating quintic natural spline <LI><EM>by: </EM>J.G. Herriot and C.H. Reinsch <LI><EM>ref: </EM>ACM TOMS 2 (1976) 281-289 <LI><EM>lang: </EM>Algol </MENU> <LI><EM>file: </EM><A HREF="./508.zip">508.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>bandwidth reduction, profile reduction, sparse matrix <LI><EM>gams: </EM>D2e <LI><EM>title: </EM>reducing the bandwidth and profile of sparse symmetric matrices using row and column permutations <LI><EM>by: </EM>H.L. Crane et al. <LI><EM>ref: </EM>ACM TOMS 2 (1976) 375-377 </MENU> <LI><EM>file: </EM><A HREF="./509.zip">509.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>bandwidth reduction, king algorithm, profile reduction, sparse matrix <LI><EM>gams: </EM>D2e <LI><EM>title: </EM>reducing the bandwidth and profile of sparse symmetric matrices. <LI><EM>by: </EM>N.E. Gibbs <LI><EM>ref: </EM>ACM TOMS 2 (1976) 378-387 </MENU> <LI><EM>file: </EM><A HREF="./510.zip">510.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>piecewise linear function <LI><EM>gams: </EM>K4 <LI><EM>title: </EM>piecewise linear approximation of given data points The approximant need not be continuous, and distinct tolerances may be specified for each data point <LI><EM>by: </EM>D.G. Wilson <LI><EM>ref: </EM>ACM TOMS 2 (1976) 388-391 </MENU> <LI><EM>file: </EM><A HREF="./511.zip">511.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Bessel function first kind, Airy function, asymptotic expansion <LI><EM>gams: </EM>C10a3,C10b3 <LI><EM>title: </EM>CDC 6600 Fortran subroutines for Bessel functions Iv(x) and Jv(x), for real x.ge.0, and real v.ge.0 <LI><EM>by: </EM>D.E. Amos, S.L. Daniel, and M.K. Weston <LI><EM>ref: </EM>ACM TOMS 3 (1977) 93-95 </MENU> <LI><EM>file: </EM><A HREF="./512.zip">512.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>linear function, normalized solution, periodic quindiagonal, psd <LI><EM>gams: </EM>D2b2,I2b4b <LI><EM>title: </EM>symmetric positive definite periodic quindiagonal systems of linear equations. <LI><EM>by: </EM>A. Benson, and D.J. Evans <LI><EM>ref: </EM>ACM TOMS 3 (1977) 96-103 </MENU> <LI><EM>file: </EM><A HREF="./513.zip">513.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>transposition in place, matrix transposition, permutation <LI><EM>gams: </EM>D1b3 <LI><EM>title: </EM>in-situ matrix transposition <LI><EM>alg: </EM>makes use of the cyclic structure of the transposition mapping <LI><EM>by: </EM>E.G. Cate and D.W. Twigg <LI><EM>ref: </EM>ACM TOMS 3 (1977) 104-110 </MENU> <LI><EM>file: </EM><A HREF="./514.zip">514.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>interpolation, cubic splines, spline approximation <LI><EM>gams: </EM>E1a <LI><EM>lang: </EM>Algol <LI><EM>title: </EM>piecewise cubic interpolation using local data <LI><EM>by: </EM>M.R. Ellis and D.H. McLain <LI><EM>ref: </EM>ACM TOMS 3 (1977) 175-179 </MENU> <LI><EM>file: </EM><A HREF="./515.zip">515.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>combinations <LI><EM>gams: </EM>B,C1 <LI><EM>title: </EM>generates a vector from a lexicographical index That is, let C1, C2, ... Cm be the set of combinations of n items taken p at a time arranged in lexographical order. Given an integer i, this routine finds Ci <LI><EM>by: </EM>B.P. Buckles and M. Lybanon <LI><EM>ref: </EM>ACM TOMS 3 (1977) 180-182 </MENU> <LI><EM>file: </EM><A HREF="./516.zip">516.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>confidence interval, illinois method, regula falsi, rank test <LI><EM>gams: </EM>L4b1b <LI><EM>title: </EM>confidence intervals and point estimates based on ranks in the two-sample location problem. <LI><EM>by: </EM>J.W. McKean and T.A. Ryan, Jr. <LI><EM>ref: </EM>ACM TOMS 3 (1977) 183-185 </MENU> <LI><EM>file: </EM><A HREF="./517.zip">517.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>key: </EM>eigenvalues, condition number <LI><EM>gams: </EM>D4c2b <LI><EM>title: </EM>condition numbers of matrix eigenvalues without computing eigenvectors <LI><EM>by: </EM>S.P. Chan, R. Feldman, and B.N. Parlett <LI><EM>ref: </EM>ACM TOMS 3 (1977) 186-203 </MENU> <LI><EM>file: </EM><A HREF="./518.zip">518.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>incomplete Bessel function, von mises distribution <LI><EM>gams: </EM>C10b1,L5a1v <LI><EM>title: </EM>computes the left tail area of the Von Mises distribution, which is equal to the incomplete modified Bessel function of the first kind and zero-th order (I0) <LI><EM>by: </EM>G.W. Hill <LI><EM>ref: </EM>ACM TOMS 3 (1977) 279-284 </MENU> <LI><EM>file: </EM><A HREF="./519.zip">519.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Kolmogorov-Smirnov probabilities <LI><EM>gams: </EM>L5a1u <LI><EM>title: </EM>Kolmogorov-Smirnov probabilities with arbitrary boundaries <LI><EM>alg: </EM>RAKK is a generalization of Massey's method. DURB is Durbin's method. EPST is the Epanechnikov, Steck method <LI><EM>by: </EM>R. Kallman <LI><EM>ref: </EM>ACM TOMS 3 (1977) 285-294 </MENU> <LI><EM>file: </EM><A HREF="./520.zip">520.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>resource allocation, linear programming <LI><EM>gams: </EM>G2c5 <LI><EM>title: </EM>resource constrained network scheduling, activities arbitrarily interrupted and restarted later with no increase in activity duration <LI><EM>alg: </EM>automatic revised simplex method <LI><EM>by: </EM>J. Weglarzet et al. <LI><EM>ref: </EM>ACM TOMS 3 (1977) 295-300 </MENU> <LI><EM>file: </EM><A HREF="./521.zip">521.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>integral of the coerror function, Miller recurrence algorithm <LI><EM>gams: </EM>C8a <LI><EM>title: </EM>repeated integrals of the coerror function <LI><EM>by: </EM>W. Gautschi <LI><EM>ref: </EM>ACM TOMS 3 (1977) 301-302 </MENU> <LI><EM>file: </EM><A HREF="./522.zip">522.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>symbolic and algebraic manipulation, linear, congruence technique <LI><EM>gams: </EM>D2a1 <LI><EM>title: </EM>exact solution of systems of linear equations <LI><EM>alg: </EM>multiple-precision integer coefficients, congruence techniques <LI><EM>by: </EM>S. Cabay and T.P.L. Lam <LI><EM>ref: </EM>ACM TOMS 3 (1977) 404-410 </MENU> <LI><EM>file: </EM><A HREF="./523.zip">523.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>partitioning, sorting <LI><EM>gams: </EM>P <LI><EM>title: </EM>planar convex hull <LI><EM>by: </EM>W. F. Eddy <LI><EM>ref: </EM>ACM TOMS 3 (1977) 411-412 </MENU> <LI><EM>file: </EM><A HREF="./524.zip">524.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>multiple precision, extended precision, floating point arithmetic <LI><EM>gams: </EM>A3c <LI><EM>title: </EM>multiple precision floating point arithmetic and evaluating elementary and special functions <LI><EM>by: </EM>R.P. Brent <LI><EM>ref: </EM>ACM TOMS 4 (1978) 71-81 </MENU> <LI><EM>file: </EM><A HREF="./525.zip">525.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>spline approximation, adaptive curve fitting, Hermite interpolation <LI><EM>gams: </EM>K1a1a1,K2,K3,K4 <LI><EM>title: </EM>approximating a user-defined function by a piecewise polynomial of specified smoothness and degree and norm <LI><EM>by: </EM>J.R. Rice <LI><EM>ref: </EM>ACM TOMS 4 (1978) 82-94 </MENU> <LI><EM>file: </EM><A HREF="./526.zip">526.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>bivariate interpolation, piecewise polynomial interpolation <LI><EM>gams: </EM>E2b <LI><EM>title: </EM>bivariate interpolation and smooth surface fitting for irregularly distributed data points <LI><EM>by: </EM>H. Akima <LI><EM>ref: </EM>ACM TOMS 4 (1978) 160-164 </MENU> <LI><EM>file: </EM><A HREF="./527.zip">527.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>marching algorithm, block tridiagonal matrix, elliptic PDE <LI><EM>gams: </EM>I2b1a2,I2b4b <LI><EM>title: </EM>linear systems arising from 5-point discretizations of separable or constant coefficient elliptic boundary-value problems on rectangular domains; Dirichlet,Neumann, mixed, or periodic boundary conditions <LI><EM>alg: </EM>generalized marching algorithm <LI><EM>by: </EM>R.E. Bank <LI><EM>ref: </EM>ACM TOMS 4 (1978) 165-176 </MENU> <LI><EM>file: </EM><A HREF="./528.zip">528.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>libraries, error handling, storage management, machine dependencies <LI><EM>gams: </EM>R1,R3,N4 <LI><EM>title: </EM>framework for a portable Fortran subroutine library: machine-dependent constants, automatic error handling, and dynamic storage allocation using a stack <LI><EM>by: </EM>P.A. Fox, A.D. Hall, and N.L. Schryer <LI><EM>ref: </EM>ACM TOMS 4 (1978) 176-188 </MENU> <LI><EM>file: </EM><A HREF="./529.zip">529.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>symmetric permutations, block triangular, depth first search, sparse <LI><EM>gams: </EM>D2e <LI><EM>title: </EM>finding symmetric permutations to block triangular form That is, given the column numbers of the nonzeros in each row of a sparse matrix, this subroutine finds a symmetric permutation that makes the matrix block lower triangular. <LI><EM>by: </EM>I.S. Duff and J.K. Reid <LI><EM>ref: </EM>ACM TOMS 4 (1978) 189-192 </MENU> <LI><EM>file: </EM><A HREF="./530.zip">530.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>eigenvalue, eigenvector, skew-symmetric matrix, symmetric matrix <LI><EM>gams: </EM>D4a1,D4a2,D4a5 <LI><EM>title: </EM>eigenvalues and eigenvectors of real skew-symmetric matrices or real tridiagonal symmetric matrices with constant diagonals <LI><EM>alg: </EM>orthogonal similarity transformations <LI><EM>by: </EM>R.C. Ward and L.J. Gray <LI><EM>ref: </EM>ACM TOMS 4 (1978) 286-289 </MENU> <LI><EM>file: </EM><A HREF="./531.zip">531.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>contour plotting <LI><EM>gams: </EM>Q <LI><EM>title: </EM>contours through equal values of a surface <LI><EM>by: </EM>W.V. Snyder <LI><EM>ref: </EM>ACM TOMS 4 (1978) 290-294 </MENU> <LI><EM>file: </EM><A HREF="./532.zip">532.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>roundoff analysis, numerical stability, numerical linear algebra <LI><EM>gams: </EM>A3a,S1 <LI><EM>title: </EM>roundoff analysis of noniterative numerical methods <LI><EM>by: </EM>W. Miller and D. Spooner <LI><EM>ref: </EM>ACM TOMS 4 (1978) 388-390 <LI><EM>size: </EM>285 kB </MENU> <LI><EM>file: </EM><A HREF="./533.zip">533.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>sparse matrix, simultaneous linear equations, partial pivoting <LI><EM>gams: </EM>D2a4 <LI><EM>title: </EM>sparse systems of linear equations by sparse Gaussian elimination with partial pivoting <LI><EM>by: </EM>A.H. Sherman <LI><EM>ref: </EM>ACM TOMS 4 (1978) 391-398 </MENU> <LI><EM>file: </EM><A HREF="./534.zip">534.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>stiff ODE, composite multistep, cyclic, initial value problem <LI><EM>gams: </EM>I1a2 <LI><EM>title: </EM>integrating a set of first order ordinary differential equations <LI><EM>alg: </EM>stiffly stable, cyclic composite linear multistep methods <LI><EM>by: </EM>J.M. Tendler, T.A. Bickart, and Z. Picel <LI><EM>ref: </EM>ACM TOMS 4 (1978) 399-403 </MENU> <LI><EM>file: </EM><A HREF="./535.zip">535.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>eigenvalue, generalized eigenvalue problem <LI><EM>gams: </EM>D4b4 <LI><EM>title: </EM>generalized eigenvalue problem for complex matrices <LI><EM>alg: </EM>QZ <LI><EM>by: </EM>B.S. Garbow <LI><EM>ref: </EM>ACM TOMS 4 (1978) 404-410 </MENU> <LI><EM>file: </EM><A HREF="./536.zip">536.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>security transformation, encipher, decipher, multiprecision integer <LI><EM>gams: </EM>B,Z <LI><EM>title: </EM>Purdy's irreversible enciphering function It serves as a machine independent model for studying the evaluation of polynomials mod P and for the implementation of more efficient machine dependent system utility programs for enciphering passwords <LI><EM>by: </EM>H.D. Knoble <LI><EM>ref: </EM>ACM TOMS 5 (1979) 108-111 </MENU> <LI><EM>file: </EM><A HREF="./537.zip">537.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Mathieu differential equation, wave equation, eigenvalue, cylinder function <LI><EM>gams: </EM>C17,I1b3 <LI><EM>title: </EM>characteristic values of Mathieu's differential equation for odd or even solutions <LI><EM>by: </EM>W.R. Leeb <LI><EM>ref: </EM>ACM TOMS 5 (1979) 112-117 </MENU> <LI><EM>file: </EM><A HREF="./538.zip">538.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>eigenvalue, eigenvector, sparse, diagonable, simultaneous iteration <LI><EM>gams: </EM>D4b1 <LI><EM>title: </EM>eigenvalues largest in magnitude and corresponding eigenvectors of a real matrix symmetric relative to a user-defined inner product <LI><EM>alg: </EM>simultaneous iteration algorithm <LI><EM>by: </EM>P.J. Nikolai <LI><EM>ref: </EM>ACM TOMS 5 (1979) 118-125 </MENU> <LI><EM>file: </EM><A HREF="./539.zip">539.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>D1a <LI><EM>title: </EM>Basic Linear Algebraic Subprograms for {FORTRAN} Usage <LI><EM>keywrds: </EM>basic operations of numerical linear algebra, including dot product, Givens transformations, vector copy, swap, norm, and scaling, and determination of the component of largest magnitude <LI><EM>by: </EM>C.L. Lawson et al. <LI><EM>ref: </EM>ACM TOMS 5 (1979) 324-325 </MENU> <LI><EM>file: </EM><A HREF="./540.zip">540.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>collocation, PDE, method of lines <LI><EM>gams: </EM>I2a1a,I2a2 <LI><EM>title: </EM>{PDECOL:} General Collocation Software for Partial Differential Equations <LI><EM>for: </EM>coupled systems of nonlinear partial differential equations in one space and one time dimension. The solution method uses finite element collocation based upon piecewise polynomials for spatial discretization. The time discretization is done by general-purpose software for ordinary initial value problems <LI><EM>by: </EM>N.K. Madsen and R.F. Sincovec <LI><EM>ref: </EM>ACM TOMS 5 (1979) 326-351 </MENU> <LI><EM>file: </EM><A HREF="./541.zip">541.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>elliptic PDE, linear system <LI><EM>gams: </EM>I2b1a1a,I2b4b <LI><EM>title: </EM>Efficient {FORTRAN} Subprograms for the Solution of Separable Elliptic Partial Differential Equations <LI><EM>for: </EM>separable elliptic partial differential equations. Handles the Helmholtz equation in Cartesian, polar, surface spherical coordinates, cylindrical and interior spherical coordinates. Includes software for systems of linear equations from finite difference approximations to general separable problems <LI><EM>by: </EM>P.N. Swarztrauber and R.A. Sweet <LI><EM>ref: </EM>ACM TOMS 5 (1979) 352-364 </MENU> <LI><EM>file: </EM><A HREF="./542.zip">542.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>incomplete gamma function, taylors series, continued fractions <LI><EM>gams: </EM>C7e <LI><EM>title: </EM>Incomplete Gamma Functions <LI><EM>for: </EM>Taylor's series and continued fractions for evaluating Tricomi's incomplete gamma function and the complementary incomplete gamma function <LI><EM>by: </EM>W. Gautschi <LI><EM>ref: </EM>ACM TOMS 5 (1979) 482-489 </MENU> <LI><EM>file: </EM><A HREF="./543.zip">543.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>fft, fast helmholtz solver, fast poisson solver <LI><EM>gams: </EM>I2b1a1a <LI><EM>title: </EM>{FFT}9: Fast Solution of {Helmholtz}-Type Partial Differential Equations <LI><EM>for: </EM>Dirichlet problem for the Helmholtz equation on a rectangle <LI><EM>alg: </EM>4th and 6th order accurate 9-point finite difference approximations and fast Fourier solution techniques <LI><EM>by: </EM>E.N. Houstis and T.S. Papatheodorou <LI><EM>ref: </EM>ACM TOMS 5 (1979) 490-493 </MENU> <LI><EM>file: </EM><A HREF="./544.zip">544.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>covariant, iterative refinement, least square, over or under determined <LI><EM>gams: </EM>D9b1 <LI><EM>title: </EM>{L2A} and {L2B} Weighted Least Squares Solutions by Modified {Gram}-{Schmidt} with Iterative Refinement <LI><EM>for: </EM>weighted least squares problems, overdetermined and underdetermined systems of linear equations, and problems where the solution is subject, to linear equality constraints. covariance matrix of the solution vector <LI><EM>alg: </EM>modified Gram-Schmidt with iterative refinement <LI><EM>by: </EM>R.H. Wampler <LI><EM>ref: </EM>ACM TOMS 5 (1979) 494-499 </MENU> <LI><EM>file: </EM><A HREF="./545.zip">545.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>multidimensional fft, mass storage fft, optimal sorting <LI><EM>gams: </EM>J1a1,J1a2,J1b <LI><EM>title: </EM>An Optimized Mass Storage {FFT} <LI><EM>for: </EM>computing real and complex fast Fourier transforms, minimizing I/O <LI><EM>by: </EM>D. Fraser <LI><EM>ref: </EM>ACM TOMS 5 (1979) 500-517 </MENU> <LI><EM>file: </EM><A HREF="./546.zip">546.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>almost block diagonal, gaussian elimination, spline approximation, ODE <LI><EM>gams: </EM>D2a2,E3d,I1c <LI><EM>title: </EM>SOLVEBLOK <LI><EM>for: </EM>almost block diagonal linear systems Such matrices arise naturally in piecewise polynomial interpolation or approximation and in finite element methods for two-point boundary value problems <LI><EM>by: </EM>C. de Boor and R. Weiss <LI><EM>ref: </EM>ACM TOMS 6 (1980) 88-91 </MENU> <LI><EM>file: </EM><A HREF="./547.zip">547.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>discrete cubic splines, discrete natural splines, interpolation <LI><EM>gams: </EM>E1a <LI><EM>title: </EM>{FORTRAN} Routines For Discrete Cubic Spline Interpolation and Smoothing <LI><EM>for: </EM>discrete cubic spline interpolation and smoothing <LI><EM>by: </EM>C.S. Duris <LI><EM>ref: </EM>ACM TOMS 6 (1980) 92-103 </MENU> <LI><EM>file: </EM><A HREF="./548.zip">548.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>assignment problem, Hungarian algorithm <LI><EM>gams: </EM>G2b <LI><EM>title: </EM>Solution of the Assignment Problem <LI><EM>for: </EM>the square assignment problem. <LI><EM>by: </EM>G. Carpaneto and P. Toth <LI><EM>ref: </EM>ACM TOMS 6 (1980) 104-111 </MENU> <LI><EM>file: </EM><A HREF="./549.zip">549.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>C15 <LI><EM>title: </EM>{Weierstrass}' Elliptic Functions <LI><EM>for: </EM>Weierstrass's P-functions in the equiharmonic and lemniscatic cases <LI><EM>by: </EM>U. Eckhardt <LI><EM>ref: </EM>ACM TOMS 6 (1980) 112-120 </MENU> <LI><EM>file: </EM><A HREF="./550.zip">550.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>polyhedron, graphics, numerical integration <LI><EM>gams: </EM>P <LI><EM>title: </EM>Solid Polyhedron Measures <LI><EM>for: </EM>computing surface area, centroid, volume, weight, moments, and products of inertia of solid polyhedra <LI><EM>by: </EM>A.M. Messner and G.Q. Taylor <LI><EM>ref: </EM>ACM TOMS 6 (1980) 121-130 </MENU> <LI><EM>file: </EM><A HREF="./551.zip">551.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>overdetermined system, linear programming, dual simplex algorithm <LI><EM>gams: </EM>D9a3 <LI><EM>title: </EM>A {FORTRAN} Subroutine for the ${L_1}$ Solution of Overdetermined Systems of Linear Equations <LI><EM>for: </EM>overdetermined system of linear equations in the L1 norm <LI><EM>alg: </EM>a dual simplex algorithm to the linear programming formulation of the given problem <LI><EM>by: </EM>N.N. Abdelmalek <LI><EM>ref: </EM>ACM TOMS 6 (1980) 228-230 </MENU> <LI><EM>file: </EM><A HREF="./552.zip">552.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>constrained L-sub-1 approximation, linear programming, simplex method <LI><EM>gams: </EM>D9a3,D9b3 <LI><EM>title: </EM>Solution of the Constrained ${L_1}$ Linear Approximation Problem <LI><EM>for: </EM>L1 solution to linear equations subject to linear equality and inequality constraints <LI><EM>alg: </EM>modified simplex method <LI><EM>by: </EM>I. Barrodale and F.D.K. Roberts <LI><EM>ref: </EM>ACM TOMS 6 (1980) 231-235 </MENU> <LI><EM>file: </EM><A HREF="./553.zip">553.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>parabolic PDE, semidiscretization, explicit time integrator <LI><EM>gams: </EM>I1a1a,I2a1 <LI><EM>title: </EM>{M3RK:} An Explicit Time Integrator for Semidiscrete Parabolic Equations <LI><EM>for: </EM>initial value problems for nonlinear first-order systems of ordinary differential equations which originate from semi-discretization of parabolic partial differential equations <LI><EM>alg: </EM>stabilized, explicit three-step Runge-Kutta formulas of order one and two, and degree 2 through 12. <LI><EM>by: </EM>J.G. Verwer <LI><EM>ref: </EM>ACM TOMS 6 (1980) 236-239 </MENU> <LI><EM>file: </EM><A HREF="./554.zip">554.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>nonlinear equation, Brent method <LI><EM>gams: </EM>F2 <LI><EM>title: </EM>{BRENTM:} A {FORTRAN} Subroutine for the Numerical Solution of Systems of Nonlinear Equations <LI><EM>for: </EM>nonlinear equations <LI><EM>alg: </EM>modification of Brent's method. <LI><EM>by: </EM>J.J. More and M.Y. Cosnard <LI><EM>ref: </EM>ACM TOMS 6 (1980) 240-251 </MENU> <LI><EM>file: </EM><A HREF="./555.zip">555.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>fixed point, nonlinear system, homotopy, continuation, zeros <LI><EM>gams: </EM>F2 <LI><EM>title: </EM>{Chow}-{Yorke} Algorithm for Fixed Points or Zeros of {$C^2$} Maps <LI><EM>for: </EM>fixed points or zeros of a vector function <LI><EM>by: </EM>L.T. Watson and D. Fenner <LI><EM>ref: </EM>ACM TOMS 6 (1980) 252-259 </MENU> <LI><EM>file: </EM><A HREF="./556.zip">556.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>exponential integral, miller algorithm, confluent hypergeometric <LI><EM>gams: </EM>C5 <LI><EM>title: </EM>Exponential Integrals <LI><EM>for: </EM>sequences of exponential integrals E(n+k, x), k=0, 1, ..., m-1 for n.ge.1, and x.ge.0 <LI><EM>by: </EM>D.E. Amos <LI><EM>ref: </EM>ACM TOMS 6 (1980) 420-428 </MENU> <LI><EM>file: </EM><A HREF="./557.zip">557.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>goal, multiple objective optimization, constraint partitioning, simplex <LI><EM>gams: </EM>G2a1 <LI><EM>title: </EM>{PAGP} A Partitioning Algorithm for (Linear) Goal Programming Problems <LI><EM>for: </EM>a partitioning algorithm for linear goal programming problems. <LI><EM>by: </EM>J.L. Arthur and A. Ravindran <LI><EM>ref: </EM>ACM TOMS 6 (1980) 429 </MENU> <LI><EM>file: </EM><A HREF="./558.zip">558.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>multifacility, optimal location, rectilinear distance, minimum cut <LI><EM>gams: </EM>G2c5 <LI><EM>title: </EM>A Program for the Multifacility Location Problem with Rectilinear Distance by the Minimum-cut Approach <LI><EM>for: </EM>one-dimensional multifacility location problem with rectilinear distance <LI><EM>alg: </EM>minimum-cut approach. <LI><EM>by: </EM>T. Cheung <LI><EM>ref: </EM>ACM TOMS 6 (1980) 430-431 </MENU> <LI><EM>file: </EM><A HREF="./559.zip">559.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>quadratic programming, orthogonal decomposition <LI><EM>gams: </EM>G2e1,G2e2 <LI><EM>title: </EM>The Stationary Point of a Quadratic Function Subject to Linear Constraints <LI><EM>for: </EM>stationary point of a quadratic function of n variables subject to linear constraints <LI><EM>by: </EM>J.T. Betts <LI><EM>ref: </EM>ACM TOMS 6 (1980) 432-436 </MENU> <LI><EM>file: </EM><A HREF="./560.zip">560.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Jordan normal, canonical, eigenvalue, eigenvector, block diagonal <LI><EM>gams: </EM>D4c5 <LI><EM>title: </EM>{JNF:} An Algorithm for Numerical Computation of the {Jordan} Normal Form of a Complex Matrix <LI><EM>for: </EM>Jordan normal form of a complex square matrix <LI><EM>by: </EM>B. Kagstrom and A. Ruhe <LI><EM>ref: </EM>ACM TOMS 6 (1980) 437-443 </MENU> <LI><EM>file: </EM><A HREF="./561.zip">561.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>heap, table maintenance <LI><EM>gams: </EM>N4 <LI><EM>title: </EM>efficient table maintenance using heaps <LI><EM>by: </EM>D.K. Kahaner <LI><EM>ref: </EM>ACM TOMS 6 (1980) 444-449 </MENU> <LI><EM>file: </EM><A HREF="./562.zip">562.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>shortest path, shortest route problem <LI><EM>gams: </EM>G2d1 <LI><EM>title: </EM>shortest path from a specific node to all other nodes in a network <LI><EM>by: </EM>U. Pape <LI><EM>ref: </EM>ACM TOMS 6 (1980) 450-455 </MENU> <LI><EM>file: </EM><A HREF="./563.zip">563.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>overdetermined system, linear constraint, discrete approximation <LI><EM>gams: </EM>D9b3 <LI><EM>title: </EM>A Program for Linearly Constrained Discrete ${L_1}$ Problems <LI><EM>for: </EM>overdetermined systems of linear equations in the L1 sense, with or without linear constraints <LI><EM>by: </EM>R.H. Bartels and A.R. Conn <LI><EM>ref: </EM>ACM TOMS 6 (1980) 609-614 </MENU> <LI><EM>file: </EM><A HREF="./564.zip">564.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>L-sub-1 approximation, least absolute deviation, problem generator <LI><EM>gams: </EM>K3,K6d,L6b12,L8a2,L8c3 <LI><EM>title: </EM> A Test Problem Generator for Discrete Linear ${L_1}$ Approximation Problems <LI><EM>for: </EM>generating test problems for discrete linear L-sub-1 approximation problems <LI><EM>by: </EM>K.L. Hoffman and D.R. Shier <LI><EM>ref: </EM>ACM TOMS 6 (1980) 615-617 </MENU> <LI><EM>file: </EM><A HREF="./565.zip">565.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>PDE, method of lines, finite differences, ODE <LI><EM>gams: </EM>I2a1b,I2a2 <LI><EM>title: </EM>{PDETWO}\slash{PSETM}\slash{GEARB}: Solution for Systems of Two-Dimensional Nonlinear Partial Differential Equations <LI><EM>for: </EM>time-dependent coupled systems of nonlinear partial differential equations over a two-dimensional rectangular region <LI><EM>by: </EM>D.K. Melgaard and R.F. Sincovec <LI><EM>ref: </EM>ACM TOMS 7 (1981) 126-135 </MENU> <LI><EM>file: </EM><A HREF="./566.zip">566.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>nonlinear equations, least square, unconstrained minimization, optimization <LI><EM>gams: </EM>F3,G4f <LI><EM>title: </EM>testing unconstrained optimization software <LI><EM>by: </EM>J.J. More, B.S. Garbow, and K.E. Hillstrom; Averbukh, Figueroa, Schlick <LI><EM>ref: </EM>ACM TOMS 7 (1981) 136-140; remark TOMS 20(1994)282 <LI><EM>size: </EM>268 kB </MENU> <LI><EM>file: </EM><A HREF="./567.zip">567.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>momenta, extended range, Legendre polynomial, overflow, underflow <LI><EM>gams: </EM>A3d,C9,C3a2 <LI><EM>title: </EM>NORMP <LI><EM>for: </EM>normalized Legendre polynomials, varying order, fixed argument and degree; extended-range arithmetic <LI><EM>by: </EM>D.W. Lozier and J.M. Smith <LI><EM>ref: </EM>ACM TOMS 7 (1981) 141-146 </MENU> <LI><EM>file: </EM><A HREF="./568.zip">568.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>file directory system, Unix, ratfor <LI><EM>gams: </EM>Z <LI><EM>title: </EM>PDS <LI><EM>for: </EM>a portable file directory system implemented in Fortran <LI><EM>by: </EM>D.R. Hanson <LI><EM>ref: </EM>ACM TOPLAS vol. 3, pp. 162-167 </MENU> <LI><EM>file: </EM><A HREF="./569.zip">569.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>ODE, BVP, collocation, mesh selection, error estimates, damped newton <LI><EM>gams: </EM>I1b2 <LI><EM>title: </EM>COLSYS <LI><EM>for: </EM>nonlinear multi-point boundary value problems for mixed order systems of ordinary differential equations <LI><EM>alg: </EM>spline collocation at Gaussian points using a B-spline basis. <LI><EM>by: </EM>U. Ascher, J. Christiansen, and R.D. Russell <LI><EM>ref: </EM>ACM TOMS 7 (1981) 223-229 </MENU> <LI><EM>file: </EM><A HREF="./570.zip">570.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>eigenvalue, eigenvector, iteration, real sparse nonsymmetric matrix <LI><EM>gams: </EM>D4a7 <LI><EM>title: </EM>LOPSI <LI><EM>for: </EM>approximations to right or left eigenvectors corresponding to the dominant set of eigenvalues of a real symmetric matrix <LI><EM>alg: </EM>simultaneous iteration <LI><EM>by: </EM>W.J. Stewart and A. Jennings <LI><EM>ref: </EM>ACM TOMS 7 (1981) 230-232 </MENU> <LI><EM>file: </EM><A HREF="./571.zip">571.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>direction statistic, Mises or Fisher distribution, continued fraction <LI><EM>gams: </EM>C10b,L5a1v <LI><EM>title: </EM>BESRAT, VKAPPA, SPHERR, CAPPA3 <LI><EM>for: </EM>statistics for von Mises's and Fisher's distributions of directions (the ratio of modified Bessel functions of the first kind) <LI><EM>by: </EM>G.W. Hill <LI><EM>ref: </EM>ACM TOMS 7 (1981) 233-238 </MENU> <LI><EM>file: </EM><A HREF="./572.zip">572.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Helmholtz equation, capacitance matrix, poisson solver, conjugate gradient <LI><EM>gams: </EM>I2b1a1b <LI><EM>title: </EM>HELM3D <LI><EM>for: </EM>the Dirichlet problem for the Helmholtz equation on general bounded three-dimensional regions <LI><EM>alg: </EM>second-order accurate finite differences, capacitance matrix, conjugate gradient <LI><EM>by: </EM>D.P. O'Leary and O. Widlund <LI><EM>ref: </EM>ACM TOMS 7 (1981) 239-246 </MENU> <LI><EM>file: </EM><A HREF="./573.zip">573.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>optimization, nonlinear least square, regression, quasi-newton, secant <LI><EM>gams: </EM>K1b1a1 <LI><EM>title: </EM>NL2SOL <LI><EM>for: </EM>adaptive nonlinear least-squares algorithm <LI><EM>by: </EM>J.E. Dennis, D.M. Gay, and R.E. Welsch <LI><EM>ref: </EM>ACM TOMS 7 (1981) 367-383 </MENU> <LI><EM>file: </EM><A HREF="./574.zip">574.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>interpolation, osculation, shape, convexity, monotonicity, Bernstein <LI><EM>gams: </EM>E1a <LI><EM>title: </EM>Shape-Preserving Osculatory Quadratic Splines <LI><EM>for: </EM>The spline is a piecewise quadratic Bernstein polynomial with a continuous first derivative which interpolates given function and first derivative values, and preserves monotonicity and convexity in the data <LI><EM>by: </EM>D.F. Mcallister and J.A. Roulier <LI><EM>ref: </EM>ACM TOMS 7 (1981) 384-386 </MENU> <LI><EM>file: </EM><A HREF="./575.zip">575.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>nonsymmetric permutations, maximum transversal, maximum assignment <LI><EM>gams: </EM>D2e <LI><EM>title: </EM>permutations for a zero-free diagonal <LI><EM>for: </EM>That is, given the pattern of nonzeros of a sparse matrix, this routine attempts to find a permutation of its rows that makes the matrix have no zeros on its diagonal <LI><EM>by: </EM>I.S. Duff <LI><EM>ref: </EM>ACM TOMS 7 (1981) 387-390 </MENU> <LI><EM>file: </EM><A HREF="./576.zip">576.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>simultaneous linear equation, gauss elimination, pivoting strategy <LI><EM>gams: </EM>D2a1,D9a1,D9a4 <LI><EM>title: </EM>A {FORTRAN} Program for Solving ${\bf A}x=b$ <LI><EM>for: </EM>(possibly singular) linear algebraic equations <LI><EM>alg: </EM>Gaussian elimination combined with a new pivoting strategy particularly well suited to problems where residuals can be made small by solving for fewer than n of the unknowns <LI><EM>by: </EM>I. Barrodale and G.F. Stuart <LI><EM>ref: </EM>ACM TOMS 7 (1981) 391-397 </MENU> <LI><EM>file: </EM><A HREF="./577.zip">577.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>elliptic integral, inverse circular or hyperbolic function, r-function <LI><EM>gams: </EM>C14 <LI><EM>title: </EM>Algorithms for Incomplete Elliptic Integrals <LI><EM>for: </EM>symmetric incomplete elliptic integrals of the first, second, and third kinds <LI><EM>by: </EM>B.C. Carlson and E.M. Notis <LI><EM>ref: </EM>ACM TOMS 7 (1981) 398-403 </MENU> <LI><EM>file: </EM><A HREF="./578.zip">578.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Gaussian elimination, paged virtual store <LI><EM>gams: </EM>D2a1 <LI><EM>title: </EM>Solution of Real Linear Equations in a Paged Virtual Store <LI><EM>alg: </EM>blocks of consecutive columns <LI><EM>by: </EM>J.J. Du Croz et al. <LI><EM>ref: </EM>ACM TOMS 7 (1981) 537-189 </MENU> <LI><EM>file: </EM><A HREF="./579.zip">579.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>differentiation, taylor series coefficients, analytic function <LI><EM>gams: </EM>K4 <LI><EM>title: </EM>{CPSC:} Complex Power Series Coefficients <LI><EM>by: </EM>B. Fornberg <LI><EM>ref: </EM>ACM TOMS 7 (1981) 542-547 </MENU> <LI><EM>file: </EM><A HREF="./580.zip">580.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>matrix factorization, orthogonalization <LI><EM>gams: </EM>D7c <LI><EM>title: </EM>{QRUP}: A Set of {FORTRAN} Routines for Updating {QR} Factorizations <LI><EM>alg: </EM>Gramm-Schmidt orthogonalization <LI><EM>by: </EM>A. Buckley <LI><EM>ref: </EM>ACM TOMS 7 (1981) 548-549 </MENU> <LI><EM>file: </EM><A HREF="./581.zip">581.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>singular value decomposition, SVD <LI><EM>gams: </EM>D6 <LI><EM>title: </EM>An Improved Algorithm for Computing the Singular Value Decomposition <LI><EM>alg: </EM>QR and Golub-Reinsch <LI><EM>by: </EM>T. F. Chan <LI><EM>ref: </EM>ACM TOMS 8 (1982) pp. 84-88 </MENU> <LI><EM>file: </EM><A HREF="./582.zip">582.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>bandwidth, profile, wavefront, matrix, Gibbs-Poole-Stockmeyer, Gibbs-King <LI><EM>gams: </EM>D2e <LI><EM>title: </EM>The {Gibbs}-{Poole}-{Stockmeyer} and {Gibbs}-{King} Algorithms for Reordering Sparse Matrices <LI><EM>by: </EM>J.G. Lewis <LI><EM>ref: </EM>ACM TOMS 8 (1982) 190-194 </MENU> <LI><EM>file: </EM><A HREF="./583.zip">583.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>variance, conjugate gradient, least square, simultaneous equation, regression <LI><EM>gams: </EM>D9a1 <LI><EM>title: </EM>{LSQR}: Sparse Linear Equations and Least-Square Problems <LI><EM>for: </EM>overdetermined or underdetermined sparse systems of linear equations, sparse least squares problems, and damped sparse least squares problems <LI><EM>by: </EM>C.C. Paige and M.A. Saunders <LI><EM>ref: </EM>ACM TOMS 8 (1982) 195-209 </MENU> <LI><EM>file: </EM><A HREF="./584.zip">584.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>quadrature rule <LI><EM>gams: </EM>H2b2a1 <LI><EM>title: </EM>{CUBTRI} -- Automatic Cubature Over a Triangle <LI><EM>by: </EM>D.P. Laurie <LI><EM>ref: </EM>ACM TOMS 8 (1982) 210-218 </MENU> <LI><EM>file: </EM><A HREF="./585.zip">585.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>convergence, extrapolation, interpolation, least squares, Neville-Aitken <LI><EM>gams: </EM>A7,E1c <LI><EM>title: </EM>A Subroutine for the General Interpolation and Extrapolation Problems </MENU> <LI><EM>for: </EM>sequence extrapolation and generalized interpolation by a linear combination of functions forming a Chebyshev system <LI><EM>alg: </EM>E-algorithm, Muhlbach-Neville-Aitken, Epsilon Algorithm of Wynn <LI><EM>by: </EM>C. Brezinski <LI><EM>ref: </EM>ACM TOMS 8 (1982) 290-301 </MENU> <LI><EM>file: </EM><A HREF="./586.zip">586.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>iterative methods, sparse matrix <LI><EM>gams: </EM>D2b4 <LI><EM>title: </EM>{ITPACK} 2{C}: A {FORTRAN} Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods <LI><EM>for: </EM>large sparse linear systems by adaptive accelerated iterative methods <LI><EM>by: </EM>D.R. Kincaid et al. <LI><EM>ref: </EM>ACM TOMS 8 (1982) 302-322 </MENU> <LI><EM>file: </EM><A HREF="./587.zip">587.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>linear least squares, constraints, covariance matrix <LI><EM>gams: </EM>D9b1 <LI><EM>title: </EM>Two Algorithms for the Linearly Constrained Least Squares Problem <LI><EM>for: </EM>least squares problems with linear equality and/or inequality constraints <LI><EM>by: </EM>R.J. Hanson and K.H. Haskell <LI><EM>ref: </EM>ACM TOMS 8 (1982) 323-333 <LI><EM>size: </EM>213 kB </MENU> <LI><EM>file: </EM><A HREF="./588.zip">588.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Hankel transforms, Bessel function first kind, convolution integral <LI><EM>gams: </EM>C10f,J,J2 <LI><EM>title: </EM>Fast {Hankel} Transforms Using Related and Lagged Convolutions <LI><EM>by: </EM>W.L. Anderson <LI><EM>ref: </EM>ACM TOMS 8 (1982) 369-370 </MENU> <LI><EM>file: </EM><A HREF="./589.zip">589.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>matrix eigensystem, iterative method, eigensystem improvement <LI><EM>gams: </EM>D2a4,D4c,D4c1b3,D4c2c <LI><EM>title: </EM>{SICEDR}: A {FORTRAN} Subroutine for Improving the Accuracy of Computed Matrix Eigenvalues <LI><EM>for: </EM>improving the accuracy of computed real matrix eigenvalues and improving or computing the associated eigenvector <LI><EM>by: </EM>J.J. Dongarra <LI><EM>ref: </EM>ACM TOMS 8 (1982) 371-375 </MENU> <LI><EM>file: </EM><A HREF="./590.zip">590.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>generalized eigenvalue, QZ algorithm <LI><EM>gams: </EM>D4c1b3 <LI><EM>title: </EM>{DSUBSP} AND {EXCHQZ}: {FORTRAN} Subroutines for Computing Deflating Subspaces With Specified Spectrum <LI><EM>by: </EM>P. Van Dooren <LI><EM>ref: </EM>ACM TOMS 8 (1982) 376-382 </MENU> <LI><EM>file: </EM><A HREF="./591.zip">591.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>linear model, variance, unbalanced data, missing cells, hypothesis test <LI><EM>gams: </EM>L7d <LI><EM>title: </EM>A Comprehensive Matrix-Free Algorithm for Analysis of Variance <LI><EM>for: </EM>storage-efficient analysis of variance of balanced data, unbalanced data, and unbalanced data with missing cells <LI><EM>by: </EM>W.J. Hemmerle <LI><EM>ref: </EM>ACM TOMS 8 (1982) 383-401 </MENU> <LI><EM>file: </EM><A HREF="./592.zip">592.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>optimal estimation, optimal interpolation, perfect splines <LI><EM>gams: </EM>E1a <LI><EM>title: </EM>A {FORTRAN} Subroutine for Computing the Optimal Estimate of $f(x)$ <LI><EM>for: </EM>Given values and a bound on the kth derivative, determines the range of possible values of a function <LI><EM>by: </EM>P.W. Gaffney <LI><EM>ref: </EM>ACM TOMS 9 (1983) 98-116 </MENU> <LI><EM>file: </EM><A HREF="./593.zip">593.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Helmholtz, capacitance matrix, fast poisson solver, conjugate gradient <LI><EM>gams: </EM>I2b1a1b <LI><EM>title: </EM>A Package for the {Helmholtz} Equation in Nonrectangular Planar Regions <LI><EM>for: </EM>the Helmholtz equation on bounded nonrectangular planar regions with Dirichlet or Neumann boundary conditions <LI><EM>alg: </EM>Fourier method extended to nonrectangular regions using the capacitance matrix method <LI><EM>by: </EM>W. Proskurowski <LI><EM>ref: </EM>ACM TOMS 9 (1983) 117-124 </MENU> <LI><EM>file: </EM><A HREF="./594.zip">594.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>roundoff analysis, relative errors, numerical stability <LI><EM>gams: </EM>A3a <LI><EM>title: </EM>Software for Relative Error Analysis <LI><EM>by: </EM>J.L. Larson, M.E. Pasternak, and J.A. Wisniewski <LI><EM>ref: </EM>ACM TOMS 9 (1983) 125-130 </MENU> <LI><EM>file: </EM><A HREF="./595.zip">595.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>hamiltonian circuit, depth-first search <LI><EM>gams: </EM>P <LI><EM>title: </EM>An Enumerative Algorithm for Finding {Hamiltonian} Circuits in a Directed Graph <LI><EM>by: </EM>S. Martello <LI><EM>ref: </EM>ACM TOMS 9 (1983) 131-138 </MENU> <LI><EM>file: </EM><A HREF="./596.zip">596.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>underdetermined system, parameterized equation, continuation, limit point <LI><EM>gams: </EM>F2 <LI><EM>title: </EM>A Program for a Locally Parametrized Continuation Process <LI><EM>alg: </EM>local parameterization, curvature estimates to control stepsize <LI><EM>by: </EM>W.C. Rheinboldt and J.V. Burkardt <LI><EM>ref: </EM>ACM TOMS 9 (1983) 236-241 </MENU> <LI><EM>file: </EM><A HREF="./597.zip">597.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Bessel function <LI><EM>gams: </EM>C10b3 <LI><EM>title: </EM>Sequence of Modified {Bessel} Functions of the First Kind <LI><EM>for: </EM>sequences of modified Bessel functions of the first kind (real argument and real order <LI><EM>by: </EM>W.J. Cody <LI><EM>ref: </EM>ACM TOMS 9 (1983) 242-245 </MENU> <LI><EM>file: </EM><A HREF="./598.zip">598.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>matrix equations, solvent, newtons method, qz algorithm <LI><EM>gams: </EM>D8 <LI><EM>title: </EM>An Algorithm to Compute Solvents of the Matrix Equation ${AX}^2+{BX}+{C}=0$ <LI><EM>by: </EM>G.W. Davis <LI><EM>ref: </EM>ACM TOMS 9 (1983) 246-254 </MENU> <LI><EM>file: </EM><A HREF="./599.zip">599.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>gamma, poisson distribution, random numbers, accept-reject method <LI><EM>gams: </EM>L6a7,L6a16,L6a21,L6a5,L6a14 <LI><EM>title: </EM>Sampling From Gamma and {Poisson} Distributions <LI><EM>for: </EM>exponential, gamma, normal, Poisson, and uniform distributions <LI><EM>by: </EM>J.H. Ahrens, K.D. Kohrt, and U. Dieter <LI><EM>ref: </EM>ACM TOMS 9 (1983) 255-257 </MENU> <LI><EM>file: </EM><A HREF="./600.zip">600.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>approximation, interpolation, spline approximation, quintic spline <LI><EM>gams: </EM>E1a <LI><EM>title: </EM>Translation of Algorithm 507. Procedures for Quintic Natural Spline Interpolation <LI><EM>for: </EM>quintic natural spline interpolation. translation of algorithm 507 <LI><EM>by: </EM>J.G. Herriot and C.H. Reinsch <LI><EM>ref: </EM>ACM TOMS 9 (1983) 258-259 </MENU> <LI><EM>file: </EM><A HREF="./601.zip">601.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>sparse matrix <LI><EM>gams: </EM>D1b5,D1b6 <LI><EM>title: </EM>A Sparse Matrix Package -- Part {II}: Special Cases <LI><EM>for: </EM>transposing, multiplying and adding pairs of sparse matriceses <LI><EM>by: </EM>J.M. McNamee <LI><EM>ref: </EM>ACM TOMS 9 (1983) 344-345 </MENU> <LI><EM>file: </EM><A HREF="./602.zip">602.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>acceleration of convergence, divergent series, Levin's u transform <LI><EM>gams: </EM>A7 <LI><EM>title: </EM>{HURRY}: An Acceleration Algorithm for Scalar Sequences and Series <LI><EM>for: </EM>accelerating the convergence of alternating and monotone sequences and series <LI><EM>alg: </EM>Levin's u transform The routine estimates truncation and roundoff errors to make a near-optimal stopping decision and provide a good estimate of the accuracy <LI><EM>by: </EM>T. Fessler, W.F. Ford, and D.A. Smith <LI><EM>ref: </EM>ACM TOMS 9 (1983) 355-357 </MENU> <LI><EM>file: </EM><A HREF="./603.zip">603.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>almost block and diagonal systems, gaussian elimination, 2 point BVP <LI><EM>gams: </EM>D2a2,E3d,I1c <LI><EM>title: </EM>{COLROW} and {ARCECO}: {FORTRAN} Packages for Solving Almost Block Diagonal Linear Systems by Modified Alternate Row and Column Elimination <LI><EM>for: </EM>almost block diagonal linear systems <LI><EM>alg: </EM>modified alternate row and column elimination. <LI><EM>by: </EM>J.C. Diaz, G. Fairweather, and P. Keast <LI><EM>ref: </EM>ACM TOMS 9 (1983) 376-380 </MENU> <LI><EM>file: </EM><A HREF="./604.zip">604.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Remes algorithm, extremal polynomial, Richardson iteration <LI><EM>gams: </EM>K2,D2e,C3b <LI><EM>title: </EM>A {FORTRAN} Program for the Calculation of an Extremal Polynomial <LI><EM>for: </EM>extremal polynomials. <LI><EM>by: </EM>F.W. Sauer <LI><EM>ref: </EM>ACM TOMS 9 (1983) 381-383 </MENU> <LI><EM>file: </EM><A HREF="./605.zip">605.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>verifiers, standard conformance, Basic programming language <LI><EM>gams: </EM>S2 <LI><EM>title: </EM>{PBASIC} -- A Verifier Program for {ANSI} Minimal Basic <LI><EM>by: </EM>T.R. Hopkins <LI><EM>ref: </EM>ACM TOMS 9 (1983) 391-394 </MENU> <LI><EM>file: </EM><A HREF="./606.zip">606.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>expert systems, menu-driven applications, computer-aided instruction <LI><EM>gams: </EM>R4,N4 <LI><EM>title: </EM>{NITPACK} -- An Interactive Tree Package <LI><EM>for: </EM>decision trees <LI><EM>by: </EM>P.W. Gaffney et al. <LI><EM>ref: </EM>ACM TOMS 9 (1983) pp. 418-426 </MENU> <LI><EM>file: </EM><A HREF="./607.zip">607.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>text exchange, management, organization, distribution and maintenance <LI><EM>gams: </EM>N4,Z <LI><EM>title: </EM>Text Exchange System: A Transportable System for Management and Exchange of Programs and Other Text <LI><EM>by: </EM>W.V. Snyder and R.J. Hanson <LI><EM>ref: </EM>ACM TOMS 9 (1983) 427-440 </MENU> <LI><EM>file: </EM><A HREF="./608.zip">608.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>quadratic assignment, heuristic algorithm, operations research <LI><EM>gams: </EM>G2b <LI><EM>title: </EM>Approximate Solution of the Quadratic Assignment Problem <LI><EM>for: </EM>extended Koopmans-Beckmann quadratic assignment problem <LI><EM>by: </EM>D.H. West <LI><EM>ref: </EM>ACM TOMS 9 (1983) 461-466 </MENU> <LI><EM>file: </EM><A HREF="./609.zip">609.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>exponential and Bessel function integral, Bickley functions <LI><EM>gams: </EM>C10f <LI><EM>title: </EM>A Portable {FORTRAN} Subroutine for the {Bickley} Functions ${Ki}_n(x)$ <LI><EM>for: </EM>Bickley functions Ki(n,x), repeated integrals of the K0 Bessel function, for non-negative integers n and reals x. <LI><EM>by: </EM>D.E. Amos <LI><EM>ref: </EM>ACM TOMS 9 (1983) 480-493 </MENU> <LI><EM>file: </EM><A HREF="./610.zip">610.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>psi functions, gamma function, derivative of gamma function <LI><EM>gams: </EM>C7c <LI><EM>title: </EM>A Portable {FORTRAN} Subroutine for the Derivation of the Psi Function <LI><EM>by: </EM>D.E. Amos <LI><EM>ref: </EM>ACM TOMS 9 (1983) 494-502 </MENU> <LI><EM>file: </EM><A HREF="./611.zip">611.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>trust regions, quasi-newton, secant update, reverse communication <LI><EM>gams: </EM>G1b1b,G1b1c <LI><EM>title: </EM>Subroutines for Unconstrained Minimization Using a Model\slash Trust-Region Approach <LI><EM>alg: </EM>model/trust-region approach <LI><EM>by: </EM>D.M. Gay <LI><EM>ref: </EM>ACM TOMS 9 (1983) 503-524 </MENU> <LI><EM>file: </EM><A HREF="./612.zip">612.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>quadrature, 2-d integration, singular integrand, epsilon algorithm <LI><EM>gams: </EM>H2b2a1 <LI><EM>title: </EM>{TRIEX}: Integration Over a {TRI}angle Using Nonlinear {EX}trapolation <LI><EM>alg: </EM>adaptive subdivisional strategy with global acceptance criteria and incorporates the epsilon algorithm to speed convergence <LI><EM>by: </EM>E. de Doncker and I. Robinson <LI><EM>ref: </EM>ACM TOMS 10 (1984) pp. 17-22 </MENU> <LI><EM>file: </EM><A HREF="./613.zip">613.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>minimum spanning tree, shortest connection network <LI><EM>gams: </EM>G2d2 <LI><EM>title: </EM>Minimum Spanning Tree for Moderate Integer Weights <LI><EM>for: </EM>minimum spanning tree for moderate integer weights in a connected undirected graph represented in a forward star data structure <LI><EM>by: </EM>R.E. Haymond, J.P. Jarvis, and D.R. Shier <LI><EM>ref: </EM>ACM TOMS 10 (1984) 108-111 </MENU> <LI><EM>file: </EM><A HREF="./614.zip">614.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>quadrature rule, optimal quadrature rule, singular integrand <LI><EM>gams: </EM>H2a1a1,H2a3a1,H2a4a1 <LI><EM>title: </EM>A {FORTRAN} Subroutine for Integration in ${H}_p$ Spaces <LI><EM>for: </EM>automatic numerical integration in Hp. The functions may have singularities at one or both endpoints of an interval. Each of finite, semi-infinite, and infinite intervals are admitted <LI><EM>by: </EM>K. Sikorski, F. Stenger, and J. Schwing <LI><EM>ref: </EM>ACM TOMS 10 (1984) 152-160 </MENU> <LI><EM>file: </EM><A HREF="./615.zip">615.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>regression, least absolute value <LI><EM>gams: </EM>L8c3 <LI><EM>title: </EM>The Best Subset of Parameters in Least Absolute Value Regression <LI><EM>for: </EM>linear regression under a least absolute value criterion <LI><EM>alg: </EM>simplex method, branch-and-bound <LI><EM>by: </EM>R.D. Armstrong, P.O. Beck, and M.T. Kung <LI><EM>ref: </EM>ACM TOMS 10 (1984) 202-206 </MENU> <LI><EM>file: </EM><A HREF="./616.zip">616.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Hodges-Lehman location estimator, statistics <LI><EM>gams: </EM>L4a1b1 <LI><EM>title: </EM>Fast Computation of the {Hodges}-{Lehman} Location Estimator <LI><EM>by: </EM>J.F. Monahan <LI><EM>ref: </EM>ACM TOMS 10 (1984) 265-270 </MENU> <LI><EM>file: </EM><A HREF="./617.zip">617.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>solve nonlinear equations, differential equation method <LI><EM>gams: </EM>F2 <LI><EM>title: </EM>{DAFNE}: A Differential-Equations Algorithm for Nonlinear Equations <LI><EM>for: </EM>nonlinear systems based on the numerical solution of a Cauchy problem for a system of ordinary differential equations inspired by classical mechanics <LI><EM>by: </EM>F. Aluffi-Pentini, V. Parisi, and F. Zirilli <LI><EM>ref: </EM>ACM TOMS 10 (1984) 317-324). </MENU> <LI><EM>file: </EM><A HREF="./618.zip">618.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>estimating sparse jacobian matrices <LI><EM>gams: </EM>F3 <LI><EM>title: </EM>{FORTRAN} Subroutines for Estimating sparse {Jacobian} Matrices <LI><EM>by: </EM>T.J. Coleman, B.S. Garbow, and J.J. More <LI><EM>ref: </EM>ACM TOMS 10 (1984) 346-347 </MENU> <LI><EM>file: </EM><A HREF="./619.zip">619.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Laplace transform, automatic numerical inversion <LI><EM>gams: </EM>J3 <LI><EM>title: </EM>Automatic Numerical Inversion of the {Laplace} Transform <LI><EM>alg: </EM>Durbin formula in combination with the epsilon algorithm <LI><EM>by: </EM>R. Piessens and R. Huysmans <LI><EM>ref: </EM>ACM TOMS 10 (1984) 348-353 </MENU> <LI><EM>file: </EM><A HREF="./620.zip">620.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>references and keywords for collected algorithms from ACM <LI><EM>gams: </EM>Z <LI><EM>title: </EM>References and Keywords for {\it {Collected} {Algorithms} from {ACM}} <LI><EM>by: </EM>J.R. Rice and R.J. Hanson <LI><EM>ref: </EM>ACM TOMS 10 (1984) 359-360 <LI><EM>size: </EM>277 kB </MENU> <LI><EM>file: </EM><A HREF="./621.zip">621.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>2d, nonlinear parabolic PDE's, multigrid, low storage requirements <LI><EM>gams: </EM>I2a1b <LI><EM>title: </EM>Software with Low Storage Requirements for Two-Dimensional Nonlinear Parabolic Differential Equations <LI><EM>for: </EM>two-dimensional nonlinear parabolic differential equations on rectangular spatial domains with mixed linear boundary conditions. <LI><EM>by: </EM>B.P. Sommeijer and P.J. van der Houven <LI><EM>ref: </EM>ACM TOMS 10 (1984) 378-396 </MENU> <LI><EM>file: </EM><A HREF="./622.zip">622.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>simple macro processor, Fortran <LI><EM>gams: </EM>Z,S1 <LI><EM>title: </EM>A simple macroprocessor <LI><EM>for: </EM>for use in manipulating Fortran code as well as for general text processing <LI><EM>by: </EM>J.R. Rice, C. Ribbens, and W.A. Ward <LI><EM>ref: </EM>ACM TOMS 10 (1984) 410-416 </MENU> <LI><EM>file: </EM><A HREF="./623.zip">623.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>data fitting, interpolation on the surface of a sphere <LI><EM>gams: </EM>E2b <LI><EM>title: </EM>Interpolation on the Surface of a Sphere <LI><EM>for: </EM>interpolant with one continuous derivative from data values associated with arbitrarily distributed nodes on the surface of a sphere <LI><EM>by: </EM>R.J. Renka <LI><EM>ref: </EM>ACM TOMS 10 (1984) 417-436 and 437-439 <LI><EM>size: </EM>204 kB </MENU> <LI><EM>file: </EM><A HREF="./624.zip">624.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>triangulation and interpolation of arbitrary points in a plane <LI><EM>gams: </EM>E2b,P <LI><EM>title: </EM>triangulation and interpolation at arbitrarily distributed points in the plane <LI><EM>by: </EM>R.J. Renka <LI><EM>ref: </EM>ACM TOMS 10 (1984) 440-442 </MENU> <LI><EM>file: </EM><A HREF="./625.zip">625.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>2d domain processor, grid generation <LI><EM>gams: </EM>I2b4,P <LI><EM>title: </EM>relates a general two-dimensional domain to a rectangular grid laid over it <LI><EM>by: </EM>J.R. Rice <LI><EM>ref: </EM>ACM TOMS 10 (1984) 443-452 and 453-462 </MENU> <LI><EM>file: </EM><A HREF="./626.zip">626.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>contour plotting, triangular mesh, FEM <LI><EM>gams: </EM>Q <LI><EM>title: </EM>TRICP <LI><EM>for: </EM>computing contours of a function defined by a set of irregularly distributed data points in the plane. <LI><EM>by: </EM>A. Preusser <LI><EM>ref: </EM>ACM TOMS 10 (1984) 178-189 </MENU> <LI><EM>file: </EM><A HREF="./627.zip">627.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Volterra integral equations, second kind <LI><EM>gams: </EM>I3 <LI><EM>title: </EM>VE1 <LI><EM>for: </EM>Volterra integral equations. <LI><EM>by: </EM>J.M. Bownds and L. Applebaum <LI><EM>ref: </EM>ACM TOMS 11 (1985) 58-65 </MENU> <LI><EM>file: </EM><A HREF="./628.zip">628.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>groebner basis, polynomial ideals, rational integers <LI><EM>gams: </EM>C3b <LI><EM>title: </EM>GROEB <LI><EM>for: </EM>canonical (or Groebner) bases of polynomial ideals <LI><EM>by: </EM>F. Winkler et al. <LI><EM>ref: </EM>ACM TOMS 11 (1985) 66-78 </MENU> <LI><EM>file: </EM><A HREF="./629.zip">629.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>3d Laplace equation, double potential, spherical harmonics <LI><EM>gams: </EM>I2b1a1b <LI><EM>title: </EM>LAPLAC <LI><EM>for: </EM>interior Dirichlet problem for Laplace's equation on a general three dimensional domain <LI><EM>alg: </EM>integral equation techniques <LI><EM>by: </EM>K.E. Atkinson <LI><EM>ref: </EM>ACM TOMS 11 (1985) 85-96 <LI><EM>size: </EM>210 kB </MENU> <LI><EM>file: </EM><A HREF="./630.zip">630.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>local minimia, nonlinear function, conjugate gradient, quasi-newton <LI><EM>gams: </EM>G1b1a,G1b1b <LI><EM>title: </EM>BBVSCG <LI><EM>for: </EM>a variable storage Fortran subprogram for function minimization <LI><EM>by: </EM>A. Buckley and A. Lenir <LI><EM>ref: </EM>ACM TOMS 11 (1985) 103-119 <LI><EM>size: </EM>932 kB </MENU> <LI><EM>file: </EM><A HREF="./631.zip">631.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>find bracketed zero, Larkin's method, rational interpolation <LI><EM>gams: </EM>F1b <LI><EM>title: </EM>ZERO1 and ZERO2 <LI><EM>for: </EM>finding a bracketed zero <LI><EM>alg: </EM>Larkin's method of rational interpolation <LI><EM>by: </EM>V. Nortin <LI><EM>ref: </EM>ACM TOMS 11 (1985) 120-134 </MENU> <LI><EM>file: </EM><A HREF="./632.zip">632.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>0-1 multiple knapsack problem <LI><EM>gams: </EM>G2c3 <LI><EM>title: </EM>MKP <LI><EM>for: </EM>0-1 multiple knapsack problem <LI><EM>by: </EM>S. Martello and P. Toth <LI><EM>ref: </EM>ACM TOMS 11 (1985) 135-140 </MENU> <LI><EM>file: </EM><A HREF="./633.zip">633.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>linear dependency analysis, multivariate data <LI><EM>gams: </EM>L8f <LI><EM>title: </EM>LDA <LI><EM>for: </EM>linear dependency analysis of multivariate data <LI><EM>by: </EM>R.C. Ward, G.J. Davis, and V.E. Kane <LI><EM>ref: </EM>ACM TOMS 11 (1985) 170-182 </MENU> <LI><EM>file: </EM><A HREF="./634.zip">634.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>multinomial fitting, least squares <LI><EM>gams: </EM>K1a1b <LI><EM>title: </EM>CONST and EVAL <LI><EM>for: </EM>fitting multinomials in a least-squares sense <LI><EM>by: </EM>R.H. Bartels and J.J. Jezioranski <LI><EM>ref: </EM>ACM TOMS 11 (1985) 218-228 </MENU> <LI><EM>file: </EM><A HREF="./635.zip">635.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>complex linear systems, L-infinity norm, constraints on unknowns <LI><EM>gams: </EM>D9b2 <LI><EM>title: </EM>Chebyshev solution of systems of complex linear equations with linear inequality constraints and simple bound constraints <LI><EM>by: </EM>R.L. Streit <LI><EM>ref: </EM>ACM TOMS 11 (1985) 242-249 </MENU> <LI><EM>file: </EM><A HREF="./636.zip">636.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>estimating sparse hessian matrices, difference of gradients <LI><EM>gams: </EM>G4f <LI><EM>title: </EM>DSSM and FDHS <LI><EM>for: </EM>estimating sparse Hessian matrices <LI><EM>by: </EM>T.F. Coleman, B.S. Garbow, and J.J. More <LI><EM>ref: </EM>ACM TOMS 11 (1985) 363-377 and 378 </MENU> <LI><EM>file: </EM><A HREF="./637.zip">637.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>2nd order elliptic PDEs, bicubic hermite polynomials, general domain <LI><EM>gams: </EM>I2b1a3 <LI><EM>title: </EM>GENCOL <LI><EM>for: </EM>linear second-order elliptic problems with general linear boundary conditions on non-rectangular two-dimensional domains <LI><EM>alg: </EM>collocation with bicubic Hermite polynomials <LI><EM>by: </EM>E.N. Houstis, W.F. Mitchell, and J.R. Rice <LI><EM>ref: </EM>ACM TOMS 11 (1985) 379-412 and 413-415 <LI><EM>size: </EM>337 kB </MENU> <LI><EM>file: </EM><A HREF="./638.zip">638.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>2nd order elliptic PDEs, bicubic hermite, rectangular domain <LI><EM>gams: </EM>I2b1a3 <LI><EM>title: </EM>INTCOL and HERMCOL <LI><EM>for: </EM>linear second-order elliptic problems on rectangular two-dimensional domains with general linear boundary conditions or uncoupled boundary conditions <LI><EM>alg: </EM>collocation with bicubic Hermite polynomials <LI><EM>by: </EM>E.N. Houstis, W.F. Mitchell, and J.R. Rice <LI><EM>ref: </EM>ACM TOMS 11 (1985) 379-412 and 416-418 </MENU> <LI><EM>file: </EM><A HREF="./639.zip">639.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>integration, oscillatory integrands, periodic <LI><EM>gams: </EM>H2a3a1 <LI><EM>title: </EM>OSCINT <LI><EM>for: </EM>integration of some infinitely oscillating tails <LI><EM>by: </EM>J. Lyness and G. Hines <LI><EM>ref: </EM>ACM TOMS 12 (1986) 24-25 <LI><EM>size: </EM>408 kB </MENU> <LI><EM>file: </EM><A HREF="./640.zip">640.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>complex frequency response matrix, continuous-time state space models <LI><EM>gams: </EM>G3,L10c <LI><EM>title: </EM>SFRMG <LI><EM>for: </EM>complex frequency response matrix C*E*B, where E is the inverse of (FREQ*I - A) and FREQ is a complex scalar taking values along the , imaginary axis for continuous-time systems and on the unit circle for discrete-time systems <LI><EM>by: </EM>A.J. Laub <LI><EM>ref: </EM>ACM TOMS 12 (1986) 26-33 </MENU> <LI><EM>file: </EM><A HREF="./641.zip">641.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>solution of general integer systems of linear equations <LI><EM>gams: </EM>D2a1,D9a1 <LI><EM>title: </EM>EXSOLG <LI><EM>for: </EM>exact least squares solution of linear equations with integer coefficients <LI><EM>by: </EM>J. Springer <LI><EM>ref: </EM>ACM TOMS 12 (1986) p. 149 </MENU> <LI><EM>file: </EM><A HREF="./642.zip">642.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>smoothing, minimum cross-validation, splines <LI><EM>gams: </EM>K5,L8g <LI><EM>title: </EM>CUBGCV <LI><EM>for: </EM>O(n) computation of a cubic smoothing spline fitted to n noisy data points. Degree of smoothing is chosen to minimize the expected mean square error at the data points for known variance, or the generalized cross validation otherwise. Data may be unequally spaced and nonuniformly weighted. Computes Bayesian point error estimates <LI><EM>by: </EM>M.F. Hutchinson <LI><EM>ref: </EM>ACM TOMS 12 (1986) 150-153 </MENU> <LI><EM>file: </EM><A HREF="./643.zip">643.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>unordered rxc contingency tables, Fisher's exact test <LI><EM>gams: </EM>L9b <LI><EM>title: </EM>FEXACT <LI><EM>for: </EM>Fisher's exact test on unordered r-by-c contingency tables <LI><EM>by: </EM>C.R. Mehta and N.R. Patel <LI><EM>ref: </EM>ACM TOMS 12 (1986) 154-161 </MENU> <LI><EM>file: </EM><A HREF="./644.zip">644.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>Bessel function, complex argument, nonnegative order <LI><EM>gams: </EM>C10a4,C10b4,C10d <LI><EM>title: </EM>Bessel functions of a complex argument and nonnegative order H1, H2, I, J, K, and Y, as well as the Airy functions Ai, Bi, and their derivatives are provided in both single and double precision. Exponential scaling and sequence generation are optional <LI><EM>by: </EM>D.E. Amos <LI><EM>ref: </EM>ACM TOMS 21 (1995) 388-393 <LI><EM>size: </EM>724 kB </MENU> <LI><EM>file: </EM><A HREF="./645.zip">645.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>compute generalized inverse of matrix, test programs <LI><EM>gams: </EM>D9c <LI><EM>title: </EM>testing programs that compute the generalized inverse of a matrix <LI><EM>by: </EM>J.C. Nash and R.L.C. Wang <LI><EM>ref: </EM>ACM TOMS 12 (1986) 274-277 </MENU> <LI><EM>file: </EM><A HREF="./646.zip">646.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>find positive definite linear combination, 2 real symmetric matrices <LI><EM>gams: </EM>D4b1,D4c1c <LI><EM>title: </EM>PDFIND <LI><EM>for: </EM>positive definite linear combination of two real symmetric matrices may be used to solve the generalized eigenproblem Ax = (lambda)Bx in case A and B are large and sparse, but neither is positive definite <LI><EM>by: </EM>C.R. Crawford <LI><EM>ref: </EM>ACM TOMS 12 (1986) 278-282 </MENU> <LI><EM>file: </EM><A HREF="./647.zip">647.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>keywrds: </EM>quasirandom sequence generators <LI><EM>gams: </EM>H2c,L6b21 <LI><EM>title: </EM>generation of sequences of quasirandom vectors with low discrepancy Such sequences may be used to reduce error bounds for multidimensional integration and global optimization. <LI><EM>by: </EM>B.L. Fox <LI><EM>ref: </EM>ACM TOMS 12 (1986) 362-376 </MENU> <LI><EM>file: </EM><A HREF="./648.zip">648.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>I1c <LI><EM>title: </EM>NSDTST and STDTST <LI><EM>for: </EM>assessing the performance of initial value solvers for stiff or nonstiff systems <LI><EM>by: </EM>W. H. Enright and J. D. Pryce <LI><EM>ref: </EM>ACM TOMS 13 (1987) 28-34 </MENU> <LI><EM>file: </EM><A HREF="./649.zip">649.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>J1a3 <LI><EM>title: </EM>FOURCO <LI><EM>for: </EM>trigonometric Fourier coefficients of a smooth function <LI><EM>alg: </EM>Lyness's algorithm <LI><EM>by: </EM>G. Giunta and A. Murli <LI><EM>ref: </EM>ACM TOMS 13 (1987) 97-107 <LI><EM>size: </EM>218 kB </MENU> <LI><EM>file: </EM><A HREF="./650.zip">650.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>C2 <LI><EM>lang: </EM>Motorola 68000 assembler <LI><EM>title: </EM>efficient square root implementation <LI><EM>by: </EM>K. C. Johnson <LI><EM>ref: </EM>ACM TOMS 13 (1987) 138-151 </MENU> <LI><EM>file: </EM><A HREF="./651.zip">651.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>I2b1a1a <LI><EM>title: </EM>HFFT <LI><EM>for: </EM>Helmholtz equation on bounded two- or three-dimensional rectangular domains <LI><EM>by: </EM>R. F. Boisvert <LI><EM>ref: </EM>ACM TOMS 13 (1987) 235-249 </MENU> <LI><EM>file: </EM><A HREF="./652.zip">652.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>F2 <LI><EM>title: </EM>HOMPACK <LI><EM>for: </EM>globally convergent homotopy algorithms, for finding zeros or fixed points of nonlinear systems of equations. <LI><EM>by: </EM>L. T. Watson, S. C. Billups, and A. P. Morgan <LI><EM>ref: </EM>ACM TOMS 13 (1987) 281-310 </MENU> <LI><EM>file: </EM><A HREF="./653.zip">653.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>D1a <LI><EM>title: </EM>PC-BLAS <LI><EM>lang: </EM>8087 assembler <LI><EM>for: </EM>Basic Linear Algebra Subprograms <LI><EM>by: </EM>R. J. Hanson and F. T. Krogh <LI><EM>ref: </EM>ACM TOMS 13 (1987) 311-317 </MENU> <LI><EM>file: </EM><A HREF="./654.zip">654.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>C7e <LI><EM>title: </EM>GRATIO and GAMINV <LI><EM>for: </EM>incomplete gamma function ratios and their inverse <LI><EM>by: </EM>A. R. DiDonato and A. H. Morris, Jr. <LI><EM>ref: </EM>ACM TOMS 13 (1987) 318-319 </MENU> <LI><EM>file: </EM><A HREF="./655.zip">655.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>H2c <LI><EM>title: </EM>IQPACK <LI><EM>for: </EM>stable evaluation of the weights and nodes of interpolatory and Gaussian quadratures with prescribed simple or multiple knots <LI><EM>by: </EM>S. Elhay and J. Kautsky <LI><EM>ref: </EM>ACM TOMS 13 (1987) 399-415 </MENU> <LI><EM>file: </EM><A HREF="./656.zip">656.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>D1 <LI><EM>title: </EM>model implementation and test programs for Level 2 BLAS <LI><EM>by: </EM>J. J. Dongarra, J. du Croz, S. Hammarling, and R. J. Hanson <LI><EM>ref: </EM>ACM TOMS 14 (1988) 18-32 </MENU> <LI><EM>file: </EM><A HREF="./657.zip">657.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>Q <LI><EM>title: </EM>CON3D <LI><EM>for: </EM>plotting contour surfaces of a function of three variables <LI><EM>by: </EM>G. Sewell <LI><EM>ref: </EM>ACM TOMS 14 (1988) 42-44 </MENU> <LI><EM>file: </EM><A HREF="./658.zip">658.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>I1a1b,I1a2 <LI><EM>title: </EM>ODESSA <LI><EM>for: </EM>ordinary differential equation solver (a modification of LSODE) with explicit simultaneous sensitivity analysis <LI><EM>by: </EM>J. R. Leis and M. A. Kramer <LI><EM>ref: </EM>ACM TOMS 14 (1988) 61-67 </MENU> <LI><EM>file: </EM><A HREF="./659.zip">659.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>G2i,H2c <LI><EM>title: </EM>Sobol's quasirandom sequence generator for multivariate quadrature and optimization <LI><EM>by: </EM>P. Bratley and B. L. Fox <LI><EM>ref: </EM>ACM TOMS 14 (1988) 88-100 </MENU> <LI><EM>file: </EM><A HREF="./660.zip">660.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>E2b <LI><EM>title: </EM>QSHEP2D <LI><EM>for: </EM>quadratic Shepard method for bivariate interpolation of scattered data <LI><EM>by: </EM>R. J. Renka <LI><EM>ref: </EM>ACM TOMS 14 (1988) 149-150 </MENU> <LI><EM>file: </EM><A HREF="./661.zip">661.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>E2b <LI><EM>title: </EM>QSHEP3D <LI><EM>for: </EM>quadratic Shepard method for trivariate interpolation of scattered data <LI><EM>by: </EM>R. J. Renka <LI><EM>ref: </EM>ACM TOMS 14 (1988) 151-152 </MENU> <LI><EM>file: </EM><A HREF="./662.zip">662.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>J3 <LI><EM>title: </EM>MODUL1 and MODUL2 <LI><EM>for: </EM>numerical inversion of the Laplace transform <LI><EM>alg: </EM>Weeks' method <LI><EM>by: </EM>B. S. Garbow, G. Giunta, and J. N. Lyness <LI><EM>ref: </EM>ACM TOMS 14 (1988) 171-176 </MENU> <LI><EM>file: </EM><A HREF="./663.zip">663.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>D1a <LI><EM>title: </EM>CWI BLAS <LI><EM>for: </EM>Basic Linear Algebra Subprograms in Fortran 200 for the Cyber 205 <LI><EM>by: </EM>M. Louter-Nool <LI><EM>ref: </EM>ACM TOMS 14 (1988) 177-195 </MENU> <LI><EM>file: </EM><A HREF="./664.zip">664.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>D2a2 <LI><EM>title: </EM>GBSOL <LI><EM>for: </EM>Gauss algorithm to solve systems with large banded matrices using random-access disk storage <LI><EM>by: </EM>G. Schrauf <LI><EM>ref: </EM>ACM TOMS 14 (1988) 257-260 </MENU> <LI><EM>file: </EM><A HREF="./665.zip">665.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>R1 <LI><EM>title: </EM>MACHAR <LI><EM>for: </EM>dynamically determine machine parameters <LI><EM>by: </EM>W.J. Cody <LI><EM>ref: </EM>ACM TOMS 14 (1988) 303-311 </MENU> <LI><EM>file: </EM><A HREF="./666.zip">666.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>F2 <LI><EM>title: </EM>CHABIS <LI><EM>for: </EM>locating and evaluating roots of systems of nonlinear equations <LI><EM>alg: </EM>characteristic bisection. <LI><EM>by: </EM>M.N. Vrahatis <LI><EM>ref: </EM>ACM TOMS 15 (1988) 330-336 </MENU> <LI><EM>file: </EM><A HREF="./667.zip">667.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>G1b1a <LI><EM>title: </EM>SIGMA <LI><EM>for: </EM>global minimization using a stochastic integration algorithm <LI><EM>by: </EM>F. Aluffi-Pentini, V. Parisi, and F. Zirilli <LI><EM>ref: </EM>ACM TOMS 14 (1988) 366-380 <LI><EM>size: </EM>215 kB </MENU> <LI><EM>file: </EM><A HREF="./668.zip">668.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>L6a8 <LI><EM>title: </EM>H2PEC <LI><EM>for: </EM>generating observations from the hypergeometric distribution <LI><EM>by: </EM>V. Kachitvichyanukul and B.W. Schmeiser <LI><EM>ref: </EM>ACM TOMS 14 (1988) 397-3986 </MENU> <LI><EM>file: </EM><A HREF="./669.zip">669.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>I1a1a <LI><EM>title: </EM>BRKF45 <LI><EM>for: </EM>first-order systems of nonstiff initial value problems for ordinary differential equations. <LI><EM>alg: </EM>two-step block Runge-Kutta formula of order 6. <LI><EM>by: </EM>J.R. Cash <LI><EM>ref: </EM>ACM TOMS 15 (1989) 29-30 </MENU> <LI><EM>file: </EM><A HREF="./670.zip">670.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>I1a1a <LI><EM>title: </EM>Runge-Kutta-Nystrom. Two embedded formula pairs are provided, the lower order pair allowing interpolation <LI><EM>by: </EM>R.W. Brankin, I. Gladwell, J.R. Dormand, P.J. Prince, and W.L. Seward <LI><EM>ref: </EM>ACM TOMS 15 (1989) 31-40 </MENU> <LI><EM>file: </EM><A HREF="./671.zip">671.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>Q,E2a <LI><EM>title: </EM>FARB-E-2D <LI><EM>for: </EM>contour lines for values given at rectangular mesh Areas between contour lines may be filled with colors or patterns <LI><EM>alg: </EM>nonlinear bicubic Hermite polynomial interpolation <LI><EM>by: </EM>A. Preusser <LI><EM>ref: </EM>ACM TOMS 15 (1989) 79-89 </MENU> <LI><EM>file: </EM><A HREF="./672.zip">672.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>H2c <LI><EM>title: </EM>EXTEND <LI><EM>for: </EM>generating interpolatory quadrature rules of the highest degree of precision with preassigned nodes for general weight functions <LI><EM>by: </EM>T.N.L. Patterson <LI><EM>ref: </EM>ACM TOMS 15 (1989) 137-143 </MENU> <LI><EM>file: </EM><A HREF="./673.zip">673.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>N <LI><EM>lang: </EM>Pascal <LI><EM>alg: </EM>one-pass <LI><EM>title: </EM>dynamic Huffman codes (compression) <LI><EM>by: </EM>J.S. Vitter <LI><EM>ref: </EM>ACM TOMS 15 (1989) 158-167 </MENU> <LI><EM>file: </EM><A HREF="./674.zip">674.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>D1b2 <LI><EM>title: </EM>one-norm of a real or complex matrix, condition estimation. Explicit matrix is not required; instead matrix-vector products are computed by the calling program via a reverse communications interface. <LI><EM>by: </EM>N.J. Higham <LI><EM>ref: </EM>ACM TOMS 14 (1988) 381-396 </MENU> <LI><EM>file: </EM><A HREF="./675.zip">675.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>L10a2e <LI><EM>title: </EM>square root covariance filter and information filter in dense or Hessenberg forms <LI><EM>by: </EM>M. Vanbegin, P. Van Doore and M. Verhaegen <LI><EM>ref: </EM>ACM TOMS 15 (1989) 243-256 <LI><EM>size: </EM>234 kB </MENU> <LI><EM>file: </EM><A HREF="./676.zip">676.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>K1b1a2,L8a4,L8e5 <LI><EM>title: </EM>ODRPACK <LI><EM>for: </EM>weighted orthogonal distance regression <LI><EM>by: </EM>P.T. Boggs, J.R. Donaldson, R.H. Byrd, and R.B. Snabel <LI><EM>ref: </EM>ACM TOMS 15 (1989) 348-364 <LI><EM>size: </EM>201 kB </MENU> <LI><EM>file: </EM><A HREF="./677.zip">677.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>E2b <LI><EM>title: </EM>interpolation of rapidly varying function values given at points irregularly distributed in the plane <LI><EM>alg: </EM>C1 triangular elements, with needed partial derivatives are estimated using a minimization criterion making use of a tension parameter <LI><EM>by: </EM>L.B. Montefusco and G. Casciola <LI><EM>ref: </EM>ACM TOMS 15 (1989) 365-374 </MENU> <LI><EM>file: </EM><A HREF="./678.zip">678.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>L6a2 <LI><EM>title: </EM>BTPEC <LI><EM>for: </EM>sampling from the binomial distribution <LI><EM>by: </EM>V. Kachitvichyanukul and B.W. Schmeiser <LI><EM>ref: </EM>ACM TOMS 15 (1989) 394-397 </MENU> <LI><EM>file: </EM><A HREF="./679.zip">679.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>D1b <LI><EM>title: </EM>Level 3 BLAS <LI><EM>for: </EM>basic linear algebra <LI><EM>by: </EM>J.J. Dongarra, J. Du Croz, S. Hammarling, and I. Duff <LI><EM>ref: </EM>ACM TOMS 16 (1990) 18-28 </MENU> <LI><EM>file: </EM><A HREF="./680.zip">680.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>C8a <LI><EM>title: </EM>complex error function <LI><EM>by: </EM>G.P.M. Poppe and C.M.J. Wijers <LI><EM>ref: </EM>ACM TOMS 16 (1990) 47 </MENU> <LI><EM>file: </EM><A HREF="./681.zip">681.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>F2 <LI><EM>title: </EM>INTBIS <LI><EM>for: </EM>real roots of a system of nonlinear equations within a region defined by bounds on the variables <LI><EM>alg: </EM>interval Newton/bisection methods <LI><EM>by: </EM>R.B. Kearfott and M. Novoa III <LI><EM>ref: </EM>ACM TOMS 16 (1990) 152-157 </MENU> <LI><EM>file: </EM><A HREF="./682.zip">682.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>F2 <LI><EM>title: </EM>inversion of the Laplace transform <LI><EM>alg: </EM>Talbot's method <LI><EM>by: </EM>A. Murli and M. Rizzardi <LI><EM>ref: </EM>ACM TOMS 16 (1990) 158-168 </MENU> <LI><EM>file: </EM><A HREF="./683.zip">683.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>C5 <LI><EM>title: </EM>exponential integrals of a complex argument <LI><EM>by: </EM>D.E. Amos <LI><EM>ref: </EM>ACM TOMS 16 (1990) 178-182 </MENU> <LI><EM>file: </EM><A HREF="./684.zip">684.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>E2b <LI><EM>title: </EM>C1 and C2 interpolation on triangles with quintic and nonic bivariate polynomials <LI><EM>by: </EM>A. Preusser <LI><EM>ref: </EM>ACM TOMS 16 (1990) 253-257 </MENU> <LI><EM>file: </EM><A HREF="./685.zip">685.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>I2b1a1a,I2b1a2 <LI><EM>title: </EM>SERRG2 <LI><EM>for: </EM>separable elliptic equations on a rectangle <LI><EM>alg: </EM>Rayleigh-Ritz-Galerkin with tensor-product B-splines <LI><EM>by: </EM>L. Kaufmann and D. Warner <LI><EM>ref: </EM>ACM TOMS 16 (1990) 325-351 <LI><EM>size: </EM>259 kB </MENU> <LI><EM>file: </EM><A HREF="./686.zip">686.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>gams: </EM>D7c <LI><EM>title: </EM>updating the QR decomposition of a matrix. <LI><EM>by: </EM>L. Reichel and W.B. Gragg <LI><EM>ref: </EM>ACM TOMS 16 (1990) 369-377 </MENU> <LI><EM>file: </EM><A HREF="./687.zip">687.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,1 <LI><EM>title: </EM>decision tree for initial value ode <LI><EM>gams: </EM>i1c </MENU> <LI><EM>file: </EM><A HREF="./688.zip">688.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,2 <LI><EM>title: </EM>epdcol: a more efficient pdecol code <LI><EM>gams: </EM>i2a1a <LI><EM>size: </EM>335 kB </MENU> <LI><EM>file: </EM><A HREF="./689.zip">689.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,2 <LI><EM>title: </EM>nonlinear volterra integral equations of the second kind <LI><EM>gams: </EM>i3 <LI><EM>size: </EM>450 kB </MENU> <LI><EM>file: </EM><A HREF="./690.zip">690.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,2 <LI><EM>title: </EM>chebyshev polynomial software for elliptic-parabolic systems of pdes <LI><EM>gams: </EM>i2a1a, i2b <LI><EM>size: </EM>331 kB </MENU> <LI><EM>file: </EM><A HREF="./691.zip">691.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,2 <LI><EM>title: </EM>improving quadpack automatic integration routines <LI><EM>gams: </EM>h2a1a1, h2a2a1 </MENU> <LI><EM>file: </EM><A HREF="./692.zip">692.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,2 <LI><EM>title: </EM>model implementation and test package for the sparse blas <LI><EM>gams: </EM>d1a, d1b1 <LI><EM>size: </EM>353 kB </MENU> <LI><EM>file: </EM><A HREF="./693.zip">693.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,2 <LI><EM>title: </EM>floating point multiple precision arithmetic <LI><EM>size: </EM>295 kB </MENU> <LI><EM>file: </EM><A HREF="./694.zip">694.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,3 <LI><EM>title: </EM>test matrices <LI><EM>gams: </EM>d1b1 </MENU> <LI><EM>file: </EM><A HREF="./695.zip">695.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,3 <LI><EM>title: </EM>modified cholesky factorization <LI><EM>gams: </EM>d2b1a, d2b1b </MENU> <LI><EM>file: </EM><A HREF="./696.zip">696.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,3 <LI><EM>title: </EM>inverse rayleigh iteration for complex band matrices <LI><EM>gams: </EM>d4a4, d4a6 </MENU> <LI><EM>file: </EM><A HREF="./697.zip">697.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,3 <LI><EM>title: </EM>univariate interpolation <LI><EM>gams: </EM>e1a </MENU> <LI><EM>file: </EM><A HREF="./698.zip">698.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,4 <LI><EM>title: </EM>dcuhre - adaptive multidimensional integration for a vector of integrals <LI><EM>by: </EM>Berntsen, Espelid, Genz <LI><EM>gams: </EM>h2b1a1 <LI><EM>size: </EM>201 kB </MENU> <LI><EM>file: </EM><A HREF="./699.zip">699.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,4 <LI><EM>title: </EM>new representation of Patterson's quadrature formulae <LI><EM>by: </EM>Krogh, Van Snyder <LI><EM>gams: </EM>h2a1a1 </MENU> <LI><EM>file: </EM><A HREF="./700.zip">700.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,4 <LI><EM>title: </EM>sleign - Fortran package for Sturm-Liouville problems <LI><EM>by: </EM>Bailey, Garbow, Kaper, Zetti <LI><EM>gams: </EM>i1b3 </MENU> <LI><EM>file: </EM><A HREF="./701.zip">701.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 17,4 <LI><EM>title: </EM>goliath - exact analysis of rectangular rank-deficient sparse rational linear systems <LI><EM>by: </EM>Alefeld, Eyre <LI><EM>gams: </EM>d9a </MENU> <LI><EM>file: </EM><A HREF="./702.zip">702.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,1 <LI><EM>title: </EM>TNPACK <LI><EM>for: </EM>large-scale minimization <LI><EM>alg: </EM>truncated Newton <LI><EM>by: </EM>Schlick, Fogelson <LI><EM>gams: </EM>g1b1c </MENU> <LI><EM>file: </EM><A HREF="./703.zip">703.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,2 <LI><EM>title: </EM>MEBDF <LI><EM>for: </EM>stiff ode <LI><EM>by: </EM>Cash, Considine <LI><EM>gams: </EM>i1a2 </MENU> <LI><EM>file: </EM><A HREF="./704.zip">704.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,2 <LI><EM>title: </EM>ABDPACK <LI><EM>for: </EM>almost block diagonal linear systems in spline collocation <LI><EM>by: </EM>Majaess, Keast, Fairweather, Bennett <LI><EM>gams: </EM>d2a2, d2a4 </MENU> <LI><EM>file: </EM><A HREF="./705.zip">705.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,2 <LI><EM>title: </EM>Sylvester equation AXB + CXD = E <LI><EM>by: </EM>Gardiner, Laub, Amato, Moler <LI><EM>gams: </EM>d8 <LI><EM>size: </EM>326 kB </MENU> <LI><EM>file: </EM><A HREF="./706.zip">706.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,3 <LI><EM>title: </EM>DCUTRI <LI><EM>for: </EM>two-dimensional integral over triangulated region <LI><EM>by: </EM>Berntsen, Espelid <LI><EM>gams: </EM>h2b2a1 </MENU> <LI><EM>file: </EM><A HREF="./707.zip">707.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,3 <LI><EM>title: </EM>CONHYP <LI><EM>for: </EM>confluent hypergeometric function <LI><EM>by: </EM>Nardin, Perger, Bhalla <LI><EM>gams: </EM>c11 </MENU> <LI><EM>file: </EM><A HREF="./708.zip">708.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,3 <LI><EM>title: </EM>BRATIO <LI><EM>for: </EM>incomplete Beta function IX(a,b) <LI><EM>by: </EM>Morris <LI><EM>gams: </EM>c7f </MENU> <LI><EM>file: </EM><A HREF="./709.zip">709.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,4 <LI><EM>title: </EM>testing algorithm implementations <LI><EM>by: </EM>Buckley <LI><EM>size: </EM>1.3 MB <LI><EM>gams: </EM>g4f, s3 </MENU> <LI><EM>file: </EM><A HREF="./710.zip">710.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,4 <LI><EM>title: </EM>eigenvalues and eigenvectors of a general matrix <LI><EM>by: </EM>Dongarra, Geist, Romine <LI><EM>gams: </EM>d4a2 </MENU> <LI><EM>file: </EM><A HREF="./711.zip">711.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,4 <LI><EM>title: </EM>BTN <LI><EM>for: </EM>parallel unconstrained optimization <LI><EM>by: </EM>Nash, Sofer <LI><EM>gams: </EM>g1b1b <LI><EM>size: </EM>233 kB </MENU> <LI><EM>file: </EM><A HREF="./712.zip">712.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,4 <LI><EM>title: </EM>normal random number generator <LI><EM>by: </EM>Leva <LI><EM>gams: </EM>l6a14 </MENU> <LI><EM>file: </EM><A HREF="./713.zip">713.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 18,4 <LI><EM>title: </EM>vectorized Bessel function evaluation <LI><EM>gams: </EM>c10a1, c10b1 <LI><EM>size: </EM>535 kB </MENU> <LI><EM>file: </EM><A HREF="./714.zip">714.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>celefunt <LI><EM>ref: </EM>TOMS 19,1 <LI><EM>for: </EM>testing elementary functions of complex argument <LI><EM>by: </EM>Cody <LI><EM>gams: </EM>c2, c4b </MENU> <LI><EM>file: </EM><A HREF="./715.zip">715.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>specfun <LI><EM>ref: </EM>TOMS 19,1 <LI><EM>for: </EM>special function routines and test drivers <LI><EM>by: </EM>Cody <LI><EM>gams: </EM>c5, c7, c8, c10 <LI><EM>size: </EM>525 kB </MENU> <LI><EM>file: </EM><A HREF="./716.zip">716.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>tspack <LI><EM>ref: </EM>TOMS 19,1 <LI><EM>for: </EM>tension spline curve-fitting package <LI><EM>by: </EM>Renka <LI><EM>gams: </EM>e1a, e1c, k1a1a1, k1a1a3 <LI><EM>size: </EM>252 kB </MENU> <LI><EM>file: </EM><A HREF="./717.zip">717.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 19,1 <LI><EM>title: </EM>max- and quasi-likelihood estimation in nonlinear regression <LI><EM>by: </EM>Bunch, Gay, Welsch <LI><EM>gams: </EM>l8e1b2, l8e1b4 <LI><EM>size: </EM>1.2 MB </MENU> <LI><EM>file: </EM><A HREF="./718.zip">718.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 19,2 <LI><EM>title: </EM>eigenvalue allocation problem for single-input systems <LI><EM>by: </EM>Miminis, Reid <LI><EM>gams: </EM>d4, g3 <LI><EM>size: </EM>162 kB </MENU> <LI><EM>file: </EM><A HREF="./719.zip">719.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 19,3 <LI><EM>title: </EM>multiprecision translation and execution of Fortran programs <LI><EM>by: </EM>Bailey <LI><EM>gams: </EM>a3c, a3d, a4c, a4d <LI><EM>size: </EM>488 kB </MENU> <LI><EM>file: </EM><A HREF="./720.zip">720.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 19,3 <LI><EM>title: </EM>adaptive cubature over a collection of 3-dimensional simplices <LI><EM>by: </EM>Berntsen, Cools, Espelid <LI><EM>gams: </EM>h2b2a1 <LI><EM>size: </EM>185 kB </MENU> <LI><EM>file: </EM><A HREF="./721.zip">721.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 19,3 <LI><EM>title: </EM>eigenvalues of Mathieu differential equation for noninteger and integer order <LI><EM>by: </EM>Shirts <LI><EM>gams: </EM>c17 <LI><EM>size: </EM>154 kB </MENU> <LI><EM>file: </EM><A HREF="./722.zip">722.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 19,4 <LI><EM>title: </EM>support IEEE binary floating point arithmetic <LI><EM>by: </EM>Cody, Coonen <LI><EM>gams: </EM>a3a, a6c, r3c <LI><EM>size: </EM>53 kB </MENU> <LI><EM>file: </EM><A HREF="./723.zip">723.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 19,4 <LI><EM>title: </EM>Fresnel integrals <LI><EM>by: </EM>Van Snyder <LI><EM>gams: </EM>c8b <LI><EM>size: </EM>85 kB </MENU> <LI><EM>file: </EM><A HREF="./724.zip">724.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 19,4 <LI><EM>title: </EM>F-percentiles <LI><EM>by: </EM>Abernathy, Smith <LI><EM>gams: </EM>l5a2f <LI><EM>size: </EM>38 kB </MENU> <LI><EM>file: </EM><A HREF="./725.zip">725.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 19,4 <LI><EM>title: </EM>multivariate normal integral <LI><EM>by: </EM>Drezner <LI><EM>gams: </EM>l5b1n <LI><EM>size: </EM>20 kB </MENU> <LI><EM>file: </EM><A HREF="./726.zip">726.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,1 (MAR 1994) 21-62 <LI><EM>title: </EM>ORTHPOL <LI><EM>for: </EM>Generating Orthogonal Polynomials and Gauss-type Quadrature Rules <LI><EM>by: </EM>Walter Gautschi <LI><EM>size: </EM>406 kB </MENU> <LI><EM>file: </EM><A HREF="./727.zip">727.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,1 (MAR 1994) 100-102 <LI><EM>by: </EM>Sherif Hashem and Bruce Schmeiser <LI><EM>lang: </EM>C <LI><EM>title: </EM>q-th quantile and standard deviation of that estimate <LI><EM>size: </EM>57 kB </MENU> <LI><EM>file: </EM><A HREF="./728.zip">728.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,1 (MAR 1994) 120-123 <LI><EM>title: </EM>quadratic bilevel programming problem <LI><EM>by: </EM>Paul H. Calamai and Luis N. Vicente <LI><EM>size: </EM>73 kB </MENU> <LI><EM>file: </EM><A HREF="./729.zip">729.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,1 (MAR 1994) 160 <LI><EM>alg: </EM>extended Levinson algorithms <LI><EM>title: </EM>solving symmetric and general Toeplitz systems <LI><EM>by: </EM>Per Christian Hansen <LI><EM>size: </EM>139 kB </MENU> <LI><EM>file: </EM><A HREF="./730.zip">730.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,1 (MAR 1994) 161 <LI><EM>alg: </EM>divide and conquer <LI><EM>title: </EM>unitary eigenproblem <LI><EM>by: </EM>G. S. Ammar, L. Reichel, and D. C. Sorensen <LI><EM>size: </EM>144 kB </MENU> <LI><EM>file: </EM><A HREF="./731.zip">731.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,2 (JUN 1994) 194 <LI><EM>alg: </EM>adaptive moving grid <LI><EM>title: </EM>univariate partial differential equation <LI><EM>by: </EM>J. G. Blom and P. A. Zegeling <LI><EM>size: </EM>568 kB </MENU> <LI><EM>file: </EM><A HREF="./732.zip">732.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,3 (Sep 1994) 247 <LI><EM>alg: </EM>capacitance matrix, Laplacian preconditioner, FACR <LI><EM>title: </EM>nonseparable self-adjoint elliptic PDE on 2D polygonal domain <LI><EM>by: </EM>P. F. Cummins and G. K. Vallis <LI><EM>size: </EM>228 kB </MENU> <LI><EM>file: </EM><A HREF="./733.zip">733.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>name: </EM>TOMP <LI><EM>ref: </EM>TOMS 20,3 (Sep 1994) 262 <LI><EM>alg: </EM>nonlinear programming <LI><EM>title: </EM>optimal control problem <LI><EM>by: </EM>D. Kraft <LI><EM>size: </EM>219 kB </MENU> <LI><EM>file: </EM><A HREF="./734.zip">734.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,3 (Sep 1994) 354 <LI><EM>title: </EM>A {Fortran} 90 Code for Unconstrained Nonlinear Minimization <LI><EM>alg: </EM>toms/630 <LI><EM>lang: </EM>Fortran90 <LI><EM>by: </EM>A. G. Buckley <LI><EM>size: </EM>414 kB </MENU> <LI><EM>file: </EM><A HREF="./735.zip">735.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,3 (Sep 1994) 398 <LI><EM>alg: </EM>pyramid <LI><EM>title: </EM>wavelet transform and inverse <LI><EM>by: </EM>C. Taswell and K. C. McGill <LI><EM>size: </EM>27 kB </MENU> <LI><EM>file: </EM><A HREF="./736.zip">736.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,4 (Dec 1994) 427 <LI><EM>title: </EM>hyperelliptic integrals and the surface measure of ellipsoids <LI><EM>by: </EM>C. F. Dunkl and D. E. Ramirez <LI><EM>size: </EM>44 kB </MENU> <LI><EM>file: </EM><A HREF="./737.zip">737.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,4 (Dec 1994) 447 <LI><EM>title: </EM>portable fortran 77 interval standard function library <LI><EM>alg: </EM>intlib <LI><EM>by: </EM>R. B. Kearfott, M. Dawande, K. Du and C. Hu <LI><EM>size: </EM>704 kB </MENU> <LI><EM>file: </EM><A HREF="./738.zip">738.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,4 (Dec 1994) 494 <LI><EM>title: </EM>generate niederreiters low discrepancy sequences <LI><EM>by: </EM>P. Bratley, B. L. Fox and H. Niederreiter <LI><EM>size: </EM>127 kB </MENU> <LI><EM>file: </EM><A HREF="./739.zip">739.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 20,4 (Dec 1994) 518 <LI><EM>title: </EM>unconstrained optimization using tensor methods <LI><EM>by: </EM>T. Chow, E. Eskow and R. Schnabel <LI><EM>size: </EM>124 kB </MENU> <LI><EM>file: </EM><A HREF="./740.zip">740.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,1 (Mar 1995) 18 <LI><EM>title: </EM>compute improved incomplete cholesky factorizations <LI><EM>by: </EM>M. T. Jones and P. E. Plassmann <LI><EM>size: </EM>61 kB </MENU> <LI><EM>file: </EM><A HREF="./741.zip">741.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,1 (Mar 1995) 20 <LI><EM>title: </EM>least-squares solution of linear, bordered, block diagonal systems of equations <LI><EM>by: </EM>R. D. Ray <LI><EM>size: </EM>300 kB </MENU> <LI><EM>file: </EM><A HREF="./742.zip">742.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,1 (Mar 1995) 98 <LI><EM>title: </EM>least squares data fitting with nonnegative second divided differences <LI><EM>alg: </EM>l2cxft <LI><EM>by: </EM>I. C. Demetriou <LI><EM>size: </EM>263 kB </MENU> <LI><EM>file: </EM><A HREF="./743.zip">743.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,2 (June 1995) 172 <LI><EM>alg: </EM>wapr <LI><EM>title: </EM>calculating real values of the w-function <LI><EM>by: </EM>D. A. Barry, S. J. Barry and P. J. Culligan-Hensley <LI><EM>size: </EM>73 kB </MENU> <LI><EM>file: </EM><A HREF="./744.zip">744.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,2 (June 1995) 194 <LI><EM>title: </EM>stochastic algorithm for global minimization with constraints <LI><EM>by: </EM>F. M. Rabinowitz <LI><EM>size: </EM>33 kB </MENU> <LI><EM>file: </EM><A HREF="./745.zip">745.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,3 (Sep 1995) 221 <LI><EM>title: </EM>computation of the complete and incomplete fermi-dirac integral <LI><EM>by: </EM>M. Goano <LI><EM>size: </EM>106 kB </MENU> <LI><EM>file: </EM><A HREF="./746.zip">746.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,3 (Sep 1995) 233 <LI><EM>alg: </EM>pcomp <LI><EM>title: </EM>fortran code for automatic differentiation <LI><EM>by: </EM>M. Dobmann, M. Liepelt and K. Schittkowski <LI><EM>size: </EM>284 kB </MENU> <LI><EM>file: </EM><A HREF="./747.zip">747.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,3 (Sep 1995) 299 <LI><EM>title: </EM>fortran subroutine to solve the eigenvalue assignment problem for multiinput systems using state feedback <LI><EM>by: </EM>G. Miminis and H. Roth <LI><EM>size: </EM>663 kB </MENU> <LI><EM>file: </EM><A HREF="./748.zip">748.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,3 (Sep 1995) 327 <LI><EM>title: </EM>enclosing zeros of continuous functions <LI><EM>by: </EM>G. E. Alefeld, F. A. Porta and Y. Shi <LI><EM>size: </EM>37 kB </MENU> <LI><EM>file: </EM><A HREF="./749.zip">749.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,4 (Dec 1995) 372 <LI><EM>title: </EM>fast discrete cosine transform <LI><EM>by: </EM>B. G. Sherlock and D. M. Monro <LI><EM>size: </EM>38 kB </MENU> <LI><EM>file: </EM><A HREF="./750.zip">750.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 21,4 (Dec 1995) 410 <LI><EM>title: </EM>exact solution of large scale asymmetric travelling salesman problems <LI><EM>by: </EM>M. Dell'Amico, G. Carpaneto and P. Toth <LI><EM>size: </EM>71 kB </MENU> <LI><EM>file: </EM><A HREF="./751.zip">751.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 22,1 (Mar 1996) 1 <LI><EM>alg: </EM>tripack <LI><EM>title: </EM>constrained two-dimensional delauney triangulation package <LI><EM>by: </EM>R. J. Renka <LI><EM>size: </EM>189 kB </MENU> <LI><EM>file: </EM><A HREF="./752.zip">752.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 22,1 (Mar 1996) 9 <LI><EM>alg: </EM>srfpack <LI><EM>title: </EM>software for scattered data fitting with a constrained surface under tension <LI><EM>by: </EM>R. J. Renka <LI><EM>size: </EM>210 kB </MENU> <LI><EM>file: </EM><A HREF="./753.zip">753.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 22,1 (Mar 1996) 24 <LI><EM>alg: </EM>tenpack <LI><EM>title: </EM>a linpack/blas2-based library for the computer manipulation of tensor products <LI><EM>by: </EM>P. E. Buis and W. R. Dyksen <LI><EM>size: </EM>79 kB </MENU> <LI><EM>file: </EM><A HREF="./754.zip">754.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP <LI><EM>by: </EM>M. G. C. Resende, P. M. Pardalos and Y. Li <LI><EM>ref: </EM>TOMS 22,1 (Mar 1996) 104 <LI><EM>size: </EM>48 kB </MENU> <LI><EM>file: </EM><A HREF="./755.zip">755.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{ADOL-C}: A Package for the Automatic Differentiation of Algorithms Written in {C/C++} <LI><EM>by: </EM>A. Griewank, D. Juedes and J. Utke <LI><EM>ref: </EM>TOMS 22,2 (Jun 1996) 131 <LI><EM>size: </EM>484 kB </MENU> <LI><EM>file: </EM><A HREF="./756.zip">756.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A {Matlab} Toolbox for {Schwarz-Christoffel} Mapping <LI><EM>by: </EM>T. A. Driscoll <LI><EM>ref: </EM>TOMS 22,2 (Jun 1996) 168 <LI><EM>size: </EM>660 kB </MENU> <LI><EM>file: </EM><A HREF="./757.zip">757.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MISCFUN}, a software package to compute uncommon special functions <LI><EM>by: </EM>A. J. Macleod <LI><EM>ref: </EM>TOMS 22,3 (Sep 1996) 288 <LI><EM>size: </EM>1273 kB </MENU> <LI><EM>file: </EM><A HREF="./758.zip">758.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{VLUGR2}: a vectorizable adaptive-grid solver for {PDEs} in {2D} <LI><EM>by: </EM>J. G. Blom, R. A. Trompert and J. G. Verwer <LI><EM>ref: </EM>TOMS 22,3 (Sep 1996) 302 <LI><EM>size: </EM>1865 kB </MENU> <LI><EM>file: </EM><A HREF="./759.zip">759.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{VLUGR3}: a vectorizable adaptive-grid solver for {PDEs} in {3D} --- Part {II}. code description <LI><EM>by: </EM>J. G. Blom and J. G. Verwer <LI><EM>ref: </EM>TOMS 22,3 (Sep 1996) 329 <LI><EM>size: </EM>1741 kB </MENU> <LI><EM>file: </EM><A HREF="./760.zip">760.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Rectangular-grid-data surface fitting that has the accuracy of a bicubic polynomial <LI><EM>ref: </EM>TOMS 22,3 (Sep 1996) 357 <LI><EM>by: </EM>H. Akima <LI><EM>size: </EM>76 kB </MENU> <LI><EM>file: </EM><A HREF="./761.zip">761.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Scattered-data surface fitting that has the accuracy of a cubic polynomial <LI><EM>by: </EM>H. Akima <LI><EM>ref: </EM>TOMS 22,3 (Sep 1996) 362 <LI><EM>size: </EM>285 kB </MENU> <LI><EM>file: </EM><A HREF="./762.zip">762.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{LLDRLF}, log-likelihood and some derivatives for {log-F} models <LI><EM>by: </EM>B. W. Brown, L. B. Levy, J. Lovato, K. Russell and F. M. Spears <LI><EM>ref: </EM>TOMS 22,3 (Sep 1996) 372 <LI><EM>size: </EM>410 kB </MENU> <LI><EM>file: </EM><A HREF="./763.zip">763.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>INTERVAL_ARITHMETIC: A Fortran 90 Module for an Interval Data Type <LI><EM>by: </EM>R. B. Kearfott <LI><EM>ref: </EM>TOMS 22,4 (Dec 1996) 385 <LI><EM>size: </EM>347 kB </MENU> <LI><EM>file: </EM><A HREF="./764.zip">764.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Cubpack++: A {C++} Package for Automatic Two-Dimensional Cubature <LI><EM>by: </EM>R. Cools, D. Laurie and L. Pluym <LI><EM>ref: </EM>TOMS 23,1 (Mar 1997) 1 <LI><EM>size: </EM>938 kB </MENU> <LI><EM>file: </EM><A HREF="./765.zip">765.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{STENMIN:} A Software Package for Large, Sparse Unconstrained Optimization Using Tensor Methods <LI><EM>by: </EM>A. Bouaricha <LI><EM>ref: </EM>TOMS 23,1 (Mar 1997) 81 <LI><EM>size: </EM>1106 kB </MENU> <LI><EM>file: </EM><A HREF="./766.zip">766.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Experiments with a Weakly Stable Algorithm for Computing {Pad\'{e}}-{Hermite} and Simultaneous {Pad\'{e}} Approximants <LI><EM>by: </EM>S. Cabay, A. R. Jones and G. Labahn <LI><EM>ref: </EM>TOMS 23,1 (Mar 1997) 91 <LI><EM>size: </EM>140 kB </MENU> <LI><EM>file: </EM><A HREF="./767.zip">767.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A {Fortran} 77 Package for Column Reduction of Polynomial Matrices <LI><EM>by: </EM>A. J. Geurts and C. Praagman <LI><EM>ref: </EM>TOMS 23,1 (Mar 1997) 111 <LI><EM>size: </EM>180 kB </MENU> <LI><EM>file: </EM><A HREF="./768.zip">768.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{TENSOLVE}: A Software Package for Solving Systems of Nonlinear <LI><EM>by: </EM>A. Bouaricha and R. B. Schnabel <LI><EM>ref: </EM>TOMS 23,2 (Jun 1997) 174 <LI><EM>size: </EM>287 kB </MENU> <LI><EM>file: </EM><A HREF="./769.zip">769.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran} Subroutines for Approximate Solution of Sparse <LI><EM>by: </EM>P. M. Pardalos, L. S. Pitsolulis and M. G. C. Resende <LI><EM>ref: </EM>TOMS 23,2 (Jun 1997) 196 <LI><EM>size: </EM>272 kB </MENU> <LI><EM>file: </EM><A HREF="./770.zip">770.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{BVSPIS}---A Package for Computing Boundary-Valued <LI><EM>by: </EM>P. Costantini <LI><EM>ref: </EM>TOMS 23,2 (Jun 1997) 252 <LI><EM>size: </EM>285 kB </MENU> <LI><EM>file: </EM><A HREF="./771.zip">771.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>rksuite_90: {Fortran} 90 Software for Ordinary Differential <LI><EM>by: </EM>R. W. Brankin and I. Gladwell <LI><EM>ref: </EM>TOMS 23,3 (Sep 1997) 402 <LI><EM>size: </EM>1474 kB </MENU> <LI><EM>file: </EM><A HREF="./772.zip">772.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{STRIPACK}: {Delaunay} Triangulation and {Voronoi} Diagram <LI><EM>by: </EM>R. J. Renka <LI><EM>ref: </EM>TOMS 23,3 (Sep 1997) 416 <LI><EM>size: </EM>207 kB </MENU> <LI><EM>file: </EM><A HREF="./773.zip">773.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SSRFPACK}: Interpolation of Scattered Data on the Surface of a Sphere with a Surface under Tension <LI><EM>by: </EM>R. J. Renka <LI><EM>ref: </EM>TOMS 23,3 (Sep 1997) 435 <LI><EM>size: </EM>200 kB </MENU> <LI><EM>file: </EM><A HREF="./774.zip">774.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran} Subroutines for Generating Box-Constrained <LI><EM>by: </EM>F. Facchinei, J. Judice and J. Soares <LI><EM>ref: </EM>TOMS 23,3 (Sep 1997) 448 <LI><EM>size: </EM>139 kB </MENU> <LI><EM>file: </EM><A HREF="./775.zip">775.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The Code {SLEUTH} for Solving Fourth-Order {Sturm} {Liouville} Problems <LI><EM>by: </EM>L. Greenberg and M. Marletta <LI><EM>ref: </EM>TOMS 23,3 (Sep 1997) 448 <LI><EM>size: </EM>206 kB </MENU> <LI><EM>file: </EM><A HREF="./776.zip">776.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SRRIT}: A {Fortran} Subroutine to Calculate the Dominant Invariant Subspace of a Nonsymmetric Matrix <LI><EM>by: </EM>Z. Bai and G. W. Stewart <LI><EM>ref: </EM>TOMS 23,4 (Dec 1997) 494 <LI><EM>size: </EM>730 kB </MENU> <LI><EM>file: </EM><A HREF="./777.zip">777.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{HOMPACK90}: A Suite of {Fortran} 90 Codes for Globally <LI><EM>by: </EM>L. T. Watson, M. Sosonkina, R. C. Melville, A. P. Morgan and H. F. Walker <LI><EM>ref: </EM>TOMS 23,4 (Dec 1997) 514 <LI><EM>size: </EM>671 kB </MENU> <LI><EM>file: </EM><A HREF="./778.zip">778.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{L-BFGS-B}: {Fortran} Subroutines for Large-Scale <LI><EM>by: </EM>C. Zhu, R. H. Byrd, P. Lu and J. Nocedal <LI><EM>ref: </EM>TOMS 23,4 (Dec 1997) 550 <LI><EM>size: </EM>715 kB </MENU> <LI><EM>file: </EM><A HREF="./779.zip">779.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fermi-Dirac} Functions of Order -1/2, 1/2, 3/2, 5/2 <LI><EM>by: </EM>A. J. Macleod <LI><EM>ref: </EM>TOMS 24,1 (Mar 1998) 1 <LI><EM>size: </EM>123 kB </MENU> <LI><EM>file: </EM><A HREF="./780.zip">780.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Exponential Pseudorandom Distribution <LI><EM>by: </EM>K. G. Hamilton <LI><EM>size: </EM>5 kB </MENU> <LI><EM>file: </EM><A HREF="./781.zip">781.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Generating {Hilbert's} Space-Filling Curves by Recursion <LI><EM>by: </EM>G. Breinholt, C. Schierz and H. Krueger <LI><EM>ref: </EM>TOMS 24,2 (Jun 1998) 184 <LI><EM>size: </EM>4 kB </MENU> <LI><EM>file: </EM><A HREF="./782.zip">782.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computing Rank-Revealing {QR} Factorizations of Dense Matrices <LI><EM>by: </EM>C. H. Bischof and G. Quintana-Ort\'{\i} <LI><EM>ref: </EM>TOMS 24,2 (Jun 1998) 254 <LI><EM>size: </EM>2433 kB </MENU> <LI><EM>file: </EM><A HREF="./783.zip">783.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Pcp2Nurb} -- Smooth Free-Form Surfacing with Linearly Trimmed <LI><EM>by: </EM>J. Peters <LI><EM>ref: </EM>TOMS 24,3 (Sep 1998) 261 <LI><EM>size: </EM>177 kB </MENU> <LI><EM>file: </EM><A HREF="./784.zip">784.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{GEMM}-Based Level 3 {BLAS}: Portability and Optimization Issues <LI><EM>by: </EM>B. K\aagstr\"{o}m, P. Ling and C. {Van Loan} <LI><EM>ref: </EM>TOMS 24,3 (Sep 1998) 303 <LI><EM>size: </EM>2977 kB </MENU> <LI><EM>file: </EM><A HREF="./785.zip">785.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Software Package for Computing {Schwarz}-{Christoffel} <LI><EM>by: </EM>C. Hu <LI><EM>ref: </EM>TOMS 24,3 (Sep 1998) 317 <LI><EM>size: </EM>141 kB </MENU> <LI><EM>file: </EM><A HREF="./786.zip">786.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Multiple Precision Complex Arithmetic and Functions <LI><EM>by: </EM>D. M. Smith <LI><EM>ref: </EM>TOMS 24,4 (Dec 1998) 359 <LI><EM>size: </EM>1849 kB </MENU> <LI><EM>file: </EM><A HREF="./787.zip">787.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran} Subroutines for Approximate Solution of Maximum <LI><EM>by: </EM>M. C. G. Resende, T. A. Feo and S. H. Smith <LI><EM>ref: </EM>TOMS 24,4 (Dec 1998) 386 <LI><EM>size: </EM>119 kB </MENU> <LI><EM>file: </EM><A HREF="./788.zip">788.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Boundary Integral Equation Programs for the Planar <LI><EM>by: </EM>K. Atkinson and Y. Jeon <LI><EM>ref: </EM>TOMS 24,4 (Dec 1998) 395 <LI><EM>size: </EM>299 kB </MENU> <LI><EM>file: </EM><A HREF="./789.zip">789.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SLTSTPAK}: A Test Package for {Sturm}-{Liouville} Solvers <LI><EM>by: </EM>J. D. Pryce <LI><EM>ref: </EM>TOMS 25,1 (Mar 1999) 58 <LI><EM>size: </EM>1796 kB </MENU> <LI><EM>file: </EM><A HREF="./790.zip">790.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{CSHEP2D}: Cubic {Shepard Method for Bivariate Interpolation of Scattered Data <LI><EM>by: </EM>R. J. Renka <LI><EM>ref: </EM>TOMS 25,1 (Mar 1999) 70 <LI><EM>size: </EM>103 kB </MENU> <LI><EM>file: </EM><A HREF="./791.zip">791.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{TSHEP2D}: Cosine Series {Shepard} Method for Bivariate Interpolation of Scattered Data <LI><EM>by: </EM>R. J. Renka and R. Brown <LI><EM>ref: </EM>TOMS 25,1 (Mar 1999) 74 <LI><EM>size: </EM>106 kB </MENU> <LI><EM>file: </EM><A HREF="./792.zip">792.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Accuracy Tests of {ACM} Algorithms for Interpolation of Scattered Data in the Plane <LI><EM>by: </EM>R. J. Renka and R. Brown <LI><EM>ref: </EM>TOMS 25,1 (Mar 1999) 78 <LI><EM>size: </EM>96 kB </MENU> <LI><EM>file: </EM><A HREF="./793.zip">793.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{GQRAT} --- {Gauss} Quadrature for Rational Functions <LI><EM>by: </EM>W. Gautschi <LI><EM>ref: </EM>TOMS 25,2 (Jun 1999) 213 <LI><EM>size: </EM>140 kB </MENU> <LI><EM>file: </EM><A HREF="./794.zip">794.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Numerical {Hankel} transform by the {Fortran} program {HANKEL} <LI><EM>by: </EM>T. Wieder <LI><EM>ref: </EM>TOMS 25,2 (Jun 1999) 240 <LI><EM>size: </EM>261 kB </MENU> <LI><EM>file: </EM><A HREF="./795.zip">795.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>PHCPACK: A general-purpose solver for polynomial systems by homotopy continuation <LI><EM>by: </EM>J. Verschelde <LI><EM>ref: </EM>TOMS 25,2 (Jun 1999) 251 <LI><EM>size: </EM>24525 kB </MENU> <LI><EM>file: </EM><A HREF="./796.zip">796.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A {Fortran} Software Package for the Numerical Inversion of the {Laplace} Transform Based on a {Fourier} Series Method <LI><EM>by: </EM>L. D'Amore, G. Laccetti and A. Murli <LI><EM>ref: </EM>TOMS 25,3 (Sep 1999) 306 <LI><EM>size: </EM>254 kB </MENU> <LI><EM>file: </EM><A HREF="./797.zip">797.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran} Subroutines for Approximate Solution of Graph Planarization Problems Using {GRASP} <LI><EM>by: </EM>C. C. Ribeiro and M. G. C. Resende <LI><EM>ref: </EM>TOMS 25,3 (Sep 1999) 341 <LI><EM>size: </EM>126 kB </MENU> <LI><EM>file: </EM><A HREF="./798.zip">798.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>High-Dimensional Interpolation Using the Modified {Shepard} Method <LI><EM>by: </EM>M. W. Berry and K. S. Minser <LI><EM>ref: </EM>TOMS 25,3 (Sep 1999) 353 <LI><EM>size: </EM>1456 kB </MENU> <LI><EM>file: </EM><A HREF="./799.zip">799.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Revolve: An Implementation of Checkpointing for the Reverse or Adjoint Mode of Computational Differentiation <LI><EM>by: </EM>A. Griewank and A. Walther <LI><EM>ref: </EM>TOMS 26,1 (Mar 2000) 19 <LI><EM>size: </EM>51 kB </MENU> <LI><EM>file: </EM><A HREF="./800.zip">800.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran 77} Subroutines for Computing the Eigenvalues of Hamiltonian Matrices {I}: The Square-Reduced Method <LI><EM>by: </EM>P. Benner, R. Byers and E. Barth <LI><EM>ref: </EM>TOMS 26,1 (Mar 2000) 49 <LI><EM>size: </EM>160 kB </MENU> <LI><EM>file: </EM><A HREF="./801.zip">801.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{POLSYS_PLP}: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations <LI><EM>by: </EM>S. M. Wise, A. J. Sommese and L. T. Watson <LI><EM>ref: </EM>TOMS 26,1 (Mar 2000) 176 <LI><EM>size: </EM>470 kB </MENU> <LI><EM>file: </EM><A HREF="./802.zip">802.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An Automatic Generator for Bivariate Log-Concave Distributions <LI><EM>by: </EM>W. H\"{o}rmann <LI><EM>ref: </EM>TOMS 26,1 (Mar 2000) 201 <LI><EM>size: </EM>111 kB </MENU> <LI><EM>file: </EM><A HREF="./803.zip">803.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Simpler Macro Processor <LI><EM>by: </EM>W. A. {Ward, Jr.} <LI><EM>ref: </EM>TOMS 26,2 (Jun 2000) 310 <LI><EM>size: </EM>148 kB </MENU> <LI><EM>file: </EM><A HREF="./804.zip">804.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Subroutines for the computation of Mathieu functions of integer orders <LI><EM>by: </EM>Alhargan, F. A. <LI><EM>ref: </EM>TOMS 26,3 (Sep 2000) 408 <LI><EM>size: </EM>124 kB </MENU> <LI><EM>file: </EM><A HREF="./805.zip">805.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computation and Uses of the Semidiscrete Matrix Decomposition <LI><EM>by: </EM>Kolda, T. G. and O'Leary, D. P. <LI><EM>ref: </EM>TOMS 26,3 (Sep 2000) 415 <LI><EM>size: </EM>585 kB </MENU> <LI><EM>file: </EM><A HREF="./806.zip">806.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>SPRNG: A Scalable Library for Pseudorandom Number Generation <LI><EM>by: </EM>Mascagni, M. and Srinivasan, A. <LI><EM>ref: </EM>TOMS 26,3 (Sep 2000) 436 <LI><EM>size: </EM>2867 kB </MENU> <LI><EM>file: </EM><A HREF="./807.zip">807.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The {SBR} Toolbox -- Software for Successive Band Reduction <LI><EM>by: </EM>C. H. Bischof, B. Lang and X. Sun <LI><EM>ref: </EM>TOMS 26,4 (Dec 2000) 602 <LI><EM>size: </EM>1173 kB </MENU> <LI><EM>file: </EM><A HREF="./808.zip">808.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{ARFIT} --- A {Matlab} Package for the Estimation of Parameters and Eigenmodes of Multivariate Autoregressive Models <LI><EM>by: </EM>T. Schneider and A. Neumaier <LI><EM>ref: </EM>TOMS 27,1 (Mar 2001) 58 <LI><EM>size: </EM>56 kB </MENU> <LI><EM>file: </EM><A HREF="./809.zip">809.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{PREQN}: Fortran 77 Subroutines for Preconditioning the Conjugate Gradient Method <LI><EM>by: </EM>J. L. Morales and J. Nocedal <LI><EM>ref: </EM>TOMS 27,1 (Mar 2001) 83 <LI><EM>size: </EM>2913 kB </MENU> <LI><EM>file: </EM><A HREF="./810.zip">810.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The {SLEIGN2} {Sturm}-{Liouville} Code <LI><EM>by: </EM>P. B. Bailey, W. N. Everitt and A. Zettl <LI><EM>ref: </EM>TOMS 27,2 (Jun 2001) 143 <LI><EM>size: </EM>773 kB </MENU> <LI><EM>file: </EM><A HREF="./811.zip">811.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{NDA}: Algorithms for Nondifferentiable Optimization <LI><EM>by: </EM>L. Luksan and J. Vlcek <LI><EM>ref: </EM>TOMS 27,2 (Jun 2001) 193 <LI><EM>size: </EM>719 kB </MENU> <LI><EM>file: </EM><A HREF="./812.zip">812.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{BPOLY}: An Object-Oriented Library of Numerical Algorithms for Polynomials in {Bernstein} Form <LI><EM>by: </EM>Y-F. Tsai and R. T. Farouki <LI><EM>ref: </EM>TOMS 27,2 (Jun 2001) 267 <LI><EM>size: </EM>82 kB </MENU> <LI><EM>file: </EM><A HREF="./813.zip">813.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SPG}--Software for Convex-Constrained Optimization <LI><EM>by: </EM>E. G. Birgin, J. M. Martinez and M. Raydan <LI><EM>ref: </EM>TOMS 27,3 (Sep 2001) 340 <LI><EM>size: </EM>66 kB </MENU> <LI><EM>file: </EM><A HREF="./814.zip">814.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran} 90 Software for Floating-Point Multiple Arithmetic, {Gamma} and Related Functions <LI><EM>by: </EM>D. M. Smith <LI><EM>ref: </EM>TOMS 27,4 (Dec 2001) 377 <LI><EM>size: </EM>171 kB </MENU> <LI><EM>file: </EM><A HREF="./815.zip">815.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran} Subroutines for Computing Approximate Solutions of Feedback Set Problems Using {GRASP} <LI><EM>by: </EM>P. Festa, P. M. Pardalos and M. G. C. Resende <LI><EM>ref: </EM>TOMS 27,4 (Dec 2001) 456 <LI><EM>size: </EM>474 kB </MENU> <LI><EM>file: </EM><A HREF="./816.zip">816.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>r2d2lri: an algorithm for automatic two-dimensional cubature <LI><EM>by: </EM>I. Robinson and M. Hill <LI><EM>ref: </EM>TOMS 28,1 (Mar 2002) 75 <LI><EM>size: </EM>219 kB </MENU> <LI><EM>file: </EM><A HREF="./817.zip">817.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{P2MESH}: generic object-oriented interface between {2-D} unstructured meshes and {FEM/FVM-based PDE} solvers <LI><EM>by: </EM>E. Bertolazzi and G. Manzini <LI><EM>ref: </EM>TOMS 28,1 (Mar 2002) 101 <LI><EM>size: </EM>6114 kB </MENU> <LI><EM>file: </EM><A HREF="./818.zip">818.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Reference Model Implementation of the Sparse {BLAS} in {Fortran} 95 <LI><EM>by: </EM>Duff, I. S. and V\"{o}mel, C <LI><EM>ref: </EM>TOMS 28,2 (Jun 2002) 268 <LI><EM>size: </EM>2432 kB </MENU> <LI><EM>file: </EM><A HREF="./819.zip">819.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{AIZ, BIZ}: Two {Fortran} 77 Routines for the Computation of Complex {Airy} Functions <LI><EM>by: </EM>A. Gil, J. Segura and N. M. Temme <LI><EM>ref: </EM>TOMS 28,3 (Sep 2002) 325 <LI><EM>size: </EM>1163 kB </MENU> <LI><EM>file: </EM><A HREF="./820.zip">820.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Flexible Implementation of Matching Pursuit for {Gabor} Functions on the Interval <LI><EM>by: </EM>S. E. Ferrando, L. A. Kolasa and N. Kova\v{c}evi\'{c} <LI><EM>ref: </EM>TOMS 28,3 (Sep 2002) 337 <LI><EM>size: </EM>239 kB </MENU> <LI><EM>file: </EM><A HREF="./821.zip">821.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A {Fortran} Interface to {POSIX} Threads <LI><EM>by: </EM>R. J. Hanson, C. P. Breshears and H. A. Gabb <LI><EM>ref: </EM>TOMS 28,3 (Sep 2002) 354 <LI><EM>size: </EM>251 kB </MENU> <LI><EM>file: </EM><A HREF="./822.zip">822.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>GIZ, HIZ: Two {Fortran} 77 routines for the computation of complex {Scorer} functions <LI><EM>by: </EM>A. Gil, J. Segura and N. M. Temme <LI><EM>ref: </EM>TOMS 28,4 (Dec 2002) 436 <LI><EM>size: </EM>3177 kB </MENU> <LI><EM>file: </EM><A HREF="./823.zip">823.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Implementing Scrambled Digital Sequences <LI><EM>by: </EM>H. S. Hong and F. J. Hickernell <LI><EM>ref: </EM>TOMS 29,2 (Jun 2003) 95 <LI><EM>size: </EM>181 kB </MENU> <LI><EM>file: </EM><A HREF="./824.zip">824.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>CUBPACK: A Package for Automatic Cubature; Framework Description <LI><EM>by: </EM>R. Cools and A. Haegemans <LI><EM>size: </EM>427 kB </MENU> <LI><EM>file: </EM><A HREF="./825.zip">825.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Deep-Cut Bisection Envelope Algorithm for Fixed Points <LI><EM>by: </EM>S. Shellman and K. Sikorski <LI><EM>ref: </EM>TOMS 29,3 (Sep 2003) 309 <LI><EM>size: </EM>33 kB </MENU> <LI><EM>file: </EM><A HREF="./826.zip">826.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Parallel Eigenvalue Routine for Complex {Hessenberg} Matrices <LI><EM>by: </EM>M. R. Fahey <LI><EM>ref: </EM>TOMS 29,3 (Sep 2003) 326 <LI><EM>size: </EM>486 kB </MENU> <LI><EM>file: </EM><A HREF="./827.zip">827.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>irbleigs: A {MATLAB} Program for Computing a Few Eigenpairs of a Large Sparse {Hermitian} Matrix <LI><EM>by: </EM>J. Baglama, D. Calvetti and L. Reichel <LI><EM>ref: </EM>TOMS 29,3 (Sep 2003) 337 <LI><EM>size: </EM>66 kB </MENU> <LI><EM>file: </EM><A HREF="./828.zip">828.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{DNSPLIN1}: Discrete Nonlinear Spline Interpolation <LI><EM>by: </EM>R. J. Renka <LI><EM>ref: </EM>TOMS 29,4 (Dec 2003) 458 <LI><EM>size: </EM>525 kB </MENU> <LI><EM>file: </EM><A HREF="./829.zip">829.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Software for Generation of Classes of Test Functions with Known Local and Global Minima for Global Optimization <LI><EM>by: </EM>M. Gaviano, D. E. Kvasov, D. Lera and Y. D. Sergeyev <LI><EM>ref: </EM>TOMS 29,4 (Dec 2003) 469 <LI><EM>size: </EM>614 kB </MENU> <LI><EM>file: </EM><A HREF="./830.zip">830.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Another Visit With Standard and Modified Givens Transformations and A Remark On Algorithm 539 <LI><EM>by: </EM>R. J. Hanson and T. R. Hopkins <LI><EM>ref: </EM>TOMS 30,1 (Mar 2004) 86 <LI><EM>size: </EM>269 kB </MENU> <LI><EM>file: </EM><A HREF="./831.zip">831.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Modified {Bessel} Functions of Imaginary Order and Positive Argument <LI><EM>by: </EM>A. Gil, J. Segura and N. M. Temme <LI><EM>ref: </EM>TOMS 30,2 (Jun 2004) 159 <LI><EM>size: </EM>206 kB </MENU> <LI><EM>file: </EM><A HREF="./832.zip">832.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{UMFPACK} --- an Unsymmetric-Pattern Multifrontal Method <LI><EM>by: </EM>T. A. Davis <LI><EM>ref: </EM>TOMS 30,2 (Jun 2004) 196 <LI><EM>size: </EM>5283 kB </MENU> <LI><EM>file: </EM><A HREF="./833.zip">833.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{CSRFPACK} --- Interpolation of Scattered Data with a $C^1$ Convexity-preserving Surface <LI><EM>by: </EM>R. J. Renka <LI><EM>ref: </EM>TOMS 30,2 (Jun 2004) 200 <LI><EM>size: </EM>446 kB </MENU> <LI><EM>file: </EM><A HREF="./834.zip">834.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>glsurf --- An Interactive Surface Plotting Program using {OpenGL} <LI><EM>by: </EM>R. J. Renka <LI><EM>ref: </EM>TOMS 30,2 (Jun 2004) 212 <LI><EM>size: </EM>130 kB </MENU> <LI><EM>file: </EM><A HREF="./835.zip">835.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MultRoot} --- A {Matlab} Package for Computing Polynomial Roots and Multiplicities <LI><EM>by: </EM>Z. Zeng <LI><EM>ref: </EM>TOMS 30,2 (Jun 2004) 218 <LI><EM>size: </EM>1120 kB </MENU> <LI><EM>file: </EM><A HREF="./836.zip">836.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{COLAMD}, a Column Approximate Minimum Degree Ordering Algorithm <LI><EM>by: </EM>T. A. Davis, J. R. Gilbert, S. I. Larimore and E. G. Ng <LI><EM>ref: </EM>TOMS 30,3 (Sep 2004) 377 <LI><EM>size: </EM>41 kB </MENU> <LI><EM>file: </EM><A HREF="./837.zip">837.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{AMD}, an Approximate Minimum Degree Ordering Algorithm <LI><EM>by: </EM>P. Amestoy, T. A. Davis and I. Duff <LI><EM>ref: </EM>TOMS 30,3 (Sep 2004) 381 <LI><EM>size: </EM>282 kB </MENU> <LI><EM>file: </EM><A HREF="./838.zip">838.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Airy} Functions <LI><EM>by: </EM>B. R. Fabijonas <LI><EM>ref: </EM>TOMS 30,4 (Dec 2004) 491 <LI><EM>size: </EM>63 kB </MENU> <LI><EM>file: </EM><A HREF="./839.zip">839.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{FIAT}, A New Paradigm for Computing Finite Element Basis Functions <LI><EM>by: </EM>R. C. Kirby <LI><EM>ref: </EM>TOMS 30,4 (Dec 2004) 502 <LI><EM>size: </EM>49 kB </MENU> <LI><EM>file: </EM><A HREF="./840.zip">840.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computation of Grid Points, Quadrature Weights and Derivatives for Spectral Element Methods Using Prolate Spheroidal Wave Functions --- Prolate Elements <LI><EM>by: </EM>J. P. Boyd <LI><EM>ref: </EM>TOMS 31,1 (Mar 2005) 149 <LI><EM>size: </EM>27 kB </MENU> <LI><EM>file: </EM><A HREF="./841.zip">841.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{BHESS}: {Gaussian} Reduction to a Similar Banded {Hessenberg} Form <LI><EM>by: </EM>G. W. Howell and N. Diaa <LI><EM>ref: </EM>TOMS 31,1 (Mar 2005) 166 <LI><EM>size: </EM>3485 kB </MENU> <LI><EM>file: </EM><A HREF="./842.zip">842.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Set of {GMRES} Routines for Real and Complex Arithmetics on High Performance Computers <LI><EM>by: </EM>V. Frayss\'{e}, L. Giraud, S. Gratton and J. Langou <LI><EM>size: </EM>913 kB </MENU> <LI><EM>file: </EM><A HREF="./843.zip">843.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Improvements to the {Schwarz-Christoffel Toolbox} for {MATLAB} <LI><EM>by: </EM>T. A. Driscoll <LI><EM>ref: </EM>TOMS 31,2 (Jun 2005) 239 <LI><EM>size: </EM>1173 kB </MENU> <LI><EM>file: </EM><A HREF="./844.zip">844.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computing Sparse Reduced-Rank Approximations to Sparse Matrices <LI><EM>by: </EM>M. W. Berry, S. A. Pulatova and G. W. Stewart <LI><EM>ref: </EM>TOMS 31,2 (Jun 2005) 252 <LI><EM>size: </EM>26 kB </MENU> <LI><EM>file: </EM><A HREF="./845.zip">845.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{EIGIFP}: A {MATLAB} Program for Solving Large Symmetric Generalized Eigenvalue Problems <LI><EM>by: </EM>J. H. Money and Q. Ye <LI><EM>ref: </EM>TOMS 31,2 (Jun 2005) 270 <LI><EM>size: </EM>252 kB </MENU> <LI><EM>file: </EM><A HREF="./846.zip">846.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MixedVol}: A Software Package for Mixed Volume Computation <LI><EM>by: </EM>T. Gao, T. Y. Li and M. Wu <LI><EM>ref: </EM>TOMS 31,4 (Dec 2005) 555 <LI><EM>size: </EM>309 kB </MENU> <LI><EM>file: </EM><A HREF="./847.zip">847.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{spinterp}: Piecewise Multilinear Hierarchical Sparse Grid Interpolation in {MATLAB} <LI><EM>by: </EM>A. Klimke and B. Wohlmuth <LI><EM>ref: </EM>TOMS 31,4 (Dec 2005) 561 <LI><EM>size: </EM>1323 kB </MENU> <LI><EM>file: </EM><A HREF="./848.zip">848.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Recursive Fixed Point Algorithm for the Infinity-Norm Case <LI><EM>by: </EM>S. Shellman and K. Sikorski <LI><EM>ref: </EM>TOMS 31,4 (Dec 2005) 580 <LI><EM>size: </EM>27 kB </MENU> <LI><EM>file: </EM><A HREF="./849.zip">849.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Concise Sparse {Cholesky} Factorization Package <LI><EM>by: </EM>T. A. Davis <LI><EM>ref: </EM>TOMS 31,4 (Dec 2005) 587 <LI><EM>size: </EM>795 kB </MENU> <LI><EM>file: </EM><A HREF="./850.zip">850.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Real parabolic cylinder functions {$U(a,x)$, $V(a,x)$} <LI><EM>by: </EM>A. Gil, J. Segura and N. M. Temme <LI><EM>ref: </EM>TOMS 32,1 (Mar 2006) 102 <LI><EM>size: </EM>280 kB </MENU> <LI><EM>file: </EM><A HREF="./851.zip">851.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{CG\_DESCENT}, a conjugate gradient method with guaranteed descent <LI><EM>by: </EM>W. W. Hager and H. Zhang <LI><EM>ref: </EM>TOMS 32,1 (Mar 2006) 113 <LI><EM>size: </EM>456 kB </MENU> <LI><EM>file: </EM><A HREF="./852.zip">852.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{RealPaver}: an interval solver using constraint satisfaction techniques <LI><EM>by: </EM>L. Granvilliers and F. Benhamou <LI><EM>ref: </EM>TOMS 32,1 (Mar 2006) 138 <LI><EM>size: </EM>2744 kB </MENU> <LI><EM>file: </EM><A HREF="./853.zip">853.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An efficient algorithm for solving rank-deficient least squares problems <LI><EM>by: </EM>L. Foster and R. Kommu <LI><EM>ref: </EM>TOMS 32,1 (Mar 2006) 157 <LI><EM>size: </EM>2992 kB </MENU> <LI><EM>file: </EM><A HREF="./854.zip">854.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Fortran 77 Subroutines for Computing the Eigenvalues of {Hamiltonian} Matrices {II} <LI><EM>by: </EM>P. Benner and D. Kressner <LI><EM>ref: </EM>TOMS 32,2 (Jun 2006) 352 <LI><EM>size: </EM>1440 kB </MENU> <LI><EM>file: </EM><A HREF="./855.zip">855.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Subroutines for the Computation of {Mathieu} Characteristic Numbers and their General Orders <LI><EM>by: </EM>F. A. Alhargan <LI><EM>ref: </EM>TOMS 32,3 (Sep 2006) 472 <LI><EM>size: </EM>96 kB </MENU> <LI><EM>file: </EM><A HREF="./856.zip">856.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>ref: </EM>TOMS 32,3 (Sep 2006) 485 <LI><EM>title: </EM>{APPSPACK 4.0}: Asynchronous Parallel Pattern Search for Derivative-Free Optimization <LI><EM>by: </EM>G. A. Gray and T. G. Kolda <LI><EM>ref: </EM>TOMS 32,3 (Sep 2006) 485 <LI><EM>size: </EM>8392 kB </MENU> <LI><EM>file: </EM><A HREF="./857.zip">857.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{POLSYS GLP}: A Parallel General Linear Product Homotopy Code for Solving Polynomial Systems of Equations <LI><EM>by: </EM>H.-J. Su, J. M. McCarthy, M. Sosonkina and L. T. Watson <LI><EM>ref: </EM>TOMS 32,4 (Dec 2006) 561 <LI><EM>size: </EM>1240 kB </MENU> <LI><EM>file: </EM><A HREF="./858.zip">858.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computing Infinite Range Integrals of an Arbitrary Product of {Bessel} Functions <LI><EM>by: </EM>J. {Van Deun} and R. Cools <LI><EM>ref: </EM>TOMS 32,4 (Dec 2006) 580 <LI><EM>size: </EM>96 kB </MENU> <LI><EM>file: </EM><A HREF="./859.zip">859.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{BABDCR}: a {Fortran} 90 package for the Solution of Bordered {ABD} Linear Systems <LI><EM>by: </EM>P. Amodio and G. Romanazzi <LI><EM>ref: </EM>TOMS 32,4 (Dec 2006) 597 <LI><EM>size: </EM>1592 kB </MENU> <LI><EM>file: </EM><A HREF="./860.zip">860.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SimpleS}: An Extension of {Freudenthal's} Simplex Subdivision <LI><EM>by: </EM>E. N. Gon\c{c}alves, R. Palhares, R. H. C. Takahashi and R. C. Mesquita <LI><EM>ref: </EM>TOMS 32,4 (Dec 2006) 609 <LI><EM>size: </EM>32 kB </MENU> <LI><EM>file: </EM><A HREF="./861.zip">861.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran} 90 Subroutines for Computing the Expansion Coefficients of {Mathieu} Functions using {Blanch's} Algorithm <LI><EM>by: </EM>D. Erricolo <LI><EM>ref: </EM>TOMS 32,4 (Dec 2006) 622 <LI><EM>size: </EM>184 kB </MENU> <LI><EM>file: </EM><A HREF="./862.zip">862.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MATLAB} Tensor Classes for Fast Algorithm Prototyping <LI><EM>by: </EM>B. W. Bader and T. G. Kolda <LI><EM>ref: </EM>TOMS 32,4 (Dec 2006) 635 <LI><EM>size: </EM>1024 kB </MENU> <LI><EM>file: </EM><A HREF="./863.zip">863.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{L2WPMA}, a {Fortran} 77 Package for Weighted Least Squares Piecewise Monotonic Data Approximation <LI><EM>by: </EM>I. C. Demetriou <LI><EM>ref: </EM>TOMS 33,1 (Mar 2007 ) Article: 6 <LI><EM>size: </EM>2968 kB </MENU> <LI><EM>file: </EM><A HREF="./864.zip">864.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Algorithms for General and Robot-Packable Variants of the Three-Dimensional Bin Packing Problem <LI><EM>by: </EM>S. Martello, D. Pisingery, D. Vigo, E. {den Boef} and J. Korst <LI><EM>ref: </EM>TOMS 33,1 (Mar 2007) Article: 7 <LI><EM>size: </EM>208 kB </MENU> <LI><EM>file: </EM><A HREF="./865.zip">865.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran} 95 Subroutines for {Cholesky} Factorization in Blocked Hybrid Format <LI><EM>by: </EM>F. G. Gustavson, J. K. Reid and J. Wasniewski <LI><EM>ref: </EM>TOMS 33,1 (Mar 2007) Article: 8 <LI><EM>size: </EM>168 kB </MENU> <LI><EM>file: </EM><A HREF="./866.zip">866.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{IFISS}, a {Matlab} Toolbox for Modelling Incompressible Flow <LI><EM>by: </EM>H. C. Elman, A. Ramage and D. J. Silvester <LI><EM>ref: </EM>TOMS 33,2 (Jun 2007) Article: 14 <LI><EM>size: </EM>2680 kB </MENU> <LI><EM>file: </EM><A HREF="./867.zip">867.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{QUADLOG} --- A Package of Routines for Generating Gauss-Related Quadrature for Two Classes of Logarithmic Weight Functions <LI><EM>by: </EM>N. H. F. Beebe and J. S. Ball <LI><EM>ref: </EM>TOMS 33,3 (Aug 2007) Article: 20 <LI><EM>size: </EM>127176 kB </MENU> <LI><EM>file: </EM><A HREF="./868.zip">868.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Globally Doubly Adaptive Quadrature - Reliable {Matlab} Codes <LI><EM>by: </EM>T. O. Espelid <LI><EM>ref: </EM>TOMS 33,3 (Aug 2007) Article: 21 <LI><EM>size: </EM>168 kB </MENU> <LI><EM>file: </EM><A HREF="./869.zip">869.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{ODRPACK95}: A Weighted Orthogonal Distance Regression Code with Bound Constraints <LI><EM>by: </EM>J. W. Zwolak, P. T. Boggs and L. T. Watson <LI><EM>ref: </EM>TOMS 33,4 (Aug 2007) Article: 27 <LI><EM>size: </EM>1904 kB </MENU> <LI><EM>file: </EM><A HREF="./870.zip">870.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Static Geometric Medial Axis Domain Decomposition in {2D} {Euclidean} Space <LI><EM>by: </EM>L. Linardakis and N. Chrisochoides <LI><EM>ref: </EM>TOMS 34,1 (Aug 2008) Article: 4 <LI><EM>size: </EM>7128 kB </MENU> <LI><EM>file: </EM><A HREF="./871.zip">871.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A {C/C++} Precompiler for the Auto Generation of Multiprecision Programs <LI><EM>by: </EM>W. Schreppers and A. Cuyt <LI><EM>ref: </EM>TOMS 34,1 (Jan 2008) Article: 5 <LI><EM>size: </EM>69848 kB </MENU> <LI><EM>file: </EM><A HREF="./872.zip">872.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Parallel 2D Constrained {Delaunay} Mesh Generation <LI><EM>by: </EM>A. N. Chernikov and N. P. Chrisochoides <LI><EM>ref: </EM>TOMS 34,1 (Jan 2008) Article: 6 <LI><EM>size: </EM>85400 kB </MENU> <LI><EM>file: </EM><A HREF="./873.zip">873.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MATLAB} Software for Large-Scale Trust-Region Subproblems and Regularization <LI><EM>by: </EM>M. Rojas, S. A. Santos and D. C. Sorensen <LI><EM>ref: </EM>TOMS 34,2 (Mar 2008) Article: 11 <LI><EM>size: </EM>816 kB </MENU> <LI><EM>file: </EM><A HREF="./874.zip">874.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{BACOLR}---Spatial and Temporal Error Control Software for {PDEs} based on High rder Adaptive Collocation <LI><EM>by: </EM>R. Wang, P. Keast and P. H. Muir <LI><EM>ref: </EM>TOMS 34,3 (May 2008) Article: 15 <LI><EM>size: </EM>432 kB </MENU> <LI><EM>file: </EM><A HREF="./875.zip">875.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{DSDP5}---Software for Semidefinite Programming <LI><EM>by: </EM>S. J. Benson and Y. Ye <LI><EM>ref: </EM>TOMS 34,3 (May 2008) Article: 16 <LI><EM>size: </EM>4896 kB </MENU> <LI><EM>file: </EM><A HREF="./876.zip">876.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Solving Fredholm Integral Equations of the Second Kind in Matlab}} <LI><EM>by: </EM>K. E. Atkinson and L. F. Shampine <LI><EM>ref: </EM>TOMS 34,4 (Jul 2008) Article: 21 <LI><EM>size: </EM>208 kB </MENU> <LI><EM>file: </EM><A HREF="./877.zip">877.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{A Subroutine Package for Cylindrical Functions of Complex Order and Nonnegative Argument} <LI><EM>by: </EM>M. Kodama <LI><EM>ref: </EM>TOMS 34,4 (Jul 2008) Article: 22 <LI><EM>size: </EM>520 kB </MENU> <LI><EM>file: </EM><A HREF="./878.zip">878.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Exact VARMA likelihood and its gradient for complete and incomplete data with Matlab} <LI><EM>by: </EM>K. Jonasson <LI><EM>ref: </EM>TOMS 35,1 (Jul 2008) Article: 6 <LI><EM>size: </EM>1456 kB </MENU> <LI><EM>file: </EM><A HREF="./879.zip">879.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{EIGENTEST}---a test matrix generator for large-scale eigenproblems <LI><EM>by: </EM>C-R. Lee and G. W. Stewart <LI><EM>ref: </EM>TOMS 35,1 (Jul 2008) Article: 7 <LI><EM>size: </EM>752 kB </MENU> <LI><EM>file: </EM><A HREF="./880.zip">880.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{A testing infrastructure for symmetric tridiagonal eigensolvers} <LI><EM>by: </EM>O. A. Marques, C. Voemel, J. W. Demmel and B. N. Parlett <LI><EM>ref: </EM>TOMS 35,1 (Jul 2008) Article: 8 <LI><EM>size: </EM>1440 kB </MENU> <LI><EM>file: </EM><A HREF="./881.zip">881.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{A Set of Flexible GMRES Routines for Real and Complex Arithmetics on High-Performance Computers} <LI><EM>by: </EM>V. Frayss\'{e}, L. Giraud and S. Gratton <LI><EM>ref: </EM>TOMS 35,2 (Jul 2008) Article: 13 <LI><EM>size: </EM>2368 kB </MENU> <LI><EM>file: </EM><A HREF="./882.zip">882.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Near-Best Fixed Pole Rational Interpolation with Applications in Spectral Methods <LI><EM>by: </EM>J. {van Deun}, K. Deckers, A. Bultheel and J. A. C. Weideman <LI><EM>ref: </EM>TOMS 35,2 (Jul 2008) Article: 14 <LI><EM>size: </EM>48 kB </MENU> <LI><EM>file: </EM><A HREF="./883.zip">883.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems} <LI><EM>by: </EM>H. Waki, S. Kim, M. Kojima, M. Muramatsu and H. Sugimoto <LI><EM>ref: </EM>TOMS 35,2 (Jul 2008) Article: 15 <LI><EM>size: </EM>18808 kB </MENU> <LI><EM>file: </EM><A HREF="./884.zip">884.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{A Simple Matlab Implementation of the Argyris Element} <LI><EM>by: </EM>V. Dom\'{\i}nguez and F-J. Sayas <LI><EM>ref: </EM>TOMS 35,2 (Jul 2008) Article: 16 <LI><EM>size: </EM>192 kB </MENU> <LI><EM>file: </EM><A HREF="./885.zip">885.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computing the Logarithm of the Normal Distribution <LI><EM>by: </EM>J. M. Linhart <LI><EM>ref: </EM>TOMS 35,3 (Oct 2008) Article: 20 <LI><EM>size: </EM>112 kB </MENU> <LI><EM>file: </EM><A HREF="./886.zip">886.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Padua2D}---{Lagrange} Interpolation at {Padua} Points on Bivariate Domains <LI><EM>by: </EM>M. Caliari, S. Marchi and M. Vianello <LI><EM>ref: </EM>TOMS 35,3 (Oct 2008) Article: 21 <LI><EM>size: </EM>3120 kB </MENU> <LI><EM>file: </EM><A HREF="./887.zip">887.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{CHOLMOD}, Supernodal Sparse {Cholesky} Factorization and Update/Downdate <LI><EM>by: </EM>Y. Chen, T. A. Davis, W. W. Hager and S. Rajamanickam <LI><EM>ref: </EM>TOMS 35,3 (Oct 2008) Article: 22 <LI><EM>size: </EM>8888 kB </MENU> <LI><EM>file: </EM><A HREF="./888.zip">888.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Spherical Harmonic Transform Algorithms <LI><EM>by: </EM>J. B. Drake, P. Worley and E. {D'Azevedo} <LI><EM>ref: </EM>TOMS 35,3 (Oct 2008) Article: 23 <LI><EM>size: </EM>528 kB </MENU> <LI><EM>file: </EM><A HREF="./889.zip">889.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Jet_fitting_3:---A Generic {C++} Package for Estimating the Differential Properties on Sampled Surfaces via Polynomial Fitting <LI><EM>by: </EM>F. Cazals and M. Pouget <LI><EM>ref: </EM>TOMS 35,3 (Oct 2008) Article: 24 <LI><EM>size: </EM>3248 kB </MENU> <LI><EM>file: </EM><A HREF="./890.zip">890.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Sparco}: A Testing Framework for Sparse Reconstruction <LI><EM>by: </EM>E. {van den Berg}, M. P. Friedlander, G. Hennenfent, F. J. Herrmann, R. Saab and \"{O}. Yilmaz <LI><EM>ref: </EM>TOMS 35,4 (Feb 2009) Article: 29 <LI><EM>size: </EM>9120 kB </MENU> <LI><EM>file: </EM><A HREF="./891.zip">891.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A {Fortran} Virtual Memory System <LI><EM>by: </EM>J. K. Reid and J. A. Scott <LI><EM>ref: </EM>TOMS 36,1 (Mar 2009) Article: 5 <LI><EM>size: </EM>336 kB </MENU> <LI><EM>file: </EM><A HREF="./892.zip">892.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{DISPMODULE}, a {Fortran} 95 Module for Pretty-printing Matrices <LI><EM>by: </EM>K. Jonasson <LI><EM>ref: </EM>TOMS 36,1 (Mar 2009) Article: 6 <LI><EM>size: </EM>1192 kB </MENU> <LI><EM>file: </EM><A HREF="./893.zip">893.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{TSPACK}: Tension Spline Package for Curve Design and Data Fitting <LI><EM>by: </EM>R. J. Renka <LI><EM>ref: </EM>TOMS 36,1 (Mar 2009) Article: 7 <LI><EM>size: </EM>408 kB </MENU> <LI><EM>file: </EM><A HREF="./894.zip">894.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>On a Block {Schur--Parlett} Algorithm for $\varphi$-functions Based on the sep-inverse Estimate <LI><EM>by: </EM>S. Koikari <LI><EM>ref: </EM>TOMS 36,2 (Mar 2009) Article: 12 <LI><EM>size: </EM>2304 kB </MENU> <LI><EM>file: </EM><A HREF="./895.zip">895.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A continued fractions package for special functions <LI><EM>by: </EM>F. Backeljauw and A. Cuyt <LI><EM>ref: </EM>TOMS 36,3 (Jul 2009) Article: 15 <LI><EM>size: </EM>720 kB </MENU> <LI><EM>file: </EM><A HREF="./896.zip">896.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{LSA}: {Algorithms} for large-scale optimization <LI><EM>by: </EM>L. Luk{\v s}an, C. Matonoha and J. Vl{\v c}ek <LI><EM>ref: </EM>TOMS 36,3 (Jul 2009) Article: 16 <LI><EM>size: </EM>3240 kB </MENU> <LI><EM>file: </EM><A HREF="./897.zip">897.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{VTDIRECT95}: {Serial} and parallel codes for the global optimization algorithm direct <LI><EM>by: </EM>Jian He, L. T. Watson and M. Sosonkina <LI><EM>ref: </EM>TOMS 36,3 (Jul 2009) Article: 17 <LI><EM>size: </EM>648 kB </MENU> <LI><EM>file: </EM><A HREF="./898.zip">898.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Efficient Multiplication of Dense Matrices over $GF(2)$ <LI><EM>by: </EM>Martin Albrecht, Gregory Bard and William Hart <LI><EM>ref: </EM>TOMS 37,1 (Jan 2010) Article: 9 <LI><EM>size: </EM>2216 kB </MENU> <LI><EM>file: </EM><A HREF="./899.zip">899.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The Matlab Postprocessing Toolkit <LI><EM>by: </EM>Scott A. Sarra <LI><EM>ref: </EM>TOMS 37,1 (Jan 2010) Article: 10 <LI><EM>size: </EM>6072 kB </MENU> <LI><EM>file: </EM><A HREF="./900.zip">900.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Discrete Time Kalman Filter Package for Large Scale Problems <LI><EM>by: </EM>German A. Torres <LI><EM>ref: </EM>TOMS 37,1 (Jan 2010) Article: 11 <LI><EM>size: </EM>196672 kB </MENU> <LI><EM>file: </EM><A HREF="./901.zip">901.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{LMEF}: A Program for the Construction of Linear Multistep Methods with Exponential Fitting for the Numerical Solution of Ordinary Differential Equations <LI><EM>by: </EM>Dimitrios S. Vlachos and T. Simos <LI><EM>ref: </EM>TOMS 37,1 (Jan 2010) Article: 12 <LI><EM>size: </EM>344 kB </MENU> <LI><EM>file: </EM><A HREF="./902.zip">902.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{GPOPS}, {A} {MATLAB} Software for Solving Multiple-Phase Optimal Control Problems Using the {Gauss} Pseudospectral Method <LI><EM>by: </EM>Anil V. Rao, David A. Benson, Christopher Darby, Michael A. Patterson, Camila Francolin, Ilyssa Sanders and Geoffrey T. Huntington <LI><EM>ref: </EM>TOMS 37,2 (Apr 2010) Article: 22 <LI><EM>size: </EM>3696 kB </MENU> <LI><EM>file: </EM><A HREF="./903.zip">903.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{FRB}--{Fortran} routines for the exact computation of free rigid body motions <LI><EM>by: </EM>Elena Celledoni and Antonella Zanna <LI><EM>ref: </EM>TOMS 37,2 (Apr 2010) Article: 23 <LI><EM>size: </EM>3104 kB </MENU> <LI><EM>file: </EM><A HREF="./904.zip">904.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The {SCASY} Library -- Parallel Solvers for {Sylvester}-Type Matrix Equations with Applications in Condition Estimation, Part {II}. <LI><EM>by: </EM>Robert Granat and Bo K{\aa}gstr\"{o}m <LI><EM>ref: </EM>TOMS 37,3 (Sep 2010) Article: 33 <LI><EM>size: </EM>15416 kB </MENU> <LI><EM>file: </EM><A HREF="./905.zip">905.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SHEPPACK}: Modified {Shepard} Algorithm for Interpolation of Scattered Multivariate Data <LI><EM>by: </EM>William I. Thacker, Jingwei Zhang, Layne T. Watson, Jeffrey B. Birch, Manjula A. Iyer and Michael W. Berry <LI><EM>ref: </EM>TOMS 37,3 (Sep 2010) Article: 34 <LI><EM>size: </EM>2216 kB </MENU> <LI><EM>file: </EM><A HREF="./906.zip">906.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{elrint3d} : A Three-Dimensional Nonadaptive Automatic Cubature Routine Using a Sequence of Embedded Lattice Rules <LI><EM>by: </EM>Tiancheng Li and Ian Robinson <LI><EM>ref: </EM>TOMS 37,3 (Sep 2010) Article: 35 <LI><EM>size: </EM>688 kB </MENU> <LI><EM>file: </EM><A HREF="./907.zip">907.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{KLU}, A Direct Sparse Solver for Circuit Simulation Problems <LI><EM>by: </EM>Timothy A. Davis and Ekanathan {Palamadai Natarajan} <LI><EM>ref: </EM>TOMS 37,3 (Sep 2010) Article: 36 <LI><EM>size: </EM>3376 kB </MENU> <LI><EM>file: </EM><A HREF="./908.zip">908.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Online Exact Summation of Floating-Point Streams <LI><EM>by: </EM>Yong-Kang Zhu and Wayne B. Hayes <LI><EM>ref: </EM>TOMS 37,3 (Sep 2010) Article: 37 <LI><EM>size: </EM>40 kB </MENU> <LI><EM>file: </EM><A HREF="./909.zip">909.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{NOMAD}: Nonlinear Optimization with the {MADS} Algorithm <LI><EM>by: </EM>S\'ebastien {Le Digabel} <LI><EM>ref: </EM>TOMS 37,4 (Dec 2010) Article: 44 <LI><EM>size: </EM>6512 kB </MENU> <LI><EM>file: </EM><A HREF="./910.zip">910.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Portable {C++} Multiple Precision System for Special Function Calculations <LI><EM>by: </EM>Christopher Kormanyos <LI><EM>ref: </EM>TOMS 37,4 (Dec 2010) Article: 45 <LI><EM>size: </EM>33560 kB </MENU> <LI><EM>file: </EM><A HREF="./911.zip">911.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Multiple-Precision Exponential Integral and Related Functions <LI><EM>by: </EM>David M. Smith <LI><EM>ref: </EM>TOMS 37,4 (Dec 2010) Article: 46 <LI><EM>size: </EM>4712 kB </MENU> <LI><EM>file: </EM><A HREF="./912.zip">912.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Module for Calculating Cylindrical Functions of Complex Order and Complex Argument <LI><EM>by: </EM>Masao Kodama <LI><EM>ref: </EM>TOMS 37,4 (Dec 2010) Article: 47 <LI><EM>size: </EM>152 kB </MENU> <LI><EM>file: </EM><A HREF="./913.zip">913.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An Elegant {IDR(s)} Variant that Efficiently Exploits Bi-orthogonality Properties <LI><EM>by: </EM>Martin {van Gijzen} and Peter Sonneveld <LI><EM>ref: </EM>TOMS 38,1 (Nov 2011) Article: 5 <LI><EM>size: </EM>624 kB </MENU> <LI><EM>file: </EM><A HREF="./914.zip">914.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Parabolic Cylinder Function $W(a,x)$ and its Derivative <LI><EM>by: </EM>Amparo Gil, Javier Segura and Nico M. Temme <LI><EM>ref: </EM>TOMS 38,1 (Nov 2011) Article: 6 <LI><EM>size: </EM>192 kB </MENU> <LI><EM>file: </EM><A HREF="./915.zip">915.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SuiteSparseQR}: Multifrontal multithreaded rank-revealing sparse {QR} factorization <LI><EM>by: </EM>Timothy A. Davis <LI><EM>ref: </EM>TOMS 38,1 (Nov 2011) Article: 8 <LI><EM>size: </EM>12728 kB </MENU> <LI><EM>file: </EM><A HREF="./916.zip">916.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computing the Faddeyeva and Voigt Functions <LI><EM>by: </EM>Mofreh R. Zaghloul and Ahmed N. Ali <LI><EM>ref: </EM>TOMS 38,2 (Dec 2011) Article: 15 <LI><EM>size: </EM>32 kB </MENU> <LI><EM>file: </EM><A HREF="./917.zip">917.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Complex Double-Precision Evaluation of the Wright $\omega$ Function <LI><EM>by: </EM>Piers W. Lawrence, Robert M. Corless and David J. Jeffrey; <LI><EM>ref: </EM>TOMS 38,3 (Apr 2012) Article: 20 <LI><EM>size: </EM>180 kB </MENU> <LI><EM>file: </EM><A HREF="./918.zip">918.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A {MATLAB} program for the spectral dichotomy of regular matrix pencils <LI><EM>by: </EM>Miloud Sadkane and Ahmed Touhami <LI><EM>ref: </EM>TOMS 38,3 (Apr 2012) Article: 21 <LI><EM>size: </EM>296 kB </MENU> <LI><EM>file: </EM><A HREF="./919.zip">919.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A {Krylov} Subspace Algorithm for Evaluating the $\varphi$-Functions Appearing in Exponential Integrators <LI><EM>by: </EM>Jitse Niesen and Will M. Wright <LI><EM>ref: </EM>TOMS 38,3 (Apr 2012) Article: 22 <LI><EM>size: </EM>9352 kB </MENU> <LI><EM>file: </EM><A HREF="./920.zip">920.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems <LI><EM>by: </EM>Sunyoung Kim, Masakazu Kojima, Hayato Waki and Makato Yamashita <LI><EM>ref: </EM>TOMS 38,4 (Aug 2012) Article: 27 <LI><EM>size: </EM>7224 kB </MENU> <LI><EM>file: </EM><A HREF="./921.zip">921.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>alphaCertified: Certifying Solutions to Polynomial Systems <LI><EM>by: </EM>Jonathan D. Hauenstein and Frank Sottile <LI><EM>ref: </EM>TOMS 38,4 (Aug 2102) Article: 28 <LI><EM>size: </EM>28960 kB </MENU> <LI><EM>file: </EM><A HREF="./922.zip">922.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Mixed Finite Element Method for Helmholtz Transmission Eigenvalues <LI><EM>by: </EM>Xia Ji, Jiguang Sun and Tiara Turner <LI><EM>ref: </EM>TOMS 38,4 (Aug 2012) Article: 29 <LI><EM>size: </EM>184 kB </MENU> <LI><EM>file: </EM><A HREF="./923.zip">923.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Efficient Numerical Computation of the Pfaffian for Dense and Banded Skew-Symmetric Matrices <LI><EM>by: </EM>Michael Wimmer <LI><EM>ref: </EM>TOMS 38,4 (Aug 2012) Article: 30 <LI><EM>size: </EM>1928 kB </MENU> <LI><EM>file: </EM><A HREF="./924.zip">924.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>TIDES, a Taylor Series Integrator for Differential EquationS <LI><EM>by: </EM>Alberto Abad, Roberto Barrio, Fernando Blesa and Marcos Rodr铆guez <LI><EM>ref: </EM>TOMS 39,1 (Nov 2012) Article: 5 <LI><EM>size: </EM>1816 kB </MENU> <LI><EM>file: </EM><A HREF="./925.zip">925.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Parallel solver for semidefinite programming problem having sparse {Schur} complement matrix <LI><EM>by: </EM>Makoto Yamashita, Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata and Maho Nakata <LI><EM>ref: </EM>TOMS 39,1 (Nov 2012) Article: 6 <LI><EM>size: </EM>704 kB </MENU> <LI><EM>file: </EM><A HREF="./926.zip">926.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Incomplete gamma functions with negative arguments <LI><EM>by: </EM>Ian Thompson <LI><EM>ref: </EM>TOMS 39,2 (Feb 2013) Article: 14 <LI><EM>size: </EM>1336 kB </MENU> <LI><EM>file: </EM><A HREF="./927.zip">927.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The MATLAB Code bvptwp.m for the Numerical <LI><EM>by: </EM>Jeff Cash, Davy Hollevoet, Francesca Mazzia and Abdelhameed Nagy <LI><EM>ref: </EM>TOMS 39,2 (Feb 2013) Article: 15 <LI><EM>size: </EM>51264 kB </MENU> <LI><EM>file: </EM><A HREF="./928.zip">928.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A General, Parallel Implementation of {Dantzig--Wolfe} Decomposition <LI><EM>by: </EM>Joseph Rios <LI><EM>ref: </EM>TOMS 39,3 (May 2013) Article: 21 <LI><EM>size: </EM>7768 kB </MENU> <LI><EM>file: </EM><A HREF="./929.zip">929.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A suite on wavelet differentiation algorithms <LI><EM>by: </EM>Mani Mehra and Kavita Goyal <LI><EM>ref: </EM>TOMS 39,4 (Jul 2013) Article: 27 <LI><EM>size: </EM>816 kB </MENU> <LI><EM>file: </EM><A HREF="./930.zip">930.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>FACTORIZE: An object-oriented linear system solver for MATLAB <LI><EM>by: </EM>Timothy A. Davis <LI><EM>ref: </EM>TOMS 39,4 (Jul 2013) Article: 28 <LI><EM>size: </EM>65160 kB </MENU> <LI><EM>file: </EM><A HREF="./931.zip">931.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An algorithm and software for computing multiplicity structures at zeros of nonlinear systems <LI><EM>by: </EM>Wenrui Hao, Andrew J. Sommese and Zhonggang Zeng <LI><EM>ref: </EM>TOMS 40,1 (Oct 2013) Article: 5 <LI><EM>size: </EM>296 kB </MENU> <LI><EM>file: </EM><A HREF="./932.zip">932.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{PANG}: Software for Non-Matching Grid Projections in 2d and 3d with Linear Complexity <LI><EM>by: </EM>Martin J. Gander and Caroline Japhet <LI><EM>ref: </EM>TOMS 40,1 (Oct 2013) Article: 6 <LI><EM>size: </EM>264 kB </MENU> <LI><EM>file: </EM><A HREF="./933.zip">933.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Reliable Calculation of Numerical Rank, Null Space Bases, Pseudoinverse Solutions, and Basic Solutions using {SuiteSparseQR} <LI><EM>by: </EM>Leslie V. Foster and Timothy A. Davis <LI><EM>ref: </EM>TOMS 40,1 (Oct 2013) Article: 7 <LI><EM>size: </EM>24672 kB </MENU> <LI><EM>file: </EM><A HREF="./934.zip">934.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Fortran 90 subroutines to compute Mathieu functions for complex values of the parameter <LI><EM>by: </EM>Danilo Erricolo and Giuseppe Carluccio <LI><EM>ref: </EM>TOMS 40,1 (Oct 2013) Article: 8 <LI><EM>size: </EM>432 kB </MENU> <LI><EM>file: </EM><A HREF="./935.zip">935.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{IIPBF}, a {MATLAB} toolbox for infinite integral of products of two {Bessel} functions <LI><EM>by: </EM>J. Tilak Ratnanather, Jung H. Kim, Sirong Zhang, Anthony M. J. Davis and Stephen K. Lucas <LI><EM>ref: </EM>TOMS 40,2 (Feb 2014) Article: 14 <LI><EM>size: </EM>344 kB </MENU> <LI><EM>file: </EM><A HREF="./936.zip">936.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A {Fortran} Message Processor <LI><EM>by: </EM>Fred T. Krogh <LI><EM>ref: </EM>TOMS 40,2 (Feb 2014) Article: 15 <LI><EM>size: </EM>272 kB </MENU> <LI><EM>file: </EM><A HREF="./937.zip">937.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MINRES-QLP} for symmetric and {Hermitian} linear equations and least-squares problems <LI><EM>by: </EM>Sou-Cheng T. Choi and Michael A. Saunders <LI><EM>ref: </EM>TOMS 40,2 (Feb 2014) Article: 16 <LI><EM>size: </EM>11808 kB </MENU> <LI><EM>file: </EM><A HREF="./938.zip">938.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Compressing Circular Buffers <LI><EM>by: </EM>John C. Gunther <LI><EM>ref: </EM>TOMS 40,2 (Feb 2014) Article: 17 <LI><EM>size: </EM>712 kB </MENU> <LI><EM>file: </EM><A HREF="./939.zip">939.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computation of the {Marcum} {Q}-function <LI><EM>by: </EM>Amparo Gil, Javier Segura and Nico M. Temme <LI><EM>ref: </EM>TOMS 40,3 (Apr 2014) Article: 20 <LI><EM>size: </EM>232 kB </MENU> <LI><EM>file: </EM><A HREF="./940.zip">940.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Optimal Accumulator-Based Expression Evaluation Through the Use of Expression Templates <LI><EM>by: </EM>Blake Nelson, Robert M Kirby and Steven Parker <LI><EM>ref: </EM>TOMS 40,3 (Apr 2014) Article: 21 <LI><EM>size: </EM>162480 kB </MENU> <LI><EM>file: </EM><A HREF="./941.zip">941.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>\texttt{htucker}---A MATLAB toolbox for tensors in hierarchical {Tucker} format <LI><EM>by: </EM>Daniel Kressner and Christine Tobler <LI><EM>ref: </EM>TOMS 40,3 (Apr 2014) Article: 22 <LI><EM>size: </EM>7160 kB </MENU> <LI><EM>file: </EM><A HREF="./942.zip">942.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Semi-stencil <LI><EM>by: </EM>Ra\'{u}l {de la Cruz} and Mauricio Araya-Polo <LI><EM>ref: </EM>TOMS 40,3 (Apr 2014) Article: 23 <LI><EM>size: </EM>608 kB </MENU> <LI><EM>file: </EM><A HREF="./943.zip">943.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MSS}: {MATLAB} Software for {L-BFGS} Trust-Region Subproblems for Large-Scale Optimization <LI><EM>by: </EM>Jennifer B. Erway and Roummel F. Marcia <LI><EM>ref: </EM>TOMS 40,4 (Jun 2014) Article: 28 <LI><EM>size: </EM>80 kB </MENU> <LI><EM>file: </EM><A HREF="./944.zip">944.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Talbot Suite}: parallel implementations of {Talbot's} method for the numerical inversion of {Laplace} transforms <LI><EM>by: </EM>Laura Antonelli, Stefania Corsaro, Zelda Marino and Mariarosaria Rizzardi <LI><EM>ref: </EM>TOMS 40,4 (Jun 2014) Article: 29 <LI><EM>size: </EM>472 kB </MENU> <LI><EM>file: </EM><A HREF="./945.zip">945.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>\texttt{modred}: A Parallelized Model Reduction Library <LI><EM>by: </EM>Brandt A. Belson, Jonathan H. Tu and Clarence W. Rowley <LI><EM>ref: </EM>TOMS 40,4 (Jun 2014) Article: 30 <LI><EM>size: </EM>1048 kB </MENU> <LI><EM>file: </EM><A HREF="./946.zip">946.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{ReLIADiff}:A C++ Software Package For Real Laplace transform Inversion Based on Algorithmic Differentiation <LI><EM>by: </EM>Luisa D'Amore, Rosanna Campagna, Valeria Mele and Almerico Murli <LI><EM>ref: </EM>TOMS 40,4 (Jun 2014) Article: 31 <LI><EM>size: </EM>10136 kB </MENU> <LI><EM>file: </EM><A HREF="./947.zip">947.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Parallel Generation of Random Permutations with {MPI} <LI><EM>by: </EM>Daniel Langr, Pavel Tvrd\'{\i}k, Tom\'{a}\v{s} Dytrych and Jerry P. Draayer <LI><EM>ref: </EM>TOMS 41,1 (Oct 2014) Article: 5 <LI><EM>size: </EM>1112 kB </MENU> <LI><EM>file: </EM><A HREF="./948.zip">948.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{DAESA} -- A {Matlab} Tool for Structural Analysis of Differential-Algebraic Equations: Software <LI><EM>by: </EM>Nedialko S. Nedialkov, John D. Pryce and Guangning Tan <LI><EM>ref: </EM>TOMS 41,2 (Jan 2015) Article: 12 <LI><EM>size: </EM>2328 kB </MENU> <LI><EM>file: </EM><A HREF="./949.zip">949.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MATLAB} Tools for {HDG} in Three Dimensions <LI><EM>by: </EM>Zhixing Fu, Luis F. Gatica and Francisco-Javier Sayas <LI><EM>ref: </EM>TOMS 41,3 (Jun 2015) Article: 20 <LI><EM>size: </EM>8352 kB </MENU> <LI><EM>file: </EM><A HREF="./950.zip">950.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Ncpol2Sdpa} -- Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables <LI><EM>by: </EM>Peter Wittek <LI><EM>ref: </EM>TOMS 41,3 (Jun 2015) Article: 21 <LI><EM>size: </EM>400 kB </MENU> <LI><EM>file: </EM><A HREF="./951.zip">951.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Caylay} Analysis of Mechanism Configuration Spaces Using {CayMos}: Software Functionalities and Architecture <LI><EM>by: </EM>Menghan Wang and Meera Sitharam <LI><EM>ref: </EM>TOMS 41,4 (Oct 2015) Article: 27 <LI><EM>size: </EM>11832 kB </MENU> <LI><EM>file: </EM><A HREF="./952.zip">952.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{PHquintic}: A Library of Basic Functions for the Construction and Analysis of Planar Quintic {Pythagorean}-Hodograph Curves <LI><EM>by: </EM>Bohan Dong and Rida T. Farouki <LI><EM>ref: </EM>TOMS 41,4 (Oct 2015) Article: 28 <LI><EM>size: </EM>10344 kB </MENU> <LI><EM>file: </EM><A HREF="./953.zip">953.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Parallel Library Software for the Multishift {QR} Algorithm with Aggressive Early Deflation <LI><EM>by: </EM>Robert Granat, Bo K{\aa}gstr\"{o}m, Daniel Kressner and Meiyue Shao <LI><EM>ref: </EM>TOMS 41,4 (Oct 2015) Article: 29 <LI><EM>size: </EM>1696 kB </MENU> <LI><EM>file: </EM><A HREF="./954.zip">954.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An Accurate and Efficient Cubic and Quartic Equation Solver for Physical Applications <LI><EM>by: </EM>N. Flocke <LI><EM>ref: </EM>TOMS 41,4 (Oct 2015) Article: 30 <LI><EM>size: </EM>176 kB </MENU> <LI><EM>file: </EM><A HREF="./955.zip">955.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Approximation of the Inverse Poisson Cumulative Distribution Function <LI><EM>by: </EM>Michael B. Giles <LI><EM>ref: </EM>TOMS 42,1 (Feb 2016) Article: 7 <LI><EM>size: </EM>208 kB </MENU> <LI><EM>file: </EM><A HREF="./956.zip">956.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>PAMPAC, A Parallel Adaptive Method for Pseudo-Arclength Continuation <LI><EM>by: </EM>D. A. Aruliah, Lennaert Van Veen and Alex Dubitski <LI><EM>ref: </EM>TOMS 42,1 (Feb 2016) Article: 8 <LI><EM>size: </EM>920 kB </MENU> <LI><EM>file: </EM><A HREF="./957.zip">957.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Evaluation of the Repeated Integral of the Coerror Function by Half-Range Gauss-Hermite Quadrature <LI><EM>by: </EM>Walter Gautschi <LI><EM>ref: </EM>TOMS 42,1 (Feb 2016) Article: 9 <LI><EM>size: </EM>632 kB </MENU> <LI><EM>file: </EM><A HREF="./958.zip">958.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Lattice Builder: A General Software Tool for Constructing Rank-1 Lattice Rules <LI><EM>by: </EM>Pierre L'Ecuyer and David Munger <LI><EM>ref: </EM>TOMS 42,2 (Jun 2016) Article: 15 <LI><EM>size: </EM>75232 kB </MENU> <LI><EM>file: </EM><A HREF="./959.zip">959.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>VBF: A Library of C++ Classes for Vector Boolean Functions in Cryptography <LI><EM>by: </EM>Jos{\'e} Antonio \'{A}lvarez-Cubero and Pedro J. Zufiria <LI><EM>ref: </EM>TOMS 42,2 (Jun 2016) Article: 16 <LI><EM>size: </EM>39760 kB </MENU> <LI><EM>file: </EM><A HREF="./960.zip">960.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>POLYNOMIAL: An Object-Oriented Matlab Library of Fast and Efficient Algorithms for Polynomials <LI><EM>by: </EM>Jorge Delgado and Juan Manuel Pe\~{n}a <LI><EM>ref: </EM>TOMS 42,3 (Jun 2016) Article: 23 <LI><EM>size: </EM>624 kB </MENU> <LI><EM>file: </EM><A HREF="./961.zip">961.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Fortran 77 Subroutines for the Solution of Skew-Hamiltonian/Hamiltonian Eigenproblems <LI><EM>by: </EM>Peter Benner, Vasile Sima and Matthias Voigt <LI><EM>ref: </EM>TOMS 42,3 (Jun 2016) Article: 24 <LI><EM>size: </EM>2952 kB </MENU> <LI><EM>file: </EM><A HREF="./962.zip">962.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>BACOLI: B-spline Adaptive Collocation Software for PDEs with Interpolation-Based Spatial Error Control <LI><EM>by: </EM>Jack Pew, Zhi Li and Paul Muir <LI><EM>ref: </EM>TOMS 42,3 (Jun 2016) Article: 25 <LI><EM>size: </EM>992 kB </MENU> <LI><EM>file: </EM><A HREF="./963.zip">963.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Estimation of Stochastic Covariance Models Using a Continuum of Moment Conditions <LI><EM>by: </EM>Marcos Escobar, Benedikt Rudolph and Rudi Zagst <LI><EM>ref: </EM>TOMS 42,4 (Jul 2016) Article: 33 <LI><EM>size: </EM>1504 kB </MENU> <LI><EM>file: </EM><A HREF="./964.zip">964.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An Efficient Algorithm to Compute the Genus of Discrete Surfaces and Applications to Turbulent Flows <LI><EM>by: </EM>Adri\'{a}n Lozano-Dur\'{a}n and Guillem Borrell <LI><EM>ref: </EM>TOMS 42,4 (Jul 2016) Article: 34 <LI><EM>size: </EM>2264 kB </MENU> <LI><EM>file: </EM><A HREF="./965.zip">965.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{RIDC} Methods: A Family of Parallel Time Integrators <LI><EM>by: </EM>Benjamin W. Ong, Ronald D. Haynes and Kyle Ladd <LI><EM>ref: </EM>TOMS 43,1 (Aug 2016) Article: 8 <LI><EM>size: </EM>5888 kB </MENU> <LI><EM>file: </EM><A HREF="./966.zip">966.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Practical Iterative Algorithm for the Art Gallery Problem Using Integer Linear Programming <LI><EM>by: </EM>Davi C. Tozoni, Pedro J. de Rezende and Cid C. de Souza <LI><EM>ref: </EM>TOMS 43,2 (Sep 2016) Article: 16 <LI><EM>size: </EM>61248 kB </MENU> <LI><EM>file: </EM><A HREF="./967.zip">967.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Distributed-Memory Fast Multipole Method for Volume Potentials <LI><EM>by: </EM>Dhairya Malhotra and George Biros <LI><EM>ref: </EM>TOMS 43,2 (Sep 2016) Article: 17 <LI><EM>size: </EM>3432 kB </MENU> <LI><EM>file: </EM><A HREF="./968.zip">968.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>DISODE45: A Matlab Runge-Kutta Solver for Piecewise Smooth IVPs of Filippov Type <LI><EM>by: </EM>Manuel Calvo, Juan I. Montijano and Luis R\'{a}ndez <LI><EM>ref: </EM>TOMS 43,3 (Jan 2017) Article: 25 <LI><EM>size: </EM>808 kB </MENU> <LI><EM>file: </EM><A HREF="./969.zip">969.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computation of the Incomplete Gamma Function for Negative Values of the Argument <LI><EM>by: </EM>Amparo Gil, Diego Ruiz-Antol\'{\i}n, Javier Segura and Nico M. Temme <LI><EM>ref: </EM>TOMS 43,3 (Jan 2017) Article: 26 <LI><EM>size: </EM>144 kB </MENU> <LI><EM>file: </EM><A HREF="./970.zip">970.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm <LI><EM>by: </EM>Marek S\'{y}s, Zden\v{e}k \v{R}\'{\i}ha and Vashek Maty\'{a}\v{s} <LI><EM>ref: </EM>TOMS 43,3 (Jan 2017) Article: 27 <LI><EM>size: </EM>15568 kB </MENU> <LI><EM>file: </EM><A HREF="./971.zip">971.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An Implementation of a Randomized Algorithm for Principal Component Analysis <LI><EM>by: </EM>Huamin Li, George C. Linderman, Arthur Szlam, Kelly P. Stanton, Yuval Kluger and Mark Tygert <LI><EM>ref: </EM>TOMS 43,3 (Jan 2017) Article: 28 <LI><EM>size: </EM>208 kB </MENU> <LI><EM>file: </EM><A HREF="./972.zip">972.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>JMarkov: An Integrated Framework for Markov Chain Modeling <LI><EM>by: </EM>Juan F. P{\'e}rez, Daniel F. Silva, Julio C. G\'{o}ez, Andr{\'e}s Sarmiento, Andr{\'e}s Sarmiento-Romero, Raha Akhavan-Tabatabaei and Germ\'{a}n Ria\~{n}o <LI><EM>ref: </EM>TOMS 43,3 (Jan 2017) Article: 29 <LI><EM>size: </EM>26928 kB </MENU> <LI><EM>file: </EM><A HREF="./973.zip">973.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Extended Rational Fej\'{E}R Quadrature Rules Based on Chebyshev Orthogonal Rational Functions <LI><EM>by: </EM>Karl Deckers, Ahlem Mougaida and H{\'e}di} Belhadjsalah <LI><EM>ref: </EM>TOMS 43,4 (Mar 2017) Article: 37 <LI><EM>size: </EM>408 kB </MENU> <LI><EM>file: </EM><A HREF="./974.zip">974.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The OutlierLib\&Mdash;A MATLAB Library for Outliers' Detection <LI><EM>by: </EM>Alexander Novoselsky and Eugene Kagan <LI><EM>ref: </EM>TOMS 43,4 (Mar 2017) Article: 38 <LI><EM>size: </EM>256 kB </MENU> <LI><EM>file: </EM><A HREF="./975.zip">975.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{TMATROM}---A {T}-Matrix Reduced Order Model Software <LI><EM>by: </EM>M. Ganesh and S. C. Hawkins <LI><EM>ref: </EM>TOMS 44,1 (Jul 2017) Article: 9 <LI><EM>size: </EM>4504 kB </MENU> <LI><EM>file: </EM><A HREF="./976.zip">976.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Bertini_Real}: {Numerical} Decomposition of Real Algebraic Curves and Surfaces <LI><EM>by: </EM>Daniel A. Brake, Daniel J. Bates, Wenrui Hao, Jonathan D. Hauenstein, Andrew J. Sommese and Charles W. Wampler <LI><EM>ref: </EM>TOMS 44,1 (Jul 2017) Article: 10 <LI><EM>size: </EM>116488 kB </MENU> <LI><EM>file: </EM><A HREF="./977.zip">977.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{A QR}--Preconditioned {QR SVD} Method for Computing the {SVD} with High Accuracy <LI><EM>by: </EM>Zlatko Drma\v{c} <LI><EM>ref: </EM>TOMS 44,1 (Jul 2017) Article: 11 <LI><EM>size: </EM>13456 kB </MENU> <LI><EM>file: </EM><A HREF="./978.zip">978.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Safe Scaling in the {Level 1 BLAS} <LI><EM>by: </EM>Edward Anderson <LI><EM>ref: </EM>TOMS 44,1 (Jul 2017) Article: 12 <LI><EM>size: </EM>2464 kB </MENU> <LI><EM>file: </EM><A HREF="./979.zip">979.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Recursive} Algorithms for Dense Linear Algebra --- The {ReLAPACK} Collection <LI><EM>by: </EM>Elmar Peise and Paolo Bientinesi <LI><EM>ref: </EM>TOMS 44,2 (Oct 2017) Article: 16 <LI><EM>size: </EM>1112 kB </MENU> <LI><EM>file: </EM><A HREF="./980.zip">980.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Sparse {QR} Factorization on the {GPU} <LI><EM>by: </EM>Sencer Nuri Yeralan, Timothy A. Davis, Wissam M. Sid-Lakhdar and Sanjay Ranka <LI><EM>ref: </EM>TOMS 44,2 (Oct 2017) Article: 17 <LI><EM>size: </EM>34656 kB </MENU> <LI><EM>file: </EM><A HREF="./981.zip">981.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Talbot Suite DE}: Application of Modified {Talbot's} Method to Solve Differential Problems <LI><EM>by: </EM>Mariarosaria Rizzardi <LI><EM>ref: </EM>TOMS 44,2 (Oct 2017) Article: 18 <LI><EM>size: </EM>111896 kB </MENU> <LI><EM>file: </EM><A HREF="./982.zip">982.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Explicit Solutions of Triangular Systems of First-Order Linear Initial-Value Ordinary Differential Equations with Constant Coefficients <LI><EM>by: </EM>William Van Snyder <LI><EM>ref: </EM>TOMS 44,2 (Oct 2017) Article: 19 <LI><EM>size: </EM>872 kB </MENU> <LI><EM>file: </EM><A HREF="./983.zip">983.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Fast Computation of the Non-Asymptotic {Cochran's Q} Statistic for Heterogeneity Detection <LI><EM>by: </EM>Thierry Fahmy and Arnaud Bell{\'e}toile <LI><EM>ref: </EM>TOMS 44,2 (Oct 2017) Article: 20 <LI><EM>size: </EM>96 kB </MENU> <LI><EM>file: </EM><A HREF="./984.zip">984.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{ADiGator} a Toolbox for the Algorithmic Differentiation of Mathematical Functions in {MATLAB} Using Source Transformation via Operator Overloading <LI><EM>by: </EM>Matthew J. Weinstein and Anil V. Rao <LI><EM>ref: </EM>TOMS 44,2 (Oct 2017) Article: 21 <LI><EM>size: </EM>41128 kB </MENU> <LI><EM>file: </EM><A HREF="./985.zip">985.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Simple, Efficient, and Relatively Accurate Approximation for the Evaluation of the {Faddeyeva} Function <LI><EM>by: </EM>Mofreh R. Zaghloul <LI><EM>ref: </EM>TOMS 44,2 (Oct 2017) Article: 22 <LI><EM>size: </EM>176 kB </MENU> <LI><EM>file: </EM><A HREF="./986.zip">986.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Suite of Compact Finite Difference Schemes <LI><EM>by: </EM>Mani Mehra and Kuldip Singh Patel <LI><EM>ref: </EM>TOMS 44,2 (Oct 2017) Article: 23 <LI><EM>size: </EM>32 kB </MENU> <LI><EM>file: </EM><A HREF="./987.zip">987.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>MANBIS鈥擜 C++ Mathematical Software Package for Locating and Computing Efficiently Many Roots of a Function: Theoretical Issues <LI><EM>by: </EM>Dimitra-Nefeli A. Zottou, Dimitris J. Kavvadias, Frosso S. Makri and Michael N. Vrahatis <LI><EM>ref: </EM>TOMS 44,3 (Apr 2018) Article: 35 <LI><EM>size: </EM>33 kB </MENU> <LI><EM>file: </EM><A HREF="./988.zip">988.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{AMGKQ}: An Efficient Implementation of Adaptive Multivariate {Gauss}-{Kronrod} Quadrature for Simultaneous Integrands in {Octave}/{MATLAB} <LI><EM>by: </EM>Robert W. Johnson <LI><EM>ref: </EM>TOMS 44,3 (Apr 2018) Article: 36 <LI><EM>size: </EM>44 kB </MENU> <LI><EM>file: </EM><A HREF="./989.zip">989.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Perm\_Mateda}: A {Matlab} Toolbox of Estimation of Distribution Algorithms for Permutation-based Combinatorial Optimization Problems <LI><EM>by: </EM>Ekhine Irurozki, Josu Ceberio, Josean Santamaria, Roberto Santana and Alexander Mendiburu <LI><EM>ref: </EM>TOMS 44,4 (Aug 2018) Article: 47 <LI><EM>size: </EM>5099 kB </MENU> <LI><EM>file: </EM><A HREF="./990.zip">990.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Efficient Atlasing and Search of Configuration Spaces of Point-Sets Constrained by Distance Intervals <LI><EM>by: </EM>Aysegul Ozkan, Rahul Prabhu, Troy Baker, James Pence, Jorg Peters and Meera Sitharam <LI><EM>ref: </EM>TOMS 44,4 (Aug 2018) Article: 48 <LI><EM>size: </EM>7944 kB </MENU> <LI><EM>file: </EM><A HREF="./991.zip">991.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The {2D} Tree Sliding Window Discrete {Fourier} Transform <LI><EM>by: </EM>Lee F. Richardson and William F. Eddy <LI><EM>ref: </EM>TOMS 45,1 (Feb 2019) Article: 12 <LI><EM>size: </EM>267 kB </MENU> <LI><EM>file: </EM><A HREF="./992.zip">992.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An {OpenGL}- and {C++}-based Function Library for Curve and Surface Modeling in a Large Class of Extended {Chebyshev} Spaces <LI><EM>by: </EM>\'{A}goston {R\'{o}th} <LI><EM>ref: </EM>TOMS 45,1 (Feb 2019) Article: 13 <LI><EM>size: </EM>146768 kB </MENU> <LI><EM>file: </EM><A HREF="./993.zip">993.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Efficient Computation with {Kronecker} Products <LI><EM>by: </EM>Paul L. Fackler <LI><EM>ref: </EM>TOMS 45,2 (Jun 2019) Article: 22 <LI><EM>size: </EM>8 kB </MENU> <LI><EM>file: </EM><A HREF="./994.zip">994.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Fast Implementations of the {Brouwer-Zimmermann} Algorithm for the Computation of the Minimum Distance of a Random Linear Code <LI><EM>by: </EM>Fernando Hernando, Francisco D. Igual and Gregorio Quintana-Ort\'{\i} <LI><EM>ref: </EM>TOMS 45,2 (Jun 2019) Article: 23 <LI><EM>size: </EM>3173 kB </MENU> <LI><EM>file: </EM><A HREF="./995.zip">995.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An Efficient Parallel Anisotropic Delaunay Mesh Generator for Two-Dimensional Finite Element Analysis <LI><EM>by: </EM>Juliette Pardue and Andrey Chernikov <LI><EM>ref: </EM>TOMS 45,3 (Aug 2019) Article: 33 <LI><EM>size: </EM>28 kB </MENU> <LI><EM>file: </EM><A HREF="./996.zip">996.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{BBCPOP}: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems With Binary, Box, and Complementarity Constraints <LI><EM>by: </EM>Naoki Ito, Sunyong Kim, Masakazu Kojima, Akiko Takeda and Kim-Chuan Toh <LI><EM>ref: </EM>TOMS 45,3 (Aug 2019) Article: 34 <LI><EM>size: </EM>15211 kB </MENU> <LI><EM>file: </EM><A HREF="./997.zip">997.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{PySDC}---Prototyping Spectral Deferred Corrections <LI><EM>by: </EM>Robert Speck <LI><EM>ref: </EM>TOMS 45,3 (Aug 2019) Article: 35 <LI><EM>size: </EM>85346 kB </MENU> <LI><EM>file: </EM><A HREF="./998.zip">998.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The Robust {LMI} Parser---A Toolbox to Construct {LMI} Conditions for Uncertain Systems <LI><EM>by: </EM>Cristiano M. Agulhari, Alexandre Felipe, Ricardo C. L. F. Oliveira and Pedro L. D. Peres <LI><EM>ref: </EM>TOMS 45,3 (Aug 2019) Article: 36 <LI><EM>size: </EM>16622 kB </MENU> <LI><EM>file: </EM><A HREF="./999.zip">999.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computation of Multi-Degree B-Splines <LI><EM>by: </EM>Hendrik Speleers <LI><EM>ref: </EM>TOMS 45,4 (Dec 2019) Article: 43 <LI><EM>size: </EM>26 kB </MENU> <LI><EM>file: </EM><A HREF="./1000.zip">1000.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>SuiteSparse:GraphBLAS: Graph Algorithms in the Language of Sparse Linear Algebra <LI><EM>by: </EM>Timothy A. Davis <LI><EM>ref: </EM>TOMS 45,4 (Dec 2019) Article: 44 <LI><EM>size: </EM>23307 kB </MENU> <LI><EM>file: </EM><A HREF="./1001.zip">1001.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>IPscatt鈥擜 MATLAB Toolbox for the Inverse Medium Problem in Scattering <LI><EM>by: </EM>Florian B\"{u}rgel, Kamil S. Kazimierski and Armin Lechleiter <LI><EM>ref: </EM>TOMS 45,4 (Dec 2019) Article: 45 <LI><EM>size: </EM>41171 kB </MENU> <LI><EM>file: </EM><A HREF="./1002.zip">1002.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Graph Coloring Based Parallel Push-Relabel Algorithm for the Maximum Flow Problem <LI><EM>by: </EM>G\"{o}k\c{c}ehan Kara and Can \"{O}zturan <LI><EM>ref: </EM>TOMS 45,4 (Dec 2019) Article: 46 <LI><EM>size: </EM>19 kB </MENU> <LI><EM>file: </EM><A HREF="./1003.zip">1003.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Mongoose, a Graph Coarsening and Partitioning Library <LI><EM>by: </EM>Timothy A. Davis, William W. Hager, Scott P. Kolodziej and S. Nuri Yeralan <LI><EM>ref: </EM>TOMS 46,1 (Apr 2020) Article: 7 <LI><EM>size: </EM>730 kB </MENU> <LI><EM>file: </EM><A HREF="./1004.zip">1004.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>The {Iisignature} Library: Efficient Calculation of Iterated-Integral Signatures and Log Signatures <LI><EM>by: </EM>Jeremy F. Reizenstein and Benjamin Graham; <LI><EM>ref: </EM>TOMS 46,1 (Apr 2020) Article: 8 <LI><EM>size: </EM>8669 kB </MENU> <LI><EM>file: </EM><A HREF="./1005.zip">1005.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{Fortran} Subroutines for Reverse Mode Algorithmic Differentiation of {BLAS} Matrix Operations <LI><EM>by: </EM>Kristjan Jonasson, Sven Sigurdsson, Hordur Freyr Yngvason, Petur Orri Ragnarsson and Pall Melsted <LI><EM>ref: </EM>TOMS 46,1 (Apr 2020) Article: 9 <LI><EM>size: </EM>3483 kB </MENU> <LI><EM>file: </EM><A HREF="./1006.zip">1006.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Fast and Accurate Evaluation of a Generalized Incomplete Gamma Function <LI><EM>by: </EM>R\'{e}my Abergel and Lionel Moisan <LI><EM>ref: </EM>TOMS 46,1 (Apr 2020) Article: 10 <LI><EM>size: </EM>8 kB </MENU> <LI><EM>file: </EM><A HREF="./1007.zip">1007.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{QNSTOP}--{Quasi-Newton} Algorithm for Stochastic Optimization <LI><EM>by: </EM>Brandon D. Amos, David R. Easterling, Layne T. Watson, William I. Thacker, Brent S. Castle and Michael W. Trosset <LI><EM>ref: </EM>TOMS 46,2 (Jun 2020) Article: 17 <LI><EM>size: </EM>73 kB </MENU> <LI><EM>file: </EM><A HREF="./1008.zip">1008.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Multicomplex Number Class for {Matlab}, with a Focus on the Accurate Calculation of Small Imaginary Terms for Multicomplex Step Sensitivity Calculations <LI><EM>by: </EM>Jose Maria Varas Casado and Rob Hewson <LI><EM>ref: </EM>TOMS 46,2 (Jun 2020) Article: 18 <LI><EM>size: </EM>13 kB </MENU> <LI><EM>file: </EM><A HREF="./1009.zip">1009.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MieSolver}--An Object-Oriented {Mie} Series Software for Wave Scattering by Cylinders <LI><EM>by: </EM>Stuart C. Hawkins <LI><EM>ref: </EM>TOMS 46,2 (Jun 2020) Article: 19 <LI><EM>size: </EM>29 kB </MENU> <LI><EM>file: </EM><A HREF="./1010.zip">1010.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Boosting Efficiency in Solving Quartic Equations with No Compromise in Accuracy <LI><EM>by: </EM>Alberto Giacomo Orellana and Cristiano de Michele <LI><EM>ref: </EM>TOMS 46,2 (Jun 2020) Article: 20 <LI><EM>size: </EM>355 kB </MENU> <LI><EM>file: </EM><A HREF="./1011.zip">1011.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Improved Invariant Polytope Algorithm and Applications <LI><EM>by: </EM>Thomas Mejstrik <LI><EM>ref: </EM>TOMS 46,3 (Sep 2020) Article: 29 <LI><EM>size: </EM>20696 kB </MENU> <LI><EM>file: </EM><A HREF="./1012.zip">1012.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{DELAUNAYSPARSE}:Interpolation via a Sparse Subset of the Delaunay Triangulation in Medium to High Dimensions <LI><EM>by: </EM>Tyler H. Chang, Layne T. Watson, Thomas C. H. Lux, Ali R. Butt, Kirk W. Cameron and Yili Hong <LI><EM>ref: </EM>TOMS 46,4 (Nov 2020) Article: 38 <LI><EM>size: </EM>8 kB </MENU> <LI><EM>file: </EM><A HREF="./1013.zip">1013.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An R Implementation of a Continuous Spectral Algorithm for Simulating Vector Gaussian Random Fields in Euclidean Spaces <LI><EM>by: </EM>Daisy Arroyo and Xavier Emery <LI><EM>ref: </EM>TOMS 47,1 (Jan 2021) Article: 8 <LI><EM>size: </EM>7742 kB </MENU> <LI><EM>file: </EM><A HREF="./1014.zip">1014.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An Improved Algorithm for Hypot(x,y) <LI><EM>by: </EM>Carlos F. Borges <LI><EM>ref: </EM>TOMS 47,1 (Jan 2021) Article: 9 <LI><EM>size: </EM>3 kB </MENU> <LI><EM>file: </EM><A HREF="./1015.zip">1015.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Fast Scalable Solver for the Dense Linear (Sum) Assignment Problem <LI><EM>by: </EM>Stefan Guthe and Daniel Thuerck <LI><EM>ref: </EM>TOMS 47,2 (Apr 2021) Article: 18 <LI><EM>size: </EM>1004 kB </MENU> <LI><EM>file: </EM><A HREF="./1016.zip">1016.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{PyMGRIT}: A Python Package for the Parallel-in-time Method {MGRIT} <LI><EM>by: </EM>Jens Hahne, Stephanie Friedhoff and Matthias Bolten <LI><EM>ref: </EM>TOMS 47,2 (Apr 2021) Article: 19 <LI><EM>size: </EM>13249 kB </MENU> <LI><EM>file: </EM><A HREF="./1017.zip">1017.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{fuzzyreg}: An {R} Package for Fitting Fuzzy Regression Models <LI><EM>by: </EM>Pavel \v{S}krab\'{a}nek, Pavel and Nat\'{a}lia Mart\'{i}nkov\'{a} <LI><EM>ref: </EM>TOMS 47,3 (Jun 2021) Article: 29 <LI><EM>size: </EM>401 kB </MENU> <LI><EM>file: </EM><A HREF="./1018.zip">1018.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{FaVeST}---Fast Vector Spherical Harmonic Transforms <LI><EM>by: </EM>Quoc T. {Le Gia}, Ming Li and Yu Guang Wang <LI><EM>ref: </EM>TOMS 47,4 (Dec 2021) Article: 39 <LI><EM>size: </EM>44323 kB </MENU> <LI><EM>file: </EM><A HREF="./1019.zip">1019.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Task-based Multi-shift QR/QZ Algorithm with Aggressive Early Deflation <LI><EM>by: </EM>Mirko Myllykoski <LI><EM>ref: </EM>TOMS 48,1 (Mar 2022) Article: 11 <LI><EM>size: </EM>3896 kB </MENU> <LI><EM>file: </EM><A HREF="./1020.zip">1020.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Computation of Multi-Degree {Tchebycheffian} {B-Splines} <LI><EM>by: </EM>Hendrik Speleers <LI><EM>ref: </EM>TOMS 48,1 (Mar 2022) Article: 12 <LI><EM>size: </EM>21 kB </MENU> <LI><EM>file: </EM><A HREF="./1021.zip">1021.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization <LI><EM>by: </EM>Christopher Lourenco, Jinhao Chen, Erick Moreno-Centeno and Timothy A. Davis <LI><EM>ref: </EM>TOMS 48,2 (Jun 2022) Article: 20 <LI><EM>size: </EM>3356 kB </MENU> <LI><EM>file: </EM><A HREF="./1022.zip">1022.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Efficient Algorithms for Computing a Rank-Revealing UTV Factorization on Parallel Computing Architectures <LI><EM>by: </EM>N. Heavner, F.D. Igual, G. Quintana-Ort\'{\i} and P.G. Martinsson <LI><EM>ref: </EM>TOMS 48,2 (Jun 2022) Article: 21 <LI><EM>size: </EM>3240 kB </MENU> <LI><EM>file: </EM><A HREF="./1023.zip">1023.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Restoration of Function by Integrals with Cubic Integral Smoothing Spline in R <LI><EM>by: </EM>Yurly Korablev <LI><EM>ref: </EM>TOMS 48,2 (Jun 2022) Article: 22 <LI><EM>size: </EM>748 kB </MENU> <LI><EM>file: </EM><A HREF="./1024.zip">1024.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries <LI><EM>by: </EM>Bahman Kalantari and Yikal Zhang <LI><EM>ref: </EM>TOMS 48,2 (Jun 2022) Article: 23 <LI><EM>size: </EM>456 kB </MENU> <LI><EM>file: </EM><A HREF="./1025.zip">1025.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{PARyOpt:} A Software for Parallel Asynchronous Remote Bayesian Optimization <LI><EM>by: </EM>Balaji Sesha Sarath Pokuri, Alec Lofquist, Chad Risko and Baskar Ganapathysubramanian <LI><EM>ref: </EM>TOMS 48,2 (Jun 2022) Article: 24 <LI><EM>size: </EM>2848 kB </MENU> <LI><EM>file: </EM><A HREF="./1026.zip">1026.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Concurrent Alternating Least Squares for Multiple Simultaneous Canonical Polyadic Decompositions <LI><EM>by: </EM>Christos Psarras; Lars Karlsson; Rasmus Bro; Paolo Bientinesi; <LI><EM>ref: </EM>TOMS 48,3 (Sep 2022) Article: 34 <LI><EM>size: </EM>59496 kB </MENU> <LI><EM>file: </EM><A HREF="./1027.zip">1027.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{NOMAD} Version 4: Nonlinear Optimization with the {MADS} Algorithm <LI><EM>by: </EM>Charles Audet, {S\'{e}bastien} {Le Digabel}, Viviane Rochon Montplaisir and Christophe Tribes, <LI><EM>ref: </EM>TOMS 48,3 (Sep 2022) Article: 35 <LI><EM>size: </EM>9980 kB </MENU> <LI><EM>file: </EM><A HREF="./1028.zip">1028.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{VTMOP}: Solver for Blackbox Multiobjective Optimization Problems <LI><EM>by: </EM>Tyler H. Chang, Layne T. Watson, Jeffrey Larson, Nicole Neveu, William I. Thacker, Shubhangi Deshpande and Thomas C. H. Lux <LI><EM>ref: </EM>TOMS 48,3 (Sep 2022) Article: 36 <LI><EM>size: </EM>1360 kB </MENU> <LI><EM>file: </EM><A HREF="./1029.zip">1029.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Encapsulated Error, a Direct Approach to Evaluate Floating-Point Accuracy <LI><EM>by: </EM>Nestor Demeure, C\'{e}dric Chevalier, Christophe Denis and Pierre Dossantos-Uzarralde <LI><EM>ref: </EM>TOMS 48,4 (Dec 2022) Article: 47 <LI><EM>size: </EM>3308 kB </MENU> <LI><EM>file: </EM><A HREF="./1030.zip">1030.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SC-SR1}: {MATLAB} Software for Limited-Memory {SR1} Trust-Region Method <LI><EM>by: </EM>Johannes Brust, Oleg Burdakov, Jennifer Erway and Roummel Marcia; <LI><EM>ref: </EM>TOMS 48,4 (Dec 2002) Article: 48 <LI><EM>size: </EM>4560 kB </MENU> <LI><EM>file: </EM><A HREF="./1031.zip">1031.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{MQSI}---Monotone Quintic Spline Interpolation <LI><EM>by: </EM>Thomas Lux, Layne T. Watson, Tyler Chang and William Thacker <LI><EM>ref: </EM>TOMS 49,1 (Mar 2023) Article: 6 <LI><EM>size: </EM>308 kB </MENU> <LI><EM>file: </EM><A HREF="./1032.zip">1032.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Bi-cubic Splines for Polyhedral Control Nets <LI><EM>by: </EM>J\"org Peters, Kyle Lo and K\c{e}stutis Kar\v{c}iauskas <LI><EM>ref: </EM>TOMS 49,1 (Mar 2023) Article: 7 <LI><EM>size: </EM>9780 kB </MENU> <LI><EM>file: </EM><A HREF="./1033.zip">1033.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>by: </EM>Gregorio Quintana-Ort\'i, Fernando Hernando and Francisco D. Igual <LI><EM>ref: </EM>TOMS 49,1 (Mar 2023) Article: 8 <LI><EM>title: </EM>Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Distributed-memory Architectures <LI><EM>size: </EM>4476 kB </MENU> <LI><EM>file: </EM><A HREF="./1034.zip">1034.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An Accelerated Algorithm to Compute the $Q_n$ Robust Statistic, with Corrections to Constants <LI><EM>by: </EM>Thierry Fahmy <LI><EM>ref: </EM>TOMS 49,1 (Mar 2023) Article: 9 <LI><EM>size: </EM>84 kB </MENU> <LI><EM>file: </EM><A HREF="./1035.zip">1035.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Gradient-based Implementation of the Polyhedral Active Set Algorithm <LI><EM>by: </EM>William W. Hager and Hongchao Zhang <LI><EM>ref: </EM>TOMS 49,2 (Jun 2023) Article: 20 <LI><EM>size: </EM>23876 kB </MENU> <LI><EM>file: </EM><A HREF="./1036.zip">1036.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{ATC}, An Advanced {Tucker} Compression Library for Multidimensional Data <LI><EM>by: </EM>Wouter Baert and Nick Vannieuwenhoven <LI><EM>ref: </EM>TOMS 49,2 (Jun 2023) Article: 21 <LI><EM>size: </EM>18164 kB </MENU> <LI><EM>file: </EM><A HREF="./1037.zip">1037.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{SuiteSparse}: {GraphBLAS}: Parallel Graph Algorithms in the Language of Sparse Linear Algebra <LI><EM>by: </EM>Timothy A. Davis <LI><EM>ref: </EM>TOMS 49,3 (Sep 2023) Article: 28 <LI><EM>size: </EM>77468 kB </MENU> <LI><EM>file: </EM><A HREF="./1038.zip">1038.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{KCC}: {A} {MATLAB} Package for $k$-Means-based Consensus Clustering <LI><EM>by: </EM>Hao Lin, Hongfu Liu, Junjie Wu, Hong Li and Stephan G{\"u}nnemann <LI><EM>ref: </EM>TOMS 49,4 (Dec 2023) Article: 40 <LI><EM>size: </EM>35864 kB </MENU> <LI><EM>file: </EM><A HREF="./1039.zip">1039.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Automatic Generators for a Family of Matrix Multiplication Routines with {Apache} {TVM} <LI><EM>by: </EM>Guillermo Alaejos, Adri\'{a}n Castell\'{o}, Pedro Alonso-Jord\'{a}, Francisco D. Igual, H\'{e}ctor Mart\'{\i}nez and Enrique S. Quintana-Ort\'{\i} <LI><EM>ref: </EM>TOMS 50,1 (Mar 2024) Article: 6 <LI><EM>size: </EM>524 kB </MENU> <LI><EM>file: </EM><A HREF="./1040.zip">1040.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{The} {Sparse} {Grids} {Matlab} {Kit} - a {Matlab} implementation of sparse grids for high-dimensional function approximation and uncertainty quantification <LI><EM>by: </EM>Chiara Piazzola and Lorenzo Tamellini <LI><EM>ref: </EM>TOMS 50,1 (Mar 2024) Article: 7 <LI><EM>size: </EM>7364 kB </MENU> <LI><EM>file: </EM><A HREF="./1041.zip">1041.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{HiPPIS}---A High-order Positivity-preserving Mapping Software for Structured Meshes <LI><EM>by: </EM>Timbwoga A. J. Ouermi, Robert M. Kirby and Martin Berzins <LI><EM>ref: </EM>TOMS 50,1 (Mar 2024) Article: 8 <LI><EM>size: </EM>708 kB </MENU> <LI><EM>file: </EM><A HREF="./1042.zip">1042.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Sparse Precision Matrix Estimation with {SQUIC} <LI><EM>by: </EM>Aryan Eftekhari, Lisa Gaedke-Merzh\"{a}user, Dimosthenis Pasadakis, Matthias Bollh\"{o}fer,Simon Scheidegger and Olaf Schenk <LI><EM>ref: </EM>TOMS 50,2 (Jun 2024) Article: 13 <LI><EM>size: </EM>1.5 Mb </MENU> <LI><EM>file: </EM><A HREF="./1043.zip">1043.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>Faster Randomized {SVD} with Dynamic Shifts <LI><EM>by: </EM>Xu Feng, Wenjian Yu, Yuyang Xies and Jie Tang <LI><EM>ref: </EM>TOMS 50,2 (Jun 2024) Article: 14 <LI><EM>size: </EM>23 MB </MENU> <LI><EM>file: </EM><A HREF="./1044.zip">1044.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{PyGenStability}, a Multiscale Community Detection Framework with Generalized Markov Stability <LI><EM>by: </EM>Alexis Arnaudon, Dominik J. Schindler, Robert L. Peach, Adam Gosztolai, Maxwell Hodges, Michael T. Schaub and Mauricio Barahona <LI><EM>ref: </EM>TOMS 50,2 (Jun 2024) Article: 15 <LI><EM>size: </EM>7.9 MB </MENU> <LI><EM>file: </EM><A HREF="./1045.zip">1045.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A Covariate-Dependent Approach to {Gaussian} Graphical Modeling in {R} <LI><EM>by: </EM>Jacob Helwig, Sutanoy Dasgupta, Peng Zhao, Bani K. Mallick and Debdeep Pati <LI><EM>ref: </EM>TOMS 50,2 (Jun 2024) Article: 16 <LI><EM>size: </EM>1.1 MB </MENU> <LI><EM>file: </EM><A HREF="./1046.zip">1046.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>An Improved Recurrence Method for the Scaled Complex Error Function <LI><EM>by: </EM>Ian Thompson <LI><EM>ref: </EM>TOMS 50,3 (Sep 2024) Article: 20 <LI><EM>size: </EM>44 MB </MENU> <LI><EM>file: </EM><A HREF="./1047.zip">1047.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>{FdeSolver}, a {Julia} Package for Solving Fractional Differential Equations <LI><EM>by: </EM>Moein Khalighi, Giulio Benedetti and Leo Lahti <LI><EM>ref: </EM>TOMS 50,3 (Sep 2024) Article: 22 <LI><EM>size: </EM>13 MB </MENU> <LI><EM>file: </EM><A HREF="./1048.zip">1048.zip</A><spacer type=horizontal size=12><MENU> <LI><EM>title: </EM>A C++ Class for Robust Linear Barycentric Rational Interpolation <LI><EM>by: </EM>Chiara Fuda and Kai Hormann <LI><EM>ref: </EM>TOMS 50,3 (Sep 2024) Article: 23 <LI><EM>size: </EM>658 KB </MENU> </BODY></HTML>

Pages: 1 2 3 4 5 6 7 8 9 10