Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian
and Hessian matrices using either finite differences or automatic differentiation. Several …

A bibliography of automatic differentiation Page 325 A Bibliography of Automatic Differentiation
H. Martin Bücker1 and George F. Corliss2 1 Institute for Scientific Computing, RWTH Aachen …

We present a prototype of a Carbon Cycle Data Assimilation System (CCDAS), which is
composed of a terrestrial biosphere model (BETHY) coupled to an atmospheric transport …

In the thesis on hand we treat optimal control problems for implicitly discontinuous
dynamical processes. We give a general model formulation which includes implicitly given …

Structured automatic differentiation Structured automatic differentiation Abstract Differentiation
is one of the fundamental problems in numerical mathematics. The solution of many …

The first part of this thesis describes the further development of a dynamic global vegetation
model, LPJ, and its application to selected scientific questions. LPJ has been extended to …

The knowledge of sparsity information plays an important role in efficient determination of
sparse Jacobian matrices. In a recent work, we have proposed sparsity-exploiting …

Abstract An implementation of Automatic Sparsity Detection (ASD) as a new source-to-
source transformation is presented. Given a code for evaluation of a function, ASD …

A reduction in the computational work is possible if we do not require that the nonzeros of a
Jacobian matrix be determined directly. If a column or row partition is available, the …

A major dificulty in quickly computing Jacobians by Automatic Differentiation is to deal with
the nonzero structures of sparse matrices. We propose to detect the sparsity structure of …