Sep 2026· ACM Transactions on Mathematical Software· Vol 52, pp. 1 - 33· 0 citations· 89 references
TL;DR
This work extends the Oxford Parallel library for Structured mesh solvers (OPS) domain-specific language to compute derivatives using the reverse mode of AD, and focuses on adjoint-mode AD for structured mesh stencil applications.
Abstract
Derivatives are crucial for engineering and scientific applications like optimization and inverse problems. While finite difference approximations can estimate derivatives, they are computationally expensive and inaccurate. Algorithmic Differentiation (AD) provides an efficient and exact method to compute derivatives by treating computer programs as mathematical functions and applying the chain rule of calculus. Our work focuses on adjoint-mode AD for structured mesh stencil applications. We extend the Oxford Parallel library for Structured mesh solvers (OPS) domain-specific language to compute derivatives using the reverse mode of AD. OPS allows developers to express mesh algorithms from a high-level code targeting multiple hardware from the same source. Taking advantage of the domain-specific abstraction, the extension creates a compact adjoint tape at the level of computational loops and generates the platform-specific (OpenMP and CUDA) parallel implementations for the adjoint loops, using the user-provided primal and adjoint stencil-kernels. We differentiate three example applications written in OPS, demonstrating similar performance to the original applications on both CPUs and GPUs. On these applications, computing derivatives only took \(3.7{-}9.7x\) time (including the evaluation of the application) compared to the original applications, which is in line with state-of-the-art tools.
Ordinary differential equations (ODEs) underlie models in science and engineering, and many applications need derivatives of their solutions with respect to parameters. Ensembles of independent trajectories suit graphics processing units (GPUs), but current GPU software forces a trade-off: the fastest ensemble solvers...
In this work, we investigate implicit-explicit (IMEX) arbitrary high-order Deferred Correction (DeC) methods for the approximation of ordinary differential equations (ODEs). Such schemes are characterized by an iterative procedure that increases the order of accuracy by one at each iteration. More precisely, we study a...
Shape optimization of nonlinear membranes and non-Newtonian flow domains governed by the $p$-Laplace operator is hampered by the cost of an auxiliary linearised adjoint solve at every iteration. We show that this solve is unnecessary: a self-adjoint identity reduces the adjoint state to a multiple of the primal state...
Y. Yousfi· Latin American Journal of Ma...· 0 citations
As nonlinearity strengthens, the accuracy advantage of discretization-based constraints becomes increasingly pronounced, with smaller optimization errors compensating for the truncation errors, and the more complex the nonlinearity and boundary conditions, the greater the advantage of GNN over MLP.
Xing Guo, Hong-Wei Tang, Ze-Wei Meng et al.· 0 citations
Topology optimization (TopOpt) is a standard tool for structural conceptual design, providing optimal structures with great design freedom. However, it has a high computational costs due to the repeated evaluation of high-fidelity finite element models and frequently produces complex geometries that require extensive i...
Raul Rubio, À. Ferrer, J. A. Hernández et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.