Pages that link to "Item:Q2743963"
From MaRDI portal
The following pages link to Some bounds on the complexity of gradients, Jacobians, and Hessians (Q2743963):
Displaying 15 items.
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- An energy error-based method for the resolution of the Cauchy problem in 3D linear elasticity (Q839271) (← links)
- Reduced-order models for parameter dependent geometries based on shape sensitivity analysis (Q846562) (← links)
- Matrix-free preconditioning using partial matrix estimation (Q855287) (← links)
- Verified predictions of shape sensitivities in wall-bounded turbulent flows by an adaptive finite-element method (Q1028256) (← links)
- Sub-sampled Newton methods (Q1739039) (← links)
- Efficient calculation of Jacobian and adjoint vector products in the wave propagational inverse problem using automatic differentiation (Q1971397) (← links)
- On sampling from a log-concave density using kinetic Langevin diffusions (Q2174987) (← links)
- On the determination of missing boundary data for solids with nonlinear material behaviors, using displacement fields measured on a part of their boundaries (Q2208619) (← links)
- Adjoint code generator (Q2267137) (← links)
- User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient (Q2280028) (← links)
- Higher order Langevin Monte Carlo algorithm (Q2326072) (← links)
- Graph models and their efficient implementation for sparse Jacobian matrix determination (Q2446302) (← links)
- Convergence of Newton-MR under Inexact Hessian Information (Q5148404) (← links)
- Computing the sparsity pattern of Hessians using automatic differentiation (Q5498686) (← links)
