Exploiting sparsity in automatic differentiation on multicore architectures
From MaRDI portal
Publication:2913126
Recommendations
- Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation
- Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
- Computing sparse Hessians with automatic differentiation
- Efficient (partial) determination of derivative matrices via automatic differentiation
- scientific article; zbMATH DE number 992819
Cited in
(9)- Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme
- Automatic differentiation of C++ codes on emerging manycore architectures with Sacado
- Source-to-Source Automatic Differentiation of OpenMP Parallel Loops
- Computing the sparsity pattern of Hessians using automatic differentiation
- ColLaPack
- On the efficient computation of sparsity patterns for Hessians
- Lazy K-way linear combination kernels for efficient runtime sparse Jacobian matrix evaluations in C++
- scientific article; zbMATH DE number 140021 (Why is no real title available?)
- Sparse automatic differentiation for complex networks of differential-algebraic equations using abstract elementary algebra
This page was built for publication: Exploiting sparsity in automatic differentiation on multicore architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913126)