Valid HTML 4.0! Valid CSS!
%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "0.30",
%%%     date            = "02 November 2023",
%%%     time            = "07:58:11 MDT",
%%%     filename        = "moore-ramon-e.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "https://www.math.utah.edu/~beebe",
%%%     checksum        = "19671 2204 9769 98382",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "BibNet Project; BibTeX; bibliography; interval
%%%                        analysis; interval arithmetic; reliable
%%%                        computing",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a bibliography of publications of
%%%                        Ramon (Ray) E. Moore (27 December 1929--1
%%%                        April 2015).
%%%
%%%                        At version 0.30, the year coverage looked
%%%                        like this:
%%%
%%%                             1959 (   2)    1979 (   3)    1999 (   1)
%%%                             1960 (   2)    1980 (   6)    2000 (   0)
%%%                             1961 (   0)    1981 (   0)    2001 (   1)
%%%                             1962 (   2)    1982 (   3)    2002 (   1)
%%%                             1963 (   2)    1983 (   1)    2003 (   1)
%%%                             1964 (   1)    1984 (   3)    2004 (   0)
%%%                             1965 (   8)    1985 (   1)    2005 (   2)
%%%                             1966 (   1)    1986 (   0)    2006 (   1)
%%%                             1967 (   2)    1987 (   0)    2007 (   1)
%%%                             1968 (   2)    1988 (   2)    2008 (   0)
%%%                             1969 (   4)    1989 (   0)    2009 (   1)
%%%                             1970 (   2)    1990 (   0)    2010 (   0)
%%%                             1971 (   1)    1991 (   4)    2011 (   0)
%%%                             1972 (   1)    1992 (   2)    2012 (   0)
%%%                             1973 (   0)    1993 (   2)    2013 (   0)
%%%                             1974 (   0)    1994 (   1)    2014 (   0)
%%%                             1975 (   1)    1995 (   1)    2015 (   0)
%%%                             1976 (   1)    1996 (   0)    2016 (   1)
%%%                             1977 (   2)    1997 (   0)
%%%                             1978 (   2)    1998 (   0)
%%%
%%%                             Article:         29
%%%                             Book:            10
%%%                             InCollection:     6
%%%                             InProceedings:    6
%%%                             Misc:             1
%%%                             PhdThesis:        1
%%%                             Proceedings:     10
%%%                             TechReport:      12
%%%
%%%                             Total entries:   75
%%%
%%%                        This file is available as part of the BibNet
%%%                        Project.  The master copy is available for
%%%                        public access at
%%%
%%%                            ftp://ftp.math.utah.edu/pub/bibnet/authors
%%%                            https://www.math.utah.edu/pub/bibnet/authors
%%%
%%%                        It is mirrored to
%%%
%%%                            ftp://netlib.bell-labs.com/netlib/bibnet/authors
%%%
%%%                        The data in this bibliography were collected
%%%                        from many sources, including the MathSciNet
%%%                        database, the JSTOR database, the European
%%%                        Mathematical Society database, the
%%%                        bibliography archives of the BibNet Project,
%%%                        the TeX User Group, and the University of
%%%                        Karlsruhe Computer Science Department, as
%%%                        well as
%%%
%%%                            http://interval.louisiana.edu/Moores_early_papers/bibliography.html
%%%
%%%                        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{
    "\ifx \undefined \booktitle \def \booktitle#1{{{\em #1}}} \fi"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|https://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:
@String{j-AMER-MATH-MONTHLY     = "American Mathematical Monthly"}

@String{j-APL-MAT               = "Aplikace Matematiky"}

@String{j-COMPUT-MATH-APPL      = "Computers and Mathematics with Applications"}

@String{j-COMPUTING             = "Computing: Archiv f{\"u}r informatik und numerik"}

@String{j-COMPUTING-SUPPLEMENTUM = "Computing. Supplementum"}

@String{j-FUZZY-SETS-SYSTEMS    = "Fuzzy Sets and Systems"}

@String{j-IBM-SYS-J             = "IBM Systems Journal"}

@String{j-J-COMP-SYS-SCI        = "Journal of Computer and System Sciences"}

@String{j-RELIABLE-COMPUTING    = "Reliable Computing = Nadezhnye vychisleniia"}

@String{j-SCIENCE               = "Science"}

@String{j-SIAM-J-NUMER-ANAL     = "SIAM Journal on Numerical Analysis"}

@String{j-SIAM-REVIEW           = "SIAM Review"}

@String{j-SIGNUM                = "ACM SIGNUM Newsletter"}

%%% ====================================================================
%%% Publisher abbreviations:
@String{pub-ACADEMIC            = "Academic Press"}
@String{pub-ACADEMIC:adr        = "New York, NY, USA"}

@String{pub-ACM                 = "ACM Press"}
@String{pub-ACM:adr             = "New York, NY 10036, USA"}

@String{pub-BIRKHAUSER          = "Birkh{\"{a}}user"}
@String{pub-BIRKHAUSER:adr      = "Cambridge, MA, USA; Berlin, Germany; Basel,
                                  Switzerland"}

@String{pub-ELLIS-HORWOOD       = "Ellis Horwood"}
@String{pub-ELLIS-HORWOOD:adr   = "New York, NY, USA"}

@String{pub-HRW                 = "Holt, Rinehart, and Winston"}
@String{pub-HRW:adr             = "New York, NY, USA"}

@String{pub-IEEE                = "IEEE Computer Society Press"}

@String{pub-IEEE:adr            = "1109 Spring Street, Suite 300,
                                  Silver Spring, MD 20910, USA"}

@String{pub-OLDENBOURG          = "R. Oldenbourg"}
@String{pub-OLDENBOURG:adr      = "M{\"u}nchen, Germany"}

@String{pub-PH                  = "Pren{\-}tice-Hall"}
@String{pub-PH:adr              = "Upper Saddle River, NJ 07458, USA"}

@String{pub-PRINCETON           = "Princeton University Press"}
@String{pub-PRINCETON:adr       = "Princeton, NJ, USA"}

@String{pub-SIAM                = "Society for Industrial and Applied
                                  Mathematics"}
@String{pub-SIAM:adr            = "Philadelphia, PA, USA"}

@String{pub-SPRINGER-WIEN       = "Spring{\-}er"}
@String{pub-SPRINGER-WIEN:adr   = "Wien / New York"}

@String{pub-SV                  = "Spring{\-}er-Ver{\-}lag"}

@String{pub-SV:adr              = "Berlin, Germany~/ Heidelberg,
                                  Germany~/ London, UK~/ etc."}

@String{pub-WILEY               = "Wiley"}
@String{pub-WILEY:adr           = "New York, NY, USA"}

%%% ====================================================================
%%% Bibliography entries, sorted by year, and within years, by citation
%%% label:
@TechReport{Moore:1959:AEA,
  author =       "R. E. Moore",
  title =        "Automatic error analysis in digital computation",
  type =         "Technical Report",
  number =       "Space Div. Report LMSD84821",
  institution =  "Lockheed Missiles and Space Co.",
  address =      "Sunnyvale, CA, USA",
  year =         "1959",
  bibdate =      "Thu Jun 20 10:47:34 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Moore_Lockheed.pdf",
  acknowledgement = ack-nhfb,
}

@TechReport{Moore:1959:IAI,
  author =       "R. E. Moore and C. T. Yang",
  title =        "Interval Analysis {I}",
  type =         "Technical Document",
  number =       "LMSD-285875",
  institution =  "Lockheed Missiles and Space Division",
  address =      "Sunnyvale, CA, USA",
  year =         "1959",
  bibdate =      "Thu Jun 20 10:57:59 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Moore_Yang.pdf",
  acknowledgement = ack-jr,
}

@Article{Moore:1960:BRB,
  author =       "Ramon E. Moore",
  title =        "Book Review: {{\booktitle{On Numerical Approximation}}
                 (Proceedings of a Symposium) (R. E. Langer, ed.)}",
  journal =      j-SIAM-REVIEW,
  volume =       "2",
  number =       "1",
  pages =        "49--50",
  month =        "????",
  year =         "1960",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1002015",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Thu Mar 27 09:04:29 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/2/1;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "January 1960",
}

@TechReport{Moore:1960:II,
  author =       "R. E. Moore and W. Strother and C. T. Yang",
  title =        "Interval Integrals",
  type =         "Technical Memorandum: Mathematics",
  number =       "LMSD-703073",
  institution =  "Lockheed Missiles and Space Division",
  address =      "Sunnyvale, CA, USA",
  year =         "1960",
  bibdate =      "Thu Jun 20 10:57:03 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Moore_integrals.pdf",
  acknowledgement = ack-jr,
}

@Article{Moore:1962:BRD,
  author =       "Ramon E. Moore",
  title =        "Book Review: {{\booktitle{Discrete Variable Methods in
                 Ordinary Differential Equations}} by Peter Henrici}",
  journal =      j-SCIENCE,
  volume =       "136",
  number =       "3511",
  pages =        "143--144",
  day =          "13",
  month =        apr,
  year =         "1962",
  CODEN =        "SCIEAS",
  DOI =          "https://doi.org/10.1126/science.136.3511.143;
                 https://doi.org/10.2307/1708446",
  ISSN =         "0036-8075 (print), 1095-9203 (electronic)",
  ISSN-L =       "0036-8075",
  bibdate =      "Mon Jan 28 10:32:38 2019",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/h/henrici-peter.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://science.sciencemag.org/content/136/3511/143.2;
                 http://www.jstor.org/stable/1708446",
  acknowledgement = ack-nhfb,
  fjournal =     "Science",
  journal-URL =  "http://www.sciencemag.org/archive/",
  reviewed-author = "Peter Henrici",
}

@PhdThesis{Moore:1962:IAA,
  author =       "R. E. Moore",
  title =        "Interval Arithmetic and Automatic Error Analysis in
                 Digital Computing",
  type =         "{Ph.D.} dissertation",
  school =       "Department of Mathematics, Stanford University",
  address =      "Stanford, CA, USA",
  month =        nov,
  year =         "1962",
  bibdate =      "Thu Jun 20 10:49:16 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  note =         "Also published as Applied Mathematics and Statistics
                 Laboratories Technical Report No. 25.",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/disert.pdf",
  acknowledgement = ack-nhfb,
}

@InProceedings{Boche:1963:OIA,
  author =       "R. E. Boche",
  title =        "An Operational Interval Arithmetic",
  crossref =     "IEEE:1963:PNE",
  pages =        "??--??",
  year =         "1963",
  bibdate =      "Thu Jun 20 10:43:29 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Boche_operational.pdf",
  acknowledgement = ack-jr,
}

@TechReport{Moore:1964:DIR,
  author =       "R. E. Moore and J. A. Davison and H. R. Jaschke and S.
                 Shayer",
  title =        "{DIFEQ} integration routine --- user's manual",
  type =         "Technical Report",
  number =       "LMSC6-90-64-6",
  institution =  "Lockheed Missiles and Space Co.",
  address =      "Los Angeles, CA",
  year =         "1964",
  bibdate =      "Sat May 27 06:39:09 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Moore_DIFEQ.pdf",
  acknowledgement = ack-nhfb,
}

@TechReport{Boche:1965:CIA,
  author =       "R. E. Boche",
  title =        "Complex interval arithmetic with some applications",
  type =         "Technical Report",
  number =       "LMSC4-22-66-1",
  institution =  "Lockheed Missiles and Space Co.",
  address =      "Sunnyvale, CA, USA",
  year =         "1965",
  bibdate =      "Thu Jun 20 10:43:56 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Boche_complex.pdf",
  acknowledgement = ack-nhfb,
}

@TechReport{Miller:1965:IAP,
  author =       "M. E. Miller",
  title =        "Interval arithmetic programs and references",
  type =         "Memo",
  institution =  "Lockheed Missiles and Space Div.",
  address =      "Sunnyvale, CA, USA",
  year =         "1965",
  bibdate =      "Thu Jun 20 10:46:07 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Miller_programs.pdf",
  acknowledgement = ack-nhfb,
}

@InCollection{Moore:1965:AACa,
  author =       "Ramon E. Moore",
  title =        "The automatic analysis and control of error in digital
                 computing based on the use of interval numbers",
  crossref =     "Rall:1965:EDCa",
  chapter =      "2",
  pages =        "61--130",
  year =         "1965",
  MRclass =      "65.61 (65.80)",
  MRnumber =     "MR0176614 (31 \#886)",
  MRreviewer =   "T. E. Hull",
  bibdate =      "Thu Jun 20 10:51:40 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Moore_in_Rall_V1.pdf",
  acknowledgement = ack-nhfb,
}

@InCollection{Moore:1965:AACb,
  author =       "Ramon E. Moore",
  title =        "Automatic local coordinate transformations to reduce
                 the growth of error bounds in interval computation of
                 solutions of ordinary differential equations",
  crossref =     "Rall:1965:EDCb",
  chapter =      "2",
  pages =        "103--140",
  year =         "1965",
  MRclass =      "65.80 (65.60)",
  MRnumber =     "MR0185839 (32 \#3299)",
  MRreviewer =   "T. E. Hull",
  bibdate =      "Thu Jun 20 10:51:40 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Moore_in_Rall_V2.pdf",
  acknowledgement = ack-nhfb,
}

@TechReport{Reiter:1965:IAP,
  author =       "A. Reiter",
  title =        "Interval Arithmetic Package: {MRC} Program 2",
  type =         "Coop organ, Code-Wisc. Math. Res. Center",
  institution =  "University of Wisconsin, Madison",
  year =         "1965",
  bibdate =      "Thu Jun 20 10:58:36 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Reiter_package.pdf",
  acknowledgement = ack-jr,
}

@TechReport{Shayer:1965:IAS,
  author =       "S. Shayer",
  title =        "Interval arithmetic with some applications for digital
                 computers",
  type =         "Technical Report",
  number =       "LMSD5-13-65-12",
  institution =  "Lockheed Missiles and Space Co.",
  address =      "Sunnyvale, CA, USA",
  year =         "1965",
  bibdate =      "Thu Jun 20 10:59:04 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Shayer_applications.pdf",
  acknowledgement = ack-nhfb,
}

@Book{Moore:1966:IA,
  author =       "Ramon E. Moore",
  title =        "Interval analysis",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "xi + 145",
  year =         "1966",
  LCCN =         "QA297 .M63",
  MRclass =      "65.10 (68.00)",
  MRnumber =     "MR0231516 (37 \#7069)",
  bibdate =      "Sat Feb 14 08:15:54 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Reiter:1967:PIA,
  author =       "A. Reiter",
  booktitle =    "Proceedings of the 1967 Army Numerical Analysis
                 Conference",
  title =        "Programming Interval Arithmetic and Applications",
  publisher =    "U. S. Army Research Office",
  address =      "Durham, NC, USA",
  pages =        "87--98",
  year =         "1967",
  bibdate =      "Thu Jun 20 10:58:57 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  note =         "Army Research Office Rep. 67-3",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/Reiter_programming.pdf",
  acknowledgement = ack-jr,
}

@TechReport{Braun:1968:PSD,
  author =       "J. A. Braun and R. E. Moore",
  title =        "A Program for the Solution of Differential Equations
                 Using Interval Arithmetic (Difeq) for the {CDC 3600}
                 and the {CDC 1604}",
  type =         "MRC Technical Summary",
  number =       "901",
  institution =  "University of Wisconsin, Madison",
  year =         "1968",
  bibdate =      "Fri Jan 12 11:37:56 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/addendum/Braun1968aprogram.pdf",
  acknowledgement = ack-jr,
}

@Article{Moore:1968:PAI,
  author =       "R. E. Moore",
  title =        "Practical aspects of interval computation",
  journal =      j-APL-MAT,
  volume =       "13",
  number =       "??",
  pages =        "52--92",
  year =         "1968",
  CODEN =        "APMTAK",
  ISSN =         "0373-6725",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0184.37401",
  acknowledgement = ack-nhfb,
  fjournal =     "Aplikace Matematiky",
  keywords =     "numerical analysis",
}

@InCollection{Moore:1969:FAC,
  author =       "Ramon E. Moore",
  title =        "Functional analysis for computers",
  crossref =     "Unger:1969:TFM",
  pages =        "113--126",
  year =         "1969",
  MRclass =      "46.90 (65.00)",
  MRnumber =     "MR0248542 (40 \#1794)",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0209.46504",
  acknowledgement = ack-nhfb,
  classmath =    "*65G30 Interval and finite arithmetic 65-02 Research
                 monographs (numerical analysis)",
}

@Book{Moore:1969:IUD,
  author =       "Ramon E. Moore",
  title =        "Intervallanalyse",
  publisher =    pub-OLDENBOURG,
  address =      pub-OLDENBOURG:adr,
  bookpages =    "188 + 7",
  year =         "1969",
  MRclass =      "65.80",
  MRnumber =     "MR0260228 (41 \#4856)",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  note =         "Translated to German by Dieter Pfaffenzeller",
  price =        "DM 39.00",
  ZMnumber =     "0273.65031",
  acknowledgement = ack-nhfb,
  classmath =    "*65-02 Research monographs (numerical analysis) 65G50
                 Roundoff error",
  language =     "German",
}

@Book{Rall:1969:CSN,
  author =       "Louis B. Rall",
  title =        "Computational solution of nonlinear operator
                 equations",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "viii + 225",
  year =         "1969",
  MRclass =      "65.10 (46.00)",
  MRnumber =     "MR0240944 (39 \#2289)",
  MRreviewer =   "Jagdish Chandra",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  series =       "With an appendix by Ramon E. Moore",
}

@Book{Daniel:1970:CTO,
  author =       "James W. Daniel and Ramon E. Moore",
  title =        "Computation and Theory in Ordinary Differential
                 Equations",
  publisher =    "W. H. Freeman",
  address =      "San Francisco, CA, USA",
  pages =        "xi + 172",
  year =         "1970",
  ISBN =         "0-7167-0440-4",
  ISBN-13 =      "978-0-7167-0440-9",
  LCCN =         "QA372 .D28",
  MRclass =      "65.60",
  MRnumber =     "MR0267765 (42 \#2667)",
  MRreviewer =   "T. E. Hull",
  bibdate =      "Fri Jan 12 11:37:56 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  note =         "Sec. 5.8 (pp. 86--89) and Sec. 6.6 (pp. 100--101)",
  acknowledgement = ack-jr,
}

@Article{Moore:1970:SLR,
  author =       "Ramon E. Moore",
  title =        "On the stability of linear recurrence equations with
                 arbitrary time lags",
  journal =      j-J-COMP-SYS-SCI,
  volume =       "4",
  number =       "4",
  pages =        "377--383",
  month =        aug,
  year =         "1970",
  CODEN =        "JCSSBM",
  DOI =          "https://doi.org/10.1016/S0022-0000(70)80019-8",
  ISSN =         "0022-0000 (print), 1090-2724 (electronic)",
  ISSN-L =       "0022-0000",
  MRclass =      "39.30",
  MRnumber =     "MR0265803 (42 \#712)",
  MRreviewer =   "A. Smajdor",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0198.13302",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of Computer and System Sciences",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00220000",
  keywords =     "ordinary differential equations",
}

@Article{Moore:1972:RCT,
  author =       "Ramon E. Moore and James W. Daniel and W. E. Boyce",
  title =        "Reviews: {Computation and Theory in Ordinary
                 Differential Equations}",
  journal =      j-AMER-MATH-MONTHLY,
  volume =       "79",
  number =       "4",
  pages =        "407--408",
  year =         "1972",
  CODEN =        "AMMYAE",
  ISSN =         "0002-9890 (print), 1930-0972 (electronic)",
  ISSN-L =       "0002-9890",
  MRclass =      "Contributed Item",
  MRnumber =     "MR1536701",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  fjournal =     "The American Mathematical Monthly",
  journal-URL =  "https://www.jstor.org/journals/00029890.htm",
}

@Book{Moore:1975:MES,
  author =       "Ramon E. Moore",
  title =        "Mathematical elements of scientific computing",
  publisher =    pub-HRW,
  address =      pub-HRW:adr,
  pages =        "x + 237",
  year =         "1975",
  ISBN =         "0-03-088125-0",
  ISBN-13 =      "978-0-03-088125-1",
  LCCN =         "QA 297 .M64 1975",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0376.65001",
  acknowledgement = ack-nhfb,
  classmath =    "65-01 Textbooks (numerical analysis); 65Fxx Numerical
                 linear algebra; 65Dxx Numerical approximation; 65Lxx
                 Numerical methods for ODE; 65Hxx Nonlinear algebraic or
                 transcendental equations",
  keywords =     "interval arithmetic",
}

@Article{Moore:1976:CRR,
  author =       "R. E. Moore",
  title =        "On Computing the Range of a Rational Function of $n$
                 Variables over a Bounded Region",
  journal =      j-COMPUTING,
  volume =       "16",
  number =       "1--2",
  pages =        "1--15",
  year =         "1976",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  bibdate =      "Tue Jan 2 17:40:52 MST 2001",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 INSPEC Axiom database (1968--date)",
  URL =          "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X",
  ZMnumber =     "0345.65024",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ. of Wisconsin, Madison, WI, USA",
  classification = "723; 921; B0290D; C4120; C7310",
  classmath =    "*65H10 Systems of nonlinear equations (numerical
                 methods) 65G50 Roundoff error",
  description =  "function evaluation",
  fjournal =     "Computing: Archiv f{\"u}r informatik und numerik",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Comput (Vienna/NY)",
  keywords =     "bounded region; computational mathematics; computer
                 programming --- Subroutines; digital computing;
                 internal analysis; mathematical programming;
                 mathematical techniques; ranges of values; rational
                 function",
}

@Article{Moore:1977:SSR,
  author =       "R. E. Moore and S. T. Jones",
  title =        "Safe starting regions for iterative methods",
  journal =      j-SIAM-J-NUMER-ANAL,
  volume =       "14",
  number =       "6",
  pages =        "1051--1065",
  year =         "1977",
  CODEN =        "SJNAAM",
  ISSN =         "0036-1429 (print), 1095-7170 (electronic)",
  ISSN-L =       "0036-1429",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 JSTOR database",
  ZMnumber =     "0371.65009",
  acknowledgement = ack-nhfb,
  classmath =    "*65H10 Systems of nonlinear equations (numerical
                 methods)",
  fjournal =     "SIAM Journal on Numerical Analysis",
  journal-URL =  "http://epubs.siam.org/sinum",
}

@Article{Moore:1977:TES,
  author =       "R. E. Moore",
  title =        "A test for existence of solutions to nonlinear
                 systems",
  journal =      j-SIAM-J-NUMER-ANAL,
  volume =       "14",
  number =       "??",
  pages =        "611--615",
  year =         "1977",
  CODEN =        "SJNAAM",
  ISSN =         "0036-1429 (print), 1095-7170 (electronic)",
  ISSN-L =       "0036-1429",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0365.65034",
  acknowledgement = ack-nhfb,
  classmath =    "*65H10 Systems of nonlinear equations (numerical
                 methods) 65G50 Roundoff error",
  fjournal =     "SIAM Journal on Numerical Analysis",
  journal-URL =  "http://epubs.siam.org/sinum",
}

@Article{Moore:1978:BSF,
  author =       "R. E. Moore",
  title =        "Bounding Sets in Function Spaces with Applications to
                 Nonlinear Operator Equations",
  journal =      j-SIAM-REVIEW,
  volume =       "20",
  number =       "3",
  pages =        "492--512",
  month =        "????",
  year =         "1978",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1020068",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Sat Mar 29 09:52:53 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/20/3;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  ZMnumber =     "0392.65020",
  acknowledgement = ack-nhfb,
  classmath =    "*65J15 Equations with nonlinear operators (numerical
                 methods) 65G30 Interval and finite arithmetic 65L05
                 Initial value problems for ODE (numerical methods)
                 65L10 Boundary value problems for ODE (numerical
                 methods)",
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  keywords =     "Bounding Sets; Interval Method; Newton - Kantorovich
                 Method; Nonlinear Operator Equations",
  onlinedate =   "July 1978",
}

@Article{Moore:1978:CTC,
  author =       "R. E. Moore",
  title =        "A computational test for convergence of iterative
                 methods for nonlinear systems",
  journal =      j-SIAM-J-NUMER-ANAL,
  volume =       "15",
  number =       "6",
  pages =        "1194--1196",
  month =        dec,
  year =         "1978",
  CODEN =        "SJNAAM",
  ISSN =         "0036-1429 (print), 1095-7170 (electronic)",
  ISSN-L =       "0036-1429",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0395.65020",
  acknowledgement = ack-nhfb,
  classmath =    "*65H10 Systems of nonlinear equations (numerical
                 methods)",
  fjournal =     "SIAM Journal on Numerical Analysis",
  journal-URL =  "http://epubs.siam.org/sinum",
  keywords =     "Computational Test; Convergence of Iterative Methods;
                 Newton-Type Sequence; Solution to a Nonlinear System of
                 Equations",
}

@TechReport{Moore79,
  author =       "R. E. Moore",
  title =        "Handling complex queries in a distributed database",
  type =         "Technical Note, Artificial Intelligence",
  number =       "170",
  institution =  "SRI International",
  address =      "Menlo Park, CA, USA",
  pages =        "????",
  year =         "1979",
  bibdate =      "Sat May 27 08:22:28 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
}

@TechReport{Moore:1979:AEC,
  author =       "R. E. Moore and others",
  title =        "{AIRDOS-EPA}: {A} Computerized Methodology for
                 Estimating Environmental Concentrations and Dose to Man
                 from Airborne Releases of Radionuclides",
  type =         "Technical Report",
  number =       "ORNL-5532",
  institution =  "Oak Ridge National Laboratory",
  address =      "Oak Ridge, Tenn.",
  year =         "1979",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  referred =     "[Horw91a].",
  xxnote =       "Is this Ramon E. Moore?",
}

@Book{Moore:1979:MAI,
  author =       "Ramon E. Moore",
  title =        "Methods and Applications of Interval Analysis",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xi + 190",
  year =         "1979",
  ISBN =         "0-89871-161-4",
  ISBN-13 =      "978-0-89871-161-5",
  LCCN =         "QA297.75 .M66",
  MRclass =      "65G10 (65-02)",
  MRnumber =     "MR551212 (81b:65040)",
  MRreviewer =   "H. Ratschek",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0417.65022",
  abstract =     "Chapter 3 of this book discusses differentiation
                 arithmetic as a recursive iteration. That is, for
                 calculating Taylor coefficients.",
  classmath =    "*65G30 Interval and finite arithmetic 65-02 Research
                 monographs (numerical analysis) 65C05 Monte Carlo
                 methods 65Kxx Numerical methods in mathematical
                 programming and optimization 65L05 Initial value
                 problems for ODE (numerical methods) 65L10 Boundary
                 value problems for ODE (numerical methods) 65J10
                 Equations with linear operators (numerical methods)",
  keywords =     "bibliography; boundary value problems; differential
                 equations; differential inequalities; error-bound
                 estimates; existence and convergence of iterative
                 solutions; Gaussian elimination; interval analysis;
                 interval extension of a real function; interval Newton
                 method; interval searching procedures; iterative
                 methods; linear and nonlinear algebraic systems; linear
                 and nonlinear programming; metric topology for
                 intervals; operator equations; rounded interval
                 analysis; starting and stopping criteria; Taylor
                 series; wrapping effect",
  referred =     "[Corl87a]; [Corl91a]; [Garl85a] \#980; [Aber88a];
                 [Corl88a]; [Layn91a]; [Neid89a]; [Rall80a]; [Rall81a];
                 [Rall85a]; [Rall91a].",
}

@InProceedings{Moore:1980:IMN,
  author =       "R. E. Moore",
  title =        "Interval Methods for Nonlinear Systems",
  crossref =     "Alefeld:1980:FNC",
  volume =       "2",
  pages =        "113--120",
  year =         "1980",
  bibdate =      "Fri Oct 15 21:05:35 1999",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  series =       j-COMPUTING-SUPPLEMENTUM,
  ZMnumber =     "0437.65055",
  acknowledgement = ack-nhfb,
  classmath =    "*65H10 Systems of nonlinear equations (numerical
                 methods) 65G30 Interval and finite arithmetic 65F10
                 Iterative methods for linear systems",
  keywords =     "bisection procedures; computational tests; convergence
                 of an iteration process; existence of a solution in the
                 region; existence of solutions; interval arithmetic;
                 nonexistence of a solution in the region; numerical
                 example",
}

@Article{Moore:1980:MIA,
  author =       "R. E. Moore",
  title =        "Microprogrammed interval arithmetic",
  journal =      j-SIGNUM,
  volume =       "15",
  number =       "2",
  pages =        "30--30",
  month =        jun,
  year =         "1980",
  CODEN =        "SNEWD6",
  ISSN =         "0163-5778 (print), 1558-0237 (electronic)",
  ISSN-L =       "0163-5778",
  bibdate =      "Tue Apr 12 07:50:08 MDT 2005",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGNUM Newsletter",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J690",
}

@InCollection{Moore:1980:NRN,
  author =       "Ramon E. Moore",
  title =        "New results on nonlinear systems",
  crossref =     "Nickel:1980:IMP",
  pages =        "165--180",
  year =         "1980",
  MRclass =      "65G10 (65H10)",
  MRnumber =     "MR651363 (83c:65105)",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0539.65034",
  abstract =     "{[For the entire collection see Zbl 0527.00029.] Verf.
                 berichtet {\"u}ber einige neue Ergebnisse zur
                 L{\"o}sung nichtlinearer Gleichungssysteme mit Hilfe
                 von Intervalloperatoren. Er erw{\"a}hnt Existenz- und
                 Nichtexistenztests, ein Konvergenzkriterium, welches
                 von Rall mit dem Kantorovich Theorem verglichen wurde,
                 sowie Suchalgorithmen zur Bestimmung eines
                 Anfangsintervalls, in welchem eine L{\"o}sung liegt. Er
                 gibt auch ein Beispiel an, f{\"u}r welches sich der
                 Rechenaufwand aufgrund der speziellen Struktur des
                 Gleichungssystems reduzieren l{\"a}{\ss}t.}",
  acknowledgement = ack-nhfb,
  classmath =    "*65H10 Systems of nonlinear equations (numerical
                 methods) 65G30 Interval and finite arithmetic",
  keywords =     "convergence criterion; interval arithmetic; search
                 algorithm",
  reviewer =     "R.Krawczyk",
}

@Article{Moore:1980:STA,
  author =       "R. E. Moore and J. B. Kioustelidis",
  title =        "A simple test for accuracy of approximate solutions to
                 nonlinear (or linear) systems",
  journal =      j-SIAM-J-NUMER-ANAL,
  volume =       "17",
  number =       "4",
  pages =        "521--529",
  month =        aug,
  year =         "1980",
  CODEN =        "SJNAAM",
  ISSN =         "0036-1429 (print), 1095-7170 (electronic)",
  ISSN-L =       "0036-1429",
  MRclass =      "65G10 (65H10)",
  MRnumber =     "83e:65085",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 JSTOR database",
  ZMnumber =     "0457.65031",
  acknowledgement = ack-nhfb,
  classmath =    "*65H10 Systems of nonlinear equations (numerical
                 methods) 65F05 Direct methods for linear systems 65G30
                 Interval and finite arithmetic",
  fjournal =     "SIAM Journal on Numerical Analysis",
  journal-URL =  "http://epubs.siam.org/sinum",
  keywords =     "intermediate theorem; interval analysis; test for
                 accuracy",
}

@Article{Asaithambi:1982:CRV,
  author =       "N. S. Asaithambi and Shen Zuhe and R. E. Moore",
  title =        "On Computing the Range of Values",
  journal =      j-COMPUTING,
  volume =       "28",
  number =       "3",
  pages =        "225--237",
  year =         "1982",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X (print), 1436-5057 (electronic)",
  ISSN-L =       "0010-485X",
  MRclass =      "65G10",
  MRnumber =     "83d:65136",
  bibdate =      "Tue Oct 12 16:33:42 MDT 1999",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 MathSciNet database",
  URL =          "http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0010-485X",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Wis, Madison, USA",
  classification = "723",
  fjournal =     "Computing: Archiv f{\"u}r informatik und numerik",
  journal-URL =  "http://link.springer.com/journal/607",
  journalabr =   "Computing (Vienna/New York)",
  keywords =     "computer programming",
}

@Article{Moore:1982:GMU,
  author =       "R. E. Moore",
  title =        "A generalization of the method of upper and lower
                 solutions for integral equations",
  journal =      "Nonlinear Anal., Theory Methods Appl.",
  volume =       "6",
  number =       "??",
  pages =        "829--831",
  year =         "1982",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0495.65055",
  acknowledgement = ack-nhfb,
  classmath =    "*65R20 Integral equations (numerical methods) 65G30
                 Interval and finite arithmetic 65R20 Integral equations
                 (numerical methods) 45G10 Nonsingular nonlinear
                 integral equations",
  keywords =     "integral inequalities; interval arithmetic; interval
                 integration; interval-valued function; upper and lower
                 solutions; Urysohn integral equations",
}

@Article{Moore:1982:SIT,
  author =       "R. E. Moore and L. Qi",
  title =        "A Successive Interval Test for Nonlinear Systems",
  journal =      j-SIAM-J-NUMER-ANAL,
  volume =       "19",
  number =       "4",
  pages =        "845--850",
  month =        aug,
  year =         "1982",
  CODEN =        "SJNAAM",
  ISSN =         "0036-1429 (print), 1095-7170 (electronic)",
  ISSN-L =       "0036-1429",
  MRclass =      "65H10 (65J15)",
  MRnumber =     "83f:65080",
  bibdate =      "Fri Oct 16 06:57:22 MDT 1998",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 JSTOR database",
  ZMnumber =     "0497.65027",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Numerical Analysis",
  journal-URL =  "http://epubs.siam.org/sinum",
  keywords =     "interval-analysis; interval-operator;
                 Krawczyk-operator",
}

@Article{Moore:1983:IVC,
  author =       "R. E. Moore and Zuhe Shen",
  title =        "An interval version of Chebyshev's method for
                 nonlinear operator equations",
  journal =      "Nonlinear Anal., Theory Methods Appl.",
  volume =       "7",
  number =       "??",
  pages =        "21--34",
  year =         "1983",
  bibdate =      "Sat May 27 07:35:27 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0505.65015",
  acknowledgement = ack-nhfb,
  classmath =    "*65J15 Equations with nonlinear operators (numerical
                 methods) 65G30 Interval and finite arithmetic 65L05
                 Initial value problems for ODE (numerical methods)
                 65L10 Boundary value problems for ODE (numerical
                 methods) 65N22 Solution of discretized equations (BVP
                 of PDE)",
  keywords =     "Banach function space; Chebyshev's method;
                 convergence; existence; interval arithmetic; interval
                 version of Newton's method; Kantorovich theorem;
                 uniqueness",
}

@TechReport{Moore:1984:RAM,
  author =       "Ramon E. Moore",
  title =        "Risk analysis without {Monte Carlo} methods",
  type =         "{Freiburger Intervall-Berichte}",
  number =       "84/1",
  institution =  "Universit{\"a}t Freiburg",
  address =      "Freiburg, Germany",
  pages =        "48",
  year =         "1984",
  bibdate =      "Tue Dec 31 13:58:10 2013",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Moore:1984:SIM,
  author =       "Ramon E. Moore",
  title =        "A Survey of Interval Methods for Differential
                 Equations",
  crossref =     "IEEE:1984:PIC",
  pages =        "1529--1535",
  year =         "1984",
  bibdate =      "Sat May 27 08:15:24 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
}

@Book{Moore:1985:CFA,
  author =       "Ramon E. Moore",
  title =        "Computational functional analysis",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  pages =        "156",
  year =         "1985",
  ISBN =         "0-85312-807-3",
  ISBN-13 =      "978-0-85312-807-6",
  MRclass =      "47-01 (46-01 47A50 47H17 58Cxx 65-01 65Jxx 90Cxx)",
  MRnumber =     "MR783431 (87a:47001)",
  MRreviewer =   "Heinz W. Engl",
  bibdate =      "Sat May 27 07:54:15 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  series =       "Mathematics and its Applications",
  ZMnumber =     "0574.46001",
  abstract =     "The aim of the book is to apply concepts and
                 techniques of functional analysis to approximate
                 solutions of operator equations (algebraic, linear,
                 non-linear, differential, integral and
                 others).\par

                 Chapters 1 to 12 contain introductory topics from
                 functional analysis: linear spaces, topological and
                 metric spaces, Banach and Hilbert spaces, linear
                 functionals and operators, types of convergence,
                 reproducing kernel Hilbert spaces, compact operators.
                 The rest of the book is devoted to approximate methods
                 of solving operator equations: Newton's type methods,
                 Galerkin's method, interval methods, homotopy and
                 continuation methods.\par

                 The book is clearly written, contains many worked
                 numerical examples and can be used as an excellent
                 text-book for one --- or two --- semester courses at
                 the first year graduate level",
  acknowledgement = ack-nhfb,
  classmath =    "*46-01 Textbooks (functional analysis) 65-01 Textbooks
                 (numerical analysis) 65J05 General theory of numerical
                 methods in abstract spaces 47A50 Equations and
                 inequalities involving linear operators 46B03
                 Isomorphic theory (including renorming) of Banach
                 spaces",
  keywords =     "approximate solutions of operator equations; Banach
                 and Hilbert spaces; compact operators; Galerkin's
                 method; homotopy and continuation methods; interval
                 methods; linear functionals and operators; Newton's
                 type methods; reproducing kernel Hilbert spaces;
                 topological and metric spaces; types of convergence",
  reviewer =     "S.Cobzas",
}

@Article{Moore:1988:USA,
  author =       "R. E. Moore",
  title =        "Utilizing the {SNA} alert in the management of
                 multivendor networks",
  journal =      j-IBM-SYS-J,
  volume =       "27",
  number =       "1",
  pages =        "15--31",
  month =        jan,
  year =         "1988",
  CODEN =        "IBMSA7",
  ISSN =         "0018-8670",
  bibdate =      "Tue Mar 19 17:38:46 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "IBM Systems Journal",
  keywords =     "design; management",
  subject =      "C.2.1 Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Architecture
                 and Design, SNA \\ C.2.3 Computer Systems Organization,
                 COMPUTER-COMMUNICATION NETWORKS, Network Operations,
                 Network management",
  xxnote =       "Is this Ramon E. Moore?",
}

@Article{Moore:1991:GOP,
  author =       "Ramon E. Moore",
  title =        "Global optimization to prescribed accuracy",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "21",
  number =       "6--7",
  pages =        "25--39",
  year =         "1991",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(91)90158-Z",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  MRclass =      "90C30 (65K10)",
  MRnumber =     "MR1096131 (91m:90159)",
  bibdate =      "Sat May 27 07:54:15 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0725.65062",
  abstract =     "The author presents his view on the role of interval
                 arithmetic and on the use of multiple precision in the
                 field of global optimization. After an introductory
                 section on order relations and on interval arithmetic,
                 round-off errors are discussed in connection with
                 fixed-precision floating-point arithmetic. Results
                 obtained in this arithmetic are compared with those
                 using interval tools combined with an outward rounding.
                 The role of computing the ranges of functions and of
                 computing with sets is emphasized.\par

                 A central section addresses the problem of formulating
                 an appropriate stopping criterion. It is illustrated by
                 examples using the interval Newton method. Remarks on
                 user-controlled arbitrary precision interval arithmetic
                 are added where this precision can be varied during the
                 computation, if necessary. The paper ends with some
                 essentials of interval methods for global optimization
                 and with some directions for future research",
  acknowledgement = ack-nhfb,
  classmath =    "*65K05 Mathematical programming (numerical methods)
                 65G30 Interval and finite arithmetic 65H10 Systems of
                 nonlinear equations (numerical methods) 90C30 Nonlinear
                 programming",
  fjournal =     "Computers \& Mathematics with Applications. An
                 International Journal",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
  keywords =     "floating-point arithmetic; global optimization;
                 interval arithmetic; interval Newton method; multiple
                 precision; round-off errors; stopping criterion",
  reviewer =     "G.Mayer (Karlsruhe)",
}

@InCollection{Moore:1991:ITC,
  author =       "Ramon E. Moore",
  title =        "Interval tools for computer aided proofs in analysis",
  crossref =     "Meyer:1991:CAP",
  volume =       "28",
  number =       "??",
  pages =        "211--216",
  year =         "1991",
  MRclass =      "68T15 (65G10)",
  MRnumber =     "MR1101373 (92a:68132)",
  bibdate =      "Sat May 27 07:54:15 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  series =       "IMA Vol. Math. Appl.",
  ZMnumber =     "0753.65036",
  abstract =     "[For the entire collection see Zbl 0741.00031.]
                 Author's summary: A brief survey of theory and software
                 implementations of interval and related techniques for
                 computing with machine representable sets is presented
                 with applications to computer aided proofs in analysis.
                 Recent work on variable precision software is
                 discussed",
  acknowledgement = ack-nhfb,
  classmath =    "*65G30 Interval and finite arithmetic",
  keywords =     "computer aided proof; interval arithmetic; survey;
                 variable precision software",
  reviewer =     "R.Anguelov (Bulawayo)",
}

@InCollection{Moore:1991:TMC,
  author =       "Ramon E. Moore",
  title =        "Interval tools for computer aided proofs in analysis",
  crossref =     "Meyer:1991:CAP",
  pages =        "??--??",
  year =         "1991",
  bibdate =      "Sat May 27 07:41:52 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
}

@InProceedings{Moore:1992:RMG,
  author =       "Ramon Moore and Eldon Hansen and Anthony Leclerc",
  title =        "Rigorous methods for global optimization",
  crossref =     "Floudas:1992:RAG",
  pages =        "321--342",
  year =         "1992",
  bibdate =      "Fri Sep 19 15:31:23 2003",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
}

@Article{Moore:1993:EGO,
  author =       "Ramon E. Moore",
  title =        "Erratum to: {``Global optimization to prescribed
                 accuracy'' [Comput.\ Math.\ Appl.\ \bf 21 (1991), no.\
                 6-7, 25--39; MR1096131 (91m:90159)]}",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "25",
  number =       "10--11",
  pages =        "187",
  year =         "1993",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(93)90292-4",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  MRclass =      "90C30 (65K10)",
  MRnumber =     "MR1213541 (94b:90074)",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  fjournal =     "Computers \& Mathematics with Applications. An
                 International Journal",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Moore:1993:RCM,
  author =       "R. E. Moore",
  title =        "The resolution of close minima",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "25",
  number =       "10--11",
  pages =        "57--58",
  month =        may # "\slash " # jun,
  year =         "1993",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(93)90281-Y",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Thu Dec 29 07:35:16 2011",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://www.sciencedirect.com/science/article/pii/089812219390281Y",
  abstract =     "Interval methods enable us to isolate nearby roots of
                 a function with a resolution that depends only on the
                 number of digits carried. A one-dimensional example
                 illustrates the point. Similar methods are available
                 for higher dimensional examples. The methods can be
                 applied to minimization problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
}

@Article{Moore:1994:NSD,
  author =       "R. E. Moore",
  title =        "Numerical solution of differential equations to
                 prescribed accuracy",
  journal =      j-COMPUT-MATH-APPL,
  volume =       "28",
  number =       "10--12",
  pages =        "253--261",
  month =        nov # "\slash " # dec,
  year =         "1994",
  CODEN =        "CMAPDK",
  DOI =          "https://doi.org/10.1016/0898-1221(94)00195-2",
  ISSN =         "0898-1221 (print), 1873-7668 (electronic)",
  ISSN-L =       "0898-1221",
  bibdate =      "Thu Dec 14 17:23:52 MST 1995",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  abstract =     "The basic ideas for numerical solution to differential
                 equations to prescribed accuracy is this: using set
                 methods (based on interval arithmetic) we can compute
                 rigorous upper and lower bounds to exact solutions. If
                 these bounds are not satisfactorily close together,
                 then we can do more computing until they are, carrying
                 more digits, or doing whatever the computer needs to do
                 to get the prescribed accuracy. A review of recent
                 results and a history of the invention of new types of
                 numbers for new types of problems are presented.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
                 Columbus, OH, USA",
  classification = "B0290P (Differential equations); C1160
                 (Combinatorial mathematics); C4170 (Differential
                 equations); C7310 (Mathematics computing)",
  fjournal =     "Computers and Mathematics with Applications",
  journal-URL =  "http://www.sciencedirect.com/science/journal/08981221",
  keywords =     "Accuracy; Computing; Differential equations; Digits;
                 History; Interval arithmetic; Lower bounds; Numerical
                 solution; Upper bounds",
  pubcountry =   "UK",
  thesaurus =    "Differential equations; Digital arithmetic; History;
                 Mathematics computing; Number theory; Numerical
                 analysis",
  xxauthor =     "N. E. Moore",
}

@Article{Bird:1995:AAA,
  author =       "B. R. Bird and C. Brotman and R. Case and G. Dudley
                 and R. E. Moore and M. Peters",
  title =        "Advances in {APPN} architecture",
  journal =      j-IBM-SYS-J,
  volume =       "34",
  number =       "3",
  pages =        "430--451",
  year =         "1995",
  CODEN =        "IBMSA7",
  ISSN =         "0018-8670",
  bibdate =      "Tue Mar 19 17:38:46 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  URL =          "http://www.research.ibm.com/journal/sj34-3.html#seven",
  abstract =     "In this paper, we discuss the evolving environment and
                 requirements for the Advanced Peer-to-Peer Networking*
                 (APPN*) architecture and the accommodation of these
                 changes in basic directory, topology, and configuration
                 services, as well as in application transport
                 capabilities. We use high-performance routing, a recent
                 APPN extension, as an example of the adaptation of the
                 architecture to emerging high-speed communication
                 facilities and the increasing trend to multiprotocol
                 networks. Finally, we discuss some extensions to
                 switched support and network management in APPN and
                 speculate on possible future considerations.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Networking Hardware Div., Research Triangle Park,
                 NC, USA",
  classification = "B6210L (Computer communications); C5620 (Computer
                 networks and techniques); C5670 (Network performance)",
  fjournal =     "IBM Systems Journal",
  keywords =     "Advanced Peer-to-Peer Networking architecture;
                 Application transport; APPN architecture; High speed
                 communication; High-performance routing; IBM;
                 Multiprotocol networks; Network configuration services;
                 Network directory; Network management; Network
                 topology; Switched support",
  pubcountry =   "USA",
  thesaurus =    "Computer networks; IBM computers; Performance
                 evaluation; Protocols; Telecommunication network
                 routing",
  xxnote =       "Is this Ramon E. Moore?",
}

@Article{Moore:1999:D,
  author =       "R. E. Moore",
  title =        "The dawning",
  journal =      j-RELIABLE-COMPUTING,
  volume =       "5",
  pages =        "423--424",
  year =         "1999",
  CODEN =        "RCOMF8",
  ISSN =         "1385-3139 (print), 1573-1340 (electronic)",
  ISSN-L =       "1385-3139",
  bibdate =      "Thu Jun 20 10:54:26 2002",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Reliable Computing = Nadezhnye vychisleniia",
  journal-URL =  "http://link.springer.com/journal/11155",
}

@Misc{Hansen:2001:EWR,
  author =       "Eldon Hansen and Bill Walster and Ray Moore and
                 others",
  title =        "Early works of {Ray Moore}",
  howpublished = "World-Wide Web document",
  month =        sep,
  year =         "2001",
  bibdate =      "Sat Sep 29 09:06:35 2001",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  note =         "From an announcement by R. Baker Kearfott {\tt
                 <rbk\penalty0@\penalty0louisiana.edu>} to the {\tt
                 reliable\_computing\penalty0@\penalty0interval.louisiana.edu}
                 list on Fri, 28 Sep 2001 19:56:51 -0500: ``Bill Walster
                 has collected the early works of Ray Moore and his
                 colleagues, has scanned them into electronic form, and
                 has obtained permission from the publishers to post
                 them. (Sun has sponsored this endeavor, including
                 paying copyright fees.) Eldon Hansen has written a
                 short introduction, that I have converted to HTML. This
                 HTML file contains links to the actual papers (in PDF
                 format), that you can access and read.''",
  URL =          "http://interval.louisiana.edu/Moores_early_papers/bibliography.html",
  acknowledgement = ack-nhfb,
}

@Article{Moore:2002:SSF,
  author =       "Ramon E. Moore",
  title =        "Sparse systems in fixed point form",
  journal =      j-RELIABLE-COMPUTING,
  volume =       "8",
  number =       "4",
  pages =        "249--265",
  year =         "2002",
  CODEN =        "RCOMF8",
  DOI =          "https://doi.org/10.1023/A:1016390830247",
  ISSN =         "1385-3139 (print), 1573-1340 (electronic)",
  ISSN-L =       "1385-3139",
  MRclass =      "65H10 (65G40)",
  MRnumber =     "MR1914593 (2003e:65089)",
  MRreviewer =   "M. A. Wolfe",
  bibdate =      "Sat May 27 07:54:15 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "0999.65040",
  abstract =     "(1) A method is shown for reducing dimension of sparse
                 systems of equations given in fixed point form.
                 Economic models provide examples.\par

                 (2) A given box to be searched for solutions can be
                 reduced using interval intersections.\par

                 (3) Interval Newton-like methods using either
                 derivatives or slopes can be applied to the reduced
                 system",
  acknowledgement = ack-nhfb,
  classmath =    "*65H10 Systems of nonlinear equations (numerical
                 methods) 65G30 Interval and finite arithmetic",
  fjournal =     "Reliable Computing. An International Journal Devoted
                 to Reliable Mathematical Computations Based on Finite
                 Representations and Guaranteed Accuracy",
  journal-URL =  "http://link.springer.com/journal/11155",
  keywords =     "dimension reduction; fixed point; interval Newton-like
                 methods; sparse systems",
}

@Article{Moore:2003:IAF,
  author =       "Ramon Moore and Weldon Lodwick",
  title =        "Interval analysis and fuzzy set theory",
  journal =      j-FUZZY-SETS-SYSTEMS,
  volume =       "135",
  number =       "1",
  pages =        "5--9",
  year =         "2003",
  CODEN =        "FSSYD8",
  DOI =          "https://doi.org/10.1016/S0165-0114(02)00246-4",
  ISSN =         "0165-0114 (print), 1872-6801 (electronic)",
  ISSN-L =       "0165-0114",
  MRclass =      "65G40 (03E72)",
  MRnumber =     "1977533",
  bibdate =      "Sat May 27 07:54:15 MDT 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "1015.03513",
  abstract =     "An overview of interval analysis, its development, and
                 its relationship to fuzzy set theory is given. Possible
                 areas of further fruitful research are highlighted",
  acknowledgement = ack-nhfb,
  classmath =    "*03E72 Fuzzy sets (logic) 65G40 General methods in
                 interval analysis",
  fjournal =     "Fuzzy Sets and Systems. An International Journal in
                 Information Science and Engineering",
  journal-URL =  "http://www.sciencedirect.com/science/journal/01650114",
  keywords =     "fuzzy interval analysis; fuzzy set theory; interval
                 analysis; validation methods",
}

@InProceedings{Moore:2005:ORR,
  author =       "Ramon E. Moore",
  title =        "Order Relations and Rigor in Computing",
  crossref =     "Haddad:2005:ACP",
  pages =        "1431--1433",
  year =         "2005",
  DOI =          "https://doi.org/10.1145/1066677.1067003",
  bibdate =      "Tue Oct 23 11:22:46 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  note =         "Keynote address.",
  abstract =     "Rigor in computing depends in many ways on the
                 integrity of order relations. Commonly used hardware
                 floating-point arithmetic can destroy that integrity.
                 An available remedy is discussed with examples.",
  acknowledgement = ack-nhfb,
  keywords =     "interval arithmetic",
}

@Article{Moore:2006:IRR,
  author =       "Ramon E. Moore",
  title =        "Introductory remarks on reliable engineering
                 computing",
  journal =      j-RELIABLE-COMPUTING,
  volume =       "12",
  number =       "6",
  pages =        "405--408",
  year =         "2006",
  CODEN =        "RCOMF8",
  DOI =          "https://doi.org/10.1007/s11155-006-9011-8",
  ISSN =         "1385-3139 (print), 1573-1340 (electronic)",
  ISSN-L =       "1385-3139",
  MRclass =      "65G30",
  MRnumber =     "2278780",
  bibdate =      "Tue Aug 24 19:17:39 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Reliable Computing. An International Journal Devoted
                 to Reliable Mathematical Computations Based on Finite
                 Representations and Guaranteed Accuracy",
  journal-URL =  "http://link.springer.com/journal/11155",
}

@Book{Moore:2007:CFA,
  author =       "Ramon E. Moore and Michael J. Cloud",
  title =        "Computational Functional Analysis",
  publisher =    pub-ELLIS-HORWOOD,
  address =      pub-ELLIS-HORWOOD:adr,
  edition =      "Second",
  pages =        "xii + 180",
  year =         "2007",
  ISBN =         "1-904275-24-9",
  ISBN-13 =      "978-1-904275-24-4",
  LCCN =         "????",
  bibdate =      "Wed Dec 27 14:41:26 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  price =        "US\$60",
  URL =          "http://www.horwoodpublishing.net/bookpage.php?id=110",
  acknowledgement = ack-nhfb,
  remark =       "See also first edition \cite{Moore:1985:CFA}.",
}

@Book{Moore:2009:IIA,
  author =       "Ramon E. Moore and R. Baker Kearfott and Michael J.
                 Cloud",
  title =        "Introduction to interval analysis",
  publisher =    pub-SIAM,
  address =      pub-SIAM:adr,
  pages =        "xii + 223",
  year =         "2009",
  ISBN =         "0-89871-669-1",
  ISBN-13 =      "978-0-89871-669-6",
  MRclass =      "65G40",
  MRnumber =     "2482682 (2010d:65106)",
  MRreviewer =   "G. Alefeld",
  bibdate =      "Mon Aug 23 19:25:57 2010",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/k/kearfott-r-baker.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  ZMnumber =     "1168.65002",
  abstract =     "The use of interval analysis has steadily increased
                 over the past 40 years. This development was taken into
                 account when writing the present book. It presents the
                 basics in real interval arithmetic and covers
                 elementary methods for verifying and enclosing zeros of
                 functions, global minimizers, solutions of integral and
                 differential equations. It deals with integration of
                 interval functions and shows how interval methods can
                 be applied in various fields of science. Moreover, an
                 introduction into the interval toolbox INTLAB of MATLAB
                 is given in order to understand the many programs which
                 realize the algorithms of the book. Numerous examples
                 illustrate the theory and are spread over more than 220
                 pages.\par

                 The book starts with a short introduction on the
                 necessity of enclosures and on bounding roundoff
                 errors. The interval number system is presented in
                 Chapter 2 including set theoretic operations as well as
                 order relations and operations for intervals, interval
                 vectors, and interval matrices. Some historical
                 references are added. Chapter 3 discusses the problem
                 of computing with inexact initial data and therefore
                 results in first applications of interval arithmetic.
                 It considers outwardly rounded interval arithmetic and
                 gives a first glance to INTLAB. Chapter 4 is devoted to
                 algebraic properties of interval arithmetic, to
                 symmetric intervals and to inclusion isotonicity.
                 Interval functions are introduced in Chapter 5
                 including elementary interval functions and
                 interval-valued extensions of real functions together
                 with fundamental properties.\par

                 The topological side of intervals and of interval
                 arithmetic is considered in Chapter 6. Equipped with
                 the Hausdorff metric the set of intervals turns out to
                 be a complete metric space for which convergence and
                 continuity can be defined in the usual way. Nested
                 interval sequences, finite convergence, refinement of
                 interval extensions, and various centered forms are
                 additional topics of this chapter which is concluded by
                 the Skelboe--Moore algorithm. This algorithm is a
                 prototype of a branch-and-bound algorithm applied in
                 global optimization. Interval matrices form the subject
                 of the succeeding Chapter 7, where linear systems with
                 inexact input data are also discussed. In this
                 connection the Krawczyk method is mentioned as well as
                 the interval Gauss--Seidel method and Gaussian
                 elimination.\par

                 Nonlinear equations are studied in Chapter 8. Here the
                 interval Newton method is commented, and cases are
                 presented which imply the necessity of an extended
                 interval arithmetic. For systems of nonlinear equations
                 the Krawczyk method and multivariate interval Newton
                 methods are applied and safe starting intervals are
                 defined. Chapter 9 is devoted to the integration of
                 interval functions, particularly of interval
                 polynomials since for sufficiently smooth functions $f$
                 a Taylor expansion is used to construct an enclosure
                 for $f$. Therefore, automatic differentiation and
                 automatic generation of Taylor coefficients are also
                 handled in order to find enclosures for definite
                 integrals -- also multiple ones -- over $f$. A short
                 chapter lists some ideas for verifying and enclosing
                 solutions of integral equations, initial value
                 problems, and boundary value problems. Some literature
                 for partial differential equations is added. The final
                 Chapter 11 gives a first impression of how the tool
                 `interval analysis' is applied in practice. Problems
                 are listed which use computer-assisted proofs based on
                 interval arithmetic. A prototypical algorithm is
                 discussed for global optimization. Numerous examples
                 from engineering are mentioned.\par

                 An appendix covers a variety of topics: Sets and
                 functions, a formulary for intervals, hints for
                 selected exercises, Internet resources, and INTLAB
                 commands and functions. More than 250 references
                 conclude a wonderful book which is written for all who
                 are interested in scientific computation, in its
                 reliability, and in automatic verification of
                 results.",
  acknowledgement = ack-nhfb,
  keywords =     "automatic differentiation; automatic verification of
                 results; boundary value problems; branch-and-bound
                 algorithm; computer-assisted proofs; convergence;
                 initial value problems; integral equations; interval
                 analysis; interval arithmetic; interval functions;
                 interval matrices; interval Newton method; interval
                 sequences; INTLAB; Krawczyk method; numerical examples;
                 roundoff errors; scientific computation; Skelboe--Moore
                 algorithm",
}

%%% ====================================================================
%%%    Part 2 (of 2): Publications about Ramon Moore and/or his works
@Article{Hansen:1967:BRB,
  author =       "Eldon Hansen",
  title =        "Book Review: {{\booktitle{Interval Analysis}} (Ramon
                 E. Moore)}",
  journal =      j-SIAM-REVIEW,
  volume =       "9",
  number =       "3",
  pages =        "610--612",
  month =        "????",
  year =         "1967",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1009099",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Thu Mar 27 09:05:48 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/9/3;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "July 1967",
}

@Article{Hull:1971:BRB,
  author =       "T. E. Hull",
  title =        "Book Review: {{\booktitle{Computation and Theory in
                 Ordinary Differential Equations}} (James W. Daniel and
                 Ramon E. Moore)}",
  journal =      j-SIAM-REVIEW,
  volume =       "13",
  number =       "3",
  pages =        "413--414",
  month =        "????",
  year =         "1971",
  CODEN =        "SIREAD",
  DOI =          "https://doi.org/10.1137/1013086",
  ISSN =         "0036-1445 (print), 1095-7200 (electronic)",
  ISSN-L =       "0036-1445",
  bibdate =      "Thu Mar 27 09:06:30 MDT 2014",
  bibsource =    "http://epubs.siam.org/toc/siread/13/3;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 https://www.math.utah.edu/pub/tex/bib/siamreview.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Review",
  journal-URL =  "http://epubs.siam.org/sirev",
  onlinedate =   "July 1971",
}

@Article{Kearfott:2016:PSI,
  author =       "R. Baker Kearfott",
  title =        "Preface [{Special} issue in honor of {Ray Moore},
                 1929--2015]",
  journal =      j-RELIABLE-COMPUTING,
  volume =       "23",
  pages =        "1",
  year =         "2016",
  CODEN =        "RCOMF8",
  ISSN =         "1573-1340",
  ISSN-L =       "1385-3139",
  MRclass =      "65-06 (65G30)",
  MRnumber =     "3538347",
  bibdate =      "Wed Oct 18 11:47:28 2023",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/k/kearfott-r-baker.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Reliable Computing",
  journal-URL =  "http://link.springer.com/journal/11155",
}

%%% ====================================================================
%%% These entries must come last because they are cross-referenced
%%% by others above.
@Proceedings{IEEE:1963:PNE,
  editor =       "{IEEE}",
  key =          "IEEE NEC'63",
  booktitle =    "{Proceedings of the National Electronics Conference
                 (McCormick Place, Chicago, Illinois October 28--30,
                 1963)}",
  title =        "{Proceedings of the National Electronics Conference
                 (McCormick Place, Chicago, Illinois October 28--30,
                 1963)}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xxvii + 797 + vii",
  year =         "1963",
  bibdate =      "Fri Jan 12 16:47:30 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
  keywords =     "Electronics -- Congresses.",
}

@Proceedings{Rall:1965:EDCa,
  editor =       "L. B. Rall",
  booktitle =    "Error in Digital Computation",
  title =        "Error in Digital Computation",
  volume =       "1",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "338",
  year =         "1965",
  MRclass =      "65.80",
  MRnumber =     "MR0189284 (32 \#6711)",
  MRreviewer =   "J. M. Ortega",
  bibdate =      "Tue Aug 15 18:20:34 MDT 1995",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Proceedings of an advanced seminar conducted by the
                 Mathematics Research Center, United States Army, at the
                 University of Wisconsin, Madison, October 5--7, 1964.",
  tableofcontents = "1. The problem of error in digital computation /
                 Todd \\
                 2. Techniques for automatic error monitoring and
                 control / Ashenhurst \\
                 3. The automatic analysis and control of error in
                 digital computing based on the use of interval numbers
                 / Moore \\
                 4. Error in digital solution of linear problems /
                 Albasiny \\
                 5. The propagation of error in the digital integration
                 of ordinary differential equations / Henrici \\
                 6. Bibliography on error in digital computation (114
                 pp.)",
}

@Proceedings{Rall:1965:EDCb,
  editor =       "L. B. Rall",
  booktitle =    "Error in Digital Computation",
  title =        "Error in Digital Computation",
  volume =       "2",
  publisher =    pub-WILEY,
  address =      pub-WILEY:adr,
  pages =        "288",
  year =         "1965",
  MRclass =      "65.80",
  MRnumber =     "MR0189284 (32 \#6711)",
  MRreviewer =   "J. M. Ortega",
  bibdate =      "Tue Aug 15 18:20:34 MDT 1995",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/w/wilkinson-james-hardy.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/y/young-david-m.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  note =         "Proceedings of an advanced seminar conducted by the
                 Mathematics Research Center, United States Army, at the
                 University of Wisconsin, Madison, October 5--7, 1964.",
  tableofcontents = "1. Experimental investigation of unnormalize1
                 arithmetic / Ashenhurst \\
                 2. Error bounds for computations with continued
                 fractions / Henrici \\
                 3. Error bounds for asymptotic expansions of special
                 functions in the complex plane / Olver \\
                 4. Error analysis for transformations based on the use
                 of matrices of the form $I -2 w w^H$. / Wilkinson \\
                 5. Automatic local coordinate transformations to reduce
                 the growth of error bounds in interval computation of
                 solutions of ordinary differential equations / Moore
                 \\
                 6. Differential inequalities and error bounds /
                 Schroder \\
                 7. Discrete representations of partial differential
                 operators / Young and Dauwalder \\
                 8. Upper and lower bounds for solutions of integral
                 equations / Brown \\
                 9. Convergence ana error bounds for approximate
                 solutions of integral and operator equations / Anselone
                 \\
                 10. Applications of functional analysis to error
                 estimation / Collatz \\
                 11. Error in the solution of linear programming
                 problems / Wolfe",
}

@Proceedings{Unger:1969:TFM,
  editor =       "Lothar Collatz und Heinz Unger",
  booktitle =    "{Tagung {\"u}ber Funktionalanalytische Methoden der
                 Numerischen Mathematik (1967: Mathematisches
                 Forschungsinstitut Oberwolfach) Funktionalanalytische
                 Methoden der numerischen Mathematik.
                 Vortragsausz{\"u}ge der Tagung {\"u}ber
                 funktionalanalytische Methoden der numerischen
                 Mathematik vom 19. bis 25. Nov. 1967 im Mathematischen
                 Forschungsinstitut Oberwolfach}",
  title =        "{Tagung {\"u}ber Funktionalanalytische Methoden der
                 Numerischen Mathematik (1967: Mathematisches
                 Forschungsinstitut Oberwolfach) Funktionalanalytische
                 Methoden der numerischen Mathematik.
                 Vortragsausz{\"u}ge der Tagung {\"u}ber
                 funktionalanalytische Methoden der numerischen
                 Mathematik vom 19. bis 25. Nov. 1967 im Mathematischen
                 Forschungsinstitut Oberwolfach}",
  publisher =    pub-BIRKHAUSER,
  address =      pub-BIRKHAUSER:adr,
  pages =        "143",
  year =         "1969",
  LCCN =         "QA297 .T3 1967aa",
  bibdate =      "Sat May 27 08:54:42 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{Alefeld:1980:FNC,
  editor =       "G. Alefeld and R. D. Grigorieff",
  booktitle =    "Fundamentals of numerical computation
                 (computer-oriented numerical analysis)",
  title =        "Fundamentals of numerical computation
                 (computer-oriented numerical analysis)",
  volume =       "2",
  publisher =    pub-SPRINGER-WIEN,
  address =      pub-SPRINGER-WIEN:adr,
  pages =        "v + 229",
  year =         "1980",
  CODEN =        "COSPDM",
  ISBN =         "0-387-81566-X",
  ISBN-13 =      "978-0-387-81566-4",
  ISSN =         "0344-8029",
  LCCN =         "QA297 .F84",
  bibdate =      "Wed Oct 13 18:45:11 1999",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  note =         "In cooperation with R. Albrecht, U. Kulisch, and F.
                 Stummel. ``Mainly a collection of the invited lectures
                 which were given during a conference \ldots{} held in
                 June 5--8, 1979, on the occasion of the centennial of
                 the Technical University of Berlin.''",
  series =       j-COMPUTING-SUPPLEMENTUM,
  acknowledgement = ack-nhfb,
}

@Proceedings{Nickel:1980:IMP,
  editor =       "Karl L. E. Nickel",
  title =        "{Interval mathematics 1980: proceedings of an
                 International Symposium on Interval Mathematics, held
                 at the Institut f{\"u}r Angewandte Mathematik,
                 Universit{\"a}t Freiburg i. Br., Germany, May 27--31,
                 1980}",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xv + 554",
  year =         "1980",
  ISBN =         "0-12-518850-1",
  ISBN-13 =      "978-0-12-518850-0",
  LCCN =         "QA297.75 .I57 1980",
  bibdate =      "Fri Dec 08 08:24:13 1995",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/g/gay-david-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
}

@Proceedings{IEEE:1984:PIC,
  editor =       "IEEE",
  booktitle =    "{Proceedings of the 23rd IEEE Conference on Decision
                 and Control, December 12--14, 1984, Las Vegas Hilton,
                 Las Vegas, Nevada}",
  title =        "{Proceedings of the 23rd IEEE Conference on Decision
                 and Control, December 12--14, 1984, Las Vegas Hilton,
                 Las Vegas, Nevada}",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "1776",
  year =         "1984",
  ISBN =         "????",
  ISBN-13 =      "????",
  LCCN =         "TJ217 .I17 1984",
  bibdate =      "Sat May 27 08:48:46 2006",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  note =         "Three volumes.",
  acknowledgement = ack-nhfb,
}

@Book{Moore:1988:RCR,
  editor =       "Ramon E. Moore",
  booktitle =    "Reliability in Computing: the Role of Interval Methods
                 in Scientific Computing",
  title =        "Reliability in Computing: the Role of Interval Methods
                 in Scientific Computing",
  volume =       "19",
  publisher =    pub-ACADEMIC,
  address =      pub-ACADEMIC:adr,
  pages =        "xv + 428",
  year =         "1988",
  ISBN =         "0-12-505630-3",
  ISBN-13 =      "978-0-12-505630-4",
  LCCN =         "QA76.9.E94 R45 1988",
  bibdate =      "Mon Dec 18 09:41:47 1995",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/c/cody-william-j.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/g/gay-david-m.bib;
                 https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib;
                 https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib;
                 https://www.math.utah.edu/pub/tex/bib/fortran2.bib;
                 https://www.math.utah.edu/pub/tex/bib/fparith.bib",
  series =       "Perspectives in computing",
  ZMnumber =     "0638.00033",
  acknowledgement = ack-nhfb,
  classmath =    "00Bxx Conference proceedings and collections of
                 papers; 65-06 Proceedings of conferences (numerical
                 analysis)",
  keywords =     "Computing; Interval methods; Reliability; Scientific
                 computing",
  tableofcontents = "Contributors / ix \\
                 Preface / xiii \\
                 Acknowledgments / xv \\
                 Part 1: Computer Arithmetic and Mathematical Software /
                 3 \\
                 Chapter 1. Arithmetic for Vector Processors / R.
                 Kirchner and U. Kulisch / 3 \\
                 Abstract \\
                 1. Introduction \\
                 2. The State of the Art \\
                 3. Fast Computation of Sums and Scalar Products \\
                 4. Summation with only One Row of Adders \\
                 5. Systems with Large Exponent Range and Further
                 Remarks \\
                 6. Application to Multiple Precision Arithmetic \\
                 7. Contemporary Floating-Point Arithmetic \\
                 8. Literature \\
                 Chapter 2. FORTRAN-SC, A FORTRAN Extension for
                 Engineering/Scientific Computation with Access to
                 ACRITH: Language Description with Examples / Wolfgang
                 Walter / 43 \\
                 Abstract \\
                 1. Introduction \\
                 2. Development of FORTRAN-SC \\
                 3. Main Language Concepts \\
                 4. Language Description with Examples \\
                 5. Implementation of FORTRAN-SC \\
                 References \\
                 Chapter 3. FORTRAN-SC, A FORTRAN Extension for
                 Engineering/Scientific Computation with Access to
                 ACRITH: Demonstration of the Compiler and Sample
                 Programs / Michael Metzger / 63 \\
                 Abstract \\
                 Introduction \\
                 Example 1: Interval Newton Method \\
                 Example 2: Automatic Differentiation \\
                 Example 3: Runge--Kutta Method \\
                 Example 4: Gaussian Elimination Method \\
                 Example 5: Verified Solution of a Linear System \\
                 References \\
                 Chapter 4. Reliable Expression Evaluation in PASCAL-SC
                 / J{\"u}rgen Wolff von Gudenberg / 81 \\
                 Abstract \\
                 1. Floating-point arithmetic \\
                 2. Interval arithmetic \\
                 3. The optimal scalar product \\
                 4. Complex floating-point and complex interval
                 arithmetic \\
                 5. Matrix and vector arithmetic \\
                 6. Accurate Operations and Problem Solving Routines \\
                 7. Transformation of arithmetic expressions \\
                 8. Solution of nonlinear systems \\
                 9. The data type dotprecision \\
                 10. Dotproduct expressions \\
                 11. Conclusion \\
                 References \\
                 Chapter 5. Floating-Point Standards --- Theory and
                 Practice / W. J. Cody / 99 \\
                 1. Introduction \\
                 2. The Standards \\
                 3. Implementations \\
                 4. Software Support \\
                 5. Conclusions \\
                 References \\
                 Chapter 6. Algorithms for Verified Inclusions: Theory
                 and Practice / Siegfried M. Rump / 109 \\
                 Summary \\
                 0. Introduction \\
                 1. Basic theorems \\
                 2. Practical verification on the computer \\
                 3. Interactive Programming Environment \\
                 4. References \\
                 Chapter 7. Applications of Differentiation Arithmetic /
                 George F. Corliss / 127 \\
                 Abstract \\
                 1. Differentiation Arithmetic \\
                 Why, What, and How? \\
                 2. Why? \\
                 Motivation \\
                 3. What? \\
                 Component tools \\
                 4. Conditions on f \\
                 5. How to use it? \\
                 Applications \\
                 6. Acknowledgements \\
                 References \\
                 Part 2: Linear and Nonlinear Systems / 149 \\
                 Chapter 8. Interval Acceleration of Convergence / Karl
                 Nickel / 151 \\
                 Abstract \\
                 1. Introduction \\
                 2. Examples \\
                 3. Definitions and Notation \\
                 4. Interval Methods \\
                 5. How Can We Get Bounds on a Given Point-Sequence? \\
                 6. Acceleration of Convergence \\
                 References \\
                 Chapter 9. Solving Systems of Linear Interval Equations
                 / J. Rohn / 171 \\
                 0. Introduction \\
                 1. Bounding the solutions \\
                 2. Computing the xy's \\
                 3. Explicit formulae for x, x \\
                 4. Inverse interval matrix \\
                 References \\
                 Chapter 10. Interval Least Squares --- a Diagnostic
                 Tool / David M. Gay / 183 \\
                 Introduction \\
                 Linearity \\
                 Interval Notation \\
                 Chapter 11. Existence of Solutions and Iterations for
                 Nonlinear Equations / G. Alefeld / 207 \\
                 Chapter 12. Interval Method for Algebraic Equations /
                 M. A. Wolfe / 229 \\
                 Chapter 13. Error Questions in the Computation of
                 Solution Manifolds of Parametrized Equations / Werner
                 C. Rheinbolt / 249 \\
                 Chapter 14. The Enclosure of Solutions of
                 Parameter-Dependent Systems of Equations / A. Neumaier
                 / 269 \\
                 Part 3. Optimization / 287 \\
                 Chapter 15. An Overview of Global Optimization Using
                 Interval Analysis / Eldon Hansen / 289 \\
                 Chapter 16. Philosophy and Practicalities of Interval
                 Arithmetic / G. William Walster / 309 \\
                 Chapter 17. Some Recent Aspects of Interval Algorithms
                 for Global Optimization / Helmut Ratschek / 325 \\
                 Chapter 18. The Use of Interval Arithmetic in
                 Uncovering Structure of Linear Systems / Weldon A.
                 Lodwick / 341 \\
                 Part 4. Operator Equations / 355 \\
                 Chapter 19. The Role of Order in Computing / Garrett
                 Birkhoff / 357 \\
                 Chapter 20. Interval Methods for Operator Equations /
                 R. E. Moore and Shen Zuhe / 379 \\
                 Chapter 21. Boundary Implications for Stability
                 Properties: Present Status / J. Garloff and N. K. Bose
                 / 391 \\
                 Chapter 22. Validating Computation in a Function Space
                 / Edgar Kaucher and Willard L. Miranker / 403 \\
                 Epilogue: A Poem about My Life, by Daniel J. Langton /
                 427",
}

@Proceedings{Meyer:1991:CAP,
  editor =       "Kenneth R. (Kenneth Ray) Meyer and Dieter S. Schmidt",
  booktitle =    "Computer aided proofs in analysis",
  title =        "Computer aided proofs in analysis",
  volume =       "28",
  publisher =    pub-SV,
  address =      pub-SV:adr,
  pages =        "251",
  year =         "1991",
  ISBN =         "0-387-97426-1 (New York Berlin Heidelberg alk. paper)
                 3-540-97426-1",
  ISBN-13 =      "978-0-387-97426-2 (New York Berlin Heidelberg alk.
                 paper) 978-3-540-97426-0",
  LCCN =         "???? (Berlin Heidelberg New York: alk. paper)",
  bibdate =      "Sat Feb 24 15:01:45 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  series =       "The IMA volumes in mathematics and its applications",
  acknowledgement = ack-nhfb,
  keywords =     "Numerical analysis --- Data processing ---
                 Congresses.",
  remark =       "Proceedings of an IMA Participating Institutions (PI)
                 Conference held at the University of Cincinnati in
                 April 1989",
  tableofcontents = "Foreword. The conversion of a high order
                 programming language from floating-point arithmetic to
                 range arithmetic / Oliver Aberth \\
                 Sylvester's form of the resultant and the
                 matrix-triangularization subresultant PRS method /
                 Alkiviadis G. Akritas \\
                 Computing the Tsirelson space norm / Johnnie W. Baker,
                 Oberta A. Slotterbeck and Richard Aron \\
                 Floating-point systems for theorem proving / G.
                 Bohlender, J. Wolff von Gudenberg and W. L. Miranker \\
                 Computer algebra and indefinite integrals / Manuel
                 Bronstein \\
                 A computer-assisted approach to small-divisors problems
                 arising in Hamiltonian mechanics / Alessandra Celletti
                 and Luigi Chierchia \\
                 On a computer algebra aided proof in bifurcation theory
                 / Carmen Chicone and Marc Jacobs. MACSYMA program to
                 implement averaging using elliptic functions / Vincent
                 T. Coppola and Richard H. Rand \\
                 Validated anti-derivatives / George F. Corliss \\
                 A toolbox for nonlinear dynamics / Shannon Coffey
                 \ldots{} [et al.] \\
                 Computer assisted proofs of stability of matter / R. de
                 la Llave \\
                 Accurate strategies for K.A.M. bounds and their
                 implementation / R. de la Llave and D. Rana \\
                 A software tool for analysis in function spaces / J.-P.
                 Eckmann, A. Malaspinas and S. Oliffson Kamphorst \\
                 Equation solving by symbolic computation / Anthony C.
                 Hearn \\
                 Deciding a class of Euclidean geometry theorems with
                 Buchberger's algorithm / Bernhard Kutzler \\
                 Lie transform tutorial: II / Kenneth R. Meyer \\
                 Interval tools for computer aided proofs in analysis /
                 Ramon E. Moore \\
                 Tools for mathematical computation / L. B. Rall \\
                 Shadowing trajectories of dynamical systems / Tim Sauer
                 and James A. Yorke \\
                 Transformation to versal normal form / Dieter S.
                 Schmidt \\
                 Computer assisted lower bounds for atomic energies /
                 Luis A. Seco.",
}

@Proceedings{Floudas:1992:RAG,
  editor =       "Christodoulos A. Floudas and Panos M. Pardalos",
  title =        "Recent advances in global optimization",
  publisher =    pub-PRINCETON,
  address =      pub-PRINCETON:adr,
  pages =        "x + 633",
  year =         "1992",
  ISBN =         "0-691-08740-7 (hardback), 0-691-02527-4 (paperback)",
  ISBN-13 =      "978-0-691-08740-5 (hardback), 978-0-691-02527-8
                 (paperback)",
  LCCN =         "QA402.5 .R42 1992",
  bibdate =      "Fri Sep 19 15:28:59 2003",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  note =         "Papers presented at a conference held at Princeton
                 University, May 10--11, 1991.",
  series =       "Princeton series in computer science",
  acknowledgement = ack-nhfb,
}

@Proceedings{Haddad:2005:ACP,
  editor =       "Hisham M. Haddad and others",
  booktitle =    "{Applied computing 2005: proceedings of the 2005 ACM
                 Symposium on Applied Computing, Santa Fe, New Mexico,
                 USA, March 13--17, 2005}",
  title =        "{Applied computing 2005: proceedings of the 2005 ACM
                 Symposium on Applied Computing, Santa Fe, New Mexico,
                 USA, March 13--17, 2005}",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "xlvi + 1739 (two volumes)",
  year =         "2005",
  ISBN =         "1-58113-964-0",
  ISBN-13 =      "978-1-58113-964-8",
  LCCN =         "QA76.76.A65 S95 2005",
  bibdate =      "Tue Oct 23 11:29:00 2007",
  bibsource =    "https://www.math.utah.edu/pub/bibnet/authors/m/moore-ramon-e.bib",
  acknowledgement = ack-nhfb,
}