Efficient detection of Hessian matrix sparsity pattern
From MaRDI portal
Publication:5268818
Recommendations
Cites work
- scientific article; zbMATH DE number 3430031 (Why is no real title available?)
- An efficient overloaded implementation of forward mode automatic differentiation in MATLAB
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- Detecting Jacobian sparsity patterns by Bayesian probing
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
Cited in
(8)- A polynomial-time algorithm for detecting directed axial symmetry in Hessian computational graphs
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- The hessian in funtion minization
- On efficient Hessian computation using the edge pushing algorithm in Julia
- On the efficient computation of sparsity patterns for Hessians
- scientific article; zbMATH DE number 1186889 (Why is no real title available?)
- Pattern graph for sparse Hessian matrix
- Estimation of sparse hessian matrices and graph coloring problems
This page was built for publication: Efficient detection of Hessian matrix sparsity pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268818)