Sparse jacobian computation in automatic differentiation by static program analysis

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

Volumn 1503 LNCS, Issue , 1998, Pages 311-326

  Tadjouddine, M ^a   Eyssette, F ^a   Faure, C ^a  

^a INRIA   (France)

Author keywords

Abstract Interpretation; Big Step Operational Semantics; Copy Optimization; Must Alias Analysis

Indexed keywords

BENCHMARKING; FLOW GRAPHS; SEMANTICS;

ABSTRACT INTERPRETATIONS; ALIAS ANALYSIS; AUTOMATIC DIFFERENTIATION TOOL; AUTOMATIC DIFFERENTIATIONS; DATA DEPENDENCE GRAPHS; EXTRACT INFORMATIONS; OPERATIONAL SEMANTICS; STATIC PROGRAM ANALYSIS;

STATIC ANALYSIS;

EID: 84905060023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49727-7_19     Document Type: Conference Paper

References (28)

1. A. Aho, R. Sethi and J. Ullman. COMPILATEURS: Principes, techniques et outils. InterEditions, 1989.
2. U. Banerjee. Loop transformations for restructuring compilers: the foundations. Boston, Dordrecht, London: Kluwer, 1993.
3. Christian H. Bischof, Ali Bouaricha, Peyvand M. Khademi, and Jorge J. Moré. Computing gradients in large-scale optimization using Automatic Differentiation. Preprint MCS-P488-0195, Mathematics and Computer Science Division, Argonne National Laboratory, June 1995.
4. C. H. Bischof, L. ROH, and A. J. MAUER-OATS. ADIC: an extensible automatic differentiation tool for ANSI-C. Software-Practice and Experience, vol. 27(12), 1427-1456, December 1997.
5. Aart J.C. Bik and Harry A.G. Wijshoff. Automatic data structure selection and transformation for sparse matrix computations. IEEE Transactions on Parallel and Distributed Systems, 7(2):109-126, 1996.
6. Vasanth Balasundaram and Ken Kennedy. A Tehnique for summarizing Data Access and Its Use in Parallelism Enhancing Transformations. Proceedings of the SIGPLAN conference on PLDI, Juin 1989.
7. Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Symposium on Principles of Programming Languages, pages 238-252, 1977.
8. Béatrice Creusillet and François Irigoin. Exact vs. approximate array region analyses. In Languages and Compilers for Parallel Computing, August 1996.
9. David Callahan and Ken Kennedy. Analysis of Interprocedural side effects in a parallel programming environnement. Journal of Parallel and Distributed Computing, Juin 1988.
10. Thomas H. Colleman, and Jorge J. Moré. Estimation of sparse jacobian matrices and graph coloring problems. SIAM, Journal Numerical Analysis, Vol. 20, No. 1 February 1983.
11. Béatrice Creusillet Analyses de régions de tableaux et applications, Thèse de l'Ecole des Mines de Paris, 1996.
12. C. Faure, Y. Papegay. Odyssée Version 1.6. The language reference manual. Rapport Technique 211, INRIA, 1997.
13. A. Griewank, and G. Corlis. Automatic Differentiation of algorithms: theory, implementation and application. SIAM, 1991
14. R. Giering. Tangent Linear and adjoint model compiler, users manul. unpublished information, Max-Planck Institut für Meteorologie Hambourg, Germany, 1996.
15. A. Griewank, D. Juedes and J. Utke. ADOL-C, a package for the automatic differentiation of algorithms written in C/C++. ACM Transactions on Mathematical Software, 22(2), pp: 131-167, 1996.
16. A. Griewank and S. Reese. On the Calculation of Jacobian Matrices by the Markowitz Rule for Vertex Elimination. Preprint MCS-P27-0491, Mathematics and Computer Science Division, Argonne National Laboratory, October 1991.
17. U. Geitner, J. Utke and A. Griewank. Automatic Computation of Sparse Jacobians by Applying the Method of Newsam and Ramsdell. to appear in: Computational Differentiation, Proceedings of the Second International Workshop, M. Berz et.al.eds, SIAM, Philadelphia, 1996.
18. Laurent Hascöet. Specifications of Partita Analyses. Version 1.4, INRIA, 1995.
19. Paul Havlack and Ken Kennedy. An Implementation of Interprocedural Bounded regular Section analysis. CRPC-TR-90063-S, March 1991.
20. Cristoph W. Kessler On the Applicability of Program Comprehension Techniques to the Automatic Parallelization of sparse Matrix Computations. Fachbereich IV-Informatik, Universität Trier, D-54286 Trier, Germany, 1997.
21. Wayne Kelly, William Pugh, Evan Rosser, and Tatiana Shpeisman. Transitive Closure of Infinite Graphs and its Applications. University of Maryland Institute for Advanced Computer Studies Dept. of Computer Science, Univ. of Maryland, April 1994.
22. François Masdupuy. Array indices relational semantic analysis using rational cosets and trapezoids PhD thesis. Ecole polytechnique, France, 1993.
23. G. N. Newsam and J. D. Ramsdell. Estimation of Sparse Jacobian Matrices. SIAM J. Alg. Disc. Meth., vol.4(3), pp.404-417., 1983.
24. Sergio Pissanetsky. Sparse Matrix Technology. Academic Press, London 1984.
25. William Pugh and David Wonnacott. An Exact Method for Analysis of Value-based Array Data Dependences. Proc. of the Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing, June 1992.
26. Nicole Rostaing, Stéphane Dalmas, and André Galligo. Automatic differentiation in odyssé e. Tellus, 45A(5):558-568, 1993.
27. Robert Sedgewick. Algorithms. Adison-Wesley Publishing Company, 1984.
28. H. Zima and B. Chapman. Supercompilers for Parallel and Vector Computers. Addison-Wesley Publishing Company, 1991.