Graph models and their efficient implementation for sparse Jacobian matrix determination

DOI10.1016/j.dam.2012.12.010zbMath1287.05155OpenAlexW1982429141MaRDI QIDQ2446302

Shahadat Hossain, Trond Steihaug

Publication date: 16 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.12.010

zbMATH Keywords

bipartite graphintersection graphpattern graphsparse matrix data structures

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Special matrices (15B99)

Related Items

Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds, Pattern graph for sparse Hessian matrix determination, DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices

Uses Software

• CsegGraph
• SparseMatrix
• DSJM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph partitioning models for parallel computing
• Graph coloring in the estimation of sparse derivative matrices: Instances and applications
• Optimal direct determination of sparse Jacobian matrices
• The university of Florida sparse matrix collection
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Estimation of Sparse Jacobian Matrices
• Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
• Evaluating Derivatives
• Computing a sparse Jacobian matrix by rows and columns
• The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives