Now showing items 1-2 of 2

    • Automatic first- and second-order adjoints for truncated Newton 

      Naumann, Uwe; Maier, M.; Riehme, Jan; Christianson, B. (Polskie Towarzystwo Informatyczne, 2007)
      The analysis and modification of numerical programs in the context of generating and optimizing adjoint code automatically probably ranges among the technically and theoretically most challenging source transformation ...
    • An L-Attributed Grammar for Adjoint Code 

      Naumann, Uwe; Riehme, Jan (PTI, 2007)
      Gradients of high-dimensional functions can be computed efficiently and with machine accuracy by so-called adjoint codes. We present an L-attributed grammar for the single-pass generation of intraprocedural adjoint code ...