Matrix-Free Jacobian Chaining
<|reference_start|>Matrix-Free Jacobian Chaining: The efficient computation of Jacobians represents a fundamental challenge in computational science and engineering. Large-scale modular numerical simulation programs can be regarded as sequences of evaluations of in our case differentiable subprograms with corresponding elemental Jacobians. The latter are typically not available. Tangent and adjoint versions of the individual subprograms are assumed to be given as results of algorithmic differentiation instead. The classical (Jacobian) Matrix Chain Product problem is reformulated in terms of matrix-free Jacobian-matrix (tangents) and matrix-Jacobian products (adjoints), subject to limited memory for storing information required by latter. All numerical results can be reproduced using an open-source reference implementation.<|reference_end|>
@article{naumann2024matrix-free,
    title={Matrix-Free Jacobian Chaining},
    author={Uwe Naumann},
    journal={arXiv preprint arXiv:2406.11862},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.11862},
    primaryClass={cs.LG cs.CE}
}