Computing sparse Jacobian matrices optimally
From MaRDI portal
Recommendations
- Optimal direct determination of sparse Jacobian matrices
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- scientific article; zbMATH DE number 992820
- Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
- Detecting Jacobian sparsity patterns by Bayesian probing
Cited in
(15)- Accumulating Jacobians as chained sparse matrix products
- Detecting Jacobian sparsity patterns by Bayesian probing
- Efficient computation of Jacobian matrices for entropy stable summation-by-parts schemes
- Compact sparse symbolic Jacobian computation in large systems of ODEs
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- Optimal direct determination of sparse Jacobian matrices
- Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
- scientific article; zbMATH DE number 992820 (Why is no real title available?)
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- scientific article; zbMATH DE number 1101645 (Why is no real title available?)
- scientific article; zbMATH DE number 2151226 (Why is no real title available?)
- scientific article; zbMATH DE number 2160983 (Why is no real title available?)
- Pattern graph for sparse Hessian matrix
- Efficient estimation of sparse Jacobian matrices by differences
- General algorithm for analytical calculations of Jacobi matrix elements in sparse nonlinear programming problems
This page was built for publication: Computing sparse Jacobian matrices optimally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844220)
