Pages that link to "Item:Q4227925"
From MaRDI portal
The following pages link to Computing a sparse Jacobian matrix by rows and columns (Q4227925):
Displaying 10 items.
- Approximating Hessians in unconstrained optimization arising from discretized problems (Q645548) (← links)
- Graph models and their efficient implementation for sparse Jacobian matrix determination (Q2446302) (← links)
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices (Q2819230) (← links)
- Optimal direct determination of sparse Jacobian matrices (Q2867431) (← links)
- Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring (Q2885476) (← links)
- Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds (Q2958803) (← links)
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms (Q3439477) (← links)
- Pattern graph for sparse Hessian matrix determination (Q4685608) (← links)
- A generic framework for approximation analysis of greedy algorithms for star bicoloring (Q5085266) (← links)
