Software for estimating sparse Jacobian matrices
Thomas F. Coleman, B. S. Garbow, Jorge J. Morè · ACM Transactions on Mathematical Software · 1984
In many nonlinear problems it is necessary to estimate the Jacobian matrix of a nonlinear mapping F. In large-scale problems the Jacobian of F is usually sparse, and then estimation by differences is attractive because the number of differences can be small compared with the dimension of the problem.For example, if the Jacobian matrix is banded, then the number of differences needed to estimate the Jacobian matrix is, at most, the width of the band.In this paper we describe a set of subroutines whose purpose is to estimate the Jacobian matrix of a mapping F with the least possible number of function evaluations.
Cited by 123 works. doi:10.1145/1271.1610 Open-access PDF
Authors
References
- Practical optimization
- On the Estimation of Sparse Jacobian Matrices
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
- Smallest-last ordering and clustering and graph coloring algorithms
- Estimation of Sparse Jacobian Matrices and Graph Coloring Problems
- FINDING THE BLOCK LOWER TRIANGULAR FORM OF A SPARSE MATRIX
- The Choice of Step Lengths When Using Differences to Approximate Jacobian Matrices
- On the Use of Sparse Matrix Approximation to the Jacobian in Integrating Large Sets of Ordinary Differential Equations