Efficient Calculation of Sparse Jacobians

DOI10.1137/S1064827597316552MaRDI QIDQ4702365zbMATH OpenOpenAlexFDO

Authors John E. Tolsma, Paul I. Barton

Publication date 24 November 1999

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1064827597316552

zbMATH Keywords

automatic differentiationcommon subexpressionsJacobian evaluationsubgraph reduction

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Recommendations

• The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
• scientific article; zbMATH DE number 992828
• Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph
• Exploiting sparsity in automatic differentiation on multicore architectures

Cited in

(5)

• Efficient sensitivity analysis of large-scale differential-algebraic systems
• Accumulating Jacobians as chained sparse matrix products
• Efficient computation of Jacobian matrices for entropy stable summation-by-parts schemes
• Compact sparse symbolic Jacobian computation in large systems of ODEs
• scientific article; zbMATH DE number 1101645 (Why is no real title available?)

This page was built for publication: Efficient Calculation of Sparse Jacobians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702365)