BibTeX
@PHDTHESIS{
         Speelpenning1980CFP,
       author = "B.~Speelpenning",
       month = "January",
       title = "Compiling Fast Partial Derivatives of Functions Given by Algorithms",
       address = "Urbana-Champaign, IL",
       school = "Department of Computer Science, University of Illinois at Urbana-Champaign",
       key = "Speelpenning1980CFP",
       abstract = "This is the author's doctoral thesis. It starts by comparing previous work in
         the area of symbolic differentiation of algorithms. Specifically it considers the work of Warner in
         1975, Joss in 1976 and Kedem in 1977. The conclusions reached in this discussion are that the work
         by Joss is the best in terms of improvement. The author proceeds to describe how Joss' work can
         be improved in terms of speed, accuracy and space. A package, Jake, is described which is a compiler
         that takes a Fortran 66 input definition of a function. This input is limited in that only one
         subroutine can be specified, and that certain Fortran 66 statements are disallowed. Jake is
         instructed on how to perform its task by directives within the subroutine. Timing results are
         provided on the performance of the code produced by Jake over those where finite differencing is
         used.",
       comment = "Char -- good stuff",
       keywords = "point algorithm; precompiler; numerical results.",
       referred = "[Monagan1996AIo], [Rall1996AIt].",
       year = "1980",
       ad_theotech = "Adjoint"
}