Efficient Computation of Sparse Higher Derivative Tensors
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.
KeywordsAdjoints Algorithmic differentiation Coloring algorithm Higher derivative tensors Recursive coloring Sparsity
- 1.Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM (2008)Google Scholar
- 2.Naumann, U.: The Art of Differentiating Computer Programs: An Introduction to Algorithmic Differentiation, SE24 in Software, Environments and Tools. SIAM (2012)Google Scholar
- 5.Smith, R.C.: Uncertainty Quantification: Theory, Implementation, and Applications. SIAM (2013)Google Scholar
- 6.Christianson, B., Cox, M.: Automatic propagation of uncertainties. In: Bücker, M., Corliss, G., Naumann, U., Hovland, P., Norris, B. (eds.) Automatic Differentiation: Applications, Theory, and Implementations. LNCSE, vol. 50, pp. 47–58. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-28438-9_4CrossRefzbMATHGoogle Scholar
- 16.Gay, D.M.: More AD of nonlinear AMPL models: computing Hessian information and exploiting partial separability. In: Computational Differentiation: Applications, Techniques, and Tools, pp. 173–184. SIAM (1996)Google Scholar