Entry Dooley:1994:CV from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Dooley:1994:CV,
  author =       "John F. Dooley and Daniel C. {St. Clair} and William
                 E. Bond",
  title =        "Computing $ \chi^2 $ values",
  journal =      j-SIGCSE,
  volume =       "26",
  number =       "1",
  pages =        "218--222",
  month =        mar,
  year =         "1994",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/191033.191124",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:24 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "Textbooks and courses on numerical algorithms contain
                 numerous examples which lead students to believe that
                 the algorithm of choice for computing the zeros of a
                 function f(x) is Newton's algorithm. In many of these
                 courses little or no time is spent in providing
                 students with ``real world'' experiences where Newton's
                 method fails. The work presented in this paper
                 describes a slow convergence problem encountered while
                 trying to use Newton to estimate values for the $
                 \chi^2 $ distribution. The problem occurred while the
                 authors were trying to implement a well-known machine
                 learning algorithm from the field of artificial
                 intelligence. The function being evaluated and the
                 convergence problem with Newton's method is described.
                 Numerical results are given that indicate that a hybrid
                 algorithm consisting of Newton and the nonderivative
                 bisection algorithm not only provides good results but
                 quickly and consistently converges.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries