Search NASA⌕ Search

Engineering topics

Utke, J

Publications and source records attributed to Utke, J.

Using automatic differentiation in sensitivity analysis of nuclear simulatoin models.

Sensitivity analysis is an important tool in the study of nuclear systems. In our recent work, we introduced a hybrid method that combines sampling techniques with first-order sensitivity analysis to approximate the effects of uncertainty in parameters of a nuclear reactor simulation model. For elementary examples, the approach offers a substantial advantage (in precision, computational efficiency, or both) over classical methods of uncertainty quantification.

97 MATHEMATICS AND COMPUTING↗

Automatic differentiation of codes in nuclear engineering applications.

We discuss our experience in applying automatic differentiation (AD) to calculations in nuclear reactor applications. The document is intended as a guideline on how to apply AD to Fortran codes with significant legacy components; it is also a part of a larger research effort in uncertainty quantification using sampling methods augmented with derivative information. We provide a brief theoretical description of the concept of AD, explain the necessary changes in the code structure, and remark on possible ways to deal with non-differentiability. Numerical experiments were carried out where the derivative of a functional subset of the SAS4A/SASSYS code was computed in forward mode with several AD tools. The results are in good agreement with both the real and complex finite-difference approximations of the derivative.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

On the practical exploitation of scarsity.

Scarsity is the notion that the Jacobian J for a given function f: {Re}{sup n} {yields} {Re}{sup m} may have fewer than n {sup *} m degrees of freedom. A scarse J may be represented by a graph with a minimal edge count. So far, scarsity has been recognized only from a high-level application point of view, and no automatic exploitation has been attempted. We introduce an approach to recognize and use scarsity in computational graphs in a source transformation context. The goal is to approximate the minimal graph representation through a sequence of transformations including eliminations, reroutings, and normalizations, with a secondary goal of minimizing the transformation cost. The method requires no application-level insight and is implemented as a fully automatic transformation in OpenAD. This paper introduces the problem and a set of heuristics to approximate the minimal graph representation. We also present results on a set of test problems.

97 MATHEMATICS AND COMPUTING↗

Efficient higher-order derivatives of the hypergeometric function.

Various physics applications involve the computation of the standard hypergeometric function {sub 2}F{sub 1} and its derivatives. Because it is not an intrinsic in the common programming languages, automatic differentiation tools will either differentiate through the code that computes {sub 2}F{sub 1} if that code is available or require the user to provide a hand-written derivative code. We present options for the derivative computation in the context of an ionization problem and compare the approach implemented in the Diamant library to standard methods.

97 MATHEMATICS AND COMPUTING↗

A low rank approach to automatic differentiation.

This manuscript introduces a new approach for increasing the efficiency of automatic differentiation (AD) computations for estimating the first order derivatives comprising the Jacobian matrix of a complex large-scale computational model. The objective is to approximate the entire Jacobian matrix with minimized computational and storage resources. This is achieved by finding low rank approximations to a Jacobian matrix via the Efficient Subspace Method (ESM). Low rank Jacobian matrices arise in many of today's important scientific and engineering problems, e.g. nuclear reactor calculations, weather climate modeling, geophysical applications, etc. A low rank approximation replaces the original Jacobian matrix J (whose size is dictated by the size of the input and output data streams) with matrices of much smaller dimensions (determined by the numerical rank of the Jacobian matrix). This process reveals the rank of the Jacobian matrix and can be obtained by ESM via a series of r randomized matrix-vector products of the form: Jq, and J{sup T} {omega} which can be evaluated by the AD forward and reverse modes, respectively.

97 MATHEMATICS AND COMPUTING↗

OpenAD/F : a modular, open-source tool for automatic differentiation of Fortran codes.

The OpenAD/F tool allows the evaluation of derivatives of functions defined by a Fortran program. The derivative evaluation is performed by a Fortran code resulting from the analysis and transformation of the original program that defines the function of interest. OpenAD/F has been designed with a particular emphasis on modularity, flexibility, and the use of open source components. While the code transformation follows the basic principles of automatic differentiation, the tool implements new algorithmic approaches at various levels, for example, for basic block preaccumulation and call graph reversal. Unlike most other automatic differentiation tools, OpenAD/F uses components provided by the OpenAD framework, which supports a comparatively easy extension of the code transformations in a language-independent fashion. It uses code analysis results implemented in the OpenAnalysis component. The interface to the language-independent transformation engine is an XML-based format, specified through an XML schema. The implemented transformation algorithms allow efficient derivative computations utilizing locally optimized cross-country sequences of vertex, edge, and face elimination steps. Specifically, for the generation of adjoint codes, OpenAD/F supports various code reversal schemes with hierarchical checkpointing at the subroutine level. As an example from geophysical fluid dynamics a nonlinear time-dependent scalable, yet simple, barotropic ocean model is considered. OpenAD/F's reverse mode is applied to compute sensitivities of some of the model's transport properties with respect to gridded fields such as bottom topography as independent (control) variables.

54 ENVIRONMENTAL SCIENCES↗