An inexact combinatorial model for maximizing the number of discovered nonzero entries

DOI10.1137/1.9781611976229.4MaRDI QIDQ6539999zbMATH OpenFDO

Authors Mohammad Rostami, H. Martin Bücker

Publication date 15 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611976229.4

Mathematics Subject Classification ID

Combinatorics (05-XX) Numerical analysis (65-XX)

Recommendations

• Graph models and their efficient implementation for sparse Jacobian matrix determination
• Pattern graph for sparse Hessian matrix
• Detecting Jacobian sparsity patterns by Bayesian probing
• scientific article; zbMATH DE number 2151226
• Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms

This page was built for publication: An inexact combinatorial model for maximizing the number of discovered nonzero entries

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