Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds
From MaRDI portal
Publication:2958803
DOI10.1007/978-3-319-30379-6_39zbMath1357.65030OpenAlexW2487852097MaRDI QIDQ2958803
Anik Saha, Shahadat Hossain, Daya Ram Gaur
Publication date: 3 February 2017
Published in: Mathematical and Computational Approaches in Advancing Modern Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-30379-6_39
Related Items
Uses Software
Cites Work
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Evaluating Derivatives
- A graph coloring algorithm for large scheduling problems
- Computing a sparse Jacobian matrix by rows and columns
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
- Unnamed Item
- Unnamed Item
- Unnamed Item