Every numerical function evaluation can be represented as a directed acyclic graph (DAG), beginning at the initial input variable settings, and terminating at the output or corresponding function value(s). The "reverse mode" of automatic differentiation (AD) generates a "tape" which is a representation of this underlying DAG. In this work we illustrate that a directed edge separator in this underlying DAG can yield space and time efficiency gains in the application of AD. Use of directed edge separators to increase AD efficiency in different ways than proposed here has been suggested by other authors (Bischof and Haghighat, Hierarchical approaches to automatic differentiation. In: Berz M, Bischof C, Corliss G, Griewank A (eds) Computational differentiation: techniques, applications, and tools, SIAM, Philadelphia, PA, pp 83-94, 1996; Bücker and Rasch, ACM Trans Math Softw 29(4):440-457, 2003). In contrast to these previous works, our focus here is primarily on space. Furthermore, we explore two simple algorithms to find good directed edge separators, and show how these ideas can be applied recursively to great advantage. Initial numerical experiments are presented. © 2012 Springer-Verlag.
CITATION STYLE
Coleman, T. F., Xiong, X., & Xu, W. (2012). Using directed edge separators to increase efficiency in the determination of Jacobian matrices via automatic differentiation. In Lecture Notes in Computational Science and Engineering (Vol. 87 LNCSE, pp. 209–219). https://doi.org/10.1007/978-3-642-30023-3_19
Mendeley helps you to discover research relevant for your work.