College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||Software for Estimating Sparse Jacobian Matrices|
|Authors: ||Coleman, Thomas F.|
More, Jorge J.
|Keywords: ||computer science|
|Issue Date: ||Jun-1982|
|Publisher: ||Cornell University|
|Abstract: ||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 to 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.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.