Estimation of Sparse Jacobian Matrices

DOI10.1137/0604041zbMath0558.65030OpenAlexW2047121032MaRDI QIDQ3223806

G. N. Newsam, John D. Ramsdell

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

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

zbMATH Keywords

finite differencesgraph coloringminimal number of colourssparse Jacobian estimationsparse nonlinear equations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical differentiation (65D25)

Related Items

Graph models and their efficient implementation for sparse Jacobian matrix determination, Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation, Graph coloring in the estimation of sparse derivative matrices: Instances and applications, Adjoint code generator, Pattern graph for sparse Hessian matrix determination, DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices, The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices, CsegGraph: a graph colouring instance generator, Discrete Newton's method with local variations for solving large-scale nonlinear systems, Optimal direct determination of sparse Jacobian matrices, Estimation of sparse hessian matrices and graph coloring problems, Two-dimensional fully adaptive solutions of solid-solid alloying reactions

Cites Work

• On the Estimation of Sparse Hessian Matrices
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item