The computation of higher derivatives tensors is expensive even for adjoint algorithmic differentiation methods. In this work we introduce methods to exploit the symmetry and the sparsity structure of higher derivatives to considerably improve the efficiency of their computation. The proposed methods apply coloring algorithms to two-dimensional compressed slices of the derivative tensors. The presented work is a step towards feasibility of higher-order methods which might benefit numerical simulations in numerous applications of computational science and engineering.
CITATION STYLE
Deussen, J., & Naumann, U. (2019). Efficient Computation of Sparse Higher Derivative Tensors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11536 LNCS, pp. 3–17). Springer Verlag. https://doi.org/10.1007/978-3-030-22734-0_1
Mendeley helps you to discover research relevant for your work.