Edge pushing is equivalent to vertex elimination for computing Hessians

DOI10.1137/1.9781611974690.CH11MaRDI QIDQ6539151FDOQ6539151

Authors: Mu Wang, Alex Pothen, Paul D. Hovland 

Publication date: 14 May 2024

Recommendations

• A new framework for the computation of Hessians
• Computing the sparsity pattern of Hessians using automatic differentiation
• Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
• On efficient Hessian computation using the edge pushing algorithm in Julia
• A polynomial-time algorithm for detecting directed axial symmetry in Hessian computational graphs

Mathematics Subject Classification ID

Numerical analysis (65-XX)

This page was built for publication: Edge pushing is equivalent to vertex elimination for computing Hessians

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