Computing a sparse Jacobian matrix by rows and columns
From MaRDI portal
Publication:4227925
DOI10.1080/10556789808805700zbMath0915.65017OpenAlexW1972400398MaRDI QIDQ4227925
Trond Steihaug, A. K. M. Shahadat Hossain
Publication date: 16 June 1999
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805700
Symbolic computation and algebraic computation (68W30) Graph theory (including graph drawing) in computer science (68R10) Numerical differentiation (65D25)
Related Items (10)
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring ⋮ A generic framework for approximation analysis of greedy algorithms for star bicoloring ⋮ Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds ⋮ Approximating Hessians in unconstrained optimization arising from discretized problems ⋮ Graph models and their efficient implementation for sparse Jacobian matrix determination ⋮ Graph coloring in the estimation of sparse derivative matrices: Instances and applications ⋮ Pattern graph for sparse Hessian matrix determination ⋮ DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices ⋮ Optimal direct determination of sparse Jacobian matrices ⋮ Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
Cites Work
- Unnamed Item
- Automatic differentiation: techniques and applications
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Software for estimating sparse Jacobian matrices
- Estimation of sparse hessian matrices and graph coloring problems
- On the Estimation of Sparse Hessian Matrices
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
This page was built for publication: Computing a sparse Jacobian matrix by rows and columns
