Computing a sparse Jacobian matrix by rows and columns

DOI10.1080/10556789808805700MaRDI QIDQ4227925zbMATH OpenOpenAlexFDO

Authors A. K. M. Shahadat Hossain, Trond Steihaug

Publication date 16 June 1999

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556789808805700

zbMATH Keywords

sparsityautomatic differentiationJacobian matrixgraph coloring problemnumerical differences

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Symbolic computation and algebraic computation (68W30) Numerical differentiation (65D25)

Recommendations

• Optimal direct determination of sparse Jacobian matrices
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
• Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
• The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation

Cites work

• scientific article; zbMATH DE number 53680 (Why is no real title available?)
• Automatic differentiation: techniques and applications
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Estimation of sparse hessian matrices and graph coloring problems
• On the Estimation of Sparse Hessian Matrices
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• Software for estimating sparse Jacobian matrices
• The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation

Cited in

(18)

• Pattern graph for sparse Hessian matrix
• Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
• A generic framework for approximation analysis of greedy algorithms for star bicoloring
• Accumulating Jacobians as chained sparse matrix products
• Graph models and their efficient implementation for sparse Jacobian matrix determination
• Efficient (partial) determination of derivative matrices via automatic differentiation
• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
• Detecting Jacobian sparsity patterns by Bayesian probing
• Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
• scientific article; zbMATH DE number 2151226 (Why is no real title available?)
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
• Approximating Hessians in unconstrained optimization arising from discretized problems
• Combining partial Jacobian computation and preconditioning. New heuristics, educational modules, and applications
• Graph coloring in the estimation of sparse derivative matrices: Instances and applications
• 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

This page was built for publication: Computing a sparse Jacobian matrix by rows and columns

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