Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms

DOI10.1016/J.ENDM.2006.06.091MaRDI QIDQ3439477zbMATH OpenOpenAlexFDO

Authors

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.091

zbMATH Keywords

integer programminggraph coloringsparse Jacobian matrices

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Optimal direct determination of sparse Jacobian matrices
• Computing a sparse Jacobian matrix by rows and columns
• Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
• Computing sparse Jacobian matrices optimally
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

Cites work

• scientific article; zbMATH DE number 1456803 (Why is no real title available?)
• scientific article; zbMATH DE number 3430031 (Why is no real title available?)
• Computing a sparse Jacobian matrix by rows and columns
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• New methods to color the vertices of a graph
• Software for estimating sparse Jacobian matrices
• Sparse matrix test problems
• The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

Cited in

(8)

• Graph models and their efficient implementation for sparse Jacobian matrix determination
• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
• Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
• Computing sparse Jacobian matrices optimally
• Full and partial Jacobian computation vie graph coloring: Algorithms and applications.
• Optimal direct determination of sparse Jacobian matrices
• Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring
• An inexact combinatorial model for maximizing the number of discovered nonzero entries

Describes a project that uses

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms

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