Dual Numbers for Arbitrary Order Automatic Differentiation
F. Pe\~nu\~nuri, K. B. Cant\'un-Avila, R. Pe\'on-Escalante

TL;DR
This paper introduces DNAOAD, a Fortran framework that efficiently computes derivatives of arbitrary order using a non-nested dual number approach, significantly reducing memory usage and improving scalability for scientific computing.
Contribution
The paper presents a novel non-nested dual number implementation for arbitrary order automatic differentiation, overcoming scalability issues of existing nested approaches.
Findings
Reduces memory usage compared to nested dual number methods
Enables efficient high-order derivative computation
Suitable for high-performance scientific applications
Abstract
Dual numbers are a well-established tool for computing derivatives and constitute the basis of forward-mode automatic differentiation. While the theoretical framework for computing derivatives of arbitrary order is well understood, practical and scalable implementations remain limited. Existing approaches based on nested dual numbers, such as those used in modern high-level languages, suffer from severe memory growth and poor scalability as the derivative order increases. In this work, we introduce DNAOAD, a Fortran-based automatic differentiation framework capable of computing derivatives of arbitrary order using dual numbers with a direct, non-nested representation. By avoiding recursive data structures, DNAOAD significantly reduces memory usage and enables the efficient computation of derivatives of very high order, overcoming key scalability limitations of existing methods and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Numerical methods for differential equations
