The efficient computation of sparse Jacobian matrices using automaticdifferentiation
| dc.contributor.author | Coleman, Thomas F. | en_US |
| dc.contributor.author | Verma, Arun | en_US |
| dc.date.accessioned | 2007-04-23T18:05:06Z | |
| dc.date.available | 2007-04-23T18:05:06Z | |
| dc.date.issued | 1995-11 | en_US |
| dc.description.abstract | This paper is concerned with the efficient computation of sparse Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of a graph coloring technique, bi-coloring, to exploit the sparsity of the Jacobian matrix $J$ and thereby allow for the efficient determination of $J$ using AD software. We analyze both a direct scheme and a substitution process. We discuss the results of numerical experiments indicating significant practical potential of this approach. | en_US |
| dc.format.extent | 366397 bytes | |
| dc.format.extent | 428754 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1557 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7214 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | The efficient computation of sparse Jacobian matrices using automaticdifferentiation | en_US |
| dc.type | technical report | en_US |