Automatic differentiation with higher infinitesimals, or computational smooth infinitesimal analysis in Weil algebra
From MaRDI portal
(Redirected from Publication:831980)
Abstract: We propose an algorithm to compute the -ring structure of arbitrary Weil algebra. It allows us to do some analysis with higher infinitesimals numerically and symbolically. To that end, we first give a brief description of the (Forward-mode) automatic differentiation (AD) in terms of -rings. The notion of a -ring was introduced by Lawvere and used as the fundamental building block of smooth infinitesimal analysis and synthetic differential geometry. We argue that interpreting AD in terms of -rings gives us a unifying theoretical framework and modular ways to express multivariate partial derivatives. In particular, we can "package" higher-order Forward-mode AD as a Weil algebra, and take tensor products to compose them to achieve multivariate higher-order AD. The algorithms in the present paper can also be used for a pedagogical purpose in learning and studying smooth infinitesimal analysis as well.
Recommendations
Cites work
- scientific article; zbMATH DE number 48990 (Why is no real title available?)
- scientific article; zbMATH DE number 3625612 (Why is no real title available?)
- A purely functional computer algebra system embedded in Haskell
- Algebraic geometry over \(C^\infty \)-rings
- Beautiful differentiation
- General Jacobi identity revisited again
- Lazy multivariate higher-order forward-mode AD
- Using Algebraic Geometry
This page was built for publication: Automatic differentiation with higher infinitesimals, or computational smooth infinitesimal analysis in Weil algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831980)