On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs

DOI10.1080/10556788.2011.580745zbMATH Open1238.05259OpenAlexW2064315315MaRDI QIDQ2885481FDOQ2885481

Viktor Mosenkis, Uwe Naumann

Publication date: 23 May 2012

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2011.580745

Recommendations

• On lower bounds for optimal Jacobian accumulation
• scientific article; zbMATH DE number 1269473
• Using directed edge separators to increase efficiency in the determination of Jacobian matrices via automatic differentiation
• Accumulating Jacobians as chained sparse matrix products
• scientific article

zbMATH Keywords

edge eliminationvertex eliminationscarcitylinearized DAGminimal edge count

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Evaluating Derivatives
• Title not available (Why is that?)
• Computational differentiation: techniques, applications, and tools
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Computational Graphs and Rounding Error
• Optimal Jacobian accumulation is NP-complete
• A Note on the NP-Completeness of Vertex Elimination on Directed Graphs

Cited In (2)

• On lower bounds for optimal Jacobian accumulation
• Optimal Jacobian accumulation is NP-complete

This page was built for publication: On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs

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