Papers › Dual Numbers for Arbitrary Order Automatic Differentiation
Dual Numbers for Arbitrary Order Automatic Differentiation
F. Peñuñuri, K. B. Cantún-Avila, R. Peón-Escalante
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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 making it particularly well suited for high-performance scientific computing applications.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections