论文信息 - Towards differentiation-enabled Fortran 95 compiler technology

Towards differentiation-enabled Fortran 95 compiler technology

We present a novel approach to generating derivative code for mathematical models implemented as Fortran 95 programs using Automatic Differentiation inside a compiler. This technique allows us to combine the advantages of both operator overloading and source transformation based tools for Automatic Differentiation. Furthermore, the compiler's infrastructure for syntactic, semantic, and static data flow analysis can be built on.

[1] M. Powell,et al. On the Estimation of Sparse Jacobian Matrices , 1974 .

[2] Martin C. Rinard,et al. Symbolic bounds analysis of pointers, array indices, and accessed memory regions , 2000, PLDI '00.

[3] John D. Ramsdell,et al. Estimation of Sparse Jacobian Matrices , 1983 .

[4] U. Naumann,et al. TBR Analysis in Reverse-Mode Automatic Differentiation , 2003 .

[5] Christian Bischof,et al. The ADIFOR 2.0 system for the automatic differentiation of Fortran 77 programs , 1997 .

[6] Christian Bischof,et al. Adifor 2.0: automatic differentiation of Fortran 77 programs , 1996 .

[7] Ulrich W. Kulisch,et al. C++ Toolbox for Verified Scientific Computing I: Basic Numerical Problems , 1997 .

[8] Uwe Naumann,et al. Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph , 2004, Math. Program..

[9] Andreas Griewank,et al. Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition , 2000, Frontiers in applied mathematics.

[10] B. M. Averick,et al. The MINPACK-2 test problem collection (preliminary version) , 1991 .

[11] Andreas Griewank,et al. Automatic Differentiation of Algorithms: From Simulation to Optimization , 2000, Springer New York.