Optimal direct determination of sparse Jacobian matrices
From MaRDI portal
Recommendations
- Computing a sparse Jacobian matrix by rows and columns
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- Efficient (partial) determination of derivative matrices via automatic differentiation
- Computing sparse Jacobian matrices optimally
- Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
Cites work
- Another look at graph coloring via propositional satisfiability
- Computing a sparse Jacobian matrix by rows and columns
- Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
- CsegGraph: a graph colouring instance generator
- Detecting Jacobian sparsity patterns by Bayesian probing
- Estimation of sparse hessian matrices and graph coloring problems
- Estimation of Sparse Jacobian Matrices
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Evaluating Derivatives
- Generalized descent for global optimization
- Global Continuation for Distance Geometry Problems
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- Inexact Quasi-Newton methods for sparse systems of nonlinear equations
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- New methods to color the vertices of a graph
- On the Estimation of Sparse Hessian Matrices
- On the Successive Projections Approach to Least-Squares Problems
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
Cited in
(14)- Detecting Jacobian sparsity patterns by Bayesian probing
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- Computing sparse Jacobian matrices optimally
- Efficient (partial) determination of derivative matrices via automatic differentiation
- Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- Computing a sparse Jacobian matrix by rows and columns
- scientific article; zbMATH DE number 1101645 (Why is no real title available?)
- scientific article; zbMATH DE number 2151226 (Why is no real title available?)
- Pattern graph for sparse Hessian matrix
- Efficient estimation of sparse Jacobian matrices by differences
- A derivative-free Levenberg-Marquardt method for sparse nonlinear least squares problems
This page was built for publication: Optimal direct determination of sparse Jacobian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867431)
