A differentiation-enabled Fortran 95 compiler

ACM Transactions on Mathematical Software

Volumn 31, Issue 4, 2005, Pages 458-474

  Naumann, Uwe ^a   Riehme, Jan ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Preaccumulation; Source transformation

Indexed keywords

ALGORITHMS; FUNCTIONS; GRAPH THEORY; ROBUSTNESS (CONTROL SYSTEMS); SEMANTICS; VECTORS;

CODE TRANSFORMATION; COMPUTATIONAL GRAPH; PREACCUMULATION; SOURCE TRANSFORMATION;

PROGRAM COMPILERS;

EID: 33745204829     PISSN: 00983500     EISSN: 00983500     Source Type: Journal    
DOI: 10.1145/1114268.1114270     Document Type: Article

References (33)

1. AHO, A., SETHI, R., AND ULLMAN, J. 1986. Compilers. Principles, Techniques, and Tools. Addison-Wesley, Reading, MA.
2. AVERIK, B., CARTER, R., AND MORE, J. 1991. The MINPACK-2 test problem collection (preliminary version). Tech. mem. ANL/MCS-TM-150. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL.
3. BALAY, S., BUSCHELMAN, K., GROPP, W., KAUSHIK, D., KNEPLEY, M., CURFMAN-MCINNES, L., SMITH, B., AND ZHANG, H. 2003. PETSc 2.0 users manual. Tech. rep. ANL-95/11 - revision 2.1.6. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL. Go online to http://www.mcs.anl.gov/petsc.
4. BENSON, S., MCINNES, L., AND MORÉ, J. 2000. TAO users manual. Tech. rep. ANL/MCS-TM-242, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL. Go online to www.mcs.anl.gov/tao.
5. BENSON, S. AND MORÉ, J. 2001. A limited memory variable metric algorithm for bound constrained minimization. Tech. rep. ANL/MCS-P909-0901. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL.
6. BERZ, M., BISCHOF, C., CORLISS, G., AND GRIEWANK, A., Eds. 1996. Computational Differentiation: Techniques, Applications, and Tools, Proceedings Series. SIAM Press, Philadelphia, PA.
7. BISCHOF, C., CARLE, A., KHADEMI, P., AND MAURER, A. 1996. The ADIFOR 2.0 system for automatic differentiation of Fortran 77 programs. IEEE Comp. Sci. Eng. 3, 3, 18-32.
8. BISCHOF, C., ROH, L., AND MAUER, A. 1997. ADIC - An extensible automatic differentiation tool for ANSI-C. Softw. Pract. Exper. 27, 12, 1427-1456.
9. COHEN, M., NAUMANN, U., AND RIEHME, J. 2003. Toward differentiation- enabled Fortran 95 compiler technology. In Proceedings of the 2003 ACM Symposium on Applied Computing. 143-147.
10. CORLISS, G., FAURE, C., GRIEWANK, A., HASCOET, L., AND NAUMANN, U., Eds. 2002. Automatic Differentiation of Algorithms - From Simulation to Optimization. Springer, New York, NY.
11. CORLISS, G. AND GRIEWANK, A., Eds. 1991. Automatic Differentiation: Theory, Implementation, and Application. Proceedings Series. SIAM Press, Philadelphia, PA.
12. CURTIS, A., POWELL, M., AND REID, J. 1974. On the estimation of sparse Jacobian matrices. J. Inst. Math. Appl. 13, 117-119.
13. FORTH, S., TADJOUDDINE, M., PRYCE, J., AND REID, J. 2004. Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding. ACM Trans. Math. Softw. 3, 30 (Sep.), 266-299.
14. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, CA.
15. GRIEWANK, A. 2000. Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation. Number 19 in Frontiers in Applied Mathematics. SIAM Press, Philadelphia, PA.
16. GRIEWANK, A. AND REESE, S. 1991. On the calculation of Jacobian matrices by the Markovitz rule. In Corliss and Griewank [1991], 126-135.
17. HASCOËT, L., NAUMANN, U., AND PASCUAL, V. 2004. TBR analysis in reverse-mode automatic differentiation. In Future Generation Computer Systems - Special Issue on Automatic Differentiation, M. Bücker, Ed. Elsevier, Amsterdam, The Netherlands.
18. HOPKINS, T. AND PHILLIPS, C. 1988. Numerical Methods in Practice Using the NAG Library. International Computer Science Series. Addison-Wesley, Reading, MA.
19. HOVLAND, P., NORRIS, B., AND SMITH, B. 2002. Making automatic differentiation truly automatic: Coupling PETSc with ADIC. In Computational Science-ICCS 2002, Proceedings of the International Conference on Computational Science, Amsterdam, The Netherlands, April 21-24, 2002. Part II, P. M. A. Sloot, C. J. K. Tan, J. J. Dongarra, and A. G. Hoekstra, Eds. Lecture Notes in Computer Science, vol. 2330. Springer, Berlin, Germany, 1087-1096.
20. MORÉ, J. 2001. Automatic differentiation tools in optimization software. In Corliss et al. [2002], 25-34.
21. NAUMANN, U. 2002. On optimal Jacobian accumulation for single-expression-use programs. Preprint ANL-MCS/P944-0402. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL.
22. NAUMANN, U. 2004. Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph. Math. Prog. 99, 3 (Apr.), 399-421.
23. NAUMANN, U. AND RIEHME, J. 2005. Computing adjoints with the NAGWare Fortran 95 compiler. In Automatic Differentiation: Applications, Theory, and Tools, H. Bücker, G. Corliss, P. Hovland, U. Naumann, and B. Norris, Eds. Lecture Notes in Computational Science and Engineering, vol. 50. Springer, Berlin, Germany, 159-169.
24. NEWSAM, G. AND RAMSDELL, J. 1983. Estimation of sparse Jacobian matrices. SIAM J. Alg. Dis. Meth. 4, 404-417.
25. ROE, P. 1981. Approximating Riemann solvers, parameter vectors, and difference schemes. J. Comp. Physics 43, 357-372.
26. TADJOUDDINE, M., FORTH, S., AND PRYCE, J. 2001. AD tools and prospects for optimal AD in CFD flux calculations. In Corliss et al. [2002], 255-261.
27. TADJOUDDINE, M., FORTH, S., PRYCE, J., AND REID, J. 2002. Performance issues for vertex elimination methods in computing Jacobians using automatic differentiation. In Computational Science -ICCS 2002, Proceedings of the International Conference on Computational Science, Amsterdam, The Netherlands, April 21-24, 2002. Part II, P. Sloot, C. Tan, J. Dongarra, and A. Hoekstra, Eds. Lecture Notes in Computer Science, vol. 2330. Springer, Berlin, Germany, 1077-1086.
28. THE NUMERICAL ALGORITHMS GROUP, 2000. NAG Fortran 90 library. Online documentation, Oxford, U.K., at http://www.nag.co.uk/numeric/FN/manual/html/ FNlibrarymanual.asp.
29. THE NUMERICAL ALGORITHMS GROUP, 2002. The NAG Fortran library manual, mark 20. Online documentation at http://www.nag.co.uk/numeric/f1/manual/html/ FLlibrarymanual.asp.
30. UTKE, J. 2005. Flattening basic blocks. In Automatic Differentiation: Applications, Theory, and Tools, H. Bücker, G. Corliss, P. Hovland, U. Naumann, and B. Norris, Eds. Lecture Notes in Computational Science and Engineering, vol. 50. Springer, Berlin, Germany, 121-133.
31. UTKE, J. AND NAUMANN, U. 2004a. Optimality-preserving elimination of linearities in Jacobian accumulation. Presentation at SIAM Workshop on Combinatorial Scientific Computing, San Francisco, February 2004. Article is under review for special issue on combinatorial scientific computing of the Electronic Transactions on Numerical Analysis (ETNA), dedicated to Professor Alan George.
32. UTKE, J. AND NAUMANN, U. 2004b. Separating language-dependent und independent tasks for the semantic transformation of numerical programs. In Software Engineering and Applications, M. Hamza, Ed. ACTA Press, Calgary, Alta., Canada (To appear).
33. WENGERT, R. 1964. A simple automatic derivative evaluation program. Comm. ACM 7, 463-464.