The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
From MaRDI portal
Recommendations
- Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
- Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
- Computing a sparse Jacobian matrix by rows and columns
- Estimation of Sparse Jacobian Matrices
- Efficient (partial) determination of derivative matrices via automatic differentiation
Cited in
(29)- Some computational aspects of a group theoretic finite element approach to the buckling and postbuckling analyses of plates and shells of revolution
- Efficient calculation of Jacobian and adjoint vector products in the wave propagational inverse problem using automatic differentiation
- Automatic implementation of material laws: Jacobian calculation in a finite element code with TAPENADE
- Efficient computation of Jacobian matrices for entropy stable summation-by-parts schemes
- Compact sparse symbolic Jacobian computation in large systems of ODEs
- 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
- Optimal direct determination of sparse Jacobian matrices
- Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring
- Efficient Automatic Differentiation of Matrix Functions
- Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
- The independent set perturbation adjoint method: a new method of differentiating mesh-based fluids models
- scientific article; zbMATH DE number 992820 (Why is no real title available?)
- Estimation of Sparse Jacobian Matrices
- 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
- Computing a sparse Jacobian matrix by rows and columns
- Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
- Sparse automatic differentiation for complex networks of differential-algebraic equations using abstract elementary algebra
- Efficient Calculation of Sparse Jacobians
- scientific article; zbMATH DE number 2087173 (Why is no real title available?)
- A generic framework for approximation analysis of greedy algorithms for star bicoloring
- Computing the sparsity pattern of Hessians using automatic differentiation
- Solving nonlinear equations with the Newton-Krylov method based on automatic differentiation
- Computation of normal form coefficients of cycle bifurcations of maps by algorithmic differentiation
- JutulDarcy.jl -- a fully differentiable high-performance reservoir simulator based on automatic differentiation
- A derivative-free Levenberg-Marquardt method for sparse nonlinear least squares problems
- Matrix-free preconditioning using partial matrix estimation
This page was built for publication: The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389291)
