Algorithmic differentiation in Axiom
Pages 347 - 354
Abstract
This paper describes the design and implementation of an algorithmic differentiation framework in the Axiom computer algebra system. Our implementation works by transformations on Spad programs at the level of the typed abstract syntax tree -- Spad is the language for extending Axiom with libraries. The framework illustrates an algebraic theory of algorithmic differentiation, here only for Spad programs, but we suggest that the theory is general. In particular, if it is possible to define a compositional semantics for programs, we define the exact requirements for when a program can be algorithmically differentiated. This leads to a general algorithmic differentiation system, and is not confined to functions which compute with basic data types, such as floating point numbers.
References
[1]
The Axiom Computer Algebra System. http://www.axiom-developer.org/.
[2]
C. Bischof, A. Carle, G. Corliss, and A. Griewank. ADIFOR: Automatic differentiation in a source translator environment. In ISSAC'92: Papers from the international symposium on Symbolic and algebraic computation, pages 294--302, New York, NY, USA, 1992. ACM Press.
[3]
C.H. Bischof, L. Roh, and A.J. Mauer-Oats. ADIC: an extensible automatic differentiation tool for ANSI-C. Software -- Practice and Experience, 27(12):1427--1456, 1997.
[4]
P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In POPL'77: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 238--252, New York, NY, USA, 1977. ACM Press.
[5]
T. Daly. Axiom Volume 1: Tutorial. Lulu.com, 2005. ISBN: 978-1-4116-6597-2.
[6]
J.H. Davenport, P. Gianni, and B.M. Trager. Scratchpad's View of Algebra II: A Categorical View of Factorization. In ISSAC'91: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, pages 32--38, New York, NY, USA, 1991. ACM Press.
[7]
J.H. Davenport and B.M. Trager. Scratchpad's View of Algebra I: Basic Commutative Algebra. In DISCO'90: Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, pages 40--54, London, UK, 1990. Springer-Verlag.
[8]
C. Ehresmann. Les prolongements d'une variété différentiable. C.R. Acad. Sc. Paris, 233:598--600, 1951.
[9]
J. Gogeun, J. Thatcher, E. Wganer, and J. Wright. Initial Algebra Semantics and Continuous Algebra. Journal of the Association of Computing Machinery, 24(1):68--95, January 1977.
[10]
A. Griewank. Evaluating derivatives: principles and techniques of algorithmic differentiation. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
[11]
A. Griewank, D. Juedes, and J. Utke. Algorithm 755: ADOL-C: a package for the automatic differentiation of algorithms written in C/C++. ACM Trans. Math. Softw., 22(2):131--167, 1996.
[12]
I. Guessarian. Algebraic Semantics. Springer-Verlag, 1981.
[13]
R.D. Jenks and R.S. Sutor. AXIOM: The Scientific Computation System. Springer-Verlag, 1992.
[14]
M.B. Monagan and W.M. Neuenschwander. GRADIENT: algorithmic differentiation in Maple. In ISSAC'93: Proceedings of the 1993 international symposium on Symbolic and algebraic computation, pages 68--76, New York, NY, USA, 1993. ACM Press.
[15]
J.E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Proramming Language Theory. The MIT Press, 1977.
[16]
D. Villard and M.B. Monagan. ADrien: an implementation of automatic differentiation in Maple. In ISSAC'99: Proceedings of the 1999 international symposium on Symbolic and algebraic computation, pages 221--228, New York, NY, USA, 1999. ACM Press.
Recommendations
Rank axiom of modular supermatroids: A connection with directional DR submodular functions
AbstractA matroid has been one of the most important combinatorial structures since it was introduced by Whitney as an abstraction of linear independence. As an important property of a matroid, it can be characterized by several different (but ...
Semigroup Algorithmic Problems in Metabelian Groups
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingWe consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum'aki (2005): the Identity Problem (does a semigroup contain a neutral element?), the Group ...
A note on well-generated Boolean algebras in models satisfying Martin's axiom
A Boolean algebra B is well generated, if it has a well-founded sublattice L such that L generates B. Let B be a superatomic Boolean algebra. The rank of B (rk(B)) is defined to be the Cantor Bendixon rank of the Stone space X of B. For every i= . If a@_...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2007 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 29 July 2007
Check for updates
Author Tags
Qualifiers
- Article
Conference
ISSAC07: International Symposium on Symbolic and Algebraic Computation
July 29 - August 1, 2007
Ontario, Waterloo, Canada
Acceptance Rates
Overall Acceptance Rate 395 of 838 submissions, 47%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 187Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in