Jacobian sparsity detection using Bloom filters

DOI10.1080/10556788.2023.2285486MaRDI QIDQ7238763zbMATH OpenFDO

Authors Paul D. Hovland

Publication date 8 May 2026

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2023.2285486

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Cryptography (94A60)

Cites work

• A minimal code list
• CasADi: a software framework for nonlinear optimization and optimal control
• Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
• Detecting Jacobian sparsity patterns by Bayesian probing
• Efficient detection of Hessian matrix sparsity pattern
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Evaluating Derivatives
• Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
• Space/time trade-offs in hash coding with allowable errors
• Sparser Johnson-Lindenstrauss transforms
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

This page was built for publication: Jacobian sparsity detection using Bloom filters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238763)