Automatic Hessians by reverse accumulation

Research output: Contribution to journalArticlepeer-review

35 Citations (Scopus)
256 Downloads (Pure)

Abstract

Let n be the number of independent variables of a function f, and let W and S respectively be the time and space bounds for the joint evaluation of {f, f} using automatic differentiation with reverse accumulation. In this note, we examine an extension of the technique of reverse accumulation which allows the automatic extraction of the Hessian of f. The method allows the parallel evaluation of all rows of the Hessian matrix in about 2W time units and 3S space units on each of n processors, or sequential row-by-row evaluation in about 2nW time units and 3S space units on a single processor. The approach described here is intended for use with operator overloading (for example in Ada) and allows the conventional coding of the target function f.
Original languageEnglish
Pages (from-to)135-150
JournalIMA Journal of Numerical Analysis
Volume12
Issue number2
DOIs
Publication statusPublished - 1992

Fingerprint

Dive into the research topics of 'Automatic Hessians by reverse accumulation'. Together they form a unique fingerprint.

Cite this