Some numerical experiments with variable-storage quasi-Newton algorithms
Mathematical Programming: Series A and B
Recipes for adjoint code construction
ACM Transactions on Mathematical Software (TOMS)
Inverse Problem Theory and Methods for Model Parameter Estimation
Inverse Problem Theory and Methods for Model Parameter Estimation
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
Automatic sparsity detection implemented as a source-to-source transformation
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Hi-index | 0.00 |
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 model (TM2), corresponding derivative codes and a derivative-based optimisation routine. In calibration mode, we use first and second derivatives to estimate model parameters and their uncertainties from atmospheric observations and their uncertainties. In prognostic mode, we use first derivatives to map model parameters and their uncertainties onto prognostic quantities and their uncertainties. For the initial version of BETHY the corresponding derivative codes have been generated automatically by FastOpt's automatic differentiation (AD) tool Transformation of Algorithms in Fortran (TAF). From this point on, BETHY has been developed further within CCDAS, allowing immediate update of the derivative code by TAF. This yields, at each development step, both sensitivity information and systematic comparison with observational data meaning that CCDAS is supporting model development. The data assimilation activities, in turn, benefit from using the current model version. We describe generation and performance of the various derivative codes in CCDAS, i.e. reverse scalar (adjoint), forward over reverse (Hessian) as well as forward and reverse Jacobian plus detection of the Jacobian's sparsity.