Computing sparse Hessians with automatic differentiation
From MaRDI portal
Recommendations
- Computing the sparsity pattern of Hessians using automatic differentiation
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Efficient (partial) determination of derivative matrices via automatic differentiation
- On the efficient computation of sparsity patterns for Hessians
- scientific article; zbMATH DE number 1186889
Cited in
(17)- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- A new framework for the computation of Hessians
- scientific article; zbMATH DE number 3936369 (Why is no real title available?)
- Efficient (partial) determination of derivative matrices via automatic differentiation
- Monte-Carlo finite-volume methods in uncertainty quantification for hyperbolic conservation laws
- On the efficient computation of sparsity patterns for Hessians
- hess_pat
- Computing the sparsity pattern of Hessians using automatic differentiation
- Adjoint-Based Sensitivity Analysis in High-Temperature Fluid Flows with Paticipating Media
- scientific article; zbMATH DE number 5353265 (Why is no real title available?)
- Automatic differentiation: Parallel computation of function, gradient, and Hessian matrix
- scientific article; zbMATH DE number 1101645 (Why is no real title available?)
- Efficient detection of Hessian matrix sparsity pattern
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Exploiting sparsity in automatic differentiation on multicore architectures
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
- Improved Automatic Computation of Hessian Matrix Spectral Bounds
This page was built for publication: Computing sparse Hessians with automatic differentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549220)
