TY - JOUR
AU - Naumann, Uwe
AB -  The chain rule – fundamental to any kind of analytical differentiation - can be applied in various ways to computational graphs representing vector functions. These variants result in different operations counts for the calculation of the corresponding Jacobian matrices. The minimization of the number of arithmetic operations required for the calculation of the complete Jacobian leads to a hard combinatorial optimization problem. 
TI - Accumulating Jacobians as chained sparse matrix products
JF - Mathematical Programming
DO - 10.1007/s10107-002-0329-7
DA - 2003-03-01
UR - https://www.deepdyve.com/lp/springer-journals/accumulating-jacobians-as-chained-sparse-matrix-products-rPgxqR9KU0
SP - 555
EP - 571
VL - 95
IS - 3
DP - DeepDyve
ER -