Estimation of Sparse Jacobian Matrices

DOI10.1137/0604041zbMath0558.65030MaRDI 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 differences; graph coloring; minimal number of colours; sparse Jacobian estimation; sparse nonlinear equations

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65H10: Numerical computation of solutions to systems of equations

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

65D25: Numerical differentiation

Related Items

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

Cites Work

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