Publication: Cheaper Jacobians by Simulated Annealing
Introduction
Applications
Tools
Research Groups
Workshops
Publications
   List Publications
   Advanced Search
   Info
   Add Publications
My Account
About

Cheaper Jacobians by Simulated Annealing

- Article in a journal -
 

Author(s)
Uwe Naumann

Published in
SIAM J. Opt.

Year
2002

Abstract
Jacobian matrices can be accumulated by applying the chain rule to vector functions given as computer programs in different orders resulting in varying operations counts while yielding identical results, up to round-off. The minimization of the number of operations performed leads to a computationally hard combinatorial optimization problem based on vertex elimination in computational graphs. This paper discusses Simulated Annealing as a method for generating nearly optimal Jacobian code.

AD Theory and Techniques
Code Optimization

BibTeX
@ARTICLE{
         Naumann2002CJb,
       abstract = "Jacobian matrices can be accumulated by applying the chain rule to vector functions
         given as computer programs in different orders resulting in varying operations counts while yielding
         identical results, up to round-off. The minimization of the number of operations performed leads to
         a computationally hard combinatorial optimization problem based on vertex elimination in
         computational graphs. This paper discusses Simulated Annealing as a method for generating nearly
         optimal Jacobian code.",
       ad_theotech = "Code Optimization",
       author = "Uwe Naumann",
       title = "Cheaper {J}acobians by {S}imulated {A}nnealing",
       journal = "SIAM J. Opt.",
       year = "2002",
       month = "March",
       volume = "13",
       number = "3",
       pages = "660--674"
}


back
  

Contact:
autodiff.org
Username:
Password:
(lost password)