Accumulating Jacobians as chained sparse matrix products

DOI10.1007/s10107-002-0329-7zbMath1023.90053OpenAlexW2063346066WikidataQ57389652 ScholiaQ57389652MaRDI QIDQ1396835

Uwe Naumann, Andreas Griewank

Publication date: 13 July 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0329-7

zbMATH Keywords

dynamic programmingcombinatorial optimizationJacobianschained sparse matrix productsedge elimination in computational graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (4)

Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures ⋮ Optimal Jacobian accumulation is NP-complete ⋮ Higher-order reverse automatic differentiation with emphasis on the third-order ⋮ Adjoint Code Design Patterns

Uses Software

• ADIC

This page was built for publication: Accumulating Jacobians as chained sparse matrix products