Pages that link to "Item:Q1396835"
From MaRDI portal
The following pages link to Accumulating Jacobians as chained sparse matrix products (Q1396835):
Displaying 12 items.
- Optimality-preserving elimination of linearities in Jacobian accumulation (Q871161) (← links)
- Multiple vector-Jacobian products are cheap (Q1294605) (← links)
- Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph (Q1881041) (← links)
- Optimal Jacobian accumulation is NP-complete (Q2465656) (← links)
- An enhanced Markowitz rule for accumulating Jacobian matrices efficiently (Q2753120) (← links)
- Randomized heuristics for exploiting Jacobian scarcity (Q2885477) (← links)
- On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs (Q2885481) (← links)
- Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures (Q3174760) (← links)
- (Q3601079) (← links)
- Adjoint Code Design Patterns (Q4960944) (← links)
- Higher-order reverse automatic differentiation with emphasis on the third-order (Q5962714) (← links)
- A matrix-free exact Newton method (Q6498603) (← links)