Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
DOI10.1080/10556789608805642zbMATH Open0879.68025OpenAlexW2025245525MaRDI QIDQ4354079FDOQ4354079
Authors: Christian H. Bischof, Peyvand M. Khademi, Ali Bouaricha, Alan Carle 
Publication date: 17 December 1997
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789608805642
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
Theory of software (68N99) Numerical methods for mathematical programming, optimization and variational techniques (65K99)
Cites Work
- Generalized descent for global optimization
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Estimation of Sparse Jacobian Matrices
- Software for estimating sparse Jacobian matrices
- Automatic differentiation of large sparse systems
- Title not available (Why is that?)
- Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
Cited In (15)
- Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme
- On the practical exploitation of scarsity
- Efficient (partial) determination of derivative matrices via automatic differentiation
- ADMIT-1
- Sparse automatic differentiation for complex networks of differential-algebraic equations using abstract elementary algebra
- TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME
- Computing the sparsity pattern of Hessians using automatic differentiation
- Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization
- Topology optimization in Bernoulli free boundary problems
- Exploiting sparsity in automatic differentiation on multicore architectures
- Title not available (Why is that?)
- 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
Uses Software
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)
