%%% ====================================================================
%%% BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "2.20",
%%%     date            = "31 August 1996",
%%%     time            = "16:38:10 MDT",
%%%     filename        = "toms.bib",
%%%     address         = "Center for Scientific Computing
%%%                        Department of Mathematics
%%%                        University of Utah
%%%                        Salt Lake City, UT 84112
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "00081 19863 82247 768134",
%%%     email           = "beebe at math.utah.edu (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography, mathematical software, TOMS",
%%%     supported       = "yes",
%%%     docstring       = "This is a BibTeX bibliography for ACM
%%%                        Transactions on Mathematical Software
%%%                        (TOMS), completely covering all issues from
%%%                        March 1975 -- March 1996.  All papers,
%%%                        including editorials, policy statements,
%%%                        remarks, and corrigenda are included.
%%%
%%%                        At version 2.20, the complete year coverage
%%%                        looks like this:
%%%
%%%                             1960 (  1)     1973 (  2)     1986 ( 34)
%%%                             1961 (  1)     1974 (  7)     1987 ( 29)
%%%                             1962 (  1)     1975 ( 38)     1988 ( 39)
%%%                             1963 (  2)     1976 ( 49)     1989 ( 32)
%%%                             1964 (  2)     1977 ( 46)     1990 ( 33)
%%%                             1965 (  1)     1978 ( 43)     1991 ( 41)
%%%                             1966 (  1)     1979 ( 54)     1992 ( 36)
%%%                             1967 (  1)     1980 ( 57)     1993 ( 37)
%%%                             1968 (  1)     1981 ( 47)     1994 ( 38)
%%%                             1969 (  1)     1982 ( 34)     1995 ( 31)
%%%                             1970 (  2)     1983 ( 43)     1996 ( 22)
%%%                             1971 (  1)     1984 ( 46)
%%%                             1972 (  4)     1985 ( 40)
%%%
%%%                             Article:        897
%%%
%%%                             Total entries:  897
%%%
%%%                        Abstracts, Keywords, Categories and Subject
%%%                        Descriptors are available for some issues.
%%%                        Eventually, this coverage should be
%%%                        extended to the entire collection, in the
%%%                        interests of enhancing search capabilities.
%%%
%%%                        This bibliography includes ACM Algorithms
%%%                        493 -- 735 (or the latest), including
%%%                        Algorithm 568, published in ACM
%%%                        Transactions on Programming Languages and
%%%                        Systems (TOPLAS).  For ACM Algorithms 1 --
%%%                        492, see the companion bibliography,
%%%                        cacm.bib.
%%%
%%%                        All published Remarks and Corrigenda are
%%%                        cross-referenced in both directions, so
%%%                        that citing a paper will automatically
%%%                        generate citations for those Remarks and
%%%                        Corrigenda.  There is one important paper,
%%%                        on multiple-precision integer division,
%%%                        included from the journal Software ---
%%%                        Practice and Experience because it is
%%%                        cross-referenced to a TOMS paper.
%%%
%%%                        Algorithms published in Communications of
%%%                        the ACM, prior to the founding of TOMS in
%%%                        1975, are also included in this
%%%                        bibliography, if a TOMS paper contains
%%%                        Remarks or Corrigenda for them.
%%%
%%%                        Source code for ACM Algorithms from 380
%%%                        onwards, with some omissions, is available
%%%                        via netlib, and via anonymous ftp to
%%%                        netlib.att.com in /netlib/toms.
%%%
%%%                        The initial draft of entries for 1981 --
%%%                        1990 was extracted from the ACM Computing
%%%                        Archive CD ROM for the 1980s, with manual
%%%                        corrections and additions from
%%%                        bibliographies in the TeX User Group
%%%                        collection, the author's personal
%%%                        bibliography files, Aake Bjoerck's
%%%                        math.liu.se:/pub/references/habook.bib,
%%%                        G. W. Stewart's
%%%                        thales.cs.umd.edu:/pub/references/ref.bib,
%%%                        John R. Rice and Richard J. Hanson's
%%%                        Algorithm 620 (available as a BibTeX file
%%%                        via netlib, with additions up to Algorithm
%%%                        678), and a very large computer science
%%%                        bibliography collection on ftp.ira.uka.de
%%%                        in /pub/bibliography to which many people
%%%                        of have contributed.  The snapshot of this
%%%                        collection was taken on 5-May-1994, and it
%%%                        consists of 441 BibTeX files, 2,672,675
%%%                        lines, 205,289 entries, and 6,375
%%%                        <at>String{} abbreviations, occupying
%%%                        94.8MB of disk space.  Where multiple
%%%                        sources of a particular entry existed,
%%%                        field values have been manually merged to
%%%                        preserve maximal information.
%%%
%%%                        Numerous errors in the sources noted above
%%%                        have been corrected.   Spelling has been
%%%                        verified with the UNIX spell and GNU ispell
%%%                        programs using the exception dictionary
%%%                        stored in the companion file with extension
%%%                        .sok.
%%%                        Numerous heuristic checks on the validity
%%%                        of the TOMS bibliography files have also
%%%                        been made using software developed by the
%%%                        author for maintenance of the TeX Users
%%%                        Group and BibNet bibliography collections.
%%%
%%%                        Every entry from March 1975 -- June 1994
%%%                        has been compared directly with the article
%%%                        cover pages in the original journal issues
%%%                        to ensure correctness.  Several errors were
%%%                        uncovered this way in earlier sources of
%%%                        BibTeX entries and citation data.
%%%
%%%                        Considerable effort has been expended to
%%%                        ensure accuracy of this bibliography,
%%%                        because it is expected to be widely used
%%%                        and distributed.  Capitalization of
%%%                        original titles, and use of initials or
%%%                        full names in author lists, should match
%%%                        the journal exactly, with two exceptions.
%%%                        (1) Algorithms have been sometimes entitled
%%%                        ``ALGORITHM xyz...'', and sometimes
%%%                        ``Algorithm xyz...''.  The latter usage has
%%%                        been adhered to throughout.  (2) Remarks
%%%                        and Corrigenda in the journal occasionally
%%%                        fail to cite the full title of the original
%%%                        paper; that has been rectified in the
%%%                        interests of clarity and consistency.
%%%
%%%                        The ACM maintains Web pages with journal
%%%                        tables of contents for 1985--1995 at
%%%                        http://www.acm.org/pubs/toc.  That data has
%%%                        been automatically converted to BibTeX
%%%                        form, corrected for spelling and page
%%%                        number errors, and merged into this file.
%%%
%%%                        ACM copyrights explicitly permit abstracting
%%%                        with credit, so article abstracts, keywords,
%%%                        and subject classifications have been
%%%                        included in this bibliography wherever
%%%                        available.  Article reviews have been
%%%                        omitted, until their copyright status has
%%%                        been clarified.
%%%
%%%                        bibsource keys in the bibliography entries
%%%                        below indicate the entry originally came
%%%                        from the computer science bibliography
%%%                        archive, even though it has likely since
%%%                        been corrected and updated.
%%%
%%%                        URL keys in the bibliography point to
%%%                        World Wide Web locations of additional
%%%                        information about the entry.
%%%
%%%                        BibTeX citation tags are uniformly chosen
%%%                        as name:year:abbrev, where name is the
%%%                        family name of the first author or editor,
%%%                        year is a 4-digit number, and abbrev is a
%%%                        3-letter condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed by the
%%%                        author for the BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted
%%%                        by journal, and then by publication order,
%%%                        with the help of ``bibsort -byvolume''.  The
%%%                        bibsort utility is available from
%%%                        ftp.math.utah.edu in /pub/tex/bib.
%%%
%%%                        The author will be grateful for reports of
%%%                        errors of any kind in this bibliography.
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility."
%%%     }
%%% ====================================================================

@Preamble{"\input bibnames.sty" #
   "\hyphenation{
                 Cher-kas-sky
                 Cue-vas
                 Ka-chit-vich-yan-u-kul
                 Rich-ard
                 Za-bo-row-ski
   }"
}

%=======================================================================
% Acknowledgement abbreviations:

@String{ack-nhfb =  "Nelson H. F. Beebe,
                    Center for Scientific Computing,
                    Department of Mathematics,
                    University of Utah,
                    Salt Lake City, UT 84112, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

@String{ack-nj =     "Norbert Juffa,
                  2445 Mission College Blvd.
                  Santa Clara, CA 95054
                  USA
                  email: \path=norbert@iit.com="}

@String{ack-rfb = "Ronald F. Boisvert,
                  Applied and Computational Mathematics Division,
                  National Institute of Standards and Technology,
                  Gaithersburg, MD 20899, USA,
                  Tel: +1 301 975 3812,
                  e-mail: \path=boisvert@cam.nist.gov="}

%=======================================================================
% Journal abbreviations:

@String{j-CACM                  = "Communications of the ACM"}

@String{j-SPE                   = "Soft{\-}ware\emdash Prac{\-}tice
                                  and Experience"}

@String{j-TOMS                  = "ACM Transactions on Mathematical Software"}

@String{j-TOPLAS                = "ACM Transactions on Programming
                                  Languages and Systems"}

%=======================================================================
% Bibliography entries from Communications of the ACM.

@Article{Ellenberger:1960:NSP,
  author =       "K. W. Ellenberger",
  title =        "{ACM} Algorithm 30: Numerical Solution of the
                 Polynomial Equation",
  journal =      j-CACM,
  volume =       "3",
  number =       "12",
  pages =        "643--??",
  month =        dec,
  year =         "1960",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:45 1994",
  note =         "See also \cite{Novotny:1985:RNS}.",
}

@Article{Herndon:1961:SNF,
  author =       "J. R. Herndon",
  title =        "{ACM} Algorithm 49: Spherical {Neumann} Function",
  journal =      j-CACM,
  volume =       "4",
  number =       "4",
  pages =        "179",
  month =        apr,
  year =         "1961",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:50 1994",
  note =         "See also \cite{Coleman:1978:RSN}.",
}

@Article{Merner:1962:CEI,
  author =       "J. N. Merner",
  title =        "{ACM} Algorithm 149: Complete Elliptic Integral",
  journal =      j-CACM,
  volume =       "5",
  number =       "12",
  pages =        "605",
  month =        dec,
  year =         "1962",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:50 1994",
  note =         "See also \cite{Skovgaard:1978:RCE}.",
}

@Article{Ludwig:1963:IBR,
  author =       "O. G. Ludwig",
  title =        "{ACM} Algorithm 179: Incomplete Beta Ratio",
  journal =      j-CACM,
  volume =       "6",
  number =       "6",
  pages =        "314",
  month =        jun,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:50 1994",
  note =         "See also \cite{Pike:1976:RIB}.",
}

@Article{Kase:1963:TOP,
  author =       "R. H. Kase",
  title =        "{ACM} Algorithm 219: Topological Ordering for {Pert}
                 Networks",
  journal =      j-CACM,
  volume =       "6",
  number =       "12",
  pages =        "738--739",
  month =        dec,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:51 1994",
  note =         "See also \cite{Tenney:1977:RTO}.",
}

@Article{Gautschi:1964:BFF,
  author =       "W. Gautschi",
  title =        "{ACM} Algorithm 236: {Bessel} Functions of the First
                 Kind",
  journal =      j-CACM,
  volume =       "7",
  number =       "8",
  pages =        "479--480",
  month =        aug,
  year =         "1964",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Skovgaard:1975:RBF}.",
}

@Article{Boothroyd:1964:G,
  author =       "J. Boothroyd",
  title =        "{ACM} Algorithm 246: {Graycode}",
  journal =      j-CACM,
  volume =       "7",
  number =       "12",
  pages =        "701",
  month =        dec,
  year =         "1964",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Sat Sep 10 09:12:22 1994",
  note =         "See also \cite{Misra:1975:RG,Er:1985:RG}.",
}

@Article{Gautschi:1965:LFA,
  author =       "W. Gautschi",
  title =        "{ACM} Algorithm 259: {Legendre} Functions for
                 Arguments Larger than One",
  journal =      j-CACM,
  volume =       "8",
  number =       "8",
  pages =        "488--492",
  month =        aug,
  year =         "1965",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Jansen:1977:RLF}.",
}

@Article{Fletcher:1966:ITB,
  author =       "W. Fletcher",
  title =        "{ACM} Algorithm 284: Interchange of Two Blocks of
                 Data",
  journal =      j-CACM,
  volume =       "9",
  number =       "5",
  pages =        "326",
  month =        may,
  year =         "1966",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Ito:1976:RIT}.",
}

@Article{Hill:1967:CSI,
  author =       "I. D. Hill and M. C. Pike",
  title =        "{ACM} Algorithm 299: Chi-Squared Integral",
  journal =      j-CACM,
  volume =       "10",
  number =       "4",
  pages =        "243--244",
  month =        apr,
  year =         "1967",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Lozy:1976:RCS,Hill:1985:RCS}.",
}

@Article{Bell:1968:NRD,
  author =       "J. R. Bell",
  title =        "{ACM} Algorithm 334: Normal Random Deviates",
  journal =      j-CACM,
  volume =       "11",
  number =       "7",
  pages =        "498",
  month =        jul,
  year =         "1968",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Tracht:1982:RNR}.",
  acknowledgement = ack-nhfb,
}

@Article{Morris:1969:TP,
  author =       "J. Morris",
  title =        "{ACM} Algorithm 346: ${F}$-Test Probabilities",
  journal =      j-CACM,
  volume =       "12",
  number =       "3",
  pages =        "184--185",
  month =        mar,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Cormack:1988:RTP}.",
}

@Article{Hill:1970:SD,
  author =       "G. W. Hill",
  title =        "{ACM} Algorithm 395: {Student}'s $t$-Distribution",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "617--619",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Lozy:1979:RSD,Hill:1981:RSD}.",
}

@Article{Hill:1970:SQ,
  author =       "G. W. Hill",
  title =        "{ACM} Algorithm 396: {Student}'s $t$-Quantiles",
  journal =      j-CACM,
  volume =       "13",
  number =       "10",
  pages =        "619--620",
  month =        oct,
  year =         "1970",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Hill:1981:RSQ}.",
  acknowledgement = ack-nhfb,
}

@Article{McNamee:1971:SMP,
  author =       "J. M. McNamee",
  title =        "{ACM} Algorithm 408: {A} Sparse Matrix Package (Part
                 {I})",
  journal =      j-CACM,
  volume =       "14",
  number =       "4",
  pages =        "265--273",
  month =        apr,
  year =         "1971",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also
                 \cite{Sipala:1977:RSM,Gustavson:1978:RSM,Harms:1980:RSM}.",
}

@Article{Gentleman:1972:CCQ,
  author =       "W. M. Gentleman",
  title =        "{ACM} Algorithm 424: {Clenshaw-Curtis} Quadrature",
  journal =      j-CACM,
  volume =       "15",
  number =       "5",
  pages =        "353--355",
  month =        may,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:54 1994",
  note =         "See also \cite{Geddes:1979:RCC}.",
}

@Article{Akima:1972:ISC,
  author =       "H. Akima",
  title =        "{ACM} Algorithm 433: Interpolation and Smooth Curve
                 Fitting Based on Local Procedures",
  journal =      j-CACM,
  volume =       "15",
  number =       "10",
  pages =        "914--918",
  month =        oct,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:55 1994",
  note =         "See also \cite{Anderson:1976:RIS}.",
}

@Article{March:1972:EPT,
  author =       "D. L. March",
  title =        "{ACM} Algorithm 434: Exact Probabilities for
                 ${R\times{C}}$ Contingency Tables",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "991--992",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Fri Sep 09 14:13:19 1994",
  note =         "See also \cite{Boulton:1976:REP}.",
}

@Article{Fullerton:1972:MIG,
  author =       "W. Fullerton",
  title =        "{ACM} Algorithm 435: Modified Incomplete Gamma
                 Function",
  journal =      j-CACM,
  volume =       "15",
  number =       "11",
  pages =        "993--995",
  month =        nov,
  year =         "1972",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:55 1994",
  note =         "See also \cite{Schoene:1978:RMI}.",
}

@Article{MacHura:1973:RFM,
  author =       "M. MacHura and A. Mulawa",
  title =        "{ACM} Algorithm 450: {Rosenbrock} Function
                 Minimization",
  journal =      j-CACM,
  volume =       "16",
  number =       "8",
  pages =        "482--483",
  month =        aug,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:55 1994",
  note =         "See also \cite{Davies:1976:RRF}.",
}

@Article{Brenner:1973:MTP,
  author =       "N. Brenner",
  title =        "{ACM} Algorithm 467: Matrix Transposition in Place",
  journal =      j-CACM,
  volume =       "16",
  number =       "11",
  pages =        "692--694",
  month =        nov,
  year =         "1973",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:55 1994",
  note =         "See also \cite{Leathers:1979:RAS}.",
}

@Article{Akima:1974:BIS,
  author =       "H. Akima",
  title =        "{ACM} Algorithm 474: Bivariate Interpolation and
                 Smooth Surface Fitting Based on Local Procedures",
  journal =      j-CACM,
  volume =       "17",
  number =       "1",
  pages =        "26--31",
  month =        jan,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:56 1994",
  note =         "See also \cite{Anderson:1979:RBI}.",
}

@Article{Loeser:1974:SPT,
  author =       "R. Loeser",
  title =        "Some Performance Tests of `Quicksort' and
                 Descendants",
  journal =      j-CACM,
  volume =       "17",
  number =       "3",
  pages =        "143--152",
  month =        mar,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:56 1994",
}

@Article{Wright:1974:VSP,
  author =       "T. Wright",
  title =        "{ACM} Algorithm 475: Visible Surface Plotting
                 Program",
  journal =      j-CACM,
  volume =       "17",
  number =       "3",
  pages =        "152--155",
  month =        mar,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:57 1994",
  note =         "See also \cite{Duta:1976:RVS,Swieten:1979:RVS}.",
}

@Article{Page:1974:MST,
  author =       "R. L. Page",
  title =        "{ACM} Algorithm 479: {A} Minimal Spanning Tree
                 Clustering Method",
  journal =      j-CACM,
  volume =       "17",
  number =       "6",
  pages =        "321--323",
  month =        jun,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:57 1994",
  note =         "See also \cite{White:1976:RMS}.",
}

@Article{Watkins:1974:MTD,
  author =       "S. L. Watkins",
  title =        "{ACM} Algorithm 483: Masked Three-Dimensional Plot
                 Program with Rotations",
  journal =      j-CACM,
  volume =       "17",
  number =       "9",
  pages =        "520--523",
  month =        sep,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:57 1994",
  note =         "See also \cite{Feinstein:1975:RMT}.",
}

@Article{Veillon:1974:NIL,
  author =       "F. Veillon",
  title =        "{ACM} Algorithm 486: Numerical Inversion of {Laplace}
                 Transform",
  journal =      j-CACM,
  volume =       "17",
  number =       "10",
  pages =        "587--589",
  month =        oct,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:57 1994",
  note =         "See also \cite{Koppelaar:1976:RNI,Veillon:1977:RNI}.",
}

@Article{Pomeranz:1974:ECD,
  author =       "J. Pomeranz",
  title =        "{ACM} Algorithm 487: Exact Cumulative Distribution of
                 the {Kolmogorov-Smirnov} Statistic for Small Samples",
  journal =      j-CACM,
  volume =       "17",
  number =       "12",
  pages =        "703--704",
  month =        dec,
  year =         "1974",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:57 1994",
  note =         "See also \cite{Pomeranz:1976:REC}.",
}

@Article{Floyd:1975:ASF,
  author =       "R. W. Floyd and R. L. Rivest",
  title =        "{ACM} Algorithm 489: The Algorithm {SELECT} -- for
                 Finding the $i{\rm th}$ Smallest of $n$ Elements",
  journal =      j-CACM,
  volume =       "18",
  number =       "3",
  pages =        "173",
  month =        mar,
  year =         "1975",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:57 1994",
  note =         "See also \cite{Brown:1976:RAS}.",
}

@Article{Grinsberg:1975:DFR,
  author =       "E. S. Grinsberg and D. Zaborowski",
  title =        "{ACM} Algorithm 490: The Dilogarithm Function of a
                 Real Argument",
  journal =      j-CACM,
  volume =       "18",
  number =       "4",
  pages =        "200--202",
  month =        apr,
  year =         "1975",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782",
  bibdate =      "Thu Sep 08 09:47:57 1994",
  note =         "See also \cite{Morris:1976:RDF}.",
}

@Article{BrinchHansen:1994:MLD,
  author =       "Per {Brinch Hansen}",
  title =        "Multiple-length Division Revisited: a Tour of the
                 Minefield",
  journal =      j-SPE,
  volume =       "24",
  number =       "6",
  pages =        "579--601",
  month =        jun,
  year =         "1994",
  CODEN =        "SPEXBL",
  ISSN =         "0038-0644",
  bibdate =      "Wed Aug 24 15:30:29 1994",
  note =         "This paper derives an algorithm for division of long
                 integers, and implements it as a literate program,
                 although without identifier cross-references.",
  acknowledgement = ack-nhfb,
}

%=======================================================================
% Bibliography entries from TOMS

@Article{Rice:1975:PS,
  author =       "John R. Rice",
  title =        "Purpose and Scope",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "1--3",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 21:29:05 1994",
}

@Article{Anonymous:1975:ADS,
  author =       "{Anonymous}",
  title =        "Algorithms Distribution Service",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "4--4",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 21:29:05 1994",
}

@Article{Fosdick:1975:AP,
  author =       "Lloyd D. Fosdick",
  title =        "Algorithms Policy",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "5--6",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 21:29:05 1994",
}

@Article{Anonymous:1975:PMS,
  author =       "{Anonymous}",
  title =        "Papers from {Mathematical Software II}",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "7--12",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 21:29:05 1994",
}

@Article{Cody:1975:FPS,
  author =       "W. J. Cody",
  title =        "The {FUNPACK} Package of Special Function
                 Subroutines",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "13--25",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Jenkins:1975:PTP,
  author =       "M. A. Jenkins and J. F. Traub",
  title =        "Principles for Testing Polynomial Zerofinding
                 Programs",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "26--34",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Parlett:1975:ICC,
  author =       "B. N. Parlett and Y. Wang",
  title =        "The Influence of the Compiler on the Cost of
                 Mathematical Software\emdash in Particular on the Cost
                 of Triangular Factorization",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "35--46",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:35:13 1994",
  acknowledgement = ack-nhfb,
  keywords =     "cs; lud; nla; software",
}

@Article{Glover:1975:RWA,
  author =       "Fred Glover and Darwin Klingman",
  title =        "Real World Applications of Network Related Problems
                 and Breakthroughs in Solving Them Efficiently",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "47--55",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ng:1975:CCM,
  author =       "Edward W. Ng",
  title =        "A Comparison of Computational Methods and Algorithms
                 for the Complex Gamma Function",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "56--70",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Byrne:1975:PNS,
  author =       "G. D. Byrne and A. C. Hindmarsh",
  title =        "A Polyalgorithm for the Numerical Solution of Ordinary
                 Differential Equations",
  journal =      j-TOMS,
  volume =       "1",
  number =       "1",
  pages =        "71--96",
  month =        mar,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Powell:1975:VUM,
  author =       "M. J. D. Powell",
  title =        "A View of Unconstrained Minimization Algorithms that
                 Do Not Require Derivatives",
  journal =      j-TOMS,
  volume =       "1",
  number =       "2",
  pages =        "97--107",
  month =        jun,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Miller:1975:SRA,
  author =       "Webb Miller",
  title =        "Software for Roundoff Analysis",
  journal =      j-TOMS,
  volume =       "1",
  number =       "2",
  pages =        "108--128",
  month =        jun,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Malcolm:1975:LVG,
  author =       "Michael A. Malcolm and R. Bruce Simpson",
  title =        "Local Versus Global Strategies for Adaptive
                 Quadrature",
  journal =      j-TOMS,
  volume =       "1",
  number =       "2",
  pages =        "129--146",
  month =        jun,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Stoutemyer:1975:AOU,
  author =       "David R. Stoutemyer",
  title =        "Analytical Optimization Using Computer Algebraic
                 Manipulation",
  journal =      j-TOMS,
  volume =       "1",
  number =       "2",
  pages =        "147--164",
  month =        jun,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Barinka:1975:SEC,
  author =       "Lawrence L. Barinka",
  title =        "Some Experience with Constructing, Testing, and
                 Certifying a Standard Mathematical Subroutine Library",
  journal =      j-TOMS,
  volume =       "1",
  number =       "2",
  pages =        "165--177",
  month =        jun,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Jenkins:1975:AZR,
  author =       "M. A. Jenkins",
  title =        "Algorithm 493: Zeros of a Real Polynomial [{C2}]",
  journal =      j-TOMS,
  volume =       "1",
  number =       "2",
  pages =        "178--189",
  month =        jun,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:27:23 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rice:1975:SPP,
  author =       "John R. Rice",
  title =        "Software Package Policy",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "193--195",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Bailey:1975:UAM,
  author =       "Carl B. Bailey and Rondall E. Jones",
  title =        "Usage and Argument Monitoring of Mathematical Library
                 Routines",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "196--209",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{George:1975:ARR,
  author =       "James E. George",
  title =        "Algorithms to Reveal the Representation of Characters,
                 Integers, and Floating-Point Numbers",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "210--216",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Aird:1975:CAU,
  author =       "T. J. Aird and Robert E. Lynch",
  title =        "Computable Accurate Upper and Lower Error Bounds for
                 Approximate Solutions of Linear Algebraic Systems",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "217--231",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Sincovec:1975:SNP,
  author =       "Richard F. Sincovec and Niel K. Madsen",
  title =        "Software for Nonlinear Partial Differential
                 Equations",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "232--260",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:44:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{Sincovec:1975:APS,
  author =       "Richard F. Sincovec and Niel K. Madsen",
  title =        "Algorithm 494: {PDEONE}, Solutions of Systems of
                 Partial Differential Equations [{D3}]",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "261--263",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 18:06:09 1994",
  acknowledgement = ack-nhfb,
}

@Article{Barrodale:1975:ASO,
  author =       "I. Barrodale and C. Phillips",
  title =        "Algorithm 495: Solution of an Overdetermined System of
                 Linear Equations in the {Chebychev} Norm [{F4}]",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "264--270",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 16:10:20 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Chebyshev approximation; nla",
}

@Article{Kaufman:1975:ALA,
  author =       "Linda Kaufman",
  title =        "Algorithm 496: The {LZ} Algorithm to Solve the
                 Generalized Eigenvalue Problem for Complex Matrices
                 [{F2}]",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "271--281",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 18:06:42 1994",
}

@Article{Skovgaard:1975:RBF,
  author =       "Ove Skovgaard",
  title =        "Remark on ``{Algorithm} 236: {Bessel} Functions of the
                 First Kind [{S17}]''",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "282--284",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:11 1994",
  note =         "See \cite{Gautschi:1964:BFF}.",
  acknowledgement = ack-nhfb,
}

@Article{Feinstein:1975:RMT,
  author =       "Robert Feinstein",
  title =        "Remark on ``{Algorithm} 483: Masked Three-Dimensional
                 Plot Program with Rotations [{J6}]''",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "285--285",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:09 1994",
  note =         "See \cite{Watkins:1974:MTD}.",
  acknowledgement = ack-nhfb,
}

@Article{Misra:1975:RG,
  author =       "Jayadev Misra",
  title =        "Remark on ``{Algorithm} 246: {Graycode} [{Z}]''",
  journal =      j-TOMS,
  volume =       "1",
  number =       "3",
  pages =        "285--285",
  month =        sep,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 20:42:41 1994",
  note =         "See \cite{Boothroyd:1964:G,Er:1985:RG}.",
  acknowledgement = ack-nhfb,
}

@Article{Stone:1975:PTE,
  author =       "H. Stone",
  title =        "Parallel Tridiagonal Equation Solvers",
  journal =      j-TOMS,
  volume =       "1",
  number =       "4",
  pages =        "289--307",
  month =        dec,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:35:17 1994",
  acknowledgement = ack-nhfb,
  keywords =     "nla; prll; tridiagonal matrix",
}

@Article{Lambiotte:1975:STL,
  author =       "Jules J. Lambiotte and Robert G. Voigt",
  title =        "The Solution of Tridiagonal Linear Systems on the {CDC
                 STAR} 100 Computer",
  journal =      j-TOMS,
  volume =       "1",
  number =       "4",
  pages =        "308--329",
  month =        dec,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:20:57 1994",
  acknowledgement = ack-nhfb,
  keywords =     "linear system; nla; tridiagonal matrix; vect",
}

@Article{Bus:1975:TEA,
  author =       "J. C. P. Bus and T. J. Dekker",
  title =        "Two Efficient Algorithms with Guaranteed Convergence
                 for Finding a Zero of a Function",
  journal =      j-TOMS,
  volume =       "1",
  number =       "4",
  pages =        "330--345",
  month =        dec,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:12:30 1994",
  acknowledgement = ack-nhfb,
  keywords =     "nlop",
}

@Article{Norman:1975:CFP,
  author =       "A. C. Norman",
  title =        "Computing with Formal Power Series",
  journal =      j-TOMS,
  volume =       "1",
  number =       "4",
  pages =        "346--356",
  month =        dec,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:22:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{Neves:1975:AIF,
  author =       "Kenneth W. Neves",
  title =        "Automatic Integration of Functional Differential
                 Equations: An Approach",
  journal =      j-TOMS,
  volume =       "1",
  number =       "4",
  pages =        "357--368",
  month =        dec,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:22:51 1994",
  acknowledgement = ack-nhfb,
}

@Article{Neves:1975:AAI,
  author =       "Kenneth W. Neves",
  title =        "Algorithm 497: Automatic Integration of Functional
                 Differential Equations [{D2}]",
  journal =      j-TOMS,
  volume =       "1",
  number =       "4",
  pages =        "369--371",
  month =        dec,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:24:04 1994",
  acknowledgement = ack-nhfb,
}

@Article{Prince:1975:AAF,
  author =       "P. J. Prince",
  title =        "Algorithm 498: {Airy} Functions Using {Chebyshev}
                 Series Approximations",
  journal =      j-TOMS,
  volume =       "1",
  number =       "4",
  pages =        "372--379",
  month =        dec,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:24:33 1994",
  note =         "See also \cite{Razaz:1981:RAF}.",
  acknowledgement = ack-nhfb,
}

@Article{Lewis:1975:CPF,
  author =       "John Gregg Lewis",
  title =        "Certification of ``{Algorithm} 349: Polygamma
                 Functions with Arbitrary Precision''",
  journal =      j-TOMS,
  volume =       "1",
  number =       "4",
  pages =        "380--382",
  month =        dec,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 24 09:58:10 1996",
  acknowledgement = ack-nhfb,
}

@Article{Bromage:1975:CVS,
  author =       "Gordon E. Bromage",
  title =        "Certification of ``{Algorithm} 475: Visible Surface
                 Plotting Program [{J6}]''",
  journal =      j-TOMS,
  volume =       "1",
  number =       "4",
  pages =        "381--382",
  month =        dec,
  year =         "1975",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:22:51 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rice:1976:PAA,
  author =       "John R. Rice",
  title =        "Parallel Algorithms for Adaptive Quadrature {III}.
                 Program Correctness",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "1--30",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Griss:1976:ASS,
  author =       "Martin L. Griss",
  title =        "The Algebraic Solution of Sparse Linear Systems via
                 Minor Expansion",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "31--49",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Duris:1976:GCP,
  author =       "Charles S. Duris",
  title =        "Generating and Compounding Product-Type
                 {Newton-Coates} Quadrature Formulas",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "50--58",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Bays:1976:IPR,
  author =       "Carter Bays and S. D. Durham",
  title =        "Improving a Poor Random Number Generator",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "59--64",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Lyness:1976:CNA,
  author =       "J. N. Lyness and J. J. Kaganove",
  title =        "Comments on the Nature of Automatic Quadrature
                 Routines",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "65--81",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Kinsner:1976:AES,
  author =       "W. Kinsner and E. Della Torre",
  title =        "Algorithm 499: An Efficient Scanning Technique [{Z}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "82--86",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:35:20 1994",
  acknowledgement = ack-nhfb,
}

@Article{Shanno:1976:AMU,
  author =       "D. F. Shanno and K. H. Phua",
  title =        "Algorithm 500: Minimization of Unconstrained
                 Multivariate Functions [{E4}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "87--94",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:35:51 1994",
  acknowledgement = ack-nhfb,
}

@Article{Simpson:1976:AFT,
  author =       "Joseph C. Simpson",
  title =        "Algorithm 501: {Fortran} Translation of {Algorithm}
                 409, Discrete {Chebychev} Curve Fit [{E2}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "95--97",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 23:07:07 1994",
  acknowledgement = ack-nhfb,
}

@Article{Kubicek:1976:ADS,
  author =       "Milan Kub{\'\i}{\v{c}}ek",
  title =        "Algorithm 502: Dependence of Solution of Nonlinear
                 Systems on a Parameter [{C5}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "98--107",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 18:03:58 1994",
  acknowledgement = ack-nhfb,
}

@Article{Boulton:1976:REP,
  author =       "D. M. Boulton",
  title =        "Remark on ``{Algorithm} 434: Exact Probabilities for
                 ${R}\times{C}$ Contingency Tables [{G2}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "108--108",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:20 1994",
  note =         "See \cite{March:1972:EPT}.",
  acknowledgement = ack-nhfb,
}

@Article{Duta:1976:RVS,
  author =       "Lucian D. Duta",
  title =        "Remark on ``{Algorithm} 475: Visible Surface Plotting
                 Program [{J6}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "109--110",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:22 1994",
  note =         "See \cite{Wright:1974:VSP}.",
  acknowledgement = ack-nhfb,
}

@Article{White:1976:RMS,
  author =       "G. M. White and S. Goudreau and J. L. Legros",
  title =        "Remark on ``{Algorithm} 479: {A} Minimal Spanning Tree
                 Clustering Method [{Z}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "110--111",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:24 1994",
  note =         "See \cite{Page:1974:MST}.",
  acknowledgement = ack-nhfb,
}

@Article{Pomeranz:1976:REC,
  author =       "J. Pomeranz",
  title =        "Remark on ``{Algorithm} 487: Exact Cumulative
                 Distribution of the {Kolmogorov-Smirnov} Statistic for
                 Small Samples [{S14}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "111--111",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:25 1994",
  note =         "See \cite{Pomeranz:1974:ECD}.",
  acknowledgement = ack-nhfb,
}

@Article{Morris:1976:RDF,
  author =       "Robert Morris",
  title =        "Remark on ``{Algorithm} 490: The Dilogarithm Function
                 of a Real Argument [{S22}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "1",
  pages =        "112--112",
  month =        mar,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:18 1994",
  note =         "See \cite{Grinsberg:1975:DFR}.",
  acknowledgement = ack-nhfb,
}

@Article{Rice:1976:TPS,
  author =       "John R. Rice",
  title =        "{TOMS} Policy Statement: The Rights of Program Authors
                 in the Evaluation of Programs",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "113--114",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ford:1976:DSN,
  author =       "B. Ford and D. K. Sayers",
  title =        "Developing a Single Numerical Algorithms Library for
                 Different Machine Ranges",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "115--131",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Paul:1976:SEF,
  author =       "George Paul and M. Wayne Wilson",
  title =        "Should the Elementary Function Library Be Incorporated
                 Into Computer Instruction Sets?",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "132--142",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Janko:1976:LIS,
  author =       "Wolfgang Janko",
  title =        "A List Insertion Sort for Keys With Arbitrary Key
                 Distribution",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "143--153",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Atkinson:1976:APL,
  author =       "Kendall Atkinson",
  title =        "An Automatic Program for Linear {Fredholm} Integral
                 Equations of the Second Kind",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "154--171",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Shampine:1976:GEE,
  author =       "L. F. Shampine and H. A. Watts",
  title =        "Global Error Estimates for Ordinary Differential
                 Equations",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "172--186",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ericksen:1976:ICP,
  author =       "J. H. Ericksen and R. Wilhelmson",
  title =        "Implementation of a Convective Problem Requiring
                 Auxiliary Storage",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "187--195",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 10:18:18 1994",
  acknowledgement = ack-nhfb,
}

@Article{Atkinson:1976:AAP,
  author =       "Kendall Atkinson",
  title =        "Algorithm 503: An Automatic Program for {Fredholm}
                 Integral Equations of the Second Kind [{D5}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "196--199",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:51:30 1994",
  acknowledgement = ack-nhfb,
}

@Article{Shampine:1976:AGG,
  author =       "L. F. Shampine and H. A. Watts",
  title =        "Algorithm 504: {GERK}: Global Error Estimation For
                 Ordinary Differential Equations [{D}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "200--203",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:52:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Janko:1976:ALI,
  author =       "Wolfgang Janko",
  title =        "Algorithm 505: {A} List Insertion Sort for Keys with
                 Arbitrary Key Distribution [{S20}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "204--206",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:52:49 1994",
  acknowledgement = ack-nhfb,
}

@Article{Pike:1976:RIB,
  author =       "Malcolm C. Pike and Jennie SooHoo",
  title =        "Remark on ``{Algorithm} 179: Incomplete Beta Ratio
                 [{S14}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "207--208",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:26 1994",
  note =         "See \cite{Ludwig:1963:IBR}.",
  acknowledgement = ack-nhfb,
}

@Article{Anderson:1976:RIS,
  author =       "Michael R. Anderson",
  title =        "Remark on ``{Algorithm} 433: Interpolation and Smooth
                 Curve Fitting Based on Local Procedures [{E2}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "2",
  pages =        "208--208",
  month =        jun,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:27 1994",
  note =         "See \cite{Akima:1972:ISC}.",
  acknowledgement = ack-nhfb,
}

@Article{Wyatt:1976:PEP,
  author =       "W. T. {Wyatt, Jr.} and D. W. Lozier and D. J. Orser",
  title =        "A Portable Extended Precision Arithmetic Package and
                 Library With {Fortran} Precompiler",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "209--231",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gentleman:1976:AAC,
  author =       "W. M. Gentleman and S. C. Johnson",
  title =        "Analysis of Algorithms, {A} Case Study: Determinants
                 of Matrices with Polynomial Entries",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "232--241",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Barwell:1976:CAS,
  author =       "Victor Barwell and Alan George",
  title =        "A Comparison of Algorithms for Solving Symmetric
                 Indefinite Systems of Linear Equations",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "242--251",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:35:17 1994",
  acknowledgement = ack-nhfb,
  keywords =     "indefinite system; linear system; nla; symmetric
                 matrix",
}

@Article{Bartels:1976:HIU,
  author =       "Richard Bartels and Alec Steingart",
  title =        "{Hermite} Interpolation Using a Triangular Polynomial
                 Basis",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "252--256",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Hall:1976:NSS,
  author =       "C. A. Hall and R. W. Luczak and A. G. Serdy",
  title =        "Numerical Solution of Steady State Heat Flow Problems
                 Over Curved Domains",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "257--274",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Stewart:1976:AHE,
  author =       "G. W. Stewart",
  title =        "Algorithm 506: {HQR3} and {EXCHNG}: {Fortran}
                 Subroutines for Calculating and Ordering the
                 Eigenvalues of a Real Upper {Hessenberg} Matrix
                 [{F2}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "275--280",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 18:03:53 1994",
  note =         "See also \cite{Flamm:1982:RHE}.",
  acknowledgement = ack-nhfb,
  keywords =     "eig; Hessenberg matrix; nla; QR algorithm; software",
}

@Article{Herriot:1976:APQ,
  author =       "John G. Herriot and Christian H. Reinsch",
  title =        "Algorithm 507: Procedures for Quintic Natural Spline
                 Interpolation [{E1}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "281--289",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 01:01:50 1994",
  note =         "See also \cite{Hanson:1982:RPQ}.",
  acknowledgement = ack-nhfb,
}

@Article{Loeser:1976:SAQ,
  author =       "Rudolf Loeser",
  title =        "Survey on Algorithms 347, 426, and Quicksort",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "290--299",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Davies:1976:RRF,
  author =       "Alan M. Davies",
  title =        "Remark on ``{Algorithm} 450: {Rosenbrock} Function
                 Minimization [{E4}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "300--301",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:28 1994",
  note =         "See \cite{MacHura:1973:RFM}.",
  acknowledgement = ack-nhfb,
}

@Article{Brown:1976:RAS,
  author =       "Theodore Brown",
  title =        "Remark on ``{Algorithm} 489: The Algorithm
                 {SELECT}\emdash for Finding the $i$th Smallest of $n$
                 Elements [{M1}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "3",
  pages =        "301--304",
  month =        sep,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:31 1994",
  note =         "See \cite{Floyd:1975:ASF}.",
  acknowledgement = ack-nhfb,
}

@Article{Pavlidis:1976:UAP,
  author =       "Theodosios Pavlidis",
  title =        "The Use of Algorithms of Piecewise Approximations for
                 Picture Processing Applications",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "305--321",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gibbs:1976:CSB,
  author =       "Norman E. Gibbs and William G. {Poole Jr.} and Paul K.
                 Stockmeyer",
  title =        "A Comparison of Several Bandwidth and Profile
                 Reduction Algorithms",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "322--330",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 01:07:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "band matrix; band reduction; nla; profile reduction;
                 sparse",
}

@Article{Mahendrarajah:1976:CTA,
  author =       "A. Mahendrarajah and F. Fiala",
  title =        "A Comparison of Three Algorithms for Linear Zero-One
                 Programs",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "331--334",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 01:08:17 1994",
  acknowledgement = ack-nhfb,
}

@Article{Weinberger:1976:FPA,
  author =       "P. J. Weinberger and L. P. Rothschild",
  title =        "Factoring Polynomials Over Algebraic Number Fields",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "335--350",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Pinkert:1976:EMF,
  author =       "James R. Pinkert",
  title =        "An Exact Method for Finding the Roots of a Complex
                 Polynomial",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "351--363",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rubin:1976:PI,
  author =       "Frank Rubin",
  title =        "Partition of Integers",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "364--374",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 00:30:21 1994",
  acknowledgement = ack-nhfb,
}

@Article{Crane:1976:AMB,
  author =       "H. L. {Crane Jr.} and Norman E. Gibbs and William G.
                 {Poole Jr.} and Paul K. Stockmeyer",
  title =        "Algorithm 508: Matrix Bandwidth and Profile Reduction
                 [{F1}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "375--377",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 01:11:54 1994",
  note =         "See also \cite{Lewis:1982:RMB}.",
  acknowledgement = ack-nhfb,
}

@Article{Gibbs:1976:AHP,
  author =       "Norman E. Gibbs",
  title =        "Algorithm 509: {A} Hybrid Profile Reduction Algorithm
                 [{F1}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "378--387",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 01:11:35 1994",
  note =         "See also \cite{Lewis:1982:RMB}.",
  acknowledgement = ack-nhfb,
}

@Article{Wilson:1976:APL,
  author =       "D. G. Wilson",
  title =        "Algorithm 510: Piecewise Linear Approximation to
                 Tabulated Data [{E2}]",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "388--391",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 01:12:13 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ito:1976:RIT,
  author =       "M. R. Ito",
  title =        "Remark on ``{Algorithm} 284: Interchange of Two Blocks
                 of Data [{K2}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "392--393",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:34 1994",
  note =         "See \cite{Fletcher:1966:ITB}.",
  acknowledgement = ack-nhfb,
}

@Article{Lozy:1976:RCS,
  author =       "Mohamed el Lozy",
  title =        "Remark on ``{Algorithm} 299: Chi-Squared Integral
                 [{S15}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "393--395",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 20:40:11 1994",
  note =         "See \cite{Hill:1967:CSI,Hill:1985:RCS}.",
  acknowledgement = ack-nhfb,
}

@Article{Koppelaar:1976:RNI,
  author =       "Henk Koppelaar and Peter Molenaar",
  title =        "Remark on ``{Algorithm} 486: Numerical Inversion of
                 {Laplace} Transform [{D5}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "395--396",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:41 1994",
  note =         "See \cite{Veillon:1974:NIL}.",
  acknowledgement = ack-nhfb,
}

@Article{Kaufman:1976:RLA,
  author =       "Linda Kaufman",
  title =        "Remark on ``{Algorithm} 496: The {LZ} Algorithm to
                 Solve the Generalized Eigenvalue Problem for Complex
                 Matrices [{F2}]''",
  journal =      j-TOMS,
  volume =       "2",
  number =       "4",
  pages =        "396--396",
  month =        dec,
  year =         "1976",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:42 1994",
  note =         "See \cite{Kaufman:1975:ALA}.",
  acknowledgement = ack-nhfb,
}

@Article{McClellan:1977:ESL,
  author =       "Michael T. McClellan",
  title =        "The Exact Solution of Linear Equations with Rational
                 Function Coefficients",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "1--25",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:12:55 1994",
  acknowledgement = ack-nhfb,
}

@Article{Stoutemyer:1977:AEA,
  author =       "David R. Stoutemyer",
  title =        "Automatic Error Analysis Using Computer Algebraic
                 Manipulation",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "26--43",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 02 22:30:11 1994",
  abstract =     "This paper shows how the inherent error and the
                 fixed-point or floating-point roundoff of chopoff error
                 of an expression can be determined automatically using
                 a computer algebra language such as {REDUCE}.",
  acknowledgement = ack-nhfb,
}

@Article{Shampine:1977:SND,
  author =       "L. F. Shampine",
  title =        "Stiff and Nonstiff Differential Equation Solvers,
                 {II}: Detecting Stiffness with {Runge-Kutta} Methods",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "44--53",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:12:55 1994",
  acknowledgement = ack-nhfb,
}

@Article{Tran-Thong:1977:FPF,
  author =       "{Tran-Thong} and Bede Liu",
  title =        "Floating Point Fast {Fourier} Transform Computation
                 Using Double Precision Floating Point Accumulators",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "54--59",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:12:55 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gonzalez:1977:EAK,
  author =       "Teofilo Gonzalez and Sartaj Sahni and W. R. Franta",
  title =        "An Efficient Algorithm for the {Kolmogorov-Smirnov}
                 and {Lilliefors} Tests",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "60--64",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:12:55 1994",
  acknowledgement = ack-nhfb,
}

@Article{Kaufman:1977:STQ,
  author =       "L. Kaufman",
  title =        "Some Thoughts on the {QZ} Algorithm for Solving the
                 Generalized Eigenvalue Problem",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "65--75",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 19:39:25 1994",
  acknowledgement = ack-nhfb,
  keywords =     "gieg; nla; QZ algorithm",
}

@Article{Amos:1977:CSI,
  author =       "D. E. Amos and S. L. Daniel and M. K. Weston",
  title =        "{CDC} 6600 Subroutines {IBESS} and {JBESS} for
                 {Bessel} Functions {$I_\nu(x)$} and {$J_\nu(x)$},
                 {$x\ge0,\nu\ge0$}",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "76--92",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 06 19:20:02 1994",
  acknowledgement = ack-nhfb,
}

@Article{Amos:1977:ACS,
  author =       "D. E. Amos and S. L. Daniel and M. K. Weston",
  title =        "Algorithm 511: {CDC} 6600 Subroutines {IBESS} and
                 {JBESS} for {Bessel} Functions {$I_\nu(x)$} and
                 {$J_\nu(x)$}, {$x \ge 0, \nu \ge 0$} [{S18}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "93--95",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Benson:1977:ANA,
  author =       "A. Benson and D. J. Evans",
  title =        "Algorithm 512: {A} Normalized Algorithm for Solution
                 of the Positive Definite Symmetric Quindiagonal Systems
                 of Linear Equations [{F4}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "96--103",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:22:47 1994",
  acknowledgement = ack-nhfb,
}

@Article{Cate:1977:AAS,
  author =       "Esko G. Cate and David W. Twigg",
  title =        "Algorithm 513: Analysis of In-Situ Transposition
                 [{F1}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "104--110",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:22:41 1994",
  acknowledgement = ack-nhfb,
}

@Article{Veillon:1977:RNI,
  author =       "Fran{\c{c}}oise Veillon",
  title =        "Remark on ``{Algorithm} 486: Numerical Inversion of
                 {Laplace} Transform''",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "111--111",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:43 1994",
  note =         "See \cite{Veillon:1974:NIL}.",
  acknowledgement = ack-nhfb,
}

@Article{Dunham:1977:RMU,
  author =       "Charles Dunham",
  title =        "Remark on ``{Algorithm} 500: Minimization of
                 Unconstrained Multivariate Functions [{E4}]''",
  journal =      j-TOMS,
  volume =       "3",
  number =       "1",
  pages =        "112--112",
  month =        mar,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:27:59 1994",
  note =         "See \cite{Shanno:1976:AMU}.",
  acknowledgement = ack-nhfb,
}

@Article{Aird:1977:PMS,
  author =       "Thomas J. Aird",
  title =        "Portability of Mathematical Software Coded in
                 {Fortran}",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "113--127",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{Stoutemyer:1977:ASI,
  author =       "David R. Stoutemyer",
  title =        "Analytically Solving Integral Equations by Using
                 Computer Algebra",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "128--146",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{McClellan:1977:CAE,
  author =       "Michael T. McClellan",
  title =        "A Comparison of Algorithms for the Exact Solution of
                 Linear Equations",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "147--158",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{Farden:1977:SSS,
  author =       "David C. Farden",
  title =        "The Solution of a Special Set of {Hermitian}
                 {Toeplitz} Linear Equations",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "159--163",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ichida:1977:CFO,
  author =       "Kozo Ichida and Takeshi Kiyono and Fujiichi
                 Yoshimoto",
  title =        "Curve Fitting by a One-Pass Method With a Piecewise
                 Cubic Polynomial",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "164--174",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ellis:1977:ANM,
  author =       "T. M. R. Ellis and D. H. McLain",
  title =        "Algorithm 514: {A} New Method of Cubic Curve Fitting
                 Using Local Data [{E2}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "175--179",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Buckles:1977:AGV,
  author =       "B. P. Buckles and M. Lybanon",
  title =        "Algorithm 515: Generation of a Vector from the
                 Lexicographical Index [{G6}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "180--182",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{McKean:1977:AAO,
  author =       "J. W. McKean and T. A. {Ryan, Jr.}",
  title =        "Algorithm 516: An Algorithm for Obtaining Confidence
                 Intervals and Point Estimates Based on Ranks in the Two
                 Sample Location Problem [{G1}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "183--185",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Chan:1977:APC,
  author =       "S. P. Chan and R. Feldman and B. N. Parlett",
  title =        "Algorithm 517: {A} Program for Computing the Condition
                 Numbers of Matrix Eigenvalues Without Computing
                 Eigenvectors [{F2}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "186--203",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:34:22 1994",
  acknowledgement = ack-nhfb,
  keywords =     "condition estimation; eig; nla; nonsymmetric matrix;
                 pert; software",
}

@Article{Mackay:1977:RPT,
  author =       "M. Mackay and J. E. Radue",
  title =        "Remark on ``{Some} Performance Tests of `{Quicksort}'
                 and Descendants''",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "204--204",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:07:36 1994",
  note =         "See \cite{Loeser:1974:SPT}.",
  acknowledgement = ack-nhfb,
}

@Article{Jansen:1977:RLF,
  author =       "J. K. M. Jansen",
  title =        "Remark on ``{Algorithm} 259: {Legendre} Functions for
                 Arguments Larger than One''",
  journal =      j-TOMS,
  volume =       "3",
  number =       "2",
  pages =        "204--205",
  month =        jun,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:59:04 1994",
  note =         "See \cite{Gautschi:1965:LFA}.",
  acknowledgement = ack-nhfb,
}

@Article{Friedman:1977:AFB,
  author =       "Jerome H. Friedman and Jon Louis Bentley and Raphael
                 Ari Finkel",
  title =        "An Algorithm for Finding Best Matches in Logarithmic
                 Expected Time",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "209--226",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:53:20 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ito:1977:MRP,
  author =       "Tetsuro Ito and Makoto Kizawa",
  title =        "The Matrix Rearrangement Procedure for
                 Graph-Theoretical Algorithms and Its Application to the
                 Generation of Fundamental Cycles",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "227--231",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{Cody:1977:CRF,
  author =       "W. J. Cody and Rose M. Motley and L. Wayne Fullerton",
  title =        "The Computation of Real Fractional Order {Bessel}
                 Functions of the Second Kind",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "232--239",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gautschi:1977:ERI,
  author =       "Walter Gautschi",
  title =        "Evaluation of Repeated Integrals of the Coerror
                 Function",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "240--252",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{Walker:1977:EMG,
  author =       "Alastair J. Walker",
  title =        "An Efficient Method for Generating Discrete Random
                 Variables with General Distributions",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "253--256",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

%=======================================================================
% Bibliography entries from ACM Transactions on Programming Languages
% and Systems.

@Article{Kinderman:1977:CGR,
  author =       "A. J. Kinderman and J. F. Monahan",
  title =        "Computer Generation of Random Variables Using the
                 Ratio of Uniform Deviates",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "257--260",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:58:34 1994",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG;",
  enum =         "7496",
  language =     "English",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Cohen:1977:SSF,
  author =       "Jacques Cohen and Joel Katcoff",
  title =        "Symbolic Solution of Finite-Difference Equations",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "261--271",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{Fateman:1977:ADC,
  author =       "Richard J. Fateman",
  title =        "An Algorithm for Deciding the Convergence of the
                 Rational Iteration $x_{n+1} = f(x_n)$",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "272--278",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 22:26:34 1994",
  acknowledgement = ack-nhfb,
}

@Article{Hill:1977:AIB,
  author =       "G. W. Hill",
  title =        "Algorithm 518: Incomplete {Bessel} Function {$I_0$}.
                 {The} Von {Mises} Distribution [{S14}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "279--284",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:01:14 1994",
  acknowledgement = ack-nhfb,
}

@Article{Kallman:1977:ATA,
  author =       "Ralph Kallman",
  title =        "Algorithm 519: Three Algorithms for Computing
                 {Kolmogorov-Smirnov} Probabilities with Arbitrary
                 Boundaries and a Certification of Algorithm 487
                 [{S14}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "285--294",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:01:47 1994",
  acknowledgement = ack-nhfb,
}

@Article{Weglarz:1977:AAR,
  author =       "Jan Weglarz and Jacek Blazewicz and Wojciech Cellary
                 and Roman Slowinski",
  title =        "Algorithm 520: An Automatic Revised Simplex Method for
                 Constrained Resource Network Scheduling [{H}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "295--300",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Gautschi:1977:ARI,
  author =       "Walter Gautschi",
  title =        "Algorithm 521: Repeated Integrals of the Coerror
                 Function [{S15}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "301--302",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:03:07 1994",
  acknowledgement = ack-nhfb,
}

@Article{Sipala:1977:RSM,
  author =       "Paolo Sipala",
  title =        "Remark on ``{Algorithm} 408: {A} Sparse Matrix Package
                 (Part {I}) [{F4}]''",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "303--303",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See \cite{McNamee:1971:SMP}.",
  acknowledgement = ack-nhfb,
}

@Article{Tenney:1977:RTO,
  author =       "Dennis Tenney",
  title =        "Remark on ``{Algorithm} 219: Topological Ordering for
                 {PERT} Networks''",
  journal =      j-TOMS,
  volume =       "3",
  number =       "3",
  pages =        "303--303",
  month =        sep,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See \cite{Kase:1963:TOP}.",
  acknowledgement = ack-nhfb,
}

@Article{Hillstrom:1977:STA,
  author =       "Kenneth E. Hillstrom",
  title =        "A Simulation Test Approach to the Evaluation of
                 Nonlinear Optimization Algorithms",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "305--315",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:06:22 1994",
  acknowledgement = ack-nhfb,
}

@Article{Powell:1977:PQA,
  author =       "M. J. D. Powell and M. A. Sabin",
  title =        "Piecewise Quadratic Approximations on Triangles",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "316--325",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:07:03 1994",
  acknowledgement = ack-nhfb,
}

@Article{Skeel:1977:BLM,
  author =       "Robert D. Skeel and Antony K. Kong",
  title =        "Blended Linear Multistep Methods",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "326--345",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:01:06 1994",
  acknowledgement = ack-nhfb,
}

@Article{Payne:1977:NRN,
  author =       "W. H. Payne",
  title =        "Normal Random Numbers: Using Machine Analysis To
                 Choose the Best Algorithm",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "346--358",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:09:02 1994",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG;",
  enum =         "7752",
  language =     "English",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Boyce:1977:IPF,
  author =       "William A. Boyce",
  title =        "An Improved Program for the Full {Steiner} Tree
                 Problem",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "359--385",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:07:03 1994",
  acknowledgement = ack-nhfb,
}

@Article{Cabay:1977:CTE,
  author =       "S. Cabay and T. P. L. Lam",
  title =        "Congruence Techniques for the Exact Solution of
                 Integer Systems of Linear Equations",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "386--397",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:01:45 1994",
  acknowledgement = ack-nhfb,
}

@Article{Eddy:1977:NCH,
  author =       "William F. Eddy",
  title =        "A New Convex Hull Algorithm for Planar Sets",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "398--403",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:07:03 1994",
  acknowledgement = ack-nhfb,
}

@Article{Cabay:1977:AEC,
  author =       "S. Cabay and T. P. L. Lam",
  title =        "Algorithm 522: {ESOLVE}, Congruence Techniques for the
                 Exact Solution of Integer Systems of Linear Equations
                 [{F4}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "404--410",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Eddy:1977:ACN,
  author =       "W. F. Eddy",
  title =        "Algorithm 523: {CONVEX}, {A} New Convex Hull Algorithm
                 for Planar Sets [{Z}]",
  journal =      j-TOMS,
  volume =       "3",
  number =       "4",
  pages =        "411--412",
  month =        dec,
  year =         "1977",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Dinkel:1978:SAP,
  author =       "John J. Dinkel and Gary A. Kochenberger and S. N.
                 Wong",
  title =        "Sensitivity Analysis Procedures for Geometric
                 Programs: Computational Aspects",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "1--14",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Blue:1978:PFP,
  author =       "James L. Blue",
  title =        "A Portable {Fortran} Program to Find the {Euclidean}
                 Norm of a Vector",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "15--23",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:14:36 1994",
  acknowledgement = ack-nhfb,
  keywords =     "blas; nla; norm; software",
}

@Article{Ivie:1978:SMP,
  author =       "John Ivie",
  title =        "Some {MACSYMA} Programs for Solving Recurrence
                 Relations",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "24--33",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:42:29 1994",
  note =         "See also \cite{Celis:1984:RCE}.",
  acknowledgement = ack-nhfb,
}

@Article{Lasdon:1978:DTG,
  author =       "L. S. Lasdon and A. D. Waren and A. Jain and M.
                 Ratner",
  title =        "Design and Testing of a Generalized Reduced Gradient
                 Code for Nonlinear Programming",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "34--50",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Tsao:1978:MNI,
  author =       "Nai-Kuan Tsao and Rose Marie Prior",
  title =        "On Multipoint Numerical Interpolation",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "51--56",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Brent:1978:FMP,
  author =       "Richard P. Brent",
  title =        "{A Fortran} Multiple-Precision Arithmetic Package",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "57--70",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Brent:1978:AMF,
  author =       "Richard P. Brent",
  title =        "Algorithm 524: {MP}, {A Fortran} Multiple-Precision
                 Arithmetic Package [{A1}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "71--81",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 5 22:33:38 1994",
  note =         "See also \cite{Brent:1979:RMF,Brent:1980:AIB}.",
  acknowledgement = ack-nhfb,
}

@Article{Rice:1978:AAA,
  author =       "John R. Rice",
  title =        "Algorithm 525: {ADAPT}, Adaptive Smooth Curve Fitting
                 [{E2}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "82--94",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Futrell:1978:RTA,
  author =       "R. Futrell",
  title =        "Remark on ``{Fortran} Translation of {Algorithm} 409:
                 Discrete {Chebychev} Curve Fit [{E2}]''",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "95--95",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 23:07:36 1994",
  note =         "See \cite{Simpson:1976:AFT}.",
  acknowledgement = ack-nhfb,
}

@Article{Skovgaard:1978:RCE,
  author =       "Ove Skovgaard",
  title =        "Remark on ``{Algorithm} 149: Complete Elliptic
                 Integral [{S21}]''",
  journal =      j-TOMS,
  volume =       "4",
  number =       "1",
  pages =        "95--95",
  month =        mar,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See \cite{Merner:1962:CEI}.",
  acknowledgement = ack-nhfb,
}

@Article{Krogh:1978:AP,
  author =       "Fred T. Krogh",
  title =        "Algorithms Policy",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "97--99",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:23:41 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ford:1978:PET,
  author =       "Brian Ford",
  title =        "Parametrization of the Environment for Transportable
                 Numerical Software",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "100--103",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Fox:1978:PMS,
  author =       "P. A. Fox and A. D. Hall and N. L. Schryer",
  title =        "The {PORT} Mathematical Subroutine Library",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "104--126",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Enright:1978:IEM,
  author =       "W. H. Enright",
  title =        "Improving the Efficiency of Matrix Operations in the
                 Numerical Solution of Stiff Ordinary Differential
                 Equations",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "127--136",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Duff:1978:ITA,
  author =       "I. S. Duff and J. K. Reid",
  title =        "An Implementation of {Tarjan}'s Algorithm for the
                 Block Triangularization of a Matrix",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "137--147",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 19:40:23 1994",
  acknowledgement = ack-nhfb,
  keywords =     "graph; sparse",
}

@Article{Akima:1978:MBI,
  author =       "Hiroshi Akima",
  title =        "A Method of Bivariate Interpolation and Smooth Surface
                 Fitting for Irregularly Distributed Data Points",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "148--159",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Akima:1978:ABI,
  author =       "Hiroshi Akima",
  title =        "Algorithm 526: Bivariate Interpolation and Smooth
                 Surface Fitting for Irregularly Distributed Data Points
                 [{E1}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "160--164",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 20:54:19 1994",
  note =         "See also \cite{Akima:1979:RBI,Preusser:1985:RBI}.",
  acknowledgement = ack-nhfb,
}

@Article{Bank:1978:AFI,
  author =       "Randolph E. Bank",
  title =        "Algorithm 527: {A Fortran} Implementation of the
                 Generalized Marching Algorithm [{D3}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "165--176",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:30:03 1994",
  acknowledgement = ack-nhfb,
}

@Article{Fox:1978:AFP,
  author =       "P. A. Fox and A. D. Hall and N. L. Schryer",
  title =        "Algorithm 528: Framework for a Portable Library
                 [{Z}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "177--188",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:30:46 1994",
  acknowledgement = ack-nhfb,
  annote =       "The three program packages presented here provide a
                 framework for a portable FORTRAN subroutine library.
                 They were developed for the BELL Laboratories library
                 PORT(1). The packages are: machine-dependent constants,
                 automatic error handling, and dynamic storage
                 allocation using a stack.",
  country =      "USA",
  date =         "19/03/80",
  descriptors =  "Reliability; program construction; mathematical
                 method; FORTRAN; portability; error handling; memory
                 management; library;",
  enum =         "988",
  language =     "English",
  location =     "RWTH-AC-DFV: TELL",
  references =   "1",
  revision =     "20/03/92",
}

@Article{Duff:1978:APB,
  author =       "I. S. Duff and J. K. Reid",
  title =        "Algorithm 529: Permutations To Block Triangular Form
                 [{F1}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "2",
  pages =        "189--192",
  month =        jun,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:31:27 1994",
  acknowledgement = ack-nhfb,
}

@Article{Bailey:1978:ASS,
  author =       "P. B. Bailey and M. K. Gordon and L. F. Shampine",
  title =        "Automatic Solution of the {Sturm-Liouville} Problem",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "193--208",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Polak:1978:TPP,
  author =       "S. J. Polak and J. Schrooten and C. Barneveld
                 Binkhuysen",
  title =        "{TEDDY2}, {A} Program Package for Parabolic Composite
                 Region Problems",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "209--227",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Larson:1978:ECE,
  author =       "John Larson and Ahmed Sameh",
  title =        "Efficient Calculation of the Effects of Roundoff
                 Errors",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "228--236",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:34:09 1994",
  acknowledgement = ack-nhfb,
  keywords =     "na; rounding error",
}

@Article{Brown:1978:SPA,
  author =       "W. S. Brown",
  title =        "The Subresultant {PRS} Algorithm",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "237--249",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gustavson:1978:TFA,
  author =       "Fred G. Gustavson",
  title =        "Two Fast Algorithms for Sparse Matrices:
                 Multiplication and Permuted Transposition",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "250--269",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Chen:1978:PPB,
  author =       "S. C. Chen and D. J. Kuck and A. H. Sameh",
  title =        "Practical Parallel Band Triangular Systems Solvers",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "270--277",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:35:36 1994",
  acknowledgement = ack-nhfb,
  keywords =     "linear system; nla; prll; tridiagonal matrix",
}

@Article{Ward:1978:ECS,
  author =       "R. C. Ward and L. J. Gray",
  title =        "Eigensystem Computation for Skew-Symmetric and a Class
                 of Symmetric Matrices",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "278--285",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:37:26 1994",
  acknowledgement = ack-nhfb,
  keywords =     "eig; nla; skew-symmetric matrix; symmetric matrix",
}

@Article{Ward:1978:AAC,
  author =       "R. C. Ward and L. J. Gray",
  title =        "Algorithm 530: An Algorithm for Computing the
                 Eigensystem of Skew-Symmetric Matrices and a Class of
                 Symmetric Matrices [{F2}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "286--289",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:37:47 1994",
  acknowledgement = ack-nhfb,
}

@Article{Snyder:1978:ACP,
  author =       "William V. Snyder",
  title =        "Algorithm 531: Contour Plotting [{J6}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "290--294",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:38:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Coleman:1978:RSN,
  author =       "John P. Coleman",
  title =        "Remark on ``{Algorithm} 49: Spherical {Neumann}
                 Function''",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "295--295",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See \cite{Herndon:1961:SNF}.",
  acknowledgement = ack-nhfb,
}

@Article{Gustavson:1978:RSM,
  author =       "Fred G. Gustavson",
  title =        "Remark on ``{Algorithm} 408: {A} Sparse Matrix Package
                 (Part {I}) [{F4}]''",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "295--295",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See \cite{McNamee:1971:SMP}.",
  acknowledgement = ack-nhfb,
}

@Article{Schoene:1978:RMI,
  author =       "Andrew Y. Schoene",
  title =        "Remark on ``{Algorithm} 435: Modified Incomplete Gamma
                 Function [{S14}]''",
  journal =      j-TOMS,
  volume =       "4",
  number =       "3",
  pages =        "296--304",
  month =        sep,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See \cite{Fullerton:1972:MIG}.",
  acknowledgement = ack-nhfb,
}

@Article{Baker:1978:SAC,
  author =       "Christopher T. H. Baker and Malcolm S. Keech",
  title =        "Stability Analysis of Certain {Runge-Kutta} Procedures
                 for {Volterra} Integral Equations",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "305--315",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Fairweather:1978:IRQ,
  author =       "Graeme Fairweather",
  title =        "An Investigation of {Romberg} Quadrature",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "316--322",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Shampine:1978:SPA,
  author =       "Lawrence F. Shampine",
  title =        "Stability Properties of {Adams} Codes",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "323--329",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Sherman:1978:ASG,
  author =       "Andrew H. Sherman",
  title =        "Algorithms for Sparse {Gaussian} Elimination with
                 Partial Pivoting",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "330--338",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Tendler:1978:SSI,
  author =       "Joel M. Tendler and Theodore A. Bickart and Zdenek
                 Picel",
  title =        "A Stiffly Stable Integration Process Using Cyclic
                 Composite Methods",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "339--368",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Miller:1978:SRA,
  author =       "Webb Miller and David Spooner",
  title =        "Software for Roundoff Analysis, {II}",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "369--387",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:48:16 1994",
  acknowledgement = ack-nhfb,
  keywords =     "cs; rounding error; software",
}

@Article{Miller:1978:ASR,
  author =       "Webb Miller and David Spooner",
  title =        "Algorithm 532: Software for Roundoff Analysis [{Z}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "388--390",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:48:45 1994",
  acknowledgement = ack-nhfb,
}

@Article{Sherman:1978:ANF,
  author =       "Andrew H. Sherman",
  title =        "Algorithm 533: {NSPIV}, {A Fortran} Subroutine for
                 Sparse {Gaussian} Elimination with Partial Pivoting
                 [{F4}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "391--398",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:49:20 1994",
  acknowledgement = ack-nhfb,
}

@Article{Tendler:1978:ASS,
  author =       "Joel M. Tendler and Theodore A. Bickart and Zdenek
                 Picel",
  title =        "Algorithm 534: {STINT}: {STiff} (differential
                 equations) {INTegrator} [{D2}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "399--403",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:50:02 1994",
  acknowledgement = ack-nhfb,
}

@Article{Garbow:1978:AQA,
  author =       "Burton S. Garbow",
  title =        "Algorithm 535: The {QZ} Algorithm to Solve the
                 Generalized Eigenvalue Problem for Complex Matrices
                 [{F2}]",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "404--410",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:40:17 1994",
  note =         "See also \cite{Garbow:1982:RQA,Garbow:1984:RQA}.",
  acknowledgement = ack-nhfb,
}

@Article{Amos:1978:ECS,
  author =       "Donald E. Amos",
  title =        "Erratum: ``{Algorithm} 511: {CDC} 6600 Subroutines
                 {IBESS} and {JBESS} for {Bessel} Functions {$I_\nu(x)$}
                 and {$J_\nu(x)$}, {$x\ge0,\nu\ge0$} [{S18}]''",
  journal =      j-TOMS,
  volume =       "4",
  number =       "4",
  pages =        "411--411",
  month =        dec,
  year =         "1978",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See \cite{Amos:1977:ACS}.",
  acknowledgement = ack-nhfb,
}

@Article{Zave:1979:DAP,
  author =       "Pamela Zave and Werner C. Rheinboldt",
  title =        "Design of an Adaptive, Parallel Finite-Element
                 System",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "1--17",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Duff:1979:SDF,
  author =       "I. S. Duff and J. K. Reid",
  title =        "Some Design Features of a Sparse Matrix Code",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "18--35",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Proskurowski:1979:NSH,
  author =       "Wlodzimierz Proskurowski",
  title =        "Numerical Solution of {Helmholtz}'s Equation by
                 Implicit Capacitance Matrix Methods",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "36--49",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Yohe:1979:SIA,
  author =       "J. M. Yohe",
  title =        "Software for Interval Arithmetic: {A} Reasonably
                 Portable Package",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "50--63",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:55:38 1994",
  acknowledgement = ack-nhfb,
  keywords =     "interval arithmetic; na; software",
}

@Article{More:1979:NSN,
  author =       "Jorge J. Mor{\'{e}} and Michel Y. Cosnard",
  title =        "Numerical Solution of Nonlinear Equations",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "64--85",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Kahaner:1979:EAD,
  author =       "David K. Kahaner and Mark B. Wells",
  title =        "An Experimental Algorithm for ${N}$-Dimensional
                 Adaptive Quadrature",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "86--96",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:41:04 1994",
  acknowledgement = ack-nhfb,
}

@Article{Knoble:1979:EOW,
  author =       "H. D. Knoble and C. {Forney, Jr.} and F. S. Bader",
  title =        "An Efficient One-Way Enciphering Algorithm",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "97--107",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Knoble:1979:AEO,
  author =       "H. D. Knoble",
  title =        "Algorithm 536: An Efficient One-Way Enciphering
                 Algorithm [{Z}]",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "108--111",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:58:53 1994",
  acknowledgement = ack-nhfb,
}

@Article{Leeb:1979:ACV,
  author =       "Walter R. Leeb",
  title =        "Algorithm 537: Characteristic Values of {Mathieu}'s
                 Differential Equation",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "112--117",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Nikolai:1979:AEE,
  author =       "Paul J. Nikolai",
  title =        "Algorithm 538: Eigenvectors and Eigenvalues of Real
                 Generalized Symmetric Matrices by Simultaneous
                 Iteration [{F2}]",
  journal =      j-TOMS,
  volume =       "5",
  number =       "1",
  pages =        "118--125",
  month =        mar,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Krogh:1979:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "129--131",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:01:38 1994",
  acknowledgement = ack-nhfb,
}

@Article{Schrage:1979:MPF,
  author =       "Linus Schrage",
  title =        "A More Portable {Fortran} Random Number Generator",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "132--138",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{George:1979:DUI,
  author =       "Alan George and Joseph W. H. Liu",
  title =        "The Design of a User Interface for a Sparse Matrix
                 Package",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "139--162",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{Payne:1979:CG,
  author =       "W. H. Payne and F. M. Ives",
  title =        "Combination Generators",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "163--172",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 23:13:25 1994",
  acknowledgement = ack-nhfb,
}

@Article{deBoor:1979:ECM,
  author =       "Carl de Boor",
  title =        "Efficient Computer Manipulation of Tensor Products",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "173--182",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{Cleary:1979:AAF,
  author =       "John Gerald Cleary",
  title =        "Analysis of an Algorithm for Finding Nearest Neighbors
                 in {Euclidean} Space",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "183--192",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Crowder:1979:RCE,
  author =       "Harlan Crowder and Ron S. Dembo and John M. Mulvey",
  title =        "On Reporting Computational Experiments with
                 Mathematical Software",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "193--203",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Crary:1979:VPN,
  author =       "Fred D. Crary",
  title =        "A Versatile Precompiler for Nonstandard Arithmetics",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "204--217",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Geddes:1979:SCP,
  author =       "K. O. Geddes",
  title =        "Symbolic Computation of Pad{\'{e}} Approximants",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "218--233",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Bogen:1979:ASI,
  author =       "Richard A. Bogen",
  title =        "Addendum to ``{Analytically} Solving Integral
                 Equations by Using Computer Algebra''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "234--237",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:07:40 1994",
  acknowledgement = ack-nhfb,
}

@Article{Lozy:1979:RSD,
  author =       "Mohamed el Lozy",
  title =        "Remark on ``{Algorithm} 395: {Student}'s
                 $t$-Distribution'' and Remark on ``{Algorithm} 396:
                 {Student}'s Quantiles [{S14}]''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "238--239",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See
                 \cite{Hill:1970:SD,Hill:1970:SQ,Hill:1981:RSD,Hill:1985:RCS}.",
  acknowledgement = ack-nhfb,
}

@Article{Geddes:1979:RCC,
  author =       "K. O. Geddes",
  title =        "Remark on ``{Algorithm} 424: {Clenshaw-Curtis}
                 Quadrature [{O1}]''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "240--240",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See \cite{Gentleman:1972:CCQ}.",
  acknowledgement = ack-nhfb,
}

@Article{Anderson:1979:RBI,
  author =       "M. R. Anderson",
  title =        "Remark on ``{Algorithm} 474: Bivariate Interpolation
                 and Smooth Surface Fitting Based on Local
                 Procedures''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "241--241",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:02 1994",
  note =         "See \cite{Akima:1974:BIS}.",
  acknowledgement = ack-nhfb,
}

@Article{Akima:1979:RBI,
  author =       "Hiroshi Akima",
  title =        "Remark on ``{Algorithm} 526: Bivariate Interpolation
                 and Smooth Surface Fitting for Irregularly Distributed
                 Data Points [{E1}]''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "2",
  pages =        "242--243",
  month =        jun,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:03 1994",
  note =         "See \cite{Akima:1978:ABI,Preusser:1985:RBI}.",
  acknowledgement = ack-nhfb,
}

@Article{Shampine:1979:SRR,
  author =       "L. F. Shampine",
  title =        "Storage Reduction for {Runge-Kutta} Codes",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "245--250",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ehrlich:1979:SBE,
  author =       "L. W. Ehrlich",
  title =        "Solving the Biharmonic Equation on Irregular Regions",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "251--258",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gill:1979:DSF,
  author =       "Philip E. Gill and Walter Murray and Susan M. Picken
                 and Margaret H. Wright",
  title =        "The Design and Structure of a {Fortran} Program
                 Library for Optimization",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "259--283",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{George:1979:IPN,
  author =       "Alan George and Joseph W. H. Liu",
  title =        "An Implementation of a Pseudoperipheral Node Finder",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "284--295",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Bennett:1979:SPE,
  author =       "James Michael Bennett and Robert Neff Bryan",
  title =        "A Single-Point Exchange Algorithm for Approximating
                 Functions of Two Variables",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "296--307",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:06:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Lawson:1979:BLA,
  author =       "C. L. Lawson and R. J. Hanson and D. R. Kincaid and F.
                 T. Krogh",
  title =        "{Basic Linear Algebra Subprograms} for {Fortran}
                 Usage",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "308--323",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 19:42:33 1994",
  acknowledgement = ack-nhfb,
  keywords =     "blas; nla; software",
}

@Article{Lawson:1979:ABL,
  author =       "C. L. Lawson and R. J. Hanson and D. R. Kincaid and F.
                 T. Krogh",
  title =        "Algorithm 539: {Basic Linear Algebra Subprograms} for
                 {Fortran} Usage [{F1}]",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "324--325",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 21:11:34 1994",
  note =         "See also
                 \cite{Dodson:1982:RBL,Dodson:1983:CRB,Hanson:1987:ATA,Louter-Nool:1988:ATA}.",
  acknowledgement = ack-nhfb,
}

@Article{Madsen:1979:APG,
  author =       "N. K. Madsen and R. F. Sincovec",
  title =        "Algorithm 540: {PDECOL}, General Collocation Software
                 for Partial Differential Equations [{D3}]",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "326--351",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:21:53 1994",
  note =         "See also \cite{Hopkins:1992:RPG}.",
  acknowledgement = ack-nhfb,
}

@Article{Swartztrauber:1979:AEF,
  author =       "Paul N. Swartztrauber and Roland A. Sweet",
  title =        "Algorithm 541: Efficient {Fortran} Subprograms for the
                 Solution of Separable Elliptic Partial Differential
                 Equations [{D3}]",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "352--364",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 19:43:36 1994",
  acknowledgement = ack-nhfb,
}

@Article{Steuerwalt:1979:CEF,
  author =       "Michael Steuerwalt",
  title =        "Certification of ``{Algorithm} 541: Efficient
                 {Fortran} Subprograms for the Solution of Separable
                 Elliptic Partial Differential Equations [{D3}]''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "365--371",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 24 09:58:08 1996",
  acknowledgement = ack-nhfb,
}

@Article{Larson:1979:ECE,
  author =       "John Larson",
  title =        "Errata: ``{Efficient} Calculation of the Effects of
                 Roundoff Errors''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "3",
  pages =        "372--372",
  month =        sep,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:07:42 1994",
  note =         "See \cite{Larson:1978:ECE}.",
  acknowledgement = ack-nhfb,
}

@Article{Gear:1979:EN,
  author =       "C. W. Gear",
  title =        "Editor's Note",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "373--373",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:32:50 1994",
  acknowledgement = ack-nhfb,
}

@Article{Enright:1979:APS,
  author =       "W. H. Enright and M. S. Kamel",
  title =        "Automatic Partitioning of Stiff Systems and Exploiting
                 the Resulting Structure",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "374--385",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:32:50 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gladwell:1979:IVR,
  author =       "Ian Gladwell",
  title =        "Initial Value Routines in the {NAG} Library",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "386--400",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:32:50 1994",
  acknowledgement = ack-nhfb,
}

@Article{Zlatev:1979:ASD,
  author =       "Zahari Zlatev and Per Grove Thomsen",
  title =        "Automatic Solution of Differential Equations Based on
                 the User of Linear Multistep Methods",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "401--414",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:32:50 1994",
  acknowledgement = ack-nhfb,
}

@Article{Stetter:1979:GEE,
  author =       "Hans J. Stetter",
  title =        "Global Error Estimation in {Adams PC}-Codes",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "415--430",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:32:50 1994",
  acknowledgement = ack-nhfb,
}

@Article{Houstis:1979:HOF,
  author =       "E. N. Houstis and T. S. Papatheodorou",
  title =        "High-Order Fast Elliptic Equation Solvers",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "431--441",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:32:50 1994",
  acknowledgement = ack-nhfb,
}

@Article{Kaufman:1979:ADH,
  author =       "L. Kaufman",
  title =        "Application of Dense {Householder} Transformation to a
                 Sparse Matrix",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "442--450",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:08 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Householder transformation; nla; qrd; sparse",
}

@Article{Rayward-Smith:1979:CSN,
  author =       "V. J. Rayward-Smith",
  title =        "On Computing the {Smith} Normal Form of an Integer
                 Matrix",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "451--456",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:32:50 1994",
  acknowledgement = ack-nhfb,
}

@Article{Wampler:1979:SWL,
  author =       "Roy H. Wampler",
  title =        "Solutions to Weighted Least Squares Problems by
                 Modified {Gram-Schmidt} with Iterative Refinement",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "457--465",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 19:44:12 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Gram-Schmidt algorithm; iterative refinement; lsq;
                 nla; qrd; weights",
}

@Article{Gautschi:1979:CPI,
  author =       "Walter Gautschi",
  title =        "A Computational Procedure for Incomplete Gamma
                 Functions",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "466--481",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:32:50 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gautschi:1979:AIG,
  author =       "W. Gautschi",
  title =        "Algorithm 542: Incomplete Gamma Functions [{S14}]",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "482--489",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:39:50 1994",
  acknowledgement = ack-nhfb,
}

@Article{Houstis:1979:AFF,
  author =       "E. N. Houstis and T. S. Papatheodorou",
  title =        "Algorithm 543: {FFT9}, Fast Solution of
                 {Helmholtz}-Type Partial Differential Equations
                 [{D3}]",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "490--493",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:40:38 1994",
  acknowledgement = ack-nhfb,
}

@Article{Wampler:1979:ALL,
  author =       "Roy H. Wampler",
  title =        "Algorithm 544: {L2A} and {L2B}, Weighted Least Squares
                 Solutions by Modified {Gram-Schmidt} with Iterative
                 Refinement [{F4}]",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "494--499",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:04:18 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Gram-Schmidt algorithm; iterative refinement; lsq;
                 nla; qrd; weights",
}

@Article{Fraser:1979:AOM,
  author =       "D. Fraser",
  title =        "Algorithm 545: An Optimized Mass Storage {FFT}
                 [{C6}]",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "500--517",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Aug 28 00:41:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Brent:1979:RMF,
  author =       "R. P. Brent",
  title =        "Remark on ``{Algorithm} 524: {MP}, {A Fortran}
                 Multiple-Precision Arithmetic Package [{A1}]''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "518--519",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:03 1994",
  note =         "See \cite{Brent:1978:AMF,Brent:1980:AIB}.",
  acknowledgement = ack-nhfb,
}

@Article{Leathers:1979:RAS,
  author =       "Burton L. Leathers",
  title =        "Remark on ``{Algorithm} 513: Analysis of In-Situ
                 Transposition [{F1}]'' and Remark on ``{Algorithm} 467:
                 Matrix Transposition in Place''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "520--520",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:03 1994",
  note =         "See \cite{Cate:1977:AAS,Brenner:1973:MTP}.",
  acknowledgement = ack-nhfb,
}

@Article{Swieten:1979:RVS,
  author =       "A. C. M. van Swieten and J. Th. M. de Hosson",
  title =        "Remark on ``{Algorithm} 475: Visible Surface Plotting
                 Program''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "521--523",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:03 1994",
  note =         "See \cite{Wright:1974:VSP}.",
  acknowledgement = ack-nhfb,
}

@Article{Fox:1979:RFP,
  author =       "Phyllis Fox",
  title =        "Remark on ``{Algorithm} 528: Framework for a Portable
                 Library [{Z}]''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "524--524",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:06 1994",
  note =         "See \cite{Fox:1978:AFP}.",
  acknowledgement = ack-nhfb,
}

@Article{deBoor:1979:CCM,
  author =       "Carl de Boor",
  title =        "Corrigenda: ``{Efficient} Computer Manipulation of
                 Tensor Products''",
  journal =      j-TOMS,
  volume =       "5",
  number =       "4",
  pages =        "525--525",
  month =        dec,
  year =         "1979",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:07:45 1994",
  note =         "See \cite{deBoor:1979:ECM}.",
  acknowledgement = ack-nhfb,
}

@Article{Cheung:1980:CCE,
  author =       "To-Yat Cheung",
  title =        "Computational Comparison of Eight Methods for the
                 Maximum Network Flow Problem",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "1--16",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 08:58:06 1994",
  acknowledgement = ack-nhfb,
  keywords =     "breadth-first; computational comparison; depth-first;
                 Dinic; Karzanov; Kinariwala-Rao; maximum network flow",
}

@Article{Ho:1980:CST,
  author =       "James K. Ho and Etienne Loute",
  title =        "A Comparative Study of Two Methods for Staircase
                 Linear Problems",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "17--30",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 08:58:06 1994",
  acknowledgement = ack-nhfb,
  keywords =     "comparison of algorithms; decomposition;
                 factorization; large-scale systems; structured linear
                 programs",
}

@Article{Michaels:1980:MPG,
  author =       "William M. Michaels and Richard P. O'Neill",
  title =        "A Mathematical Program Generator {MPGENR}",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "31--44",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 08:58:06 1994",
  acknowledgement = ack-nhfb,
  keywords =     "large-scale optimization; linear and nonlinear
                 programming; software verification; test problem
                 generation",
}

@Article{Chung:1980:ACF,
  author =       "Won L. Chung",
  title =        "Automatic Curve Fittings Using an Adaptive Local
                 Algorithm",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "45--57",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:55:50 1994",
  acknowledgement = ack-nhfb,
  keywords =     "adaptive approximation; automatic curve fitting; data
                 compression; interactive display; ${L}_2$ approximation
                 with continuity constraints; modeling and simulation
                 systems; numerical stability; one-sided algorithm;
                 piecewise cubic polynomials",
}

@Article{Clark:1980:REV,
  author =       "Gordon M. Clark",
  title =        "Recursive Estimation of the Variance of the Sample
                 Average",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "58--67",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 08:58:06 1994",
  acknowledgement = ack-nhfb,
  keywords =     "recursive calculation; sample autocovariances;
                 simulation output analysis; variance estimation",
}

@Article{Power:1980:ISU,
  author =       "Leigh R. Power",
  title =        "Internal Sorting Using a Minimal Tree Merge Strategy",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "68--79",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 08:58:06 1994",
  acknowledgement = ack-nhfb,
  keywords =     "internal sort; linked list; list processing; merge;
                 minimal tree; natural merge sort; sort; straight merge
                 sort",
}

@Article{deBoor:1980:SPS,
  author =       "Carl de Boor and Richard Weiss",
  title =        "{SOLVEBLOK}: {A} Package for Solving Almost Block
                 Diagonal Linear Systems",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "80--87",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:25:20 1994",
  acknowledgement = ack-nhfb,
  keywords =     "almost block diagonal systems; Gaussian elimination;
                 ordinary differential equations; spline approximation",
}

@Article{deBoor:1980:AS,
  author =       "Carl de Boor and Richard Weiss",
  title =        "Algorithm 546: {SOLVEBLOK} [{F4}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "88--91",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:28:17 1994",
  acknowledgement = ack-nhfb,
  keywords =     "almost block diagonal systems; Gaussian elimination;
                 ordinary differential equations; spline approximation",
}

@Article{Duris:1980:AFR,
  author =       "Charles S. Duris",
  title =        "Algorithm 547: {FORTRAN} Routines for Discrete Cubic
                 Spline Interpolation and Smoothing [{E1}], [{E3}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "92--103",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:29:10 1994",
  acknowledgement = ack-nhfb,
  keywords =     "discrete cubic splines; discrete natural splines;
                 discrete splines; interpolation; smoothing",
}

@Article{Carpaneto:1980:ASA,
  author =       "Giorgio Carpaneto and Paolo Toth",
  title =        "Algorithm 548: Solution of the Assignment Problem
                 [{H}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "104--111",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:29:23 1994",
  acknowledgement = ack-nhfb,
  keywords =     "assignment problem; Hungarian algorithm",
}

@Article{Eckhardt:1980:AWE,
  author =       "Ulrich Eckhardt",
  title =        "Algorithm 549: {Weierstrass}' Elliptic Functions
                 [{S21}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "112--120",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:31:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Weierstrass' elliptic functions",
}

@Article{Messner:1980:ASP,
  author =       "A. M. Messner and G. Q. Taylor",
  title =        "Algorithm 550: Solid Polyhedron Measure [{Z}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "121--130",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 14:44:11 1994",
  acknowledgement = ack-nhfb,
  keywords =     "graphics; numerical integration; polyhedron",
}

@Article{Anonymous:1980:AAD,
  author =       "{Anonymous}",
  title =        "{ACM Algorithms Distribution Service} Expanded",
  journal =      j-TOMS,
  volume =       "6",
  number =       "1",
  pages =        "131--132",
  month =        mar,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 08:58:06 1994",
  acknowledgement = ack-nhfb,
}

@Article{Chan:1980:NLS,
  author =       "Tony F. Chan and William M. {Coughran, Jr.} and Eric
                 H. Grosse and Michael T. Heath",
  title =        "A Numerical Library and Its Support",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "135--145",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:33:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "library management and organization; mathematical
                 software; numerical analysis",
}

@Article{Brent:1980:AIB,
  author =       "Richard P. Brent and Judith A. Hooper and J. Michael
                 Yohe",
  title =        "An {AUGMENT} Interface for {Brent}'s Multiple
                 Precision Arithmetic Package",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "146--149",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:33:27 1994",
  note =         "See \cite{Brent:1978:AMF,Brent:1979:RMF}.",
  acknowledgement = ack-nhfb,
  keywords =     "arithmetic; AUGMENT interface; extended precision;
                 floating point; multiple precision; portable software;
                 precompiler interface; software package",
}

@Article{Kedem:1980:ADC,
  author =       "Gershon Kedem",
  title =        "Automatic Differentiation of Computer Programs",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "150--165",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:33:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "automatic differentiation; factorable functions",
}

@Article{Rheinboldt:1980:DSA,
  author =       "Werner C. Rheinboldt and Charles K. Mesztenyi",
  title =        "On a Data Structure for Adaptive Finite Element Mesh
                 Refinements",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "166--187",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:33:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "access algorithms; finite elements; mesh refinements;
                 tree structure",
}

@Article{Verwer:1980:ICS,
  author =       "J. G. Verwer",
  title =        "An Implementation of a Class of Stabilized Explicit
                 Methods for the Time Integration of Parabolic
                 Equations",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "188--205",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:33:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "implementation of time integrators; numerical
                 analysis; parabolic partial differential equations;
                 semidiscretization",
}

@Article{Munksgaard:1980:SSS,
  author =       "N. Munksgaard",
  title =        "Solving Sparse Symmetric Sets of Linear Equations by
                 Preconditioned Conjugate Gradients",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "206--219",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:33:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "conjugate gradients; fixed space factorization; linear
                 equations; numerical drop tolerance modification;
                 positive definite; preconditioning; sparse",
}

@Article{Abdelmalek:1980:SOS,
  author =       "Nabih N. Abdelmalek",
  title =        "${L}_1$ Solution of Overdetermined Systems of Linear
                 Equations",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "220--227",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:33:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "discrete linear ${L}_1$ approximation; dual simplex
                 algorithms; linear programming; overdetermined system
                 of linear equations; triangular decomposition",
}

@Article{Abdelmalek:1980:AFS,
  author =       "Nabih N. Abdelmalek",
  title =        "Algorithm 551: {A FORTRAN} Subroutine for the ${L}_1$
                 Solution of Overdetermined Systems of Linear Equations
                 [{F4}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "228--230",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:44:41 1994",
  acknowledgement = ack-nhfb,
  keywords =     "discrete linear ${L}_1$ approximation; dual simplex
                 algorithms; linear programming; overdetermined system
                 of linear equations; triangular decomposition",
}

@Article{Barrodale:1980:ASC,
  author =       "I. Barrodale and F. D. K. Roberts",
  title =        "Algorithm 552: Solution of the Constrained $\ell_1$
                 Linear Approximation Problem [{F4}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "231--235",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:46:51 1994",
  acknowledgement = ack-nhfb,
  keywords =     "constrained $\ell_1$ approximation; linear
                 programming; simplex method",
}

@Article{Verwer:1980:AME,
  author =       "J. G. Verwer",
  title =        "Algorithm 553: {M3RK}, An Explicit Time Integrator for
                 Semidiscrete Parabolic Equations [{D3}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "236--239",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:49:22 1994",
  acknowledgement = ack-nhfb,
  keywords =     "explicit time integrator; parabolic partial
                 differential equations; semidiscretization",
}

@Article{More:1980:ABF,
  author =       "J. J. Mor{\'e} and M. Y. Cosnard",
  title =        "Algorithm 554: {BRENTM}, {A Fortran} Subroutine for
                 the Numerical Solution of Nonlinear Equations [{F5}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "240--251",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:49:42 1994",
  keywords =     "Brent's method; nonlinear equations; numerical
                 solution",
}

@Article{Watson:1980:ACY,
  author =       "L. T. Watson and D. Fenner",
  title =        "Algorithm 555: {Chow-Yorke} Algorithm for Fixed Points
                 or Zeros of ${C}^2$ Maps [{C5}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "2",
  pages =        "252--259",
  month =        jun,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 10:17:11 1994",
  acknowledgement = ack-nhfb,
  keywords =     "continuation method; fixed point; fixed points of
                 nonlinear systems; homotopy method; nonlinear systems;
                 parameterized nonlinear system; zero; zero curve of a
                 homotopy map; zeros of nonlinear systems",
}

@Article{Gear:1980:RKS,
  author =       "C. W. Gear",
  title =        "{Runge-Kutta} Starters for Multistep Methods",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "263--279",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "integration; multistep; ordinary differential
                 equations; Runge-Kutta",
}

@Article{Barton:1980:TSS,
  author =       "David Barton",
  title =        "On {Taylor} Series and Stiff Equations",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "280--294",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "stiff ordinary differential equations; Taylor series",
}

@Article{Jackson:1980:AIV,
  author =       "K. R. Jackson and R. Sacks-Davis",
  title =        "An Alternative Implementation of Variable Step-Size
                 Multistep Formulas for Stiff {ODEs}",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "295--318",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "backward differential formulas; stiff ODEs; variable
                 step-size methods",
}

@Article{Gupta:1980:NAO,
  author =       "G. K. Gupta",
  title =        "A Note About Overhead Costs in {ODE} Solvers",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "319--326",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Adams methods; mathematical software; ordinary
                 differential equations; Runge-Kutta methods; software
                 evaluation",
}

@Article{Coleman:1980:SSI,
  author =       "David Coleman and Paul Holland and Neil Kaden and
                 Virginia Klema and Stephen C. Peters",
  title =        "A System of Subroutines for Iteratively Reweighted
                 Least Squares Computations",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "327--336",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "curve fitting; data analysis; least squares; linear
                 algebra; mathematical software; portability; robust
                 estimation; weight functions",
}

@Article{George:1980:FIM,
  author =       "Alan George and Joseph W. H. Liu",
  title =        "A Fast Implementation of the Minimum Degree Algorithm
                 Using Quotient Graphs",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "337--358",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "graph algorithms; mathematical software; ordering
                 algorithms; quotient graphs; sparse linear equations",
}

@Article{Bentley:1980:GSL,
  author =       "Jon Louis Bentley and James B. Saxe",
  title =        "Generating Sorted Lists of Random Numbers",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "359--364",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "linear-time algorithm; probabilistic methods in
                 algorithm design; random number generation; sorting",
}

@Article{Amos:1980:CEI,
  author =       "Donald E. Amos",
  title =        "Computation of Exponential Integrals",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "365--377",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "exponential integral; Miller algorithm; recursion;
                 Taylor series",
}

@Article{Arthur:1980:PPA,
  author =       "Jeffrey L. Arthur and A. Ravindran",
  title =        "{PAGP}, {A} Partitioning Algorithm for (Linear) Goal
                 Programming Problems",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "378--386",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "constraint partitioning; goal program; multiple
                 objective optimization; simplex method",
}

@Article{Cheung:1980:MLP,
  author =       "To-Yat Cheung",
  title =        "Multifacility Location Problem with Rectilinear
                 Distance by the Minimum-Cut Approach",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "387--390",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "minimum cut; multifacility; optimal location;
                 rectilinear distance",
}

@Article{Betts:1980:CAC,
  author =       "J. T. Betts",
  title =        "A Compact Algorithm for Computing the Stationary Point
                 of a Quadratic Function Subject to Linear Constraints",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "391--397",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 10:57:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "orthogonal decomposition; quadratic programming",
}

@Article{Kaagstroem:1980:ANC,
  author =       "Bo K{\aa}gstr{\"o}m and Axel Ruhe",
  title =        "An Algorithm for Numerical Computation of the {Jordan}
                 Normal Form of a Complex Matrix",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "398--419",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:10 1994",
  acknowledgement = ack-nhfb,
  keywords =     "block diagonal form; canonical form; eig; eigenvalues;
                 eigenvectors; Jordan form; Jordan normal form; nla;
                 numerical multiple eigenvalues; principal vectors;
                 software",
}

@Article{Amos:1980:AEI,
  author =       "Donald E. Amos",
  title =        "Algorithm 556: Exponential Integrals [{S13}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "420--428",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:13:05 1994",
  note =         "See remark in \cite{Amos:1983:REI}.",
  acknowledgement = ack-nhfb,
  keywords =     "confluent hypergeometric functions; exponential
                 integrals; Miller algorithm",
}

@Article{Arthur:1980:APP,
  author =       "J. L. Arthur and A. Ravindran",
  title =        "Algorithm 557: {PAGP}, {A} Partitioning Algorithm for
                 (Linear) Goal Programming Problems [{H}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "429--429",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:13:53 1994",
  acknowledgement = ack-nhfb,
  keywords =     "constraint partitioning; goal program; multiple
                 objective optimization; simplex method",
}

@Article{Cheung:1980:APM,
  author =       "To-Yat Cheung",
  title =        "Algorithm 558: {A} Program for the Multifacility
                 Location Problem with Rectilinear Distance by the
                 Minimum-Cut Approach [{H}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "430--431",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:14:45 1994",
  acknowledgement = ack-nhfb,
  keywords =     "minimum cut; multifacility; optimal location;
                 rectilinear distance",
}

@Article{Betts:1980:ASP,
  author =       "J. T. Betts",
  title =        "Algorithm 559: The Stationary Point of a Quadratic
                 Function Subject to Linear Constraints [{E4}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "432--436",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:15:40 1994",
  acknowledgement = ack-nhfb,
  keywords =     "orthogonal decomposition; quadratic programming",
}

@Article{Kaagstroem:1980:AJA,
  author =       "Bo K{\aa{}}gstr{\"o}m and Axel Ruhe",
  title =        "Algorithm 560: {JNF}, An Algorithm for Numerical
                 Computation of the {Jordan} Normal Form of a Complex
                 Matrix [{F2}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "437--443",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 15:16:29 1994",
  acknowledgement = ack-nhfb,
  keywords =     "block diagonal form; canonical form; eig; eigenvalues;
                 eigenvectors; Jordan form; Jordan normal form; nla;
                 principal vectors; software",
}

@Article{Kahaner:1980:AFI,
  author =       "D. K. Kahaner",
  title =        "Algorithm 561: {FORTRAN} Implementation of Heap
                 Programs for Efficient Table Maintenance [{Z}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "444--449",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:17:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "heap; table maintenance",
}

@Article{Pape:1980:ASP,
  author =       "U. Pape",
  title =        "Algorithm 562: Shortest Path Lengths [{H}]",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "450--455",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:17:56 1994",
  note =         "See also \cite{Pape:1983:RSP}.",
  acknowledgement = ack-nhfb,
  keywords =     "shortest path; shortest route problem",
}

@Article{Harms:1980:RSM,
  author =       "U. Harms and H. Kollakowski and G. M{\"{o}}ller",
  title =        "Remark on ``{Algorithm} 408: {A} Sparse Matrix Package
                 (Part 1) [{F4}]''",
  journal =      j-TOMS,
  volume =       "6",
  number =       "3",
  pages =        "456--457",
  month =        sep,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:06 1994",
  note =         "See \cite{McNamee:1971:SMP}.",
  acknowledgement = ack-nhfb,
}

@Article{Machura:1980:SSP,
  author =       "Marek Machura and Roland A. Sweet",
  title =        "A Survey of Software for Partial Differential
                 Equations",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "461--488",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:23:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "partial differential equations; software; survey",
}

@Article{Kurator:1980:PIS,
  author =       "William G. Kurator and Richard P. O'Neill",
  title =        "{PERUSE}: An Interactive System for Mathematical
                 Programs",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "489--509",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:23:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "interactive mathematical programming; model auditing;
                 model debugging; model verification",
}

@Article{Brown:1980:EPB,
  author =       "W. S. Brown and S. I. Feldman",
  title =        "Environment Parameters and Basic Functions for
                 Floating-Point Computation",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "510--523",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:23:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "environment parameters; floating-point arithmetic;
                 software portability",
}

@Article{Luk:1980:CSV,
  author =       "Franklin T. Luk",
  title =        "Computing the Singular-Value Decomposition on the
                 {ILLIAC IV}",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "524--539",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:27:44 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Golub-Reinsch algorithm; Illiac; ILLIAC IV computer;
                 Jacobi-like method; nla; parallel matrix computations;
                 prll; singular-value decomposition; svd",
}

@Article{Sacks-Davis:1980:FLC,
  author =       "R. Sacks-Davis",
  title =        "Fixed Leading Coefficient Implementation of
                 {SD}-Formulas for Stiff {ODEs}",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "540--562",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:23:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "ordinary differential equations; second-derivative
                 method",
}

@Article{Bentley:1980:OET,
  author =       "Jon Louis Bentley and Bruce W. Weide and Andrew C.
                 Yao",
  title =        "Optimal Expected-Time Algorithms for Closest Point
                 Problems",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "563--580",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:23:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "closest point problems; computational geometry;
                 minimum spanning trees; nearest neighbor searching;
                 optimal algorithms; probabilistic analysis of
                 algorithms; Voronoi diagrams",
}

@Article{Campbell:1980:TAM,
  author =       "J. B. Campbell",
  title =        "On {Temme}'s Algorithm for the Modified {Bessel}
                 Function of the Third Kind",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "581--586",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:23:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "mathematical software; Miller's algorithm; modified
                 Bessel functions of the third kind",
}

@Article{Hoffman:1980:TPG,
  author =       "K. L. Hoffman and D. R. Shier",
  title =        "A Test Problem Generator for Discrete Linear ${L}_1$
                 Approximation Problems",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "587--593",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:23:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "${L}_1$ approximation; least absolute deviation;
                 problem generator; test data",
}

@Article{Bartels:1980:LCD,
  author =       "Richard H. Bartels and Andrew R. Conn",
  title =        "Linearly Constrained Discrete $\ell_1$ Problems",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "594--608",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 15:41:12 1994",
  acknowledgement = ack-nhfb,
  keywords =     "data filling; discrete approximation; $\ell_1$ norm;
                 l1 approximation; linearly constrained approximation;
                 nlop; software",
}

@Article{Bartels:1980:APL,
  author =       "Richard H. Bartels and Andrew R. Conn",
  title =        "Algorithm 563: {A} Program for Linearly Constrained
                 Discrete $\ell_1$ Problems",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "609--614",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 11:34:09 1994",
  acknowledgement = ack-nhfb,
  keywords =     "discrete $\ell_1$ approximation; l1 approximation;
                 linear constraints; nlop; numerical analysis;
                 overdetermined linear systems; software",
}

@Article{Hoffman:1980:ATP,
  author =       "K. L. Hoffman and D. R. Shier",
  title =        "Algorithm 564: {A} Test Problem Generator for Discrete
                 Linear ${L}_1$ Approximation Problems",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "615--617",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  keywords =     "${L}_1$ approximation; least absolute deviation;
                 problem generator; test data",
}

@Article{Shanno:1980:RMU,
  author =       "D. F. Shanno and K. H. Phua",
  title =        "Remark on ``{Algorithm} 500: Minimization of
                 Unconstrained Multivariate Functions [{E4}]''",
  journal =      j-TOMS,
  volume =       "6",
  number =       "4",
  pages =        "618--622",
  month =        dec,
  year =         "1980",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:07:08 1994",
  note =         "See \cite{Shanno:1976:AMU}.",
  acknowledgement = ack-nhfb,
}

@Article{Hiebert:1981:EMS,
  author =       "K. L. Hiebert",
  title =        "An Evaluation of Mathematical Software that Solves
                 Nonlinear Least Squares Problems",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "1--16",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:46:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "augmented Gauss-Newton; Gauss-Newton;
                 Levenberg-Marquardt; lsq; nllsq; nlop; nonlinear data
                 fitting; nonlinear least squares; nonlinear regression;
                 quasi-Newton; software evaluation",
}

@Article{More:1981:TUO,
  author =       "Jorge J. Mor{\'{e}} and Burton S. Garbow and Kenneth
                 E. Hillstrom",
  title =        "Testing Unconstrained Optimization Software",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "17--41",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:02:12 1994",
  acknowledgement = ack-nhfb,
  keywords =     "nonlinear least squares; optimization software;
                 performance testing; systems of nonlinear equations;
                 unconstrained minimization",
}

@Article{Akl:1981:CCG,
  author =       "Selim G. Akl",
  title =        "A Comparison of Combination Generation Methods",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "42--45",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:02:12 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithm; combinations",
}

@Article{Fritsch:1981:DIU,
  author =       "F. N. Fritsch and D. K. Kahaner and J. N. Lyness",
  title =        "Double Integration Using One-Dimensional Adaptive
                 Quadrature Routines: {A} Software Interface Problem",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "46--75",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:07:46 1994",
  note =         "See also \cite{Fritsch:1981:CIU}.",
  acknowledgement = ack-nhfb,
  keywords =     "adaptive integration; automatic quadrature routine;
                 double integration; quadrature; software interface",
}

@Article{Friedman:1981:NPP,
  author =       "Jerome H. Friedman and Margaret H. Wright",
  title =        "A Nested Partitioning Procedure for Numerical Multiple
                 Integration",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "76--92",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:02:12 1994",
  acknowledgement = ack-nhfb,
  keywords =     "bounds-constrained optimization; numerical
                 integration; quadrature; recursive partitioning",
}

@Article{Smith:1981:ERA,
  author =       "J. M. Smith and F. W. J. Olver and D. W. Lozier",
  title =        "Extended-Range Arithmetic and Normalized {Legendre}
                 Polynomials",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "93--105",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:02:12 1994",
  acknowledgement = ack-nhfb,
  keywords =     "angular momentum; extended-range arithmetic; Legendre
                 polynomials; overflow; underflow",
}

@Article{Melgaard:1981:GST,
  author =       "David K. Melgaard and Richard F. Sincovec",
  title =        "General Software for Two-Dimensional Nonlinear Partial
                 Differential Equations",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "106--125",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:02:12 1994",
  acknowledgement = ack-nhfb,
  keywords =     "finite differences; method of lines; ordinary
                 differential equations; partial differential
                 equations",
}

@Article{Melgaard:1981:APS,
  author =       "David K. Melgaard and Richard F. Sincovec",
  title =        "Algorithm 565: {PDETWO}\slash {PSETM}\slash {GEARB}:
                 Solution of Systems of Two-Dimensional Nonlinear
                 Partial Differential Equations [{D3}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "126--135",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:16:02 1994",
  acknowledgement = ack-nhfb,
  keywords =     "finite differences; method of lines; ordinary
                 differential equations; partial differential
                 equations",
}

@Article{More:1981:AFS,
  author =       "J. J. Mor{\'e} and B. S. Garbow and K. E. Hillstrom",
  title =        "Algorithm 566: {FORTRAN} Subroutines for Testing
                 Unconstrained Optimization Software [{C5} [{E4}]]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "136--140",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:13:44 1994",
  note =         "See also \cite{Averbukh:1994:RA}.",
  acknowledgement = ack-nhfb,
  keywords =     "nonlinear least squares; optimization software;
                 performance testing; systems of nonlinear equations;
                 unconstrained minimization",
}

@Article{Lozier:1981:AER,
  author =       "D. W. Lozier and J. M. Smith",
  title =        "Algorithm 567: Extended-Range Arithmetic and
                 Normalized {Legendre} Polynomials [{A1}], [{C1}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "1",
  pages =        "141--146",
  month =        mar,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:17:34 1994",
  acknowledgement = ack-nhfb,
  keywords =     "angular momentum; extended-range arithmetic; Legendre
                 polynomials; overflow; underflow",
}

@Article{Golub:1981:BLM,
  author =       "Gene H. Golub and Franklin T. Luk and Michael L.
                 Overton",
  title =        "A Block {Lanczos} Method for Computing the Singular
                 Values and Corresponding Singular Vectors of a Matrix",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "149--169",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:47:15 1994",
  acknowledgement = ack-nhfb,
  keywords =     "block Lanczos method; Lanczos algorithm; large sparse
                 matrix; nla; singular values; singular vectors;
                 singular-value decomposition; svd; upper-triangular
                 band matrix",
}

@Article{Wang:1981:PMT,
  author =       "H. H. Wang",
  title =        "A Parallel Method for Tridiagonal Equations",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "170--183",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:19:35 1994",
  acknowledgement = ack-nhfb,
  keywords =     "cyclic reduction method; parallel computers; partition
                 method; recursive doubling method; tridiagonal
                 equations; vectors computers",
}

@Article{Stewart:1981:SIA,
  author =       "William J. Stewart and Alan Jennings",
  title =        "A Simultaneous Iteration Algorithm for Real Matrices",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "184--198",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:19:35 1994",
  acknowledgement = ack-nhfb,
  keywords =     "eigenvalues; eigenvectors; large sparse matrices; real
                 unsymmetric matrices; simultaneous iteration",
}

@Article{Hill:1981:EIR,
  author =       "Geoffrey W. Hill",
  title =        "Evaluation and Inversion of the Ratios of Modified
                 {Bessel} Functions, {$I_1(x)/I_0(x)$} and
                 {$I_{1.5}(x)/I_{0.5}(x)$}",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "199--208",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:19:35 1994",
  acknowledgement = ack-nhfb,
  keywords =     "approximation; backward recursion; continued
                 fractions; Fisher distribution; function inversion;
                 modified Bessel function ratios; Newton-Raphson; von
                 Mises distribution",
}

@Article{Ascher:1981:CSB,
  author =       "U. Ascher and J. Christiansen and R. D. Russell",
  title =        "Collocation Software for Boundary Value {ODE}'s",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "209--222",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:48:04 1994",
  acknowledgement = ack-nhfb,
  annote =       "collocation",
  keywords =     "B-spline; boundary-value problems; collocation; damped
                 Newton's method; error estimates; general-purpose code;
                 mesh selection; ordinary differential equations",
}

@Article{Ascher:1981:ACC,
  author =       "U. Ascher and J. Christiansen and R. D. Russell",
  title =        "Algorithm 569: {COLSYS}: Collocation Software for
                 Boundary-Value {ODEs} [{D2}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "223--229",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:26:51 1994",
  note =         "See also \cite{Hake:1986:RCC}.",
  acknowledgement = ack-nhfb,
  keywords =     "B-spline; boundary-value problems; collocation; damped
                 Newton's method; error estimates; general-purpose code;
                 mesh selection; ordinary differential equations",
}

@Article{Stewart:1981:ALS,
  author =       "William J. Stewart and Alan Jennings",
  title =        "Algorithm 570: {LOPSI}: {A} Simultaneous Iteration
                 Method for Real Matrices [{F2}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "230--232",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:27:33 1994",
  acknowledgement = ack-nhfb,
  keywords =     "eigenvalues; eigenvectors; large sparse matrices; real
                 unsymmetric matrices; simultaneous iteration",
}

@Article{Hill:1981:ASM,
  author =       "Geoffrey W. Hill",
  title =        "Algorithm 571: Statistics for von {Mises}' and
                 {Fisher}'s Distributions of Directions:
                 {$I_1(x)/I_0(x)$}, {$I_{1.5}(x)/I_{0.5}(x)$} and Their
                 Inverses [{S14}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "233--238",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:28:34 1994",
  acknowledgement = ack-nhfb,
  keywords =     "continued fraction; direction statistics; Fisher
                 distribution; function inversion; modified Bessel
                 function ratio; Newton-Raphson; von Mises
                 distribution",
}

@Article{OLeary:1981:ASH,
  author =       "Dianne P. O'Leary and Olof Widlund",
  title =        "Algorithm 572: Solution of the {Helmholtz} Equation
                 for the {Dirichlet} Problem on General Bounded
                 Three-Dimensional Regions [{D3}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "239--246",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:31:55 1994",
  acknowledgement = ack-nhfb,
  keywords =     "capacitance matrix; conjugate gradients; fast Poisson
                 solvers; Helmholtz equation",
}

@Article{Hill:1981:RSD,
  author =       "G. W. Hill",
  title =        "Remark on ``{Algorithm} 395: {Student}'s
                 $t$-Distribution''",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "247--249",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:07 1994",
  note =         "See \cite{Hill:1970:SD,Hill:1970:SQ,Lozy:1979:RSD}.",
  acknowledgement = ack-nhfb,
}

@Article{Hill:1981:RSQ,
  author =       "G. W. Hill",
  title =        "Remark on ``{Algorithm} 396: {Student}'s
                 $t$-Quantiles''",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "250--251",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:07 1994",
  note =         "See \cite{Hill:1970:SQ}.",
  acknowledgement = ack-nhfb,
}

@Article{Fritsch:1981:CIU,
  author =       "F. N. Fritsch",
  title =        "Corrigendum: ``{Double} Integration Using
                 One-Dimensional Adaptive Quadrature Routines: {A}
                 Software Interface Problem''",
  journal =      j-TOMS,
  volume =       "7",
  number =       "2",
  pages =        "252--252",
  month =        jun,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:19:35 1994",
  note =         "See \cite{Fritsch:1981:DIU}.",
  acknowledgement = ack-nhfb,
}

@Article{Ukkonen:1981:CER,
  author =       "Esko Ukkonen",
  title =        "On the Calculation of the Effects of Roundoff Errors",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "259--271",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:44:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "automatic roundoff analysis; numerical linear algebra;
                 numerical stability",
}

@Article{Linnainmaa:1981:SDP,
  author =       "Seppo Linnainmaa",
  title =        "Software for Doubled-Precision Floating-Point
                 Computations",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "272--283",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:44:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "exact multiplication; floating-point arithmetic;
                 rounding errors; software portability",
}

@Article{Lii:1981:CBC,
  author =       "K. S. Lii and K. N. Helland",
  title =        "Cross-Bispectrum Computation and Variance Estimation",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "284--294",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:44:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "bispectra; time series analysis",
}

@Article{Dew:1981:SLR,
  author =       "P. M. Dew and J. E. Walsh",
  title =        "A Set of Library Routines for Solving Parabolic
                 Equations in One Space Variable",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "295--314",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 11:51:54 1994",
  annote =       "parabolic equations",
  keywords =     "method of lines; parabolic equations",
}

@Article{Duff:1981:AOM,
  author =       "I. S. Duff",
  title =        "On Algorithms for Obtaining a Maximum Transversal",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "315--330",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:49:58 1994",
  acknowledgement = ack-nhfb,
  keywords =     "block-triangular form; maximum assignment; maximum
                 transversal; perm; sparse; sparse matrices; unsymmetric
                 permutations",
}

@Article{McAllister:1981:ACS,
  author =       "David F. McAllister and John A. Roulier",
  title =        "An Algorithm for Computing a Shape-Preserving
                 Osculatory Quadratic Spline",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "331--347",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:44:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Bernstein polynomial; convexity preserving; geometric
                 design; monotonicity preserving; osculation; parametric
                 curve; polynomial interpolation; shape preserving;
                 spline",
}

@Article{Dennis:1981:ANL,
  author =       "John E. {Dennis, Jr.} and David M. Gay and Roy E.
                 Welsch",
  title =        "An Adaptive Nonlinear Least-squares Algorithm",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "348--368",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:10 1994",
  acknowledgement = ack-nhfb,
  keywords =     "lsq; nllsq; nlop; nonlinear least squares; nonlinear
                 regression; quasi-Newton methods; secant methods;
                 unconstrained optimization",
}

@Article{Dennis:1981:ANE,
  author =       "John E. {Dennis, Jr.} and David M. Gay and Roy E.
                 Welsch",
  title =        "Algorithm 573: {NL2SOL}\emdash An Adaptive Nonlinear
                 Least-Squares Algorithm [{E4}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "369--383",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:52:21 1994",
  note =         "See also \cite{Gay:1983:RNE}.",
  acknowledgement = ack-nhfb,
  keywords =     "lsq; nllsq; nlop; nonlinear least squares; nonlinear
                 regression; quasi-Newton methods; secant methods;
                 software; unconstrained optimization",
}

@Article{McAllister:1981:ASP,
  author =       "D. F. McAllister and J. A. Roulier",
  title =        "Algorithm 574: Shape-Preserving Osculatory Quadratic
                 Splines [{E1}, {E2}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "384--386",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:55:24 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Bernstein polynomial; convexity preserving;
                 monotonicity preserving; osculation; polynomial
                 interpolation; shape preserving",
}

@Article{Duff:1981:APZ,
  author =       "I. S. Duff",
  title =        "Algorithm 575: Permutations for a Zero-Free Diagonal
                 [{F1}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "387--390",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:56:49 1994",
  acknowledgement = ack-nhfb,
  keywords =     "block triangular form; maximum assignment; maximum
                 transversal; sparse matrices; unsymmetric
                 permutations",
}

@Article{Barrodale:1981:AFP,
  author =       "I. Barrodale and G. F. Stuart",
  title =        "Algorithm 576: {A FORTRAN} Program for Solving {${\bf
                 Ax} = {\bf b}$} [{F4}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "391--397",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:57:25 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Gaussian elimination; linear equations; new pivoting
                 strategy",
}

@Article{Carlson:1981:AAI,
  author =       "B. C. Carlson and Elaine M. Notis",
  title =        "Algorithm 577: Algorithms for Incomplete Elliptic
                 Integrals [{S21}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "398--403",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 22:58:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "elliptic integrals; inverse circular functions;
                 inverse hyperbolic functions; logarithms;
                 $R$-functions",
}

@Article{Razaz:1981:RAF,
  author =       "M. Razaz and J. L. Schonfelder",
  title =        "Remark on ``{Algorithm} 498: {Airy} Functions Using
                 {Chebyshev} Series Approximations''",
  journal =      j-TOMS,
  volume =       "7",
  number =       "3",
  pages =        "404--405",
  month =        sep,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:07 1994",
  note =         "See \cite{Prince:1975:AAF}.",
  acknowledgement = ack-nhfb,
}

@Article{Shampine:1981:ETS,
  author =       "Lawrence F. Shampine",
  title =        "Evaluation of a Test Set for Stiff {ODE} Solvers",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "409--420",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:03:20 1994",
  acknowledgement = ack-nhfb,
  keywords =     "stiff; test set; testing ODE codes",
}

@Article{Neves:1981:CIE,
  author =       "Kenneth W. Neves",
  title =        "Control of Interpolatory Error in Retarded
                 Differential Equations",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "421--444",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:03:20 1994",
  acknowledgement = ack-nhfb,
  keywords =     "automatic step-size reduction; delay differential
                 equations; derivative jump discontinuities; local error
                 control; Runge-Kutta methods",
}

@Article{Brown:1981:SRM,
  author =       "W. S. Brown",
  title =        "A Simple but Realistic Model of Floating-Point
                 Computation",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "445--480",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:03:20 1994",
  acknowledgement = ack-nhfb,
  keywords =     "computer arithmetic; environment parameters; error
                 analysis; Euclidean norm; floating-point arithmetic;
                 software portability",
}

@Article{Marsten:1981:DXL,
  author =       "Roy E. Marsten",
  title =        "The Design of the {XMP} Linear Programming Library",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "481--497",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:03:20 1994",
  acknowledgement = ack-nhfb,
  keywords =     "linear programming; mathematical programming;
                 optimization; software engineering; software
                 libraries",
}

@Article{Pallottino:1981:EAD,
  author =       "Stefano Pallottino and Tommaso Toffoli",
  title =        "An Efficient Algorithm for Determining the Length of
                 the Longest Dead Path in a ``{LIFO}'' Branch-and-Bound
                 Exploration Schema",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "498--504",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:08:44 1994",
  acknowledgement = ack-nhfb,
  keywords =     "branch-and-bound; length of longest dead path; LIFO
                 tree search",
}

@Article{Duff:1981:MSU,
  author =       "I. S. Duff",
  title =        "{ME28}: {A} Sparse Unsymmetric Linear Equation Solver
                 for Complex Equations",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "505--511",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:03:20 1994",
  acknowledgement = ack-nhfb,
  keywords =     "complex sparse linear equations; drop tolerances;
                 ME28; numerical software; real and complex arithmetic;
                 sparse matrix",
}

@Article{Fornberg:1981:NDA,
  author =       "Bengt Fornberg",
  title =        "Numerical Differentiation of Analytic Functions",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "512--526",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:03:20 1994",
  acknowledgement = ack-nhfb,
  keywords =     "analytic functions; numerical differentiation; Taylor
                 series coefficients",
}

@Article{Croz:1981:SLF,
  author =       "J. J. Du Croz and S. M. Nugent and J. K. Reid and D.
                 B. Taylor",
  title =        "Solving Large Full Sets of Linear Equations in a Paged
                 Virtual Store",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "527--536",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:03:20 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Gaussian elimination; paged virtual store",
}

@Article{Croz:1981:ASR,
  author =       "J. J. Du Croz and S. M. Nugent and J. K. Reid and D.
                 B. Taylor",
  title =        "Algorithm 578: Solution of Real Linear Equations in a
                 Paged Virtual Store [{F4}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "537--541",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:12:14 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Gaussian elimination; paged virtual store",
}

@Article{Fornberg:1981:ACC,
  author =       "B. Fornberg",
  title =        "Algorithm 579: {CPSC}: Complex Power Series
                 Coefficients [{D4}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "542--547",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:12:50 1994",
  acknowledgement = ack-nhfb,
  keywords =     "analytic functions; numerical differentiation; Taylor
                 series coefficients",
}

@Article{Buckley:1981:AQS,
  author =       "A. Buckley",
  title =        "Algorithm 580: {QRUP}: {A} Set of {FORTRAN} Routines
                 for Updating {QR} Factorizations [{F5}]",
  journal =      j-TOMS,
  volume =       "7",
  number =       "4",
  pages =        "548--549",
  month =        dec,
  year =         "1981",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:13:39 1994",
  note =         "See also \cite{Buckley:1982:RQS}.",
  acknowledgement = ack-nhfb,
  keywords =     "matrix factorization; orthogonalization",
}

@Article{Krogh:1982:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "8",
  number =       "1",
  pages =        "1--4",
  month =        mar,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:14:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Hiebert:1982:EMS,
  author =       "K. L. Hiebert",
  title =        "An Evaluation of Mathematical Software That Solves
                 Systems of Nonlinear Equations",
  journal =      j-TOMS,
  volume =       "8",
  number =       "1",
  pages =        "5--20",
  month =        mar,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:14:59 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; Brent's method; Brown's method;
                 performance; quasi-Newton Powell's hybrid method",
  subject =      "D.2.8 [Software Engineering]: Metrics\emdash
                 performance measures; G.1.5 [Numerical Analysis]:
                 Proofs of Nonlinear Equations\emdash systems of
                 equations; G.4 [Mathematics of Computing]: Mathematical
                 Software\emdash certification and testing",
}

@Article{Dunham:1982:CBC,
  author =       "Charles B. Dunham",
  title =        "Choice of Basis for {Chebyshev} Approximation",
  journal =      j-TOMS,
  volume =       "8",
  number =       "1",
  pages =        "21--25",
  month =        mar,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:14:59 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; condition numbers; design;
                 Fraser-Hart-Remez algorithm; polynomials; rational
                 functions",
  subject =      "G.1.2 [Numerical Analysis]: Approximation\emdash
                 Chebyshev approximation and theory",
}

@Article{Deo:1982:AGF,
  author =       "Narsingh Deo and G. M. Prabhu and M. S.
                 Krishnamoorthy",
  title =        "Algorithms for Generating Fundamental Cycles in a
                 Graph",
  journal =      j-TOMS,
  volume =       "8",
  number =       "1",
  pages =        "26--42",
  month =        mar,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:14:59 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; fundamental-cycle set;
                 NP-complete; spanning tree",
  subject =      "F.2.2 [Analysis of Algorithms and Problem Complexity]:
                 Nonnumerical algorithms and problems\emdash
                 computations on discrete structures; G.2.2 [Discrete
                 Mathematics]: Graph Theory",
}

@Article{Paige:1982:LAS,
  author =       "Christopher C. Paige and Michael A. Saunders",
  title =        "{LSQR}: An Algorithm for Sparse Linear Equations and
                 Sparse Least Squares",
  journal =      j-TOMS,
  volume =       "8",
  number =       "1",
  pages =        "43--71",
  month =        mar,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:14 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; analysis of variance; conjugate gradients;
                 Lanczos algorithm; lsq; nla",
}

@Article{Chan:1982:IAC,
  author =       "Tony F. Chan",
  title =        "An Improved Algorithm for Computing the Singular Value
                 Decomposition",
  journal =      j-TOMS,
  volume =       "8",
  number =       "1",
  pages =        "72--83",
  month =        mar,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:23:48 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; Householder transformation; nla;
                 performance; singular values; software; svd",
}

@Article{Chan:1982:AIA,
  author =       "Tony F. Chan",
  title =        "Algorithm 581: An Improved Algorithm for Computing the
                 Singular Value Decomposition [{F1}]",
  journal =      j-TOMS,
  volume =       "8",
  number =       "1",
  pages =        "84--88",
  month =        mar,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:11 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; nla; singular value decomposition;
                 software; svd",
}

@Article{Tracht:1982:RNR,
  author =       "Allen E. Tracht",
  title =        "Remark on ``{Algorithm} 334: Normal Random
                 Deviates''",
  journal =      j-TOMS,
  volume =       "8",
  number =       "1",
  pages =        "89--89",
  month =        mar,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:07 1994",
  note =         "See \cite{Bell:1968:NRD}.",
  acknowledgement = ack-nhfb,
}

@Article{Shampine:1982:IRM,
  author =       "L. F. Shampine",
  title =        "Implementation of {Rosenbrock} Methods",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "93--113",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:27:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; FORTRAN Codes; Rosenbrock Methods;
                 theory",
}

@Article{Corliss:1982:SOD,
  author =       "George Corliss and Y. F. Chang",
  title =        "Solving Ordinary Differential Equations Using {Taylor}
                 Series",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "114--144",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:27:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; Taylor series method",
}

@Article{Hoaglin:1982:EDA,
  author =       "David C. Hoaglin and Virginia C. Klema and Stephen C.
                 Peters",
  title =        "Exploratory Data Analysis in a Study of the
                 Performance of Nonlinear Optimization Routines",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "145--162",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:27:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "experimentation; performance",
}

@Article{Ahrens:1982:CGP,
  author =       "J. H. Ahrens and U. Dieter",
  title =        "Computer Generation of {Poisson} Deviates from
                 Modified Normal Distributions",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "163--179",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:31:37 1994",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG;",
  enum =         "6930",
  keywords =     "acceptance-rejection method; algorithms; Poisson
                 distribution; theory",
  language =     "English",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Lewis:1982:IGP,
  author =       "John G. Lewis",
  title =        "Implementation of the {Gibbs-Poole-Stockmeyer} and
                 {Gibbs}-King Algorithms",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "180--189",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:27:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Algorithms; banded matrix; Gibbs-King algorithms;
                 Gibbs-Poole-Stockmeyer algorithms; matrix bandwidth;
                 matrix profile; matrix wavefront",
}

@Article{Lewis:1982:AGP,
  author =       "John G. Lewis",
  title =        "Algorithm 582: The {Gibbs-Poole-Stockmeyer} and
                 {Gibbs-King} Algorithms for Reordering Sparse
                 Matrices",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "190--194",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:34:27 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Algorithms; banded matrix; Gibbs-King algorithms;
                 Gibbs-Poole-Stockmeyer algorithms; matrix bandwidth;
                 matrix profile; matrix wavefront",
}

@Article{Paige:1982:ALS,
  author =       "Christopher C. Paige and Michael A. Saunders",
  title =        "Algorithm 583: {LSQR}: Sparse Linear Equations and
                 Least Squares Problems",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "195--209",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:14 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; analysis of variance; conjugate gradients;
                 conjugate-gradient method; Lanczos algorithm; least
                 squares; linear equations; lsq; nla; regression;
                 software; sparse matrix",
}

@Article{Laurie:1982:ACA,
  author =       "D. P. Laurie",
  title =        "Algorithm 584: {CUBTRI}: Automatic Cubature over a
                 Triangle",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "210--218",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:37:42 1994",
  note =         "See also \cite{Hanson:1986:RCA}.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithm; quadrature rule; theory",
}

@Article{Flamm:1982:RHE,
  author =       "David S. Flamm and Robert A. Walker",
  title =        "Remark on ``{Algorithm} 506: {HQR3} and {EXCHNG}:
                 {Fortran} Subroutines for Calculating and Ordering the
                 Eigenvalues of a Real Upper {Hessenberg} Matrix
                 [{F2}]''",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "219--220",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:07 1994",
  note =         "See \cite{Stewart:1976:AHE}.",
  acknowledgement = ack-nhfb,
}

@Article{Lewis:1982:RMB,
  author =       "John G. Lewis",
  title =        "Remark on ``{Algorithm}s 508 and 509: Matrix Bandwidth
                 and Profile Reduction [{F1}] and {A} Hybrid Profile
                 Reduction Algorithm [{F1}]''",
  journal =      j-TOMS,
  volume =       "8",
  number =       "2",
  pages =        "221--221",
  month =        jun,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:07 1994",
  note =         "See \cite{Crane:1976:AMB,Gibbs:1976:AHP}.",
  acknowledgement = ack-nhfb,
}

@Article{Ellison:1982:UUI,
  author =       "E. F. D. Ellison and Gautam Mitra",
  title =        "{UIMP}: User Interface for Mathematical Programming",
  journal =      j-TOMS,
  volume =       "8",
  number =       "3",
  pages =        "229--255",
  month =        sep,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:27:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "matrix generator; report writer; solution analysis",
}

@Article{Schreiber:1982:NIS,
  author =       "Robert Schreiber",
  title =        "A New Implementation of Sparse {Gaussian}
                 Elimination",
  journal =      j-TOMS,
  volume =       "8",
  number =       "3",
  pages =        "256--276",
  month =        sep,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:27:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; sparse matrix; sparse systems of linear
                 equations; theory",
}

@Article{Sasaki:1982:EGE,
  author =       "Tateaki Sasaki and Hirokazu Murao",
  title =        "Efficient {Gaussian} Elimination Method for Symbolic
                 Determinants and Linear Systems",
  journal =      j-TOMS,
  volume =       "8",
  number =       "3",
  pages =        "277--289",
  month =        sep,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:27:37 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; Cramer's method; expansion by minors;
                 Gaussian elimination; symbolic determinant; symbolic
                 linear systems",
}

@Article{Brezinski:1982:ASG,
  author =       "C. Brezinski",
  title =        "Algorithm 585: {A} Subroutine for the General
                 Interpolation and Extrapolation Problems",
  journal =      j-TOMS,
  volume =       "8",
  number =       "3",
  pages =        "290--301",
  month =        sep,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:49:19 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; convergence acceleration; extrapolation;
                 interpolation; least squares approximation;
                 Neville-Aitken scheme",
}

%=======================================================================
% Bibliography entries from ACM Transactions on Mathematical Software.

@Article{Kincaid:1982:AIF,
  author =       "David R. Kincaid and John R. Respess and David M.
                 Young and Roger G. Grimes",
  title =        "Algorithm 586: {ITPACK 2C}: {A FORTRAN} Package for
                 Solving Large Sparse Linear Systems by Adaptive
                 Accelerated Iterative Methods",
  journal =      j-TOMS,
  volume =       "8",
  number =       "3",
  pages =        "302--322",
  month =        sep,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 23:49:22 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; documentation; iterative methods;
                 numerical software; sparse matrix",
}

@Article{Hanson:1982:ATA,
  author =       "Richard J. Hanson and Karen H. Haskell",
  title =        "Algorithm 587: Two Algorithms for the Linearly
                 Constrained Least Squares Problem",
  journal =      j-TOMS,
  volume =       "8",
  number =       "3",
  pages =        "323--333",
  month =        sep,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 20:52:33 1994",
  note =         "See also \cite{Dadurkevicius:1989:RA}.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; covariance matrix; equality constraints;
                 inconsistent constraints; inequality constraints;
                 linear least squares solution",
}

@Article{Hanson:1982:RPQ,
  author =       "R. J. Hanson",
  title =        "Remark on ``{Algorithm} 507: Procedures for Quintic
                 Natural Spline Interpolation [{E1}]''",
  journal =      j-TOMS,
  volume =       "8",
  number =       "3",
  pages =        "334--334",
  month =        sep,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:07 1994",
  note =         "See \cite{Herriot:1976:APQ}.",
  acknowledgement = ack-nhfb,
}

@Article{Wolfe:1982:CCG,
  author =       "Philip Wolfe",
  title =        "Checking the Calculation of Gradients",
  journal =      j-TOMS,
  volume =       "8",
  number =       "4",
  pages =        "337--343",
  month =        dec,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:02:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "nonlinearity; optimization",
}

@Article{Anderson:1982:FHT,
  author =       "Walter L. Anderson",
  title =        "Fast {Hankel} Transforms Using Related and Lagged
                 Convolutions",
  journal =      j-TOMS,
  volume =       "8",
  number =       "4",
  pages =        "344--368",
  month =        dec,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:02:03 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Bessel functions of the first kind; convolution
                 integrals; Hankel transforms of integer order; linear
                 digital filters",
}

@Article{Anderson:1982:AFH,
  author =       "Walter L. Anderson",
  title =        "Algorithm 588: Fast {Hankel} Transforms Using Related
                 and Lagged Convolutions",
  journal =      j-TOMS,
  volume =       "8",
  number =       "4",
  pages =        "369--370",
  month =        dec,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:05:54 1994",
  acknowledgement = ack-nhfb,
  keywords =     "Bessel functions of the first kind; convolution
                 integrals; Hankel transforms of integer order; linear
                 digital filters",
}

@Article{Dongarra:1982:ASF,
  author =       "Jack J. Dongarra",
  title =        "Algorithm 589: {SICEDR}: {A FORTRAN} Subroutine for
                 Improving the Accuracy of Computed Matrix Eigenvalues",
  journal =      j-TOMS,
  volume =       "8",
  number =       "4",
  pages =        "371--375",
  month =        dec,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:05:58 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; eigensystems improvement; iterative
                 method; matrix eigensystems",
}

@Article{Dooren:1982:ADE,
  author =       "P. Van Dooren",
  title =        "Algorithm 590: {DSUBSP} and {EXCHQZ}: {FORTRAN}
                 Subroutines for Computing Deflating Subspaces with
                 Specified Spectrum",
  journal =      j-TOMS,
  volume =       "8",
  number =       "4",
  pages =        "376--382",
  month =        dec,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:17:25 1994",
  note =         "See also \cite{Petkov:1984:RDE}.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithm; generalized eigenvalue; QZ algorithm",
}

@Article{Hemmerle:1982:ACM,
  author =       "William J. Hemmerle",
  title =        "Algorithm 591: {A} Comprehensive Matrix-Free Algorithm
                 for Analysis of Variance",
  journal =      j-TOMS,
  volume =       "8",
  number =       "4",
  pages =        "383--401",
  month =        dec,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:08:00 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algebraic-model specification; algorithms; analysis of
                 variance; balanced data operators; G-inverse solution;
                 hypothesis testing; iterative improvement; linear
                 models; missing cells; rank computations;
                 storage-efficient algorithm; unbalanced data",
}

@Article{Garbow:1982:RQA,
  author =       "B. S. Garbow",
  title =        "Remark on ``{Algorithm} 535: The {QZ} Algorithm to
                 Solve the Generalized Eigenvalue Problem for Complex
                 Matrices [{F2}]''",
  journal =      j-TOMS,
  volume =       "8",
  number =       "4",
  pages =        "402--402",
  month =        dec,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:07 1994",
  note =         "See \cite{Garbow:1978:AQA,Garbow:1984:RQA}.",
  acknowledgement = ack-nhfb,
}

@Article{Dodson:1982:RBL,
  author =       "David S. Dodson and Roger G. Grimes",
  title =        "Remark on ``{Algorithm} 539: {Basic Linear Algebra
                 Subprograms} for {Fortran} Usage [{F1}]''",
  journal =      j-TOMS,
  volume =       "8",
  number =       "4",
  pages =        "403--404",
  month =        dec,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 21:11:37 1994",
  note =         "See
                 \cite{Lawson:1979:ABL,Dodson:1983:CRB,Hanson:1987:ATA,Louter-Nool:1988:ATA}.",
  acknowledgement = ack-nhfb,
}

@Article{Buckley:1982:RQS,
  author =       "A. Buckley",
  title =        "Remark on ``{Algorithm} 580: {QRUP}: {A} Set of
                 {FORTRAN} Routines for Updating {QR} Factorizations
                 [{F5}]''",
  journal =      j-TOMS,
  volume =       "8",
  number =       "4",
  pages =        "405--405",
  month =        dec,
  year =         "1982",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:08 1994",
  note =         "See \cite{Buckley:1981:AQS}.",
  acknowledgement = ack-nhfb,
}

@Article{Morgan:1983:MCA,
  author =       "Alexander P. Morgan",
  title =        "A Method for Computing All Solutions to Systems of
                 Polynomials Equations",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "1--17",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:32:57 1994",
  acknowledgement = ack-nhfb,
}

@Article{Greenberg:1983:FDA,
  author =       "Harvey Greenberg",
  title =        "A Functional Description of {ANALYZE}: {A}
                 Computer-Assisted Analysis System for Linear
                 Programming Models",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "18--56",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:32:57 1994",
  acknowledgement = ack-nhfb,
}

@Article{Beck:1983:RGA,
  author =       "P. Beck and L. Lasdon and M. Engquist",
  title =        "A Reduced Gradient Algorithm for Nonlinear Network
                 Problems",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "57--70",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:32:57 1994",
  acknowledgement = ack-nhfb,
}

@Article{Hanson:1983:CDE,
  author =       "P. M. Hanson and W. H. Enright",
  title =        "Controlling the defect in existing variable-order
                 {Adams} codes for initial-value problems",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "71--97",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:16:02 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; reliability; theory",
  review =       "ACM CR 40497",
  subject =      "G.1.4 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Quadrature and Numerical Differentiation, Error
                 analysis \\ G.1.7 Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Error
                 analysis \\ G.1.7 Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems",
}

@Article{Gaffney:1983:AFS,
  author =       "Patrick W. Gaffney",
  title =        "Algorithm 592: {A FORTRAN} Subroutine for Computing
                 the Optimal Estimate of {$f(x)$}",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "98--116",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Proskurowski:1983:APH,
  author =       "Wlodzimierz Proskurowski",
  title =        "Algorithm 593: {A} Package for the {Helmholtz}
                 Equation in Nonrectangular Planar Regions",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "117--124",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Larson:1983:ASR,
  author =       "John L. Larson and Mary E. Pasternak and John A.
                 Wisniewski",
  title =        "Algorithm 594: Software for Relative Error Analysis",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "125--130",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Martello:1983:AEA,
  author =       "Silvano Martello",
  title =        "Algorithm 595: An Enumerative Algorithm for Finding
                 {Hamiltonian} Circuits in a Directed Graph",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "131--138",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Gay:1983:RNE,
  author =       "David M. Gay",
  title =        "Remark on ``{Algorithm} 573: {NL2SOL}\emdash An
                 Adaptive Nonlinear Least-Squares Algorithm''",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "139--139",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:32:57 1994",
  note =         "See \cite{Dennis:1981:ANE}.",
  acknowledgement = ack-nhfb,
  keywords =     "lsq; nllsq; nlop; software",
}

@Article{Dodson:1983:CRB,
  author =       "David S. Dodson",
  title =        "Corrigendum: Remark on ``{Algorithm} 539: {Basic
                 Linear Algebra Subroutines} for {FORTRAN} Usage''",
  journal =      j-TOMS,
  volume =       "9",
  number =       "1",
  pages =        "140--140",
  month =        mar,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 21:11:39 1994",
  note =         "See
                 \cite{Lawson:1979:ABL,Dodson:1982:RBL,Hanson:1987:ATA,Louter-Nool:1988:ATA}.",
  acknowledgement = ack-nhfb,
}

@Article{Fourer:1983:MLV,
  author =       "Robert Fourer",
  title =        "Modeling Languages Versus Matrix Generators for Linear
                 Programming",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "143--183",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:43:20 1994",
  acknowledgement = ack-nhfb,
}

@Article{Armstrong:1983:CSM,
  author =       "R. D. Armstrong and D. S. Kung and P. Sinha and A. A.
                 Zoltners",
  title =        "A Computational Study of a Multiple-Choice Knapsack
                 Algorithm",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "184--198",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:43:20 1994",
  acknowledgement = ack-nhfb,
}

@Article{Cryer:1983:ESL,
  author =       "C. W. Cryer",
  title =        "The Efficient Solution of Linear Complementarity
                 Problems for Tridiagonal {Minkowski} Matrices",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "199--214",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:43:20 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rheinboldt:1983:LPC,
  author =       "Werner C. Rheinboldt and John V. Burkardt",
  title =        "A Locally Parametrized Continuation Process",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "215--235",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:43:20 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rheinboldt:1983:APL,
  author =       "Werner C. Rheinboldt and John V. Burkardt",
  title =        "Algorithm 596: {A} Program for a Locally Parametrized
                 Continuation Process",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "236--241",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Aug 29 12:18:04 1994",
  acknowledgement = ack-nhfb,
}

@Article{Cody:1983:ASM,
  author =       "W. J. Cody",
  title =        "Algorithm 597: Sequence of Modified {Bessel} Functions
                 of the First Kind",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "242--245",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 6 22:16:30 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Elementary function approximation G
                 Mathematics of Computing, MISCELLANEOUS",
}

@Article{Davis:1983:AAC,
  author =       "George J. Davis",
  title =        "Algorithm 598: An Algorithm to Compute Solvents of the
                 Matrix Equation {$AX^2 + BX + C = 0$}",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "246--254",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Ahrens:1983:ASG,
  author =       "J. H. Ahrens and K. D. Kohrt and U. Dieter",
  title =        "Algorithm 599: Sampling from {Gamma} and {Poisson}
                 Distributions",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "255--257",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 16:10:33 1994",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG;",
  enum =         "6932",
  language =     "English",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Herriott:1983:ATA,
  author =       "John G. Herriott and Christian H. Reinsch",
  title =        "Algorithm 600: Translation of {Algorithm} 507:
                 {Procedures} for Quintic Natural Spline Interpolation",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "258--259",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 5 23:07:55 1994",
  acknowledgement = ack-nhfb,
}

@Article{Pape:1983:RSP,
  author =       "U. Pape",
  title =        "Remark on ``{Algorithm} 562: Shortest Path Lengths''",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "260--260",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:43:20 1994",
  note =         "See \cite{Pape:1980:ASP}.",
  acknowledgement = ack-nhfb,
}

@Article{Krogh:1983:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "9",
  number =       "2",
  pages =        "261--264",
  month =        jun,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:43:20 1994",
  acknowledgement = ack-nhfb,
}

@Article{Zave:1983:QEF,
  author =       "Pamela Zave and George E. {Cole, Jr.}",
  title =        "A Quantitative Evaluation of the Feasibility of, and
                 Suitable Hardware Architectures for, an Adaptive,
                 Parallel Finite-Element System",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "271--292",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:50:51 1994",
  acknowledgement = ack-nhfb,
}

@Article{Watkins:1983:NSS,
  author =       "David S. Watkins and Ralph W. HansonSmith",
  title =        "The Numerical Solution of Separably Stiff Systems by
                 Precise Partitioning",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "293--301",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:51:59 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; measurement;
                 performance",
  review =       "ACM CR 8406-0468",
  subject =      "G.1.7 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Ordinary Differential Equations, Initial value problems
                 \\ G.1.7 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Ordinary Differential Equations, Stiff equations",
}

@Article{Duff:1983:MSI,
  author =       "I. S. Duff and J. K. Reid",
  title =        "The Multifrontal Solution of Indefinite Sparse
                 Symmetric Linear Systems",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "302--325",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:14 1994",
  acknowledgement = ack-nhfb,
  keywords =     "indefinite system; nla; sparse; symmetric matrix",
}

@Article{Tarjan:1983:SEI,
  author =       "Robert E. Tarjan",
  title =        "Space-Efficient Implementations of Graph Search
                 Methods",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "326--339",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:50:51 1994",
  acknowledgement = ack-nhfb,
}

@Article{McNamee:1983:SMP,
  author =       "J. M. McNamee",
  title =        "A Sparse Matrix Package\emdash Part {II}: Special
                 Cases",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "340--343",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:50:51 1994",
  acknowledgement = ack-nhfb,
}

@Article{McNamee:1983:ASM,
  author =       "J. M. McNamee",
  title =        "Algorithm 601: {A} Sparse-Matrix Package\emdash Part
                 {II}: Special Cases",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "344--345",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Fessler:1983:HAA,
  author =       "Theodore Fessler and William F. Ford and David A.
                 Smith",
  title =        "{HURRY}: An Acceleration Algorithm for Scalar
                 Sequences and Series",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "346--354",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:50:51 1994",
  acknowledgement = ack-nhfb,
}

@Article{Fessler:1983:AHA,
  author =       "Theodore Fessler and William F. Ford and David A.
                 Smith",
  title =        "Algorithm 602: {HURRY}: An Acceleration Algorithm for
                 Scalar Sequences and Series",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "355--357",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Diaz:1983:FPS,
  author =       "J. C. Diaz and G. Fairweather and P. Keast",
  title =        "{FORTRAN} Packages for Solving Certain Almost Block
                 Diagonal Linear Systems by Modified Alternate Row and
                 Column Elimination",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "358--375",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:50:51 1994",
  acknowledgement = ack-nhfb,
}

@Article{Diaz:1983:ACA,
  author =       "J. C. Diaz and G. Fairweather and P. Keast",
  title =        "Algorithm 603: {COLROW} and {ARCECO}: {FORTRAN}
                 Packages for Solving Certain Almost Block Diagonal
                 Linear Systems by Modified Alternate Row and Column
                 Elimination",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "376--380",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 22:04:24 1994",
  note =         "See also \cite{Diaz:1988:RCA}.",
  acknowledgement = ack-nhfb,
}

@Article{Sauer:1983:AFP,
  author =       "Frederick W. Sauer",
  title =        "Algorithm 604: {A FORTRAN} Program for the Calculation
                 of an Extremal Polynomial",
  journal =      j-TOMS,
  volume =       "9",
  number =       "3",
  pages =        "381--383",
  month =        sep,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Hopkins:1983:APV,
  author =       "T. R. Hopkins",
  title =        "Algorithm 605: {PBASIC}: {A} Verifier Program for
                 {American National Standard Minimal BASIC}",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "391--394",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Gaffney:1983:NIT,
  author =       "P. W. Gaffney and J. W. Wooten and K. A. Kessel and W.
                 R. McKinney",
  title =        "{NITPACK}: An Interactive Tree Package",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "395--417",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:56:32 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gaffney:1983:ANI,
  author =       "P. W. Gaffney and J. W. Wooten and K. A. Kessel and W.
                 R. McKinney",
  title =        "Algorithm 606: {NITPACK}: An Interactive Tree
                 Package",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "418--426",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Snyder:1983:ATE,
  author =       "W. V. Snyder and R. J. Hanson",
  title =        "Algorithm 607: Text Exchange System: {A} Transportable
                 System for Management and Exchange of Programs and
                 other Text",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "427--440",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Horn:1983:CLE,
  author =       "B. K. P. Horn",
  title =        "The Curve of Least Energy",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "441--460",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:58:16 1994",
  acknowledgement = ack-nhfb,
}

@Article{West:1983:AAS,
  author =       "David H. West",
  title =        "Algorithm 608: Approximate Solution of the Quadratic
                 Assignment Problem",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "461--466",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Amos:1983:UAE,
  author =       "D. E. Amos",
  title =        "Uniform Asymptotic Expansions for Exponential
                 Integrals ${E}_n(x)$ and {Bickley} Functions
                 $\hbox{Ki}_n(x)$",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "467--479",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 19:56:32 1994",
  acknowledgement = ack-nhfb,
}

@Article{Amos:1983:APFa,
  author =       "D. E. Amos",
  title =        "Algorithm 609: {A} Portable {FORTRAN} Subroutine for
                 the {Bickley} Functions {$\hbox{Ki}_n(x)$}",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "480--493",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 20:00:39 1994",
  acknowledgement = ack-nhfb,
}

@Article{Amos:1983:APFb,
  author =       "D. E. Amos",
  title =        "Algorithm 610: {A} Portable {FORTRAN} Subroutine for
                 Derivatives of the Psi Function",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "494--502",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Gay:1983:ASU,
  author =       "David M. Gay",
  title =        "Algorithm 611: Subroutines for Unconstrained
                 Minimization Using a Model\slash Trust-Region
                 Approach",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "503--524",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:14 1994",
  acknowledgement = ack-nhfb,
  keywords =     "lsq; nllsq; nlop",
}

@Article{Amos:1983:REI,
  author =       "Donald E. Amos",
  title =        "Remark on ``{Algorithm} 556: Exponential Integrals''",
  journal =      j-TOMS,
  volume =       "9",
  number =       "4",
  pages =        "525--525",
  month =        dec,
  year =         "1983",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Aug 30 00:28:08 1994",
  note =         "See \cite{Amos:1980:AEI}.",
  acknowledgement = ack-nhfb,
}

@Article{deDoncker:1984:AAI,
  author =       "Elise de Doncker and Ian Robinson",
  title =        "An Algorithm for Automatic Integration Over a Triangle
                 Using Nonlinear Extrapolation",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "1--16",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:02:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{deDoncker:1984:ATI,
  author =       "Elise de Doncker and Ian Robinson",
  title =        "Algorithm 612: {TRIEX}: Integration Over a {TRIangle}
                 Using Nonlinear {EXtrapolation}",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "17--22",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Gear:1984:SOD,
  author =       "C. W. Gear and O. {\O}sterby",
  title =        "Solving Ordinary Differential Equations with
                 Discontinuities",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "23--44",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:02:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{Krogh:1984:ARI,
  author =       "Fred T. Krogh and Kris Stewart",
  title =        "Asymptotic ($h\rightarrow\infty$) Absolute Stability
                 for {BDFs} Applied to Stiff Differential Equations",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "45--57",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:02:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gaffney:1984:PES,
  author =       "Patrick W. Gaffney",
  title =        "A Performance Evaluation of Some {FORTRAN} Subroutines
                 for the Solution of Stiff Oscillatory Ordinary
                 Differential Equations",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "58--72",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:02:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{Kaufman:1984:BES,
  author =       "Linda Kaufman",
  title =        "Banded Eigenvalue Solvers on Vector Machines",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "73--85",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:11:03 1994",
  acknowledgement = ack-nhfb,
}

@Article{Lenard:1984:RGT,
  author =       "Melanie L. Lenard and Michael Minkoff",
  title =        "Randomly Generated Test Problems for Positive Definite
                 Quadratic Programming",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "86--96",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:02:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{Jones:1984:SRM,
  author =       "Christopher B. Jones",
  title =        "A Significance Rule for Multiple-Precision
                 Arithmetic",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "97--107",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:02:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{Haymond:1984:AMS,
  author =       "R. E. Haymond and J. P. Jarvis and D. R. Shier",
  title =        "Algorithm 613: Minimum Spanning Tree for Moderate
                 Integer Weights",
  journal =      j-TOMS,
  volume =       "10",
  number =       "1",
  pages =        "108--111",
  month =        mar,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Shapiro:1984:IRG,
  author =       "Henry D. Shapiro",
  title =        "Increasing Robustness in Global Adaptive Quadrature
                 Through Interval Selection Heuristics",
  journal =      j-TOMS,
  volume =       "10",
  number =       "2",
  pages =        "117--139",
  month =        jun,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:09:42 1994",
  acknowledgement = ack-nhfb,
}

@Article{Sikorski:1984:OQS,
  author =       "K. Sikorski and F. Stenger",
  title =        "Optimal Quadratures in ${H}_p$ Spaces",
  journal =      j-TOMS,
  volume =       "10",
  number =       "2",
  pages =        "140--151",
  month =        jun,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:09:42 1994",
  acknowledgement = ack-nhfb,
}

@Article{Sikorski:1984:AFS,
  author =       "K. Sikorski and F. Stenger and J. Schwing",
  title =        "Algorithm 614: {A FORTRAN} Subroutine for Numerical
                 Integration in ${H}_p$",
  journal =      j-TOMS,
  volume =       "10",
  number =       "2",
  pages =        "152--160",
  month =        jun,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 20:11:27 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rall:1984:DPS,
  author =       "L. B. Rall",
  title =        "Differentiation in {Pascal-SC}: Type {GRADIENT}",
  journal =      j-TOMS,
  volume =       "10",
  number =       "2",
  pages =        "161--184",
  month =        jun,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:09:42 1994",
  acknowledgement = ack-nhfb,
}

@Article{Lawrie:1984:CCC,
  author =       "D. H. Lawrie and A. H. Sameh",
  title =        "The Computation and Communication Complexity of a
                 Parallel Banded System Solver",
  journal =      j-TOMS,
  volume =       "10",
  number =       "2",
  pages =        "185--195",
  month =        jun,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:12 1994",
  note =         "See also \cite{Lawrie:1985:CCC}.",
  acknowledgement = ack-nhfb,
}

@Article{Reid:1984:SAB,
  author =       "J. K. Reid and A. Jennings",
  title =        "On Solving Almost Block Diagonal (Staircase) Linear
                 Systems",
  journal =      j-TOMS,
  volume =       "10",
  number =       "2",
  pages =        "196--201",
  month =        jun,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:09:42 1994",
  acknowledgement = ack-nhfb,
}

@Article{Armstrong:1984:ABS,
  author =       "R. D. Armstrong and P. O. Beck and M. T. Kung",
  title =        "Algorithm 615: The Best Subset of Parameters in Least
                 Absolute Value Regression",
  journal =      j-TOMS,
  volume =       "10",
  number =       "2",
  pages =        "202--206",
  month =        jun,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Petkov:1984:RDE,
  author =       "P. {Hr.} Petkov and N. D. Christov and M. M.
                 Konstantinov",
  title =        "Remark on ``{Algorithm} 590: {DSUBSP} and {EXCHQZ}:
                 {FORTRAN} Subroutines for Computing Deflating Subspaces
                 with Specified Spectrum''",
  journal =      j-TOMS,
  volume =       "10",
  number =       "2",
  pages =        "207--207",
  month =        jun,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:09:42 1994",
  note =         "See \cite{Dooren:1982:ADE}.",
  acknowledgement = ack-nhfb,
}

@Article{Krogh:1984:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "10",
  number =       "2",
  pages =        "208--211",
  month =        jun,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:09:42 1994",
  acknowledgement = ack-nhfb,
}

@Article{Dongarra:1984:SMA,
  author =       "Jack J. Dongarra and Stanley C. Eisenstat",
  title =        "Squeezing the Most out of an Algorithm in {CRAY}
                 {FORTRAN}",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "219--230",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:14 1994",
  acknowledgement = ack-nhfb,
  keywords =     "cray; fortran; nla; vect",
}

@Article{Molchanov:1984:PCS,
  author =       "I. N. Molchanov and V. S. Zubatenko and L. D.
                 Nikolenko and M. F. Yakovlev",
  title =        "A Program Complex for Solving Systems of Linear
                 Algebraic Equations",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "231--241",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:18:56 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rivara:1984:DDS,
  author =       "Maria-Cecilia Rivara",
  title =        "Design and Data Structure of Fully Adaptive Multigrid,
                 Finite-Element Software",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "242--264",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 19:10:37 1994",
  acknowledgement = ack-nhfb,
}

@Article{Monahan:1984:AFC,
  author =       "J. F. Monahan",
  title =        "Algorithm 616: Fast Computation of the {Hodges-Lehman}
                 Location Estimator",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "265--270",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 20:21:15 1994",
  note =         "This paper reduces the previous complexity bound for
                 the {Hodges-Lehman} location estimator from
                 ${O}(n^2\log{n})$ to ${O}(n\log{n})$.",
}

@Article{Kronmal:1984:ACA,
  author =       "R. A. Kronmal and A. V. Peterson",
  title =        "An Acceptance-Complement Analogue of the
                 Mixture-plus-Acceptance-Rejection Method for Generating
                 Random Variables",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "271--281",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Wed Aug 24 22:43:47 1994",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG;",
  enum =         "7548",
  language =     "English",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
}

@Article{Gill:1984:POP,
  author =       "Philip E. Gill and Walter Murray and Michael A.
                 Saunders and Margaret H. Wright",
  title =        "Procedures for Optimization Problems with a Mixture of
                 Bounds and General Linear Constraints",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "282--298",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:18:56 1994",
  acknowledgement = ack-nhfb,
}

@Article{Aluffi-Pentini:1984:DEA,
  author =       "Filippo Aluffi-Pentini and Valerio Parisi and
                 Francesco Zirilli",
  title =        "A Differential-Equations Algorithm for Nonlinear
                 Equations",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "299--316",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:18:56 1994",
  acknowledgement = ack-nhfb,
}

@Article{Aluffi-Pentini:1984:ADD,
  author =       "Filippo Aluffi-Pentini and Valerio Parisi and
                 Francesco Zirilli",
  title =        "Algorithm 617: {DAFNE}: {A} Differential-Equations
                 Algorithm for Nonlinear Equations",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "317--324",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:18:56 1994",
  acknowledgement = ack-nhfb,
}

@Article{Regener:1984:MID,
  author =       "Eric Regener",
  title =        "Multiprecision Integer Division Examples Using
                 Arbitrary Radix",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "325--328",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:18:56 1994",
  note =         "See also \cite{BrinchHansen:1994:MLD}.",
  acknowledgement = ack-nhfb,
}

@Article{Coleman:1984:SES,
  author =       "Thomas F. Coleman and Burton S. Garbow and Jorge J.
                 Mor\'{e}",
  title =        "Software for Estimating Sparse {Jacobian} Matrices",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "329--345",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:48:14 1994",
  acknowledgement = ack-nhfb,
}

@Article{Coleman:1984:AFS,
  author =       "Thomas F. Coleman and Burton S. Garbow and Jorge J.
                 Mor\'{e}",
  title =        "Algorithm 618: {Fortran} Subroutines for Estimating
                 Sparse {Jacobian} Matrices",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "346--347",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:28:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{Piessens:1984:AAN,
  author =       "Robert Piessens and Rudi Huysmans",
  title =        "Algorithm 619: Automatic Numerical Inversion of the
                 {Laplace} Transform [{D5}]",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "348--353",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Piessens:1984:RNI,
  author =       "Robert Piessens",
  title =        "Remark on ``{Algorithm} 486: Numerical Inversion of
                 {Laplace} Transform''",
  journal =      j-TOMS,
  volume =       "10",
  number =       "3",
  pages =        "354--354",
  month =        sep,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:18:56 1994",
  note =         "See \cite{Veillon:1977:RNI,Koppelaar:1976:RNI}.",
  acknowledgement = ack-nhfb,
}

@Article{Rice:1984:ARK,
  author =       "John R. Rice and Richard J. Hanson",
  title =        "Algorithm 620: References and Keywords for {\em
                 {Collected Algorithms} of the {ACM}}",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "359--360",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 20:31:58 1994",
  note =         "See also \cite{Hamilton:1985:RRK,Hopkins:1990:RRK}.",
  acknowledgement = ack-nhfb,
}

@Article{Black:1984:NIS,
  author =       "Cheryl M. Black and Robert P. Burton and Thomas M.
                 Miller",
  title =        "The Need for an Industry Standard of Accuracy for
                 Elementary-Function Programs",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "361--366",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:32:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Eiger:1984:BMS,
  author =       "A. Eiger and K. Sikorski and F. Stenger",
  title =        "A Bisection Method for Systems of Nonlinear
                 Equations",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "367--377",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:32:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Sommeijer:1984:ASL,
  author =       "B. P. Sommeijer and P. J. van der Houven",
  title =        "Algorithm 621: Software with Low Storage Requirements
                 for Two-Dimensional Parabolic Differential Equations",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "378--396",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Bundy:1984:GIP,
  author =       "Alan Bundy",
  title =        "A Generalized Interval Package and Its Use for
                 Semantic Checking",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "397--409",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:32:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rice:1984:ASM,
  author =       "John R. Rice and Calvin Ribbens and William A. Ward",
  title =        "Algorithm 622: {A} Simple Macroprocessor",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "410--416",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 20:35:11 1994",
  acknowledgement = ack-nhfb,
}

@Article{Renka:1984:IDS,
  author =       "Robert J. Renka",
  title =        "Interpolation of Data on the Surface of a Sphere",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "417--436",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 8511-1051",
  subject =      "G.1 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation",
}

@Article{Renka:1984:AIS,
  author =       "Robert J. Renka",
  title =        "Algorithm 623: Interpolation on the Surface of a
                 Sphere",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "437--439",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Renka:1984:ATI,
  author =       "Robert J. Renka",
  title =        "Algorithm 624: Triangulation and Interpolation at
                 Arbitrarily Distributed Points in the Plane",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "440--442",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 20:36:08 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rice:1984:NCG,
  author =       "John R. Rice",
  title =        "Numerical Computation with General Two-Dimensional
                 Domains",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "443--452",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:32:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Rice:1984:ATD,
  author =       "John R. Rice",
  title =        "Algorithm 625: {A} Two-Dimensional Domain Processor",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "453--462",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Preusser:1984:CCS,
  author =       "Albrect Preusser",
  title =        "Computing Contours by Successive Solution of Quintic
                 Polynomial Equations",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "463--472",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:32:29 1994",
  acknowledgement = ack-nhfb,
}

@Article{Preusser:1984:ATE,
  author =       "Albrect Preusser",
  title =        "Algorithm 626: {TRICP}\emdash {A} Contour Plot Program
                 for Triangular Meshes",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "473--475",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Garbow:1984:RQA,
  author =       "B. S. Garbow",
  title =        "Remark on ``{Algorithm} 535: The {QZ} Algorithm to
                 Solve the Generalized Eigenvalue Problem for Complex
                 Matrices [{F2}]''",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "476--476",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:32:29 1994",
  note =         "See \cite{Garbow:1978:AQA,Garbow:1982:RQA}.",
  acknowledgement = ack-nhfb,
}

@Article{Celis:1984:RCE,
  author =       "Pedro Celis",
  title =        "Remark: Corrections and Errors in {John Ivie}'s Some
                 {MACSYMA} Programs for Solving Recurrence Relations",
  journal =      j-TOMS,
  volume =       "10",
  number =       "4",
  pages =        "477--478",
  month =        dec,
  year =         "1984",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:32:29 1994",
  note =         "See \cite{Ivie:1978:SMP}.",
  acknowledgement = ack-nhfb,
}

@Article{Tomlin:1985:IPS,
  author =       "J. A. Tomlin and J. S. Welch",
  title =        "Integration of a Primal Simplex Network Algorithm with
                 a Large-Scale Mathematical Programming System",
  journal =      j-TOMS,
  volume =       "11",
  number =       "1",
  pages =        "1--11",
  month =        mar,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/3163.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Linear programming.",
}

@Article{Davidon:1985:ESD,
  author =       "William C. Davidon and Jorge Nocedal",
  title =        "Evaluation of Step Directions in Optimization
                 Algorithms",
  journal =      j-TOMS,
  volume =       "11",
  number =       "1",
  pages =        "12--19",
  month =        mar,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/3164.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Gradient methods.",
}

@Article{Cuyt:1985:CIM,
  author =       "Annie A. M. Cuyt and L. B. Rall",
  title =        "Computational Implementation of the Multivariate
                 {Halley} Method for Solving Nonlinear Systems of
                 Equations",
  journal =      j-TOMS,
  volume =       "11",
  number =       "1",
  pages =        "20--36",
  month =        mar,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/3162.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Iterative
                 methods. {\bf G.1.5}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Roots of Nonlinear Equations,
                 Systems of equations. {\bf G.1.m}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Miscellaneous. {\bf
                 I.1.m}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Miscellaneous.",
}

@Article{Vitter:1985:RSR,
  author =       "Jeffrey Scott Vitter",
  title =        "Random Sampling with a Reservoir",
  journal =      j-TOMS,
  volume =       "11",
  number =       "1",
  pages =        "37--57",
  month =        mar,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/3165.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance; theory;
                 verification",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo). {\bf G.3}: Mathematics of Computing,
                 PROBABILITY AND STATISTICS, Random number generation.
                 {\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical software. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis. {\bf D.4.3}: Software, OPERATING
                 SYSTEMS, File Systems Management, Access methods.",
}

@Article{Bownds:1985:AFS,
  author =       "John M. Bownds and Lee Applebaum",
  title =        "Algorithm 627: {A FORTRAN} Subroutine for Solving
                 {Volterra} Integral Equations",
  journal =      j-TOMS,
  volume =       "11",
  number =       "1",
  pages =        "58--65",
  month =        mar,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214314.html",
  keywords =     "documentation; economics; performance",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Chebyshev approximation and
                 theory. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Certification and testing. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Portability.",
}

@Article{Winkler:1985:AAC,
  author =       "F. Winkler and B. Buchberger and F. Lichtenberger and
                 H. Rolletschek",
  title =        "Algorithm 628: An Algorithm for Constructing Canonical
                 Bases of Polynomial Ideals",
  journal =      j-TOMS,
  volume =       "11",
  number =       "1",
  pages =        "66--78",
  month =        mar,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214316.html",
  keywords =     "algorithms; theory",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf I.1.1}: Computing Methodologies,
                 ALGEBRAIC MANIPULATION, Expressions and Their
                 Representation. {\bf I.1.2}: Computing Methodologies,
                 ALGEBRAIC MANIPULATION, Algorithms. {\bf J.2}: Computer
                 Applications, PHYSICAL SCIENCES AND ENGINEERING.",
}

@Article{Atkinson:1985:AIE,
  author =       "Kendall E. Atkinson",
  title =        "Algorithm 629: An Integral Equation Program for
                 {Laplace}'s Equation in Three Dimensions",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "85--96",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214393.html",
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.9}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Integral Equations. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Dembo:1985:TPG,
  author =       "R. S. Dembo and T. Steihaug",
  title =        "A Test Problem Generator for Large-Scale Unconstrained
                 Optimization",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "97--102",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214394.html",
  abstract =     "A test problem generator for large-scale unconstrained
                 optimization is described. It permits the generation of
                 a poorly or well-conditioned problems of arbitrary
                 size, derived from nonlinear network flow models. An
                 eigenvalue analysis provides bounds on the condition
                 number of the Hessian of the objective function and an
                 example of an efficient preconditioner, using these
                 bounds, is outlined.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; measurement",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Nonlinear programming. {\bf
                 G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 General, Numerical algorithms. {\bf G.4}: Mathematics
                 of Computing, MATHEMATICAL SOFTWARE, Certification and
                 testing. {\bf D.2.5}: Software, SOFTWARE ENGINEERING,
                 Testing and Debugging, Test data generators.",
}

@Article{Buckley:1985:ABE,
  author =       "A. Buckley and A. LeNir",
  title =        "Algorithm 630: {BBVSCG}\emdash {A} Variable Storage
                 Algorithm for Function Minimization",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "103--119",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214395.html",
  keywords =     "algorithms",
  subject =      "{\bf G.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS. {\bf G.1.6}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Optimization. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Gradient methods.",
}

@Article{Norton:1985:AFB,
  author =       "Victor Norton",
  title =        "Algorithm 631: Finding a Bracketed Zero by {Larkin}'s
                 Method of Rational Interpolation",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "120--134",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  note =         "See \cite{Norton:1986:RFB}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214396.html",
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Iterative
                 methods. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis. {\bf G.1.1}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation.",
}

@Article{Martello:1985:APM,
  author =       "Silvano Martello and Paolo Toth",
  title =        "Algorithm 632: {A} Program for the $0-1$ Multiple
                 Knapsack Problem",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "135--140",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:12:05 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214397.html",
  keywords =     "algorithms",
  subject =      "{\bf G.2.1}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Combinatorics, Combinatorial algorithms.
                 {\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization.",
}

@Article{Liu:1985:MMD,
  author =       "Joseph W. H. Liu",
  title =        "Modification of the Minimum-Degree Algorithm by
                 Multiple Elimination",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "141--153",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214398.html",
  abstract =     "The most widely used ordering scheme to reduce fills
                 and operations in sparse matrix computation is the
                 minimum-degree algorithm. The notion of {\em multiple
                 elimination} is introduced here as a modification to
                 the conventional scheme. The motivation is discussed
                 using the $k$-by-$k$ grid model problem. Experimental
                 results indicate that the modified version retains the
                 fill-reducing property of (and is often better than)
                 the original ordering algorithm and yet requires less
                 computer time. The reduction in ordering time is
                 problem dependent, and for some problems the modified
                 algorithm can run a few times faster than existing
                 implementations of the minimum-degree algorithm. The
                 use of {\em external degree} in the algorithm is also
                 introduced.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Gan:1985:NCG,
  author =       "C. T. Gan",
  title =        "A Note on Combination Generators",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "154--156",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214401.html",
  abstract =     "A recent study by Akl indicates that Mifsud's
                 algorithm, which involves unnecessary searching
                 operations, is the fastest existing combination
                 generator. A modified Page and Wilson's algorithm,
                 which is essentially similar to Mifsud's algorithm, is
                 presented. A theoretical analysis of the modified
                 algorithm is also given.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.2.1}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Combinatorics, Combinatorial algorithms.
                 {\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures.",
}

@Article{Ahrens:1985:SRS,
  author =       "J. H. Ahrens and U. Dieter",
  title =        "Sequential Random Sampling",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "157--169",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214402.html",
  abstract =     "Fast algorithms for selecting a random set of exactly
                 $k$ records from a file of $n$ records are constructed.
                 Selection is sequential: the sample records are chosen
                 in the same order in which they occur in the file. All
                 procedures run in $O(k)$ time. The ``geometric'' method
                 has two versions: with or without $O(k)$ auxiliary
                 space. A further procedure uses hashing techniques and
                 requires $O(k)$ space.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{Ward:1985:AAL,
  author =       "R. C. Ward and G. J. Davis and V. E. Kane",
  title =        "Algorithm 633: An Algorithm for Linear Dependency
                 Analysis of Multivariate Data",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "170--182",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:12:58 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214403.html",
  keywords =     "measurement; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical computing.",
}

@Article{Novotny:1985:RNS,
  author =       "Milan Novotny",
  title =        "Remark on ``{Algorithm} 30: Numerical Solution of the
                 Polynomial Equation''",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "183--184",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  note =         "See \cite{Ellenberger:1960:NSP}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214404.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Hill:1985:RCS,
  author =       "I. D. Hill and M. C. Pike",
  title =        "Remark on ``{Algorithm} 299: Chi-Squared Integral''",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "185--185",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 20:40:18 1994",
  note =         "See \cite{Hill:1967:CSI,Lozy:1976:RCS}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214405.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Preusser:1985:RBI,
  author =       "Albrect Preusser",
  title =        "Remark on ``{Algorithm} 526: Bivariate Interpolation
                 and Smooth Surface Fitting for Irregularly Distributed
                 Data Points [{E1}]''",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "186--187",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  note =         "See \cite{Akima:1978:ABI,Akima:1979:RBI}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214407.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Lawrie:1985:CCC,
  author =       "D. H. Lawrie and A. H. Sameh",
  title =        "Corrections to ``{The} Computation and Communication
                 Complexity of a Parallel Banded System Solver''",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "188--188",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  note =         "See \cite{Lawrie:1984:CCC}.",
  acknowledgement = ack-nhfb,
}

@Article{Krogh:1985:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "11",
  number =       "2",
  pages =        "193--196",
  month =        jun,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:43:27 1994",
  acknowledgement = ack-nhfb,
}

@Article{Bartels:1985:LSF,
  author =       "Richard H. Bartels and John J. Jezioranski",
  title =        "Least-Squares Fitting Using Orthogonal Multinomials",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "201--217",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:57:44 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214410.html",
  abstract =     "Forsythe has given a method for generating basis
                 polynomials in a single variable that are orthogonal
                 with respect to a given inner product. Weisfeld later
                 demonstrated that Forsythe's approach could be extended
                 to polynomials in an arbitrary number of variables. In
                 this paper we sharpen Weisfeld's results and present a
                 method for computing weighted, multinomial,
                 least-squares approximations to given data.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Least squares methods. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations on polynomials.",
}

@Article{Bartels:1985:ACE,
  author =       "Richard H. Bartels and John J. Jezioranski",
  title =        "Algorithm 634: {CONSTR} and {EVAL}: Routines for
                 Fitting Multinomials in a Least-Squares Sense",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "218--228",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 20:58:40 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214412.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Least squares methods. {\bf
                 F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT
                 DEVICES, Modes of Computation.",
}

@Article{Hull:1985:PRV,
  author =       "T. E. Hull and A. Abrham",
  title =        "Properly Rounded Variable Precision Square Root",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "229--237",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:47:50 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214413.html",
  abstract =     "The square root function presented here returns a
                 properly rounded approximation to the square root of
                 its argument, or it raises an error condition if the
                 argument is negative. {\em Properly rounded} means
                 rounded to the nearest, or to nearest even in case of a
                 tie. It is {\em variable precision} in that it is
                 designed to return a $p$-digit approximation to a
                 $p$-digit argument, for any $p$ \$>\$ 0. (Precision $p$
                 means $p$ decimal digits.) The program and the analysis
                 are valid for all $p$ \$>\$ 0, but current
                 implementations place some restrictions on $p$.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; verification",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Elementary function
                 approximation. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Certification and testing. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Verification. {\bf
                 G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 General, Error analysis. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Numerical
                 algorithms.",
}

@Article{Stewart:1985:NCD,
  author =       "G. W. Stewart",
  title =        "A Note on Complex Division",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "238--241",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:15 1994",
  note =         "See also \cite{Stewart:1986:CNC}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214414.html",
  abstract =     "An algorithm for computing the quotient of two complex
                 numbers is modified to make it more robust in the
                 presence of underflows.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; complex arithmetic; computer arithmetic;
                 na",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Reliability and robustness.",
}

@Article{Streit:1985:AAS,
  author =       "Roy L. Streit",
  title =        "Algorithm 635: An Algorithm for the Solution of
                 Systems of Complex Linear Equations in the ${L}_\infty$
                 Norm with Constraints on the Unknowns",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "242--249",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:59:33 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214415.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Minimax approximation and
                 algorithms. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear
                 systems (direct and iterative methods). {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Linear programming.",
}

@Article{Le:1985:EDF,
  author =       "D. Le",
  title =        "An Efficient Derivative-Free Method for Solving
                 Nonlinear Equations",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "250--262",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:37 1994",
  note =         "See also \cite{Le:1989:CED}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214416.html",
  abstract =     "An algorithm is presented for finding a root of a real
                 function. The algorithm combines bisection with second
                 and third order methods using derivatives estimated
                 from objective function values. Global convergence is
                 ensured and the number of function evaluations is
                 bounded by four times the number needed by bisection.
                 Numerical comparisons with existing algorithms indicate
                 the superiority of the new algorithm in all classes of
                 problems.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Convergence.",
}

@Article{Tischer:1985:ESN,
  author =       "P. E. Tischer and G. K. Gupta",
  title =        "An Evaluation of Some New Cyclic Linear Multistep
                 Formulas for Stiff {ODEs}",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "263--270",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:57:44 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214417.html",
  abstract =     "We evaluate several sets of cyclic linear multistep
                 formulas (CLMFs). One of these sets was derived by
                 Tischer and Sacks-Davis. Three new sets of formulas
                 have been derived and we present their
                 characteristics.\par

                 The formulas have been evaluated by comparing the
                 performance of four versions of a code which implements
                 CLMFs. The four versions are very similar and each
                 version implements one of the sets of CLMFs being
                 studied. We compare the performance of these codes with
                 that of a widely used code, LSODE. One of the new sets
                 of CLMFs is not only much more efficient in solving
                 stiff problems that have a Jacobian with eigenvalues
                 close to the imaginary axis but is almost as efficient
                 as LSODE in solving other problems. This is a
                 significant improvement over the only other CLMF code
                 available, STINT from Tendler, Bickart, and Picel.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations.",
}

@Article{Johnsson:1985:SNB,
  author =       "S. Lennart Johnsson",
  title =        "Solving Narrow Banded Systems on Ensemble
                 Architectures",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "271--288",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:01:13 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214418.html",
  abstract =     "We present concurrent algorithms for the solution of
                 narrow banded systems on ensemble architectures, and
                 analyze the communication and arithmetic complexities
                 of the algorithms. The algorithms consist of three
                 phases. In phase 1, a block tridiagonal system of
                 reduced size is produced through largely local
                 operations. Diagonal dominance is preserved. If the
                 original system is positive, definite, and symmetric,
                 so is the reduced system. It is solved in a second
                 phase, and the remaining variables obtained through
                 local back substitution in a third phase. With a
                 sufficient number of processing elements, there is no
                 first and third phase. We investigate the arithmetic
                 and communication complexity of Gaussian elimination
                 and block cyclic reduction for the solution of the
                 reduced system on boolean cubes, perfect shuffle and
                 shuffle-exchange networks, binary trees, and linear
                 arrays.\par

                 With an optimum number of processors, the minimum
                 solution time on a linear array is of an order that
                 ranges from $O(m^{2}Nm)$ to $O(m^{3} +
                 m^{3}\log_{2}(N/m))$ depending on the bandwidth, the
                 dimension of the problem, and the times for
                 communication and arithmetic. For boolean cubes,
                 cube-connected cycles, prefect shuffle and
                 shuffle-exchange networks, and binary trees, the
                 minimum time is $O(m^{3}+m^{3}\log_2(N/m))$ including
                 the communication complexity",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; band matrix; linear system; nla;
                 performance; prll",
  subject =      "{\bf C.1.2}: Computer Systems Organization, PROCESSOR
                 ARCHITECTURES, Multiple Data Stream Architectures
                 (Multiprocessors), Multiple-instruction-stream,
                 multiple-data-stream processors (MIMD). {\bf F.2.1}:
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on matrices. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative methods).
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm analysis. {\bf I.1.2}: Computing
                 Methodologies, ALGEBRAIC MANIPULATION, Algorithms,
                 Analysis of algorithms.",
}

@Article{Hall:1985:ESR,
  author =       "George Hall",
  title =        "Equilibrium States of {Runge Kutta} Schemes",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "289--301",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:57:44 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214424.html",
  abstract =     "Understanding the behavior of Runge-Kutta codes when
                 stability considerations restrict the stepsize provides
                 useful information for stiffness detection and other
                 implementation details. Analysis of equilibrium states
                 on test problems is presented which provides
                 predictions and insights into this behavior. The
                 implications for global error are also discussed.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Single step methods. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Ericksen:1985:IPT,
  author =       "Wilhelm S. Ericksen",
  title =        "Inverse Pairs of Test Matrices",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "302--304",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:57:44 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214425.html",
  abstract =     "Algorithms that are readily programmable are provided
                 for constructing inverse pairs of matrices with
                 elements in a field, a division ring, or a ring.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Condition (and ill-condition). {\bf
                 G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 General, Numerical algorithms. {\bf G.1.3}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Conditioning. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Matrix inversion.",
}

@Article{Hamilton:1985:RRK,
  author =       "Dennis E. Hamilton",
  title =        "Remark on ``{Algorithm} 620: References and Keywords
                 for {\em {Collected Algorithms} of the {ACM}}''",
  journal =      j-TOMS,
  volume =       "11",
  number =       "3",
  pages =        "305--307",
  month =        sep,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:57:44 1994",
  note =         "See \cite{Rice:1984:ARK,Hopkins:1990:RRK}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214426.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Boisvert:1985:GFM,
  author =       "Ronald F. Boisvert and Sally E. Howe and David K.
                 Kahaner",
  title =        "{GAMS}: {A} Framework for the Management of Scientific
                 Software",
  journal =      j-TOMS,
  volume =       "11",
  number =       "4",
  pages =        "313--355",
  month =        dec,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:06:30 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6188.html",
  acknowledgement = ack-nhfb,
  keywords =     "documentation; human factors; management",
  review =       "ACM CR 8702-0100",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, GAMS. {\bf G.3}: Mathematics of Computing,
                 PROBABILITY AND STATISTICS, Statistical software. {\bf
                 H.3.5}: Information Systems, INFORMATION STORAGE AND
                 RETRIEVAL, Online Information Services. {\bf D.2.7}:
                 Software, SOFTWARE ENGINEERING, Distribution and
                 Maintenance, Documentation.",
}

@Article{Davenport:1985:PRA,
  author =       "J. H. Davenport and B. M. Trager",
  title =        "On the Parallel {Risch} Algorithm ({II})",
  journal =      j-TOMS,
  volume =       "11",
  number =       "4",
  pages =        "356--362",
  month =        dec,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:06:32 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6189.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory; verification",
  subject =      "{\bf I.1.2}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Algorithms.",
}

@Article{Coleman:1985:SES,
  author =       "Thomas F. Coleman and Burton S. Garbow and Jorge J.
                 More",
  title =        "Software for Estimating Sparse {Hessian} Matrices",
  journal =      j-TOMS,
  volume =       "11",
  number =       "4",
  pages =        "363--377",
  month =        dec,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6190.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 8710-0876",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.1.6}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Optimization, Nonlinear
                 programming. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Coleman:1985:AFS,
  author =       "Thomas F. Coleman and Burton S. Garbow and Jorge J.
                 Mor{\'{e}}",
  title =        "Algorithm 636: {FORTRAN} subroutines for estimating
                 sparse {Hessian} matrices",
  journal =      j-TOMS,
  volume =       "11",
  number =       "4",
  pages =        "378--378",
  month =        dec,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 14:55:36 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6193.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf E.1}: Data, DATA STRUCTURES, Graphs. {\bf E.2}:
                 Data, DATA STORAGE REPRESENTATIONS, Linked
                 representations. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra. {\bf
                 G.m}: Mathematics of Computing, MISCELLANEOUS. {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN.",
}

@Article{Houstis:1985:CSS,
  author =       "E. N. Houstis and W. F. Mitchell and J. R. Rice",
  title =        "Collocation Software for Second-Order Elliptic Partial
                 Differential Equations",
  journal =      j-TOMS,
  volume =       "11",
  number =       "4",
  pages =        "379--412",
  month =        dec,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:07:32 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6191.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; measurement; performance",
  review =       "ACM CR 8702-0097",
  subject =      "{\bf G.1.8}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations, Elliptic
                 equations. {\bf G.1.8}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Partial Differential Equations,
                 Finite element methods.",
}

@Article{Houstis:1985:AGC,
  author =       "E. N. Houstis and W. F. Mitchell and J. R. Rice",
  title =        "Algorithm 637: {GENCOL}: Collocation of General
                 Domains with Bicubic {Hermite} Polynomials",
  journal =      j-TOMS,
  volume =       "11",
  number =       "4",
  pages =        "413--415",
  month =        dec,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 14:56:32 1994",
  acknowledgement = ack-nhfb,
  subject =      "G.1.8 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Partial Differential Equations, Elliptic equations \\
                 G.1.8 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Partial Differential Equations, Finite element methods
                 \\ G.m Mathematics of Computing, MISCELLANEOUS \\ D.3.2
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN",
}

@Article{Houstis:1985:AIH,
  author =       "E. N. Houstis and W. F. Mitchell and J. R. Rice",
  title =        "Algorithm 638: {INTCOL} and {HERMCOL}: Collocation on
                 Rectangular Domains with Bicubic {Hermite}
                 Polynomials",
  journal =      j-TOMS,
  volume =       "11",
  number =       "4",
  pages =        "416--418",
  month =        dec,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:08:06 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6195.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.8}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations, Elliptic
                 equations. {\bf G.1.8}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Partial Differential Equations,
                 Finite element methods. {\bf G.m}: Mathematics of
                 Computing, MISCELLANEOUS. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 FORTRAN.",
}

@Article{Schnabel:1985:MSA,
  author =       "Robert B. Schnabel and John E. Koonatz and Barry E.
                 Weiss",
  title =        "A Modular System of Algorithms for Unconstrained
                 Minimization",
  journal =      j-TOMS,
  volume =       "11",
  number =       "4",
  pages =        "419--440",
  month =        dec,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6192.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 8702-0093",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Unconstrained optimization.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, UNCMIN.",
}

@Article{Er:1985:RG,
  author =       "M. C. Er",
  title =        "Remark on ``{Algorithm} 246: {Graycode} [{Z}]''",
  journal =      j-TOMS,
  volume =       "11",
  number =       "4",
  pages =        "441--443",
  month =        dec,
  year =         "1985",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 20:42:44 1994",
  note =         "See \cite{Boothroyd:1964:G,Misra:1975:RG}.",
  acknowledgement = ack-nhfb,
}

@Article{Shampine:1986:FVV,
  author =       "L. F. Shampine and L. S. Baca",
  title =        "Fixed versus Variable Order {Runge-Kutta}",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "1--23",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:09:54 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/5964.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance",
  review =       "ACM CR 8702-0096",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Single step methods. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Efficiency. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{Lyness:1986:AIS,
  author =       "James Lyness and Gwendolen Hines",
  title =        "Algorithm 639: To Integrate Some Infinite Oscillating
                 Tails",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "24--25",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214318.html",
  keywords =     "algorithms",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.",
}

@Article{Laub:1986:AEC,
  author =       "Alan J. Laub",
  title =        "Algorithm 640: Efficient Calculation of Frequency
                 Response Matrices from State Space Models",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "26--33",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214319.html",
  keywords =     "algorithms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear
                 systems (direct and iterative methods). {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Matrix inversion. {\bf J.2}: Computer
                 Applications, PHYSICAL SCIENCES AND ENGINEERING,
                 Engineering.",
}

@Article{Deak:1986:EMG,
  author =       "I. Deak",
  title =        "The Economical Method for Generating Random Samples
                 from Discrete Distributions",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "34--36",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:11:10 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214321.html",
  abstract =     "The idea of the economical method is applied for
                 generating samples from any discrete distribution. In
                 the resulting procedure, the expected number of
                 uniformly distributed random numbers is less than in
                 the alias method (practically 1). A refinement gives a
                 version where in limit just one uniformly distributed
                 number is required at the expense of some storage
                 space.",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG;",
  enum =         "7183",
  keywords =     "algorithms",
  language =     "English",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf I.6.1}: Computing Methodologies,
                 SIMULATION AND MODELING, Simulation Theory.",
}

@Article{Law:1986:NAM,
  author =       "Kincho H. Law and Steven J. Fenives",
  title =        "A Node-Addition Model for Symbolic Factorization",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "37--50",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:11:23 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/5963.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance; theory;
                 verification",
  review =       "ACM CR 8704-0290",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.2.2}:
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Graph algorithms. {\bf E.1}: Data, DATA
                 STRUCTURES.",
}

@Article{Springer:1986:ESG,
  author =       "J{\"{o}}rn Springer",
  title =        "Exact Solution of General Integer Systems of Linear
                 Equations",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "51--61",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/5961.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  review =       "ACM CR 8703-0190",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.1.2}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Least squares approximation. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations in finite fields.",
}

@Article{Jansen:1986:HAA,
  author =       "Paul Jansen and Peter Weidner",
  title =        "High-Accuracy Arithmetic Software\emdash Some Tests of
                 the {ACRITH} Problem-Solving Routines",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "62--70",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/5962.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 8612-1110",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, ACRITH. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Numerical
                 algorithms. {\bf I.1.3}: Computing Methodologies,
                 ALGEBRAIC MANIPULATION, Languages and Systems, REDUCE.
                 {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Reliability and
                 robustness.",
}

@Article{Hanson:1986:RCA,
  author =       "Richard J. Hanson",
  title =        "Remark on ``{Algorithm} 584: {CUBTRI}: Automatic
                 Cubature over a Triangle''",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "71--71",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 20:57:44 1994",
  note =         "See \cite{Laurie:1982:ACA}.",
  acknowledgement = ack-nhfb,
}

@Article{Norton:1986:RFB,
  author =       "Victor Norton",
  title =        "Remark on ``{Algorithm} 631: Finding a Bracketed Zero
                 by {Larkin}'s Method of Rational Interpolation''",
  journal =      j-TOMS,
  volume =       "12",
  number =       "1",
  pages =        "72--72",
  month =        mar,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 20:41:38 1994",
  note =         "See \cite{Norton:1985:AFB}.",
  acknowledgement = ack-nhfb,
}

@Article{Hull:1986:VPE,
  author =       "T. E. Hull and A. Abrham",
  title =        "Variable Precision Exponential Function",
  journal =      j-TOMS,
  volume =       "12",
  number =       "2",
  pages =        "79--91",
  month =        jun,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:17:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6498.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory; verification",
  review =       "ACM CR 8702-0091",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Elementary function
                 approximation. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Certification and testing. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Verification.",
}

@Article{Dolk:1986:GMM,
  author =       "Daniel R. Dolk",
  title =        "A Generalized Model Management System for Mathematical
                 Programming",
  journal =      j-TOMS,
  volume =       "12",
  number =       "2",
  pages =        "92--126",
  month =        jun,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:18:01 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6501.html",
  acknowledgement = ack-nhfb,
  keywords =     "human factors; languages; management",
  review =       "ACM CR 8705-0407",
  subject =      "{\bf H.4.2}: Information Systems, INFORMATION SYSTEMS
                 APPLICATIONS, Types of Systems, Decision support. {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Applicative languages. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Nonprocedural languages. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Linear programming. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Nonlinear programming. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Integer programming. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE, XMP.
                 {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
                 Languages, Query languages. {\bf H.2.4}: Information
                 Systems, DATABASE MANAGEMENT, Systems, Query
                 processing. {\bf D.2.2}: Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, User interfaces.
                 {\bf I.2.1}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems, GXMP.
                 {\bf I.2.4}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Knowledge Representation Formalisms and
                 Methods.",
}

@Article{Liu:1986:CRS,
  author =       "Joseph W. Liu",
  title =        "A Compact Row Storage Scheme for {Cholesky} Factors
                 Using Elimination Trees",
  journal =      j-TOMS,
  volume =       "12",
  number =       "2",
  pages =        "127--148",
  month =        jun,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:18:32 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6499.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; measurement; performance;
                 theory; verification",
  review =       "ACM CR 8703-0191",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis. {\bf G.2.2}:
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory.",
}

@Article{Springer:1986:AES,
  author =       "J{\"{o}}rn Springer",
  title =        "Algorithm 641: Exact Solution of General Systems of
                 Linear Equations",
  journal =      j-TOMS,
  volume =       "12",
  number =       "2",
  pages =        "149--149",
  month =        jun,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 21:19:01 1994",
  acknowledgement = ack-nhfb,
}

@Article{Hutchinson:1986:AFP,
  author =       "M. F. Hutchinson",
  title =        "Algorithm 642: {A} Fast Procedure for Calculating
                 Minimum Cross-Validation Cubic Smoothing Splines",
  journal =      j-TOMS,
  volume =       "12",
  number =       "2",
  pages =        "150--153",
  month =        jun,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214322.html",
  abstract =     "The procedure CUBGCV is an implementation of a
                 recently developed algorithm for fast $O(n)$
                 calculation of a cubic smoothing spline fitted to $n$
                 noisy data points, with the degree of smoothing chosen
                 to minimize the expected mean square error at the data
                 points when the variance of the error associated with
                 the data is known, or, to minimize the generalized
                 cross validation (GCV) when the variance of the error
                 associated with the data is unknown. The data may be
                 unequally spaced and nonuniformly weighted. The
                 algorithm exploits the banded structure of the matrices
                 associated with the cubic smoothing spline problem.
                 Bayesian point error estimates are also calculated in
                 $O(n)$ operations.",
  keywords =     "algorithms",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Smoothing. {\bf G.1.1}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Spline and piecewise polynomial
                 interpolation. {\bf G.1.2}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Approximation, Spline and piecewise
                 polynomial approximation. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS, Statistical
                 software.",
}

@Article{Mehta:1986:AFF,
  author =       "Cyrus R. Mehta and Nitin R. Patel",
  title =        "Algorithm 643: {FEXACT}: {A FORTRAN} Subroutine for
                 {Fisher}'s Exact Test on Unordered $r\times c$
                 Contingency Tables",
  journal =      j-TOMS,
  volume =       "12",
  number =       "2",
  pages =        "154--161",
  month =        jun,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214326.html",
  abstract =     "The computer code for Mehta and Patel's (1983) network
                 algorithm for Fisher's exact test on unordered $r\times
                 c$ contingency tables is provided. The code is written
                 in double precision FORTRAN 77. This code provides the
                 fastest currently available method for executing
                 Fisher's exact test, and is shown to be orders of
                 magnitude superior to any other available algorithm.
                 Many important details of data structures and
                 implementation that have contributed crucially to the
                 success of the network algorithm are recorded here.",
  keywords =     "algorithms",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Nonlinear programming. {\bf
                 G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical computing. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical software.",
}

@Article{McKeown:1986:IIU,
  author =       "G. P. McKeown",
  title =        "Iterated Interpolation Using a Systolic Array",
  journal =      j-TOMS,
  volume =       "12",
  number =       "2",
  pages =        "162--170",
  month =        jun,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/6500.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  review =       "ACM CR 8703-0161",
  subject =      "{\bf B.6.1}: Hardware, LOGIC DESIGN, Design Styles,
                 Cellular arrays and automata. {\bf G.1.0}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, General, Parallel
                 algorithms. {\bf G.1.1}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Interpolation.",
}

@Article{Krogh:1986:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "12",
  number =       "2",
  pages =        "171--174",
  month =        jun,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:20:12 1994",
  acknowledgement = ack-nhfb,
}

@Article{Hall:1986:ESR,
  author =       "George Hall",
  title =        "Equilibrium States of {Runge-Kutta} Schemes: Part
                 {II}",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "183--192",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:21:39 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/7922.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Single step methods. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Enright:1986:IRK,
  author =       "W. H. Enright and K. R. Jackson and S. P. N{\o}rsett
                 and P. G. Thomsen",
  title =        "Interpolants for {Runge-Kutta} Formulas",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "193--218",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:21:52 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/7923.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  review =       "ACM CR 8707-0591",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Single step
                 methods. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Error analysis. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Initial value problems. {\bf G.1.1}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Interpolation,
                 Interpolation formulas.",
}

@Article{Kallay:1986:PCM,
  author =       "Michael Kallay",
  title =        "Plane Curves of Minimal Energy",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "219--222",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:22:21 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/7924.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  review =       "ACM CR 8706-0499",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation, Spline
                 and piecewise polynomial approximation. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Constrained optimization. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Curve,
                 surface, solid, and object representations.",
}

@Article{Skeel:1986:NBL,
  author =       "Robert D. Skeel and Thu V. Vu",
  title =        "Note on Blended Linear Multistep Formulas",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "223--224",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/7925.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Stiff equations. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Single step methods.",
}

@Article{Sagie:1986:CAM,
  author =       "Ike Sagie",
  title =        "Computer-Aided Modeling and Planning ({CAMP})",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "225--248",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/15667.html",
  acknowledgement = ack-nhfb,
  keywords =     "economics; languages; management",
  review =       "ACM CR 8710-0893",
  subject =      "{\bf J.6}: Computer Applications, COMPUTER-AIDED
                 ENGINEERING, Computer-aided design (CAD). {\bf H.2.3}:
                 Information Systems, DATABASE MANAGEMENT, Languages.
                 {\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Linear programming. {\bf
                 H.1.2}: Information Systems, MODELS AND PRINCIPLES,
                 User/Machine Systems, Human factors. {\bf I.6.2}:
                 Computing Methodologies, SIMULATION AND MODELING,
                 Simulation Languages. {\bf I.2.7}: Computing
                 Methodologies, ARTIFICIAL INTELLIGENCE, Natural
                 Language Processing.",
}

@Article{Liu:1986:SRC,
  author =       "Joseph W. H. Liu",
  title =        "On the Storage Requirement in the Out-of-Core
                 Multifrontal Method for Sparse Factorization",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "249--264",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:23:42 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/11325.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  review =       "ACM CR 8709-0776",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Amos:1986:APP,
  author =       "D. E. Amos",
  title =        "Algorithm 644: {A} Portable Package for {Bessel}
                 Functions of a Complex Argument and Nonnegative Order",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "265--273",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 21:24:01 1994",
  note =         "See also \cite{Amos:1990:RPP}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214331.html",
  abstract =     "This algorithm is a package of subroutines for
                 Computing Bessel functions $H_{v}^{(1)}(z)$,
                 $H_{v}^{(2)}(z)$, $I_{v}(z)$, $J_{v}(z)$, $K_{v}(z)$,
                 $Y_{v}(z)$ and Airy functions $\mbox{Ai}(z)$,
                 $\mbox{Ai}'(z)$, $\mbox{Bi}(z)$, $\mbox{Bi}'(z)$ for
                 orders $v>=0$ and complex $z$ in $-\pi< \mbox{arg} z <=
                 \pi$. Eight callable subroutines and their
                 double-precision counterparts are provided. Exponential
                 scaling and sequence generation are auxiliary
                 options.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf G.1.m}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Miscellaneous. {\bf G.m}: Mathematics of Computing,
                 MISCELLANEOUS.",
}

@Article{Nash:1986:AST,
  author =       "J. C. Nash and R. L. C. Wang",
  title =        "Algorithm 645: Subroutines for Testing Programs that
                 Compute the Generalized Inverse of a Matrix",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "274--277",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214334.html",
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods).",
}

@Article{Crawford:1986:APR,
  author =       "Charles R. Crawford",
  title =        "Algorithm 646: {PDFIND}: {A} Routine to Find a
                 Positive Definite Linear Combination of Two Real
                 Symmetric Matrices",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "278--282",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:24:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214335.html",
  abstract =     "PDFIND is a FORTRAN-77 implementation of an algorithm
                 that finds a positive definite linear combination of
                 two symmetric matrices, or determines that such a
                 combination does not exist. The algorithm is designed
                 to be independent of the data structures used to store
                 the matrices. The user must provide a subroutine,
                 CHLSKY, which acts as an interface between PDFIND and
                 the matrix data structures. CHLSKY also provides the
                 user control over the number of iterations of the
                 algorithm. Implementations of CHLSKY are included which
                 call LINPAC routines for full matrices as well as
                 symmetric banded matrices.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; geig; nla; symmetric matrix",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra.",
}

@Article{Hake:1986:RCC,
  author =       "J.-Fr. Hake",
  title =        "Remark on ``{Algorithm} 569: {COLSYS}: Collocation
                 Software for Boundary-Value {ODEs} [{D2}]''",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "283--284",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:16:18 1994",
  note =         "See \cite{Ascher:1981:ACC}.",
  acknowledgement = ack-nhfb,
}

@Article{Stewart:1986:CNC,
  author =       "G. W. Stewart",
  title =        "Corrigendum: ``{A} Note on Complex Division''",
  journal =      j-TOMS,
  volume =       "12",
  number =       "3",
  pages =        "285--285",
  month =        sep,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:17:25 1994",
  note =         "See \cite{Stewart:1985:NCD}.",
  acknowledgement = ack-nhfb,
}

@Article{Milovanovic:1986:CEI,
  author =       "G. V. Milovanovi{\'{c}} and M. S. Petkovi{\'{c}}",
  title =        "On Computational Efficiency of the Iterative Methods
                 for the Simultaneous Approximation of Polynomial
                 Zeros",
  journal =      j-TOMS,
  volume =       "12",
  number =       "4",
  pages =        "295--306",
  month =        dec,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:39:24 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/8932.html",
  acknowledgement = ack-nhfb,
  keywords =     "measurement; performance",
  review =       "ACM CR 8707-0590",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Iterative
                 methods.",
}

@Article{Nazareth:1986:IAO,
  author =       "J. L. Nazareth",
  title =        "Implementation Aids for Optimization Algorithms that
                 Solve Sequences of Linear Programs",
  journal =      j-TOMS,
  volume =       "12",
  number =       "4",
  pages =        "307--323",
  month =        dec,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:29:30 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/22959.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; languages",
  review =       "ACM CR 8708-0686",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Linear programming. {\bf
                 G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Constrained optimization. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Nonlinear programming. {\bf D.2.2}:
                 Software, SOFTWARE ENGINEERING, Tools and Techniques,
                 Modules and interfaces. {\bf D.2.2}: Software, SOFTWARE
                 ENGINEERING, Tools and Techniques, Software libraries.
                 {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Modules, packages.",
}

@Article{Cowell:1986:TFD,
  author =       "Wayne R. Cowell and Christopher P. Thompson",
  title =        "Transforming {Fortran DO} Loops to Improve Performance
                 on Vector Architectures",
  journal =      j-TOMS,
  volume =       "12",
  number =       "4",
  pages =        "324--353",
  month =        dec,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:30:12 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/24035.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; performance",
  review =       "ACM CR 8712-0989",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra. {\bf C.1.2}: Computer Systems Organization,
                 PROCESSOR ARCHITECTURES, Multiple Data Stream
                 Architectures (Multiprocessors), Array and vector
                 processors.",
}

@Article{Ostermann:1986:SCP,
  author =       "A. Ostermann and P. Kaps and T. D. Bui",
  title =        "The Solution of a Combustion Problem with {Rosenbrock}
                 Methods",
  journal =      j-TOMS,
  volume =       "12",
  number =       "4",
  pages =        "354--361",
  month =        dec,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:30:24 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/22722.html",
  acknowledgement = ack-nhfb,
  keywords =     "performance",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Stiff equations. {\bf G.1.8}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Partial Differential Equations,
                 Method of lines.",
}

@Article{Fox:1986:AIR,
  author =       "Bennett L. Fox",
  title =        "Algorithm 647: Implementation and Relative Efficiency
                 of Quasirandom Sequence Generators",
  journal =      j-TOMS,
  volume =       "12",
  number =       "4",
  pages =        "362--376",
  month =        dec,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
}

@Article{Didonato:1986:CIG,
  author =       "Armido R. DiDonato and Alfred H. {Morris, Jr.}",
  title =        "Computation of the Incomplete Gamma Function Ratios
                 and Their Inverse",
  journal =      j-TOMS,
  volume =       "12",
  number =       "4",
  pages =        "377--393",
  month =        dec,
  year =         "1986",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:31:03 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/23109.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 8709-0775",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation.",
}

@Article{Enright:1987:TFP,
  author =       "W. H. Enright and J. D. Pryce",
  title =        "Two {FORTRAN} Packages for Assessing Initial Value
                 Methods",
  journal =      j-TOMS,
  volume =       "13",
  number =       "1",
  pages =        "1--27",
  month =        mar,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:36 1994",
  note =         "See also \cite{Enright:1989:CFP}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/27645.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; reliability",
  review =       "ACM CR 8803-0208",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Certification and testing.",
}

@Article{Enright:1987:ANS,
  author =       "W. H. Enright and J. D. Pryce",
  title =        "Algorithm 648: {NSDTST} and {STDTST}: Routines for
                 Assessing the Performance of {IV} Solvers",
  journal =      j-TOMS,
  volume =       "13",
  number =       "1",
  pages =        "28--34",
  month =        mar,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 21:32:17 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214338.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; reliability",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Certification and testing.",
}

@Article{Alagar:1987:FLS,
  author =       "Vangalur S. Alagar and David K. Probst",
  title =        "A Fast, Low-Space Algorithm for Multiplying Dense
                 Multivariate Polynomials",
  journal =      j-TOMS,
  volume =       "13",
  number =       "1",
  pages =        "35--57",
  month =        mar,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:32:38 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/27646.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  review =       "ACM CR 8802-0114",
  subject =      "{\bf I.1.2}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Algorithms, Algebraic algorithms. {\bf
                 I.1.2}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Algorithms, Analysis of algorithms.",
}

@Article{Vitter:1987:EAS,
  author =       "Jeffrey Scott Vitter",
  title =        "An Efficient Algorithm for Sequential Random
                 Sampling",
  journal =      j-TOMS,
  volume =       "13",
  number =       "1",
  pages =        "58--67",
  month =        mar,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:32:58 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/23003.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance",
  review =       "ACM CR 8808-0614",
  subject =      "{\bf F.2.m}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Miscellaneous. {\bf
                 G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical software.",
}

@Article{Foley:1987:IIP,
  author =       "Thomas A. Foley",
  title =        "Interpolation with Interval and Point Tension Controls
                 Using Cubic Weighted $v$-Splines",
  journal =      j-TOMS,
  volume =       "13",
  number =       "1",
  pages =        "68--96",
  month =        mar,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:26 1994",
  note =         "See also \cite{Foley:1988:CIP}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/23004.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  review =       "ACM CR 8802-0098",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization,
                 Constrained optimization. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations.",
}

@Article{Giunta:1987:APC,
  author =       "G. Giunta and A. Murli",
  title =        "Algorithm 649: {A} Package for Computing Trigonometric
                 {Fourier} Coefficients Based on {Lyness}'s Algorithm",
  journal =      j-TOMS,
  volume =       "13",
  number =       "1",
  pages =        "97--107",
  month =        mar,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214339.html",
  abstract =     "We present a package that allows the computation of
                 the trigonometric Fourier coefficients of a smooth
                 function. The function can be provided as a subprogram
                 or as a data list of function values at equally spaced
                 points.\par

                 The computational cost of the algorithm does not depend
                 on the required number of Fourier coefficients.
                 Numerical results of comparative tests with a standard
                 integrator for oscillatory functions are also
                 reported.",
  keywords =     "algorithms",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.",
}

@Article{Dyksen:1987:IEI,
  author =       "Wayne R. Dyksen and Calvin J. Ribbens",
  title =        "Interactive {ELLPACK}: An Interactive Problem-Solving
                 Environment for Elliptic Partial Differential
                 Equations",
  journal =      j-TOMS,
  volume =       "13",
  number =       "2",
  pages =        "113--132",
  month =        jun,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:35:01 1994",
  acknowledgement = ack-nhfb,
}

@Article{Pardalos:1987:GLS,
  author =       "Panos M. Pardalos",
  title =        "Generation of Large-Scale Quadratic Programs for Use
                 as Global Optimization Test Problems",
  journal =      j-TOMS,
  volume =       "13",
  number =       "2",
  pages =        "133--137",
  month =        jun,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:35:01 1994",
  acknowledgement = ack-nhfb,
}

@Article{Johnson:1987:AES,
  author =       "Kenneth C. Johnson",
  title =        "Algorithm 650: Efficient Square Root Implementation on
                 the 68000",
  journal =      j-TOMS,
  volume =       "13",
  number =       "2",
  pages =        "138--151",
  month =        jun,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 21:36:32 1994",
  note =         "See also \cite{Anonymous:1987:C}.",
  acknowledgement = ack-nhfb,
}

@Article{Morgan:1987:BBS,
  author =       "Alexander Morgan and Vadim Shapiro",
  title =        "Box-Bisection for Solving Second-Degree Systems and
                 the Problem of Clustering",
  journal =      j-TOMS,
  volume =       "13",
  number =       "2",
  pages =        "152--167",
  month =        jun,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:20 1994",
  note =         "See also \cite{Morgan:1987:CBS}.",
  acknowledgement = ack-nhfb,
}

@Article{Monahan:1987:AGC,
  author =       "John F. Monahan",
  title =        "An Algorithm for Generating Chi Random Variables",
  journal =      j-TOMS,
  volume =       "13",
  number =       "2",
  pages =        "168--172",
  month =        jun,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:24 1994",
  note =         "See also \cite{Anonymous:1987:C,Monahan:1988:CAG}.",
  acknowledgement = ack-nhfb,
}

@Article{Liu:1987:PPS,
  author =       "Joseph W. H. Liu",
  title =        "A Partial Pivoting Strategy for Sparse Symmetric
                 Matrix Decomposition",
  journal =      j-TOMS,
  volume =       "13",
  number =       "2",
  pages =        "173--182",
  month =        jun,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:35:01 1994",
  acknowledgement = ack-nhfb,
}

@Article{Krogh:1987:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "13",
  number =       "2",
  pages =        "183--186",
  month =        jun,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:35:01 1994",
  acknowledgement = ack-nhfb,
}

@Article{Kearfott:1987:STG,
  author =       "R. Baker Kearfott",
  title =        "Some Tests of Generalized Bisection",
  journal =      j-TOMS,
  volume =       "13",
  number =       "3",
  pages =        "197--220",
  month =        sep,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:33 1994",
  note =         "See also \cite{Kearfott:1988:CTG}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/29862.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Systems of
                 equations. {\bf G.1.5}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Roots of Nonlinear Equations,
                 Polynomials, methods for.",
}

@Article{Boisvert:1987:FOA,
  author =       "Ronald F. Boisvert",
  title =        "A Fourth-Order-Accurate {Fourier} Method for the
                 {Helmholtz} Equation in Three Dimensions",
  journal =      j-TOMS,
  volume =       "13",
  number =       "3",
  pages =        "221--234",
  month =        sep,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:39:43 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/29863.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory; verification",
  review =       "ACM CR 8808-0622",
  subject =      "G.1.8 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Partial Differential Equations, Elliptic equations \\
                 G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis",
}

@Article{Boisvert:1987:AAH,
  author =       "Ronald F. Boisvert",
  title =        "Algorithm 651: Algorithm {HFFT}\emdash High-Order
                 Fast-Direct Solution of the {Helmholtz} Equation",
  journal =      j-TOMS,
  volume =       "13",
  number =       "3",
  pages =        "235--249",
  month =        sep,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 21:40:33 1994",
  note =         "See also \cite{Anonymous:1987:C}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214342.html",
  abstract =     "HFFT is a software package for solving the Helmholtz
                 equation on bounded two- and three-dimensional
                 rectangular domains with Dirichlet, Neumann, or
                 periodic boundary conditions. The software is the
                 result of combining new fourth-order accurate compact
                 finite difference (HODIE) discretizations and a
                 fast-direct solution technique (the Fourier method). In
                 this paper we briefly describe the user interface to
                 HFFT and present an example of its usage and several
                 details of its implementation.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory; verification",
  subject =      "{\bf G.1.8}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations, Elliptic
                 equations. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Liu:1987:TPM,
  author =       "Joseph W. H. Liu",
  title =        "On Threshold Pivoting in the Multifrontal Method for
                 Sparse Indefinite Systems",
  journal =      j-TOMS,
  volume =       "13",
  number =       "3",
  pages =        "250--261",
  month =        sep,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:40:49 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/31331.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance; theory",
  review =       "ACM CR 8804-0281",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Corana:1987:MMF,
  author =       "A. Corana and M. Marchesi and C. Martini and S.
                 Ridella",
  title =        "Minimizing Multimodal Functions of Continuous
                 Variables with the ``Simulated Annealing'' Algorithm",
  journal =      j-TOMS,
  volume =       "13",
  number =       "3",
  pages =        "262--280",
  month =        sep,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:34 1994",
  note =         "See also \cite{Corana:1989:CMF}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/29864.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  review =       "ACM CR 8804-0282",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Nonlinear programming. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Certification and testing. {\bf G.3}: Mathematics of
                 Computing, PROBABILITY AND STATISTICS, Probabilistic
                 algorithms (including Monte Carlo). {\bf F.2.2}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Sorting and searching.",
}

@Article{Watson:1987:AHS,
  author =       "Layne T. Watson and Stephen C. Billups and Alexander
                 P. Morgan",
  title =        "Algorithm 652: {HOMPACK}: {A} Suite of Codes for
                 Globally Convergent Homotopy Algorithms",
  journal =      j-TOMS,
  volume =       "13",
  number =       "3",
  pages =        "281--310",
  month =        sep,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 21:41:46 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214343.html",
  abstract =     "There are algorithms for finding zeros or fixed points
                 of nonlinear systems of equations that are globally
                 convergent for almost all starting points, i.e., with
                 probability one. The essence of all such algorithms is
                 the construction of an appropriate homotopy map and
                 then tracking some smooth curve in the zero set of this
                 homotopy map. HOMPACK provides three qualitatively
                 different algorithms for tracking the homotopy zero
                 curve: ordinary differential equation-based, normal
                 flow, and augmented Jacobian matrix. Separate routines
                 are also provided for dense and sparse Jacobian
                 matrices. A high-level driver is included for the
                 special case of polynomial systems.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Systems of
                 equations. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Hanson:1987:ATA,
  author =       "R. J. Hanson and F. T. Krogh",
  title =        "Algorithm 653: Translation of {Algorithm} 539:
                 {PC-BLAS Basic Linear Algebra Subprograms} for
                 {FORTRAN} Usage with the {INTEL} 8087, 80287 Numeric
                 Data Processor",
  journal =      j-TOMS,
  volume =       "13",
  number =       "3",
  pages =        "311--317",
  month =        sep,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 23:07:52 1994",
  note =         "See
                 \cite{Lawson:1979:ABL,Dodson:1982:RBL,Dodson:1983:CRB,Louter-Nool:1988:ATA}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214346.html",
  acknowledgement = ack-nhfb,
}

@Article{DiDonato:1987:AFS,
  author =       "Armido R. {DiDonato} and Alfred H. {Morris Jr.}",
  title =        "Algorithm 654: {FORTRAN} Subroutines for Computing the
                 Incomplete Gamma Function Ratios and their Inverse",
  journal =      j-TOMS,
  volume =       "13",
  number =       "3",
  pages =        "318--319",
  month =        sep,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 21:43:08 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214348.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation. {\bf G.m}: Mathematics of
                 Computing, MISCELLANEOUS.",
}

@Article{Anonymous:1987:C,
  author =       "Anonymous",
  title =        "Corrigendum",
  journal =      j-TOMS,
  volume =       "13",
  number =       "3",
  pages =        "320--320",
  month =        sep,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:35:01 1994",
  note =         "See
                 \cite{Johnson:1987:AES,Monahan:1987:AGC,Boisvert:1987:AAH}.",
  acknowledgement = ack-nhfb,
}

@Article{Bar-on:1987:PPA,
  author =       "Ilan Bar-On",
  title =        "A Practical Parallel Algorithm for Solving Band
                 Symmetric Positive Definite Systems of Linear
                 Equations",
  journal =      j-TOMS,
  volume =       "13",
  number =       "4",
  pages =        "323--332",
  month =        dec,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:45:57 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/35079.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Parallel algorithms. {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Linear systems (direct and iterative
                 methods). {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra, Matrix
                 inversion.",
}

@Article{Schoenauer:1987:SCB,
  author =       "Willi Sch{\"{o}}nauer and Eric Schnepf",
  title =        "Software Considerations for the ``Black Box'' Solver
                 {FIDISOL} for Partial Differential Equations",
  journal =      j-TOMS,
  volume =       "13",
  number =       "4",
  pages =        "333--349",
  month =        dec,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:16 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/35080.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  review =       "ACM CR 8809-0699",
  subject =      "{\bf G.1.8}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations, Difference
                 methods. {\bf G.1.8}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Partial Differential Equations,
                 Elliptic equations. {\bf G.1.8}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Partial Differential
                 Equations, Parabolic equations. {\bf G.4}: Mathematics
                 of Computing, MATHEMATICAL SOFTWARE, FIDOSOL.",
}

@Article{Ahlfeld:1987:NPG,
  author =       "David P. Ahlfeld and John M. Mulvey and Ron S. Dembo
                 and Stavros A. Zenios",
  title =        "Nonlinear Programming on Generalized Networks",
  journal =      j-TOMS,
  volume =       "13",
  number =       "4",
  pages =        "350--367",
  month =        dec,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:47:23 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/42181.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  review =       "ACM CR 8810-0796",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Constrained optimization. {\bf
                 G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Gradient methods. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Nonlinear programming. {\bf G.2.2}:
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Network problems.",
}

@Article{Haas:1987:MPR,
  author =       "Alexander Haas",
  title =        "The Multiple Prime Random Number Generator",
  journal =      j-TOMS,
  volume =       "13",
  number =       "4",
  pages =        "368--381",
  month =        dec,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:45:57 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214349.html",
  abstract =     "A new pseudorandom number generator, the Multiple
                 Prime Random Number Generator, has been developed; it
                 is efficient, conceptually simple, flexible, and easy
                 to program. The generator utilizes cycles around prime
                 numbers to guarantee the length of the period, which
                 can easily be programmed to surpass the maximum period
                 of any other presently available random number
                 generator. There are minimum limits placed on the seed
                 values of the variables because the period of the
                 generator is not a function of the initial values of
                 the variables. The generator passes thirteen standard
                 random number generator tests. It requires only about
                 fifteen lines of FORTRAN code to program and utilizes
                 programming language constructs found in most major
                 languages. Finally, it compares very favorably to the
                 fastest of the other available generators.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; economics; experimentation; performance;
                 reliability",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Probabilistic algorithms (including Monte
                 Carlo). {\bf G.3}: Mathematics of Computing,
                 PROBABILITY AND STATISTICS, Random number generation.
                 {\bf I.6.3}: Computing Methodologies, SIMULATION AND
                 MODELING, Applications. {\bf I.6.4}: Computing
                 Methodologies, SIMULATION AND MODELING, Model
                 Validation and Analysis. {\bf J.2}: Computer
                 Applications, PHYSICAL SCIENCES AND ENGINEERING,
                 Mathematics and statistics. {\bf J.4}: Computer
                 Applications, SOCIAL AND BEHAVIORAL SCIENCES,
                 Economics. {\bf J.4}: Computer Applications, SOCIAL AND
                 BEHAVIORAL SCIENCES, Sociology.",
}

@Article{Schneider:1987:EEA,
  author =       "Michael H. Schneider",
  title =        "The Expanding Equilibrium Algorithm",
  journal =      j-TOMS,
  volume =       "13",
  number =       "4",
  pages =        "382--398",
  month =        dec,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:48:37 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/42322.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; economics; performance",
  review =       "ACM CR 8812-0937",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Nonlinear programming. {\bf
                 J.4}: Computer Applications, SOCIAL AND BEHAVIORAL
                 SCIENCES, Economics.",
}

@Article{Elhay:1987:AIF,
  author =       "Sylvan Elhay and Jaroslav Kautsky",
  title =        "Algorithm 655: {IQPACK}: {FORTRAN} Subroutines for the
                 Weights of Interpolatory Quadratures",
  journal =      j-TOMS,
  volume =       "13",
  number =       "4",
  pages =        "399--415",
  month =        dec,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 21:49:00 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214351.html",
  abstract =     "We present FORTRAN subroutines that implement the
                 method described in [3] for the stable evaluation of
                 the weights of interpolatory quadratures with
                 prescribed simple or multiple knots. Given a set of
                 knots and their multiplicities, the package generates
                 the weights by using the zeroth moment $\mu_{0}$ of
                 $w$, the weight function in the integrand, and the
                 (symmetric tridiagonal) Jacobi matrix $J$ associated
                 with the polynomials orthogonal on $(a, b)$ with
                 respect to $w$. There are utility routines that
                 generate $\mu_{0}$ and $J$ for classical weight
                 functions, but quadratures can be generated for any
                 $\mu_{0}$ and $J$ supplied by the user. Utility
                 routines are also provided that (1) evaluate a computed
                 quadrature, applied to a user-supplied integrand, (2)
                 check the polynomial order of precision of a quadrature
                 formula, and (3) compute the knots and weights of
                 simple Gaussian quadrature formula.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf G.1.4}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Quadrature and Numerical Differentiation, Gaussian
                 quadrature.",
}

@Article{Morgan:1987:CBS,
  author =       "Alexander Morgan and Vadim Shapiro",
  title =        "Corrigendum: ``{Box-Bisection} for Solving
                 Second-Degree Systems and the Problem of Clustering''",
  journal =      j-TOMS,
  volume =       "13",
  number =       "4",
  pages =        "416--416",
  month =        dec,
  year =         "1987",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:45:57 1994",
  note =         "See \cite{Morgan:1987:BBS}.",
  acknowledgement = ack-nhfb,
}

@Article{Dongarra:1988:ESF,
  author =       "Jack J. Dongarra and Jeremy Du Croz and Sven
                 Hammarling and Richard J. Hanson",
  title =        "An Extended Set of {FORTRAN Basic Linear Algebra
                 Subprograms}",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "1--17",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:30 1994",
  note =         "See also \cite{Dongarra:1988:CES}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/42291.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; standardization",
  review =       "ACM CR 8812-0940",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Portability. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra.",
}

@Article{Dongarra:1988:AES,
  author =       "Jack J. Dongarra and Jeremy Du Croz and Sven
                 Hammarling and Richard J. Hanson",
  title =        "Algorithm 656: An Extended Set of {Basic Linear
                 Algebra Subprograms}: Model Implementation and Test
                 Programs",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "18--32",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:52:44 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/42292.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; blas; nla; software; theory; vect",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{Sewell:1988:PCS,
  author =       "Granville Sewell",
  title =        "Plotting Contour Surfaces of a Function of Three
                 Variables",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "33--41",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:53:18 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/42289.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  review =       "ACM CR 8810-0795",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf F.2.1}:
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Numerical Algorithms and Problems.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Sewell:1988:ASP,
  author =       "Granville Sewell",
  title =        "Algorithm 657: Software for Plotting Contour Surfaces
                 of a Function of Three Variables",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "42--44",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 15:08:25 1994",
  note =         "See also \cite{Sewell:1990:RSP}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/42290.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf F.2.1}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
                 and Problems, Computations on matrices. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Numerical algorithms. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative methods).
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Leis:1988:SSS,
  author =       "Jorge R. Leis and Mark A. Kramer",
  title =        "The Simultaneous Solution and Sensitivity Analysis of
                 Systems Described by Ordinary Differential Equations",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "45--60",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:54:22 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/46156.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; performance; reliability;
                 theory",
  review =       "ACM CR 8903-0152",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations. {\bf I.6.4}:
                 Computing Methodologies, SIMULATION AND MODELING, Model
                 Validation and Analysis. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Efficiency.",
}

@Article{Leis:1988:AOO,
  author =       "Jorge R. Leis and Mark A. Kramer",
  title =        "Algorithm 658: {ODESSA}: An Ordinary Differential
                 Equation Solver with Explicit Simultaneous Sensitivity
                 Analysis",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "61--67",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214371.html",
  abstract =     "ODESSA is a package of FORTRAN routines for
                 simultaneous solution of ordinary differential
                 equations and the associated first-order parametric
                 sensitivity equations, yielding the ODE solution vector
                 $\underline{y}(t)$ and the first-order sensitivity
                 coefficients with respect to equation parameters
                 $\underline{p}$, $\partial \underline{y}(t)/\partial
                 \underline{p}$. ODESSA is a modification of the widely
                 disseminated initial-value solver LSODE, and retains
                 many of the same operational features. Standard program
                 usage and optional capabilities, installation, and
                 verification considerations are addressed herein.",
  keywords =     "algorithms; measurement; performance",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Error analysis. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Stiff equations. {\bf I.6.4}: Computing Methodologies,
                 SIMULATION AND MODELING, Model Validation and Analysis.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Efficiency.",
}

@Article{Butcher:1988:TEI,
  author =       "J. C. Butcher",
  title =        "Towards Efficient Implementation of Singly-Implicit
                 Methods",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "68--75",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/42341.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  review =       "ACM CR 8812-0938",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Single step methods. {\bf G.1.7}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Ordinary Differential
                 Equations, Stiff equations. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Efficiency.",
}

@Article{Ammann:1988:RCR,
  author =       "Larry Ammann and John Van Ness",
  title =        "A Routine for Converting Regression Algorithms into
                 Corresponding Orthogonal Regression Algorithms",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "76--87",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/42342.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; reliability",
  review =       "ACM CR 8903-0155",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE. {\bf J.2}: Computer
                 Applications, PHYSICAL SCIENCES AND ENGINEERING.",
}

@Article{Bratley:1988:AIS,
  author =       "Paul Bratley and Bennett L. Fox",
  title =        "Algorithm 659: Implementing {Sobol}'s Quasirandom
                 Sequence Generator",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "88--100",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214372.html",
  abstract =     "We compare empirically accuracy and speed of
                 low-discrepancy sequence generators of Sobol' and
                 Faure. These generators are useful for multidimensional
                 integration and global optimization. We discuss our
                 implementation of the Sobol' generator.",
  keywords =     "algorithms; measurement; performance",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Certification and testing. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency.",
}

@Article{Robertazzi:1988:BFP,
  author =       "T. G. Robertazzi and S. C. Schwartz",
  title =        "Best ``Ordering'' for Floating-Point Addition",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "101--110",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:22 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/42343.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  review =       "ACM CR 8810-0794",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Computer arithmetic.",
}

@Article{Monahan:1988:CAG,
  author =       "John F. Monahan",
  title =        "Corrigendum: ``{An} Algorithm for Generating Chi
                 Random Variables''",
  journal =      j-TOMS,
  volume =       "14",
  number =       "1",
  pages =        "111--111",
  month =        mar,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:26:33 1994",
  note =         "See \cite{Monahan:1987:AGC}.",
  acknowledgement = ack-nhfb,
}

@Article{Melhem:1988:MRS,
  author =       "Rami G. Melhem and K. V. S. Ramarao",
  title =        "Multicolor Reordering of Sparse Matrices Resulting
                 from Irregular Grids",
  journal =      j-TOMS,
  volume =       "14",
  number =       "2",
  pages =        "117--138",
  month =        jun,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:59:18 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214373.html",
  abstract =     "Many iterative algorithms for the solution of large
                 linear systems may be effectively vectorized if the
                 diagonal of the matrix is surrounded by a large band of
                 zeroes, whose width is called the zero stretch. In this
                 paper, a multicolor numbering technique is suggested
                 for maximizing the zero stretch of irregularly sparse
                 matrices. The technique, which is a generalization of a
                 known multicoloring algorithm for regularly sparse
                 matrices, executes in linear time, and produces a zero
                 stretch approximately equal to $n$/2[sigma], where
                 2[sigma] is the number of colors used in the algorithm.
                 For triangular meshes, it is shown that [sigma] \$<\$=
                 3, and that it is possible to obtain [sigma] = 2 by
                 applying a simple backtracking scheme.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.1.4}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Quadrature and Numerical
                 Differentiation, Iterative methods. {\bf G.2.2}:
                 Mathematics of Computing, DISCRETE MATHEMATICS, Graph
                 Theory, Graph algorithms. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Renka:1988:MIL,
  author =       "Robert J. Renka",
  title =        "Multivariate Interpolation of Large Sets of Scattered
                 Data",
  journal =      j-TOMS,
  volume =       "14",
  number =       "2",
  pages =        "139--148",
  month =        jun,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:00:07 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/45055.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 8903-0148",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Renka:1988:AQQa,
  author =       "Robert J. Renka",
  title =        "Algorithm 660: {QSHEP2D}: Quadratic {Shepard} Method
                 for Bivariate Interpolation of Scattered Data",
  journal =      j-TOMS,
  volume =       "14",
  number =       "2",
  pages =        "149--150",
  month =        jun,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 22:00:26 1994",
  acknowledgement = ack-nhfb,
}

@Article{Renka:1988:AQQb,
  author =       "Robert J. Renka",
  title =        "Algorithm 661: {QSHEP3D}; Quadratic {Shepard} Method
                 for Trivariate Interpolation of Scattered Data",
  journal =      j-TOMS,
  volume =       "14",
  number =       "2",
  pages =        "151--152",
  month =        jun,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214374.html",
  keywords =     "algorithms",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Wan:1988:AMD,
  author =       "S. J. Wan and S. K. M. Wong and P. Prusinkiewicz",
  title =        "An Algorithm for Multidimensional Data Clustering",
  journal =      j-TOMS,
  volume =       "14",
  number =       "2",
  pages =        "153--162",
  month =        jun,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:00:57 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/45056.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  review =       "ACM CR 8912-0911",
  subject =      "{\bf I.5.3}: Computing Methodologies, PATTERN
                 RECOGNITION, Clustering, Algorithms.",
}

@Article{Garbow:1988:SIW,
  author =       "B. S. Garbow and G. Giunta and J. N. Lyness and A.
                 Murli",
  title =        "Software for an Implementation of {Weeks}' Method for
                 the Inverse {Laplace} Transform",
  journal =      j-TOMS,
  volume =       "14",
  number =       "2",
  pages =        "163--170",
  month =        jun,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:01:52 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/45057.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 8903-0153",
  subject =      "{\bf G.1.9}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Integral Equations, Fredholm equations. {\bf
                 G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Nonlinear approximation. {\bf G.1.4}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Quadrature and Numerical Differentiation, Finite
                 difference methods.",
}

@Article{Garbow:1988:AFS,
  author =       "B. S. Garbow and G. Giunta and J. N. Lyness and A.
                 Murli",
  title =        "Algorithm 662: {A FORTRAN} Software Package for the
                 Numerical Inversion of the {Laplace} Transform Based on
                 {Weeks}' Method",
  journal =      j-TOMS,
  volume =       "14",
  number =       "2",
  pages =        "171--176",
  month =        jun,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 23:29:03 1994",
  note =         "See also \cite{Garbow:1990:RFS}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214375.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.m}: Mathematics of Computing, MISCELLANEOUS.",
}

@Article{Louter-Nool:1988:ATA,
  author =       "Margreet Louter-Nool",
  title =        "Algorithm 663: Translation of {Algorithm} 539: {Basic
                 Linear Algebra Subprograms} for {FORTRAN} Usage in
                 {FORTRAN} 200 for the {Cyber} 205",
  journal =      j-TOMS,
  volume =       "14",
  number =       "2",
  pages =        "177--195",
  month =        jun,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 23:08:05 1994",
  note =         "See
                 \cite{Lawson:1979:ABL,Dodson:1982:RBL,Dodson:1983:CRB,Hanson:1987:ATA}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/45058.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance",
  review =       "ACM CR 8904-0243",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency. {\bf D.3.2}: Software, PROGRAMMING
                 LANGUAGES, Language Classifications, FORTRAN.",
}

@Article{Diaz:1988:RCA,
  author =       "J. C. Diaz and G. Fairweather and P. Keast",
  title =        "Remark on ``{Algorithm} 603: {COLROW} and {ARCECO}:
                 {FORTRAN} Packages for Solving Certain Almost Block
                 Diagonal Linear Systems by Modified Alternate Row and
                 Column Elimination''",
  journal =      j-TOMS,
  volume =       "14",
  number =       "2",
  pages =        "196--196",
  month =        jun,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 21:59:18 1994",
  note =         "See \cite{Diaz:1983:ACA}.",
  acknowledgement = ack-nhfb,
}

@Article{Hull:1988:EHS,
  author =       "T. E. Hull and M. S. Cohen and J. T. M. Sawshuk and D.
                 B. Wortman",
  title =        "Exception Handling in Scientific Computing",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "201--217",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:27:23 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/44129.html",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Specialized application languages.
                 {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features, Control structures. {\bf
                 D.3.4}: Software, PROGRAMMING LANGUAGES, Processors,
                 Compilers. {\bf D.3.4}: Software, PROGRAMMING
                 LANGUAGES, Processors, Run-time environments. {\bf
                 G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 General, Numerical algorithms. {\bf G.4}: Mathematics
                 of Computing, MATHEMATICAL SOFTWARE, Algorithm
                 analysis.",
}

@Article{Freeman:1988:DSM,
  author =       "Timothy S. Freeman and Gregory M. Imirzian and Erich
                 Kaltofen and Lakshman Yagati",
  title =        "{Dagwood}: {A} System for Manipulating Polynomials
                 Given by Straight-Line Programs",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "218--240",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:27:49 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214376.html",
  abstract =     "We discuss the design, implementation, and
                 benchmarking of a system that can manipulate symbolic
                 expressions represented by their straight-line
                 computations. Our system is capable of performing
                 rational arithmetic on, evaluating, differentiating,
                 taking greatest common divisors of, and factoring
                 polynomials in straight-line format. The straight-line
                 results can also be converted to standard, sparse
                 format. We show by example that our system can handle
                 problems for which conventional methods lead to
                 excessive intermediate expression swell.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; measurement; performance",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Efficiency. {\bf I.1.1}: Computing
                 Methodologies, ALGEBRAIC MANIPULATION, Expressions and
                 Their Representation, Representations (general and
                 polynomial). {\bf I.1.3}: Computing Methodologies,
                 ALGEBRAIC MANIPULATION, Languages and Systems,
                 Special-purpose algebraic systems.",
}

@Article{Grimes:1988:SLD,
  author =       "Roger G. Grimes and Horst D. Simon",
  title =        "Solution of Large, Dense Symmetric Generalized
                 Eigenvalue Problems Using Secondary Storage",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "241--256",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:29:30 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/44130.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  review =       "ACM CR 8903-0149",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf
                 G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Numerical Linear Algebra, Sparse and very large
                 systems. {\bf D.4.2}: Software, OPERATING SYSTEMS,
                 Storage Management, Secondary storage.",
}

%=======================================================================
% Bibliography entries from Software -- Practice and Experience.

@Article{Schrauf:1988:AGA,
  author =       "G{\'{e}}za Schrauf",
  title =        "Algorithm 664: {A Gauss} Algorithm to Solve Systems
                 with Large Banded Matrices Using Random-Access Disk
                 Storage",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "257--260",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214379.html",
  abstract =     "A FORTRAN 77 implementation of a Gauss algorithm with
                 partial pivoting for banded matrices is described. The
                 algorithm keeps only part of the matrix that is
                 necessary for the actual computation in memory. This
                 allows large systems to be solved on machine without
                 virtual memory, or if the virtual memory is too small
                 for the problem.",
  keywords =     "algorithms",
  subject =      "{\bf F.2.1}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
                 and Problems, Computations on matrices. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Numerical algorithms. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative methods).
                 {\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems.",
}

@Article{Minh:1988:GGV,
  author =       "D. L. Minh",
  title =        "Generating Gamma Variates",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "261--266",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:30:10 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214382.html",
  abstract =     "An algorithm to generate variates having a gamma
                 distribution with shape parameter greater than one is
                 presented in this paper. This algorithm is faster than
                 Schmeiser and Lal's G4PE, which is the fastest one
                 currently available, yet is equally simple and easy to
                 implement.",
  acknowledgement = ack-nhfb,
  country =      "USA",
  date =         "13/05/93",
  descriptors =  "RVG;",
  enum =         "7672",
  keywords =     "algorithms; theory",
  language =     "English",
  location =     "SEL: Wi",
  references =   "0",
  revision =     "16/01/94",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf I.6.1}: Computing Methodologies,
                 SIMULATION AND MODELING, Simulation Theory.",
}

@Article{Duff:1988:RIN,
  author =       "Iain S. Duff and Torbj{\"o}rn Wiberg",
  title =        "Remarks on Implementation of ${O}(n^{1/2}\tau)$
                 Assignment Algorithms",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "267--287",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/44131.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  review =       "ACM CR 8904-0244",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.2.2}: Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm analysis.",
}

@Article{Cormack:1988:RTP,
  author =       "R. S. Cormack and I. D. Hill",
  title =        "Remark on ``{Algorithm} 346: ${F}$-Test
                 Probabilities''",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "288--289",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:27:49 1994",
  note =         "See \cite{Morris:1969:TP}.",
  acknowledgement = ack-nhfb,
}

@Article{Krogh:1988:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "290--293",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:27:49 1994",
  acknowledgement = ack-nhfb,
}

@Article{Foley:1988:CIP,
  author =       "Thomas A. Foley",
  title =        "Corrigendum: ``{Interpolation} with Interval and Point
                 Tension Controls Using Cubic Weighted $v$-Splines''",
  journal =      j-TOMS,
  volume =       "14",
  number =       "3",
  pages =        "297--297",
  month =        sep,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:26:45 1994",
  note =         "See \cite{Foley:1987:IIP}.",
  acknowledgement = ack-nhfb,
}

@Article{Cody:1988:AMS,
  author =       "W. J. Cody",
  title =        "Algorithm 665: {MACHAR}: {A} Subroutine to Dynamically
                 Determine Machine Parameters",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "303--311",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:33:58 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/51907.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Portability. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Computer
                 arithmetic.",
}

@Article{Vrahatis:1988:SSN,
  author =       "Michael N. Vrahatis",
  title =        "Solving Systems of Nonlinear Equations Using the
                 Nonzero Value of the Topological Degree",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "312--329",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:34:19 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214384.html",
  abstract =     "Two algorithms are described here for the numerical
                 solution of a system of nonlinear equations $F(X) =
                 \Theta, Q=(0,0,\ldots,0)$ in $R$, and $F$ is a given
                 continuous mapping of a region $D$ in $R^{n}$ into
                 $R^{n}$. The first algorithm locates at least one root
                 of the sy stem within $n$-dimensional polyhedron, using
                 the nonzero value of the topological degree of $F$ at
                 [theta] relative to the polyhedron; the second
                 algorithm applies a new generalized bisection method in
                 order to compute an approximate solution to the system.
                 The size of the original $n$-dimensional polyhedron is
                 arbitrary, and the method is globally convergent in a
                 residual sense. \par

                 These algorithms, in the various function evaluations,
                 only make use of the algebraic sign of $F$ and do not
                 require computations of the topological degree.
                 Moreover, they can be applied to nondifferentiable
                 continuous functions $F$ and do not involve derivatives
                 of $F$ or approximations of such derivatives.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Systems of
                 equations. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Vrahatis:1988:ACM,
  author =       "Michael N. Vrahatis",
  title =        "Algorithm 666: {CHABIS}: {A} Mathematical Software
                 Package for Locating and Evaluating Roots of Systems of
                 Nonlinear Equations",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "330--336",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 15:08:54 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/51906.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Portability. {\bf G.1.5}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Roots of Nonlinear
                 Equations, Systems of equations.",
}

@Article{Garavelli:1988:AMS,
  author =       "John S. Garavelli",
  title =        "An Algorithm for the Multiplication of Symmetric
                 Polynomials",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "337--344",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:34:19 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214385.html",
  abstract =     "Although the cycle index polynomial for a permutation
                 group can often be easily determined, expansion of the
                 figure counting series in a P{\'o}lya enumeration
                 presents computational difficulties for object sets
                 with higher degrees of symmetry and more than modest
                 size. An algorithm that does not require algebraic
                 symbol manipulation is derived for multiplying
                 symmetric polynomials represented by partitions.
                 Because the repetitive identification and collection of
                 common terms are eliminated and storage requirements
                 reduced, this algorithm is useful in rapidly expanding
                 the figure counting series in such P{\'o}lya
                 enumeration problems as the counting of chemical
                 isomers.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.2.1}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Combinatorics, Combinatorial algorithms.
                 {\bf I.1.1}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Expressions and Their Representation,
                 Representations (general and polynomial). {\bf I.1.2}:
                 Computing Methodologies, ALGEBRAIC MANIPULATION,
                 Algorithms, Algebraic algorithms.",
}

@Article{Aluffi-Pentini:1988:GOA,
  author =       "Filippo Aluffi-Pentini and Valerio Parisi and
                 Francesco Zirilli",
  title =        "A Global Optimization Algorithm Using Stochastic
                 Differential Equations",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "345--365",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:36:23 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/50064.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; theory; verification",
  review =       "ACM CR 8907-0480",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Certification and testing.",
}

@Article{Aluffi-Pentini:1988:ASE,
  author =       "Filippo Aluffi-Pentini and Valerio Parisi and
                 Francesco Zirilli",
  title =        "Algorithm 667: {SIGMA}\emdash {A}
                 Stochastic-Integration Global Minimization Algorithm",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "366--380",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/51908.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Portability. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization.",
}

@Article{Higham:1988:AFC,
  author =       "Nicholas J. Higham",
  title =        "Algorithm 674: {FORTRAN} Codes for Estimating the
                 One-Norm of a Real or Complex Matrix, with Applications
                 to Condition Estimation",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "381--396",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 15:05:32 1994",
  note =         "See also \cite{Higham:1989:CFC}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214386.html",
  abstract =     "FORTRAN 77 codes SONEST and CONEST are presented for
                 estimating the 1-norm ( or the infinity-norm) of a real
                 or complex matrix, respectively. The codes are of wide
                 applicability in condition estimation since explicit
                 access to the matrix, $A$, is not required; instead,
                 matrix-vector products $Ax$ and $A^Tx$ are computed by
                 the calling program via a reverse communication
                 interface. The algorithms are based on a convex
                 optimization method for estimating the 1-norm of a real
                 matrix devised by Hager. We derive new results
                 concerning the behavior of Hager's method, extend it to
                 complex matrices, and make several algorithmic
                 modifications in order to improve the reliability and
                 efficiency.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; condition estimation; nla; software",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra.",
}

@Article{Kachitvichyanukul:1988:AHS,
  author =       "Voratas Kachitvichyanukul and Bruce W. Schmeiser",
  title =        "Algorithm 668: {H2PEC}: Sampling from the
                 Hypergeometric Distribution",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "397--398",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 4 22:37:31 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214387.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.m}:
                 Mathematics of Computing, MISCELLANEOUS.",
}

@Article{Dongarra:1988:CES,
  author =       "Jack J. Dongarra and Jeremy Du Croz and Sven
                 Hammarling and Richard J. Hanson",
  title =        "Corrigenda: ``{An} Extended Set of {FORTRAN Basic
                 Linear Algebra Subprograms}''",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "399--399",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:03:54 1994",
  note =         "See \cite{Dongarra:1988:ESF}.",
  acknowledgement = ack-nhfb,
}

@Article{Kearfott:1988:CTG,
  author =       "R. Baker Kearfott",
  title =        "Corrigenda: ``{Some} Tests of Generalized
                 Bisection''",
  journal =      j-TOMS,
  volume =       "14",
  number =       "4",
  pages =        "399--399",
  month =        dec,
  year =         "1988",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:04:08 1994",
  note =         "See \cite{Kearfott:1987:STG}.",
  acknowledgement = ack-nhfb,
}

@Article{Duff:1989:SMT,
  author =       "Iain S. Duff and Roger G. Grimes and John G. Lewis",
  title =        "Sparse Matrix Test Problems",
  journal =      j-TOMS,
  volume =       "15",
  number =       "1",
  pages =        "1--14",
  month =        mar,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:42:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/62043.html",
  acknowledgement = ack-nhfb,
  keywords =     "measurement; performance",
  review =       "ACM CR 9002-0143",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Cash:1989:BRK,
  author =       "J. R. Cash",
  title =        "A Block 6(4) {Runge-Kutta} Formula for Nonstiff
                 Initial Value Problems",
  journal =      j-TOMS,
  volume =       "15",
  number =       "1",
  pages =        "15--28",
  month =        mar,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:42:48 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/62042.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; theory",
  review =       "ACM CR 8909-0672",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE. {\bf G.1.1}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Interpolation,
                 Interpolation formulas.",
}

@Article{Cash:1989:ABF,
  author =       "J. R. Cash",
  title =        "Algorithm 669: {BRKF45}: {A FORTRAN} Subroutine for
                 Solving First-Order Systems of Nonstiff Initial Value
                 Problems for Ordinary Differential Equations",
  journal =      j-TOMS,
  volume =       "15",
  number =       "1",
  pages =        "29--30",
  month =        mar,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:44:52 1994",
  note =         "See also \cite{Higham:1991:RBF}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214388.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Interpolation formulas. {\bf
                 G.1.7}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Ordinary Differential Equations, Initial value
                 problems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Brankin:1989:ARK,
  author =       "R. W. Brankin and I. Gladwell and J. R. Dormand and P.
                 J. Prince and W. L. Seward",
  title =        "Algorithm 670: a {Runge-Kutta-Nystr{\"o}m} code",
  journal =      j-TOMS,
  volume =       "15",
  number =       "1",
  pages =        "31--40",
  month =        mar,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/69650.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Reliability and robustness.",
}

@Article{Cody:1989:PEP,
  author =       "W. J. Cody and L. Stoltz",
  title =        "Performance Evaluation of Programs for Certain
                 {Bessel} Functions",
  journal =      j-TOMS,
  volume =       "15",
  number =       "1",
  pages =        "41--48",
  month =        mar,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:43:58 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/62039.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; reliability; verification",
  review =       "ACM CR 8911-0825",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Certification and testing. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Reliability and robustness. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Numerical
                 algorithms.",
}

@Article{Shanno:1989:NES,
  author =       "David F. Shanno and Kang Hoh Phua",
  title =        "Numerical Experience with Sequential Quadratic
                 Programming Algorithms for Equality Constrained
                 Nonlinear Programming",
  journal =      j-TOMS,
  volume =       "15",
  number =       "1",
  pages =        "49--63",
  month =        mar,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:44:29 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/62040.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 8909-0670",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Nonlinear programming. {\bf
                 G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Constrained optimization.",
}

@Article{Chang:1989:IPS,
  author =       "Michael D. Chang and Chou-Hong J. Chen and Michael
                 Engquist",
  title =        "An Improved Primal Simplex Variant for Pure Processing
                 Networks",
  journal =      j-TOMS,
  volume =       "15",
  number =       "1",
  pages =        "64--78",
  month =        mar,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/62041.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance; theory",
  review =       "ACM CR 8909-0669",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Linear programming. {\bf
                 G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
                 Graph Theory, Network problems. {\bf G.4}: Mathematics
                 of Computing, MATHEMATICAL SOFTWARE, Efficiency.",
}

@Article{Preusser:1989:AFF,
  author =       "Albrecht Preusser",
  title =        "Algorithm 671: {FARB-E-2D}: Fill Area with Bicubics on
                 Rectangles\emdash {A} Contour Plot Program",
  journal =      j-TOMS,
  volume =       "15",
  number =       "1",
  pages =        "79--89",
  month =        mar,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:46:19 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/69651.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations.",
}

@Article{Morgan:1989:FAI,
  author =       "Alexander P. Morgan and Andrew J. Sommese and Layne T.
                 Watson",
  title =        "Finding All Isolated Solutions to Polynomial Systems
                 Using {HOMPACK}",
  journal =      j-TOMS,
  volume =       "15",
  number =       "2",
  pages =        "93--122",
  month =        jun,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:46:37 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/64124.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  review =       "ACM CR 8912-0895",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, HOMPACK. {\bf G.1.5}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Roots of Nonlinear
                 Equations, Systems of equations. {\bf G.1.5}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Roots of
                 Nonlinear Equations, Polynomials, methods for.",
}

@Article{Patterson:1989:AGIa,
  author =       "T. N. L. Patterson",
  title =        "An Algorithm for Generating Interpolatory Quadrature
                 Rules of the Highest Degree of Precision with
                 Preassigned Nodes for General Weight Functions",
  journal =      j-TOMS,
  volume =       "15",
  number =       "2",
  pages =        "123--136",
  month =        jun,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:46:58 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/63523.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 9006-0500",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation,
                 Gaussian quadrature. {\bf G.1.1}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Interpolation. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations on polynomials.",
}

@Article{Patterson:1989:AGIb,
  author =       "T. N. L. Patterson",
  title =        "Algorithm 672: Generation of Interpolatory Quadrature
                 Rules of the Highest Degree of Precision with
                 Preassigned Nodes for General Weight Functions",
  journal =      j-TOMS,
  volume =       "15",
  number =       "2",
  pages =        "137--143",
  month =        jun,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/69649.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; performance",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.
                 {\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Tang:1989:TDI,
  author =       "Ping Tak Peter Tang",
  title =        "Table-Driven Implementation of the Exponential
                 Function in {IEEE} Floating-Point Arithmetic",
  journal =      j-TOMS,
  volume =       "15",
  number =       "2",
  pages =        "144--157",
  month =        jun,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:47:40 1994",
  bibsource =    "garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214389.html",
  abstract =     "Algorithms and implementation details for the
                 exponential function in both single- and
                 double-precision of IEEE 754 arithmetic are presented
                 here. With a table of moderate size, the
                 implementations need only working-precision arithmetic
                 and are provably accurate to within 0.54 ulp as long as
                 the final result does not underflow. When the final
                 result suffers gradual underflow, the error is still no
                 worse than 0.77 ulp.",
  acknowledgement = ack-nj,
  keywords =     "algorithms",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Computer arithmetic. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Error analysis. {\bf G.1.0}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, General, Numerical algorithms. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{Vitter:1989:ADH,
  author =       "Jeffrey Scott Vitter",
  title =        "Algorithm 673: Dynamic {Huffman} Coding",
  journal =      j-TOMS,
  volume =       "15",
  number =       "2",
  pages =        "158--167",
  month =        jun,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:47:58 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214390.html",
  abstract =     "We present a Pascal implementation of the one-pass
                 algorithm for constructing dynamic Huffman codes that
                 is described and analyzed in a companion paper. The
                 program runs in real time; that is, the processing time
                 for each letter of the message is proportional to the
                 length of its codeword. The number of bits used to
                 encode a message of $t$ letters is less than $t$ bits
                 more than that used by the well-known two-pass
                 algorithm. This is best possible for any one-pass
                 Huffman scheme. In practice, it uses fewer bits than
                 all other Huffman schemes. The algorithm has
                 applications in file compression and network
                 transmission.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance; theory",
  subject =      "{\bf C.2.0}: Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, General, Data
                 communications. {\bf E.1}: Data, DATA STRUCTURES,
                 Trees. {\bf E.4}: Data, CODING AND INFORMATION THEORY,
                 Data compaction and compression. {\bf E.4}: Data,
                 CODING AND INFORMATION THEORY, Nonsecret encoding
                 schemes. {\bf F.2.2}: Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems. {\bf G.2.2}: Mathematics of
                 Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
                 {\bf H.1.1}: Information Systems, MODELS AND
                 PRINCIPLES, Systems and Information Theory, Value of
                 information.",
}

@Article{Higham:1989:CFC,
  author =       "Nicholas J. Higham",
  title =        "Corrigendum: ``{Algorithm} 674: {FORTRAN} Codes for
                 Estimating the One-Norm of a Real or Complex Matrix,
                 with Applications to Condition Estimation''",
  journal =      j-TOMS,
  volume =       "15",
  number =       "2",
  pages =        "168--168",
  month =        jun,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:18:49 1994",
  note =         "See \cite{Higham:1988:AFC}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/214391.html",
  abstract =     "We omitted giving this article an ACM algorithm number
                 when it was first published in its entirety in the
                 December 1988 issue of {\em TOMS}, Vol. 14, No. 4, pp.
                 381-396. To correct this, we do so here, and reprint
                 the title as a pointer to the original article.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra.",
}

@Article{Krogh:1989:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "15",
  number =       "2",
  pages =        "169--172",
  month =        jun,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:19:04 1994",
  acknowledgement = ack-nhfb,
}

@Article{Ribbens:1989:FAG,
  author =       "Calvin J. Ribbens",
  title =        "A Fast Adaptive Grid Scheme for Elliptic Partial
                 Differential Equations",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "179--197",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:50:47 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/66889.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 9006-0506",
  subject =      "{\bf G.1.8}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations, Elliptic
                 equations. {\bf G.1.0}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, General, Parallel algorithms.",
}

@Article{Liu:1989:GPA,
  author =       "Joseph W. H. Liu",
  title =        "A Graph Partitioning Algorithm by Node Separators",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "198--219",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:51:08 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/66890.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 9003-0235",
  subject =      "{\bf G.2.2}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Graph algorithms. {\bf
                 G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Numerical Linear Algebra, Sparse and very large
                 systems. {\bf F.2.1}: Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical
                 Algorithms and Problems, Computations on matrices.",
}

@Article{Mahdavi-Amiri:1989:CNL,
  author =       "Nezam Mahdavi-Amiri and Richard H. Bartels",
  title =        "Constrained Nonlinear Least Squares: An Exact Penalty
                 Approach with Projected Structured Quasi-{Newton}
                 Updates",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "220--242",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:51:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/66891.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  review =       "ACM CR 9004-0320",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization. {\bf G.1.5}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Roots of Nonlinear
                 Equations.",
}

@Article{Vanbegin:1989:AFS,
  author =       "Michel Vanbegin and Paul Van Dooren and Michel
                 Verhaegen",
  title =        "Algorithm 675: {FORTRAN} Subroutines for Computing the
                 Square Root Covariance Filter and Square Root
                 Information Filter in Dense or {Hessenberg} Forms",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "243--256",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:52:41 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/69647.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm analysis. {\bf G.1.3}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative methods).
                 {\bf F.2.1}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
                 and Problems, Computations on matrices.",
}

@Article{Dadurkevicius:1989:RA,
  author =       "Virgis Dadurkevi{\v{c}}ius",
  title =        "Remark on ``{Algorithm} 587: Two Algorithms for the
                 Linearly Constrained Least Squares Problem''",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "257--261",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 20:52:30 1994",
  note =         "See \cite{Hanson:1982:ATA}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/77344.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Constrained optimization. {\bf
                 G.1.2}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Least squares approximation. {\bf
                 G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Least squares methods.",
}

@Article{Buckley:1989:RA,
  author =       "A. Buckley",
  title =        "Remark on Algorithm 630",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "262--274",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:53:33 1994",
  note =         "See \cite{Buckley:1985:ABE}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/69648.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Gradient methods.",
}

@Article{Domich:1989:RHN,
  author =       "Paul D. Domich",
  title =        "Residual {Hermite} Normal Form Computations",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "275--286",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:53:52 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/66892.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  review =       "ACM CR 9007-0597",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra. {\bf F.2.1}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on matrices.",
}

@Article{Corana:1989:CMF,
  author =       "A. Corana and M. Marchesi and C. Martini and S.
                 Ridella",
  title =        "Corrigenda: ``{Minimizing} Multimodal Functions of
                 Continuous Variables with the `Simulated Annealing'
                 Algorithm''",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "287--287",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 24 09:58:06 1996",
  note =         "See \cite{Corana:1987:MMF}.",
  acknowledgement = ack-nhfb,
}

@Article{Enright:1989:CFP,
  author =       "W. H. Enright and J. D. Pryce",
  title =        "Corrigenda: ``{Two FORTRAN} Packages for Assessing
                 Initial Value Methods''",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "287--287",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:27:00 1994",
  note =         "See \cite{Enright:1987:TFP}.",
  acknowledgement = ack-nhfb,
}

@Article{Le:1989:CED,
  author =       "D. Le",
  title =        "Corrigenda: ``{An} Efficient Derivative-Free Method
                 for Solving Nonlinear Equations''",
  journal =      j-TOMS,
  volume =       "15",
  number =       "3",
  pages =        "287--287",
  month =        sep,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:04:51 1994",
  note =         "See \cite{Le:1985:EDF}.",
  acknowledgement = ack-nhfb,
}

@Article{Ashcraft:1989:IRS,
  author =       "Cleve Ashcraft and Roger Grimes",
  title =        "The Influence of Relaxed Supernode Partitions on the
                 Multifrontal Method",
  journal =      j-TOMS,
  volume =       "15",
  number =       "4",
  pages =        "291--309",
  month =        dec,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:58:46 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/76910.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf F.2.1}: Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Numerical Algorithms and Problems, Computations on
                 matrices. {\bf G.2.2}: Mathematics of Computing,
                 DISCRETE MATHEMATICS, Graph Theory. {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Linear systems (direct and iterative
                 methods).",
}

@Article{Liu:1989:MMP,
  author =       "Joseph W. H. Liu",
  title =        "The Multifrontal Method and Paging in Sparse
                 {Cholesky} Factorization",
  journal =      j-TOMS,
  volume =       "15",
  number =       "4",
  pages =        "310--325",
  month =        dec,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:59:06 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/76911.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; experimentation; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra, Matrix
                 inversion. {\bf D.4.2}: Software, OPERATING SYSTEMS,
                 Storage Management, Virtual memory. {\bf F.2.1}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on matrices.",
}

@Article{Mitchell:1989:CAR,
  author =       "William F. Mitchell",
  title =        "A Comparison of Adaptive Refinement Techniques for
                 Elliptic Problems",
  journal =      j-TOMS,
  volume =       "15",
  number =       "4",
  pages =        "326--347",
  month =        dec,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 22:59:21 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/76912.html",
  acknowledgement = ack-nhfb,
  keywords =     "experimentation",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.1.8}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Partial
                 Differential Equations, Finite element methods. {\bf
                 G.1.8}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Partial Differential Equations, Elliptic equations.
                 {\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation.",
}

@Article{Boggs:1989:AOS,
  author =       "Paul T. Boggs and Janet R. Donaldson and Richard h.
                 Byrd and Robert B. Schnabel",
  title =        "Algorithm 676: {ODRPACK}: Software for Weighted
                 Orthogonal Distance Regression",
  journal =      j-TOMS,
  volume =       "15",
  number =       "4",
  pages =        "348--364",
  month =        dec,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 15:09:23 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/76913.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical computing. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Least squares methods.",
}

@Article{Montefusco:1989:ASI,
  author =       "Laura Bacchelli Montefusco and Giulio Casciola",
  title =        "Algorithm 677: ${C}^1$ Surface Interpolation",
  journal =      j-TOMS,
  volume =       "15",
  number =       "4",
  pages =        "365--374",
  month =        dec,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:22:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/76914.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization.",
}

@Article{Corliss:1989:IIV,
  author =       "George Corliss and Gary Krenz",
  title =        "Indefinite Integration with Validation",
  journal =      j-TOMS,
  volume =       "15",
  number =       "4",
  pages =        "375--393",
  month =        dec,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:01:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/76915.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  review =       "ACM CR 9007-0598",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.
                 {\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Elementary function
                 approximation. {\bf G.1.2}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Approximation, Chebyshev
                 approximation and theory.",
}

@Article{Kachitvichyanukul:1989:ABS,
  author =       "Voratas Kachitvichyanukul and Bruce W. Schmeiser",
  title =        "Algorithm 678: {BTPEC}: Sampling from the Binomial
                 Distribution",
  journal =      j-TOMS,
  volume =       "15",
  number =       "4",
  pages =        "394--397",
  month =        dec,
  year =         "1989",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 13 17:26:53 MDT 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/76916.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation.",
}

@Article{Dongarra:1990:SLB,
  author =       "Jack J. Dongarra and Jeremy Du Croz and Sven
                 Hammarling and Iain Duff",
  title =        "A Set of Level 3 {Basic Linear Algebra Subprograms}",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "1--17",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 19:10:43 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/79170.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance; reliability;
                 verification",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear
                 systems (direct and iterative methods). {\bf F.2.1}:
                 Theory of Computation, ANALYSIS OF ALGORITHMS AND
                 PROBLEM COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on matrices. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Numerical
                 algorithms.",
}

@Article{Dongarra:1990:ASL,
  author =       "Jack J. Dongarra and Jeremy Du Croz and Sven
                 Hammarling and Iain Duff",
  title =        "Algorithm 679: {A} Set of Level 3 {Basic Linear
                 Algebra Subprograms}: Model Implementation and Test
                 Programs",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "18--28",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 17:29:49 1994",
  note =         "See also
                 \cite{Higham:1990:EFM,Demmel:1992:SBA,Dayde:1994:PBI}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/77627.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance; reliability;
                 verification",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 8X. {\bf F.2.1}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on matrices. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative methods).
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Cody:1990:PEP,
  author =       "W. J. Cody",
  title =        "Performance Evaluation of Programs for the Error and
                 Complementary Error Functions",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "29--37",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:03:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/77628.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; reliability",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Certification and testing. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Reliability and robustness. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Numerical
                 algorithms.",
}

@Article{Poppe:1990:MEC,
  author =       "G. P. M. Poppe and C. M. J. Wijers",
  title =        "More Efficient Computation of the Complex Error
                 Function",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "38--46",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:03:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/77629.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm analysis. {\bf G.1.2}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Approximation,
                 Rational approximation.",
}

@Article{Poppe:1990:AEC,
  author =       "G. P. M. Poppe and C. M. J. Wijers",
  title =        "Algorithm 680: Evaluation of the Complex Error
                 Function",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "47--47",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:03:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/77630.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Rational approximation.",
}

@Article{Arney:1990:AMM,
  author =       "David C. Arney and Joseph E. Flaherty",
  title =        "An Adaptive Mesh-Moving and Local Refinement Method
                 for Time-Dependent Partial Differential Equations",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "48--71",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:03:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/77631.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance",
  subject =      "{\bf G.1.8}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations, Finite
                 element methods. {\bf G.1.8}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Partial Differential Equations,
                 Difference methods. {\bf G.1.7}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Ordinary Differential
                 Equations, Boundary value problems. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency.",
}

@Article{Schryer:1990:DSO,
  author =       "N. L. Schryer",
  title =        "Designing Software for One-Dimensional Partial
                 Differential Equations",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "72--85",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:03:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/77632.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf G.1.8}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Partial Differential Equations.
                 {\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Boundary
                 value problems.",
}

@Article{Hansen:1990:PES,
  author =       "Eldon R. Hansen and Merell L. Patrick and Richard L.
                 C. Wang",
  title =        "Polynomial Evaluation with Scaling",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "86--93",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:17 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/77633.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Computer arithmetic. {\bf F.2.1}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on polynomials.",
}

@Article{Snow:1990:WGO,
  author =       "Dennis M. Snow",
  title =        "{Weyl} Group Orbits",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "94--108",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:03:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/77634.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Computations on discrete
                 structures. {\bf I.1.2}: Computing Methodologies,
                 ALGEBRAIC MANIPULATION, Algorithms. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency.",
}

@Article{Sewell:1990:RSP,
  author =       "Granville Sewell",
  title =        "Remark on ``{Algorithm} 657: Software for Plotting
                 Contour Surfaces of a Function of Three Variables''",
  journal =      j-TOMS,
  volume =       "16",
  number =       "1",
  pages =        "109--109",
  month =        mar,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:03:20 1994",
  note =         "See \cite{Sewell:1988:ASP}.",
  acknowledgement = ack-nhfb,
}

@Article{Zenios:1990:INO,
  author =       "Stavros A. Zenios",
  title =        "Integrating Network Optimization Capabilities into a
                 High-Level Modeling Language",
  journal =      j-TOMS,
  volume =       "16",
  number =       "2",
  pages =        "113--142",
  month =        jun,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:09:48 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/78929.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; experimentation; languages;
                 performance; theory",
  subject =      "{\bf G.2.2}: Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory, Network problems. {\bf
                 G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Constrained optimization. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Nonlinear programming. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Linear programming. {\bf C.2.1}: Computer
                 Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
                 Network Architecture and Design. {\bf C.4}: Computer
                 Systems Organization, PERFORMANCE OF SYSTEMS, Modeling
                 techniques.",
}

@Article{Meintjes:1990:CES,
  author =       "Keith Meintjes and Alexander P. Morgan",
  title =        "Chemical Equilibrium Systems as Numerical Test
                 Problems",
  journal =      j-TOMS,
  volume =       "16",
  number =       "2",
  pages =        "143--151",
  month =        jun,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:09:48 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/78930.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Systems of
                 equations. {\bf G.1.5}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Roots of Nonlinear Equations,
                 Polynomials, methods for. {\bf J.2}: Computer
                 Applications, PHYSICAL SCIENCES AND ENGINEERING,
                 Chemistry.",
}

@Article{Kearfott:1990:AIP,
  author =       "R. Baker Kearfott and Manuel {Novoa III}",
  title =        "Algorithm 681: {INTBIS}, a Portable Interval
                 {Newton}\slash Bisection Package",
  journal =      j-TOMS,
  volume =       "16",
  number =       "2",
  pages =        "152--157",
  month =        jun,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:09:48 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/78931.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Systems of
                 equations. {\bf G.1.2}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Approximation.",
}

@Article{Murli:1990:ATM,
  author =       "A. Murli and M. Rizzardi",
  title =        "Algorithm 682: {Talbot}'s Method for the {Laplace}
                 Inversion Problem",
  journal =      j-TOMS,
  volume =       "16",
  number =       "2",
  pages =        "158--168",
  month =        jun,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:09:48 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/78932.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation. {\bf G.1.0}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, General, Numerical
                 algorithms. {\bf F.2.1}: Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Numerical Algorithms and Problems, Computation of
                 transforms. {\bf G.1.4}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Quadrature and Numerical
                 Differentiation, Equal interval integration. {\bf
                 G.1.9}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Integral Equations, Fredholm equations.",
}

@Article{Amos:1990:CEI,
  author =       "Donald E. Amos",
  title =        "Computation of Exponential Integrals of a Complex
                 Argument",
  journal =      j-TOMS,
  volume =       "16",
  number =       "2",
  pages =        "169--177",
  month =        jun,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:09:48 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/78933.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.9}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Integral Equations. {\bf G.1.m}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Miscellaneous.",
}

@Article{Amos:1990:APF,
  author =       "Donald E. Amos",
  title =        "Algorithm 683: {A} Portable {FORTRAN} Subroutine for
                 Exponential Integrals of a Complex Argument",
  journal =      j-TOMS,
  volume =       "16",
  number =       "2",
  pages =        "178--182",
  month =        jun,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:09:48 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/78934.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN.",
}

@Article{Tang:1990:AET,
  author =       "Ping Tak Peter Tang",
  title =        "Accurate and Efficient Testing of the Exponential and
                 Logarithm Functions",
  journal =      j-TOMS,
  volume =       "16",
  number =       "3",
  pages =        "185--200",
  month =        sep,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:14:59 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/79506.html",
  abstract =     "Table-driven techniques can be used to test highly
                 accurate implementation of EXP LOG. The largest error
                 observed in EXP and LOG accurately to within 1/500 unit
                 in the last place are reported in our tests. Methods to
                 verify the tests' reliability are discussed. Results of
                 applying the tests to our own as well as to a number of
                 other implementations of EXP and LOG are presented.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages; verification",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Error analysis. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Certification and testing. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Portability.",
}

@Article{Cash:1990:VOR,
  author =       "J. R. Cash and Alan H. Karp",
  title =        "A Variable Order {Runge-Kutta} Method for Initial
                 Value Problems with Rapidly Varying Right-Hand Sides",
  journal =      j-TOMS,
  volume =       "16",
  number =       "3",
  pages =        "201--222",
  month =        sep,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:14:59 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/79507.html",
  abstract =     "Explicit Runge-Kutta methods (RKMs) are among the most
                 popular classes of formulas for the approximate
                 numerical integration of nonstiff, initial value
                 problems. However, high-order Runge-Kutta methods
                 require more function evaluations per integration step
                 than, for example, Adams methods used in PECE mode, and
                 so, with RKMs, it is especially important to avoid
                 rejected steps. Steps are often rejected when certain
                 derivatives of the solutions are very large for part of
                 the region of integration. This corresponds, for
                 example, to regions where the solution has a sharp
                 front or, in the limit, some derivative of the solution
                 is discontinuous. In these circumstances the assumption
                 that the local truncation error is changing slowly is
                 invalid, and so any step-choosing algorithm is likely
                 to produce an unacceptable step. In this paper we
                 derive a family of explicit Runge-Kutta formulas. Each
                 formula is very efficient for problems with smooth
                 solution as well as problems having rapidly varying
                 solutions. Each member of this family consists of a
                 fifty-order formula that contains imbedded formulas of
                 all orders 1 through 4. By computing solutions at
                 several different orders, it is possible to detect
                 sharp fronts or discontinuities before all the function
                 evaluations defining the full Runge-Kutta step have
                 been computed. We can then either accept a lower order
                 solution or abort the step, depending on which course
                 of action seems appropriate. The efficiency of the new
                 algorithm is demonstrated on the DETEST test set as
                 well as on some difficult test problems with sharp
                 fronts or discontinuities.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.2}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Approximation.",
}

@Article{Weiss:1990:SSC,
  author =       "Shlomo Weiss and James E. Smith",
  title =        "A Study of Scalar Compilation Techniques for Pipelined
                 Supercomputers",
  journal =      j-TOMS,
  volume =       "16",
  number =       "3",
  pages =        "223--245",
  month =        sep,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:14:59 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/79508.html",
  abstract =     "This paper studies two compilation techniques for
                 enhancing scalar performance in high-speed scientific
                 processors: software pipelining and loop unrolling. We
                 study the impact of the architecture (size of the
                 register file) and of the hardware (size of instruction
                 buffer) on the efficiency of loop unrolling. We also
                 develop a methodology for classifying software
                 pipelining techniques. For loop unrolling, a
                 straightforward scheduling algorithm is shown to
                 produce near-optimal results when not inhibited by
                 recurrences or memory hazards. Our study indicates that
                 the performance produced with a modified CRAY-1S scalar
                 architecture and a code scheduler utilizing loop
                 unrolling is comparable to the performance achieved by
                 the CRAY-1S with a vector unit and the CFT vectorizing
                 compiler.\par

                 Finally, we show that the combination of loop unrolling
                 and dynamic software pipelining, as implemented by a
                 decoupled computer, substantially outperforms the
                 vector CRAY-1S.",
  acknowledgement = ack-nhfb,
  keywords =     "design; experimentation; performance",
  subject =      "{\bf C.1.1}: Computer Systems Organization, PROCESSOR
                 ARCHITECTURES, Single Data Stream Architectures,
                 Pipeline processors. {\bf C.4}: Computer Systems
                 Organization, PERFORMANCE OF SYSTEMS, Performance
                 attributes. {\bf D.3.4}: Software, PROGRAMMING
                 LANGUAGES, Processors, Compilers. {\bf C.5.1}: Computer
                 Systems Organization, COMPUTER SYSTEM IMPLEMENTATION,
                 Large and Medium (``Mainframe'') Computers.",
}

@Article{Preusser:1990:EFB,
  author =       "Albrecht Preusser",
  title =        "Efficient Formulation of a Bivariate Nonic
                 ${C}^2$-{Hermite} Polynomial on Triangles",
  journal =      j-TOMS,
  volume =       "16",
  number =       "3",
  pages =        "246--252",
  month =        sep,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:14:59 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/79509.html",
  abstract =     "Bivariate polynomials over triangular domains are
                 widely in use for the definition of surfaces that are
                 continuously differentiable across a set of triangles.
                 A description is given of how explicit formulas for the
                 coefficients of bivariate nonic polynomials can be
                 found with the help of a computer algebra system. A
                 linear system with 55 equations and 45 nonzero right
                 hand sides must be solved algebraically. The
                 interpolant is twice differentiable across triangle
                 sides and based on function values and partial
                 derivatives up to fourth order at the nodes. Horner's
                 scheme for evaluating polynomials can be applied
                 directly, leading to optimal efficiency during the
                 evaluation phase (54 additions and multiplications for
                 one point). Starting with transformed nodal data, the
                 calculation of one set of coefficients takes about 350
                 additions, the same number of multiplications, and 30
                 divisions.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf I.3.5}: Computing
                 Methodologies, COMPUTER GRAPHICS, Computational
                 Geometry and Object Modeling, Curve, surface, solid,
                 and object representations. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative
                 methods).",
}

@Article{Preusser:1990:AIT,
  author =       "Albrecht Preusser",
  title =        "Algorithm 684: ${C}^1$- and ${C}^2$-Interpolation on
                 Triangles with Quintic and Nonic Bivariate
                 Polynomials",
  journal =      j-TOMS,
  volume =       "16",
  number =       "3",
  pages =        "253--257",
  month =        sep,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:14:59 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/79510.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Shacham:1990:FBD,
  author =       "Orit Shacham and Mordechai Shacham",
  title =        "Finding Boundaries of the Domain of Definition for
                 Functions Along a One-Dimensional Ray",
  journal =      j-TOMS,
  volume =       "16",
  number =       "3",
  pages =        "258--268",
  month =        sep,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:14:59 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/79511.html",
  abstract =     "A program for finding boundaries of function domains
                 along a one-dimensional ray has been developed. The
                 program decomposes the function into subexpressions
                 which are recursively tested for intervals where they
                 are undefined, negative, or fractional, or points where
                 they equal zero. The intervals in which the
                 subexpressions are undefined are then united to create
                 the boundaries of the domain of definition of the whole
                 function. The advantages of the use of such a program
                 in solution of systems of nonlinear algebraic equations
                 and nonlinear optimization are demonstrated.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf G.1.5}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Roots of
                 Nonlinear Equations. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization.",
}

@Article{Nair:1990:IAO,
  author =       "K. Aiyappan Nair",
  title =        "An Improved Algorithm for Ordered Sequential Random
                 Sampling",
  journal =      j-TOMS,
  volume =       "16",
  number =       "3",
  pages =        "269--274",
  month =        sep,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 15:57:03 1994",
  acknowledgement = ack-nhfb,
}

@Article{Palacios-Velez:1990:DHS,
  author =       "Oscar Palacios-Velez and Baltazar Cuevas Renaud",
  title =        "A Dynamic Hierarchical Subdivision Algorithm for
                 Computing {Delaunay} Triangulations and Other
                 Closest-Point Problems",
  journal =      j-TOMS,
  volume =       "16",
  number =       "3",
  pages =        "275--292",
  month =        sep,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 15:57:45 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/79512.html",
  abstract =     "A new, dynamic, hierarchical subdivision and recursive
                 algorithm for computing Delaunay triangulations is
                 presented. The algorithm has four main steps: (1)
                 location of the already formed triangle that contains
                 the point (2) identification of other adjoining
                 triangles whose circumcircle contains the point (3)
                 formation of the new triangles, and (4) database
                 update. Different search procedures are analyzed. It is
                 shown that the ``oriented walk'' search, when the total
                 number of points is less than 417 or when the points
                 are presorted by distance or coordinates. The algorithm
                 has point-deletion capabilities which are discussed in
                 detail.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Geometrical problems and
                 computations. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Geometric
                 algorithms, languages, and systems. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Hierarchy
                 and geometric transformations. {\bf F.2.2}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Sorting and searching.",
}

@Article{Krogh:1990:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "16",
  number =       "3",
  pages =        "293--296",
  month =        sep,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:14:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Pothen:1990:CBT,
  author =       "Alex Pothen and Chin-Ju Fan",
  title =        "Computing the Block Triangular Form of a Sparse
                 Matrix",
  journal =      j-TOMS,
  volume =       "16",
  number =       "4",
  pages =        "303--324",
  month =        dec,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Aug 27 15:58:44 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/98287.html",
  abstract =     "We consider the problem of permuting the rows and
                 columns of a rectangular or square, unsymmetric sparse
                 matrix to compute its block triangular form. This block
                 triangular form is based on a canonical decomposition
                 of bipartite graphs induced by a maximum matching and
                 was discovered by Dulmage and Mendelsohn. We describe
                 implementations of algorithms to compute the block
                 triangular form and provide computational results on
                 sparse matrices from test collections. Several
                 applications of the block triangular form are also
                 included.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; perm; sparse",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis. {\bf G.2.1}:
                 Mathematics of Computing, DISCRETE MATHEMATICS,
                 Combinatorics, Permutations and combinations. {\bf
                 G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
                 Graph Theory.",
}

@Article{Kaufman:1990:APS,
  author =       "Linda Kaufman and Daniel D. Warner",
  title =        "Algorithm 685: {A} Program for Solving Separable
                 Elliptic Equations",
  journal =      j-TOMS,
  volume =       "16",
  number =       "4",
  pages =        "325--351",
  month =        dec,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:21:57 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/98289.html",
  abstract =     "This paper presents a program SERRG2 that solves
                 separable elliptic equations on a rectangle. The
                 program uses a matrix decomposition technique to
                 directly solve the linear system arising from a
                 Rayleigh-Ritz-Galerkin approach with tensor product
                 B-splines to solve the separable partial differential
                 equation. This approach permits high-order
                 discretizations, variable meshes, and multiple knots.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.8}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Higham:1990:EFM,
  author =       "Nicholas J. Higham",
  title =        "Exploiting Fast Matrix Multiplication Within the Level
                 3 {BLAS}",
  journal =      j-TOMS,
  volume =       "16",
  number =       "4",
  pages =        "352--368",
  month =        dec,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:21:57 1994",
  note =         "Describes algorithms based on Strassen's method which
                 are asymptotically faster than the standard ${N}^3$
                 algorithm, and in practice, faster for ${N}\approx100$,
                 and examines their numerical stability. See
                 \cite{Dongarra:1990:ASL,Demmel:1992:SBA}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/98290.html",
  abstract =     "The Level 3 BLAS (BLAS3) are a set of specifications
                 of FORTRAN 77 subprograms for carrying out matrix
                 multiplications and the solution of triangular systems
                 with multiple right-hand sides. They are intended to
                 provide efficient and portable building blocks for
                 linear algebra algorithms on high-performance
                 computers. We describe algorithms for the BLAS3
                 operations that are asymptotically faster than the
                 conventional ones. These algorithms are based on
                 Strassen's method for fast matrix multiplication, which
                 is now recognized to be a practically useful technique
                 once matrix dimensions exceed about 100. We pay
                 particular attention to the numerical stability of
                 these ``fast BLAS3.'' Error bounds are given and their
                 significance is explained and illustrated with the aid
                 of numerical experiments. Our conclusion is that the
                 fast BLAS3, although not as strongly stable as
                 conventional implementations, are stable enough to
                 merit careful consideration in many applications.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 77.",
}

@Article{Reichel:1990:AFS,
  author =       "L. Reichel and W. B. Gragg",
  title =        "Algorithm 686: {FORTRAN} Subroutines for Updating the
                 {QR} Decomposition",
  journal =      j-TOMS,
  volume =       "16",
  number =       "4",
  pages =        "369--377",
  month =        dec,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:25:40 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/98291.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; Gram-Schmidt algorithm; nla; qrd;
                 software; updating",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{Tang:1990:TDI,
  author =       "Ping Tak Peter Tang",
  title =        "Table-Driven Implementation of the Logarithm Function
                 in {IEEE} Floating-Point Arithmetic",
  journal =      j-TOMS,
  volume =       "16",
  number =       "4",
  pages =        "378--400",
  month =        dec,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:26:09 1994",
  bibsource =    "garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/98294.html",
  abstract =     "Algorithms and implementation details for the
                 logarithm functions in both single and double precision
                 of IEEE 754 arithmetic are presented here. With a table
                 of moderate size, the implementation need only working-
                 precision arithmetic and are provably accurate to
                 within 0.57 ulp.",
  acknowledgement = ack-nj,
  keywords =     "algorithms; design; performance; reliability;
                 standardization; theory; verification",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Computer arithmetic. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Error analysis. {\bf G.1.0}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, General, Numerical algorithms. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{Hopkins:1990:RRK,
  author =       "Tim Hopkins and David Morse",
  title =        "Remark on ``{Algorithm} 620: References and Keywords
                 for {\em {Collected Algorithms} of the {ACM}}''",
  journal =      j-TOMS,
  volume =       "16",
  number =       "4",
  pages =        "401--403",
  month =        dec,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 24 09:58:26 1996",
  note =         "See \cite{Rice:1984:ARK,Hamilton:1985:RRK}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/98297.html",
  abstract =     "The authors report on an enhanced version of the
                 database originally reported in `Algorithm 620:
                 references and keywords for collected algorithms from
                 ACM', J. R. Rice and R. J. Hanson, ACM Trans Math.
                 Soft. vol. 10, no. 4, p. 359-360 (1984). In this new
                 version they have included all the information
                 necessary to generate full bibliographic references.
                 Extra information includes the author's name (including
                 any accents), the page range of the original reference
                 (rather than just the starting page), the month and
                 year of publication and an abbreviated journal name.
                 The programming language used to code the algorithm is
                 also given. Any mathematical notation used within the
                 algorithm title and accents in the author's name have
                 been defined using {\TeX}. Following the practice used
                 with Bib{\TeX}, all letters within the title that need
                 to remain capitalized in a printed version of the
                 reference (e.g. Fortran, Bessel) are enclosed in
                 braces. (3 Refs.)",
  acknowledgement = ack-nhfb,
  affiliation =  "Kent Univ., UK",
  classification = "C7250C (Bibliographic systems); C7310 (Mathematics);
                 C4100 (Numerical analysis)",
  keywords =     "Abbreviated journal name; Algorithm title; algorithms;
                 Bibliographic references; BibTeX; Mathematical
                 notation; TeX",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis.",
  thesaurus =    "Bibliographic systems; Mathematics computing;
                 Numerical methods",
}

@Article{Amos:1990:RPP,
  author =       "D. E. Amos",
  title =        "Remark on ``{Algorithm} 644: {A} Portable Package for
                 {Bessel} Functions of a Complex Argument and
                 Nonnegative Order''",
  journal =      j-TOMS,
  volume =       "16",
  number =       "4",
  pages =        "404--404",
  month =        dec,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:21:57 1994",
  note =         "See \cite{Amos:1986:APP}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/98299.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems.",
}

@Article{Garbow:1990:RFS,
  author =       "B. S. Garbow and J. N. Lyness",
  title =        "Remark on ``{Algorithm} 662: {A FORTRAN} Software
                 Package for the Numerical Inversion of the {Laplace}
                 Transform Based on {Weeks}' Method''",
  journal =      j-TOMS,
  volume =       "16",
  number =       "4",
  pages =        "405--406",
  month =        dec,
  year =         "1990",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:21:57 1994",
  note =         "See \cite{Garbow:1988:AFS}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/98302.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf F.2.2}: Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems.",
}

@Article{Addison:1991:ADT,
  author =       "C. A. Addison and W. H. Enright and P. W. Gaffney and
                 I. Gladwell and P. M. Hanson",
  title =        "Algorithm 687: {A} Decision Tree for the Numerical
                 Solution of Initial Value Ordinary Differential
                 Equations",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "1--10",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103148.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems.",
}

@Article{Shampine:1991:RSS,
  author =       "L. F. Shampine and I. Gladwell and R. W. Brankin",
  title =        "Reliable Solutions of Special Event Location Problems
                 for {ODEs}",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "11--25",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103149.html",
  abstract =     "Computing the solution of the initial value problem in
                 ordinary differential equations (ODEs) may be only part
                 of a larger task. One such task is finding where an
                 algebraic function of the solution (an event function)
                 has a root (an event occurs). This is a task which is
                 difficult both in theory and in software practice. For
                 certain useful kinds of event functions, it is possible
                 to avoid two fundamental difficulties. It is described
                 how to achieve the reliable solutions of such problems
                 in a way that allows the capability to be grafted onto
                 popular codes for the initial value problem.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; theory",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems.",
}

@Article{Gal:1991:AEM,
  author =       "Shmuel Gal and Boris Bachelis",
  title =        "An Accurate Elementary Mathematical Library for the
                 {IEEE} Floating Point Standard",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "26--45",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103151.html",
  abstract =     "The algorithms used by the IBM Israel Scientific
                 Center for the elementary mathematical library using
                 the IEEE standard for binary floating point arithmetic
                 are described. The algorithms are based on the
                 ``accurate tables method.'' This methodology achieves
                 high performance and produces very accurate results. It
                 overcomes one of the main problems encountered in
                 elementary mathematical functions computations:
                 achieving last bit accuracy. The results obtained are
                 correctly rounded for almost all argument values.
                 \par

                 Our main idea in the accurate tables method is to use
                 ``nonstandard tables,'' which are different from the
                 natural tables of equally spaced points in which the
                 rounding error prevents obtaining last bit accuracy. In
                 order to achieve a small error we use the following
                 idea: Perturb the original, equally spaced, points in
                 such a way that the table value (or tables values in
                 case we need several tables) will be very close to
                 numbers which can be exactly represented by the
                 computer (much closer than the usual double precision
                 representation). Thus we were able to control the error
                 introduced by the computer representation of real
                 numbers and extended the accuracy without actually
                 using extended precision arithmetic.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Computer arithmetic. {\bf G.1.2}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Elementary function approximation.",
}

@Article{Cody:1991:PEP,
  author =       "W. J. Cody",
  title =        "Performance Evaluation of Programs Related to the Real
                 Gamma Function",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "46--54",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103153.html",
  abstract =     "Methods are presented for evaluating the performance
                 of programs for the functions $\Gamma(x)$, $\ln
                 \Gamma(x)$, and $\psi(x)$. Accuracy estimates are based
                 on comparisons using the manipulation theorem. Ideas
                 for checking robustness are also given, and details on
                 specific implementations of test programs are
                 included.",
  acknowledgement = ack-nhfb,
  keywords =     "measurement; performance; reliability",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Certification and testing.",
}

@Article{Cody:1991:UTS,
  author =       "W. J. Cody and L. Stoltz",
  title =        "The Use of {Taylor} Series to Test Accuracy of
                 Function Programs",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "55--63",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:36:36 1994",
  bibsource =    "garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103154.html",
  abstract =     "This paper discusses the use of local Taylor series
                 expansions for determining the accuracy of computer
                 programs for special functions. The main example is
                 testing of programs for exponential integrals.
                 Additional applications include testing of programs for
                 certain Bessel functions, Dawson's integral, and error
                 functions.",
  acknowledgement = ack-nj,
  keywords =     "algorithms; measurement; performance; verification",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Certification and testing. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Numerical algorithms.",
}

@Article{Dax:1991:CAB,
  author =       "Achiya Dax",
  title =        "On Computational Aspects of Bounded Linear Least
                 Squares Problems",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "64--73",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103155.html",
  abstract =     "The paper describes numerical experiments with active
                 set methods for solving bounded linear least squares
                 problems. It concentrates on two problems that arise in
                 the implementation of the active set method. One
                 problem is the choice of a good starting point. The
                 second problem is how to move out of a ``{\em dead
                 point}.'' The paper investigates the use of simple
                 iterative methods to solve these problems. The results
                 of our experiments indicate that the use of
                 Gauss-Seidel iterations to obtain a starting point is
                 likely to provide large gains in efficiency. Another
                 interesting conclusion is that dropping one constraint
                 at a time is advantageous to dropping several
                 constraints at a time.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; performance; theory",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Least squares methods.",
}

@Article{Pardalos:1991:CTP,
  author =       "Panos M. Pardalos",
  title =        "Construction of Test Problems in Quadratic Bivalent
                 Programming",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "74--87",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103156.html",
  abstract =     "A method of constructing test problems for constrained
                 bivalent quadratic programming is presented. For any
                 feasible integer point for a given domain, the method
                 generates quadratic functions whose minimum over the
                 given domain occurs at the selected point. \par

                 Certain properties of unconstrained quadratic zero-one
                 programs that determine the difficulty of the test
                 problems are also discussed. In addition, a
                 standardized random test problem generator for
                 unconstrained quadratic zero-one programming is
                 given.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; performance",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Integer programming. {\bf
                 G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Nonlinear programming. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Klier:1991:FCB,
  author =       "Peter Klier and Richard J. Fateman",
  title =        "On Finding the Closest Bitwise Matches in a Fixed
                 Set",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "88--97",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103157.html",
  abstract =     "In a given large fixed table of bit-vectors, we would
                 like to find, as rapidly as possible, those bit-vectors
                 which have the least Hamming distances from a
                 newly-presented arbitrary bit-vector.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
                 Algorithms and Problems, Pattern matching. {\bf E.2}:
                 Data, DATA STORAGE REPRESENTATIONS. {\bf F.2.2}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Nonnumerical Algorithms and Problems,
                 Sorting and searching. {\bf H.3.3}: Information
                 Systems, INFORMATION STORAGE AND RETRIEVAL, Information
                 Search and Retrieval, Search process.",
}

@Article{LEcuyer:1991:IRN,
  author =       "Pierre L'Ecuyer and Serge C{\^{o}}t{\'{e}}",
  title =        "Implementing a Random Number Package with Splitting
                 Facilities",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "98--111",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103158.html",
  abstract =     "A portable set of software tools is described for
                 uniform random variates generation. It provides for
                 multiple generators running simultaneously, and each
                 generator has its sequence of numbers partitioned into
                 many long (disjoint) substreams. Simple procedure calls
                 allow the user to make any generator ``jump'' ahead to
                 the beginning of its next substream, back to the
                 beginning of its current substream, or back to the
                 beginning of its first substream\ldots. Implementation
                 issues are discussed\ldots. A Pascal implementation for
                 32-bit computers is described.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Liu:1991:GEM,
  author =       "Joseph W. H. Liu",
  title =        "A Generalized Envelope Method for Sparse Factorization
                 by Rows",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "112--129",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:43:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103159.html",
  abstract =     "A generalized form of the envelope method is proposed
                 for the solution of large sparse symmetric and positive
                 definite matrices by rows. The method is demonstrated
                 to have practical advantages over the conventional
                 column-oriented factorization using compressed column
                 storage or the multifrontal method using full frontal
                 submatrices.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; functional algorithm",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Mohideen:1991:RCG,
  author =       "Saleem Mohideen and Vladimir Cherkassky",
  title =        "On Recursive Calculation of the Generalized Inverse of
                 a Matrix",
  journal =      j-TOMS,
  volume =       "17",
  number =       "1",
  pages =        "130--147",
  month =        mar,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:33:02 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103160.html",
  abstract =     "The generalized inverse of a matrix is an extension of
                 the ordinary square matrix inverse which applies to any
                 matrix (e.g., singular, rectangular). The generalized
                 inverse has numerous important applications such as
                 regression analysis, filtering, optimization and, more
                 recently, linear associative memories. In this latter
                 application known as Distributed Associative Memory,
                 stimulus vectors are associated with response vectors
                 and the result of many associations is spread over the
                 entire memory matrix, which is calculated as the
                 generalized inverse. Addition/deletion of new
                 associations requires recalculation of the generalized
                 inverse, which becomes computationally costly for large
                 systems. A better solution is to calculate the
                 generalized inverse recursively. The proposed algorithm
                 is a modification of the well known algorithm due to
                 Rust et al. [2], originally introduced for nonrecursive
                 computation. We compare our algorithm with Greville's
                 recursive algorithm and conclude that our algorithm
                 provides better numerical stability at the expense of
                 little extra computation time and additional storage.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Matrix inversion.
                 {\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Pseudoinverses.
                 {\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.4}: Mathematics
                 of Computing, MATHEMATICAL SOFTWARE, Algorithm
                 analysis.",
}

@Article{Keast:1991:AEM,
  author =       "P. Keast and P. H. Muir",
  title =        "Algorithm 688: {EPDCOL}: {A} More Efficient {PDECOL}
                 Code",
  journal =      j-TOMS,
  volume =       "17",
  number =       "2",
  pages =        "153--166",
  month =        jun,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:44:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/108558.html",
  abstract =     "The software package PDECOL [7] is a popular code
                 among scientists wishing to solve systems of nonlinear
                 partial differential equations. The code is based on a
                 method-of-lines approach, with collocation in the space
                 variable to reduce the problem to a system of ordinary
                 differential equations. There are three principal
                 components: the basis functions employed in the
                 collocation; the method used to solve the system of
                 ordinary differential equations; and the linear
                 equation solver which handles the linear algebra. This
                 paper will concentrate on the third component, and will
                 report on the improvement in the performance of PDECOL
                 resulting from replacing the current linear algebra
                 modules of the code by modules which take full
                 advantage of the special structure of the equations
                 which arise. Savings of over 50 percent in total
                 execution time can be realized.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.8}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations. {\bf G.1.5}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Roots of
                 Nonlinear Equations. {\bf G.1.7}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Ordinary Differential
                 Equations. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Blom:1991:ADC,
  author =       "J. G. Blom and H. Brunner",
  title =        "Algorithm 689: Discretized Collocation and Iterated
                 Collocation for Nonlinear {Volterra} Integral Equations
                 of the Second Kind",
  journal =      j-TOMS,
  volume =       "17",
  number =       "2",
  pages =        "167--177",
  month =        jun,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:44:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/108562.html",
  abstract =     "This paper describes a FORTRAN code for calculating
                 approximate solutions to systems of nonlinear Volterra
                 integral equations of the second kind. The algorithm is
                 based on polynomial spline collocation, with the
                 possibility of combination with the corresponding
                 iterated collocation. It exploits certain local
                 superconvergence properties for the error estimation
                 and the stepsize strategy.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; reliability",
  subject =      "{\bf G.1.9}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Integral Equations, Volterra equations. {\bf
                 G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 General, Numerical algorithms. {\bf G.1.2}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Approximation, Spline
                 and piecewise polynomial approximation. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Berzins:1991:ACP,
  author =       "M. Berzins and P. M. Dew",
  title =        "Algorithm 690: {Chebyshev} Polynomial Software for
                 Elliptic-Parabolic Systems of {PDEs}",
  journal =      j-TOMS,
  volume =       "17",
  number =       "2",
  pages =        "178--206",
  month =        jun,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:44:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/108566.html",
  abstract =     "PDECHEB is a FORTRAN 77 software package that
                 semidiscretizes a wide range of time-dependent partial
                 differential equations in one space variable. The
                 software implements a family of spacial discretization
                 formulas, based on piecewise Chebyshev polynomial
                 expansions with $C^{0}$ continuity. The package has
                 been designed to be used in conjunction with a general
                 integrator for initial value problems to provide a
                 powerful software tool for the solution of
                 parabolic-elliptic PDEs with coupled differential
                 algebraic equations. Examples are provided to
                 illustrate the use of the package with the DASSL d.a.e
                 integrator of Petzold [18].",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.8}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Partial Differential Equations, Elliptic
                 equations. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE. {\bf G.1.8}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Partial Differential
                 Equations, Parabolic equations.",
}

@Article{Favati:1991:IIF,
  author =       "Paola Favati and Grazia Lotti and Francesco Romani",
  title =        "Interpolatory Integration Formulas for Optimal
                 Composition",
  journal =      j-TOMS,
  volume =       "17",
  number =       "2",
  pages =        "207--217",
  month =        jun,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:44:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/108571.html",
  abstract =     "A set of symmetric, closed, interpolatory integration
                 formulas on the interval [-1, 1] with positive weights
                 and increasing degree of precision is introduced. These
                 formulas, called recursive monotone stable (RMS)
                 formulas, allow applying higher order or compound rules
                 without wasting previously computed functional values.
                 An exhaustive search shows the existence of 27 families
                 of RMS formulas, stemming from the simple trapezoidal
                 rule.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation,
                 Adaptive quadrature. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE. {\bf G.1.1}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation, Interpolation formulas.",
}

@Article{Favati:1991:AIQ,
  author =       "Paola Favati and Grazia Lotti and Francesco Romani",
  title =        "Algorithm 691: Improving {QUADPACK} Automatic
                 Integration Routines",
  journal =      j-TOMS,
  volume =       "17",
  number =       "2",
  pages =        "218--232",
  month =        jun,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:44:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/108580.html",
  abstract =     "Two automatic adaptive integrators from QUADPACK
                 (namely, QAG, and QAGS) are modified by substituting
                 the Gauss-Kronrod rules used for local quadrature with
                 recursive monotone stable (RMS) formulas. Extensive
                 numerical tests, both for one-dimensional and
                 two-dimensional integrals, show that the resulting
                 programs are faster, perform less functional
                 evaluations, and are more suitable",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation,
                 Adaptive quadrature. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Berntsen:1991:EEA,
  author =       "Jarle Berntsen and Terje O. Espelid",
  title =        "Error Estimation in Automatic Quadrature Routines",
  journal =      j-TOMS,
  volume =       "17",
  number =       "2",
  pages =        "233--252",
  month =        jun,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:44:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/108575.html",
  abstract =     "A new algorithm for estimating the error in quadrature
                 approximations is presented. Based on the same
                 integrand evaluations that we need for approximating
                 the integral, one may, for many quadrature rules,
                 compute a sequence of null rule approximations. These
                 null rule approximations are then used to produce an
                 estimate of the local error. The algorithm allows us to
                 take advantage of the degree of precision of the basic
                 quadrature rule. In the experiments we show that the
                 algorithm works satisfactorily for a selection of
                 different quadrature rules on all test families of
                 integrals.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation,
                 Adaptive quadrature. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation.",
}

@Article{Dodson:1991:SEF,
  author =       "David S. Dodson and Roger G. Grimes and John G.
                 Lewis",
  title =        "Sparse Extensions to the {FORTRAN Basic Linear Algebra
                 Subroutines}",
  journal =      j-TOMS,
  volume =       "17",
  number =       "2",
  pages =        "253--263",
  month =        jun,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:44:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/108577.html",
  abstract =     "This paper describes an extension to the set of Basic
                 Linear Algebra Subprograms. The extension is targeted
                 at sparse vector operations, with the goal of providing
                 efficient, but portable, implementations of algorithms
                 for high-performance computers.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; standardization",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Portability. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf D.2.2}: Software,
                 SOFTWARE ENGINEERING, Tools and Techniques, Software
                 libraries. {\bf F.2.1}: Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical
                 Algorithms and Problems, Computations on matrices.",
}

@Article{Dodson:1991:AMI,
  author =       "David S. Dodson and Roger G. Grimes and John G.
                 Lewis",
  title =        "Algorithm 692: Model Implementation and Test Package
                 for the Sparse {Basic Linear Algebra Subroutines}",
  journal =      j-TOMS,
  volume =       "17",
  number =       "2",
  pages =        "264--272",
  month =        jun,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:44:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/108582.html",
  abstract =     "This paper describes a model implementation and test
                 software for the Sparse Basic Linear Algebra
                 Subprograms (Sparse BLAS). The Sparse BLAS perform
                 vector operations common in sparse linear algebra, with
                 the goal of providing efficient, but portable,
                 implementations of algorithms for high performance
                 computers. The model implementation provides a portable
                 set of FORTRAN 77 Sparse BLAS for the use on machines
                 where specially tuned implementations do not exist or
                 are not required. The test software is designed to
                 verify that tuned implementations meet the
                 specifications of the Sparse BLAS and that
                 implementations are correctly installed.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Sparse and very
                 large systems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 FORTRAN 77.",
}

@Article{Smith:1991:AFP,
  author =       "David M. Smith",
  title =        "Algorithm 693: {A FORTRAN} Package for Floating-Point
                 Multiple-Precision Arithmetic",
  journal =      j-TOMS,
  volume =       "17",
  number =       "2",
  pages =        "273--283",
  month =        jun,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:44:20 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/108585.html",
  abstract =     "FM is a collection of FORTRAN-77 routines which
                 performs floating-point multiple-precision arithmetic
                 and elementary functions. Results are almost always
                 correctly rounded, and due to improved algorithms used
                 for elementary functions, reasonable efficiency is
                 obtained.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 77.",
}

@Article{Higham:1991:ACT,
  author =       "Nicholas J. Higham",
  title =        "Algorithm 694: {A} Collection of Test Matrices in
                 {MATLAB}",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "289--305",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/116805.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; performance; theory",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra.",
}

@Article{Eskow:1991:ASN,
  author =       "Elizabeth Eskow and Robert B. Schnabel",
  title =        "Algorithm 695: Software for a New Modified {Cholesky}
                 Factorization",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "306--312",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/116806.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra.",
}

@Article{Rothberg:1991:ESM,
  author =       "Edward Rothberg and Anoop Gupta",
  title =        "Efficient Sparse Matrix Factorization on
                 High-Performance Workstations\emdash Exploiting the
                 Memory Hierarchy",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "313--334",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/116809.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; experimentation; performance",
  subject =      "{\bf B.3.2}: Hardware, MEMORY STRUCTURES, Design
                 Styles, Cache memories. {\bf C.5.3}: Computer Systems
                 Organization, COMPUTER SYSTEM IMPLEMENTATION,
                 Microcomputers, Workstations. {\bf G.1.3}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Sparse and very large systems. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Schrauf:1991:AIR,
  author =       "G{\'{e}}za Schrauf",
  title =        "Algorithm 696: An Inverse {Rayleigh} Iteration for
                 Complex Band Matrices",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "335--340",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/116807.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations on matrices. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 77.",
}

@Article{Akima:1991:MUI,
  author =       "Hiroshi Akima",
  title =        "A Method for Univariate Interpolation that Has the
                 Accuracy of a Third-Degree Polynomial",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "341--366",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/116810.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation.",
}

@Article{Akima:1991:AUI,
  author =       "Hiroshi Akima",
  title =        "Algorithm 697: Univariate Interpolation that Has the
                 Accuracy of a Third-Degree Polynomial",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "367--367",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/116808.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation.",
}

@Article{Higham:1991:HCR,
  author =       "D. J. Higham",
  title =        "Highly Continuous {Runge-Kutta} Interpolants",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "368--386",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/103150.html",
  abstract =     "The algorithms used by the IBM Israel Scientific
                 Center for the elementary mathematical library using
                 the IEEE standard for binary floating point arithmetic
                 are described. The algorithms are based on the
                 ``accurate tables method.'' This methodology achieves
                 high performance and produces very accurate results. It
                 overcomes one of the main problems encountered in
                 elementary mathematical functions computations:
                 achieving last bit accuracy. The results obtained are
                 correctly rounded for almost all argument values.
                 \par

                 Our main idea in the accurate tables method is to use
                 ``nonstandard tables,'' which are different from the
                 natural tables of equally spaced points in which the
                 rounding error prevents obtaining last bit accuracy. In
                 order to achieve a small error we use the following
                 idea: Perturb the original, equally spaced, points in
                 such a way that the table value (or tables values in
                 case we need several tables) will be very close to
                 numbers which can be exactly represented by the
                 computer (much closer than the usual double precision
                 representation). Thus we were able to control the error
                 introduced by the computer representation of real
                 numbers and extended the accuracy without actually
                 using extended precision arithmetic.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Single step
                 methods. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Initial value problems. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation. {\bf
                 G.1.1}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation.",
}

@Article{Sharp:1991:NCS,
  author =       "P. W. Sharp",
  title =        "Numerical Comparisons of Some Explicit {Runge-Kutta}
                 Pair of Orders 3 Through 8",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "387--409",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/116811.html",
  abstract =     "We performed numerical testing of six explicit
                 Runge-Kutta pairs ranging in order from a (3,4) pair to
                 a (7,8) pair. All the test problems had smooth
                 solutions and we assumed dense output was not required.
                 The pairs were implemented in a uniform way. In
                 particular, the stepsize selection for all pairs was
                 based on the locally optimal formula. We tested the
                 efficiency of the pairs, to what extent tolerance
                 proportionality held, the accuracy of the local error
                 estimate and stepsize prediction, and the performance
                 on mildly stiff problems. We also showed, for these
                 pairs, how the performance could be altered noticeably
                 by making simple changes to the stepsize selection
                 strategy. As part of the work, we demonstrated new ways
                 of presenting numerical comparisons.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; reliability",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Certification and testing.",
}

@Article{Ziv:1991:FEE,
  author =       "Abraham Ziv",
  title =        "Fast Evaluation of Elementary Mathematical Functions
                 with Correctly Rounded Last Bit",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "410--423",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Thu Sep 1 10:15:31 1994",
  bibsource =    "garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/116813.html",
  acknowledgement = ack-nj,
  keywords =     "algorithms; standardization; theory",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf G.1.2}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Elementary function approximation. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency.",
}

@Article{Higham:1991:RBF,
  author =       "Desmond J. Higham",
  title =        "Remark on ``{Algorithm} 669: {BRKF45}: {A FORTRAN}
                 Subroutine for Solving First-Order Systems of Nonstiff
                 Initial Value Problems for Ordinary Differential
                 Equations''",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "424--426",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  note =         "See \cite{Cash:1989:ABF}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/116814.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations. {\bf G.1.2}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation.",
}

@Article{Krogh:1991:AAP,
  author =       "Fred T. Krogh",
  title =        "{ACM} Algorithms Policy",
  journal =      j-TOMS,
  volume =       "17",
  number =       "3",
  pages =        "427--430",
  month =        sep,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:52:04 1994",
  acknowledgement = ack-nhfb,
}

@Article{Berntsen:1991:AAA,
  author =       "Jarle Berntsen and Terje O. Espelid and Alan Genz",
  title =        "An Adaptive Algorithm for the Approximate Calculation
                 of Multiple Integrals",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "437--451",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:59:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210233.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Berntsen:1991:ADA,
  author =       "Jarle Berntsen and Terje O. Espelid and Alan Genz",
  title =        "Algorithm 698: {DCUHRE}: An Adaptive Multidimensional
                 Integration Routine for a Vector of Integrals",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "452--456",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:59:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210234.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Krogh:1991:ANR,
  author =       "Fred T. Krogh and W. Van Snyder",
  title =        "Algorithm 699: {A} New Representation of {Patterson}'s
                 Quadrature Formulae",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "457--461",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:54:59 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210235.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Broughan:1991:SHL,
  author =       "Kevin A. Broughan",
  title =        "{SENAC}: {A} High-Level Interface for the {NAG}
                 Library",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "462--480",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:59:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210236.html",
  acknowledgement = ack-nhfb,
  keywords =     "design; languages; performance; theory",
  subject =      "{\bf D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
                 Techniques. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE. {\bf I.1.3}: Computing
                 Methodologies, ALGEBRAIC MANIPULATION, Languages and
                 Systems. {\bf I.2.2}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Automatic Programming.",
}

@Article{Marletta:1991:CAN,
  author =       "Marco Marletta",
  title =        "Certification of Algorithm 700: Numerical Tests of the
                 {SLEIGN} Software for {Sturm-Liouville} Problems",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "481--490",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:59:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210237.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; reliability",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf G.1}: Mathematics of Computing,
                 NUMERICAL ANALYSIS.",
}

@Article{Bailey:1991:EEC,
  author =       "Paul B. Bailey and Burton S. Garbow and Hans G. Kaper
                 and Anton Zettl",
  title =        "Eigenvalue and Eigenfunction Computations for
                 {Sturm-Liouville} Problems",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "491--499",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:59:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210238.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations.",
}

@Article{Bailey:1991:AFS,
  author =       "Paul B. Bailey and Burton S. Garbow and Hans G. Kaper
                 and Anton Zettl",
  title =        "Algorithm 700: {A FORTRAN} Software Package for
                 {Sturm-Liouville} Problems",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "500--501",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:59:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210239.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.m}: Mathematics of Computing, MISCELLANEOUS.",
}

@Article{Alfeld:1991:EAS,
  author =       "Peter Alfeld and David J. Eyre",
  title =        "The Exact Analysis of Sparse Rectangular Linear
                 Systems",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "502--518",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:59:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210240.html",
  acknowledgement = ack-nhfb,
  keywords =     "measurement; performance; theory",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra.",
}

@Article{Alfeld:1991:AGE,
  author =       "Peter Alfeld and David J. Eyre",
  title =        "Algorithm 701: {Goliath}\emdash {A} Software System
                 for the Exact Analysis of Rank-Deficient Sparse
                 Rational Linear Systems",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "519--532",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:59:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210241.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra.",
}

@Article{Gustafsson:1991:CTT,
  author =       "Kjell Gustafsson",
  title =        "Control Theoretic Techniques for Stepsize Selection in
                 Explicit {Runge-Kutta} Methods",
  journal =      j-TOMS,
  volume =       "17",
  number =       "4",
  pages =        "533--554",
  month =        dec,
  year =         "1991",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sun Sep 04 23:59:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/210242.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Reliability and robustness.",
}

@Article{Boubez:1992:PED,
  author =       "Toufic I. Boubez and Andy M. Froncioni and Richard L.
                 Peskin",
  title =        "A Prototyping Envelope for Differential Equations",
  journal =      j-TOMS,
  volume =       "18",
  number =       "1",
  pages =        "1--10",
  month =        mar,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:43:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/128746.html",
  abstract =     "A system is presented to allow end users to solve
                 nonlinear differential equations without need to write
                 computer programs. The system treats $n$th order space
                 (one dimensional), first order time systems with
                 initial and/or two point boundary value specification.
                 Users of the system need only enter the problem in
                 direct mathematical notation, and output is
                 automatically presented as a solution graph. The system
                 allows the user to alter this equations, in-situ, that
                 is to computationally steer his model. Thus the system
                 is suited for model prototyping. Implementation is
                 based on an object-oriented paradigm, well established
                 and robust numerical procedures, and distributed
                 computing to supported needed resources for numerically
                 intensive tasks.",
  acknowledgement = ack-nhfb,
  keywords =     "design; experimentation; languages",
  subject =      "{\bf D.2.6}: Software, SOFTWARE ENGINEERING,
                 Programming Environments. {\bf D.2.m}: Software,
                 SOFTWARE ENGINEERING, Miscellaneous. {\bf G.1.5}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Roots of
                 Nonlinear Equations. {\bf D.3.2}: Software, PROGRAMMING
                 LANGUAGES, Language Classifications, Smalltalk.",
}

@Article{Lucks:1992:ASM,
  author =       "Michael Lucks and Ian Gladwell",
  title =        "Automated Selection of Mathematical Software",
  journal =      j-TOMS,
  volume =       "18",
  number =       "1",
  pages =        "11--34",
  month =        mar,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:43:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/128747.html",
  abstract =     "Current approaches to recommending mathematical
                 software are qualitative and categorical. These
                 approaches are unsatisfactory when the problem to be
                 solved has features that can ``trade-off'' in the
                 recommendation process. A quantitative system is
                 proposed that permits tradeoffs and can be built and
                 modified incrementally. This quantitative approach
                 extends other knowledge-engineering techniques in its
                 knowledge representation and aggregation facilities.
                 The system is demonstrated on the domain of ordinary
                 differential equation initial value problems. The
                 results are significantly superior to an existing
                 qualitative (decision tree) system.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf G.1.7}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Ordinary Differential Equations,
                 Initial value problems. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE. {\bf I.2.4}:
                 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
                 Knowledge Representation Formalisms and Methods,
                 Representation languages.",
}

@Article{Olszewski:1992:FTA,
  author =       "Jan Olszewski",
  title =        "A Flexible Thinning Algorithm Allowing Parallel,
                 Sequential, and Distributed Application",
  journal =      j-TOMS,
  volume =       "18",
  number =       "1",
  pages =        "35--45",
  month =        mar,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:54:33 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/128748.html",
  abstract =     "A parallel thinning algorithm for digital patterns is
                 presented. This algorithm can also be used for
                 sequential thinning without the simulation of parallel
                 computation. The mathematical background of the
                 algorithm bases on the notion of the Euler
                 characteristic. The proposed algorithm is simple and
                 particularly faster than other parallel algorithms.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; theory",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Parallel algorithms. {\bf I.5.2}:
                 Computing Methodologies, PATTERN RECOGNITION, Design
                 Methodology. {\bf I.4.1}: Computing Methodologies,
                 IMAGE PROCESSING, Digitization. {\bf D.1.3}: Software,
                 PROGRAMMING TECHNIQUES, Concurrent Programming.",
}

@Article{Schlick:1992:TETa,
  author =       "Tamar Schlick and Aaron Fogelson",
  title =        "{TNPACK}\emdash {A} Truncated {Newton} Minimization
                 Package for Large-Scale Problems: {I}. Algorithm and
                 Usage",
  journal =      j-TOMS,
  volume =       "18",
  number =       "1",
  pages =        "46--70",
  month =        mar,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 10 08:50:20 1996",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/150973.html",
  abstract =     "We present a FORTRAN package of subprograms for
                 minimizing multivariate functions without constraints
                 by a truncated Newton algorithm. The algorithm is
                 especially suited for problems involving a large number
                 of variables. Truncated Newton methods allow
                 approximate, rather than exact, solutions to the Newton
                 equations. Truncation is accomplished in the present
                 version by using the preconditioned Conjugate Gradient
                 algorithm (PCG) to solve approximately the Newton
                 equations. The preconditioner $M$ is factored in PCG
                 using a sparse modified Cholesky factorization based on
                 the Yale Sparse Matrix Package. In this paper we
                 briefly describe the method and provide details for
                 program usage.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra, Sparse
                 and very large systems. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization, Nonlinear
                 programming.",
}

@Article{Schlick:1992:TETb,
  author =       "Tamar Schlick and Aaron Fogelson",
  title =        "{TNPACK}\emdash {A} Truncated {Newton} Minimization
                 Package for Large-Scale Problems: {II}. Implementation
                 Examples",
  journal =      j-TOMS,
  volume =       "18",
  number =       "1",
  pages =        "71--111",
  month =        mar,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 10 08:50:15 1996",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/150975.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra, Sparse
                 and very large systems. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization, Nonlinear
                 programming. {\bf I.6.3}: Computing Methodologies,
                 SIMULATION AND MODELING, Applications. {\bf J.2}:
                 Computer Applications, PHYSICAL SCIENCES AND
                 ENGINEERING. {\bf J.3}: Computer Applications, LIFE AND
                 MEDICAL SCIENCES.",
}

@Article{Hanson:1992:QTM,
  author =       "R. J. Hanson and Fred T. Krogh",
  title =        "A Quadratic-Tensor Model Algorithm for Nonlinear
                 Least-Squares Problems with Linear Constraints",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "115--133",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146857.html",
  abstract =     "A new algorithm is presented for solving nonlinear
                 least-squares and nonlinear equation problems. The
                 algorithm is based on approximating the nonlinear
                 functions using the quadratic-tensor model proposed by
                 Schnabel and Frank. The problem statement may include
                 simple bounds or more general linear constraints on the
                 unknowns. The algorithm uses a trust-region defined by
                 a box containing the current values of the unknowns.
                 The objective function (Euclidean length of the
                 functions) is allowed to increase at intermediate
                 steps. These increases are allowed as long as our
                 predictor indicates that a new set of best values
                 exists in the trust-region. There is logic provided to
                 retreat to the current best values, should that be
                 required. The computations for the model-problem
                 require a constrained nonlinear least-squares solver.
                 This is done using a simpler version of the algorithm.
                 In its present form the algorithm is effective for
                 problems with linear constraints and dense Jacobian
                 matrices. Results on standard test problems are
                 presented in the Appendix. The new algorithm appears to
                 be efficient in terms of function and Jacobian
                 evaluations.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Nonlinear programming.",
}

@Article{Gurwitz:1992:TCE,
  author =       "Chaya Gurwitz",
  title =        "A Test for Cancellation Errors In Quasi-{Newton}
                 Methods",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "134--140",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146876.html",
  abstract =     "It has recently been shown that cancellation errors in
                 a quasi-Newton method can increase without bound as the
                 method converges. A simple test is presented to
                 determine when cancellation errors could lead to
                 significant contamination of the approximating
                 matrix.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Reliability and
                 robustness.",
}

@Article{Schlick:1992:ATE,
  author =       "Tamar Schlick and Aaron Fogelson",
  title =        "Algorithm 702: {TNPACK}\emdash {A} Truncated {Newton}
                 Minimization Package for Large-Scale Problems: {I}.
                 Algorithm and Usage",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "141--141",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 10 08:50:33 1996",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146921.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra, Sparse
                 and very large systems. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization, Nonlinear
                 programming.",
}

@Article{Cash:1992:MCS,
  author =       "J. R. Cash and S. Considine",
  title =        "An {MEBDF} Code for Stiff Initial Value Problems",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "142--155",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146922.html",
  abstract =     "In two recent papers one of the present authors has
                 proposed a class of modified extended backward
                 differentiation formulae for the numerical integration
                 of stiff initial value problems. In this paper we
                 describe a code based on this class of formulae and
                 discuss its performance on a large set of stiff test
                 problems.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.1}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Interpolation. {\bf G.1.7}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Ordinary
                 Differential Equations, Multistep methods. {\bf G.1.7}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Ordinary
                 Differential Equations, Stiff equations. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Cash:1992:AMF,
  author =       "J. R. Cash and S. Considine",
  title =        "Algorithm 703: {MEBDF}: {A FORTRAN} Subroutine for
                 Solving First-Order Systems of Stiff Initial Value
                 Problems for Ordinary Differential Equations",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "156--158",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146923.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.7}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Ordinary Differential Equations, Initial
                 value problems. {\bf G.1.1}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Interpolation. {\bf G.1.7}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Ordinary
                 Differential Equations, Multistep methods. {\bf G.1.7}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Ordinary
                 Differential Equations, Stiff equations. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Neidinger:1992:EMN,
  author =       "Richard D. Neidinger",
  title =        "An Efficient Method for the Numerical Evaluation of
                 Partial Derivatives of Arbitrary Order",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "159--173",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146924.html",
  abstract =     "For any typical multivariable expression $f$, point
                 $a$ in the domain of $f$, and positive integer
                 maxorder, this method produces the numerical values of
                 all partial derivatives at $a$ up through order
                 maxorder. By the technique known as automatic
                 differentiation, theoretically exact results are
                 obtained using numerical (as opposed to symbolic)
                 manipulation. The key ideas are a hyperpyramid data
                 structure and a generalized Leibniz's rule. Any
                 expression in $n$ variables corresponds to a
                 hyperpyramid array, in $n$-dimensional space,
                 containing the numerical values of all unique partial
                 derivatives (not wasting space on different
                 permutations of derivatives). The arrays for simple
                 expressions are combined by hyperpyramid operators to
                 form the arrays for more complicated expressions. These
                 operators are facilitated by a generalized Leibniz's
                 rule which, given a product of multivariable functions,
                 produces any partial derivative by forming the minimum
                 number of products (between two lower partials)
                 together with a product of binomial coefficients. The
                 algorithms are described in abstract pseudo-code. A
                 section on implementation shows how these ideas can be
                 converted into practical and efficient programs in a
                 typical computing environment. For any specific
                 problem, only the expression itself would require
                 recoding.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.
                 {\bf I.1.2}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Algorithms, Nonalgebraic algorithms. {\bf
                 G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 General, Numerical algorithms. {\bf G.4}: Mathematics
                 of Computing, MATHEMATICAL SOFTWARE, Algorithm
                 analysis. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Efficiency.",
}

@Article{Edwards:1992:EEN,
  author =       "John A. Edwards",
  title =        "Exact Equations of the Nonlinear Spline",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "174--192",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146925.html",
  abstract =     "We define the spline interpolating function, and
                 obtain in directly computable form the elementary set
                 of nonlinear equations describing nonlinear spline
                 curves. Using Newton's and Newton-like methods, we
                 solve typical spline configurations, and hence infer
                 that the procedure will reliably yield precise
                 extremum-energy solutions to nonlinear splines of
                 arbitrary (but presumably reasonable) size and
                 complexity.\par

                 In order to distinguish between stable and unstable
                 states of spline equilibria, we evaluate the energy
                 change resulting from a perturbation, and we briefly
                 discuss aspects of spline existence and uniqueness in
                 relation to the solved examples. We demonstrate the
                 abrupt transition which occurs at the threshold between
                 spline existence and nonexistence, and conclude that
                 proof of a spline's existence is implicit in the
                 solution set of constants yielded by the
                 method.\par

                 The procedure may be regarded on the one hand as a
                 precise and efficient research instrument for
                 investigating the properties of true splines and
                 elastica, and on the other as an everyday method for
                 obtaining ``the smoothest interpolating curve of
                 all.\par

                 Contact is always maintained with the physical analogue
                 to the curve, the thin uniform elastic beam, since the
                 four assignable parameters used in each spline interval
                 comprise the necessary and sufficient three angles and
                 one length dimension of the actual physical
                 spline.\par

                 On an historical note, the method may be seen to offer
                 progress in the search, begun in the late 17th century,
                 for a definitive solution to the elastica problem.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; theory",
  subject =      "{\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation, Spline and piecewise
                 polynomial interpolation. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization,
                 Constrained optimization. {\bf G.1.7}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Ordinary Differential
                 Equations, Boundary value problems. {\bf I.3.5}:
                 Computing Methodologies, COMPUTER GRAPHICS,
                 Computational Geometry and Object Modeling, Splines.
                 {\bf J.2}: Computer Applications, PHYSICAL SCIENCES AND
                 ENGINEERING, Engineering. {\bf J.2}: Computer
                 Applications, PHYSICAL SCIENCES AND ENGINEERING,
                 Physics.",
}

@Article{Majaess:1992:SAB,
  author =       "Fouad Majaess and Patrick Keast and Graeme Fairweather
                 and Karin R. Bennett",
  title =        "The Solution of Almost Block Diagonal Linear Systems
                 Arising in Spline Collocation at {Gaussian} Points with
                 Monomial Basis Functions",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "193--204",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146926.html",
  abstract =     "Numerical techniques based on piecewise polynomial
                 (that is, spline) collation at Gaussian points are
                 exceedingly effective for the approximate solution of
                 boundary value problems, both for ordinary differential
                 equations and for time dependent partial differential
                 equations. There are several widely available computer
                 codes based on this approach, all of which have at
                 their core a particular choice of basis representation
                 for the piecewise polynomials used to approximate the
                 solutions. Until recently, the most popular approach
                 was to use a B-spline representation, but it has been
                 shown that the B-spline basis is inferior, both in
                 operation counts and conditioning, to a certain
                 monomial basis, and the latter has come more into
                 favor. In this paper, we describe a linear algebraic
                 equations which arise in spline collocation at Gaussian
                 points with such a monomial basis. It is shown that the
                 new package, which implements an alternate column and
                 row pivoting algorithm, is a distinct improvement over
                 existing packages from the points of view of speed and
                 storage requirements. In addition, we describe a second
                 package, an important special case of the first, for
                 solving the almost block diagonal systems which arise
                 when condensation is applied to the systems arising in
                 spline collocation at Gaussian points, and also in
                 other methods for solving two-point boundary value
                 problems, such as implicit Runge-Kutta methods and
                 multiple shooting.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm analysis. {\bf G.1.3}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative
                 methods).",
}

@Article{Majaess:1992:AAA,
  author =       "Fouad Majaess and Patrick Keast and Graeme Fairweather
                 and Karin R. Bennett",
  title =        "Algorithm 704: {ABDPACK} and {ABBPACK}\emdash
                 {FORTRAN} Programs for the Solution of Almost Block
                 Diagonal Linear Systems Arising in Spline Collocation
                 at {Gaussian} Points with Monomial Basis Functions",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "205--210",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146927.html",
  abstract =     "ABDPACK is a package of FORTRAN programs for the
                 solution of systems of linear equations with the almost
                 block diagonal structure arising in spline collocation
                 at Gaussian points with monomial spline basis
                 functions, when applied to two-point boundary value
                 problems with separated boundary conditions. The
                 package ABBPACK is designed to handle a subclass of
                 such linear systems which have what may be called an
                 almost block bidiagonal structure. Such systems result,
                 for example, when condensation is applied to the full
                 spline collocation linear system. This package may also
                 be used to solve the almost block bidiagonal systems
                 arising in multiple shooting techniques and implicit
                 Runge-Kutta methods for solving two-point boundary
                 value problems. The algorithms implemented in the
                 package are based on an alternate column and row
                 pivoting scheme which avoids most of the fill-in
                 introduced by more commonly used techniques.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; standardization",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.1.2}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Approximation, Spline and piecewise polynomial
                 approximation. {\bf I.1.2}: Computing Methodologies,
                 ALGEBRAIC MANIPULATION, Algorithms. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{Tang:1992:TDI,
  author =       "Ping Tak Peter Tang",
  title =        "Table-Driven Implementation of the Expm1 Function in
                 {IEEE} Floating-Point Arithmetic",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "211--222",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146928.html",
  abstract =     "Algorithms and implementation details for the function
                 $e^x - 1$ in both single and double precision of IEEE
                 754 arithmetic are presented here. With a table of
                 moderate size, the implementations need only
                 working-precision arithmetic and are provably accurate
                 to within 0.58 ulp.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Computer arithmetic. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Error analysis. {\bf G.1.0}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, General, Numerical algorithms. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{Gardiner:1992:SSM,
  author =       "Judith D. Gardiner and Alan J. Laub and James J. Amato
                 and Cleve B. Moler",
  title =        "Solution of the {Sylvester} Matrix Equation
                 {$AXB^{\sc{T}}+CXD^{\sc{T}}=E$}",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "223--231",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 08:48:51 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146929.html",
  abstract =     "A software package has been developed to solve
                 efficiently the Sylvester-type matrix equation $AXB^{T}
                 + CXD^{T} = E$. A transformation method is used which
                 employs the QZ algorithm to structure the equation in
                 such a way that it can be solved columnwise by a back
                 substitution technique. The algorithm is an extension
                 of the Bartels-Stewart method and the Hessenberg-Schur
                 method. The numerical performance of the algorithms and
                 software is demonstrated by application to
                 near-singular systems.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Conditioning. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Efficiency. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Reliability and
                 robustness. {\bf F.2.1}: Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Numerical Algorithms and Problems, Computations on
                 matrices.",
}

@Article{Gardiner:1992:AFS,
  author =       "Judith D. Gardiner and Matthew R. Wette and Alan J.
                 Laub and James J. Amato and Cleve B. Moler",
  title =        "Algorithm 705: {A FORTRAN}-77 Software Package for
                 Solving the {Sylvester} Matrix Equation
                 {$AXB^{\sc{T}}+CXD^{\sc{T}}=E$}",
  journal =      j-TOMS,
  volume =       "18",
  number =       "2",
  pages =        "232--238",
  month =        jun,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 17:31:30 1995",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/146930.html",
  abstract =     "This paper documents a software package for solving
                 the Sylvester matrix equation (1) $AXB^{T} + CXD^{T} =
                 E$.\par

                 All quantities are real matrices; $A$ and $C$ are $m
                 \times n$; $B$ and $D$ are $m \times n$; and $X$ and
                 $E$ are $m \times n$. The unknown is $X$. Two symmetric
                 forms of Eq. (1) are treated separately for efficiency.
                 They are the continuous-time symmetric Sylvester
                 equation (2) $AXE^{T} + EXA^{T} + C = 0$ and the
                 discrete time equation (3) $AXA^{T} + C = 0$, for which
                 $A$, $E$, and $C$ is symmetric. The software also
                 provides a means for estimating the condition number of
                 these three equations. The algorithms employed are more
                 fully described in an accompanying paper [3].",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Conditioning. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Efficiency. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Reliability and
                 robustness.",
}

@Article{Weerawarana:1992:PCG,
  author =       "Sanjiva Weerawarana and Paul S. Wang",
  title =        "A Portable Code Generator for {CRAY FORTRAN}",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "241--255",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:15:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131767.html",
  abstract =     "One way to combine the powers of symbolic computing
                 with numeric computing is to automatically derive and
                 produce numeric code. This approach has important
                 applications in science and engineering. Once the
                 desired formulas and procedures are derived in a
                 symbolic manipulation system, they can be translated
                 into a target numeric language by a {\em code
                 generator}. GENCRAY is a code generator written in the
                 C language for portability. GENCRAY defines a
                 LISP-style input language that is translated into
                 either FORTRAN 77 or CRAY FORTRAN. By defining its own
                 input syntax, GENCRAY becomes a free-standing code
                 translator that can be made to work with any symbolic
                 manipulation system. GENCRAY is portable to any
                 computer system with a standard C compiler. Input to
                 GENCRAY can come from a file or directly from a
                 symbolic system through a pipe. On UNIX systems with
                 Berkeley networking, GENCRAY also runs as a network
                 server. The input syntax is customizable to allow both
                 Common and Franz LISP input styles. In addition to
                 generating easily vectorizable CRAY FORTRAN code,
                 GENCRAY also provides high-level, easy-to-use parallel
                 programming macros to produce parallel code for the
                 multiprocessor CRAY systems. The features,
                 applications, usage, and implementation of GENCRAY are
                 described. Techniques for producing parallel codes are
                 discussed and illustrated by a substantial example
                 contained in the Appendix.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; theory",
  subject =      "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
                 Processors, Code generation. {\bf D.1.2}: Software,
                 PROGRAMMING TECHNIQUES, Automatic Programming. {\bf
                 D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent
                 Programming. {\bf G.1.0}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, General. {\bf I.1.4}: Computing
                 Methodologies, ALGEBRAIC MANIPULATION, Applications.
                 {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf C.1.2}: Computer Systems
                 Organization, PROCESSOR ARCHITECTURES, Multiple Data
                 Stream Architectures (Multiprocessors), Array and
                 vector processors. {\bf D.3.2}: Software, PROGRAMMING
                 LANGUAGES, Language Classifications, C.",
}

@Article{Hansen:1992:FSG,
  author =       "Per Christian Hansen and Tony F. Chan",
  title =        "{FORTRAN} Subroutines for General {Toeplitz} Systems",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "256--273",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:40 1994",
  note =         "See also \cite{Hansen:1994:CAF}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131768.html",
  abstract =     "This paper presents FORTRAN 77 implementations of the
                 lookahead Levinson algorithm of Chan and Hansen [7, 8]
                 for solving symmetric indefinite and general Toeplitz
                 systems. The algorithms are numerically stable for all
                 Toeplitz matrices that do not have many {\em
                 consecutive} ill-conditioned leading principal
                 submatrices, and also produce estimates of the
                 algorithm and matrix condition numbers. In contrast,
                 the classical Levinson algorithm is only guaranteed to
                 be numerically stable for symmetric positive definite
                 Toeplitz matrices, and no condition estimate is
                 produced.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm analysis. {\bf G.1.3}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative methods).
                 {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 77.",
}

@Article{Demmel:1992:SBA,
  author =       "James W. Demmel and Nicholas J. Higham",
  title =        "Stability of Block Algorithms with Fast Level-3
                 {BLAS}",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "274--291",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:27:16 1994",
  note =         "See
                 \cite{Dongarra:1990:ASL,Higham:1990:EFM,Dayde:1994:PBI}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131769.html",
  abstract =     "Block algorithms are becoming increasingly popular in
                 matrix computations. Since their basic unit of data is
                 a submatrix rather than a scalar, they have a higher
                 level of granularity than point algorithms, and this
                 makes them well suited to high-performance computers.
                 The numerical stability of the block algorithms in the
                 new linear algebra program library LAPACK is
                 investigated here. It is shown that these algorithms
                 have backward error analyses in which the backward
                 error bounds are commensurate with the error bounds for
                 the underlying level-3 BLAS (BLAS3). One implication is
                 that the block algorithms are as stable as the
                 corresponding point algorithms when conventional BLAS3
                 are used. A second implication is that the use of BLAS3
                 based on fast matrix multiplication techniques affects
                 the stability only insofar as it increases the constant
                 terms in the normwise backward error bounds. For linear
                 equation solvers employing {\em LU} factorization, it
                 is shown that fixed precision iterative refinement
                 helps to mitigate the effect of the larger error
                 constants. Despite the positive results presented here,
                 not all plausible block algorithms are stable; we
                 illustrate this with the example of {\em LU}
                 factorization with block triangular factors and
                 describe how to check a block algorithm for stability
                 without doing a full error analysis.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra. {\bf F.2.1}: Theory
                 of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on matrices.",
}

@Article{Ammar:1992:IDC,
  author =       "G. S. Ammar and L. Reichel and D. C. Sorensen",
  title =        "An Implementation of a Divide and Conquer Algorithm
                 for the Unitary Eigenproblem",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "292--307",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:42 1994",
  note =         "See also \cite{Ammar:1994:CAI}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131770.html",
  abstract =     "We present a FORTRAN implementation of a
                 divide-and-conquer method for computing the spectral
                 resolution of a unitary upper Hessenberg matrix H. Any
                 such matrix $H$ of order $n$, normalized so that its
                 subdiagonal elements are nonnegative, can be written as
                 a product of $n-1$ Givens matrices and a diagonal
                 matrix. This representation, which we refer to as the
                 Schur parametric form of $H$, arises naturally in
                 applications such as in signal processing and in the
                 computation of Gauss-Szego quadrature rules. Our
                 programs utilize the Schur parametrization to compute
                 the spectral decomposition of $H$ without explicitly
                 forming the elements of H. If only the eigenvalues and
                 first components of the eigenvectors are desired, as in
                 the applications mentioned above, the algorithm
                 requires only $O(n^{2})$ arithmetic operations.
                 Experimental results presented indicate that the
                 algorithm is reliable and competitive with the general
                 QR algorithm applied to this problem. Moreover, the
                 algorithm can be easily adapted for parallel
                 implementation.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance; reliability",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE.
                 {\bf F.2.1}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
                 and Problems, Computations on matrices.",
}

@Article{Toint:1992:LFS,
  author =       "Ph. L. Toint and D. Tuyttens",
  title =        "{LSNNO}, {A FORTRAN} Subroutine for Solving
                 Large-Scale Nonlinear Network Optimization Problems",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "308--328",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:27:49 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131771.html",
  abstract =     "The implementation and testing of LSNNO, a new FORTRAN
                 subroutine for solving large-scale nonlinear network
                 optimization problems is described. The implemented
                 algorithm applies the concepts of partial separability
                 and partitioned quasi-Newton updating to
                 high-dimensional nonlinear network optimization
                 problems. Some numerical results on both academic and
                 practical problems are reported.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Nonlinear programming. {\bf
                 G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Constrained optimization. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Certification and testing. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Efficiency. {\bf
                 G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
                 Graph Theory, Network problems. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 FORTRAN.",
}

@Article{Berntsen:1992:ADA,
  author =       "Jarle Berntsen and Terje O. Espelid",
  title =        "Algorithm 706: {DCUTRI}: An Algorithm for Adaptive
                 Cubature Over a Collection of Triangles",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "329--342",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:27:52 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131772.html",
  abstract =     "An adaptive algorithm for computing an approximation
                 to the integral of each element in a vector function
                 $f(x,y)$ over a two-dimensional region made up of
                 triangles is presented. A FORTRAN implementation of the
                 algorithm is included. The basic cubature rule used
                 over each triangle is a 37-point symmetric rule of
                 degree 13. Based on the same evaluation points the
                 local error for each element in the approximation
                 vector and for each triangle is computed using a
                 sequence of null rule evaluations. A sophisticated
                 error-estimation procedure tries, in a cautious manner,
                 to decide whether we have asymptotic behavior locally
                 for each function. Different actions are taken
                 depending on that decision, and the procedure takes
                 advantage of the basic rule's polynomial degree when
                 computing the error estimate in the asymptotic case.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; reliability",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation,
                 Adaptive quadrature. {\bf G.1.4}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Quadrature and Numerical
                 Differentiation, Multiple quadrature. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Efficiency. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Reliability and robustness.",
}

@Article{Hopkins:1992:RPG,
  author =       "Tim Hopkins",
  title =        "Remark on ``{Algorithm} 540: {PDECOL}, General
                 Collocation Software for Partial Differential Equations
                 [{D3}]''",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "343--344",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:27:53 1994",
  note =         "See \cite{Madsen:1979:APG}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131773.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm analysis. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 FORTRAN.",
}

@Article{Nardin:1992:ACN,
  author =       "Mark Nardin and W. F. Perger and Atul Bhalla",
  title =        "Algorithm 707: {CONHYP}: {A} Numerical Evaluator of
                 the Confluent Hypergeometric Function for Complex
                 Arguments of Large Magnitudes",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "345--349",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:28:04 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131774.html",
  abstract =     "A numerical evaluator for the confluent hypergeometric
                 function for complex arguments with large magnitudes
                 using a direct summation of Kummer's series is
                 presented. Extended precision subroutines using large
                 arrays to accumulate a single numerator and denominator
                 are ultimately used in a single division to arrive at
                 the final result. The accuracy has been verified
                 through a variety of tests and they show the evaluator
                 to be consistently accurate to 13 significant figures,
                 and on rare occasion accurate to only 9 for magnitudes
                 of the arguments ranging into the thousands in any
                 quadrant in the complex plane. Because the evaluator
                 automatically determines the number of significant
                 figures of machine precision, and because it is written
                 in FORTRAN 77, tests on various computers have shown
                 the evaluator to provide consistently accurate results,
                 making the evaluator very portable. The principal
                 drawback is that, for certain arguments, the evaluator
                 is slow; however, the evaluator remains valuable as a
                 benchmark even in such cases.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf J.2}: Computer Applications, PHYSICAL SCIENCES
                 AND ENGINEERING. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Algorithm analysis. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN 77.",
}

@Article{Schweikard:1992:RZI,
  author =       "Achim Schweikard",
  title =        "Real Zero Isolation for Trigonometric Polynomials",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "350--359",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 01:28:05 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131775.html",
  abstract =     "An exact and practical method for determining the
                 number, location, and multiplicity of all real zeros of
                 the trigonometric polynomials is described. All
                 computations can be performed without loss of accuracy.
                 The method is based on zero isolation techniques for
                 algebraic polynomials. An efficient method for the
                 calculation of the coefficients of a corresponding
                 algebraic polynomial is stated. The complexity of
                 trigonometric zero isolation depending on the degree
                 and the coefficient size of the given trigonometric
                 polynomial is analyzed. In an experimental evaluation,
                 the performance of the method is compared to the
                 performance of recently developed numeric techniques
                 for the approximate determination of all roots of
                 trigonometric polynomials. The case of exponential or
                 hyperbolic polynomials is treated in an appendix.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf F.2.1}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
                 and Problems, Computations on polynomials. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{DiDonato:1992:ASD,
  author =       "Armido R. {DiDonato} and Alfred H. {Morris, Jr.}",
  title =        "Algorithm 708: Significant Digit Computation of the
                 Incomplete Beta Function Ratios",
  journal =      j-TOMS,
  volume =       "18",
  number =       "3",
  pages =        "360--373",
  month =        sep,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:14:47 1994",
  note =         "See also \cite{Brown:1994:CAS}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/131776.html",
  abstract =     "An algorithm is given for evaluating the incomplete
                 beta function ratio $I_{x}(a,b)$ and its complement $1
                 - I^{x}(a,b)$. A new continued fraction and a new
                 asymptotic series are used with classical results. A
                 transportable Fortran subroutine based on this
                 algorithm is currently in use. It is accurate to 14
                 significant digits when precision is not restricted by
                 inherent error.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation.",
}

@Article{Buckley:1992:ATA,
  author =       "A. G. Buckley",
  title =        "Algorithm 709: Testing Algorithm Implementations",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "375--391",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:52:09 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/138378.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; experimentation",
  subject =      "{\bf D.2.5}: Software, SOFTWARE ENGINEERING, Testing
                 and Debugging, Monitors. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization, Gradient
                 methods. {\bf G.1.6}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Optimization, Nonlinear
                 programming. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE, Certification and testing.",
}

@Article{Dongarra:1992:AFS,
  author =       "J. J. Dongarra and G. A. Geist and C. H. Romine",
  title =        "Algorithm 710: {FORTRAN} Subroutines for Computing the
                 Eigenvalues and Eigenvectors of a General Matrix by
                 Reduction to General Tridiagonal Form",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "392--400",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:52:57 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/138352.html",
  abstract =     "This paper describes programs to reduce a nonsymmetric
                 matrix to tridiagonal form, to compute the eigenvalues
                 of the tridiagonal matrix, to improve the accuracy of
                 an eigenvalue, and to compute the corresponding
                 eigenvector. The intended purpose of the software is to
                 find a few eigenpairs of a dense nonsymmetric matrix
                 faster and more accurately than previous methods. The
                 performance and accuracy of the new routines are
                 compared to two EISPACK paths: RG and HQR-INVIT. The
                 results show that the new routines are more accurate
                 and also faster if less than 20 percent of the
                 eigenpairs are needed.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf F.2.1}: Theory of Computation, ANALYSIS OF
                 ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
                 and Problems, Computations on matrices. {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Eigenvalues. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Fisher:1992:DTO,
  author =       "M. E. Fisher and L. S. Jennings",
  title =        "Discrete-Time Optimal Control Problems with General
                 Constraints",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "401--413",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:52:58 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/138356.html",
  abstract =     "This paper presents a computational procedure for
                 solving combined discrete-time optimal control and
                 optimal parameter selection problems subject to general
                 constraints. The approach adopted is to convert the
                 problem into a nonlinear programming problem which can
                 be solved using standard optimization software. The
                 main features of the procedure are the way the controls
                 are parametrized and the conversion of all constraints
                 into a standard form suitable for computation. The
                 software is available commercially as a FORTRAN program
                 DMISER3 together with a companion program MISER3 for
                 solving continuous-time problems.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Constrained optimization. {\bf
                 G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 General, Numerical algorithms. {\bf G.1.6}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Optimization,
                 Nonlinear programming. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Efficiency.",
}

@Article{Nash:1992:ABS,
  author =       "Stephen G. Nash and Ariela Sofer",
  title =        "Algorithm 711: {BTN}: Software for Parallel
                 Unconstrained Optimization",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "414--448",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:53:18 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/138359.html",
  abstract =     "BTN is a collection of FORTRAN subroutines for solving
                 unconstrained nonlinear optimization problems. It
                 currently runs on both Intel hypercube computers
                 (distributed memory) and Sequent computers (shared
                 memory), and can take advantage of vector processors if
                 they are available. The software can also be run on
                 traditional computers to simulate the performance of a
                 parallel computer. BTN is a general-purpose algorithm,
                 capable of solving problems with a large numbers of
                 variables and suitable for users inexperienced with
                 parallel computing. It is designed to be as easy to use
                 as traditional algorithms for this problem, requiring
                 only that a (scalar) subroutine be provided to evaluate
                 the objective function and its gradient vector of first
                 derivatives. The algorithm is based on a block
                 truncated-Newton method. Truncated-Newton methods
                 obtain the search direction by approximately solving
                 the Newton equations via some iterative method. The
                 particular method used in BTN is a block version of the
                 Lanczos method, which is numerically stable for
                 nonconvex problems. In addition to the optimization
                 software, a parallel derivative checker is also
                 provided.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; documentation",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Parallel algorithms. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Gradient methods. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Nonlinear programming.",
}

@Article{Leva:1992:FNR,
  author =       "Joseph L. Leva",
  title =        "A Fast Normal Random Number Generator",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "449--453",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:53:29 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/138364.html",
  abstract =     "A method is presented for generating pseudorandom
                 numbers with a normal distribution. The technique uses
                 the ratio of uniform deviates method discovered by
                 Kinderman and Monahan with an improved set of bounding
                 curves. An optimized quadratic fit reduces the expected
                 number of logarithm evaluations to 0.012 per normal
                 deviate. The method gives a theoretically correct
                 distribution and can be implemented in 15 lines of
                 FORTRAN. Timing and source size comparisons are made
                 with other methods for generating normal deviates. The
                 proposed algorithm compares favorably with some of the
                 better algorithms.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance; theory",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical computing.",
}

@Article{Leva:1992:ANR,
  author =       "Joseph L. Leva",
  title =        "Algorithm 712: {A} Normal Random Number Generator",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "454--455",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:53:35 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/138367.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical software.",
}

@Article{Boisvert:1992:PVS,
  author =       "Ronald F. Boisvert and Bonita V. Saunders",
  title =        "Portable Vectorized Software for {Bessel} Function
                 Evaluation",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "456--469",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:53:41 1994",
  note =         "See also \cite{Boisvert:1993:CPV}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/138370.html",
  abstract =     "A suite of computer programs for the evaluation of
                 Bessel functions and modified Bessel functions of
                 orders zero and one for a vector of real arguments is
                 described. Distinguishing characteristics of these
                 programs are that (a) they are portable across a wide
                 range of machines, and (b) they are vectorized in the
                 case when multiple function evaluations are to be
                 performed. The performance of the new programs are
                 compared with software from the FNLIB collection of
                 Fullerton on which the new software is based.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Chebyshev approximation and
                 theory. {\bf G.1.0}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Efficiency. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Portability.",
}

@Article{Drezner:1992:CMN,
  author =       "Zvi Drezner",
  title =        "Computation of the Multivariate Normal Integral",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "470--480",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:39 1994",
  note =         "See also \cite{Drezner:1993:CAC}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/138375.html",
  abstract =     "This paper presents a direct computation of the
                 multivariate normal integral by the Gauss Quadrature
                 method. An error control method is given. Results are
                 presented for multivariate integrals consisting of up
                 to twelve normal distributions. A computer program in
                 FORTRAN is given.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical software. {\bf G.1.4}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Quadrature and Numerical Differentiation, Multiple
                 quadrature.",
}

@Article{Aberth:1992:PCU,
  author =       "Oliver Aberth and Mark J. Schaefer",
  title =        "Precise Computation Using Range Arithmetic, via
                 {C++}",
  journal =      j-TOMS,
  volume =       "18",
  number =       "4",
  pages =        "481--491",
  month =        dec,
  year =         "1992",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:53:58 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/138377.html",
  abstract =     "An arithmetic is described that can replace
                 floating-point arithmetic for programming tasks
                 requiring assured accuracy. A general explanation is
                 given of how the arithmetic is constructed with C++,
                 and a programming example in this language is supplied.
                 Times for solving representative problems are
                 presented.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Computer arithmetic. {\bf D.3.2}:
                 Software, PROGRAMMING LANGUAGES, Language
                 Classifications, C++.",
}

@Article{Cody:1993:ACP,
  author =       "W. J. Cody",
  title =        "Algorithm 714: {CELEFUNT}: {A} Portable Test Package
                 for Complex Elementary Functions",
  journal =      j-TOMS,
  volume =       "19",
  number =       "1",
  pages =        "1--21",
  month =        mar,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:15:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/151272.html",
  abstract =     "This paper discusses CELEFUNT, a package of Fortran
                 programs for testing complex elementary functions.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Certification and testing. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Numerical algorithms.",
}

@Article{Cody:1993:ASE,
  author =       "W. J. Cody",
  title =        "Algorithm 715: {SPECFUN}\emdash {A} Portable {FORTRAN}
                 Package of Special Function Routines and Test Drivers",
  journal =      j-TOMS,
  volume =       "19",
  number =       "1",
  pages =        "22--32",
  month =        mar,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:15:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/151273.html",
  abstract =     "SPECFUN is a package containing transportable FORTRAN
                 special function programs for real arguments and
                 accompanying test drivers. Components include Bessel
                 functions, exponential integrals, error functions and
                 related functions, and gamma functions and related
                 functions.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Certification and testing. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Numerical algorithms.",
}

@Article{Wu:1993:ACH,
  author =       "Trong Wu",
  title =        "An Accurate Computation of the Hypergeometric
                 Distribution Function",
  journal =      j-TOMS,
  volume =       "19",
  number =       "1",
  pages =        "33--43",
  month =        mar,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:15:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/151274.html",
  abstract =     "The computation of the cumulative hypergeometric
                 distribution function is of interest to many
                 researchers who are working in the computational
                 sciences and related areas. Presented here is a new
                 method for computing this function that applies prime
                 number factorization to the factorials. We also apply
                 cancellation to the numerator and denominator to reduce
                 the computational complexity of the initial, the tail
                 end, or weighted probabilities to achieve maximum
                 accuracy. The new method includes two algorithms, one
                 using recursion and the other using iteration. These
                 two algorithms are machine independent; precision is
                 arbitrary, subject to storage limitation. The
                 development of the algorithms is discussed, and some
                 test results and the comparison of these two algorithms
                 are given. To implement both algorithms, we use the Ada
                 programming language that is an American National
                 Standard Institute standardized language. The language
                 has special features such as {\em exception handling}
                 and {\em tasks}. {\em Exception handling} is used to
                 make programming easier and to prevent overflow or
                 underflow conditions during the execution of the
                 program. {\em Tasks} are used to compute the numerator
                 and denominator concurrently, and to maximize the
                 possible number of integer multiplications in the
                 numerator and denominator. All of the computations can
                 be done on currently available machines, and the time
                 consumed by these computations remains reasonably
                 small.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; languages",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Numerical algorithms. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical computing. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.
                 {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Ada. {\bf D.3.3}: Software,
                 PROGRAMMING LANGUAGES, Language Constructs and
                 Features, Control structures.",
}

@Article{Kamel:1993:OES,
  author =       "M. S. Kamel and K. S. Ma and W. H. Enright",
  title =        "{ODEXPERT}: An Expert System to Select Numerical
                 Solvers for Initial Value {ODE} Systems",
  journal =      j-TOMS,
  volume =       "19",
  number =       "1",
  pages =        "44--62",
  month =        mar,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:15:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/151275.html",
  abstract =     "ODEXPERT is a prototype knowledge-based system which
                 selects the appropriate numerical solvers for initial
                 value ordinary differential equations. It is capable of
                 deriving some knowledge about the input problem by
                 performing automated tests to detect properties and
                 structures in the problem which guide the selection
                 process.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  subject =      "{\bf I.2.1}: Computing Methodologies, ARTIFICIAL
                 INTELLIGENCE, Applications and Expert Systems. {\bf
                 G.1.7}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Ordinary Differential Equations, Initial value
                 problems. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Cash:1993:MAM,
  author =       "J. R. Cash and S. Semnani",
  title =        "A Modified {Adams} Method for {NonStiff} and Mildly
                 Stiff Initial Value Problems",
  journal =      j-TOMS,
  volume =       "19",
  number =       "1",
  pages =        "63--80",
  month =        mar,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:15:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/151276.html",
  abstract =     "Adams predictor-corrector methods, and explicit
                 Runge-Kutta formulas, have been widely used for the
                 numerical solution of nonstiff initial value problems.
                 Both of these classes of methods have certain
                 drawbacks, however, and it has long been the aim of
                 numerical analysts to derive a class of formulas that
                 has the advantages of both Adams and Runge-Kutta
                 methods and the disadvantages of neither! In this paper
                 we derive a class of modified Adams formulas that
                 attempts to achieve this aim. When used in a certain
                 precisely defined predictor-corrector mode, these new
                 formulas require three function evaluations per step,
                 but have much better stability than Adams formulas.
                 This improved stability makes the modified Adams
                 formulas particularly effective for mildly stiff
                 problems, and some numerical evidence of this is given.
                 We also consider the performance of the new class of
                 methods on the well-known DETEST test set to show their
                 potential on general nonstiff initial value problems.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Certification and testing. {\bf G.1.7}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Ordinary
                 Differential Equations, Initial value problems.",
}

@Article{Renka:1993:ATT,
  author =       "R. J. Renka",
  title =        "Algorithm 716: {TSPACK}: Tension Spline Curve-Fitting
                 Package",
  journal =      j-TOMS,
  volume =       "19",
  number =       "1",
  pages =        "81--94",
  month =        mar,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:15:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/151277.html",
  abstract =     "The primary purpose of TSPACK is to construct a smooth
                 function which interpolates a discrete set of data
                 points. The function may be required to have either one
                 or two continuous derivatives. If the accuracy of the
                 data does not warrant interpolation, a smoothing
                 function (which does not pass through the data points)
                 may be constructed instead. The fitting method is
                 designed to avoid extraneous inflection points
                 (associated with rapidly varying data values) and
                 preserve local shape properties of the data
                 (monotonicity and convexity), or to satisfy the more
                 general constraints of bounds on function values or
                 first derivatives. The package also provides a
                 parametric representation for construction general
                 planar curves and space curves.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf G.1.2}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Approximation. {\bf G.1.1}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Interpolation.",
}

@Article{Snow:1993:CTP,
  author =       "Dennis M. Snow",
  title =        "Computing Tensor Product Decompositions",
  journal =      j-TOMS,
  volume =       "19",
  number =       "1",
  pages =        "95--108",
  month =        mar,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:15:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/151278.html",
  abstract =     "An algorithm is presented for computing the
                 decomposition of a tensor product of two irreducible
                 representations of a semisimple complex Lie group into
                 its irreducible components. The algorithm uses a known
                 formula which expresses the multiplicities of the
                 highest weight vectors in the decomposition as an
                 alternating sum indexed by the Weyl group. This sum is
                 accomplished with minimal memory requirements using
                 techniques developed previously by the author for
                 efficiently computing Weyl group orbits. Examples are
                 given for each of the exceptional Lie groups.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; measurement; performance;
                 theory",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm analysis. {\bf F.2.1}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems.",
}

@Article{Bunch:1993:ASM,
  author =       "David S. Bunch and David M. Gay and Roy E. Welsch",
  title =        "Algorithm 717: Subroutines for Maximum Likelihood and
                 Quasi-Likelihood Estimation of Parameters in Nonlinear
                 Regression Models",
  journal =      j-TOMS,
  volume =       "19",
  number =       "1",
  pages =        "109--130",
  month =        mar,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:15:25 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/151279.html",
  abstract =     "We present FORTRAN 77 subroutines that solve
                 statistical parameter estimation problems for general
                 nonlinear models, e.g., nonlinear least-squares,
                 maximum likelihood, maximum quasi-likelihood,
                 generalized nonlinear least-squares, and some robust
                 fitting problems. The accompanying test examples
                 include members of the generalized linear model family,
                 extensions using nonlinear predictors (``nonlinear
                 GLIM''), and probabilistic choice models, such as
                 linear-in-parameter multinomial probit models. The
                 basic method, a generalization of the NL2SOL algorithm
                 for nonlinear least-squares, employs a
                 model/trust-region scheme for computing trial steps,
                 exploits special structure by maintaining a secant
                 approximation to the second-order part of the Hessian,
                 and adaptively switches between a Gauss-Newton and an
                 augmented Hessian approximation. Gauss-Newton steps are
                 computed using a corrected seminormal equations
                 approach. The subroutines include variants that handle
                 simple bounds on the parameters, and that compute
                 approximate regression diagnostics.",
  acknowledgement = ack-nhfb,
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical computing. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical software. {\bf G.1.6}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Optimization. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Boisvert:1993:CPV,
  author =       "Ronald F. Boisvert and Bonita V. Saunders",
  title =        "Corrigendum: ``{Algorithm} 713: Portable Vectorized
                 Software for {Bessel} Function Evaluation''",
  journal =      j-TOMS,
  volume =       "19",
  number =       "1",
  pages =        "131--131",
  month =        mar,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:33:37 1994",
  note =         "See \cite{Boisvert:1992:PVS}.",
  acknowledgement = ack-nhfb,
}

@Article{Boisvert:1993:E,
  author =       "Ronald F. Boisvert",
  title =        "Editorial",
  journal =      j-TOMS,
  volume =       "19",
  number =       "2",
  pages =        "135--135",
  month =        jun,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:34:01 1994",
  acknowledgement = ack-nhfb,
}

@Article{Duff:1993:CSE,
  author =       "I. S. Duff and J. A. Scott",
  title =        "Computing Selected Eigenvalues of Sparse Unsymmetric
                 Matrices Using Subspace Iteration",
  journal =      j-TOMS,
  volume =       "19",
  number =       "2",
  pages =        "137--159",
  month =        jun,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 14 09:56:28 1995",
  note =         "See \cite{Duff:1995:CCS}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/152614.html",
  abstract =     "This paper discusses the design and development of a
                 code to calculate the eigenvalues of a large sparse
                 real unsymmetric matrix that are the rightmost,
                 leftmost, or are of the largest modulus. A subspace
                 iteration algorithm is used to compute a sequence of
                 sets of vectors that converge to an orthonormal basis
                 for the invariant subspace corresponding to the
                 required eigenvalues. This algorithm is combined with
                 Chebychev acceleration if the rightmost or leftmost
                 eigenvalues are sought, or if the eigenvalues of
                 largest modulus are known to be the rightmost or
                 leftmost eigenvalues. An option exists for computing
                 the corresponding eigenvectors. The code does not need
                 the matrix explicitly since it only requires the user
                 to multiply sets of vectors by the matrix.
                 Sophisticated and novel iteration controls, stopping
                 criteria, and restart facilities are provided. The code
                 is shown to be efficient and competitive on a range of
                 test problems.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis.",
}

@Article{Demmel:1993:GSDa,
  author =       "James Demmel and Bo K{\aa}gstr{\"{o}}m",
  title =        "The Generalized {Schur} Decomposition of an Arbitrary
                 Pencil {$A-\lambda{B}$}: Robust Software with Error
                 Bounds and Applications. Part {I}: {Theory} and
                 Algorithms",
  journal =      j-TOMS,
  volume =       "19",
  number =       "2",
  pages =        "160--174",
  month =        jun,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:18 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/152615.html",
  abstract =     "Robust software with error bounds for computing the
                 generalized Schur decomposition of an arbitrary matrix
                 pencil A - [lambda]B (regular or singular) is
                 presented. The decomposition is a generalization of the
                 Schur canonical form of A - [lambda]I to matrix pencils
                 and reveals the Kronecker structure of a singular
                 pencil. Since computing the Kronecker structure of a
                 singular pencil is a potentially ill-posed problem, it
                 is important to be able to compute rigorous and
                 reliable error bounds for the computed features. The
                 error bounds rely on perturbation theory for reducing
                 subspaces and generalized eigenvalues of singular
                 matrix pencils. The first part of this two-part paper
                 presents the theory and algorithms for the
                 decomposition and its error bounds, while the second
                 part describes the computed generalized Schur
                 decomposition and the software, and presents
                 applications and an example of its use.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; geig; generalized Schur decomposition;
                 matrix pencil; nla; reliability; theory",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf
                 G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Numerical Linear Algebra, Conditioning. {\bf F.4.1}:
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic. {\bf G.4}: Mathematics
                 of Computing, MATHEMATICAL SOFTWARE, Algorithm
                 analysis.",
}

@Article{Demmel:1993:GSDb,
  author =       "James Demmel and Bo K{\aa}gstr{\"{o}}m",
  title =        "The Generalized {Schur} Decomposition of an Arbitrary
                 Pencil {$A-\lambda{B}$}: {Robust} Software with Error
                 Bounds and Applications. Part {II}: {Software} and
                 Applications",
  journal =      j-TOMS,
  volume =       "19",
  number =       "2",
  pages =        "175--201",
  month =        jun,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:34:01 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/152616.html",
  abstract =     "Robust software with error bounds for computing the
                 generalized Schur decomposition of an arbitrary matrix
                 pencil A - [lambda]B (regular or singular) is
                 presented. The decomposition is a generalization of the
                 Schur canonical form of A - [lambda]I to matrix pencils
                 and reveals the Kronecker structure of a singular
                 pencil. The second part of this two-part paper
                 describes the computed generalized Schur decomposition
                 in more detail and the software, and presents
                 applications and an example of its use. Background
                 theory and algorithms for the decomposition and its
                 error bounds are presented in Part I of this paper.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; geig; generalized Schur decomposition;
                 matrix pencil; nla; reliability; theory",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf
                 G.1.3}: Mathematics of Computing, NUMERICAL ANALYSIS,
                 Numerical Linear Algebra, Conditioning. {\bf F.4.1}:
                 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL
                 LANGUAGES, Mathematical Logic. {\bf G.4}: Mathematics
                 of Computing, MATHEMATICAL SOFTWARE, Algorithm
                 analysis.",
}

@Article{Bai:1993:CCN,
  author =       "Z. Bai and J. Demmel and A. McKenney",
  title =        "On Computing Condition Numbers for the Nonsymmetric
                 Eigenproblem",
  journal =      j-TOMS,
  volume =       "19",
  number =       "2",
  pages =        "202--223",
  month =        jun,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:34:01 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/152617.html",
  abstract =     "We review the theory of condition numbers for the
                 nonsymmetric eigenproblem and give a tabular summary of
                 bounds for eigenvalues, means of clusters of
                 eigenvalues, eigenvectors, invariant subspaces, and
                 related quantities. We describe the design of new
                 algorithms for estimating these condition numbers.
                 Fortran subroutines implementing these algorithms are
                 in the LAPACK library [1].",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; reliability",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations on matrices. {\bf G.4}:
                 Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Algorithm analysis. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Efficiency. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Reliability and robustness.",
}

@Article{Miminis:1993:AFS,
  author =       "George Miminis and Michael Reid",
  title =        "Algorithm 718: {A FORTRAN} Subroutine to Solve the
                 Eigenvalues Allocation Problem for Single-Input
                 Systems",
  journal =      j-TOMS,
  volume =       "19",
  number =       "2",
  pages =        "224--232",
  month =        jun,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:34:01 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/152618.html",
  abstract =     "An efficient implementation of an algorithm for the
                 eigenvalue allocation (pole placement) problem of
                 single-input linear systems using state feedback is
                 given in this paper. The implementation uses the BLAS
                 level-1 [2] subroutines when possible for better
                 performance. A brief description of the algorithm along
                 with some computational details is also given.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Eigenvalues. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations on matrices. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Numerical algorithms.",
}

@Article{Greenberg:1993:EAC,
  author =       "Harvey J. Greenberg",
  title =        "Enhancements of {ANALYZE}: {A} Computer-Assisted
                 Analysis System for Linear Programming",
  journal =      j-TOMS,
  volume =       "19",
  number =       "2",
  pages =        "233--256",
  month =        jun,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Sep 05 09:34:01 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/152619.html",
  abstract =     "This describes enhancements to provide more advanced
                 computer-assisted analysis of instances of linear
                 programming models. Three categories of enhancements
                 are described: views, engines for obtaining
                 information, and rule-based advising. Examples of their
                 uses include redundancy and infeasibility diagnoses.",
  acknowledgement = ack-nhfb,
  keywords =     "design; experimentation; languages; performance",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, ANALYZE. {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Linear programming. {\bf I.6.2}:
                 Computing Methodologies, SIMULATION AND MODELING,
                 Simulation Languages. {\bf I.6.4}: Computing
                 Methodologies, SIMULATION AND MODELING, Model
                 Validation and Analysis.",
}

@Article{Fishman:1993:GSC,
  author =       "George S. Fishman and L. Stephen Yarberry",
  title =        "Generating a Sample from a $k$-Cell Table with
                 Changing Probabilities in {$O(\log_2k)$} Time",
  journal =      j-TOMS,
  volume =       "19",
  number =       "2",
  pages =        "257--261",
  month =        jun,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 30 00:48:36 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/152621.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS.",
}

@Article{Bentley:1993:TDI,
  author =       "Jon L. Bentley and Mary F. Fernandez and Brian W.
                 Kernighan and Norman L. Schryer",
  title =        "Template-Driven Interfaces for Numerical Subroutines",
  journal =      j-TOMS,
  volume =       "19",
  number =       "3",
  pages =        "265--287",
  month =        sep,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:17:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/155757.html",
  abstract =     "This paper describes a set of interfaces for numerical
                 subroutines. Typing a short (often one-line)
                 description allows one to solve problems in application
                 domains including least-squares data fitting,
                 differential equations, minimization, root finding, and
                 integration. Our approach of ``template-driven
                 programming'' makes it easy to build such an interface:
                 a simple one takes a few hours to construct, while a
                 few days suffice to build the most complex program we
                 describe.",
  acknowledgement = ack-nhfb,
  keywords =     "awk; design; experimentation; Fortran; languages;
                 Maple; UNIX shell",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE. {\bf D.2.2}: Software, SOFTWARE ENGINEERING,
                 Tools and Techniques, User interfaces. {\bf D.2.2}:
                 Software, SOFTWARE ENGINEERING, Tools and Techniques,
                 Software libraries. {\bf D.3.4}: Software, PROGRAMMING
                 LANGUAGES, Processors, Preprocessors. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Numerical algorithms. {\bf D.2.m}: Software, SOFTWARE
                 ENGINEERING, Miscellaneous, Reusable software.",
}

@Article{Bailey:1993:AMT,
  author =       "David H. Bailey",
  title =        "Algorithm 719: Multiprecision Translation and
                 Execution of {FORTRAN} Programs",
  journal =      j-TOMS,
  volume =       "19",
  number =       "3",
  pages =        "288--319",
  month =        sep,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:17:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/155767.html",
  abstract =     "This paper describes two Fortran utilities for
                 multiprecision computation. The first is a package of
                 Fortran subroutines that perform a variety of
                 arithmetic operations and transcendental functions on
                 floating point numbers of arbitrarily high precision.
                 This package is in some cases over 200 times faster
                 than that of certain other packages that have been
                 developed for this purpose.\par

                 The second utility is a translator program, which
                 facilitates the conversion of ordinary Fortran programs
                 to use this package. By means of source directives
                 (special comments) in the original Fortran program, the
                 user declares the precision level and specifies which
                 variables in each subprogram are to be treated as
                 multiprecision. The translator program reads this
                 source program and outputs a program with the
                 appropriate multiprecision subroutine calls.\par

                 This translator supports multiprecision integer, real,
                 and complex datatypes. The required array space for
                 multiprecision data types is automatically allocated.
                 In the evaluation of computational expressions, all of
                 the usual conventions for operator precedence and mixed
                 mode operations are upheld. Furthermore, most of the
                 Fortran-77 intrinsics, such as ABS, MOD, NINT, COS, EXP
                 are supported and produce true multiprecision values.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; multiple-precision computation;
                 multiprecision arithmetic; performance",
  subject =      "F.2.1 [Analysis of Algorithms and Problem Complexity]:
                 Numerical Algorithms and Problems; G.1.0 [Numerical
                 Analysis]: General; G.1.2 [Numerical Analysis];
                 Approximation",
}

@Article{Berntsen:1993:AAA,
  author =       "Jarle Berntsen and Ronald Cools and Terje O. Espelid",
  title =        "Algorithm 720: An Algorithm for Adaptive Cubature Over
                 a Collection of 3-Dimensional Simplices",
  journal =      j-TOMS,
  volume =       "19",
  number =       "3",
  pages =        "320--332",
  month =        sep,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:17:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/155785.html",
  abstract =     "An adaptive algorithm for computing an approximation
                 to the integral of each element in a vector of
                 functions over a 3-dimensional region covered by
                 simplices is presented. The algorithm is encoded in
                 FORTRAN 77.\par

                 Locally, a cubature formula of degree 8 with 43 points
                 is used to approximate an integral. The local error
                 estimate is based on the same evaluation points. The
                 error estimation procedure tries to decide whether the
                 approximation for each function has asymptotic
                 behavior, and different actions are taken depending on
                 that decision.\par

                 The simplex with the largest error is subdivided into 8
                 simplices. The local procedure is then applied to each
                 new region. This procedure is repeated until
                 convergence.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; automatic integration; cubature; cubature
                 rules; error estimation; null rules; reliability;
                 symmetry; tetrahedrons",
  subject =      "G.1.4 [Numerical Analysis]: Quadrature and Numerical
                 Differentiation -- adaptive quadrature; multiple
                 quadrature; G.4 [Mathematics of Computing]:
                 Mathematical Software -- efficiency; reliability and
                 robustness",
}

@Article{Duffy:1993:NIL,
  author =       "Dean G. Duffy",
  title =        "On the Numerical Inversion of {Laplace} Transforms:
                 Comparison of Three New Methods on Characteristic
                 Problems from Applications",
  journal =      j-TOMS,
  volume =       "19",
  number =       "3",
  pages =        "333--359",
  month =        sep,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:17:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/155788.html",
  abstract =     "Three frequently used methods for numerically
                 inverting Laplace transforms are tested on complicated
                 transforms taken from the literature. The first method
                 is a straightforward application of the trapezoidal
                 rule to Bromwich's integral. The second method,
                 developed by Weeks [22], integrates Bromwich's integral
                 by using Laguerre polynomials. The third method,
                 devised by Talbot [18], deforms Bromwich's contour so
                 that the integrand of Bromwich's integral is small at
                 the beginning and end of the contour. These methods are
                 also applied to joint Laplace-Fourier transform
                 problems. All three methods give satisfactory results;
                 Talbot's, however, has an accurate method for choosing
                 required parameters.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; theory",
  subject =      "F.2.1 [Analysis of Algorithms and Problem Complexity]:
                 Numerical Algorithms and Problems",
}

@Article{Pruess:1993:MSS,
  author =       "Steven Pruess and Charles T. Fulton",
  title =        "Mathematical Software for {Sturm-Liouville} Problems",
  journal =      j-TOMS,
  volume =       "19",
  number =       "3",
  pages =        "360--376",
  month =        sep,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:17:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/155791.html",
  abstract =     "Software is described for the Sturm-Liouville
                 eigenproblem. Eigenvalues, eigenfunctions, and spectral
                 density functions can be estimated with global error
                 control. The method of approximating the coefficients
                 forms the mathematical basis. The underlying algorithms
                 are briefly described, and several examples are
                 presented.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; approximating the coefficients;
                 eigenfunctions; performance; shooting methods; spectral
                 classification; spectral density functions;
                 Sturm-Liouville eigenvalues",
  subject =      "G.1.7 [Numerical Analysis]: Ordinary Differential
                 Equations -- boundary value problems; G.4 [Mathematics
                 of Computing]: Mathematical Software -- algorithm
                 analysis",
}

@Article{Shirts:1993:CES,
  author =       "Randall B. Shirts",
  title =        "The Computation of Eigenvalues and Solutions of
                 {Mathieu}'s Differential Equation for Noninteger
                 Order",
  journal =      j-TOMS,
  volume =       "19",
  number =       "3",
  pages =        "377--390",
  month =        sep,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:17:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/155796.html",
  abstract =     "Two algorithms for calculating the eigenvalues and
                 solutions of Mathieu's differential equation for
                 noninteger order are described. In the first algorithm,
                 Leeb's method is generalized, expanding the Mathieu
                 equation in Fourier series and diagonalizing the
                 symmetric tridiagonal matrix that results. Numerical
                 testing was used to parameterize the minimum matrix
                 dimension that must be used to achieve accuracy in the
                 eigenvalue of one part in $10^{12}$. This method
                 returns a set of eigenvalues below a given order and
                 their associated solutions simultaneously. A second
                 algorithm is presented which uses approximations to the
                 eigenvalues (Taylor series and asymptotic expansions)
                 and then iteratively corrects the approximations using
                 Newton's method until the corrections are less than a
                 given tolerance. A backward recursion of the continued
                 fraction expansion is used. The second algorithm is
                 faster and is optimized to obtain accuracy of one part
                 in $10^{14}$, but has only been implemented for orders
                 less than 10.5.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; eigenvalues; Floquet solutions; Mathieu
                 equation; noninteger order; numerical software;
                 ordinary differential equations; performance",
  subject =      "G.1.0 [Numerical Analysis]: General -- numerical
                 algorithms",
}

@Article{Shirts:1993:AMM,
  author =       "Randall B. Shirts",
  title =        "Algorithm 721: {MTIEU1} and {MTIEU2}: Two Subroutines
                 to Compute Eigenvalues and Solutions to {Mathieu}'s
                 Differential Equation for Noninteger and Integer
                 Order",
  journal =      j-TOMS,
  volume =       "19",
  number =       "3",
  pages =        "391--406",
  month =        sep,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:17:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/155847.html",
  abstract =     "Two FORTRAN routines are described which calculate
                 eigenvalues and eigenfunctions of Mathieu's
                 differential equation for noninteger as well as integer
                 order, MTIEU1 uses standard matrix techniques with
                 dimension parameterized to give accuracy in the
                 eigenvalue of one part in $10^{12}$. MTIEU2 used
                 continued fraction techniques and is optimized to give
                 accuracy in the eigenvalue of one part in $10^{14}$.
                 The limitations of the algorithms are also discussed
                 and illustrated.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; eigenvalues; Floquet solutions; FORTRAN;
                 Mathieu equation; noninteger order; numerical software;
                 ordinary differential equations; performance",
  subject =      "G.1.0 [General Numerical Analysis]",
}

@Article{Haag:1993:QLA,
  author =       "J. B. Haag and D. S. Watkins",
  title =        "{QR}-Like Algorithms for the Nonsymmetric Eigenvalue
                 Problem",
  journal =      j-TOMS,
  volume =       "19",
  number =       "3",
  pages =        "407--418",
  month =        sep,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:17:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/155849.html",
  abstract =     "Hybrid codes that combine elements of the QR and LR
                 algorithms are described. The codes can calculate the
                 eigenvalues and, optionally, eigenvectors of real,
                 nonsymmetric matrices. Extensive tests are presented as
                 evidence that, for certain choices of parameters, the
                 hybrid codes possess the same high reliability as the
                 QR algorithm and are significantly faster. The greatest
                 success has been achieved with the codes that calculate
                 eigenvalues only. These can do the task in 15\% to 50\%
                 less time than the QR algorithm.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; chasing the bulge; eigenvalue;
                 eigenvector; experimentation; GR algorithm; LR
                 algorithm; measurement; performance; QR algorithm;
                 verification",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Efficiency. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Eigenvalues. {\bf F.2.1}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems.",
}

@Article{Chang:1993:ICR,
  author =       "S. Frank Chang and S. Thomas McCormick",
  title =        "Implementation and Computational Results for the
                 Hierarchical Algorithm for Making Sparse Matrices
                 Sparser",
  journal =      j-TOMS,
  volume =       "19",
  number =       "3",
  pages =        "419--441",
  month =        sep,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:17:34 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/152620.html",
  abstract =     "If A is the (sparse) coefficient matrix of
                 linear-equality constraints, for what nonsingular $T$
                 is A = TA as sparse as possible, and how can it be
                 efficiently computed? An efficient algorithm for this
                 {\em Sparsity Problem} (SP) would be a valuable
                 preprocessor for linearly constrained optimization
                 problems. In a companion paper we developed a two-pass
                 approach to solve SP called the {\em Hierarchical
                 Algorithm}. In this paper we report on how we
                 implemented the Hierarchical Algorithm into a code
                 called HASP, and our computational experience in
                 testing HASP on the NETLIB linear-programming problems.
                 We found that HASP substantially outperformed a
                 previous code for SP and that it produced a net savings
                 in optimization time on the NETLIB problems. The
                 results allow us to give guidelines for its use in
                 practice.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; measurement; performance; verification",
  subject =      "F.2.1 [Analysis of Algorithms and Problem Complexity]:
                 Numerical Algorithms and Problems -- computations on
                 matrices; G.1.6 [Numerical Analysis]: Optimization --
                 linear programming; G.4 [Mathematics of Computing]:
                 Mathematical Software -- algorithms analysis;
                 efficiency",
}

@Article{Cody:1993:AFS,
  author =       "W. J. Cody and J. T. Coonen",
  title =        "Algorithm 722: Functions to Support the {IEEE}
                 Standard for Binary Floating-Point Arithmetic",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "443--451",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 20:08:53 1994",
  bibsource =    "garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168185.html",
  abstract =     "This paper describes C programs for the support
                 functions {\em copysign(x,y), logb(x), scalb(x,n),
                 nextafter(x,y), finite(x),} and {\em isnan(x)}
                 recommended in the Appendix to the {\em IEEE Standard
                 for Binary Floating-Point Arithmetic.} In the case of
                 {\em logb}, the modified definition given in the later
                 {\em IEEE Standard for Radix-Independent Floating-Point
                 Arithmetic} is followed. These programs should run
                 without modification on most systems conforming to the
                 binary standard.",
  acknowledgement = ack-nj,
  keywords =     "algorithms; copysign; finite; isnan; logb;
                 manipulative functions; nextafter; scalb",
  subject =      "G.1.0 [Numerical Analysis]: General -- numerical
                 algorithms; G.4 [Numerical Analysis]: Mathematical
                 Software -- certification and testing",
}

@Article{Snyder:1993:AFI,
  author =       "W. Van Snyder",
  title =        "Algorithm 723: {Fresnel} Integrals",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "452--456",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 20:08:49 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168193.html",
  abstract =     "An implementation of approximations for Fresnel
                 integrals and associated functions is described. The
                 approximations were originally developed by W. J. Cody,
                 but a Fortran implementation using them has not
                 previously been published.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; special functions",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation, Rational approximation. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Certification and testing.",
}

@Article{Ribbens:1993:TPM,
  author =       "Calvin J. Ribbens and Layne T. Watson and Colin Desa",
  title =        "Toward Parallel Mathematical Software for Elliptic
                 Partial Differential Equations",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "457--473",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:47:29 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168383.html",
  abstract =     "Three approaches to parallelizing important components
                 of the mathematical software package ELLPACK are
                 considered: an explicit approach using compiler
                 directives available only on the target machine, an
                 automatic approach using an optimizing and
                 parallelizing precompiler, and a two-level approach
                 based on extensive use of a set of low level
                 computational kernels. The focus is on shared memory
                 architectures. Each approach to parallelization is
                 described in detail, along with a discussion of the
                 effort involved. Performance on a test problem, using
                 up to sixteen processors of a Sequent Symmetry S81, is
                 reported and discussed. Implications for the
                 parallelization of a broad class of mathematical
                 software are drawn.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "G.1.0 [Numerical Analysis]: General -- parallel
                 algorithms; G.1.8 [Numerical Analysis]: Partial
                 Differential Equations -- elliptic equations; G.4
                 [Mathematics of Computing]: Mathematical Software --
                 efficiency; portability",
}

@Article{Abernathy:1993:ASE,
  author =       "Roger W. Abernathy and Robert P. Smith",
  title =        "Applying Series Expansion to the Inverse Beta
                 Distribution to Find Percentiles of the
                 ${F}$-Distribution",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "474--480",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:47:29 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168387.html",
  abstract =     "Let $0 <= 1$ and $F$ be the cumulative distribution
                 function (cdf) of the $F$-Distribution. We wish to find
                 $x_{p}$ such that $F(x_{p}|n_{1}, n_{2}) = p$, where
                 $n_{1}$ and $n_{2}$ are the degrees of freedom.
                 Traditionally, $x_{p}$ is found using a numerical
                 root-finding method, such as Newton's method. In this
                 paper, a procedure based on a series expansion for
                 finding $x_{p}$is given. The series expansion method
                 has been applied to the normal, chi-square, and $t$
                 distributions, but because of computational
                 difficulties, it has not been applied to the
                 $F$-Distribution. These problems have been overcome by
                 making the standard transformation to the beta
                 distribution.\par

                 The procedure is explained in Sections 3 and 4.
                 Empirical results of a comparison of CPU times are
                 given in Section 5. The series expansion is compared to
                 some of the standard root-finding methods. A table is
                 given for $p = 0.90$.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; cumulative distribution function;
                 cumulative distribution function (cdf); distribution
                 function; F-distribution; Newton's method; performance;
                 root-finding methods; Taylor series",
  subject =      "G.1.5 [Numerical Analysis]: Roots of Nonlinear
                 Equations; G.3 [Probability and Statistics]",
}

@Article{Abernathy:1993:APC,
  author =       "Roger W. Abernathy and Robert P. Smith",
  title =        "Algorithm 724: Program to Calculate
                 ${F}$-Percentiles",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "481--483",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:47:29 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168405.html",
  abstract =     "Let $0 < p < 1$ be given and let $F$ be the cumulative
                 distribution function of the $F$-Distribution with $(M,
                 N)$, degrees of freedom. This FORTRAN 77 routine is a
                 complement to [1] where a method was presented to find
                 the inverse of the $F$-Distribution function, FINV($M,
                 N, P$), using a series expansion technique to find the
                 inverse for the Beta Distribution function.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; cumulative distribution function (cdf);
                 distribution function; experimentation; F-distribution;
                 Newton's method; root-finding methods; Taylor series;
                 theory",
  subject =      "G.1.5 [Numerical Analysis]: Roots of Nonlinear
                 Equations",
}

@Article{Clarkson:1993:RAF,
  author =       "Douglas B. Clarkson and Yuan-an Fan and Harry Joe",
  title =        "A Remark on Algorithm 643: {FEXACT}: An Algorithm for
                 Performing {Fisher}'s Exact Test in $r\times{c}$
                 Contingency Tables",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "484--488",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:47:29 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168412.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; measurement; performance;
                 theory",
  subject =      "{\bf G.1.2}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Approximation.",
}

@Article{Hormann:1993:PRN,
  author =       "W. H{\"{o}}rmann and G. Deflinger",
  title =        "A Portable Random Number Generator Well Suited for the
                 Rejection Method",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "489--495",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:47:29 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168414.html",
  abstract =     "Up to now, all known efficient portable
                 implementations of linear congruential random number
                 generators with modulus $2^{31} - 1$ have worked only
                 with multipliers that are small compared with the
                 modulus. We show that for nonuniform distributions, the
                 rejection method may generate random numbers of bad
                 qualify if combined with a linear congruential
                 generator with small multiplier. A method is described
                 that works for any multiplier smaller than $2^{30}$. It
                 uses the decomposition of multiplier and seed in
                 high-order and low-order bits to compute the upper and
                 lower half of the product. The sum of the two halves
                 gives the product of multiplier and seed modulo $2^{21}
                 - 1$. Coded in ANSI-C and FORTRAN77 the method results
                 in a portable implementation of the linear congruential
                 generator that is as fast or faster than other portable
                 methods.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; linear congruential generator;
                 portability; quality of nonuniform random numbers;
                 rejection method; uniform random number generator",
  subject =      "G.3 [Mathematics of Computation]: Probability and
                 Statistics -- random number generation",
}

@Article{Grassmann:1993:REC,
  author =       "Winifred K. Grassmann",
  title =        "Rounding Errors in Certain Algorithms Involving
                 {Markov} Chains",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "496--508",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 16 19:47:29 1994",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168416.html",
  abstract =     "A number of algorithms involving Markov chains contain
                 no subtractions. This property makes the analysis of
                 rounding errors particularly simple. To show this, some
                 principles for analyzing the propagation and generation
                 of rounding errors in algorithms containing no
                 subtraction are discussed first. These principles are
                 then applied in the context of a simple recursive
                 algorithm involving the transient solution of
                 discrete-time Markov chains, Jensen's algorithm, and
                 state reduction. Jensen's algorithm, also known as
                 randomization or uniformization, is an algorithm for
                 finding transient solutions of continuous-time Markov
                 chains. State reduction is a method for finding
                 equilibrium probabilities for discrete-time or
                 continuous-time Markov chains.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS. {\bf F.2.2}: Theory of Computation,
                 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
                 Nonnumerical Algorithms and Problems.",
  xxkeywords =   "(none)",
  xxsubject =    "(none)",
}

@Article{Khoury:1993:TPG,
  author =       "B. N. Khoury and P. M. Pardalos and D.-Z. Du",
  title =        "A Test Problem Generator for the {Steiner} Problem in
                 Graphs",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "509--522",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Nov 06 07:19:45 1995",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168420.html",
  abstract =     "In this paper we present a new binary-programming
                 formulation for the Steiner problem in graphs (SPG),
                 which is well known to be NP-hard. We use this
                 formulation to generate test problems with known
                 optimal solutions. The technique uses the KKT
                 optimality conditions on the corresponding
                 quadratically constrained optimization problem.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; experimentation; integer programming;
                 performance; Steiner problem in graphs; test problems",
  subject =      "G.1.6 [Numerical Analysis]: Optimization -- integer
                 programming; G.4 [Mathematics of Computing]:
                 Mathematical Software -- certification and testing;
                 efficiency",
}

@Article{Joe:1993:ILM,
  author =       "Stephen Joe and Ian H. Sloan",
  title =        "Implementation of a Lattice Method for Numerical
                 Multiple Integration",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "523--545",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:08:44 1994",
  note =         "See also \cite{Joe:1994:CIL}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168425.html",
  abstract =     "An implementation of a method for numerical multiple
                 integration based on a sequence of imbedded lattice
                 rules is given. Besides yielding an approximation to
                 the integral, this implementation also provides an
                 error estimate which does not require much extra
                 computation. The results of some numerical experiments
                 conclude the paper.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; lattice rules; performance",
  subject =      "G.1.4 [Numerical Analysis]: Quadrature and Numerical
                 Differentiation -- multiple quadrature",
}

@Article{Drezner:1993:CAC,
  author =       "Zvi Drezner",
  title =        "Corrigendum: ``{Algorithm} 725. Computation of the
                 Multivariate Normal Integral''",
  journal =      j-TOMS,
  volume =       "19",
  number =       "4",
  pages =        "546--546",
  month =        dec,
  year =         "1993",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:05:07 1994",
  note =         "See \cite{Drezner:1992:CMN}.",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/168428.html",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; multivariate normal probability",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Statistical software. {\bf G.1.4}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Quadrature and Numerical Differentiation, Multiple
                 quadrature.",
}

@Article{Boisvert:1994:CST,
  author =       "Ronald F. Boisvert",
  title =        "Charter and Scope: Transactions on Mathematical
                 Software ({TOMS})",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 06 19:02:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Renka:1994:CSC,
  author =       "Robert J. Renka",
  title =        "Charter and Scope: Collected Algorithms ({CALGO})",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 06 19:02:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Neusius:1994:NTA,
  author =       "Christian Neusius and Jan Olszewski",
  title =        "A Noniterative Thinning Algorithm",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "5--20",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 06 19:02:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Gautschi:1994:ACP,
  author =       "Walter Gautschi",
  title =        "Algorithm 726: {ORTHPOL}\emdash {A} Package of
                 Routines for Generating Orthogonal Polynomials and
                 {Gauss}-Type Quadrature Rules",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "21--62",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Sep 10 09:11:55 1994",
  acknowledgement = ack-nhfb,
}

@Article{Pennington:1994:NNL,
  author =       "S. V. Pennington and M. Berzins",
  title =        "New {NAG} Library Software for First-Order Partial
                 Differential Equations",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "63--99",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 06 19:02:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Hashem:1994:AQE,
  author =       "Sherif Hashem and Bruce Schmeiser",
  title =        "Algorithm 727: Quantile Estimation Using Overlapping
                 Batch Statistics",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "100--102",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 06 19:02:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Calamai:1994:GQB,
  author =       "Paul H. Calamai and Luis N. Vicente",
  title =        "Generating Quadratic Bilevel Programming Test
                 Problems",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "103--119",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 06 19:02:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Calamai:1994:AFS,
  author =       "Paul H. Calamai and Luis N. Vicente",
  title =        "Algorithm 728: {FORTRAN} Subroutines for Generating
                 Quadratic Bilevel Programming Test Problems",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "120--123",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 06 19:02:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Jeffrey:1994:ETI,
  author =       "D. J. Jeffrey and A. D. Rich",
  title =        "The Evaluation of Trigonometric Integrals Avoiding
                 Spurious Discontinuities",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "124--135",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Sep 06 19:02:59 1994",
  acknowledgement = ack-nhfb,
}

@Article{Matstoms:1994:SQF,
  author =       "Pontus Matstoms",
  title =        "Sparse {QR} Factorization in {MATLAB}",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "136--159",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Aug 26 23:38:18 1994",
  acknowledgement = ack-nhfb,
  keywords =     "multfr; qrd; sparse",
}

@Article{Hansen:1994:CAF,
  author =       "Per Christian Hansen and Tony F. Chan",
  title =        "Corrigendum: ``{Algorithm} 729: {FORTRAN} Subroutines
                 for General {Toeplitz} Systems''",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "160--160",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:10:19 1994",
  note =         "See \cite{Hansen:1992:FSG}.",
  acknowledgement = ack-nhfb,
}

@Article{Ammar:1994:CAI,
  author =       "G. S. Ammar and L. Reichel and D. C. Sorensen",
  title =        "Corrigendum: ``{Algorithm} 730: An Implementation of a
                 Divide and Conquer Algorithm for the Unitary
                 Eigenproblem''",
  journal =      j-TOMS,
  volume =       "20",
  number =       "1",
  pages =        "161--161",
  month =        mar,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:05:32 1994",
  note =         "See \cite{Ammar:1992:IDC}.",
  acknowledgement = ack-nhfb,
}

@Article{Salvy:1994:GMP,
  author =       "Bruno Salvy and Paul Zimmerman",
  title =        "{GFUN}: {A} {Maple} Package for the Manipulation of
                 Generating and Holonomic Functions in One Variable",
  journal =      j-TOMS,
  volume =       "20",
  number =       "2",
  pages =        "163--177",
  month =        jun,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:27:17 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; computer algebra; generating functions;
                 linear differential equations; linear recurrences",
  subject =      "G.2.1 [Discrete Mathematics]:
                 Combinatorics--generating functions; recurrences and
                 difference equations; I.1.2 [Algebraic Manipulation]:
                 Algorithms",
}

@Article{Dayde:1994:PBI,
  author =       "Michael J. Dayd{\'{e}} and Iain S. Duff and Antoine
                 Petitet",
  title =        "A Parallel Block Implementation of Level-3 {BLAS} for
                 {MIMD} Vector Processors",
  journal =      j-TOMS,
  volume =       "20",
  number =       "2",
  pages =        "178--193",
  month =        jun,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Fri Sep 09 13:52:29 1994",
  note =         "See
                 \cite{Dongarra:1990:ASL,Higham:1990:EFM,Demmel:1992:SBA}.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; Level-3 BLAS; matrix-matrix kernels;
                 measurement; parallelization; performance;
                 vectorization",
  subject =      "F.2.1 [Analysis of Algorithms and Problem Complexity]:
                 Numerical Algorithms and Problems--computations on
                 matrices; G.1.0 [Numerical Analysis]:
                 General--numerical algorithms; G.1.3 [Numerical
                 Analysis]: Numerical Linear Algebra--linear systems
                 (direct and iterative methods); G.4 [Mathematics of
                 Computing]: Mathematical Software--certification and
                 testing; efficiency; portability; reliability and
                 robustness; verification",
}

@Article{Blom:1994:AMG,
  author =       "J. G. Blom and P. A. Zegeling",
  title =        "Algorithm 731: {A} Moving-Grid Interface for Systems
                 of One-Dimensional Time-Dependent Partial Differential
                 Equations",
  journal =      j-TOMS,
  volume =       "20",
  number =       "2",
  pages =        "194--214",
  month =        jun,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:27:31 1994",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; Lagrangian methods; mathematical software;
                 method of lines; moving grids; partial differential
                 equations; performance; reliability; time-dependent
                 problems",
  subject =      "G.1.0 [Numerical Analysis]: General; G.1.8 [Numerical
                 Analysis]: Partial Differential Equations; G.4
                 [Mathematics of Computing]: Mathematical Software",
}

@Article{Hull:1994:ICE,
  author =       "T. E. Hull and Thomas F. Fairgrieve and Ping Tak Peter
                 Tang",
  title =        "Implementing Complex Elementary Functions Using
                 Exception Handling",
  journal =      j-TOMS,
  volume =       "20",
  number =       "2",
  pages =        "215--244",
  month =        jun,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 21 15:10:29 1995",
  note =         "See \cite{Anonymous:1994:C}.",
  abstract =     "Algorithms are developed for reliable and accurate
                 evaluations of the complex elementary functions
                 required in Fortran 77 and Fortran 90, namely cabs,
                 csqrt, cexp, clog, csin, and ccos. The algorithms are
                 presented in a pseudocode that has a convenient
                 exception-handling facility. A tight error bound is
                 derived for each algorithm. Corresponding Fortran
                 programs for an IEEE environment have also been
                 developed to illustrate the practicality of the
                 algorithms, and these programs have been tested very
                 carefully to help confirm the correctness of the
                 algorithms and their error bounds. The results are of
                 these tests are included in the paper, but the Fortran
                 programs are not; the programs are available from
                 Fairgrieve, (tff@cs.toronto.edu).",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; complex elementary functions; design;
                 implementation",
  subject =      "G.1.0 [Numerical Analysis]: General--error analysis;
                 numerical algorithms; G.1.2 [Numerical Analysis]:
                 Approximation--elementary function approximation; G.4
                 [Mathematics of Computing]: Mathematical
                 Software--algorithm analysis; reliability and
                 robustness; verification",
}

@Article{Joe:1994:CIL,
  author =       "Stephen Joe and Ian H. Sloan",
  title =        "Corrigendum: ``{Implementation} of a Lattice Method
                 for Numerical Multiple Integration''",
  journal =      j-TOMS,
  volume =       "20",
  number =       "2",
  pages =        "245--245",
  month =        jun,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 13:05:52 1994",
  note =         "See \cite{Joe:1993:ILM}.",
  acknowledgement = ack-nhfb,
}

@Article{Cummins:1994:ASS,
  author =       "Patrick F. Cummins and Geoffrey K. Vallis",
  title =        "Algorithm 732: Solvers for Self-Adjoint Elliptic
                 Problems in Irregular Two-Dimensional Domains",
  journal =      j-TOMS,
  volume =       "20",
  number =       "3",
  pages =        "247--261",
  month =        sep,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 12:53:13 1994",
  acknowledgement = ack-rfb,
  keywords =     "algorithms; capacitance iteration; capacitance matrix;
                 elliptic equations; fast Poisson solvers; Green's
                 function",
  subject =      "G.1.0 [Numerical Analysis]: General -- numerical
                 algorithms; G.1.8 [Numerical Analysis]: Partial
                 Differential Equations -- elliptic equations",
}

@Article{Kraft:1994:ATF,
  author =       "Dieter Kraft",
  title =        "Algorithm 733: {TOMP}---{Fortran} Modules for Optimal
                 Control Calculations",
  journal =      j-TOMS,
  volume =       "20",
  number =       "3",
  pages =        "262--281",
  month =        sep,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 22 09:25:54 1994",
  acknowledgement = ack-rfb,
  keywords =     "algorithms; boundary value problems; manipulators;
                 optimal control; robotics; shooting method",
  subject =      "G.1.6 [Numerical Analysis]: Optimization; G.1.7
                 [Numerical Analysis]: Ordinary Differential Equations;
                 G.4 [Mathematics of Computing]: Mathematical Software;
                 I.2.9 [Artificial Intelligence]: Robotics",
}

@Article{Averbukh:1994:RA,
  author =       "Victoria Z. Averbukh and Samuel Figueroa and Tamar
                 Schlick",
  title =        "Remark on Algorithm 566",
  journal =      j-TOMS,
  volume =       "20",
  number =       "3",
  pages =        "282--285",
  month =        sep,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 12:53:17 1994",
  note =         "See \cite{More:1981:AFS}.",
  acknowledgement = ack-rfb,
  keywords =     "Hessian subroutines; performance",
  subject =      "D.2.7 [Software Engineering]: Distribution and
                 Maintenance -- documentation; enhancement; G.1.6
                 [Numerical Analysis]: Optimization -- nonlinear
                 programming",
}

@Article{More:1994:LSA,
  author =       "Jorge Mor\'{e} and David J. Thuente",
  title =        "Line Search Algorithms With Guaranteed Sufficient
                 Decrease",
  journal =      j-TOMS,
  volume =       "20",
  number =       "3",
  pages =        "286--307",
  month =        sep,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 12:53:17 1994",
  acknowledgement = ack-rfb,
  keywords =     "algorithms; conjugate gradient algorithms; line search
                 algorithms; nonlinear optimization; truncated Newton
                 algorithms; variable metric algorithms",
  subject =      "G.1.6 [Numerical Analysis]: Optimization --
                 constrained optimization; gradient methods; nonlinear
                 programming; G.4 [Mathematics of Computing]:
                 Mathematical Software -- algorithm analysis;
                 efficiency; reliability and robustness;",
}

@Article{Buckley:1994:CFC,
  author =       "A. G. Buckley",
  title =        "Conversion to {Fortran} 90: {A} Case Study",
  journal =      j-TOMS,
  volume =       "20",
  number =       "3",
  pages =        "308--353",
  month =        sep,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 12:53:17 1994",
  acknowledgement = ack-rfb,
  keywords =     "conversion; Fortran 90; new features; overview",
}

@Article{Buckley:1994:AFC,
  author =       "A. G. Buckley",
  title =        "Algorithm 734: {A} {Fortran} 90 Code for Unconstrained
                 Nonlinear Minimization",
  journal =      j-TOMS,
  volume =       "20",
  number =       "3",
  pages =        "354--372",
  month =        sep,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 12:53:17 1994",
  acknowledgement = ack-rfb,
  keywords =     "algorithms; conversion; Fortran 90; limited memory;
                 new features; nonlinear optimization; quasi-Newton",
  subject =      "G.1.6 [Numerical Analysis]: Optimization -- gradient
                 methods;",
}

@Article{Kim:1994:PNA,
  author =       "K. Kim and J. L. Nazareth",
  title =        "A Primal Null-space Affine Scaling Method",
  journal =      j-TOMS,
  volume =       "20",
  number =       "3",
  pages =        "373--392",
  month =        sep,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 12:53:17 1994",
  acknowledgement = ack-rfb,
  keywords =     "algorithms; conjugate gradients; diagonal
                 preconditioning; interior-point algorithm; null-space
                 affine scaling; primal method",
  subject =      "G.1.6 [Numerical Analysis]: Optimization -- linear
                 programming;",
}

@Article{Brown:1994:CAS,
  author =       "Barry W. Brown and Lawrence Levy",
  title =        "Certification of Algorithm 708: Significant Digit
                 Computation of the Incomplete Beta",
  journal =      j-TOMS,
  volume =       "20",
  number =       "3",
  pages =        "393--397",
  month =        sep,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Nov 19 12:53:17 1994",
  note =         "See \cite{DiDonato:1992:ASD}.",
  acknowledgement = ack-rfb,
  keywords =     "algorithms; continued fractions; F-distribution",
  subject =      "G.1.2 [Numerical Analysis]: Approximation;",
}

@Article{Taswell:1994:AWT,
  author =       "Carl Taswell and Kevin C. McGill",
  title =        "Algorithm 735: Wavelet Transform Algorithms for
                 Finite-Duration Discrete-Time Signals",
  journal =      j-TOMS,
  volume =       "20",
  number =       "3",
  pages =        "398--412",
  month =        sep,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 22 09:25:55 1994",
  acknowledgement = ack-rfb,
  keywords =     "algorithms; multiresolution analysis; signal
                 processing; waveform analysis; wavelet transform;
                 wavelets",
  subject =      "G.1.2 [Numerical Analysis]: Approximations; G.4
                 [Mathematics of Computing]: Mathematical Software;
                 I.4.5 [Image Processing]: Reconstruction;",
}

@Article{Dunkl:1994:CHI,
  author =       "C. F. Dunkl and D. E. Ramirez",
  title =        "Computing Hyperelliptic Integrals for Surface Measure
                 of Ellipsoids",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "413--426",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:16:49 1995",
  acknowledgement = ack-rfb,
  keywords =     "elliptic integral; expected radius; Lauricella's
                 hypergeometric function; optimal designs; surface
                 measure",
  subject =      "G.1.4 [Numerical Analysis]: Quadrature and Numerical
                 Differentiation -- multiple quadrature; G.3
                 [Mathematics of Computing]: Probability and
                 Statistics",
}

@Article{Dunkl:1994:AHI,
  author =       "C. F. Dunkl and D. E. Ramirez",
  title =        "Algorithm 736: Hyperelliptic Integrals and the Surface
                 Measure of Ellipsoids",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "427--435",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:16:51 1995",
  acknowledgement = ack-rfb,
  keywords =     "elliptic integral; expected radius; Lauricella's
                 hypergeometric function; optimal designs; surface
                 measure",
  subject =      "G.1.4 [Numerical Analysis]: Quadrature and Numerical
                 Differentiation -- multiple quadrature; G.3
                 [Mathematics of Computing]: Probability and
                 Statistics",
}

@Article{Feuechtel:1994:NAE,
  author =       "H. Feuechtel and P. Otto",
  title =        "A New Algorithm for the Evaluation of the Incomplete
                 Gamma Function on Vector Computers",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "436--446",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:16:52 1995",
  acknowledgement = ack-rfb,
  keywords =     "Incomplete Gamma Function; quantum chemistry;
                 two-electron integrals",
  subject =      "C.1.2 [Processor Architectures]: Multiple Data Stream
                 Architectures -- array and vector processors; G.1.2
                 [Numerical Analysis]: Approximation -- rational
                 approximation; G.4 [Mathematics of Computing]:
                 Mathematical Software -- efficiency; J.2 [Computer
                 Applications]: Physical Sciences and Engineering --
                 chemistry",
}

@Article{Kearfott:1994:AIP,
  author =       "R. B. Kearfott and M. Dawande and K. Du and C. Hu",
  title =        "Algorithm 737: {INTLIB}: {A} Portable {Fortran}-77
                 Elementary Function Library",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "447--459",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat May 20 15:54:18 1995",
  accepted =     "December 1993",
  acknowledgement = ack-rfb,
  keywords =     "BLAS; Fortran 77; Fortran 90; interval arithmetic;
                 operator overloading; standard functions",
  subject =      "D.2.2 [Software Engineering]: Tools and Techniques --
                 software libraries; D.2.7 [Software Engineering]:
                 Distribution and Maintenance -- documentation;
                 portability; G.1.0 [Numerical Analysis]: General --
                 computer arithmetic; G.1.2 [Numerical Analysis]:
                 Approximation -- elementary function approximation",
}

@Article{Peters:1994:EAE,
  author =       "Jorg Peters",
  title =        "Evaluation and Approximate Evaluation of the
                 Multivariate {Bernstein-B{\'{e}}zier} Form on a
                 Regularly Partitioned Simplex",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "460--480",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:28:34 1995",
  acknowledgement = ack-rfb,
  keywords =     "Bernstein-B\'{e}zier form; evaluation; multivariate;
                 power form; subdivision",
  subject =      "G.1.2 [Numerical Analysis]: Approximation; I.3.5
                 [Computer Graphics]: Computational Geometry and Object
                 Modeling",
}

@Article{Li:1994:RSA,
  author =       "Kim-Hung Li",
  title =        "Reservoir Sampling Algorithms of Time Complexity
                 {$O(n(1+\log(N/n)))$}",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "481--493",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:16:57 1995",
  acknowledgement = ack-rfb,
  keywords =     "analysis of algorithms; random sampling; reservoir",
  subject =      "G.3 [Mathematics of Computing]: Probability and
                 Statistics -- probabilistic algorithms; random number
                 generation; statistical software; G.4 [Mathematics of
                 Computing]: Mathematical Software -- algorithm
                 analysis",
}

@Article{Bratley:1994:APG,
  author =       "Paul Bratley and Bennett L. Fox and Harald
                 Niederreiter",
  title =        "Algorithm 738: {Programs} to Generate {Niederreiter}'s
                 Low-discrepancy Sequences",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "494--495",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Apr 10 15:51:40 1995",
  accepted =     "December 1993",
  acknowledgement = ack-rfb,
  keywords =     "low-discrepancy sequences; quasi-Monte Carlo;
                 quasirandom sequences",
  subject =      "G.1.4 [Numerical Analysis]: Quadrature and Numerical
                 Differentiation; I.6 [Computing Methodologies]:
                 Simulation and Modeling",
}

@Article{Gustafsson:1994:CTT,
  author =       "Kjell Gustafsson",
  title =        "Control Theoretic Techniques for Stepsize Selection in
                 Implicit {Runge-Kutta} Methods",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "496--517",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:00 1995",
  acknowledgement = ack-rfb,
  keywords =     "control theory; numerical integration; Runge-Kutta
                 methods; stability; stepsize selection",
  subject =      "G.1.7 [Numerical Analysis]: Ordinary Differential
                 Equations -- initial value problems; single step
                 methods; G.4 [Mathematics of Computing]: Mathematical
                 Software -- algorithm analysis; efficiency; reliability
                 and robustness",
}

@Article{Chow:1994:ASP,
  author =       "Ta-Tung Chow and Elizabeth Eskow and Robert B.
                 Schnabel",
  title =        "Algorithm 739: {A} Software Package for Unconstrained
                 Optimization using Tensor Methods",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "518--530",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Mon Apr 10 15:51:48 1995",
  acknowledgement = ack-rfb,
  keywords =     "higher-order model; tensor method; unconstrained
                 optimization",
  subject =      "G.1.6 [Numerical Analysis]: Optimization -- Gradient
                 methods; G.4 [Mathematics of Computing]: Mathematical
                 Software -- efficiency; reliability and robustness",
}

@Article{Pinar:1994:DPL,
  author =       "Mustafa Pinar and Stavros A. Zenios",
  title =        "Data-level Parallel Linear-quadratic Penalty Algorithm
                 for Multicommodity Network Flows",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "531--552",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:27:42 1995",
  acknowledgement = ack-rfb,
  keywords =     "massively parallel algorithms; multicommodity network
                 problems; parallel optimization",
  subject =      "D.1.3 [Programming Techniques]: Concurrent Programming
                 -- parallel programming; E.1 [Data]: Data Structures;
                 G.1.6 [Numerical Analysis]: Optimization -- constrained
                 optimization; nonlinear programming; G.2.2 [Discrete
                 Mathematics]: Graph Theory -- network problems",
}

@Article{Anonymous:1994:C,
  author =       "Anonymous",
  title =        "Corrigenda",
  journal =      j-TOMS,
  volume =       "20",
  number =       "4",
  pages =        "553--553",
  month =        dec,
  year =         "1994",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:03 1995",
  note =         "See \cite{Hull:1994:ICE}",
  acknowledgement = ack-rfb,
}

@Article{Boisvert:1995:PST,
  author =       "Ronald F. Boisvert",
  title =        "Purpose and Scope: {TOMS}",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "1--2",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:05 1995",
  acknowledgement = ack-rfb,
}

@Article{Hopkins:1995:PSC,
  author =       "Tim R. Hopkins",
  title =        "Purpose and Scope: {CALGO}",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "3--3",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:06 1995",
  acknowledgement = ack-rfb,
}

@Article{Jones:1995:IIC,
  author =       "Mark T. Jones and Paul E. Plassmann",
  title =        "An Improved Incomplete {Cholesky} Factorization",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "5--17",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:12 1995",
  acknowledgement = ack-rfb,
  keywords =     "incomplete Cholesky; incomplete factorization;
                 preconditioners; sparse matrices",
  subject =      "G.1.3 [Numerical Analysis]: Numerical Linear Algebra
                 -- linear systems; sparse and very large systems",
}

@Article{Jones:1995:AFS,
  author =       "Mark T. Jones and Paul E. Plassmann",
  title =        "Algorithm 740: {Fortran} Subroutines to Compute
                 Improved Incomplete {Cholesky} Factorizations",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "18--19",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:13 1995",
  acknowledgement = ack-rfb,
  keywords =     "incomplete Cholesky; incomplete factorization;
                 preconditioners; sparse matrices",
  subject =      "G.1.3 [Numerical Analysis]: Numerical Linear Algebra
                 -- linear systems; sparse and very large systems",
}

@Article{Ray:1995:ALS,
  author =       "Richard D. Ray",
  title =        "Algorithm 741: Least Squares Solution of a Linear
                 Bordered, Block-diagonal System of Equations",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "20--25",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:14 1995",
  acknowledgement = ack-rfb,
  keywords =     "bordered block-diagonal equations; least-squares
                 solutions; sparse systems",
  subject =      "G.1.3 [Numerical Analysis]: Numerical Linear Algebra
                 -- linear systems (direct and iterative methods); G.1.6
                 [Numerical Analysis]: Optimization -- least squares
                 methods; G.4 [Mathematics of Computing]: Mathematical
                 Software",
}

@Article{Fateman:1995:FFP,
  author =       "Richard J. Fateman and Kevin A. Broughan and Diane K.
                 Willcock and Duane Rettig",
  title =        "Fast Floating Point Processing in {Common Lisp}",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "26--62",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:16 1995",
  acknowledgement = ack-rfb,
  keywords =     "C programming language; Common Lisp; compiler
                 optimization; floating-point arithmetic; Fortran; Lisp;
                 numerical algorithms; symbolic computation",
  subject =      "D.3.4 [Programming Languages]: Processors --
                 compilers; interpreters; optimization; G.4 [Mathematics
                 of Computing]: Mathematical Software -- efficiency;
                 portability",
}

@Article{Kearfott:1995:FER,
  author =       "R. Baker Kearfott",
  title =        "A {Fortran} 90 Environment for Research and
                 Prototyping of Enclosure Algorithms for Nonlinear
                 Equations and Global Optimization",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "63--78",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat May 20 15:54:41 1995",
  acknowledgement = ack-rfb,
  keywords =     "automatic differentiation; Fortran 90; global
                 optimization; nonlinear algebraic systems; symbolic
                 computation",
  subject =      "D.3.3 [Programming Languages]: Language Constructs;
                 G.1.5 [Numerical Analysis]: Roots of Nonlinear
                 Equations; G.1.6 [Numerical Analysis]: Optimization;
                 G.4 [Mathematics of Computing]: Mathematical Software",
}

@Article{Dongarra:1995:SDX,
  author =       "Jack Dongarra and Tom Rowan and Reed Wade",
  title =        "Software Distribution using {XNETLIB}",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "79--88",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:18 1995",
  acknowledgement = ack-rfb,
  keywords =     "Netlib; software repositories",
  subject =      "C.2.3 [Computer-Communication Networks]: Network
                 Operations -- public networks; D.2.2 [Software
                 Engineering]: Tools and Techniques -- software
                 libraries; user interfaces; D.2.7 [Software
                 Engineering]: Distribution and Maintenance --
                 documentation; portability; G.1.0 [Numerical Analysis]:
                 General -- numerical algorithms; G.4 [Mathematics of
                 Computing]: Mathematical Software -- portability; H.3.0
                 [Information Systems Applications]: Communications
                 Applications; H.3.3 [Information Storage and
                 Retrieval]: Information Search and Retrieval -- search
                 process; selection process; H.3.5 [Information Storage
                 and Retrieval]: Online Information Services -- databank
                 sharing; H.5.2 [Information Interfaces and
                 Presentation]: User Interfaces -- windowing systems;
                 K.6.3 [Management of Computing and Information
                 Systems]: Software Management -- software development;
                 software maintenance; software selection",
}

@Article{Grosse:1995:RM,
  author =       "Eric Grosse",
  title =        "Repository Mirroring",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "89--97",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:20 1995",
  acknowledgement = ack-rfb,
  keywords =     "C.2.4 [Computer-Communication Networks]: Distributed
                 Systems -- distributed databases",
  subject =      "archives; checksum; distributed administration;
                 electronic distribution; ftp",
}

@Article{Demetriou:1995:ALF,
  author =       "I. C. Demetriou",
  title =        "Algorithm 742: {L2CXFT}: {A Fortran} Subroutine for
                 Least Squares Data Fitting with Nonnegative Second
                 Divided Differences",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "98--110",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:22 1995",
  acknowledgement = ack-rfb,
  keywords =     "B-splines; convex approximation; data fitting; divided
                 difference",
  subject =      "G.1.2 [Numerical Analysis]: Approximation -- least
                 squares approximation; G.1.6 [Numerical Analysis]:
                 Optimization -- quadratic programming",
}

@Article{Weber:1995:AIG,
  author =       "Ken Weber",
  title =        "The Accelerated Integer {GCD} Algorithm",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "111--122",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:23 1995",
  acknowledgement = ack-rfb,
  keywords =     "GCD; integer greatest common divisor; number-theoretic
                 computations",
  subject =      "F.2.1 [Analysis of Algorithms and Problem Complexity]:
                 Numerical Algorithms and Problems",
}

@Article{Bongartz:1995:CCU,
  author =       "I. Bongartz and A. R. Conn and Nick Gould and Ph.L.
                 Toint",
  title =        "{CUTE}: Constrained and Unconstrained Testing
                 Environment",
  journal =      j-TOMS,
  volume =       "21",
  number =       "1",
  pages =        "123--160",
  month =        mar,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Mar 14 16:17:24 1995",
  acknowledgement = ack-rfb,
  subject =      "D.2.2 [Software Engineering]: Tools and Techniques --
                 modules and interfaces; G.1.6 [ Numerical Analysis]:
                 Optimization -- constrained",
}

@Article{Barry:1995:RVW,
  author =       "D. A. Barry and P. J. Culligan-Hensley and S. J.
                 Barry",
  title =        "Real Values of the {W}-Function",
  journal =      j-TOMS,
  volume =       "21",
  number =       "2",
  pages =        "161--171",
  month =        jun,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Oct 10 15:50:28 1995",
  acknowledgement = ack-rfb,
  keywords =     "W-function",
  subject =      "G.1.2 [Numerical Analysis]: Approximation -- nonlinear
                 approximation; G.1.5 [Numerical Analysis]: Roots of
                 Nonlinear Equations-iterative methods",
}

@Article{Barry:1995:AWF,
  author =       "D. A. Barry and S. J. Barry and P. J.
                 Culligan-Hensley",
  title =        "Algorithm 743: {WAPR}: {A Fortran} Routine for
                 Calculating Real Values of the {W}-Function",
  journal =      j-TOMS,
  volume =       "21",
  number =       "2",
  pages =        "172--181",
  month =        jun,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Oct 10 15:50:30 1995",
  acknowledgement = ack-rfb,
  keywords =     "W-function",
  subject =      "G.1.2 [Numerical Analysis]: Approximation -- nonlinear
                 approximation; G.1.5 [Numerical Analysis]: Roots of
                 Nonlinear Equations -- iterative methods",
}

@Article{Hormann:1995:RTS,
  author =       "Wolfgang Hormann",
  title =        "A Rejection Technique for Sampling from {T}-Concave
                 Distributions",
  journal =      j-TOMS,
  volume =       "21",
  number =       "2",
  pages =        "182--193",
  month =        jun,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Oct 10 15:50:31 1995",
  acknowledgement = ack-rfb,
  keywords =     "Log-concave distributions; rejection method; universal
                 method",
  subject =      "G.3 [Probability and Statistics]: Random Number
                 Generation",
}

@Article{Rabinowitz:1995:ASA,
  author =       "F. Michael Rabinowitz",
  title =        "Algorithm 744: {A} Stochastic Algorithm for Global
                 Optimization with Constraints",
  journal =      j-TOMS,
  volume =       "21",
  number =       "2",
  pages =        "194--213",
  month =        jun,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Oct 10 15:50:33 1995",
  acknowledgement = ack-rfb,
  keywords =     "Constrained optimization; global optimization;
                 stochastic optimization; test functions",
  subject =      "G.1.6 [Numerical Analysis]: Optimization -- nonlinear
                 programming; G.3 [Mathematics of Computing]:
                 Probability and Statistics -- probabilistic algorithms
                 (including Monte Carlo); G.4 [Mathematics of
                 Computing]: Mathematical Software -- certification and
                 testing",
}

@Article{Goano:1995:ACC,
  author =       "Michele Goano",
  title =        "Algorithm 745: Computation of the Complete and
                 Incomplete Fermi-Dirac Integral",
  journal =      j-TOMS,
  volume =       "21",
  number =       "3",
  pages =        "221--232",
  month =        sep,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  acknowledgement = ack-rfb,
  keywords =     "asymptotic expansions; confluent hypergeometric
                 functions; convergence acceleration; e[k] transforms;
                 epsilon algorithm; Euler transformation; Fermi-Dirac
                 integral; incomplete Fermi-Dirac integral; incomplete
                 gamma function; Levin's u transform; Riemann's zeta
                 function",
  subject =      "G.1.2 [Mathematics of Computing]: Approximation; G.4
                 [Mathematics of Computing]: Mathematical Software; J.2
                 [Computer Applications]: Physical Sciences and
                 Engineering",
}

@Article{Dobmann:1995:APF,
  author =       "M. Dobmann and M. Liepelt and K. Schittkowski",
  title =        "Algorithm 746: {PCOMP}: {A Fortran} Code for Automatic
                 Differentiation",
  journal =      j-TOMS,
  volume =       "21",
  number =       "3",
  pages =        "233--266",
  month =        sep,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  acknowledgement = ack-rfb,
  keywords =     "automatic differentiation; forward accumulation;
                 reverse accumulation",
  subject =      "D.1.2 [Programming Techniques]: Automatic Programming;
                 D.3.4 [Programming Languages]: Processors - code
                 generation; G.1.4 [Numerical Analysis]: Quadrature and
                 Numerical Differentiation; G.4 [Mathematics of
                 Computing]: Mathematical Software",
}

@Article{Sullivan:1995:NAU,
  author =       "Stephen J. Sullivan and Benjamin G. Zorn",
  title =        "Numerical Analysis Using Nonprocedural Paradigms",
  journal =      j-TOMS,
  volume =       "21",
  number =       "3",
  pages =        "267--298",
  month =        sep,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  acknowledgement = ack-rfb,
  keywords =     "benchmarks; experimental languages; Gaussian
                 elimination; linear algebra; programming languages;
                 sparse matrices",
  subject =      "G.1 [Mathematics of Computing]: Numerical Analysis",
}

@Article{Miminis:1995:AFS,
  author =       "George Miminis and Helmut Roth",
  title =        "Algorithm 747: {A Fortran} Subroutine to Solve the
                 Eigenvalue Assignment Problem for Multiinput Systems
                 Using State Feedback",
  journal =      j-TOMS,
  volume =       "21",
  number =       "3",
  pages =        "299--326",
  month =        sep,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  acknowledgement = ack-rfb,
  keywords =     "deflation; double steps; eigenvalue assignment;
                 numerical efficiency; pole assignment",
  subject =      "F.2.1 [Analysis of Algorithms and Problem Complexity]:
                 Numerical Algorithms and Problems - computations on
                 matrices; G.1.0 [Numerical Analysis]: General -
                 numerical algorithms; G.1.3 [Numerical Analysis]:
                 Numerical Linear Algebra - eigenvalues; J.2 [Computer
                 Applications]: Physical Sciences and Engineering -
                 aerospace; engineering; J.4 [Computer Applications]:
                 Social and Behavioral Sciences - economics",
}

@Article{Alefeld:1995:AEZ,
  author =       "G. E. Alefeld and F. A. Potra and Yixun Shi",
  title =        "Algorithm 748: Enclosing Zeros of Continuous
                 Functions",
  journal =      j-TOMS,
  volume =       "21",
  number =       "3",
  pages =        "327--344",
  month =        sep,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Thu Sep 28 16:39:05 1995",
  keywords =     "algorithms; asymptotic efficiency index; enclosing
                 method; inverse cubic interpolation; quadratic
                 interpolation; simple root; theory",
  subject =      "G.1.0 [Numerical Analysis]: General -- numerical
                 algorithms; G.1.5 [Numerical Analysis]: Roots of
                 Nonlinear Equations -- convergence; iterative methods",
}

@Article{Rizzardi:1995:MTM,
  author =       "Mariarosaria Rizzardi",
  title =        "A Modification of Talbert's Method for the
                 Simultaneous Approximation of Several Values of the
                 Inverse {Laplace} Transform",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "347--371",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 10 08:48:51 1996",
  acknowledgement = ack-rfb,
  keywords =     "complex inversion formula; inverse Laplace transform;
                 numerical method; Talbot; trapezoidal rule",
  subject =      "G.1.0 [Numerical Analysis]: General -- error analysis;
                 numerical algorithms; G.1.2 [Numerical Analysis]:
                 Approximation -- nonlinear approximation; G.1.4
                 [Numerical Analysis]: Quadrature and Numerical
                 Differentiation -- equal interval integration; error
                 analysis; G.1.9 [Numerical Analysis]: Integral
                 Equations -- Fredholm equations",
}

@Article{Sherlock:1995:AFD,
  author =       "Barry G. Sherlock and Donald M. Monro",
  title =        "Algorithm 749: Fast Discrete Cosine Transform",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "372--378",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 14 09:58:14 1995",
  acknowledgement = ack-rfb,
  keywords =     "data compression; discrete cosine transform; fast
                 transform",
  subject =      "D.3.2 [Programming Languages]: Language
                 Classifications -- Fortran; E.4 [Data]: Coding and
                 Information Theory -- data compaction and compression;
                 F.2.1 [Analysis of Algorithms and Problem Complexity]:
                 Numerical Algorithms and Problems; G.4 [Mathematics of
                 Computing]: Mathematical Software; I.4.2 [Image
                 Processing]: Compression",
}

@Article{Bailey:1995:FBM,
  author =       "David H. Bailey",
  title =        "A {Fortran-90} Based Multiprecision System",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "379--387",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 10 08:48:42 1996",
  acknowledgement = ack-rfb,
  keywords =     "arithmetic; Fortran 90; multiprecision",
  subject =      "D.3.2 [Programming Languages]: Language
                 Classifications -- Fortran 90; D.3.4 [Programming
                 Languages]: Processors; G.1.0 [Numerical Analysis]:
                 General; G.1.2 [Numerical Analysis]: Approximation",
}

@Article{Amos:1995:RAP,
  author =       "D. E. Amos",
  title =        "A Remark on Algorithm 644: {A} Portable Package for
                 {Bessel} Functions of a Complex Argument and
                 Nonnegative Order",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "388--393",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Sat Feb 10 08:45:52 1996",
  acknowledgement = ack-rfb,
  keywords =     "and Y Bessel functions; complex Airy Functions;
                 complex Bessel functions; derivatives of Airy
                 functions; H; I; J; K; log gamma function",
  subject =      "G.1.0 [Numerical Analysis]: General -- numerical
                 algorithms; G.1.m [Numerical Analysis]: Miscellaneous;
                 G.m [Mathematics of Computing]: Miscellaneous",
}

@Article{Carpaneto:1995:ESL,
  author =       "M. Dell'Amico G. Carpaneto and P. Toth",
  title =        "Exact Solution of Large Scale Asymmetric Travelling
                 Salesman Problems",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "394--409",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 14 09:58:01 1995",
  acknowledgement = ack-rfb,
  keywords =     "assignment problem; asymmetric traveling salesman
                 problem; branch and bound; reduction procedure; subtour
                 elimination",
  subject =      "G.2.1 [Discrete Mathematics]: Combinatorics --
                 combinatorial algorithms; G.2.2 [Discrete Mathematics]:
                 Graph Theory -- graph algorithms; path and circuit
                 problems",
}

@Article{Carpaneto:1995:ACS,
  author =       "M. Dell'Amico G. Carpaneto and P. Toth",
  title =        "Algorithm 750: {CDT}: {A} Subroutine for the Exact
                 Solution of Large-Scale Asymmetric Travelling Salesman
                 Problems",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "410--415",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 14 09:57:58 1995",
  acknowledgement = ack-rfb,
  keywords =     "assignment problem; asymmetric traveling salesman
                 problem; branch and bound; reduction procedure; subtour
                 elimination",
  subject =      "D.3.2 [Programming Languages]: Language
                 classifications -- Fortran; G.2.1 [Discrete
                 Mathematics]: Combinatorics -- combinatorial
                 algorithms; G.2.2 [Discrete Mathematics]: Graph Theory
                 -- graph algorithms; path and circuit problems",
}

@Article{Doman:1995:SAP,
  author =       "B. G. S. Doman and C. J. Pursglove and W. M. Coen",
  title =        "A Set of {Ada} Packages for High Precision
                 Calculations",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "416--431",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 14 09:57:55 1995",
  acknowledgement = ack-rfb,
  keywords =     "accuracy; Ada; arithmetic elementary-function
                 evaluation; floating-point; multiple-precision portable
                 software",
  subject =      "G.1.0 [Numerical Analysis]: General -- computer
                 arithmetic; G.1.2 [Numerical Analysis]: Approximation
                 -- elementary function approximation; G.4 [Mathematics
                 of Computing]: Mathematical Software -- algorithm
                 analysis; efficiency; portability",
}

@Article{Scott:1995:ACC,
  author =       "J. A. Scott",
  title =        "An Arnoldi Code for Computing Selected Eigenvalues of
                 Sparse Real Unsymmetric Matrices",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "432--475",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 14 09:57:52 1995",
  acknowledgement = ack-rfb,
  keyword =      "Arnoldi's method; Chebychev acceleration; large sparse
                 matrices; real unsymmetric matrices",
  subject =      "G.1.0 [Numerical Analysis]: General -- numerical
                 algorithms; G.1.3 [Numerical Analysis]: Numerical
                 Linear Algebra -- eigenvalues",
}

@Article{Kaufman:1995:CMD,
  author =       "Linda Kaufman",
  title =        "Computing the ${MDM}^{T}$ decomposition",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "476--489",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 14 09:57:49 1995",
  acknowledgement = ack-rfb,
  keywords =     "block factorizations; LAPACK; linear systems (direct
                 methods); symmetric indefinite",
  subject =      "G.1.3 [Numerical Analysis]: Numerical Linear Algebra
                 -- linear systems (direct and iterative methods); G.4
                 [Mathematics of Computing]: Mathematical Software --
                 efficiency",
}

@Article{Duff:1995:CCS,
  author =       "Iain S. Duff and Jennifer A. Scott",
  title =        "Corrigendum: Computing Selected Eigenvalues of Sparse
                 Unsymmetric Matrices Using Subspace Iteration",
  journal =      j-TOMS,
  volume =       "21",
  number =       "4",
  pages =        "490--490",
  month =        dec,
  year =         "1995",
  CODEN =        "ACMSCU",
  ISSN =         "0098-3500",
  bibdate =      "Tue Nov 14 09:57:46 1995",
  note =         "See \cite{Duff:1993:CSE}.",
  acknowledgement = ack-rfb,
}

@Article{Renka:1996:ATC,
  author =       "R. J. Renka",
  title =        "Algorithm 751: {TRIPACK}: a constrained
                 two-dimensional {Delaunay} triangulation package",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "1--8",
  month =        mar,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/225546.html",
  abstract =     "TRIPACK is a Fortran 77 software package that employs
                 an incremental algorithm to construct a constrained
                 Delaunay triangulation of a set of points in the plane
                 (nodes). The triangulation covers the convex hull of
                 the nodes but may include polygonal constraint regions
                 whose triangles are distinguishable from those in the
                 remainder of the triangulation. This effectively allows
                 for a nonconvex or multiply connected triangulation
                 (the complement of the union of constraint regions)
                 while retaining the efficiency of searching and
                 updating a convex triangulation. The package provides a
                 wide range of capabilities including an efficient means
                 of updating the triangulation with nodal additions or
                 deletions. For $N$ nodes, the storage requirement is
                 $13N$ integer storage locations in addition to the $2N$
                 nodal coordinates.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE.
                 {\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation.",
}

@Article{Renka:1996:ASS,
  author =       "R. J. Renka",
  title =        "Algorithm 752: {SRFPACK}: software for scattered data
                 fitting with a constrained surface under tension",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "9--17",
  month =        mar,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/225547.html",
  abstract =     "SRFPACK is a Fortran 77 software package that
                 constructs a smooth interpolatory or approximating
                 surface to data values associated with arbitrarily
                 distributed points in the plane. It employs
                 automatically selected tension factors to preserve
                 shape properties of the data and to avoid overshoot and
                 undershoot associated with steep gradients. The domain
                 of the fitting function may be nonconvex or multiply
                 connected, and the surface may be constrained to have
                 discontinuous value or derivative across a
                 user-specified curve representing, for example, a
                 geological fault line. Although triangle based, the
                 method provides a means of avoiding the inaccuracy
                 associated with long thin triangles on the boundary of
                 the convex hull of the data abscissae.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE.
                 {\bf G.1.1}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Interpolation.",
}

@Article{Buis:1996:EVP,
  author =       "Paul E. Buis and Wayne R. Dyksen",
  title =        "Efficient vector and parallel manipulation of tensor
                 products",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "18--23",
  month =        mar,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/225548.html",
  abstract =     "We present efficient vector and parallel methods for
                 manipulating tensor products of matrices. We consider
                 both computing the matrix-vector product $(A_{1}
                 \otimes \cdots \otimes A_{K})x$ and solving the system
                 of linear equations $(A_{1} \otimes \cdots \otimes
                 A_{K})x=b$. The methods described are independent of
                 $K$. We accompany this article with a companion
                 algorithm which describes an implementation of a
                 complete set of tensor product routines based on LAPACK
                 and the Level 2 and 3 Basic Linear Algebra Subprograms
                 (BLAS) which provide vectorization and
                 parallelization.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra. {\bf D.1.3}:
                 Software, PROGRAMMING TECHNIQUES, Concurrent
                 Programming. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Buis:1996:ATL,
  author =       "Paul E. Buis and Wayne R. Dyksen",
  title =        "Algorithm 753: {TENPACK}: {A} {LAPACK-based} library
                 for the computer manipulation of tensor products",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "24--29",
  month =        mar,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/225549.html",
  abstract =     "This article presents the interface of an
                 implementation of methods to manipulate equations of
                 this form $A_{1} \otimes \cdots \otimes A_{m}$ where
                 the $A_{i}$ are matrices. The methods described are
                 independent of m. The code is based on LAPACK and the
                 BLAS and supports virtually all of the matrix formats
                 supported by those packages. Timings of the
                 implementation on several machines are also given.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf D.1.3}: Software, PROGRAMMING TECHNIQUES,
                 Concurrent Programming. {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 FORTRAN. {\bf G.1.3}: Mathematics of Computing,
                 NUMERICAL ANALYSIS, Numerical Linear Algebra. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Duff:1996:DNF,
  author =       "I. S. Duff and J. A. Scott",
  title =        "The design of a new frontal code for solving sparse,
                 unsymmetric systems",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "30--45",
  month =        mar,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/225550.html",
  abstract =     "We describe the design, implementation, and
                 performance of a frontal code for the solution of
                 large, sparse, unsymmetric systems of linear equations.
                 The resulting software package, MA42, is included in
                 Release 11 of the Harwell Subroutine Library and is
                 intended to supersede the earlier MA32 package. We
                 discuss in detail the extensive use of higher-level
                 BLAS kernels within MA42 and illustrate the performance
                 on a range of practical problems on a CRAY Y-MP, an IBM
                 3090, and an IBM RISC System/6000. We examine extending
                 the frontal solution scheme to use multiple fronts to
                 allow MA42 to be run in parallel. We indicate some
                 directions for future development.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Numerical algorithms. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE.",
}

@Article{Freund:1996:QPQ,
  author =       "Roland W. Freund and No{\"e}l M. Nachtigal",
  title =        "{QMRPACK}: a package of {QMR} algorithms",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "46--77",
  month =        mar,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/225551.html",
  abstract =     "The quasi-minimal residual (QMR) algorithm is a
                 Krylov-subspace method for the iterative solution of
                 large non-Hermitian linear systems. QMR is based on the
                 look-ahead Lanczos algorithm that, by itself, can also
                 be used to obtain approximate eigenvalues of large
                 non-Hermitian matrices. QMRPACK is a software package
                 with Fortran 77 implementations of the QMR algorithm
                 and variants thereof, and of the three-term and coupled
                 two-term look-ahead Lanczos algorithms. In this
                 article, we discuss some of the features of the
                 algorithms in the package, with emphasis on the issues
                 related to using the codes. We describe in some detail
                 two routines from the package, one for the solution of
                 linear systems and the other for the computation of
                 eigenvalue approximations. We present some numerical
                 examples from applications where QMRPACK was used.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; reliability; theory",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf D.3.2}: Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 FORTRAN. {\bf F.2.1}: Theory of Computation, ANALYSIS
                 OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical
                 Algorithms and Problems, Computations on matrices. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL SOFTWARE,
                 Reliability and robustness. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Eigenvalues. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Efficiency.",
}

@Article{Kaagstrom:1996:LAS,
  author =       "Bo K{\aa}gstr{\"o}m and Peter Poromaa",
  title =        "{LAPACK-style} algorithms and software for solving the
                 generalized {Sylvester} equation and estimating the
                 separation between regular matrix pairs",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "78--103",
  month =        mar,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/225552.html",
  abstract =     "Robust and fast software to solve the generalized
                 Sylvester equation ($AR - LB = C, DR - LE = F$) for
                 unknowns $R$ and $L$ is presented. This special linear
                 system of equations, and its transpose, arises in
                 computing error bounds for computed eigenvalues and
                 eigenspaces of the generalized eigenvalue problem
                 $S-\lambda T$, in computing deflating subspaces of the
                 same problem, and in computing certain decompositions
                 of transfer matrices arising in control theory. Our
                 contributions are twofold. First, we reorganize the
                 standard algorithm for this problem to use Level 3 BLAS
                 operations, like matrix multiplication, in its inner
                 loop. This speeds up the algorithm by a factor of 9 on
                 an IBM RS6000. Second, we develop and compare several
                 condition estimation algorithms, which inexpensively
                 but accurately estimate the sensitivity of the solution
                 of this linear system.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Algorithm analysis. {\bf F.2.1}: Theory of
                 Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
                 COMPLEXITY, Numerical Algorithms and Problems,
                 Computations on matrices. {\bf G.1.3}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Linear systems (direct and iterative methods).
                 {\bf G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE, Reliability and robustness. {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Conditioning. {\bf G.1.3}: Mathematics
                 of Computing, NUMERICAL ANALYSIS, Numerical Linear
                 Algebra, Eigenvalues. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Efficiency. {\bf
                 F.2.1}: Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Numerical Algorithms and
                 Problems, Computations on matrices. {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Matrix inversion.",
}

@Article{Resende:1996:AFS,
  author =       "Mauricio G. C. Resende and Panos M. Pardalos and Yong
                 Li",
  title =        "Algorithm 754: {Fortran} subroutines for approximate
                 solution of dense quadratic assignment problems using
                 {GRASP}",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "104--118",
  month =        mar,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/225553.html",
  abstract =     "In the NP-complete quadratic assignment problem (QAP),
                 $n$ facilities are to be assigned to $n$ sites at
                 minimum cost. The contribution of assigning facility
                 $i$ to site $k$ and facility $j$ to site $l$ to the
                 total cost is $f_{ij} - d_{kl}$, where $f_{ij}$ is the
                 flow between facilities $i$ and $j$, and $d_{kl}$ is
                 the distance between sites $k$ and $l$. Only very small
                 ($n\le20$) instances of the QAP have been solved
                 exactly, and heuristics are therefore used to produce
                 approximate solutions. This article describes a set of
                 Fortran subroutines to find approximate solutions to
                 dense quadratic assignment problems, having at least
                 one symmetric flow or distance matrix. A greedy,
                 randomized, adaptive search procedure (GRASP) is used
                 to produce the solutions. The design and implementation
                 of the code are described in detail, and extensive
                 computational experiments are reported, illustrating
                 solution quality as a function of running time.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Optimization, Integer programming. {\bf
                 D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.2.1}: Mathematics of
                 Computing, DISCRETE MATHEMATICS, Combinatorics,
                 Combinatorial algorithms.",
}

@Article{Wallace:1996:FPG,
  author =       "C. S. Wallace",
  title =        "Fast pseudorandom generators for normal and
                 exponential variates",
  journal =      j-TOMS,
  volume =       "22",
  number =       "1",
  pages =        "119--127",
  month =        mar,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/225554.html",
  abstract =     "Fast algorithms for generating pseudorandom numbers
                 from the unit-normal and unit-exponential distributions
                 are described. The methods are unusual in that they do
                 not rely on a source of uniform random numbers, but
                 generate the target distributions directly by using
                 their maximal-entropy properties. The algorithms are
                 fast. The normal generator is faster than the commonly
                 used Unix library uniform generator ``random'' when the
                 latter is used to yield real values. Their statistical
                 properties seem satisfactory, but only a limited suite
                 of tests has been conducted. They are written in C and
                 as written assume 32-bit integer arithmetic. The code
                 is publicly available as C source and can easily be
                 adopted for longer word lengths and/or vector
                 processing.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design; performance",
  subject =      "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
                 STATISTICS, Random number generation. {\bf G.3}:
                 Mathematics of Computing, PROBABILITY AND STATISTICS,
                 Statistical computing.",
}

@Article{Griewank:1996:AAP,
  author =       "Andreas Griewank and David Juedes and Jean Utke",
  title =        "Algorithm 755: {ADOL-C}: a package for the automatic
                 differentiation of algorithms written in {C\slash
                 C++}",
  journal =      j-TOMS,
  volume =       "22",
  number =       "2",
  pages =        "131--167",
  month =        jun,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/229474.html",
  abstract =     "The C++ package ADOL-C described here facilitates the
                 evaluation of first and higher derivatives of vector
                 functions that are defined by computer programs written
                 in C or C++. The resulting derivative evaluation
                 routines may be called from C/C++, Fortran, or any
                 other language that can be linked with C. The numerical
                 values of derivative vectors are obtained free of
                 truncation errors at a small multiple of the run-time
                 and randomly accessed memory of the given function
                 evaluation program. Derivative matrices are obtained by
                 columns or rows. For solution curves defined by
                 ordinary differential equations, special routines are
                 provided that evaluate the Taylor coefficient vectors
                 and their Jacobians with respect to the current state
                 vector. The derivative calculations involve a possibly
                 substantial (but always predictable) amount of data
                 that are accessed strictly sequentially and are
                 therefore automatically paged out to external files.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.4}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Quadrature and Numerical Differentiation.
                 {\bf I.1.2}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Algorithms, Analysis of algorithms. {\bf
                 I.1.2}: Computing Methodologies, ALGEBRAIC
                 MANIPULATION, Algorithms.",
}

@Article{Driscoll:1996:AMT,
  author =       "Tobin A. Driscoll",
  title =        "Algorithm 756: a {MATLAB} Toolbox for
                 {Schwarz-Christoffel} mapping",
  journal =      j-TOMS,
  volume =       "22",
  number =       "2",
  pages =        "168--186",
  month =        jun,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/229475.html",
  abstract =     "The Schwarz-Christoffel transformation and its
                 variations yield formulas for conformal maps from
                 standard regions to the interiors or exteriors of
                 possibly unbounded polygons. Computations involving
                 these maps generally require a computer, and although
                 the numerical aspects of these transformations have
                 been studied, there are few software implementations
                 that are widely available and suited for general use.
                 The Schwarz-Christoffel Toolbox for MATLAB is a new
                 implementation of Schwarz-Christoffel formulas for maps
                 from the disk, half-plane, strip, and rectangle domains
                 to polygon interiors, and from the disk to polygon
                 exteriors. The toolbox, written entirely in the MATLAB
                 script language, exploits the high-level functions,
                 interactive environment, visualization tools, and
                 graphical user interface elements supplied by current
                 versions of MATLAB, and is suitable for use both as a
                 standalone tool and as a library for applications
                 written in MATLAB, Fortran, or C. Several examples and
                 simple applications are presented to demonstrate the
                 toolbox's capabilities.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.m}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Miscellaneous. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, MATLAB. {\bf J.2}:
                 Computer Applications, PHYSICAL SCIENCES AND
                 ENGINEERING.",
}

@Article{Duff:1996:DMC,
  author =       "I. S. Duff and J. K. Reid",
  title =        "The design of {MA48}: a code for the direct solution
                 of sparse unsymmetric linear systems of equations",
  journal =      j-TOMS,
  volume =       "22",
  number =       "2",
  pages =        "187--226",
  month =        jun,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/229476.html",
  abstract =     "We describe the design of a new code for the direct
                 solution of sparse unsymmetric linear systems of
                 equations. The new code utilizes a novel restructuring
                 of the symbolic and numerical phases, which increases
                 speed and saves storage without sacrifice of numerical
                 stability. Other features include switching to
                 full-matrix processing in all phases of the computation
                 enabling the use of all three levels of BLAS, treatment
                 of rectangular or rank-deficient matrices, partial
                 factorization, and integrated facilities for iterative
                 refinement and error estimation.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Sparse and very large systems.",
}

@Article{Duff:1996:EZD,
  author =       "I. S. Duff and J. K. Reid",
  title =        "Exploiting zeros on the diagonal in the direct
                 solution of indefinite sparse symmetric linear
                 systems",
  journal =      j-TOMS,
  volume =       "22",
  number =       "2",
  pages =        "227--257",
  month =        jun,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/229480.html",
  abstract =     "We describe the design of a new code for the solution
                 of sparse indefinite symmetric linear systems of
                 equations. The principal difference between this new
                 code and earlier work lies in the exploitation of the
                 additional sparsity available when the matrix has a
                 significant number of zero diagonal entries. Other new
                 features have been included to enhance the execution
                 speed, particularly on vector and parallel machines.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; performance",
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.1.3}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical
                 Linear Algebra, Sparse and very large systems.",
}

@Article{Hull:1996:MBP,
  author =       "T. E. Hull and R. Mathon",
  title =        "The mathematical basis and a prototype implementation
                 of a new polynomial rootfinder with quadratic
                 convergence",
  journal =      j-TOMS,
  volume =       "22",
  number =       "3",
  pages =        "261--280",
  month =        sep,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/232830.html",
  abstract =     "Formulas developed originally by Weierstrass have been
                 used since the 1960s by many others for the
                 simultaneous determination of all the roots of a
                 polynomial. Convergence to simple roots is quadratic,
                 but individual approximations to a multiple root
                 converge only linearly. However, it is shown here that
                 the mean of such individual approximations converges
                 quadratically to that root. This result, along with
                 some detail about the behavior of such approximations
                 in the neighborhood of the multiple root, suggests a
                 new approach to the design of polynomial rootfinders.
                 It should also be noted that the technique is well
                 suited to take advantage of a parallel environment.
                 This article first provides the relevant mathematical
                 results: a short derivation of the formulas,
                 convergence proofs, an indication of the behavior near
                 a multiple root, and some error bounds. It then
                 provides the outline of an algorithm based on these
                 results, along with some graphical and numerical
                 results to illustrate the major theoretical points.
                 Finally, a new program based on this algorithm, but
                 with a more efficient way of choosing starting values,
                 is described and then compared with corresponding
                 programs from IMSL and NAG with good results. This
                 program is available from Mathon
                 (\path=combin@cs.utoronto.ca=).",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms; design",
  subject =      "{\bf G.1.0}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, General, Error analysis. {\bf G.1.0}:
                 Mathematics of Computing, NUMERICAL ANALYSIS, General,
                 Numerical algorithms. {\bf G.1.5}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Roots of Nonlinear
                 Equations, Convergence. {\bf G.1.5}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Roots of Nonlinear
                 Equations, Error analysis. {\bf G.1.5}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Roots of Nonlinear
                 Equations, Iterative methods. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Algorithm analysis.",
}

@Article{Sosonkina:1996:NEG,
  author =       "Maria Sosonkina and Layne T. Watson and David E.
                 Stewart",
  title =        "Note on the end game in homotopy zero curve tracking",
  journal =      j-TOMS,
  volume =       "22",
  number =       "3",
  pages =        "281--287",
  month =        sep,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/232843.html",
  abstract =     "Homotopy algorithms to solve a nonlinear system of
                 equations $f(x) = 0$ involve tracking the zero curve of
                 a homotopy map $p(a, \lambda, x)$ from $\lambda = 0$
                 until $\lambda = 1$. When the algorithm nears or
                 crosses the hyperplane $\lambda = 1$, an ``end game''
                 phase is begun to compute the solution *** satisfying
                 $p(a, \lambda, ***) = f(**) = 0$. This note compares
                 several end game strategies, including the one
                 implemented in the normal flow code FIXPNF in the
                 homotopy software package HOMPACK.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf G.1.5}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Roots of Nonlinear Equations, Systems of
                 equations. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Macleod:1996:AMS,
  author =       "Allan J. Macleod",
  title =        "Algorithm 757: {MISCFUN}, a software package to
                 compute uncommon special functions",
  journal =      j-TOMS,
  volume =       "22",
  number =       "3",
  pages =        "288--301",
  month =        sep,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/232846.html",
  abstract =     "MISCFUN (MISCellaneous FUNctions) is a Fortran package
                 for the evaluation of several special functions, which
                 are not used often enough to have been included in the
                 standard libraries or packages. The package uses
                 Chebyshev expansions as the underlying method of
                 approximation, with the Chebyshev coefficients given to
                 20D. A wide variety of functions are included, and the
                 package is designed so that other functions can be
                 added in a standard manner.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation, Chebyshev
                 approximation and theory. {\bf G.4}: Mathematics of
                 Computing, MATHEMATICAL SOFTWARE, Certification and
                 testing.",
}

@Article{Blom:1996:AVVa,
  author =       "J. G. Blom and R. A. Trompert and J. G. Verwer",
  title =        "Algorithm 758: {VLUGR2}: a vectorizable adaptive-grid
                 solver for {PDEs} in {2D}",
  journal =      j-TOMS,
  volume =       "22",
  number =       "3",
  pages =        "302--328",
  month =        sep,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/232850.html",
  abstract =     "This article deals with an adaptive-grid
                 finite-difference solver for time-dependent
                 two-dimensional systems of partial differential
                 equations. It describes the ANSI Fortran 77 code,
                 VLUGR2, autovectorizable on the Cray Y-MP, that is
                 based on this method. The robustness and the efficiency
                 of the solver, both for vector and scalar processors,
                 are illustrated by the application of the code to two
                 example problems arising from a groundwater-flow
                 model.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.1.8}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Partial Differential
                 Equations. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Blom:1996:AVVb,
  author =       "J. G. Blom and J. G. Verwer",
  title =        "Algorithm 759: {VLUGR3}: a vectorizable adaptive-grid
                 solver for {PDEs} in {3D} --- Part {II}. code
                 description",
  journal =      j-TOMS,
  volume =       "22",
  number =       "3",
  pages =        "329--347",
  month =        sep,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/232853.html",
  abstract =     "This article describes an ANSI Fortran 77 code,
                 VLUGR3, autovectorizable on the Cray Y-MP, that is
                 based on an adaptive-grid finite-difference method to
                 solve time-dependent three-dimensional systems of
                 partial differential equations.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.1.8}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Partial Differential
                 Equations. {\bf G.4}: Mathematics of Computing,
                 MATHEMATICAL SOFTWARE.",
}

@Article{Andersen:1996:MSM,
  author =       "Knud D. Andersen",
  title =        "A modified {Schur-complement} method for handling
                 dense columns in interior-point methods for linear
                 programming",
  journal =      j-TOMS,
  volume =       "22",
  number =       "3",
  pages =        "348--356",
  month =        sep,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/232937.html",
  abstract =     "The main computational work in interior-point methods
                 for linear programming (LP) is to solve a least-squares
                 problem. The normal equations are often used, but if
                 the LP constraint matrix contains a nearly dense column
                 the normal-equations matrix will be nearly dense.
                 Assuming that the nondense part of the constraint
                 matrix is of full rank, the Schur complement can be
                 used to handle dense columns. In this article we
                 propose a modified Schur-complement method that relaxes
                 this assumption. Encouraging numerical results are
                 presented.",
  acknowledgement = ack-nhfb,
  subject =      "{\bf G.1.3}: Mathematics of Computing, NUMERICAL
                 ANALYSIS, Numerical Linear Algebra, Linear systems
                 (direct and iterative methods). {\bf G.1.6}:
                 Mathematics of Computing, NUMERICAL ANALYSIS,
                 Optimization, Linear programming.",
}

@Article{Akima:1996:ARS,
  author =       "Hiroshi Akima",
  title =        "Algorithm 760: rectangular-grid-data surface fitting
                 that has the accuracy of a bicubic polynomial",
  journal =      j-TOMS,
  volume =       "22",
  number =       "3",
  pages =        "357--361",
  month =        sep,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/232854.html",
  abstract =     "A local algorithm for smooth surface fitting for
                 rectangular-grid data has been presented. It has the
                 accuracy of a bicubic polynomial.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.1.1}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Interpolation. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Akima:1996:ASS,
  author =       "Hiroshi Akima",
  title =        "Algorithm 761: scattered-data surface fitting that has
                 the accuracy of a cubic polynomial",
  journal =      j-TOMS,
  volume =       "22",
  number =       "3",
  pages =        "362--371",
  month =        sep,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/232856.html",
  abstract =     "An algorithm for smooth surface fitting for scattered
                 data has been presented. It has the accuracy of a cubic
                 polynomial in most cases and is a local, triangle-based
                 algorithm.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.1.1}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Interpolation. {\bf
                 G.4}: Mathematics of Computing, MATHEMATICAL
                 SOFTWARE.",
}

@Article{Brown:1996:ALL,
  author =       "Barry W. Brown and Lawrence B. Levy and James Lovato
                 and Kathy Russell and Floyd M. Spears",
  title =        "Algorithm 762: {LLDRLF}, log-likelihood and some
                 derivatives for {log-F} models",
  journal =      j-TOMS,
  volume =       "22",
  number =       "3",
  pages =        "372--762",
  month =        sep,
  year =         "1996",
  bibdate =      "Sat Aug 31 16:07:02 MDT 1996",
  bibsource =    "http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0098-3500/232858.html",
  abstract =     "The flexible statistical models incorporating the
                 log-F distribution are little used because of numeric
                 difficulties. We describe a method for calculating the
                 log-likelihood and two derivatives with respect to the
                 data argument. Fortran subroutines incorporating these
                 calculations are provided.",
  acknowledgement = ack-nhfb,
  keywords =     "algorithms",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, FORTRAN. {\bf G.1.2}: Mathematics of
                 Computing, NUMERICAL ANALYSIS, Approximation.",
}

%=======================================================================
% Bibliography entries from TOPLAS.

@Article{Hanson:1981:APE,
  author =       "D. R. Hanson",
  title =        "Algorithm 568: {PDS}\emdash {A} Portable Directory
                 System",
  journal =      j-TOPLAS,
  volume =       "7",
  number =       "2",
  pages =        "162--167",
  month =        apr,
  year =         "1981",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925",
  bibdate =      "Fri Sep 9 14:11:06 1994",
  acknowledgement = ack-nhfb,
}