Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
From MaRDI portal
Recommendations
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- Computing sparse Jacobian matrices optimally
- Optimal direct determination of sparse Jacobian matrices
- scientific article; zbMATH DE number 992820
Cites work
- A graph coloring algorithm for large scheduling problems
- Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring
- Computing a sparse Jacobian matrix by rows and columns
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Evaluating Derivatives
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- scientific article; zbMATH DE number 3639144 (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?)
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
Cited in
(6)- Graph models and their efficient implementation for sparse Jacobian matrix determination
- Computing sparse Jacobian matrices optimally
- Optimal direct determination of sparse Jacobian matrices
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- scientific article; zbMATH DE number 2151226 (Why is no real title available?)
- Pattern graph for sparse Hessian matrix
This page was built for publication: Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958803)