Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
From MaRDI portal
Publication:4354079
Recommendations
- Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
- Exploiting sparsity in automatic differentiation on multicore architectures
- scientific article; zbMATH DE number 992819
- Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
- Efficient (partial) determination of derivative matrices via automatic differentiation
Cites work
- scientific article; zbMATH DE number 140022 (Why is no real title available?)
- Automatic differentiation of large sparse systems
- Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
- Estimation of Sparse Jacobian Matrices
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Generalized descent for global optimization
- Software for estimating sparse Jacobian matrices
Cited in
(15)- Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization
- scientific article; zbMATH DE number 2087173 (Why is no real title available?)
- Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
- Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme
- ADMIT-1
- Computing the sparsity pattern of Hessians using automatic differentiation
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- Efficient (partial) determination of derivative matrices via automatic differentiation
- Exploiting sparsity in automatic differentiation on multicore architectures
- Lazy K-way linear combination kernels for efficient runtime sparse Jacobian matrix evaluations in C++
- Implementation of partial separability in a source-to-source transformation AD tool
- Topology optimization in Bernoulli free boundary problems
- On the practical exploitation of scarsity
- Sparse automatic differentiation for complex networks of differential-algebraic equations using abstract elementary algebra
- TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME
This page was built for publication: Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354079)
