Pattern graph for sparse Hessian matrix
From MaRDI portal
Publication:4685608
Recommendations
- Efficient detection of Hessian matrix sparsity pattern
- Estimation of sparse hessian matrices and graph coloring problems
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- Computing the sparsity pattern of Hessians using automatic differentiation
- On the efficient computation of sparsity patterns for Hessians
Cites work
- A graph coloring algorithm for large scheduling problems
- ColPack, software for graph coloring and related problems in scientific computing
- Computing a sparse Jacobian matrix by rows and columns
- Computing sparse Jacobian matrices optimally
- Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Estimation of sparse hessian matrices and graph coloring problems
- Estimation of Sparse Jacobian Matrices
- Evaluating Derivatives
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- scientific article; zbMATH DE number 992821 (Why is no real title available?)
- scientific article; zbMATH DE number 3898623 (Why is no real title available?)
- scientific article; zbMATH DE number 3430031 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- On the Estimation of Sparse Hessian Matrices
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- Optimal direct determination of sparse Jacobian matrices
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
Cited in
(7)- Graph models and their efficient implementation for sparse Jacobian matrix determination
- On the efficient computation of sparsity patterns for Hessians
- A polynomial-time algorithm for detecting directed axial symmetry in Hessian computational graphs
- Estimation of sparse hessian matrices and graph coloring problems
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Efficient detection of Hessian matrix sparsity pattern
- An inexact combinatorial model for maximizing the number of discovered nonzero entries
This page was built for publication: Pattern graph for sparse Hessian matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685608)
