Pages that link to "Item:Q4354079"
From MaRDI portal
The following pages link to Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation (Q4354079):
Displaying 10 items.
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme (Q1868394) (← links)
- Topology optimization in Bernoulli free boundary problems (Q2363805) (← links)
- Efficient (partial) determination of derivative matrices via automatic differentiation (Q2847718) (← links)
- Exploiting Sparsity in Automatic Differentiation on Multicore Architectures (Q2913126) (← links)
- Implementation of sparse forward mode automatic differentiation with application to electromagnetic shape optimization (Q3096872) (← links)
- Computing Gradients in Large-Scale Optimization Using Automatic Differentiation (Q4354939) (← links)
- (Q4737845) (← links)
- Computing the sparsity pattern of Hessians using automatic differentiation (Q5498686) (← links)
- TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME (Q5692260) (← links)
