Performance issues for vertex elimination methods in computing jacobians using automatic differentiation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2330 LNCS, Issue PART 2, 2002, Pages 1077-1086

  Tadjouddine, Mohamed ^a   Forth, Shaun A ^a   Pryce, John D ^a   Reid, John K ^b  

^a CRANFIELD UNIVERSITY   (United Kingdom)

^b JK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL FLUID DYNAMICS; DIGITAL ARITHMETIC; FORTRAN (PROGRAMMING LANGUAGE); CODES (SYMBOLS);

AUTOMATIC DIFFERENTIATION TOOL; AUTOMATIC DIFFERENTIATIONS; FLUX JACOBIANS; OUT-OF-ORDER EXECUTION; PERFORMANCE ISSUES; SOURCE TRANSFORMATION; STATE OF THE ART; VERTEX ELIMINATION;

CODES (SYMBOLS); PIPELINE CODES;

EID: 84886843523     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46080-2_113     Document Type: Conference Paper

References (18)

1. Griewank, A., Corliss, G.: Automatic Differentiation of Algorithms. SIAM, Philadelphia (1991).
2. Griewank, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM, Philadelphia (2000).
3. Corliss, G., Faure, C., Griewank, A., Hascöet, L., Naumann, U., eds.: Automatic Differentiation of Algorithms: From Simulation to Optimization. Springer (2002) (to appear).
4. Bischof, C., Carle, A., Khademi, P., Mauer, A.: ADIFOR 2.0: Automatic differentiation of Fortran 77 programs. IEEE Computational Science & Engineering 3 (1996) 18-32.
5. Faure, C., Papegay, Y.: Odysśee user's guide, version 1.7. Technical Report 0224, INRIA, Unit́e de Recherche, INRIA, Sophia Antipolis, 2004 Route des Lucioles, B.P. 93, 06902, Sophia Antipolis Cedex, France (1998) See http://www.inria.fr/safir/SAM/Odyssee/odyssee.html.
6. Giering, R., Kaminski, T.: Recipes for adjoint code construction. ACM Transactions on Mathematical Software 24 (1998) 437-474.
7. Tadjouddine, M., Forth, S.A., Pryce, J.D., Reid, J.K.: On the Implementation of AD using Elimination Methods via Source Transformation: Derivative code generation. AMOR Report 01/4, Cranfield University (RMCS Shrivenham), Swindon SN6 8LA, England (2001).
8. Tadjouddine, M., Pryce, J.D., Forth, S.A.: On the Implementation of AD using Elimination Methods via Source Transformation. AMOR Report 00/8, Cranfield University (RMCS Shrivenham), Swindon SN6 8LA, England (2000).
9. Parr, T., Lilly, J., Wells, P., Klaren, R., Illouz, M., Mitchell, J., Stanchfield, S., Coker, J., Zukowski, M., Flack, C.: ANTLR Reference Manual. Technical report, MageLang Institute's jGuru.com (2000) See http://www.antlr. org/doc/.
10. Griewank, A., Reese, S.: On the calculation of Jacobian matrices by the Markowitz rule. [1] 126-135.
11. Naumann, U.: Efficient Calculation of Jacobian Matrices by Optimized Application of the Chain Rule to Computational Graphs. PhD thesis, Technical University of Dresden (1999).
12. Naumann, U.: Elimination techniques for cheap Jaco bians. [3] 241-246.
13. Roe, P.L.: Approximate Riemann solvers, parameter vectors, and difference schemes. Journal of Computational Physics 43 (1981) 357-372.
14. Tadjouddine, M., Forth, S.A., Pryce, J.D.: AD tools and prospects for optimal AD in CFD flux Jacobian calculations. [3] 247-252.
15. der Wijngaart, R.F.V., Saphir, W.C.: On the efficacy of source code optimizations for cache-based processors. NAS Technical Report NAS-00-014, NASA (2000).
16. Goedecker, S., Hoisie, A.: Performance Optimization of Numerically Intensive Codes. SIAM Philadelphia (2001).
17. Knuth, D.E.: The Art of Computer Programming, Volume 1: Fundamental Algorithms. Adison-Wesley (1997).
18. Averick, B.M., Moŕe, J.J.: User guide for the MINPACK-2 test problem collection. Technical Memorandum ANL/MCS-TM-157, Argonne National Laboratory, Argonne, Ill. (1991) Also issued as Preprint 91-101 of the Army High Performance Computing Research Center at the University of Minnesota.