A C++ implementation of the discrete adjoint sensitivity analysis method for explicit adaptive Runge-Kutta methods enabled by automatic adjoint differentiation and SIMD vectorization
<|reference_start|>A C++ implementation of the discrete adjoint sensitivity analysis method for explicit adaptive Runge-Kutta methods enabled by automatic adjoint differentiation and SIMD vectorization: A C++ library for sensitivity analysis of optimisation problems involving ordinary differential equations (ODEs) enabled by automatic differentiation (AD) and SIMD (Single Instruction, Multiple data) vectorization is presented. The discrete adjoint sensitivity analysis method is implemented for adaptive explicit Runge-Kutta (ERK) methods. Automatic adjoint differentiation (AAD) is employed for efficient evaluations of products of vectors and the Jacobian matrix of the right hand side of the ODE system. This approach avoids the low-level drawbacks of the black box approach of employing AAD on the entire ODE solver and opens the possibility to leverage parallelization. SIMD vectorization is employed to compute the vector-Jacobian products concurrently. We study the performance of other methods and implementations of sensitivity analysis and we find that our algorithm presents a small advantage compared to equivalent existing software.<|reference_end|>
@article{martins2024a,
    title={A C++ implementation of the discrete adjoint sensitivity analysis method
  for explicit adaptive Runge-Kutta methods enabled by automatic adjoint
  differentiation and SIMD vectorization},
    author={Rui Martins, Evgeny Lakshtanov},
    journal={arXiv preprint arXiv:2410.01911},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.01911},
    primaryClass={math.NA cs.MS cs.NA}
}