Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7214
Title: The efficient computation of sparse Jacobian matrices using automaticdifferentiation
Authors: Coleman, Thomas F.
Verma, Arun
Keywords: computer science
technical report
Issue Date: Nov-1995
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1557
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.
URI: http://hdl.handle.net/1813/7214
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
95-1557.pdf357.81 kBAdobe PDFView/Open
95-1557.ps418.71 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us