Science.gov

Sample records for adjoint solution algorithm

  1. Optimal Multistage Algorithm for Adjoint Computation

    SciTech Connect

    Aupy, Guillaume; Herrmann, Julien; Hovland, Paul; Robert, Yves

    2016-01-01

    We reexamine the work of Stumm and Walther on multistage algorithms for adjoint computation. We provide an optimal algorithm for this problem when there are two levels of checkpoints, in memory and on disk. Previously, optimal algorithms for adjoint computations were known only for a single level of checkpoints with no writing and reading costs; a well-known example is the binomial checkpointing algorithm of Griewank and Walther. Stumm and Walther extended that binomial checkpointing algorithm to the case of two levels of checkpoints, but they did not provide any optimality results. We bridge the gap by designing the first optimal algorithm in this context. We experimentally compare our optimal algorithm with that of Stumm and Walther to assess the difference in performance.

  2. GPU-Accelerated Adjoint Algorithmic Differentiation.

    PubMed

    Gremse, Felix; Höfter, Andreas; Razik, Lukas; Kiessling, Fabian; Naumann, Uwe

    2016-03-01

    Many scientific problems such as classifier training or medical image reconstruction can be expressed as minimization of differentiable real-valued cost functions and solved with iterative gradient-based methods. Adjoint algorithmic differentiation (AAD) enables automated computation of gradients of such cost functions implemented as computer programs. To backpropagate adjoint derivatives, excessive memory is potentially required to store the intermediate partial derivatives on a dedicated data structure, referred to as the "tape". Parallelization is difficult because threads need to synchronize their accesses during taping and backpropagation. This situation is aggravated for many-core architectures, such as Graphics Processing Units (GPUs), because of the large number of light-weight threads and the limited memory size in general as well as per thread. We show how these limitations can be mediated if the cost function is expressed using GPU-accelerated vector and matrix operations which are recognized as intrinsic functions by our AAD software. We compare this approach with naive and vectorized implementations for CPUs. We use four increasingly complex cost functions to evaluate the performance with respect to memory consumption and gradient computation times. Using vectorization, CPU and GPU memory consumption could be substantially reduced compared to the naive reference implementation, in some cases even by an order of complexity. The vectorization allowed usage of optimized parallel libraries during forward and reverse passes which resulted in high speedups for the vectorized CPU version compared to the naive reference implementation. The GPU version achieved an additional speedup of 7.5 ± 4.4, showing that the processing power of GPUs can be utilized for AAD using this concept. Furthermore, we show how this software can be systematically extended for more complex problems such as nonlinear absorption reconstruction for fluorescence-mediated tomography.

  3. GPU-accelerated adjoint algorithmic differentiation

    NASA Astrophysics Data System (ADS)

    Gremse, Felix; Höfter, Andreas; Razik, Lukas; Kiessling, Fabian; Naumann, Uwe

    2016-03-01

    Many scientific problems such as classifier training or medical image reconstruction can be expressed as minimization of differentiable real-valued cost functions and solved with iterative gradient-based methods. Adjoint algorithmic differentiation (AAD) enables automated computation of gradients of such cost functions implemented as computer programs. To backpropagate adjoint derivatives, excessive memory is potentially required to store the intermediate partial derivatives on a dedicated data structure, referred to as the "tape". Parallelization is difficult because threads need to synchronize their accesses during taping and backpropagation. This situation is aggravated for many-core architectures, such as Graphics Processing Units (GPUs), because of the large number of light-weight threads and the limited memory size in general as well as per thread. We show how these limitations can be mediated if the cost function is expressed using GPU-accelerated vector and matrix operations which are recognized as intrinsic functions by our AAD software. We compare this approach with naive and vectorized implementations for CPUs. We use four increasingly complex cost functions to evaluate the performance with respect to memory consumption and gradient computation times. Using vectorization, CPU and GPU memory consumption could be substantially reduced compared to the naive reference implementation, in some cases even by an order of complexity. The vectorization allowed usage of optimized parallel libraries during forward and reverse passes which resulted in high speedups for the vectorized CPU version compared to the naive reference implementation. The GPU version achieved an additional speedup of 7.5 ± 4.4, showing that the processing power of GPUs can be utilized for AAD using this concept. Furthermore, we show how this software can be systematically extended for more complex problems such as nonlinear absorption reconstruction for fluorescence-mediated tomography.

  4. GPU-Accelerated Adjoint Algorithmic Differentiation

    PubMed Central

    Gremse, Felix; Höfter, Andreas; Razik, Lukas; Kiessling, Fabian; Naumann, Uwe

    2015-01-01

    Many scientific problems such as classifier training or medical image reconstruction can be expressed as minimization of differentiable real-valued cost functions and solved with iterative gradient-based methods. Adjoint algorithmic differentiation (AAD) enables automated computation of gradients of such cost functions implemented as computer programs. To backpropagate adjoint derivatives, excessive memory is potentially required to store the intermediate partial derivatives on a dedicated data structure, referred to as the “tape”. Parallelization is difficult because threads need to synchronize their accesses during taping and backpropagation. This situation is aggravated for many-core architectures, such as Graphics Processing Units (GPUs), because of the large number of light-weight threads and the limited memory size in general as well as per thread. We show how these limitations can be mediated if the cost function is expressed using GPU-accelerated vector and matrix operations which are recognized as intrinsic functions by our AAD software. We compare this approach with naive and vectorized implementations for CPUs. We use four increasingly complex cost functions to evaluate the performance with respect to memory consumption and gradient computation times. Using vectorization, CPU and GPU memory consumption could be substantially reduced compared to the naive reference implementation, in some cases even by an order of complexity. The vectorization allowed usage of optimized parallel libraries during forward and reverse passes which resulted in high speedups for the vectorized CPU version compared to the naive reference implementation. The GPU version achieved an additional speedup of 7.5 ± 4.4, showing that the processing power of GPUs can be utilized for AAD using this concept. Furthermore, we show how this software can be systematically extended for more complex problems such as nonlinear absorption reconstruction for fluorescence-mediated tomography

  5. Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

    NASA Technical Reports Server (NTRS)

    Nemec, Marian; Aftosmis, Michael J.

    2004-01-01

    Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented

  6. An Exact Dual Adjoint Solution Method for Turbulent Flows on Unstructured Grids

    NASA Technical Reports Server (NTRS)

    Nielsen, Eric J.; Lu, James; Park, Michael A.; Darmofal, David L.

    2003-01-01

    An algorithm for solving the discrete adjoint system based on an unstructured-grid discretization of the Navier-Stokes equations is presented. The method is constructed such that an adjoint solution exactly dual to a direct differentiation approach is recovered at each time step, yielding a convergence rate which is asymptotically equivalent to that of the primal system. The new approach is implemented within a three-dimensional unstructured-grid framework and results are presented for inviscid, laminar, and turbulent flows. Improvements to the baseline solution algorithm, such as line-implicit relaxation and a tight coupling of the turbulence model, are also presented. By storing nearest-neighbor terms in the residual computation, the dual scheme is computationally efficient, while requiring twice the memory of the flow solution. The scheme is expected to have a broad impact on computational problems related to design optimization as well as error estimation and grid adaptation efforts.

  7. Haydock's recursive solution of self-adjoint problems. Discrete spectrum

    NASA Astrophysics Data System (ADS)

    Moroz, Alexander

    2014-12-01

    Haydock's recursive solution is shown to underline a number of different concepts such as (i) quasi-exactly solvable models, (ii) exactly solvable models, (iii) three-term recurrence solutions based on Schweber's quantization criterion in Hilbert spaces of entire analytic functions, and (iv) a discrete quantum mechanics of Odake and Sasaki. A recurrent theme of Haydock's recursive solution is that the spectral properties of any self-adjoint problem can be mapped onto a corresponding sequence of polynomials {pn(E) } in energy variable E. The polynomials {pn(E) } are orthonormal with respect to the density of states n0(E) and energy eigenstate | E > is the generating function of {pn(E) } . The generality of Haydock's recursive solution enables one to see the different concepts from a unified perspective and mutually benefiting from each other. Some results obtained within the particular framework of any of (i) to (iv) may have much broader significance.

  8. Adjoint-Based Algorithms for Adaptation and Design Optimizations on Unstructured Grids

    NASA Technical Reports Server (NTRS)

    Nielsen, Eric J.

    2006-01-01

    Schemes based on discrete adjoint algorithms present several exciting opportunities for significantly advancing the current state of the art in computational fluid dynamics. Such methods provide an extremely efficient means for obtaining discretely consistent sensitivity information for hundreds of design variables, opening the door to rigorous, automated design optimization of complex aerospace configuration using the Navier-Stokes equation. Moreover, the discrete adjoint formulation provides a mathematically rigorous foundation for mesh adaptation and systematic reduction of spatial discretization error. Error estimates are also an inherent by-product of an adjoint-based approach, valuable information that is virtually non-existent in today's large-scale CFD simulations. An overview of the adjoint-based algorithm work at NASA Langley Research Center is presented, with examples demonstrating the potential impact on complex computational problems related to design optimization as well as mesh adaptation.

  9. The adjoint neutron transport equation and the statistical approach for its solution

    NASA Astrophysics Data System (ADS)

    Saracco, P.; Dulla, S.; Ravetto, P.

    2016-11-01

    The adjoint equation was introduced in the early days of neutron transport and its solution, the neutron importance, has been used for several applications in neutronics. The work presents at first a critical review of the adjoint neutron transport equation. Afterwards, the adjont model is constructed for a reference physical situation, for which an analytical approach is viable, i.e. an infinite homogeneous scattering medium. This problem leads to an equation that is the adjoint of the slowing-down equation, which is well known in nuclear reactor physics. A general closed-form analytical solution to such adjoint equation is obtained by a procedure that can be used also to derive the classical Placzek functions. This solution constitutes a benchmark for any statistical or numerical approach to the adjoint equation. A sampling technique to evaluate the adjoint flux for the transport equation is then proposed and physically interpreted as a transport model for pseudo-particles. This can be done by introducing appropriate kernels describing the transfer of the pseudo-particles in the phase space. This technique allows estimating the importance function by a standard Monte Carlo approach. The sampling scheme is validated by comparison with the analytical results previously obtained.

  10. Adjoint-operators and non-adiabatic learning algorithms in neural networks

    NASA Technical Reports Server (NTRS)

    Toomarian, N.; Barhen, J.

    1991-01-01

    Adjoint sensitivity equations are presented, which can be solved simultaneously (i.e., forward in time) with the dynamics of a nonlinear neural network. These equations provide the foundations for a new methodology which enables the implementation of temporal learning algorithms in a highly efficient manner.

  11. Adjoint eigenfunctions of temporally recurrent single-spiral solutions in a simple model of atrial fibrillation

    NASA Astrophysics Data System (ADS)

    Marcotte, Christopher D.; Grigoriev, Roman O.

    2016-09-01

    This paper introduces a numerical method for computing the spectrum of adjoint (left) eigenfunctions of spiral wave solutions to reaction-diffusion systems in arbitrary geometries. The method is illustrated by computing over a hundred eigenfunctions associated with an unstable time-periodic single-spiral solution of the Karma model on a square domain. We show that all leading adjoint eigenfunctions are exponentially localized in the vicinity of the spiral tip, although the marginal modes (response functions) demonstrate the strongest localization. We also discuss the implications of the localization for the dynamics and control of unstable spiral waves. In particular, the interaction with no-flux boundaries leads to a drift of spiral waves which can be understood with the help of the response functions.

  12. A three-dimensional finite-volume Eulerian-Lagrangian Localized Adjoint Method (ELLAM) for solute-transport modeling

    USGS Publications Warehouse

    Heberton, C.I.; Russell, T.F.; Konikow, L.F.; Hornberger, G.Z.

    2000-01-01

    This report documents the U.S. Geological Survey Eulerian-Lagrangian Localized Adjoint Method (ELLAM) algorithm that solves an integral form of the solute-transport equation, incorporating an implicit-in-time difference approximation for the dispersive and sink terms. Like the algorithm in the original version of the U.S. Geological Survey MOC3D transport model, ELLAM uses a method of characteristics approach to solve the transport equation on the basis of the velocity field. The ELLAM algorithm, however, is based on an integral formulation of conservation of mass and uses appropriate numerical techniques to obtain global conservation of mass. The implicit procedure eliminates several stability criteria required for an explicit formulation. Consequently, ELLAM allows large transport time increments to be used. ELLAM can produce qualitatively good results using a small number of transport time steps. A description of the ELLAM numerical method, the data-input requirements and output options, and the results of simulator testing and evaluation are presented. The ELLAM algorithm was evaluated for the same set of problems used to test and evaluate Version 1 and Version 2 of MOC3D. These test results indicate that ELLAM offers a viable alternative to the explicit and implicit solvers in MOC3D. Its use is desirable when mass balance is imperative or a fast, qualitative model result is needed. Although accurate solutions can be generated using ELLAM, its efficiency relative to the two previously documented solution algorithms is problem dependent.

  13. Adjoint-optimization algorithm for spatial reconstruction of a scalar source

    NASA Astrophysics Data System (ADS)

    Wang, Qi; Hasegawa, Yosuke; Meneveau, Charles; Zaki, Tamer

    2016-11-01

    Identifying the location of the source of passive scalar transported in a turbulent environment based on remote measurements is an ill-posed problem. A conjugate-gradient algorithm is proposed, and relies on eddy-resolving simulations of both the forward and adjoint scalar transport equations to reconstruct the spatial distribution of the source. The formulation can naturally accommodate measurements from multiple sensors. The algorithm is evaluated for scalar dispersion in turbulent channel flow (Reτ = 180). As the distance between the source and sensor increases, the accuracy of the source recovery deteriorates due to diffusive effects. Improvement in performance is demonstrated for higher Prantl numbers and also with increasing number of sensors. This study is supported by the National Science Foundation (Grant CNS 1461870).

  14. Comparison of Evolutionary (Genetic) Algorithm and Adjoint Methods for Multi-Objective Viscous Airfoil Optimizations

    NASA Technical Reports Server (NTRS)

    Pulliam, T. H.; Nemec, M.; Holst, T.; Zingg, D. W.; Kwak, Dochan (Technical Monitor)

    2002-01-01

    A comparison between an Evolutionary Algorithm (EA) and an Adjoint-Gradient (AG) Method applied to a two-dimensional Navier-Stokes code for airfoil design is presented. Both approaches use a common function evaluation code, the steady-state explicit part of the code,ARC2D. The parameterization of the design space is a common B-spline approach for an airfoil surface, which together with a common griding approach, restricts the AG and EA to the same design space. Results are presented for a class of viscous transonic airfoils in which the optimization tradeoff between drag minimization as one objective and lift maximization as another, produces the multi-objective design space. Comparisons are made for efficiency, accuracy and design consistency.

  15. Goal-oriented space-time adaptivity for transient dynamics using a modal description of the adjoint solution

    NASA Astrophysics Data System (ADS)

    Verdugo, Francesc; Parés, Núria; Díez, Pedro

    2014-08-01

    This article presents a space-time adaptive strategy for transient elastodynamics. The method aims at computing an optimal space-time discretization such that the computed solution has an error in the quantity of interest below a user-defined tolerance. The methodology is based on a goal-oriented error estimate that requires accounting for an auxiliary adjoint problem. The major novelty of this paper is using modal analysis to obtain a proper approximation of the adjoint solution. The idea of using a modal-based description was introduced in a previous work for error estimation purposes. Here this approach is used for the first time in the context of adaptivity. With respect to the standard direct time-integration methods, the modal solution of the adjoint problem is highly competitive in terms of computational effort and memory requirements. The performance of the proposed strategy is tested in two numerical examples. The two examples are selected to be representative of different wave propagation phenomena, one being a 2D bulky continuum and the second a 2D domain representing a structural frame.

  16. Self-adjoint extensions of the Dirac Hamiltonian in the magnetic-solenoid field and related exact solutions

    SciTech Connect

    Gavrilov, S.P.; Gitman, D.M.; Smirnov, A.A.

    2003-02-01

    We study solutions of Dirac equation in the field of Aharonov-Bohm solenoid and a collinear uniform magnetic field. On this base we construct self-adjoint extensions of the Dirac Hamiltonian using von Neumann's theory of deficiency indices. We reduce (3+1)-dimensional problem to (2+1)-dimensional one by a proper choice of spin operator. Then we study the problem doing a finite radius regularization of the solenoid field. We exploit solutions of the latter problem to specify boundary conditions in the singular case.

  17. Improved Chaff Solution Algorithm

    DTIC Science & Technology

    2009-03-01

    Programme de démonstration de technologies (PDT) sur l’intégration de capteurs et de systèmes d’armes embarqués (SISWS), un algorithme a été élaboré...technologies (PDT) sur l’intégration de capteurs et de systèmes d’armes embarqués (SISWS), un algorithme a été élaboré pour déterminer automatiquement...0Z4 2. SECURITY CLASSIFICATION (Overall security classification of the document including special warning terms if applicable .) UNCLASSIFIED

  18. A finite-volume Eulerian-Lagrangian localized adjoint method for solution of the advection-dispersion equation

    USGS Publications Warehouse

    Healy, R.W.; Russell, T.F.

    1993-01-01

    Test results demonstrate that the finite-volume Eulerian-Lagrangian localized adjoint method (FVELLAM) outperforms standard finite-difference methods for solute transport problems that are dominated by advection. FVELLAM systematically conserves mass globally with all types of boundary conditions. Integrated finite differences, instead of finite elements, are used to approximate the governing equation. This approach, in conjunction with a forward tracking scheme, greatly facilitates mass conservation. The mass storage integral is numerically evaluated at the current time level, and quadrature points are then tracked forward in time to the next level. Forward tracking permits straightforward treatment of inflow boundaries, thus avoiding the inherent problem in backtracking of characteristic lines intersecting inflow boundaries. FVELLAM extends previous results by obtaining mass conservation locally on Lagrangian space-time elements. -from Authors

  19. Mesh-free adjoint methods for nonlinear filters

    NASA Astrophysics Data System (ADS)

    Daum, Fred

    2005-09-01

    We apply a new industrial strength numerical approximation, called the "mesh-free adjoint method", to solve the nonlinear filtering problem. This algorithm exploits the smoothness of the problem, unlike particle filters, and hence we expect that mesh-free adjoints are superior to particle filters for many practical applications. The nonlinear filter problem is equivalent to solving the Fokker-Planck equation in real time. The key idea is to use a good adaptive non-uniform quantization of state space to approximate the solution of the Fokker-Planck equation. In particular, the adjoint method computes the location of the nodes in state space to minimize errors in the final answer. This use of an adjoint is analogous to optimal control algorithms, but it is more interesting. The adjoint method is also analogous to importance sampling in particle filters, but it is better for four reasons: (1) it exploits the smoothness of the problem; (2) it explicitly minimizes the errors in the relevant functional; (3) it explicitly models the dynamics in state space; and (4) it can be used to compute a corrected value for the desired functional using the residuals. We will attempt to make this paper accessible to normal engineers who do not have PDEs for breakfast.

  20. Adjoint Error Estimation for Linear Advection

    SciTech Connect

    Connors, J M; Banks, J W; Hittinger, J A; Woodward, C S

    2011-03-30

    An a posteriori error formula is described when a statistical measurement of the solution to a hyperbolic conservation law in 1D is estimated by finite volume approximations. This is accomplished using adjoint error estimation. In contrast to previously studied methods, the adjoint problem is divorced from the finite volume method used to approximate the forward solution variables. An exact error formula and computable error estimate are derived based on an abstractly defined approximation of the adjoint solution. This framework allows the error to be computed to an arbitrary accuracy given a sufficiently well resolved approximation of the adjoint solution. The accuracy of the computable error estimate provably satisfies an a priori error bound for sufficiently smooth solutions of the forward and adjoint problems. The theory does not currently account for discontinuities. Computational examples are provided that show support of the theory for smooth solutions. The application to problems with discontinuities is also investigated computationally.

  1. Introduction to Adjoint Models

    NASA Technical Reports Server (NTRS)

    Errico, Ronald M.

    2015-01-01

    In this lecture, some fundamentals of adjoint models will be described. This includes a basic derivation of tangent linear and corresponding adjoint models from a parent nonlinear model, the interpretation of adjoint-derived sensitivity fields, a description of methods of automatic differentiation, and the use of adjoint models to solve various optimization problems, including singular vectors. Concluding remarks will attempt to correct common misconceptions about adjoint models and their utilization.

  2. Nonlinear Self-Adjointness, Conservation Laws and Soliton-Cnoidal Wave Interaction Solutions of (2+1)-Dimensional Modified Dispersive Water-Wave System

    NASA Astrophysics Data System (ADS)

    Xia, Ya-Rong; Xin, Xiang-Peng; Zhang, Shun-Li

    2017-01-01

    This paper mainly discusses the (2+1)-dimensional modified dispersive water-wave (MDWW) system which will be proved nonlinear self-adjointness. This property is applied to construct conservation laws corresponding to the symmetries of the system. Moreover, via the truncated Painlevé analysis and consistent tanh-function expansion (CTE) method, the soliton-cnoidal periodic wave interaction solutions and corresponding images will be eventually achieved. Supported by National Natural Science Foundation of China under Grant Nos. 11371293, 11505090, the Natural Science Foundation of Shaanxi Province under Grant No. 2014JM2-1009, Research Award Foundation for Outstanding Young Scientists of Shandong Province under Grant No. BS2015SF009 and the Science and Technology Innovation Foundation of Xi’an under Grant No. CYX1531WL41

  3. On the adjoint operator in photoacoustic tomography

    NASA Astrophysics Data System (ADS)

    Arridge, Simon R.; Betcke, Marta M.; Cox, Ben T.; Lucka, Felix; Treeby, Brad E.

    2016-11-01

    Photoacoustic tomography (PAT) is an emerging biomedical imaging from coupled physics technique, in which the image contrast is due to optical absorption, but the information is carried to the surface of the tissue as ultrasound pulses. Many algorithms and formulae for PAT image reconstruction have been proposed for the case when a complete data set is available. In many practical imaging scenarios, however, it is not possible to obtain the full data, or the data may be sub-sampled for faster data acquisition. In such cases, image reconstruction algorithms that can incorporate prior knowledge to ameliorate the loss of data are required. Hence, recently there has been an increased interest in using variational image reconstruction. A crucial ingredient for the application of these techniques is the adjoint of the PAT forward operator, which is described in this article from physical, theoretical and numerical perspectives. First, a simple mathematical derivation of the adjoint of the PAT forward operator in the continuous framework is presented. Then, an efficient numerical implementation of the adjoint using a k-space time domain wave propagation model is described and illustrated in the context of variational PAT image reconstruction, on both 2D and 3D examples including inhomogeneous sound speed. The principal advantage of this analytical adjoint over an algebraic adjoint (obtained by taking the direct adjoint of the particular numerical forward scheme used) is that it can be implemented using currently available fast wave propagation solvers.

  4. Global Adjoint Tomography

    NASA Astrophysics Data System (ADS)

    Bozdag, Ebru; Lefebvre, Matthieu; Lei, Wenjie; Peter, Daniel; Smith, James; Komatitsch, Dimitri; Tromp, Jeroen

    2015-04-01

    We will present our initial results of global adjoint tomography based on 3D seismic wave simulations which is one of the most challenging examples in seismology in terms of intense computational requirements and vast amount of high-quality seismic data that can potentially be assimilated in inversions. Using a spectral-element method, we incorporate full 3D wave propagation in seismic tomography by running synthetic seismograms and adjoint simulations to compute exact sensitivity kernels in realistic 3D background models. We run our global simulations on the Oak Ridge National Laboratory's Cray XK7 "Titan" system taking advantage of the GPU version of the SPECFEM3D_GLOBE package. We have started iterations with initially selected 253 earthquakes within the magnitude range of 5.5 < Mw < 7.0 and numerical simulations having resolution down to ~27 s to invert for a transversely isotropic crust and mantle model using a non-linear conjugate gradient algorithm. The measurements are currently based on frequency-dependent traveltime misfits. We use both minor- and major-arc body and surface waves by running 200 min simulations where inversions are performed with more than 2.6 million measurements. Our initial results after 12 iterations already indicate several prominent features such as enhanced slab (e.g., Hellenic, Japan, Bismarck, Sandwich), plume/hotspot (e.g., the Pacific superplume, Caroline, Yellowstone, Hawaii) images, etc. To improve the resolution and ray coverage, particularly in the lower mantle, our aim is to increase the resolution of numerical simulations first going down to ~17 s and then to ~9 s to incorporate high-frequency body waves in inversions. While keeping track of the progress and illumination of features in our models with a limited data set, we work towards to assimilate all available data in inversions from all seismic networks and earthquakes in the global CMT catalogue.

  5. Inversion of Gravity Fields From the Spacecraft Orbital Data Using an Adjoint Operator Approach

    NASA Technical Reports Server (NTRS)

    Ustinov, E. A.

    1999-01-01

    In perturbation approximation, the forward problem of orbital dynamics (equations with initial conditions) is linear with respect to variations of coordinates and/or velocities of the spacecraft and to corresponding variations of the gravity field in the models used. The linear operator adjoint to the linear operator of such forward problem turns out to be instrumental in inversion of differences between observed and predicted coordinates/velocities in terms of the updates of harmonics in the initial gravity field model. Based on this approach, the solution of resulting adjoint problem of orbital dynamics can be used to directly evaluate the matrix of partial derivatives of observable differences with respect to the gravity field harmonics. General discussion of the adjoint problem of orbital dynamics is given and an example of a mathematical formalism for the practical retrieval algorithm is presented.

  6. Adjoint Formulation for an Embedded-Boundary Cartesian Method

    NASA Technical Reports Server (NTRS)

    Nemec, Marian; Aftosmis, Michael J.; Murman, Scott M.; Pulliam, Thomas H.

    2004-01-01

    Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code

  7. Generalized uncertainty principle and self-adjoint operators

    SciTech Connect

    Balasubramanian, Venkat; Das, Saurya; Vagenas, Elias C.

    2015-09-15

    In this work we explore the self-adjointness of the GUP-modified momentum and Hamiltonian operators over different domains. In particular, we utilize the theorem by von-Neumann for symmetric operators in order to determine whether the momentum and Hamiltonian operators are self-adjoint or not, or they have self-adjoint extensions over the given domain. In addition, a simple example of the Hamiltonian operator describing a particle in a box is given. The solutions of the boundary conditions that describe the self-adjoint extensions of the specific Hamiltonian operator are obtained.

  8. Towards efficient backward-in-time adjoint computations using data compression techniques

    DOE PAGES

    Cyr, E. C.; Shadid, J. N.; Wildey, T.

    2014-12-16

    In the context of a posteriori error estimation for nonlinear time-dependent partial differential equations, the state-of-the-practice is to use adjoint approaches which require the solution of a backward-in-time problem defined by a linearization of the forward problem. One of the major obstacles in the practical application of these approaches, we found, is the need to store, or recompute, the forward solution to define the adjoint problem and to evaluate the error representation. Our study considers the use of data compression techniques to approximate forward solutions employed in the backward-in-time integration. The development derives an error representation that accounts for themore » difference between the standard-approach and the compressed approximation of the forward solution. This representation is algorithmically similar to the standard representation and only requires the computation of the quantity of interest for the forward solution and the data-compressed reconstructed solution (i.e. scalar quantities that can be evaluated as the forward problem is integrated). This approach is then compared with existing techniques, such as checkpointing and time-averaged adjoints. Lastly, we provide numerical results indicating the potential efficiency of our approach on a transient diffusion–reaction equation and on the Navier–Stokes equations. These results demonstrate memory compression ratios up to 450×450× while maintaining reasonable accuracy in the error-estimates.« less

  9. Fully automatic adjoints: a robust and efficient mechanism for generating adjoint ocean models

    NASA Astrophysics Data System (ADS)

    Ham, D. A.; Farrell, P. E.; Funke, S. W.; Rognes, M. E.

    2012-04-01

    The problem of generating and maintaining adjoint models is sufficiently difficult that typically only the most advanced and well-resourced community ocean models achieve it. There are two current technologies which each suffer from their own limitations. Algorithmic differentiation, also called automatic differentiation, is employed by models such as the MITGCM [2] and the Alfred Wegener Institute model FESOM [3]. This technique is very difficult to apply to existing code, and requires a major initial investment to prepare the code for automatic adjoint generation. AD tools may also have difficulty with code employing modern software constructs such as derived data types. An alternative is to formulate the adjoint differential equation and to discretise this separately. This approach, known as the continuous adjoint and employed in ROMS [4], has the disadvantage that two different model code bases must be maintained and manually kept synchronised as the model develops. The discretisation of the continuous adjoint is not automatically consistent with that of the forward model, producing an additional source of error. The alternative presented here is to formulate the flow model in the high level language UFL (Unified Form Language) and to automatically generate the model using the software of the FEniCS project. In this approach it is the high level code specification which is differentiated, a task very similar to the formulation of the continuous adjoint [5]. However since the forward and adjoint models are generated automatically, the difficulty of maintaining them vanishes and the software engineering process is therefore robust. The scheduling and execution of the adjoint model, including the application of an appropriate checkpointing strategy is managed by libadjoint [1]. In contrast to the conventional algorithmic differentiation description of a model as a series of primitive mathematical operations, libadjoint employs a new abstraction of the simulation

  10. An exact and consistent adjoint method for high-fidelity discretization of the compressible flow equations

    NASA Astrophysics Data System (ADS)

    Subramanian, Ramanathan Vishnampet Ganapathi

    Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvement. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs. Such methods have enabled sensitivity analysis and active control of turbulence at engineering flow conditions by providing gradient information at computational cost comparable to that of simulating the flow. They accelerate convergence of numerical design optimization algorithms, though this is predicated on the availability of an accurate gradient of the discretized flow equations. This is challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. We analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical space--time discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient Runge--Kutta-like scheme

  11. A coupled-adjoint method for high-fidelity aero-structural optimization

    NASA Astrophysics Data System (ADS)

    Martins, Joaquim Rafael Rost A.

    A new integrated aero-structural design method for aerospace vehicles is presented. The approach combines an aero-structural analysis solver, a coupled aero-structural adjoint solver, a geometry engine, and an efficient gradient-based optimization algorithm. The aero-structural solver ensures accurate solutions by using high-fidelity models for the aerodynamics, structures, and coupling procedure. The coupled aero-structural adjoint solver is used to calculate the sensitivities of aerodynamic and structural cost functions with respect to both aerodynamic shape and structural variables. The aero-structural adjoint sensitivities are compared with those given by the complex-step derivative approximation and finite differences. The proposed method is shown to be both accurate and efficient, exhibiting a significant cost advantage when the gradient of a small number of functions with respect to a large number of design variables is needed. The optimization of a supersonic business jet configuration demonstrates the usefulness and importance of computing aero-structural sensitivities using the coupled-adjoint method.

  12. Adjoint affine fusion and tadpoles

    NASA Astrophysics Data System (ADS)

    Urichuk, Andrew; Walton, Mark A.

    2016-06-01

    We study affine fusion with the adjoint representation. For simple Lie algebras, elementary and universal formulas determine the decomposition of a tensor product of an integrable highest-weight representation with the adjoint representation. Using the (refined) affine depth rule, we prove that equally striking results apply to adjoint affine fusion. For diagonal fusion, a coefficient equals the number of nonzero Dynkin labels of the relevant affine highest weight, minus 1. A nice lattice-polytope interpretation follows and allows the straightforward calculation of the genus-1 1-point adjoint Verlinde dimension, the adjoint affine fusion tadpole. Explicit formulas, (piecewise) polynomial in the level, are written for the adjoint tadpoles of all classical Lie algebras. We show that off-diagonal adjoint affine fusion is obtained from the corresponding tensor product by simply dropping non-dominant representations.

  13. Solving Large-Scale Inverse Magnetostatic Problems using the Adjoint Method

    NASA Astrophysics Data System (ADS)

    Bruckner, Florian; Abert, Claas; Wautischer, Gregor; Huber, Christian; Vogler, Christoph; Hinze, Michael; Suess, Dieter

    2017-01-01

    An efficient algorithm for the reconstruction of the magnetization state within magnetic components is presented. The occurring inverse magnetostatic problem is solved by means of an adjoint approach, based on the Fredkin-Koehler method for the solution of the forward problem. Due to the use of hybrid FEM-BEM coupling combined with matrix compression techniques the resulting algorithm is well suited for large-scale problems. Furthermore the reconstruction of the magnetization state within a permanent magnet as well as an optimal design application are demonstrated.

  14. Solving Large-Scale Inverse Magnetostatic Problems using the Adjoint Method

    PubMed Central

    Bruckner, Florian; Abert, Claas; Wautischer, Gregor; Huber, Christian; Vogler, Christoph; Hinze, Michael; Suess, Dieter

    2017-01-01

    An efficient algorithm for the reconstruction of the magnetization state within magnetic components is presented. The occurring inverse magnetostatic problem is solved by means of an adjoint approach, based on the Fredkin-Koehler method for the solution of the forward problem. Due to the use of hybrid FEM-BEM coupling combined with matrix compression techniques the resulting algorithm is well suited for large-scale problems. Furthermore the reconstruction of the magnetization state within a permanent magnet as well as an optimal design application are demonstrated. PMID:28098851

  15. Adjoint-based uncertainty quantification and sensitivity analysis for reactor depletion calculations

    NASA Astrophysics Data System (ADS)

    Stripling, Hayes Franklin

    Depletion calculations for nuclear reactors model the dynamic coupling between the material composition and neutron flux and help predict reactor performance and safety characteristics. In order to be trusted as reliable predictive tools and inputs to licensing and operational decisions, the simulations must include an accurate and holistic quantification of errors and uncertainties in its outputs. Uncertainty quantification is a formidable challenge in large, realistic reactor models because of the large number of unknowns and myriad sources of uncertainty and error. We present a framework for performing efficient uncertainty quantification in depletion problems using an adjoint approach, with emphasis on high-fidelity calculations using advanced massively parallel computing architectures. This approach calls for a solution to two systems of equations: (a) the forward, engineering system that models the reactor, and (b) the adjoint system, which is mathematically related to but different from the forward system. We use the solutions of these systems to produce sensitivity and error estimates at a cost that does not grow rapidly with the number of uncertain inputs. We present the framework in a general fashion and apply it to both the source-driven and k-eigenvalue forms of the depletion equations. We describe the implementation and verification of solvers for the forward and ad- joint equations in the PDT code, and we test the algorithms on realistic reactor analysis problems. We demonstrate a new approach for reducing the memory and I/O demands on the host machine, which can be overwhelming for typical adjoint algorithms. Our conclusion is that adjoint depletion calculations using full transport solutions are not only computationally tractable, they are the most attractive option for performing uncertainty quantification on high-fidelity reactor analysis problems.

  16. MCNP: Multigroup/adjoint capabilities

    SciTech Connect

    Wagner, J.C.; Redmond, E.L. II; Palmtag, S.P.; Hendricks, J.S.

    1994-04-01

    This report discusses various aspects related to the use and validity of the general purpose Monte Carlo code MCNP for multigroup/adjoint calculations. The increased desire to perform comparisons between Monte Carlo and deterministic codes, along with the ever-present desire to increase the efficiency of large MCNP calculations has produced a greater user demand for the multigroup/adjoint capabilities. To more fully utilize these capabilities, we review the applications of the Monte Carlo multigroup/adjoint method, describe how to generate multigroup cross sections for MCNP with the auxiliary CRSRD code, describe how to use the multigroup/adjoint capability in MCNP, and provide examples and results indicating the effectiveness and validity of the MCNP multigroup/adjoint treatment. This information should assist users in taking advantage of the MCNP multigroup/adjoint capabilities.

  17. An ordinary differential equation based solution path algorithm.

    PubMed

    Wu, Yichao

    2011-01-01

    Efron, Hastie, Johnstone and Tibshirani (2004) proposed Least Angle Regression (LAR), a solution path algorithm for the least squares regression. They pointed out that a slight modification of the LAR gives the LASSO (Tibshirani, 1996) solution path. However it is largely unknown how to extend this solution path algorithm to models beyond the least squares regression. In this work, we propose an extension of the LAR for generalized linear models and the quasi-likelihood model by showing that the corresponding solution path is piecewise given by solutions of ordinary differential equation systems. Our contribution is twofold. First, we provide a theoretical understanding on how the corresponding solution path propagates. Second, we propose an ordinary differential equation based algorithm to obtain the whole solution path.

  18. Full Waveform Inversion Using the Adjoint Method for Earthquake Kinematics Inversion

    NASA Astrophysics Data System (ADS)

    Tago Pacheco, J.; Metivier, L.; Brossier, R.; Virieux, J.

    2014-12-01

    Extracting the information contained in seismograms for better description of the Earth structure and evolution is often based on only selected attributes of these signals. Exploiting the entire seismogram, Full Wave Inversion based on an adjoint estimation of the gradient and Hessian operators, has been recognized as a high-resolution imaging technique. Most of earthquake kinematics inversion are still based on the estimation of the Frechet derivatives for the gradient operator computation in linearized optimization. One may wonder the benefit of the adjoint formulation which avoids the estimation of these derivatives for the gradient estimation. Recently, Somala et al. (submitted) have detailed the adjoint method for earthquake kinematics inversion starting from the second-order wave equation in 3D media. They have used a conjugate gradient method for the optimization procedure. We explore a similar adjoint formulation based on the first-order wave equations while using different optimization schemes. Indeed, for earthquake kinematics inversion, the model space is the slip-rate spatio-temporal history over the fault. Seismograms obtained from a dislocation rupture simulation are linearly linked to this slip-rate distribution. Therefore, we introduce a simple systematic procedure based on Lagrangian formulation of the adjoint method in the linear problem of earthquake kinematics. We have developed both the gradient estimation using the adjoint formulation and the Hessian influence using the second-order adjoint formulation (Metivier et al, 2013, 2014). Since the earthquake kinematics is a linear problem, the minimization problem is quadratic, henceforth, only one solution of the Newton equations is needed with the Hessian impact. Moreover, the formal uncertainty estimation over slip-rate distribution could be deduced from this Hessian analysis. On simple synthetic examples for antiplane kinematic rupture configuration in 2D medium, we illustrate the properties of

  19. Massively Parallel Algorithms for Solution of Schrodinger Equation

    NASA Technical Reports Server (NTRS)

    Fijany, Amir; Barhen, Jacob; Toomerian, Nikzad

    1994-01-01

    In this paper massively parallel algorithms for solution of Schrodinger equation are developed. Our results clearly indicate that the Crank-Nicolson method, in addition to its excellent numerical properties, is also highly suitable for massively parallel computation.

  20. Gradient-based optimum aerodynamic design using adjoint methods

    NASA Astrophysics Data System (ADS)

    Xie, Lei

    2002-09-01

    Continuous adjoint methods and optimal control theory are applied to a pressure-matching inverse design problem of quasi 1-D nozzle flows. Pontryagin's Minimum Principle is used to derive the adjoint system and the reduced gradient of the cost functional. The properties of adjoint variables at the sonic throat and the shock location are studied, revealing a log-arithmic singularity at the sonic throat and continuity at the shock location. A numerical method, based on the Steger-Warming flux-vector-splitting scheme, is proposed to solve the adjoint equations. This scheme can finely resolve the singularity at the sonic throat. A non-uniform grid, with points clustered near the throat region, can resolve it even better. The analytical solutions to the adjoint equations are also constructed via Green's function approach for the purpose of comparing the numerical results. The pressure-matching inverse design is then conducted for a nozzle parameterized by a single geometric parameter. In the second part, the adjoint methods are applied to the problem of minimizing drag coefficient, at fixed lift coefficient, for 2-D transonic airfoil flows. Reduced gradients of several functionals are derived through application of a Lagrange Multiplier Theorem. The adjoint system is carefully studied including the adjoint characteristic boundary conditions at the far-field boundary. A super-reduced design formulation is also explored by treating the angle of attack as an additional state; super-reduced gradients can be constructed either by solving adjoint equations with non-local boundary conditions or by a direct Lagrange multiplier method. In this way, the constrained optimization reduces to an unconstrained design problem. Numerical methods based on Jameson's finite volume scheme are employed to solve the adjoint equations. The same grid system generated from an efficient hyperbolic grid generator are adopted in both the Euler flow solver and the adjoint solver. Several

  1. Unsteady adjoint of a gas turbine inlet guide vane

    NASA Astrophysics Data System (ADS)

    Talnikar, Chaitanya; Wang, Qiqi

    2015-11-01

    Unsteady fluid flow simulations like large eddy simulation have been shown to be crucial in accurately predicting heat transfer in turbomachinery applications like transonic flow over an inlet guide vane. To compute sensitivities of aerothermal objectives for a vane with respect to design parameters an unsteady adjoint is required. In this talk we present unsteady adjoint solutions for a vane from VKI using pressure loss and heat transfer over the vane surface as the objectives. The boundary layer on the suction side near the trailing edge of the vane is turbulent and this poses a challenge for an adjoint solver. The chaotic dynamics cause the adjoint solution to diverge exponentially to infinity from that region when simulated backwards in time. The prospect of adding artificial viscosity to the adjoint equations to dampen the adjoint fields is investigated. Results for the vane from simulations performed on the Titan supercomputer will be shown and the effect of the additional viscosity on the accuracy of the sensitivities will be discussed.

  2. A Solution Quality Assessment Method for Swarm Intelligence Optimization Algorithms

    PubMed Central

    Wang, Gai-Ge; Zou, Kuansheng; Zhang, Jianhua

    2014-01-01

    Nowadays, swarm intelligence optimization has become an important optimization tool and wildly used in many fields of application. In contrast to many successful applications, the theoretical foundation is rather weak. Therefore, there are still many problems to be solved. One problem is how to quantify the performance of algorithm in finite time, that is, how to evaluate the solution quality got by algorithm for practical problems. It greatly limits the application in practical problems. A solution quality assessment method for intelligent optimization is proposed in this paper. It is an experimental analysis method based on the analysis of search space and characteristic of algorithm itself. Instead of “value performance,” the “ordinal performance” is used as evaluation criteria in this method. The feasible solutions were clustered according to distance to divide solution samples into several parts. Then, solution space and “good enough” set can be decomposed based on the clustering results. Last, using relative knowledge of statistics, the evaluation result can be got. To validate the proposed method, some intelligent algorithms such as ant colony optimization (ACO), particle swarm optimization (PSO), and artificial fish swarm algorithm (AFS) were taken to solve traveling salesman problem. Computational results indicate the feasibility of proposed method. PMID:25013845

  3. A solution quality assessment method for swarm intelligence optimization algorithms.

    PubMed

    Zhang, Zhaojun; Wang, Gai-Ge; Zou, Kuansheng; Zhang, Jianhua

    2014-01-01

    Nowadays, swarm intelligence optimization has become an important optimization tool and wildly used in many fields of application. In contrast to many successful applications, the theoretical foundation is rather weak. Therefore, there are still many problems to be solved. One problem is how to quantify the performance of algorithm in finite time, that is, how to evaluate the solution quality got by algorithm for practical problems. It greatly limits the application in practical problems. A solution quality assessment method for intelligent optimization is proposed in this paper. It is an experimental analysis method based on the analysis of search space and characteristic of algorithm itself. Instead of "value performance," the "ordinal performance" is used as evaluation criteria in this method. The feasible solutions were clustered according to distance to divide solution samples into several parts. Then, solution space and "good enough" set can be decomposed based on the clustering results. Last, using relative knowledge of statistics, the evaluation result can be got. To validate the proposed method, some intelligent algorithms such as ant colony optimization (ACO), particle swarm optimization (PSO), and artificial fish swarm algorithm (AFS) were taken to solve traveling salesman problem. Computational results indicate the feasibility of proposed method.

  4. A new mathematical adjoint for the modified SAAF-SN equations

    SciTech Connect

    Schunert, Sebastian; Wang, Yaqi; Martineau, Richard; DeHart, Mark D.

    2015-01-01

    We present a new adjoint FEM weak form, which can be directly used for evaluating the mathematical adjoint, suitable for perturbation calculations, of the self-adjoint angular flux SN equations (SAAF-SN) without construction and transposition of the underlying coefficient matrix. Stabilization schemes incorporated in the described SAAF-SN method make the mathematical adjoint distinct from the physical adjoint, i.e. the solution of the continuous adjoint equation with SAAF-SN . This weak form is implemented into RattleSnake, the MOOSE (Multiphysics Object-Oriented Simulation Environment) based transport solver. Numerical results verify the correctness of the implementation and show its utility both for fixed source and eigenvalue problems.

  5. Algorithm For Solution Of Subset-Regression Problems

    NASA Technical Reports Server (NTRS)

    Verhaegen, Michel

    1991-01-01

    Reliable and flexible algorithm for solution of subset-regression problem performs QR decomposition with new column-pivoting strategy, enables selection of subset directly from originally defined regression parameters. This feature, in combination with number of extensions, makes algorithm very flexible for use in analysis of subset-regression problems in which parameters have physical meanings. Also extended to enable joint processing of columns contaminated by noise with those free of noise, without using scaling techniques.

  6. Multidomain solution algorithm for potential flow computations around complex configurations

    NASA Astrophysics Data System (ADS)

    Jacquotte, Olivier-Pierre; Godard, Jean-Luc

    1994-04-01

    A method is presented for the computation of irrotational transonic flows of perfect gas around a wide class of geometries. It is based on the construction of a multidomain structured grid and then on the solution of the full potential equation discretized with finite elements. The novelty of the paper is the combination of three embedded algorithms: a mixed fixed-point/Newton algorithm to treat the non-linearity, a multidomain conjugate gradient algorithm to handle the grid topology and another conjugate gradient algorithm in each of the structured domains. This method has made possible the calculations of flows around geometries that cannot be treated in a structured approach without the multidomain algorithm; an application of this method to the study of the wing-pylon-nacelle interactions is presented.

  7. Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry

    NASA Technical Reports Server (NTRS)

    Nemec, Marian; Aftosmis, Michael J.

    2006-01-01

    A DJOINT solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (e.g., geometric parameters that control the shape). Classic aerodynamic applications of gradient-based optimization include the design of cruise configurations for transonic and supersonic flow, as well as the design of high-lift systems. are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric computer-aided design (CAD). In previous work on Cartesian adjoint solvers, Melvin et al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the two-dimensional Euler equations using a ghost-cell method to enforce the wall boundary conditions. In Refs. 18 and 19, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm were the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The accuracy of the gradient computation was verified using several three-dimensional test cases, which included design

  8. Multigrid methods for bifurcation problems: The self adjoint case

    NASA Technical Reports Server (NTRS)

    Taasan, Shlomo

    1987-01-01

    This paper deals with multigrid methods for computational problems that arise in the theory of bifurcation and is restricted to the self adjoint case. The basic problem is to solve for arcs of solutions, a task that is done successfully with an arc length continuation method. Other important issues are, for example, detecting and locating singular points as part of the continuation process, switching branches at bifurcation points, etc. Multigrid methods have been applied to continuation problems. These methods work well at regular points and at limit points, while they may encounter difficulties in the vicinity of bifurcation points. A new continuation method that is very efficient also near bifurcation points is presented here. The other issues mentioned above are also treated very efficiently with appropriate multigrid algorithms. For example, it is shown that limit points and bifurcation points can be solved for directly by a multigrid algorithm. Moreover, the algorithms presented here solve the corresponding problems in just a few work units (about 10 or less), where a work unit is the work involved in one local relaxation on the finest grid.

  9. Naturally selecting solutions: the use of genetic algorithms in bioinformatics.

    PubMed

    Manning, Timmy; Sleator, Roy D; Walsh, Paul

    2013-01-01

    For decades, computer scientists have looked to nature for biologically inspired solutions to computational problems; ranging from robotic control to scheduling optimization. Paradoxically, as we move deeper into the post-genomics era, the reverse is occurring, as biologists and bioinformaticians look to computational techniques, to solve a variety of biological problems. One of the most common biologically inspired techniques are genetic algorithms (GAs), which take the Darwinian concept of natural selection as the driving force behind systems for solving real world problems, including those in the bioinformatics domain. Herein, we provide an overview of genetic algorithms and survey some of the most recent applications of this approach to bioinformatics based problems.

  10. Adjoint Methods for Guiding Adaptive Mesh Refinement in Tsunami Modeling

    NASA Astrophysics Data System (ADS)

    Davis, B. N.; LeVeque, R. J.

    2016-12-01

    One difficulty in developing numerical methods for tsunami modeling is the fact that solutions contain time-varying regions where much higher resolution is required than elsewhere in the domain, particularly when tracking a tsunami propagating across the ocean. The open source GeoClaw software deals with this issue by using block-structured adaptive mesh refinement to selectively refine around propagating waves. For problems where only a target area of the total solution is of interest (e.g., one coastal community), a method that allows identifying and refining the grid only in regions that influence this target area would significantly reduce the computational cost of finding a solution. In this work, we show that solving the time-dependent adjoint equation and using a suitable inner product with the forward solution allows more precise refinement of the relevant waves. We present the adjoint methodology first in one space dimension for illustration and in a broad context since it could also be used in other adaptive software, and potentially for other tsunami applications beyond adaptive refinement. We then show how this adjoint method has been integrated into the adaptive mesh refinement strategy of the open source GeoClaw software and present tsunami modeling results showing that the accuracy of the solution is maintained and the computational time required is significantly reduced through the integration of the adjoint method into adaptive mesh refinement.

  11. Optimization of wind plant layouts using an adjoint approach

    DOE PAGES

    King, Ryan N.; Dykes, Katherine; Graf, Peter; ...

    2017-03-10

    Using adjoint optimization and three-dimensional steady-state Reynolds-averaged Navier–Stokes (RANS) simulations, we present a new gradient-based approach for optimally siting wind turbines within utility-scale wind plants. By solving the adjoint equations of the flow model, the gradients needed for optimization are found at a cost that is independent of the number of control variables, thereby permitting optimization of large wind plants with many turbine locations. Moreover, compared to the common approach of superimposing prescribed wake deficits onto linearized flow models, the computational efficiency of the adjoint approach allows the use of higher-fidelity RANS flow models which can capture nonlinear turbulent flowmore » physics within a wind plant. The steady-state RANS flow model is implemented in the Python finite-element package FEniCS and the derivation and solution of the discrete adjoint equations are automated within the dolfin-adjoint framework. Gradient-based optimization of wind turbine locations is demonstrated for idealized test cases that reveal new optimization heuristics such as rotational symmetry, local speedups, and nonlinear wake curvature effects. Layout optimization is also demonstrated on more complex wind rose shapes, including a full annual energy production (AEP) layout optimization over 36 inflow directions and 5 wind speed bins.« less

  12. Unsteady adjoint for large eddy simulation of a coupled turbine stator-rotor system

    NASA Astrophysics Data System (ADS)

    Talnikar, Chaitanya; Wang, Qiqi; Laskowski, Gregory

    2016-11-01

    Unsteady fluid flow simulations like large eddy simulation are crucial in capturing key physics in turbomachinery applications like separation and wake formation in flow over a turbine vane with a downstream blade. To determine how sensitive the design objectives of the coupled system are to control parameters, an unsteady adjoint is needed. It enables the computation of the gradient of an objective with respect to a large number of inputs in a computationally efficient manner. In this paper we present unsteady adjoint solutions for a coupled turbine stator-rotor system. As the transonic fluid flows over the stator vane, the boundary layer transitions to turbulence. The turbulent wake then impinges on the rotor blades, causing early separation. This coupled system exhibits chaotic dynamics which causes conventional adjoint solutions to diverge exponentially, resulting in the corruption of the sensitivities obtained from the adjoint solutions for long-time simulations. In this presentation, adjoint solutions for aerothermal objectives are obtained through a localized adjoint viscosity injection method which aims to stabilize the adjoint solution and maintain accurate sensitivities. Preliminary results obtained from the supercomputer Mira will be shown in the presentation.

  13. On the multi-level solution algorithm for Markov chains

    SciTech Connect

    Horton, G.

    1996-12-31

    We discuss the recently introduced multi-level algorithm for the steady-state solution of Markov chains. The method is based on the aggregation principle, which is well established in the literature. Recursive application of the aggregation yields a multi-level method which has been shown experimentally to give results significantly faster than the methods currently in use. The algorithm can be reformulated as an algebraic multigrid scheme of Galerkin-full approximation type. The uniqueness of the scheme stems from its solution-dependent prolongation operator which permits significant computational savings in the evaluation of certain terms. This paper describes the modeling of computer systems to derive information on performance, measured typically as job throughput or component utilization, and availability, defined as the proportion of time a system is able to perform a certain function in the presence of component failures and possibly also repairs.

  14. On the Multilevel Solution Algorithm for Markov Chains

    NASA Technical Reports Server (NTRS)

    Horton, Graham

    1997-01-01

    We discuss the recently introduced multilevel algorithm for the steady-state solution of Markov chains. The method is based on an aggregation principle which is well established in the literature and features a multiplicative coarse-level correction. Recursive application of the aggregation principle, which uses an operator-dependent coarsening, yields a multi-level method which has been shown experimentally to give results significantly faster than the typical methods currently in use. When cast as a multigrid-like method, the algorithm is seen to be a Galerkin-Full Approximation Scheme with a solution-dependent prolongation operator. Special properties of this prolongation lead to the cancellation of the computationally intensive terms of the coarse-level equations.

  15. Unstructured mesh quality assessment and upwind Euler solution algorithm validation

    NASA Astrophysics Data System (ADS)

    Woodard, Paul R.; Batina, John T.; Yang, Henry T. Y.

    1994-05-01

    Quality assessment procedures are described for two and three dimensional unstructured meshes. The procedures include measurement of minimum angles, element aspect ratios, stretching, and element skewness. Meshes about the ONERA M6 wing and the Boeing 747 transport configuration are generated using an advancing front method grid generation package of programs. Solutions of the Euler equations for these meshes are obtained at low angle of attack, transonic conditions. Results for these cases, obtained as part of a validation study, investigate accuracy of an implicit upwind Euler solution algorithm.

  16. An algorithm for the solution of dynamic linear programs

    NASA Technical Reports Server (NTRS)

    Psiaki, Mark L.

    1989-01-01

    The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation

  17. A Posteriori Analysis for Hydrodynamic Simulations Using Adjoint Methodologies

    SciTech Connect

    Woodward, C S; Estep, D; Sandelin, J; Wang, H

    2009-02-26

    This report contains results of analysis done during an FY08 feasibility study investigating the use of adjoint methodologies for a posteriori error estimation for hydrodynamics simulations. We developed an approach to adjoint analysis for these systems through use of modified equations and viscosity solutions. Targeting first the 1D Burgers equation, we include a verification of the adjoint operator for the modified equation for the Lax-Friedrichs scheme, then derivations of an a posteriori error analysis for a finite difference scheme and a discontinuous Galerkin scheme applied to this problem. We include some numerical results showing the use of the error estimate. Lastly, we develop a computable a posteriori error estimate for the MAC scheme applied to stationary Navier-Stokes.

  18. Self-adjoint commuting differential operators of rank two

    NASA Astrophysics Data System (ADS)

    Mironov, A. E.

    2016-08-01

    This is a survey of results on self-adjoint commuting ordinary differential operators of rank two. In particular, the action of automorphisms of the first Weyl algebra on the set of commuting differential operators with polynomial coefficients is discussed, as well as the problem of constructing algebro-geometric solutions of rank l>1 of soliton equations. Bibliography: 59 titles.

  19. Imaging Earth's Interior Based Upon Adjoint Methods

    NASA Astrophysics Data System (ADS)

    Tromp, J.; Komatitsch, D.; Liu, Q.; Tape, C.; Maggi, A.

    2008-12-01

    Modern numerical methods in combination with rapid advances in parallel computing have enabled the simulation of seismic wave propagation in 3D Earth models at unpredcented resolution and accuracy. On a modest PC cluster one can now simulate global seismic wave propagation at periods of 20~s longer accounting for heterogeneity in the crust and mantle, topography, anisotropy, attenuation, fluid-solid interactions, self-gravitation, rotation, and the oceans. On the 'Ranger' system at the Texas Advanced Computing Center one can break the 2~s barrier. By drawing connections between seismic tomography, adjoint methods popular in climate and ocean dynamics, time-reversal imaging, and finite-frequency 'banana-doughnut' kernels, it has been demonstrated that Fréchet derivatives for tomographic and (finite) source inversions in complex 3D Earth models may be obtained based upon just two numerical simulations for each earthquake: one calculation for the current model and a second, 'adjoint', calculation that uses time-reversed signals at the receivers as simultaneous, fictitious sources. The adjoint wavefield is calculated while the regular wavefield is reconstructed on the fly by propagating the last frame of the wavefield saved by a previous forward simulation backward in time. This aproach has been used to calculate sensitivity kernels in regional and global Earth models for various body- and surface-wave arrivals. These kernels illustrate the sensitivity of the observations to the structural parameters and form the basis of 'adjoint tomography'. We use a non-linear conjugate gradient method in combination with a source subspace projection preconditioning technique to iterative minimize the misfit function. Using an automated time window selection algorithm, our emphasis is on matching targeted, frequency-dependent body-wave traveltimes and surface-wave phase anomalies, rather than entire waveforms. To avoid reaching a local minimum in the optimization procedure, we

  20. An airport surface surveillance solution based on fusion algorithm

    NASA Astrophysics Data System (ADS)

    Liu, Jianliang; Xu, Yang; Liang, Xuelin; Yang, Yihuang

    2017-01-01

    In this paper, we propose an airport surface surveillance solution combined with Multilateration (MLAT) and Automatic Dependent Surveillance Broadcast (ADS-B). The moving target to be monitored is regarded as a linear stochastic hybrid system moving freely and each surveillance technology is simplified as a sensor with white Gaussian noise. The dynamic model of target and the observation model of sensor are established in this paper. The measurements of sensors are filtered properly by estimators to get the estimation results for current time. Then, we analysis the characteristics of two fusion solutions proposed, and decide to use the scheme based on sensor estimation fusion for our surveillance solution. In the proposed fusion algorithm, according to the output of estimators, the estimation error is quantified, and the fusion weight of each sensor is calculated. The two estimation results are fused with weights, and the position estimation of target is computed accurately. Finally the proposed solution and algorithm are validated by an illustrative target tracking simulation.

  1. Data adjoint assimilation into the adjoint inverse coastal circulation model that conforms to topography

    NASA Astrophysics Data System (ADS)

    Fang, F.; Pain, C. C.; Gaddard, A. J. H.; de Oliveira, C. R. E.; Piggott, M. D.; Umpleby, A. P.; Copeland, G. J. M.

    2003-04-01

    There are often uncertain factors in ocean numerical models, e.g. the initial and boundary conditions, parameters. With the introduction of advanced observational techniques, more attention has been given to data assimilation to improve the predictive capabilities of ocean models. The question is how and where best to assimilate the observations for reducing the dependence of solutions on the initial and boundary data and getting a better representation of non-stratified water flows around and over coastal topography. In this investigation, we aim to introduce an adjoint model into the Imperial College Ocean Model (ICOM), which is a 3D nonlinear non-hydrostatic model with mesh adaptivity and optimal Domain Decomposition Method (DDM) parallel solver. By using an unstructured mesh, ICOM can automatically conform to the complicated coastal topography and with mesh adaptivity the resolution can be designed to meet physics demands such as flows in region of high shear and flow separation at coastlines. In the initial stage of this investigation, we discuss various adjoint methods and their consistence. To accelerate the convergence of the gradient calculation and reduce the memory requirement, the numerical techniques: Nonlinear Conjugate Gradient and Check Pointing are introduced. We then apply the adjoint method to 1D nonlinear shallow water and 2D coastal flow past a headland with the inversion of both boundary and initial conditions. We give an initial insight to (1) Effect of data information to be inverted; (2) Role of the nonlinear terms in the inversion; (3) Possibility of adopting non-consistent discretization schemes in the forward and backward adjoint models; (4) Effect of various boundary conditions, e.g. uniform flow and wave/tidal flow.

  2. Adjoint-based minimization of the sound radiated by a Mach 1.3 turbulent jet

    NASA Astrophysics Data System (ADS)

    Kim, Jeonglae; Bodony, Daniel; Freund, Jonathan

    2010-11-01

    A control optimization using the adjoint of the perturbed and linearized Navier--Stokes equations is applied to a simulation of a Mach 1.3 turbulent jet to reduce its radiated sound. The solution of the adjoint system provides gradient information for a minimization algorithm to circumvent the flow complexity and reduce the sound directly. Comparisons between the loud and the perturbed-but-quiet versions of the same jet are examined to identify sound mechanisms. The overall algorithm is designed such that the control can be optimized with degrees of freedom comparable to that of the numerical discretization or with constraints on its spatial or temporal profiles to reflect hardware limitations. The large-eddy simulation of the uncontrolled, baseline jet is carried out in curvilinear coordinates using a non-dissipative high-order finite-difference. The far-field sound is computed using a Ffowcs Williams and Hawkings surface. Turbulence and far-field sound statistics agree with experimental data. An unconstrained optimal control reduces the sound cost functional by 17%. The far-field sound is reduced at all angles with a maximum reduction of 2.7dB in the peak radiation direction. Constraining the control in actuator-like zones shows a similar result. Optimizations are ongoing.

  3. Trajectory Optimization Using Adjoint Method and Chebyshev Polynomial Approximation for Minimizing Fuel Consumption During Climb

    NASA Technical Reports Server (NTRS)

    Nguyen, Nhan T.; Hornby, Gregory; Ishihara, Abe

    2013-01-01

    This paper describes two methods of trajectory optimization to obtain an optimal trajectory of minimum-fuel- to-climb for an aircraft. The first method is based on the adjoint method, and the second method is based on a direct trajectory optimization method using a Chebyshev polynomial approximation and cubic spine approximation. The approximate optimal trajectory will be compared with the adjoint-based optimal trajectory which is considered as the true optimal solution of the trajectory optimization problem. The adjoint-based optimization problem leads to a singular optimal control solution which results in a bang-singular-bang optimal control.

  4. Adjoint Sensitivity Computations for an Embedded-Boundary Cartesian Mesh Method and CAD Geometry

    NASA Technical Reports Server (NTRS)

    Nemec, Marian; Aftosmis,Michael J.

    2006-01-01

    Cartesian-mesh methods are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm included the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach

  5. Adjoint-based approach to Enhancing Mixing in Rayleigh-Taylor Turbulence

    NASA Astrophysics Data System (ADS)

    Kord, Ali; Capecelatro, Jesse

    2016-11-01

    A recently developed adjoint method for multi-component compressible flow is used to measure sensitivity of the mixing rate to initial perturbations in Rayleigh-Taylor (RT) turbulence. Direct numerical simulations (DNS) of RT instabilities are performed at moderate Reynolds numbers. The DNS are used to provide an initial prediction, and the corresponding space-time discrete-exact adjoint provides a sensitivity gradient for a specific quantity of interest (QoI). In this work, a QoI is defined based on the time-integrated scalar field to quantify the mixing rate. Therefore, the adjoint solution is used to measure sensitivity of this QoI to a set of initial perturbations, and inform a gradient-based line search to optimize mixing. We first demonstrate the adjoint approach in the linear regime and compare the optimized initial conditions to the expected values from linear stability analysis. The adjoint method is then used in the high Reynolds number limit where theory is no longer valid. Finally, chaos is known to contaminate the accuracy of the adjoint gradient in turbulent flows when integrated over long time horizons. We assess the influence of chaos on the accuracy of the adjoint gradient to guide the work of future studies on adjoint-based sensitivity of turbulent mixing. PhD Student, Department of Mechanical Engineering, University of Michigan, Ann Arbor, MI.

  6. Parallel hybrid algorithm for solution in electrical impedance equation

    NASA Astrophysics Data System (ADS)

    Ponomaryov, Volodymyr; Robles-Gonzalez, Marco; Bucio-Ramirez, Ariana; Ramirez-Tachiquin, Marco; Ramos-Diaz, Eduardo

    2015-02-01

    This work is dedicated to the analysis of the forward and the inverse problem to obtain a better approximation to the Electrical Impedance Tomography equation. In this case, we employ for the forward problem the numerical method based on the Taylor series in formal power and for the inverse problem the Finite Element Method. For the analysis of the forward problem, we proposed a novel algorithm, which employs a regularization technique for the stability, additionally the parallel computing is used to obtain the solution faster; this modification permits to obtain an efficient solution of the forward problem. Then, the found solution is used in the inverse problem for the approximation employing the Finite Element Method. The algorithms employed in this work are developed in structural programming paradigm in C++, including parallel processing; the time run analysis is performed only in the forward problem because the Finite Element Method due to their high recursive does not accept parallelism. Some examples are performed for this analysis, in which several conductivity functions are employed for two different cases: for the analytical cases: the exponential and sinusoidal functions are used, and for the geometrical cases the circle at center and five disk structure are revised as conductivity functions. The Lebesgue measure is used as metric for error estimation in the forward problem, meanwhile, in the inverse problem PSNR, SSIM, MSE criteria are applied, to determine the convergence of both methods.

  7. An algorithm for the numerical solution of linear differential games

    SciTech Connect

    Polovinkin, E S; Ivanov, G E; Balashov, M V; Konstantinov, R V; Khorev, A V

    2001-10-31

    A numerical algorithm for the construction of stable Krasovskii bridges, Pontryagin alternating sets, and also of piecewise program strategies solving two-person linear differential (pursuit or evasion) games on a fixed time interval is developed on the basis of a general theory. The aim of the first player (the pursuer) is to hit a prescribed target (terminal) set by the phase vector of the control system at the prescribed time. The aim of the second player (the evader) is the opposite. A description of numerical algorithms used in the solution of differential games of the type under consideration is presented and estimates of the errors resulting from the approximation of the game sets by polyhedra are presented.

  8. Constrained Multipoint Aerodynamic Shape Optimization Using an Adjoint Formulation and Parallel Computers

    NASA Technical Reports Server (NTRS)

    Reuther, James; Jameson, Antony; Alonso, Juan Jose; Rimlinger, Mark J.; Saunders, David

    1997-01-01

    An aerodynamic shape optimization method that treats the design of complex aircraft configurations subject to high fidelity computational fluid dynamics (CFD), geometric constraints and multiple design points is described. The design process will be greatly accelerated through the use of both control theory and distributed memory computer architectures. Control theory is employed to derive the adjoint differential equations whose solution allows for the evaluation of design gradient information at a fraction of the computational cost required by previous design methods. The resulting problem is implemented on parallel distributed memory architectures using a domain decomposition approach, an optimized communication schedule, and the MPI (Message Passing Interface) standard for portability and efficiency. The final result achieves very rapid aerodynamic design based on a higher order CFD method. In order to facilitate the integration of these high fidelity CFD approaches into future multi-disciplinary optimization (NW) applications, new methods must be developed which are capable of simultaneously addressing complex geometries, multiple objective functions, and geometric design constraints. In our earlier studies, we coupled the adjoint based design formulations with unconstrained optimization algorithms and showed that the approach was effective for the aerodynamic design of airfoils, wings, wing-bodies, and complex aircraft configurations. In many of the results presented in these earlier works, geometric constraints were satisfied either by a projection into feasible space or by posing the design space parameterization such that it automatically satisfied constraints. Furthermore, with the exception of reference 9 where the second author initially explored the use of multipoint design in conjunction with adjoint formulations, our earlier works have focused on single point design efforts. Here we demonstrate that the same methodology may be extended to treat

  9. From analytical solutions of solute transport equations to multidimensional time-domain random walk (TDRW) algorithms

    NASA Astrophysics Data System (ADS)

    Bodin, Jacques

    2015-03-01

    In this study, new multi-dimensional time-domain random walk (TDRW) algorithms are derived from approximate one-dimensional (1-D), two-dimensional (2-D), and three-dimensional (3-D) analytical solutions of the advection-dispersion equation and from exact 1-D, 2-D, and 3-D analytical solutions of the pure-diffusion equation. These algorithms enable the calculation of both the time required for a particle to travel a specified distance in a homogeneous medium and the mass recovery at the observation point, which may be incomplete due to 2-D or 3-D transverse dispersion or diffusion. The method is extended to heterogeneous media, represented as a piecewise collection of homogeneous media. The particle motion is then decomposed along a series of intermediate checkpoints located on the medium interface boundaries. The accuracy of the multi-dimensional TDRW method is verified against (i) exact analytical solutions of solute transport in homogeneous media and (ii) finite-difference simulations in a synthetic 2-D heterogeneous medium of simple geometry. The results demonstrate that the method is ideally suited to purely diffusive transport and to advection-dispersion transport problems dominated by advection. Conversely, the method is not recommended for highly dispersive transport problems because the accuracy of the advection-dispersion TDRW algorithms degrades rapidly for a low Péclet number, consistent with the accuracy limit of the approximate analytical solutions. The proposed approach provides a unified methodology for deriving multi-dimensional time-domain particle equations and may be applicable to other mathematical transport models, provided that appropriate analytical solutions are available.

  10. Self-adjointness of deformed unbounded operators

    SciTech Connect

    Much, Albert

    2015-09-15

    We consider deformations of unbounded operators by using the novel construction tool of warped convolutions. By using the Kato-Rellich theorem, we show that unbounded self-adjoint deformed operators are self-adjoint if they satisfy a certain condition. This condition proves itself to be necessary for the oscillatory integral to be well-defined. Moreover, different proofs are given for self-adjointness of deformed unbounded operators in the context of quantum mechanics and quantum field theory.

  11. An algorithm for enforcement of contact constraints in quasistatic applications using matrix-free solution algorithms

    SciTech Connect

    Heinstein, M.W.

    1997-10-01

    A contact enforcement algorithm has been developed for matrix-free quasistatic finite element techniques. Matrix-free (iterative) solution algorithms such as nonlinear Conjugate Gradients (CG) and Dynamic Relaxation (DR) are distinctive in that the number of iterations required for convergence is typically of the same order as the number of degrees of freedom of the model. From iteration to iteration the contact normal and tangential forces vary significantly making contact constraint satisfaction tenuous. Furthermore, global determination and enforcement of the contact constraints every iteration could be questioned on the grounds of efficiency. This work addresses this situation by introducing an intermediate iteration for treating the active gap constraint and at the same time exactly (kinematically) enforcing the linearized gap rate constraint for both frictionless and frictional response.

  12. Application of Adjoint Methodology in Various Aspects of Sonic Boom Design

    NASA Technical Reports Server (NTRS)

    Rallabhandi, Sriram K.

    2014-01-01

    One of the advances in computational design has been the development of adjoint methods allowing efficient calculation of sensitivities in gradient-based shape optimization. This paper discusses two new applications of adjoint methodology that have been developed to aid in sonic boom mitigation exercises. In the first, equivalent area targets are generated using adjoint sensitivities of selected boom metrics. These targets may then be used to drive the vehicle shape during optimization. The second application is the computation of adjoint sensitivities of boom metrics on the ground with respect to parameters such as flight conditions, propagation sampling rate, and selected inputs to the propagation algorithms. These sensitivities enable the designer to make more informed selections of flight conditions at which the chosen cost functionals are less sensitive.

  13. Numerical Computation of Sensitivities and the Adjoint Approach

    NASA Technical Reports Server (NTRS)

    Lewis, Robert Michael

    1997-01-01

    We discuss the numerical computation of sensitivities via the adjoint approach in optimization problems governed by differential equations. We focus on the adjoint problem in its weak form. We show how one can avoid some of the problems with the adjoint approach, such as deriving suitable boundary conditions for the adjoint equation. We discuss the convergence of numerical approximations of the costate computed via the weak form of the adjoint problem and show the significance for the discrete adjoint problem.

  14. Algorithm Development and Application of High Order Numerical Methods for Shocked and Rapid Changing Solutions

    DTIC Science & Technology

    2007-12-06

    problems studied in this project involve numerically solving partial differential equations with either discontinuous or rapidly changing solutions ...REPORT Algorithm Development and Application of High Order Numerical Methods for Shocked and Rapid Changing Solutions 14. ABSTRACT 16. SECURITY...discontinuous Galerkin finite element methods, for solving partial differential equations with discontinuous or rapidly changing solutions . Algorithm

  15. Adjoint sensitivity study on idealized explosive cyclogenesis

    NASA Astrophysics Data System (ADS)

    Chu, Kekuan; Zhang, Yi

    2016-06-01

    The adjoint sensitivity related to explosive cyclogenesis in a conditionally unstable atmosphere is investigated in this study. The PSU/NCAR limited-area, nonhydrostatic primitive equation numerical model MM5 and its adjoint system are employed for numerical simulation and adjoint computation, respectively. To ensure the explosive development of a baroclinic wave, the forecast model is initialized with an idealized condition including an idealized two-dimensional baroclinic jet with a balanced three-dimensional moderate-amplitude disturbance, derived from a potential vorticity inversion technique. Firstly, the validity period of the tangent linear model for this idealized baroclinic wave case is discussed, considering different initial moisture distributions and a dry condition. Secondly, the 48-h forecast surface pressure center and the vertical component of the relative vorticity of the cyclone are selected as the response functions for adjoint computation in a dry and moist environment, respectively. The preliminary results show that the validity of the tangent linear assumption for this idealized baroclinic wave case can extend to 48 h with intense moist convection, and the validity period can last even longer in the dry adjoint integration. Adjoint sensitivity analysis indicates that the rapid development of the idealized baroclinic wave is sensitive to the initial wind and temperature perturbations around the steering level in the upstream. Moreover, the moist adjoint sensitivity can capture a secondary high sensitivity center in the upper troposphere, which cannot be depicted in the dry adjoint run.

  16. Local-in-Time Adjoint-Based Method for Optimal Control/Design Optimization of Unsteady Compressible Flows

    NASA Technical Reports Server (NTRS)

    Yamaleev, N. K.; Diskin, B.; Nielsen, E. J.

    2009-01-01

    .We study local-in-time adjoint-based methods for minimization of ow matching functionals subject to the 2-D unsteady compressible Euler equations. The key idea of the local-in-time method is to construct a very accurate approximation of the global-in-time adjoint equations and the corresponding sensitivity derivative by using only local information available on each time subinterval. In contrast to conventional time-dependent adjoint-based optimization methods which require backward-in-time integration of the adjoint equations over the entire time interval, the local-in-time method solves local adjoint equations sequentially over each time subinterval. Since each subinterval contains relatively few time steps, the storage cost of the local-in-time method is much lower than that of the global adjoint formulation, thus making the time-dependent optimization feasible for practical applications. The paper presents a detailed comparison of the local- and global-in-time adjoint-based methods for minimization of a tracking functional governed by the Euler equations describing the ow around a circular bump. Our numerical results show that the local-in-time method converges to the same optimal solution obtained with the global counterpart, while drastically reducing the memory cost as compared to the global-in-time adjoint formulation.

  17. A fast algorithm for numerical solutions to Fortet's equation

    NASA Astrophysics Data System (ADS)

    Brumen, Gorazd

    2008-10-01

    A fast algorithm for computation of default times of multiple firms in a structural model is presented. The algorithm uses a multivariate extension of the Fortet's equation and the structure of Toeplitz matrices to significantly improve the computation time. In a financial market consisting of M[not double greater-than sign]1 firms and N discretization points in every dimension the algorithm uses O(nlogn·M·M!·NM(M-1)/2) operations, where n is the number of discretization points in the time domain. The algorithm is applied to firm survival probability computation and zero coupon bond pricing.

  18. Adjoint method and runaway electron avalanche

    NASA Astrophysics Data System (ADS)

    Liu, Chang; Brennan, Dylan P.; Boozer, Allen H.; Bhattacharjee, Amitava

    2017-02-01

    The adjoint method for the study of runaway electron dynamics in momentum space Liu et al (2016 Phys. Plasmas 23 010702) is rederived using the Green’s function method, for both the runaway probability function (RPF) and the expected loss time (ELT). The RPF and ELT obtained using the adjoint method are presented, both with and without the synchrotron radiation reaction force. The adjoint method is then applied to study the runaway electron avalanche. Both the critical electric field and the growth rate for the avalanche are calculated using this fast and novel approach.

  19. Adjoint methods for aerodynamic wing design

    NASA Technical Reports Server (NTRS)

    Grossman, Bernard

    1993-01-01

    A model inverse design problem is used to investigate the effect of flow discontinuities on the optimization process. The optimization involves finding the cross-sectional area distribution of a duct that produces velocities that closely match a targeted velocity distribution. Quasi-one-dimensional flow theory is used, and the target is chosen to have a shock wave in its distribution. The objective function which quantifies the difference between the targeted and calculated velocity distributions may become non-smooth due to the interaction between the shock and the discretization of the flowfield. This paper offers two techniques to resolve the resulting problems for the optimization algorithms. The first, shock-fitting, involves careful integration of the objective function through the shock wave. The second, coordinate straining with shock penalty, uses a coordinate transformation to align the calculated shock with the target and then adds a penalty proportional to the square of the distance between the shocks. The techniques are tested using several popular sensitivity and optimization methods, including finite-differences, and direct and adjoint discrete sensitivity methods. Two optimization strategies, Gauss-Newton and sequential quadratic programming (SQP), are used to drive the objective function to a minimum.

  20. Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

    DOEpatents

    Van Benthem, Mark H.; Keenan, Michael R.

    2008-11-11

    A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

  1. Consistent Adjoint Driven Importance Sampling using Space, Energy and Angle

    SciTech Connect

    Peplow, Douglas E.; Mosher, Scott W; Evans, Thomas M

    2012-08-01

    For challenging radiation transport problems, hybrid methods combine the accuracy of Monte Carlo methods with the global information present in deterministic methods. One of the most successful hybrid methods is CADIS Consistent Adjoint Driven Importance Sampling. This method uses a deterministic adjoint solution to construct a biased source distribution and consistent weight windows to optimize a specific tally in a Monte Carlo calculation. The method has been implemented into transport codes using just the spatial and energy information from the deterministic adjoint and has been used in many applications to compute tallies with much higher figures-of-merit than analog calculations. CADIS also outperforms user-supplied importance values, which usually take long periods of user time to develop. This work extends CADIS to develop weight windows that are a function of the position, energy, and direction of the Monte Carlo particle. Two types of consistent source biasing are presented: one method that biases the source in space and energy while preserving the original directional distribution and one method that biases the source in space, energy, and direction. Seven simple example problems are presented which compare the use of the standard space/energy CADIS with the new space/energy/angle treatments.

  2. Analytic and Algorithmic Solution of Random Satisfiability Problems

    NASA Astrophysics Data System (ADS)

    Mézard, M.; Parisi, G.; Zecchina, R.

    2002-08-01

    We study the satisfiability of random Boolean expressions built from many clauses with K variables per clause (K-satisfiability). Expressions with a ratio α of clauses to variables less than a threshold αc are almost always satisfiable, whereas those with a ratio above this threshold are almost always unsatisfiable. We show the existence of an intermediate phase below αc, where the proliferation of metastable states is responsible for the onset of complexity in search algorithms. We introduce a class of optimization algorithms that can deal with these metastable states; one such algorithm has been tested successfully on the largest existing benchmark of K-satisfiability.

  3. Evolutionary Algorithms Approach to the Solution of Damage Detection Problems

    NASA Astrophysics Data System (ADS)

    Salazar Pinto, Pedro Yoajim; Begambre, Oscar

    2010-09-01

    In this work is proposed a new Self-Configured Hybrid Algorithm by combining the Particle Swarm Optimization (PSO) and a Genetic Algorithm (GA). The aim of the proposed strategy is to increase the stability and accuracy of the search. The central idea is the concept of Guide Particle, this particle (the best PSO global in each generation) transmits its information to a particle of the following PSO generation, which is controlled by the GA. Thus, the proposed hybrid has an elitism feature that improves its performance and guarantees the convergence of the procedure. In different test carried out in benchmark functions, reported in the international literature, a better performance in stability and accuracy was observed; therefore the new algorithm was used to identify damage in a simple supported beam using modal data. Finally, it is worth noting that the algorithm is independent of the initial definition of heuristic parameters.

  4. General Quantum Meet-in-the-Middle Search Algorithm Based on Target Solution of Fixed Weight

    NASA Astrophysics Data System (ADS)

    Fu, Xiang-Qun; Bao, Wan-Su; Wang, Xiang; Shi, Jian-Hong

    2016-10-01

    Similar to the classical meet-in-the-middle algorithm, the storage and computation complexity are the key factors that decide the efficiency of the quantum meet-in-the-middle algorithm. Aiming at the target vector of fixed weight, based on the quantum meet-in-the-middle algorithm, the algorithm for searching all n-product vectors with the same weight is presented, whose complexity is better than the exhaustive search algorithm. And the algorithm can reduce the storage complexity of the quantum meet-in-the-middle search algorithm. Then based on the algorithm and the knapsack vector of the Chor-Rivest public-key crypto of fixed weight d, we present a general quantum meet-in-the-middle search algorithm based on the target solution of fixed weight, whose computational complexity is \\sumj = 0d {(O(\\sqrt {Cn - k + 1d - j }) + O(C_kj log C_k^j))} with Σd i =0 Ck i memory cost. And the optimal value of k is given. Compared to the quantum meet-in-the-middle search algorithm for knapsack problem and the quantum algorithm for searching a target solution of fixed weight, the computational complexity of the algorithm is lower. And its storage complexity is smaller than the quantum meet-in-the-middle-algorithm. Supported by the National Basic Research Program of China under Grant No. 2013CB338002 and the National Natural Science Foundation of China under Grant No. 61502526

  5. ASYMPTOTICALLY OPTIMAL HIGH-ORDER ACCURATE ALGORITHMS FOR THE SOLUTION OF CERTAIN ELLIPTIC PDEs

    SciTech Connect

    Leonid Kunyansky, PhD

    2008-11-26

    The main goal of the project, "Asymptotically Optimal, High-Order Accurate Algorithms for the Solution of Certain Elliptic PDE's" (DE-FG02-03ER25577) was to develop fast, high-order algorithms for the solution of scattering problems and spectral problems of photonic crystals theory. The results we obtained lie in three areas: (1) asymptotically fast, high-order algorithms for the solution of eigenvalue problems of photonics, (2) fast, high-order algorithms for the solution of acoustic and electromagnetic scattering problems in the inhomogeneous media, and (3) inversion formulas and fast algorithms for the inverse source problem for the acoustic wave equation, with applications to thermo- and opto- acoustic tomography.

  6. Continuous adjoint sensitivity analysis for aerodynamic and acoustic optimization

    NASA Astrophysics Data System (ADS)

    Ghayour, Kaveh

    1999-11-01

    A gradient-based shape optimization methodology based on continuous adjoint sensitivities has been developed for two-dimensional steady Euler equations on unstructured meshes and the unsteady transonic small disturbance equation. The continuous adjoint sensitivities of the Helmholtz equation for acoustic applications have also been derived and discussed. The highlights of the developments for the steady two-dimensional Euler equations are the generalization of the airfoil surface boundary condition of the adjoint system to allow a proper closure of the Lagrangian functional associated with a general cost functional and the results for an inverse problem with density as the prescribed target. Furthermore, it has been demonstrated that a transformation to the natural coordinate system, in conjunction with the reduction of the governing state equations to the control surface, results in sensitivity integrals that are only a function of the tangential derivatives of the state variables. This approach alleviates the need for directional derivative computations with components along the normal to the control surface, which can render erroneous results. With regard to the unsteady transonic small disturbance equation (UTSD), the continuous adjoint methodology has been successfully extended to unsteady flows. It has been demonstrated that for periodic airfoil oscillations leading to limit-cycle behavior, the Lagrangian functional can be only closed if the time interval of interest spans one or more periods of the flow oscillations after the limit-cycle has been attained. The steady state and limit-cycle sensitivities are then validated by comparing with the brute-force derivatives. The importance of accounting for the flow circulation sensitivity, appearing in the form of a Dirac delta in the wall boundary condition at the trailing edge, has been stressed and demonstrated. Remarkably, the cost of an unsteady adjoint solution is about 0.2 times that of a UTSD solution

  7. A Numerical Algorithm for the Solution of a Phase-Field Model of Polycrystalline Materials

    SciTech Connect

    Dorr, M R; Fattebert, J; Wickett, M E; Belak, J F; Turchi, P A

    2008-12-04

    We describe an algorithm for the numerical solution of a phase-field model (PFM) of microstructure evolution in polycrystalline materials. The PFM system of equations includes a local order parameter, a quaternion representation of local orientation and a species composition parameter. The algorithm is based on the implicit integration of a semidiscretization of the PFM system using a backward difference formula (BDF) temporal discretization combined with a Newton-Krylov algorithm to solve the nonlinear system at each time step. The BDF algorithm is combined with a coordinate projection method to maintain quaternion unit length, which is related to an important solution invariant. A key element of the Newton-Krylov algorithm is the selection of a preconditioner to accelerate the convergence of the Generalized Minimum Residual algorithm used to solve the Jacobian linear system in each Newton step. Results are presented for the application of the algorithm to 2D and 3D examples.

  8. A multi-level solution algorithm for steady-state Markov chains

    NASA Technical Reports Server (NTRS)

    Horton, Graham; Leutenegger, Scott T.

    1993-01-01

    A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss-Seidel and optimal SOR algorithms for a variety of test problems. The multi-level method is compared and contrasted with the iterative aggregation-disaggregation algorithm of Takahashi.

  9. Using Strassen's algorithm to accelerate the solution of linear systems

    NASA Technical Reports Server (NTRS)

    Bailey, David H.; Lee, King; Simon, Horst D.

    1990-01-01

    Strassen's algorithm for fast matrix-matrix multiplication has been implemented for matrices of arbitrary shapes on the CRAY-2 and CRAY Y-MP supercomputers. Several techniques have been used to reduce the scratch space requirement for this algorithm while simultaneously preserving a high level of performance. When the resulting Strassen-based matrix multiply routine is combined with some routines from the new LAPACK library, LU decomposition can be performed with rates significantly higher than those achieved by conventional means. We succeeded in factoring a 2048 x 2048 matrix on the CRAY Y-MP at a rate equivalent to 325 MFLOPS.

  10. An algorithm for the systematic disturbance of optimal rotational solutions

    NASA Technical Reports Server (NTRS)

    Grunwald, Arthur J.; Kaiser, Mary K.

    1989-01-01

    An algorithm for introducing a systematic rotational disturbance into an optimal (i.e., single axis) rotational trajectory is described. This disturbance introduces a motion vector orthogonal to the quaternion-defined optimal rotation axis. By altering the magnitude of this vector, the degree of non-optimality can be controlled. The metric properties of the distortion parameter are described, with analogies to two-dimensional translational motion. This algorithm was implemented in a motion-control program on a three-dimensional graphic workstation. It supports a series of human performance studies on the detectability of rotational trajectory optimality by naive observers.

  11. A practical discrete-adjoint method for high-fidelity compressible turbulence simulations

    SciTech Connect

    Vishnampet, Ramanathan; Bodony, Daniel J.; Freund, Jonathan B.

    2015-03-15

    Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvements. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs, though this is predicated on the availability of a sufficiently accurate solution of the forward and adjoint systems. These are challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. Here, we analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical space–time discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient Runge–Kutta-like scheme, though it would be just first-order accurate if used outside the adjoint formulation for time integration, with finite-difference spatial operators for the adjoint system. Its computational cost only modestly exceeds that of the flow equations. We confirm that

  12. A practical discrete-adjoint method for high-fidelity compressible turbulence simulations

    NASA Astrophysics Data System (ADS)

    Vishnampet, Ramanathan; Bodony, Daniel J.; Freund, Jonathan B.

    2015-03-01

    Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvements. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs, though this is predicated on the availability of a sufficiently accurate solution of the forward and adjoint systems. These are challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. Here, we analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical space-time discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient Runge-Kutta-like scheme, though it would be just first-order accurate if used outside the adjoint formulation for time integration, with finite-difference spatial operators for the adjoint system. Its computational cost only modestly exceeds that of the flow equations. We confirm that its

  13. Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.

    PubMed

    Hüffner, Falk; Komusiewicz, Christian; Niedermeier, Rolf; Wernicke, Sebastian

    2017-01-01

    Fixed-parameter algorithms are designed to efficiently find optimal solutions to some computationally hard (NP-hard) problems by identifying and exploiting "small" problem-specific parameters. We survey practical techniques to develop such algorithms. Each technique is introduced and supported by case studies of applications to biological problems, with additional pointers to experimental results.

  14. Adjoint Optimization of Wind Plant Layouts

    DOE PAGES

    King, Ryan N.; Dykes, Katherine; Graf, Peter; ...

    2016-08-31

    Using adjoint optimization and three-dimensional Reynolds-averaged Navier Stokes (RANS) simulations, we present a new gradient-based approach for optimally siting wind turbines within utility-scale wind plants. By solving the adjoint equations of the flow model, the gradients needed for optimization are found at a cost that is independent of the number of control variables, thereby permitting optimization of large wind plants with many turbine locations. Moreover, compared to the common approach of superimposing prescribed wake deficits onto linearized flow models, the computational efficiency of the adjoint approach allows the use of higher-fidelity RANS flow models which can capture nonlinear turbulent flowmore » physics within a wind plant. The RANS flow model is implemented in the Python finite element package FEniCS and the derivation of the adjoint equations is automated within the dolfin-adjoint framework. Gradient-based optimization of wind turbine locations is demonstrated on idealized test cases that reveal new optimization heuristics such as rotational symmetry, local speedups, and nonlinear wake curvature effects. Layout optimization is also demonstrated on more complex wind rose shapes, including a full annual energy production (AEP) layout optimization over 36 inflow directions and 5 windspeed bins.« less

  15. Adjoint Optimization of Wind Plant Layouts

    SciTech Connect

    King, Ryan N.; Dykes, Katherine; Graf, Peter; Hamlington, Peter E.

    2016-08-31

    Using adjoint optimization and three-dimensional Reynolds-averaged Navier Stokes (RANS) simulations, we present a new gradient-based approach for optimally siting wind turbines within utility-scale wind plants. By solving the adjoint equations of the flow model, the gradients needed for optimization are found at a cost that is independent of the number of control variables, thereby permitting optimization of large wind plants with many turbine locations. Moreover, compared to the common approach of superimposing prescribed wake deficits onto linearized flow models, the computational efficiency of the adjoint approach allows the use of higher-fidelity RANS flow models which can capture nonlinear turbulent flow physics within a wind plant. The RANS flow model is implemented in the Python finite element package FEniCS and the derivation of the adjoint equations is automated within the dolfin-adjoint framework. Gradient-based optimization of wind turbine locations is demonstrated on idealized test cases that reveal new optimization heuristics such as rotational symmetry, local speedups, and nonlinear wake curvature effects. Layout optimization is also demonstrated on more complex wind rose shapes, including a full annual energy production (AEP) layout optimization over 36 inflow directions and 5 windspeed bins.

  16. Double-difference adjoint seismic tomography

    NASA Astrophysics Data System (ADS)

    Yuan, Yanhua O.; Simons, Frederik J.; Tromp, Jeroen

    2016-09-01

    We introduce a `double-difference' method for the inversion for seismic wave speed structure based on adjoint tomography. Differences between seismic observations and model predictions at individual stations may arise from factors other than structural heterogeneity, such as errors in the assumed source-time function, inaccurate timings and systematic uncertainties. To alleviate the corresponding non-uniqueness in the inverse problem, we construct differential measurements between stations, thereby reducing the influence of the source signature and systematic errors. We minimize the discrepancy between observations and simulations in terms of the differential measurements made on station pairs. We show how to implement the double-difference concept in adjoint tomography, both theoretically and practically. We compare the sensitivities of absolute and differential measurements. The former provide absolute information on structure along the ray paths between stations and sources, whereas the latter explain relative (and thus higher resolution) structural variations in areas close to the stations. Whereas in conventional tomography a measurement made on a single earthquake-station pair provides very limited structural information, in double-difference tomography one earthquake can actually resolve significant details of the structure. The double-difference methodology can be incorporated into the usual adjoint tomography workflow by simply pairing up all conventional measurements; the computational cost of the necessary adjoint simulations is largely unaffected. Rather than adding to the computational burden, the inversion of double-difference measurements merely modifies the construction of the adjoint sources for data assimilation.

  17. An Enhanced Artificial Bee Colony Algorithm with Solution Acceptance Rule and Probabilistic Multisearch.

    PubMed

    Yurtkuran, Alkın; Emel, Erdal

    2016-01-01

    The artificial bee colony (ABC) algorithm is a popular swarm based technique, which is inspired from the intelligent foraging behavior of honeybee swarms. This paper proposes a new variant of ABC algorithm, namely, enhanced ABC with solution acceptance rule and probabilistic multisearch (ABC-SA) to address global optimization problems. A new solution acceptance rule is proposed where, instead of greedy selection between old solution and new candidate solution, worse candidate solutions have a probability to be accepted. Additionally, the acceptance probability of worse candidates is nonlinearly decreased throughout the search process adaptively. Moreover, in order to improve the performance of the ABC and balance the intensification and diversification, a probabilistic multisearch strategy is presented. Three different search equations with distinctive characters are employed using predetermined search probabilities. By implementing a new solution acceptance rule and a probabilistic multisearch approach, the intensification and diversification performance of the ABC algorithm is improved. The proposed algorithm has been tested on well-known benchmark functions of varying dimensions by comparing against novel ABC variants, as well as several recent state-of-the-art algorithms. Computational results show that the proposed ABC-SA outperforms other ABC variants and is superior to state-of-the-art algorithms proposed in the literature.

  18. Adjoint-Free Variational Data Assimilation into a Regional Wave Model

    DTIC Science & Technology

    2015-07-01

    algorithm assimilating HFR data was ex- ecuted in 74 s on a single processor . A series of OI and a4DVAR experiments were con- ducted, involving assimilation...Adjoint-Free Variational Data Assimilation into a Regional Wave Model GLEB PANTELEEV University of Alaska Fairbanks, Fairbanks, Alaska, and National...Manuscript received 12 September 2014, in final form 23 December 2014) ABSTRACT A variational data assimilation algorithm is developed for the ocean

  19. Adjoint Techniques for Topology Optimization of Structures Under Damage Conditions

    NASA Technical Reports Server (NTRS)

    Akgun, Mehmet A.; Haftka, Raphael T.

    2000-01-01

    The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation (Haftka and Gurdal, 1992) in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers (Akgun et al., 1998a and 1999). It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages (Haftka et al., 1983). A common method for topology optimization is that of compliance minimization (Bendsoe, 1995) which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local

  20. Reconstruction of Mantle Convection in the Geological Past Using the Adjoint Method

    NASA Astrophysics Data System (ADS)

    Liu, L.; Gurnis, M.

    2006-12-01

    In mantle convection, earlier work has demonstrated the effectiveness of the adjoint method, widely applied in models of atmospheric circulation. With CitComS.py, the spherical finite element model of mantle convection, and the Pyre framework, we developed an adjoint of the energy equation which, together with the forward modeling, solves for temperature conditions in the past. Our model is applied to several problems, including plume heads impacting and eroding the lithosphere. The assumed true initial condition is a hot spherical blob in the lower mantle, and the final state of the forward model qualitatively shows little information on initial conditions. The adjoint method allows us to retrieve this unknown initial condition iteratively with a first guess. We tested different kinds of first guess initials, and found that a better knowledge of the true initial leads to a better converged solution, both in the sense of mismatch pattern and its RMS norm. Since we have limited knowledge of past mantle structures, earlier adjoint models in mantle convection used arbitrary first guesses which caused large errors in the retrieved initial condition. Our experiments show that a simple backward integration of the energy equation while neglecting thermal diffusion can be used as a first guess and leads to a smaller error. This is potentially important because the overall effectiveness of the adjoint methods is almost doubled using this optimal first guess. We are now experimenting with partial data assimilation with dynamic topography and plate kinematics in conjunction with seismic tomography models.

  1. Adjoint variational methods in nonconservative stability problems.

    NASA Technical Reports Server (NTRS)

    Prasad, S. N.; Herrmann, G.

    1972-01-01

    A general nonself-adjoint eigenvalue problem is examined and it is shown that the commonly employed approximate methods, such as the Galerkin procedure, the method of weighted residuals and the least square technique lack variational descriptions. When used in their previously known forms they do not yield stationary eigenvalues and eigenfunctions. With the help of an adjoint system, however, several analogous variational descriptions may be developed and it is shown in the present study that by properly restating the method of least squares, stationary eigenvalues may be obtained. Several properties of the adjoint eigenvalue problem, known only for a restricted group, are shown to exist for the more general class selected for study.

  2. Comparison of Ensemble and Adjoint Approaches to Variational Optimization of Observational Arrays

    NASA Astrophysics Data System (ADS)

    Nechaev, D.; Panteleev, G.; Yaremchuk, M.

    2015-12-01

    Comprehensive monitoring of the circulation in the Chukchi Sea and Bering Strait is one of the key prerequisites of the successful long-term forecast of the Arctic Ocean state. Since the number of continuously maintained observational platforms is restricted by logistical and political constraints, the configuration of such an observing system should be guided by an objective strategy that optimizes the observing system coverage, design, and the expenses of monitoring. The presented study addresses optimization of system consisting of a limited number of observational platforms with respect to reduction of the uncertainties in monitoring the volume/freshwater/heat transports through a set of key sections in the Chukchi Sea and Bering Strait. Variational algorithms for optimization of observational arrays are verified in the test bed of the set of 4Dvar optimized summer-fall circulations in the Pacific sector of the Arctic Ocean. The results of an optimization approach based on low-dimensional ensemble of model solutions is compared against a more conventional algorithm involving application of the tangent linear and adjoint models. Special attention is paid to the computational efficiency and portability of the optimization procedure.

  3. SQP-methods for solving optimal control problems with control and state constraints: adjoint variables, sensitivity analysis and real-time control

    NASA Astrophysics Data System (ADS)

    Büskens, Christof; Maurer, Helmut

    2000-08-01

    Parametric nonlinear optimal control problems subject to control and state constraints are studied. Two discretization methods are discussed that transcribe optimal control problems into nonlinear programming problems for which SQP-methods provide efficient solution methods. It is shown that SQP-methods can be used also for a check of second-order sufficient conditions and for a postoptimal calculation of adjoint variables. In addition, SQP-methods lead to a robust computation of sensitivity differentials of optimal solutions with respect to perturbation parameters. Numerical sensitivity analysis is the basis for real-time control approximations of perturbed solutions which are obtained by evaluating a first-order Taylor expansion with respect to the parameter. The proposed numerical methods are illustrated by the optimal control of a low-thrust satellite transfer to geosynchronous orbit and a complex control problem from aquanautics. The examples illustrate the robustness, accuracy and efficiency of the proposed numerical algorithms.

  4. Time dependent adjoint-based optimization for coupled fluid-structure problems

    NASA Astrophysics Data System (ADS)

    Mishra, Asitav; Mani, Karthik; Mavriplis, Dimitri; Sitaraman, Jay

    2015-07-01

    A formulation for sensitivity analysis of fully coupled time-dependent aeroelastic problems is given in this paper. Both forward sensitivity and adjoint sensitivity formulations are derived that correspond to analogues of the fully coupled non-linear aeroelastic analysis problem. Both sensitivity analysis formulations make use of the same iterative disciplinary solution techniques used for analysis, and make use of an analogous coupling strategy. The information passed between fluid and structural solvers is dimensionally equivalent in all cases, enabling the use of the same data structures for analysis, forward and adjoint problems. The fully coupled adjoint formulation is then used to perform rotor blade design optimization for a four bladed HART2 rotor in hover conditions started impulsively from rest. The effect of time step size and mesh resolution on optimization results is investigated.

  5. An Efficient Algorithm for Partitioning and Authenticating Problem-Solutions of eLeaming Contents

    ERIC Educational Resources Information Center

    Dewan, Jahangir; Chowdhury, Morshed; Batten, Lynn

    2013-01-01

    Content authenticity and correctness is one of the important challenges in eLearning as there can be many solutions to one specific problem in cyber space. Therefore, the authors feel it is necessary to map problems to solutions using graph partition and weighted bipartite matching. This article proposes an efficient algorithm to partition…

  6. Adjoint-Based Uncertainty Quantification with MCNP

    SciTech Connect

    Seifried, Jeffrey E.

    2011-09-01

    This work serves to quantify the instantaneous uncertainties in neutron transport simulations born from nuclear data and statistical counting uncertainties. Perturbation and adjoint theories are used to derive implicit sensitivity expressions. These expressions are transformed into forms that are convenient for construction with MCNP6, creating the ability to perform adjoint-based uncertainty quantification with MCNP6. These new tools are exercised on the depleted-uranium hybrid LIFE blanket, quantifying its sensitivities and uncertainties to important figures of merit. Overall, these uncertainty estimates are small (< 2%). Having quantified the sensitivities and uncertainties, physical understanding of the system is gained and some confidence in the simulation is acquired.

  7. Adjoint-Based Uncertainty Quantification with MCNP

    NASA Astrophysics Data System (ADS)

    Seifried, Jeffrey Edwin

    This work serves to quantify the instantaneous uncertainties in neutron transport simulations born from nuclear data and statistical counting uncertainties. Perturbation and adjoint theories are used to derive implicit sensitivity expressions. These expressions are transformed into forms that are convenient for construction with MCNP6, creating the ability to perform adjoint-based uncertainty quantification with MCNP6. These new tools are exercised on the depleted-uranium hybrid LIFE blanket, quantifying its sensitivities and uncertainties to important figures of merit. Overall, these uncertainty estimates are small (< 2%). Having quantified the sensitivities and uncertainties, physical understanding of the system is gained and some confidence in the simulation is acquired.

  8. Numerical solution of multiparameter spectral problems by high order finite different schemes

    NASA Astrophysics Data System (ADS)

    Amodio, Pierluigi; Settanni, Giuseppina

    2016-10-01

    We report on the progress achieved in the numerical simulation of self-adjoint multiparameter spectral problems for ordinary differential equations. We describe how to obtain a discrete problem by means of High Order Finite Difference Schemes and discuss its numerical solution. Based on this approach, we also define a recursive algorithm to compute approximations of the parameters by means of the solution of a set of problems converging to the original one.

  9. Comparative study of fusion algorithms and implementation of new efficient solution

    NASA Astrophysics Data System (ADS)

    Besrour, Amine; Snoussi, Hichem; Siala, Mohamed; Abdelkefi, Fatma

    2014-05-01

    High Dynamic Range (HDR) imaging has been the subject of significant researches over the past years, the goal of acquiring the best cinema-quality HDR images of fast-moving scenes using an efficient merging algorithm has not yet been achieved. In fact, through the years, many efficient algorithms have been implemented and developed. However, they are not yet efficient since they don't treat all the situations and they have not enough speed to ensure fast HDR image reconstitution. In this paper, we will present a full comparative analyze and study of the available fusion algorithms. Also, we will implement our personal algorithm which can be more optimized and faster than the existed ones. We will also present our investigated algorithm that has the advantage to be more optimized than the existing ones. This merging algorithm is related to our hardware solution allowing us to obtain four pictures with different exposures.

  10. An adaptive solution domain algorithm for solving multiphase flow equations

    NASA Astrophysics Data System (ADS)

    Katyal, A. K.; Parker, J. C.

    1992-01-01

    An adaptive solution domain (ASD) finite-element model for simulating hydrocarbon spills has been developed that is computationally more efficient than conventional numerical methods. Coupled flow of water and oil with an air phase at constant pressure is considered. In the ASD formulation, the solution domain for water- and oil-flow equations is restricted by eliminating elements from the global matrix assembly which are not experiencing significant changes in fluid saturations or pressures. When any nodes of an element exhibit changes in fluid pressures more than a stipulated tolerance τ, or changes in fluid saturations greater than tolerance τ 2 during the current time step, it is labeled active and included in the computations for the next iteration. This formulation achieves computational efficiency by solving the flow equations for only the part of the domain where changes in fluid pressure or the saturations take place above stipulated tolerances. Examples involving infiltration and redistribution of oil in 1- and 2-D spatial domains are described to illustrate the application of the ASD method and the savings in the processor time achieved by this formulation. Savings in the computational effort up to 84% during infiltration and 63% during redistribution were achieved for the 2-D example problem.

  11. Adjoint Sensitivity Analysis of Orbital Mechanics: Application to Computations of Observables' Partials with Respect to Harmonics of the Planetary Gravity Fields

    NASA Technical Reports Server (NTRS)

    Ustinov, Eugene A.; Sunseri, Richard F.

    2005-01-01

    An approach is presented to the inversion of gravity fields based on evaluation of partials of observables with respect to gravity harmonics using the solution of adjoint problem of orbital dynamics of the spacecraft. Corresponding adjoint operator is derived directly from the linear operator of the linearized forward problem of orbital dynamics. The resulting adjoint problem is similar to the forward problem and can be solved by the same methods. For given highest degree N of gravity harmonics desired, this method involves integration of N adjoint solutions as compared to integration of N2 partials of the forward solution with respect to gravity harmonics in the conventional approach. Thus, for higher resolution gravity models, this approach becomes increasingly more effective in terms of computer resources as compared to the approach based on the solution of the forward problem of orbital dynamics.

  12. Supersonic biplane design via adjoint method

    NASA Astrophysics Data System (ADS)

    Hu, Rui

    In developing the next generation supersonic transport airplane, two major challenges must be resolved. The fuel efficiency must be significantly improved, and the sonic boom propagating to the ground must be dramatically reduced. Both of these objectives can be achieved by reducing the shockwaves formed in supersonic flight. The Busemann biplane is famous for using favorable shockwave interaction to achieve nearly shock-free supersonic flight at its design Mach number. Its performance at off-design Mach numbers, however, can be very poor. This dissertation studies the performance of supersonic biplane airfoils at design and off-design conditions. The choked flow and flow-hysteresis phenomena of these biplanes are studied. These effects are due to finite thickness of the airfoils and non-uniqueness of the solution to the Euler equations, creating over an order of magnitude more wave drag than that predicted by supersonic thin airfoil theory. As a result, the off-design performance is the major barrier to the practical use of supersonic biplanes. The main contribution of this work is to drastically improve the off-design performance of supersonic biplanes by using an adjoint based aerodynamic optimization technique. The Busemann biplane is used as the baseline design, and its shape is altered to achieve optimal wave drags in series of Mach numbers ranging from 1.1 to 1.7, during both acceleration and deceleration conditions. The optimized biplane airfoils dramatically reduces the effects of the choked flow and flow-hysteresis phenomena, while maintaining a certain degree of favorable shockwave interaction effects at the design Mach number. Compared to a diamond shaped single airfoil of the same total thickness, the wave drag of our optimized biplane is lower at almost all Mach numbers, and is significantly lower at the design Mach number. In addition, by performing a Navier-Stokes solution for the optimized airfoil, it is verified that the optimized biplane improves

  13. Finite element solution for energy conservation using a highly stable explicit integration algorithm

    NASA Technical Reports Server (NTRS)

    Baker, A. J.; Manhardt, P. D.

    1972-01-01

    Theoretical derivation of a finite element solution algorithm for the transient energy conservation equation in multidimensional, stationary multi-media continua with irregular solution domain closure is considered. The complete finite element matrix forms for arbitrarily irregular discretizations are established, using natural coordinate function representations. The algorithm is embodied into a user-oriented computer program (COMOC) which obtains transient temperature distributions at the node points of the finite element discretization using a highly stable explicit integration procedure with automatic error control features. The finite element algorithm is shown to posses convergence with discretization for a transient sample problem. The condensed form for the specific heat element matrix is shown to be preferable to the consistent form. Computed results for diverse problems illustrate the versatility of COMOC, and easily prepared output subroutines are shown to allow quick engineering assessment of solution behavior.

  14. Finite-frequency tomography using adjoint methods-Methodology and examples using membrane surface waves

    NASA Astrophysics Data System (ADS)

    Tape, Carl; Liu, Qinya; Tromp, Jeroen

    2007-03-01

    We employ adjoint methods in a series of synthetic seismic tomography experiments to recover surface wave phase-speed models of southern California. Our approach involves computing the Fréchet derivative for tomographic inversions via the interaction between a forward wavefield, propagating from the source to the receivers, and an `adjoint' wavefield, propagating from the receivers back to the source. The forward wavefield is computed using a 2-D spectral-element method (SEM) and a phase-speed model for southern California. A `target' phase-speed model is used to generate the `data' at the receivers. We specify an objective or misfit function that defines a measure of misfit between data and synthetics. For a given receiver, the remaining differences between data and synthetics are time-reversed and used as the source of the adjoint wavefield. For each earthquake, the interaction between the regular and adjoint wavefields is used to construct finite-frequency sensitivity kernels, which we call event kernels. An event kernel may be thought of as a weighted sum of phase-specific (e.g. P) banana-doughnut kernels, with weights determined by the measurements. The overall sensitivity is simply the sum of event kernels, which defines the misfit kernel. The misfit kernel is multiplied by convenient orthonormal basis functions that are embedded in the SEM code, resulting in the gradient of the misfit function, that is, the Fréchet derivative. A non-linear conjugate gradient algorithm is used to iteratively improve the model while reducing the misfit function. We illustrate the construction of the gradient and the minimization algorithm, and consider various tomographic experiments, including source inversions, structural inversions and joint source-structure inversions. Finally, we draw connections between classical Hessian-based tomography and gradient-based adjoint tomography.

  15. An efficient parallel algorithm for the solution of a tridiagonal linear system of equations

    NASA Technical Reports Server (NTRS)

    Stone, H. S.

    1971-01-01

    Tridiagonal linear systems of equations are solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computations on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log sub 2 N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.

  16. Infrared point target detection based on exponentially weighted RLS algorithm and dual solution improvement

    NASA Astrophysics Data System (ADS)

    Zhu, Bin; Fan, Xiang; Ma, Dong-hui; Cheng, Zheng-dong

    2009-07-01

    The desire to maximize target detection range focuses attention on algorithms for detecting and tracking point targets. However, point target detection and tracking is a challenging task for two difficulties: the one is targets occupying only a few pixels or less in the complex noise and background clutter; the other is the requirement of computational load for real-time applications. Temporal signal processing algorithms offer superior clutter rejection to that of the standard spatial processing approaches. In this paper, the traditional single frame algorithm based on the background prediction is improved to consecutive multi-frames exponentially weighted recursive least squared (EWRLS) algorithm. Farther, the dual solution of EWRLS (DEWLS) is deduced to reduce the computational burden. DEWLS algorithm only uses the inner product of the points pair in training set. The predict result is given directly without compute any middle variable. Experimental results show that the RLS filter can largely increase the signal to noise ratio (SNR) of images; it has the best detection performance than other mentioned algorithms; moving targets can be detected within 2 or 3 frames with lower false alarm. Moreover, whit the dual solution improvement, the computational efficiency is enhanced over 41% to the EWRLS algorithm.

  17. [MEG inverse solution using Gauss-Newton algorithm modified by Moore-Penrose inversion].

    PubMed

    Li, J

    2001-06-01

    In magnetoencephalogram(MEG) basic studies, it is an important issue to estimate magnetic source parameters by inverse solution. It is known that the magnetic field equations are nonlinear, thus explicit solutions are difficult to obtain. However optimization methods are available to this parameter estimation. In many usually used nonlinear local optimization algorithms, Gauss-Newton's is of fast convergent speed. When this algorithm is used, the singularity of the Jacobien matrix about the minimum least square error must be considered carefully. If the matrix is singular, the equation for searching direction has no general solution. One way to overcome this problem is to use negative gradient as searching direction, but it may cause descent of convergent speed. Another way is known as Levenberg-Marquardt algorithm which makes the matrix non-singular by adding some improved factors to it. In this paper we utilize Moore-Penrose inversion for the solution of iterative searching direction equation. In appendix we demonstrate that the searching direction obtained by the proposed method is successful. Computer simulation also demonstrates that by reasonable selection of initial iterative values, the modified Gauss-Newton algorithm is effective for MEG inverse solution in the case with one or two source dipoles.

  18. A 4D-Var inversion system based on the icosahedral grid model (NICAM-TM 4D-Var v1.0) - Part 1: Offline forward and adjoint transport models

    NASA Astrophysics Data System (ADS)

    Niwa, Yosuke; Tomita, Hirofumi; Satoh, Masaki; Imasu, Ryoichi; Sawa, Yousuke; Tsuboi, Kazuhiro; Matsueda, Hidekazu; Machida, Toshinobu; Sasakawa, Motoki; Belan, Boris; Saigusa, Nobuko

    2017-03-01

    A four-dimensional variational (4D-Var) method is a popular algorithm for inverting atmospheric greenhouse gas (GHG) measurements. In order to meet the computationally intense 4D-Var iterative calculation, offline forward and adjoint transport models are developed based on the Nonhydrostatic ICosahedral Atmospheric Model (NICAM). By introducing flexibility into the temporal resolution of the input meteorological data, the forward model developed in this study is not only computationally efficient, it is also found to nearly match the transport performance of the online model. In a transport simulation of atmospheric carbon dioxide (CO2), the data-thinning error (error resulting from reduction in the time resolution of the meteorological data used to drive the offline transport model) is minimized by employing high temporal resolution data of the vertical diffusion coefficient; with a low 6-hourly temporal resolution, significant concentration biases near the surface are introduced. The new adjoint model can be run in discrete or continuous adjoint mode for the advection process. The discrete adjoint is characterized by perfect adjoint relationship with the forward model that switches off the flux limiter, while the continuous adjoint is characterized by an imperfect but reasonable adjoint relationship with its corresponding forward model. In the latter case, both the forward and adjoint models use the flux limiter to ensure the monotonicity of tracer concentrations and sensitivities. Trajectory analysis for high CO2 concentration events are performed to test adjoint sensitivities. We also demonstrate the potential usefulness of our adjoint model for diagnosing tracer transport. Both the offline forward and adjoint models have computational efficiency about 10 times higher than the online model. A description of our new 4D-Var system that includes an optimization method, along with its application in an atmospheric CO2 inversion and the effects of using either the

  19. Comparison of Nonequilibrium Solution Algorithms Applied to Chemically Stiff Hypersonic Flows

    NASA Technical Reports Server (NTRS)

    Palmer, Grant; Venkatapathy, Ethiraj

    1995-01-01

    Three solution algorithms, explicit under-relaxation, point implicit, and lower-upper symmetric Gauss-Seidel, are used to compute nonequilibrium flow around the Apollo 4 return capsule at the 62-km altitude point in its descent trajectory. By varying the Mach number, the efficiency and robustness of the solution algorithms were tested for different levels of chemical stiffness.The performance of the solution algorithms degraded as the Mach number and stiffness of the flow increased. At Mach 15 and 30, the lower-upper symmetric Gauss-Seidel method produces an eight order of magnitude drop in the energy residual in one-third to one-half the Cray C-90 computer time as compared to the point implicit and explicit under-relaxation methods. The explicit under-relaxation algorithm experienced convergence difficulties at Mach 30 and above. At Mach 40 the performance of the lower-upper symmetric Gauss-Seidel algorithm deteriorates to the point that it is out performed by the point implicit method. The effects of the viscous terms are investigated. Grid dependency questions are explored.

  20. Complex generalized minimal residual algorithm for iterative solution of quantum-mechanical reactive scattering equations

    NASA Technical Reports Server (NTRS)

    Chatfield, David C.; Reeves, Melissa S.; Truhlar, Donald G.; Duneczky, Csilla; Schwenke, David W.

    1992-01-01

    Complex dense matrices corresponding to the D + H2 and O + HD reactions were solved using a complex generalized minimal residual (GMRes) algorithm described by Saad and Schultz (1986) and Saad (1990). To provide a test case with a different structure, the H + H2 system was also considered. It is shown that the computational effort for solutions with the GMRes algorithm depends on the dimension of the linear system, the total energy of the scattering problem, and the accuracy criterion. In several cases with dimensions in the range 1110-5632, the GMRes algorithm outperformed the LAPACK direct solver, with speedups for the linear equation solution as large as a factor of 23.

  1. A generalized front marching algorithm for the solution of the eikonal equation

    NASA Astrophysics Data System (ADS)

    Covello, Paul; Rodrigue, Garry

    2003-07-01

    A new front marching algorithm for solving the eikonal equation is presented. An important property of the algorithm is that it can be used on nodes that are located on highly distorted grids or on nodes that are randomly located. When the nodes are located on an orthogonal grid, the method is first-order accurate and is shown to be a generalization of the front marching algorithm in (Proc. Natl. Acad. Sci. 93 (4) (1996) 1591). The accuracy of the method is also shown to be dependent on the principle curvature of the wave front solution. Numerical results on a variety of node configurations as well as on shadow, nonconvex and nondifferentiable solutions are presented.

  2. A general algorithm for the solution of Kepler's equation for elliptic orbits

    NASA Technical Reports Server (NTRS)

    Ng, E. W.

    1979-01-01

    An efficient algorithm is presented for the solution of Kepler's equation f(E)=E-M-e sin E=0, where e is the eccentricity, M the mean anomaly and E the eccentric anomaly. This algorithm is based on simple initial approximations that are cubics in M, and an iterative scheme that is a slight generalization of the Newton-Raphson method. Extensive testing of this algorithm has been performed on the UNIVAC 1108 computer. Solutions for 20,000 pairs of values of e and M show that for single precision, 42.0% of the cases require one iteration, 57.8% two and 0.2% three. For double precision one additional iteration is required.

  3. Chiral phases of fundamental and adjoint quarks

    SciTech Connect

    Natale, A. A.

    2016-01-22

    We consider a QCD chiral symmetry breaking model where the gap equation contains an effective confining propagator and a dressed gluon propagator with a dynamically generated mass. This model is able to explain the ratios between the chiral transition and deconfinement temperatures in the case of fundamental and adjoint quarks. It also predicts the recovery of the chiral symmetry for a large number of quarks (n{sub f} ≈ 11 – 13) in agreement with lattice data.

  4. Chiral phases of fundamental and adjoint quarks

    NASA Astrophysics Data System (ADS)

    Natale, A. A.

    2016-01-01

    We consider a QCD chiral symmetry breaking model where the gap equation contains an effective confining propagator and a dressed gluon propagator with a dynamically generated mass. This model is able to explain the ratios between the chiral transition and deconfinement temperatures in the case of fundamental and adjoint quarks. It also predicts the recovery of the chiral symmetry for a large number of quarks (nf ≈ 11 - 13) in agreement with lattice data.

  5. Optimal ignition placement using nonlinear adjoint looping

    NASA Astrophysics Data System (ADS)

    Qadri, Ubaid; Schmid, Peter; Magri, Luca; Ihme, Matthias

    2016-11-01

    Spark ignition of a turbulent mixture of fuel and oxidizer is a highly sensitive process. Traditionally, a large number of parametric studies are used to determine the effects of different factors on ignition and this can be quite tedious. In contrast, we treat ignition as an initial value problem and seek to find the initial condition that maximizes a given cost function. We use direct numerical simulation of the low Mach number equations with finite rate one-step chemistry, and of the corresponding adjoint equations, to study an axisymmetric jet diffusion flame. We find the L - 2 norm of the temperature field integrated over a short time to be a suitable cost function. We find that the adjoint fields localize around the flame front, identifying the most sensitive region of the flow. The adjoint fields provide gradient information that we use as part of an optimization loop to converge to a local optimal ignition location. We find that the optimal locations correspond with the stoichiometric surface downstream of the jet inlet plane. The methods and results of this study can be easily applied to more complex flow geometries.

  6. Supersymmetric descendants of self-adjointly extended quantum mechanical Hamiltonians

    NASA Astrophysics Data System (ADS)

    Al-Hashimi, M. H.; Salman, M.; Shalaby, A.; Wiese, U.-J.

    2013-10-01

    We consider the descendants of self-adjointly extended Hamiltonians in supersymmetric quantum mechanics on a half-line, on an interval, and on a punctured line or interval. While there is a 4-parameter family of self-adjointly extended Hamiltonians on a punctured line, only a 3-parameter sub-family has supersymmetric descendants that are themselves self-adjoint. We also address the self-adjointness of an operator related to the supercharge, and point out that only a sub-class of its most general self-adjoint extensions is physical. Besides a general characterization of self-adjoint extensions and their supersymmetric descendants, we explicitly consider concrete examples, including a particle in a box with general boundary conditions, with and without an additional point interaction. We also discuss bulk-boundary resonances and their manifestation in the supersymmetric descendant.

  7. A structured multi-block solution-adaptive mesh algorithm with mesh quality assessment

    NASA Technical Reports Server (NTRS)

    Ingram, Clint L.; Laflin, Kelly R.; Mcrae, D. Scott

    1995-01-01

    The dynamic solution adaptive grid algorithm, DSAGA3D, is extended to automatically adapt 2-D structured multi-block grids, including adaption of the block boundaries. The extension is general, requiring only input data concerning block structure, connectivity, and boundary conditions. Imbedded grid singular points are permitted, but must be prevented from moving in space. Solutions for workshop cases 1 and 2 are obtained on multi-block grids and illustrate both increased resolution of and alignment with the solution. A mesh quality assessment criteria is proposed to determine how well a given mesh resolves and aligns with the solution obtained upon it. The criteria is used to evaluate the grid quality for solutions of workshop case 6 obtained on both static and dynamically adapted grids. The results indicate that this criteria shows promise as a means of evaluating resolution.

  8. Sensitivity kernels for viscoelastic loading based on adjoint methods

    NASA Astrophysics Data System (ADS)

    Al-Attar, David; Tromp, Jeroen

    2014-01-01

    Observations of glacial isostatic adjustment (GIA) allow for inferences to be made about mantle viscosity, ice sheet history and other related parameters. Typically, this inverse problem can be formulated as minimizing the misfit between the given observations and a corresponding set of synthetic data. When the number of parameters is large, solution of such optimization problems can be computationally challenging. A practical, albeit non-ideal, solution is to use gradient-based optimization. Although the gradient of the misfit required in such methods could be calculated approximately using finite differences, the necessary computation time grows linearly with the number of model parameters, and so this is often infeasible. A far better approach is to apply the `adjoint method', which allows the exact gradient to be calculated from a single solution of the forward problem, along with one solution of the associated adjoint problem. As a first step towards applying the adjoint method to the GIA inverse problem, we consider its application to a simpler viscoelastic loading problem in which gravitationally self-consistent ocean loading is neglected. The earth model considered is non-rotating, self-gravitating, compressible, hydrostatically pre-stressed, laterally heterogeneous and possesses a Maxwell solid rheology. We determine adjoint equations and Fréchet kernels for this problem based on a Lagrange multiplier method. Given an objective functional J defined in terms of the surface deformation fields, we show that its first-order perturbation can be written δ J = int _{MS}K_{η }δ ln η dV +int _{t0}^{t1}int _{partial M}K_{dot{σ }} δ dot{σ } dS dt, where δ ln η = δη/η denotes relative viscosity variations in solid regions MS, dV is the volume element, δ dot{σ } is the perturbation to the time derivative of the surface load which is defined on the earth model's surface ∂M and for times [t0, t1] and dS is the surface element on ∂M. The `viscosity

  9. Aerodynamic Shape Optimization using an Evolutionary Algorithm

    NASA Technical Reports Server (NTRS)

    Hoist, Terry L.; Pulliam, Thomas H.

    2003-01-01

    A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem-both single and two-objective variations is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

  10. Aerodynamic Shape Optimization using an Evolutionary Algorithm

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.; Pulliam, Thomas H.; Kwak, Dochan (Technical Monitor)

    2003-01-01

    A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem, both single and two-objective variations, is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

  11. The finite state projection algorithm for the solution of the chemical master equation

    NASA Astrophysics Data System (ADS)

    Munsky, Brian; Khammash, Mustafa

    2006-01-01

    This article introduces the finite state projection (FSP) method for use in the stochastic analysis of chemically reacting systems. One can describe the chemical populations of such systems with probability density vectors that evolve according to a set of linear ordinary differential equations known as the chemical master equation (CME). Unlike Monte Carlo methods such as the stochastic simulation algorithm (SSA) or τ leaping, the FSP directly solves or approximates the solution of the CME. If the CME describes a system that has a finite number of distinct population vectors, the FSP method provides an exact analytical solution. When an infinite or extremely large number of population variations is possible, the state space can be truncated, and the FSP method provides a certificate of accuracy for how closely the truncated space approximation matches the true solution. The proposed FSP algorithm systematically increases the projection space in order to meet prespecified tolerance in the total probability density error. For any system in which a sufficiently accurate FSP exists, the FSP algorithm is shown to converge in a finite number of steps. The FSP is utilized to solve two examples taken from the field of systems biology, and comparisons are made between the FSP, the SSA, and τ leaping algorithms. In both examples, the FSP outperforms the SSA in terms of accuracy as well as computational efficiency. Furthermore, due to very small molecular counts in these particular examples, the FSP also performs far more effectively than τ leaping methods.

  12. Implementation of Lamarckian concepts in a Genetic Algorithm for structure solution from powder diffraction data

    NASA Astrophysics Data System (ADS)

    Turner, Giles W.; Tedesco, Emilio; Harris, Kenneth D. M.; Johnston, Roy L.; Kariuki, Benson M.

    2000-04-01

    Previous implementations of Genetic Algorithms in direct-space strategies for structure solution from powder diffraction data have employed the operations of mating, mutation and natural selection, with the fitness of each structure based on comparison between calculated and experimental powder diffraction patterns (we define fitness as a function of weighted-profile R-factor Rwp). We report an extension to this method, in which each structure generated in the Genetic Algorithm is subjected to local minimization of Rwp with respect to structural variables. This approach represents an implementation of Lamarckian concepts of evolution, and is found to give significant improvements in efficiency and reliability.

  13. Adaptive-mesh-based algorithm for fluorescence molecular tomography using an analytical solution

    NASA Astrophysics Data System (ADS)

    Wang, Daifa; Song, Xiaolei; Bai, Jing

    2007-07-01

    Fluorescence molecular tomography (FMT) has become an important method for in-vivo imaging of small animals. It has been widely used for tumor genesis, cancer detection, metastasis, drug discovery, and gene therapy. In this study, an algorithm for FMT is proposed to obtain accurate and fast reconstruction by combining an adaptive mesh refinement technique and an analytical solution of diffusion equation. Numerical studies have been performed on a parallel plate FMT system with matching fluid. The reconstructions obtained show that the algorithm is efficient in computation time, and they also maintain image quality.

  14. Solution algorithms for non-linear singularly perturbed optimal control problems

    NASA Technical Reports Server (NTRS)

    Ardema, M. D.

    1983-01-01

    The applicability and usefulness of several classical and other methods for solving the two-point boundary-value problem which arises in non-linear singularly perturbed optimal control are assessed. Specific algorithms of the Picard, Newton and averaging types are formally developed for this class of problem. The computational requirements associated with each algorithm are analysed and compared with the computational requirement of the method of matched asymptotic expansions. Approximate solutions to a linear and a non-linear problem are obtained by each method and compared.

  15. Stochastic coalescence in finite systems: an algorithm for the numerical solution of the multivariate master equation.

    NASA Astrophysics Data System (ADS)

    Alfonso, Lester; Zamora, Jose; Cruz, Pedro

    2015-04-01

    The stochastic approach to coagulation considers the coalescence process going in a system of a finite number of particles enclosed in a finite volume. Within this approach, the full description of the system can be obtained from the solution of the multivariate master equation, which models the evolution of the probability distribution of the state vector for the number of particles of a given mass. Unfortunately, due to its complexity, only limited results were obtained for certain type of kernels and monodisperse initial conditions. In this work, a novel numerical algorithm for the solution of the multivariate master equation for stochastic coalescence that works for any type of kernels and initial conditions is introduced. The performance of the method was checked by comparing the numerically calculated particle mass spectrum with analytical solutions obtained for the constant and sum kernels, with an excellent correspondence between the analytical and numerical solutions. In order to increase the speedup of the algorithm, software parallelization techniques with OpenMP standard were used, along with an implementation in order to take advantage of new accelerator technologies. Simulations results show an important speedup of the parallelized algorithms. This study was funded by a grant from Consejo Nacional de Ciencia y Tecnologia de Mexico SEP-CONACYT CB-131879. The authors also thanks LUFAC® Computacion SA de CV for CPU time and all the support provided.

  16. Practical Aerodynamic Design Optimization Based on the Navier-Stokes Equations and a Discrete Adjoint Method

    NASA Technical Reports Server (NTRS)

    Grossman, Bernard

    1999-01-01

    The technical details are summarized below: Compressible and incompressible versions of a three-dimensional unstructured mesh Reynolds-averaged Navier-Stokes flow solver have been differentiated and resulting derivatives have been verified by comparisons with finite differences and a complex-variable approach. In this implementation, the turbulence model is fully coupled with the flow equations in order to achieve this consistency. The accuracy demonstrated in the current work represents the first time that such an approach has been successfully implemented. The accuracy of a number of simplifying approximations to the linearizations of the residual have been examined. A first-order approximation to the dependent variables in both the adjoint and design equations has been investigated. The effects of a "frozen" eddy viscosity and the ramifications of neglecting some mesh sensitivity terms were also examined. It has been found that none of the approximations yielded derivatives of acceptable accuracy and were often of incorrect sign. However, numerical experiments indicate that an incomplete convergence of the adjoint system often yield sufficiently accurate derivatives, thereby significantly lowering the time required for computing sensitivity information. The convergence rate of the adjoint solver relative to the flow solver has been examined. Inviscid adjoint solutions typically require one to four times the cost of a flow solution, while for turbulent adjoint computations, this ratio can reach as high as eight to ten. Numerical experiments have shown that the adjoint solver can stall before converging the solution to machine accuracy, particularly for viscous cases. A possible remedy for this phenomenon would be to include the complete higher-order linearization in the preconditioning step, or to employ a simple form of mesh sequencing to obtain better approximations to the solution through the use of coarser meshes. . An efficient surface parameterization based

  17. Practical Aerodynamic Design Optimization Based on the Navier-Stokes Equations and a Discrete Adjoint Method

    NASA Technical Reports Server (NTRS)

    Grossman, Bernard

    1999-01-01

    Compressible and incompressible versions of a three-dimensional unstructured mesh Reynolds-averaged Navier-Stokes flow solver have been differentiated and resulting derivatives have been verified by comparisons with finite differences and a complex-variable approach. In this implementation, the turbulence model is fully coupled with the flow equations in order to achieve this consistency. The accuracy demonstrated in the current work represents the first time that such an approach has been successfully implemented. The accuracy of a number of simplifying approximations to the linearizations of the residual have been examined. A first-order approximation to the dependent variables in both the adjoint and design equations has been investigated. The effects of a "frozen" eddy viscosity and the ramifications of neglecting some mesh sensitivity terms were also examined. It has been found that none of the approximations yielded derivatives of acceptable accuracy and were often of incorrect sign. However, numerical experiments indicate that an incomplete convergence of the adjoint system often yield sufficiently accurate derivatives, thereby significantly lowering the time required for computing sensitivity information. The convergence rate of the adjoint solver relative to the flow solver has been examined. Inviscid adjoint solutions typically require one to four times the cost of a flow solution, while for turbulent adjoint computations, this ratio can reach as high as eight to ten. Numerical experiments have shown that the adjoint solver can stall before converging the solution to machine accuracy, particularly for viscous cases. A possible remedy for this phenomenon would be to include the complete higher-order linearization in the preconditioning step, or to employ a simple form of mesh sequencing to obtain better approximations to the solution through the use of coarser meshes. An efficient surface parameterization based on a free-form deformation technique has been

  18. An investigation of parallel implicit solution algorithms for incompressible flows on unstructured topologies

    NASA Astrophysics Data System (ADS)

    Hyams, Daniel Gaiennie

    The primary objective of this study is to develop an efficient, scalable, parallel incompressible flow solver capable of performing viscous, high Reynolds number flow simulations for complex geometries using multielement unstructured grids. The present parallel unstructured viscous flow solver is based on domain decomposition for concurrent solution within subdomains assigned to multiple processors. The solution algorithm employs iterative solution of the implicit approximation, and its software implementation uses MPI message passing for interprocessor communication. Key parallelization issues addressed in this work are (1) definition of the iteration hierarchy, (2) treatment of connectivity between subdomain interfaces, and (3) methods for coupling of subdomains. A heuristic, semiempirical performance estimate is developed and evaluated. With this performance estimate, scalability characteristics of the solution algorithm may be calculated for a particular architecture and/or predicted for a given problem a priori. Validation and verification of the solution procedure are carried out on several small steady and unsteady model problems with excellent agreement to experimental, theoretical, and numerical results. The present parallel flow solver is demonstrated for large-scale meshes with viscous sublayer resolution (y+ ˜ 1) and approximately 106 points or more. Complex geometry 3D applications include (1) a full-scale ship hull, (2) a SUBOFF model hull with stern appendages, (3) a fully-configured high-lift transport, and (4) a maneuvering tiltrotor aircraft. The first three computations are shown to agree well with available experimental data. The maneuvering tiltrotor aircraft simulation is a demonstration of capability for the parallel solution algorithm in the context of an extremely complex geometry and unsteady flowfield.

  19. Parametric effects of CFL number and artificial smoothing on numerical solutions using implicit approximate factorization algorithm

    NASA Technical Reports Server (NTRS)

    Daso, E. O.

    1986-01-01

    An implicit approximate factorization algorithm is employed to quantify the parametric effects of Courant number and artificial smoothing on numerical solutions of the unsteady 3-D Euler equations for a windmilling propeller (low speed) flow field. The results show that propeller global or performance chracteristics vary strongly with Courant number and artificial dissipation parameters, though the variation is such less severe at high Courant numbers. Candidate sets of Courant number and dissipation parameters could result in parameter-dependent solutions. Parameter-independent numerical solutions can be obtained if low values of the dissipation parameter-time step ratio are used in the computations. Furthermore, it is realized that too much artificial damping can degrade numerical stability. Finally, it is demonstrated that highly resolved meshes may, in some cases, delay convergence, thereby suggesting some optimum cell size for a given flow solution. It is suspected that improper boundary treatment may account for the cell size constraint.

  20. Investigation of ALEGRA shock hydrocode algorithms using an exact free surface jet flow solution.

    SciTech Connect

    Hanks, Bradley Wright.; Robinson, Allen C

    2014-01-01

    Computational testing of the arbitrary Lagrangian-Eulerian shock physics code, ALEGRA, is presented using an exact solution that is very similar to a shaped charge jet flow. The solution is a steady, isentropic, subsonic free surface flow with significant compression and release and is provided as a steady state initial condition. There should be no shocks and no entropy production throughout the problem. The purpose of this test problem is to present a detailed and challenging computation in order to provide evidence for algorithmic strengths and weaknesses in ALEGRA which should be examined further. The results of this work are intended to be used to guide future algorithmic improvements in the spirit of test-driven development processes.

  1. A finite element solution algorithm for the Navier-Stokes equations

    NASA Technical Reports Server (NTRS)

    Baker, A. J.

    1974-01-01

    A finite element solution algorithm is established for the two-dimensional Navier-Stokes equations governing the steady-state kinematics and thermodynamics of a variable viscosity, compressible multiple-species fluid. For an incompressible fluid, the motion may be transient as well. The primitive dependent variables are replaced by a vorticity-streamfunction description valid in domains spanned by rectangular, cylindrical and spherical coordinate systems. Use of derived variables provides a uniformly elliptic partial differential equation description for the Navier-Stokes system, and for which the finite element algorithm is established. Explicit non-linearity is accepted by the theory, since no psuedo-variational principles are employed, and there is no requirement for either computational mesh or solution domain closure regularity. Boundary condition constraints on the normal flux and tangential distribution of all computational variables, as well as velocity, are routinely piecewise enforceable on domain closure segments arbitrarily oriented with respect to a global reference frame.

  2. Implementation of a block Lanczos algorithm for Eigenproblem solution of gyroscopic systems

    NASA Technical Reports Server (NTRS)

    Gupta, Kajal K.; Lawson, Charles L.

    1987-01-01

    The details of implementation of a general numerical procedure developed for the accurate and economical computation of natural frequencies and associated modes of any elastic structure rotating along an arbitrary axis are described. A block version of the Lanczos algorithm is derived for the solution that fully exploits associated matrix sparsity and employs only real numbers in all relevant computations. It is also capable of determining multiple roots and proves to be most efficient when compared to other, similar, exisiting techniques.

  3. Elementary operators on self-adjoint operators

    NASA Astrophysics Data System (ADS)

    Molnar, Lajos; Semrl, Peter

    2007-03-01

    Let H be a Hilbert space and let and be standard *-operator algebras on H. Denote by and the set of all self-adjoint operators in and , respectively. Assume that and are surjective maps such that M(AM*(B)A)=M(A)BM(A) and M*(BM(A)B)=M*(B)AM*(B) for every pair , . Then there exist an invertible bounded linear or conjugate-linear operator and a constant c[set membership, variant]{-1,1} such that M(A)=cTAT*, , and M*(B)=cT*BT, .

  4. Adjoint sensitivity analysis of an ultrawideband antenna

    SciTech Connect

    Stephanson, M B; White, D A

    2011-07-28

    The frequency domain finite element method using H(curl)-conforming finite elements is a robust technique for full-wave analysis of antennas. As computers become more powerful, it is becoming feasible to not only predict antenna performance, but also to compute sensitivity of antenna performance with respect to multiple parameters. This sensitivity information can then be used for optimization of the design or specification of manufacturing tolerances. In this paper we review the Adjoint Method for sensitivity calculation, and apply it to the problem of optimizing a Ultrawideband antenna.

  5. Supersymmetric descendants of self-adjointly extended quantum mechanical Hamiltonians

    SciTech Connect

    Al-Hashimi, M.H.; Salman, M.; Shalaby, A.; Wiese, U.-J.

    2013-10-15

    We consider the descendants of self-adjointly extended Hamiltonians in supersymmetric quantum mechanics on a half-line, on an interval, and on a punctured line or interval. While there is a 4-parameter family of self-adjointly extended Hamiltonians on a punctured line, only a 3-parameter sub-family has supersymmetric descendants that are themselves self-adjoint. We also address the self-adjointness of an operator related to the supercharge, and point out that only a sub-class of its most general self-adjoint extensions is physical. Besides a general characterization of self-adjoint extensions and their supersymmetric descendants, we explicitly consider concrete examples, including a particle in a box with general boundary conditions, with and without an additional point interaction. We also discuss bulk-boundary resonances and their manifestation in the supersymmetric descendant. -- Highlights: •Self-adjoint extension theory and contact interactions. •Application of self-adjoint extensions to supersymmetry. •Contact interactions in finite volume with Robin boundary condition.

  6. Hybrid solution of stochastic optimal control problems using Gauss pseudospectral method and generalized polynomial chaos algorithms

    NASA Astrophysics Data System (ADS)

    Cottrill, Gerald C.

    A hybrid numerical algorithm combining the Gauss Pseudospectral Method (GPM) with a Generalized Polynomial Chaos (gPC) method to solve nonlinear stochastic optimal control problems with constraint uncertainties is presented. TheGPM and gPC have been shown to be spectrally accurate numerical methods for solving deterministic optimal control problems and stochastic differential equations, respectively. The gPC uses collocation nodes to sample the random space, which are then inserted into the differential equations and solved by applying standard differential equation methods. The resulting set of deterministic solutions is used to characterize the distribution of the solution by constructing a polynomial representation of the output as a function of uncertain parameters. Optimal control problems are especially challenging to solve since they often include path constraints, bounded controls, boundary conditions, and require solutions that minimize a cost functional. Adding random parameters can make these problems even more challenging. The hybrid algorithm presented in this dissertation is the first time the GPM and gPC algorithms have been combined to solve optimal control problems with random parameters. Using the GPM in the gPC construct provides minimum cost deterministic solutions used in stochastic computations that meet path, control, and boundary constraints, thus extending current gPC methods to be applicable to stochastic optimal control problems. The hybrid GPM-gPC algorithm was applied to two concept demonstration problems: a nonlinear optimal control problem with multiplicative uncertain elements and a trajectory optimization problem simulating an aircraft flying through a threat field where exact locations of the threats are unknown. The results show that the expected value, variance, and covariance statistics of the polynomial output function approximations of the state, control, cost, and terminal time variables agree with Monte-Carlo simulation

  7. Application of Harmony Search algorithm to the solution of groundwater management models

    NASA Astrophysics Data System (ADS)

    Tamer Ayvaz, M.

    2009-06-01

    This study proposes a groundwater resources management model in which the solution is performed through a combined simulation-optimization model. A modular three-dimensional finite difference groundwater flow model, MODFLOW is used as the simulation model. This model is then combined with a Harmony Search (HS) optimization algorithm which is based on the musical process of searching for a perfect state of harmony. The performance of the proposed HS based management model is tested on three separate groundwater management problems: (i) maximization of total pumping from an aquifer (steady-state); (ii) minimization of the total pumping cost to satisfy the given demand (steady-state); and (iii) minimization of the pumping cost to satisfy the given demand for multiple management periods (transient). The sensitivity of HS algorithm is evaluated by performing a sensitivity analysis which aims to determine the impact of related solution parameters on convergence behavior. The results show that HS yields nearly same or better solutions than the previous solution methods and may be used to solve management problems in groundwater modeling.

  8. Tsunami waveform inversion by adjoint methods

    NASA Astrophysics Data System (ADS)

    Pires, Carlos; Miranda, Pedro M. A.

    2001-09-01

    An adjoint method for tsunami waveform inversion is proposed, as an alternative to the technique based on Green's functions of the linear long wave model. The method has the advantage of being able to use the nonlinear shallow water equations, or other appropriate equation sets, and to optimize an initial state given as a linear or nonlinear function of any set of free parameters. This last facility is used to perform explicit optimization of the focal fault parameters, characterizing the initial sea surface displacement of tsunamigenic earthquakes. The proposed methodology is validated with experiments using synthetic data, showing the possibility of recovering all relevant details of a tsunami source from tide gauge observations, providing that the adjoint method is constrained in an appropriate manner. It is found, as in other methods, that the inversion skill of tsunami sources increases with the azimuthal and temporal coverage of assimilated tide gauge stations; furthermore, it is shown that the eigenvalue analysis of the Hessian matrix of the cost function provides a consistent and useful methodology to choose the subset of independent parameters that can be inverted with a given dataset of observations and to evaluate the error of the inversion process. The method is also applied to real tide gauge series, from the tsunami of the February 28, 1969, Gorringe Bank earthquake, suggesting some reasonable changes to the assumed focal parameters of that event. It is suggested that the method proposed may be able to deal with transient tsunami sources such as those generated by submarine landslides.

  9. A new algorithm of ionospheric tomography——two-step solution

    NASA Astrophysics Data System (ADS)

    Wen, Debao

    The inherent non-ideal geometry of ground-based global navigation satellite system (GNSS) observation stations distribution results in limited-angle tomographic inverse problems that are ill-posed. To cope with the above problem, a new tomographic algorithm, which is called two-step solution (TSS), is presented in this paper. In the new method, the electron density can be estimated by using two steps: 1) Phillips smoothing method (PSM) is first used to resolve the ill-posed problem in ionospheric tomography system; 2) The "coarse" solution of PSM is then input as the initial value of multiplicative algebraic reconstruction technique (MART) and improved by iterative mode. Numerical simulation experiment demonstrates that the two-step solution is feasible to GNSS-based ionospheric tomography and superior to PSM or MART alone.

  10. The solution of the Elrod algorithm for a dynamically loaded journal bearing using multigrid techniques

    NASA Technical Reports Server (NTRS)

    Woods, Claudia M.; Brewe, David E.

    1988-01-01

    A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed utilizing a multigrid iteration technique. The method is compared with a noniterative approach in terms of computational time and accuracy. The computational model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobsson-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via a smeared mass or striated flow extending to both surfaces in the film gap. The mixed nature of the equations (parabolic in the full film zone and hyperbolic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

  11. Adjoint of the global Eulerian-Lagrangian coupled atmospheric transport model (A-GELCA v1.0): development and validation

    NASA Astrophysics Data System (ADS)

    Belikov, Dmitry A.; Maksyutov, Shamil; Yaremchuk, Alexey; Ganshin, Alexander; Kaminski, Thomas; Blessing, Simon; Sasakawa, Motoki; Gomez-Pelaez, Angel J.; Starchenko, Alexander

    2016-02-01

    We present the development of the Adjoint of the Global Eulerian-Lagrangian Coupled Atmospheric (A-GELCA) model that consists of the National Institute for Environmental Studies (NIES) model as an Eulerian three-dimensional transport model (TM), and FLEXPART (FLEXible PARTicle dispersion model) as the Lagrangian Particle Dispersion Model (LPDM). The forward tangent linear and adjoint components of the Eulerian model were constructed directly from the original NIES TM code using an automatic differentiation tool known as TAF (Transformation of Algorithms in Fortran; http://www.FastOpt.com, with additional manual pre- and post-processing aimed at improving transparency and clarity of the code and optimizing the performance of the computing, including MPI (Message Passing Interface). The Lagrangian component did not require any code modification, as LPDMs are self-adjoint and track a significant number of particles backward in time in order to calculate the sensitivity of the observations to the neighboring emission areas. The constructed Eulerian adjoint was coupled with the Lagrangian component at a time boundary in the global domain. The simulations presented in this work were performed using the A-GELCA model in forward and adjoint modes. The forward simulation shows that the coupled model improves reproduction of the seasonal cycle and short-term variability of CO2. Mean bias and standard deviation for five of the six Siberian sites considered decrease roughly by 1 ppm when using the coupled model. The adjoint of the Eulerian model was shown, through several numerical tests, to be very accurate (within machine epsilon with mismatch around to ±6 e-14) compared to direct forward sensitivity calculations. The developed adjoint of the coupled model combines the flux conservation and stability of an Eulerian discrete adjoint formulation with the flexibility, accuracy, and high resolution of a Lagrangian backward trajectory formulation. A-GELCA will be incorporated

  12. Efficient checkpointing schemes for depletion perturbation solutions on memory-limited architectures

    SciTech Connect

    Stripling, H. F.; Adams, M. L.; Hawkins, W. D.

    2013-07-01

    We describe a methodology for decreasing the memory footprint and machine I/O load associated with the need to access a forward solution during an adjoint solve. Specifically, we are interested in the depletion perturbation equations, where terms in the adjoint Bateman and transport equations depend on the forward flux solution. Checkpointing is the procedure of storing snapshots of the forward solution to disk and using these snapshots to recompute the parts of the forward solution that are necessary for the adjoint solve. For large problems, however, the storage cost of just a few copies of an angular flux vector can exceed the available RAM on the host machine. We propose a methodology that does not checkpoint the angular flux vector; instead, we write and store converged source moments, which are typically of a much lower dimension than the angular flux solution. This reduces the memory footprint and I/O load of the problem, but requires that we perform single sweeps to reconstruct flux vectors on demand. We argue that this trade-off is exactly the kind of algorithm that will scale on advanced, memory-limited architectures. We analyze the cost, in terms of FLOPS and memory footprint, of five checkpointing schemes. We also provide computational results that support the analysis and show that the memory-for-work trade off does improve time to solution. (authors)

  13. Adjoint equations and analysis of complex systems: Application to virus infection modelling

    NASA Astrophysics Data System (ADS)

    Marchuk, G. I.; Shutyaev, V.; Bocharov, G.

    2005-12-01

    Recent development of applied mathematics is characterized by ever increasing attempts to apply the modelling and computational approaches across various areas of the life sciences. The need for a rigorous analysis of the complex system dynamics in immunology has been recognized since more than three decades ago. The aim of the present paper is to draw attention to the method of adjoint equations. The methodology enables to obtain information about physical processes and examine the sensitivity of complex dynamical systems. This provides a basis for a better understanding of the causal relationships between the immune system's performance and its parameters and helps to improve the experimental design in the solution of applied problems. We show how the adjoint equations can be used to explain the changes in hepatitis B virus infection dynamics between individual patients.

  14. Parameter identification of multi-body railway vehicle models - Application of the adjoint state approach

    NASA Astrophysics Data System (ADS)

    Kraft, S.; Puel, G.; Aubry, D.; Funfschilling, C.

    2016-12-01

    For the calibration of multi-body models of railway vehicles, the identification of the model parameters from on-track measurement is required. This involves the solution of an inverse problem by minimising the misfit function which describes the distance between model and measurement using optimisation methods. The application of gradient-based optimisation methods is advantageous but necessitates an efficient approach for the computation of the gradients considering the large number of model parameters and the costly evaluation of the forward model. This work shows that the application of the adjoint state approach to the nonlinear vehicle-track multi-body system is suitable, reducing on the one hand the computational cost and increasing on the other hand the precision of the gradients. Gradients from the adjoint state method are computed for vehicle models and validated taking into account measurement noise.

  15. An evaluation of solution algorithms and numerical approximation methods for modeling an ion exchange process

    SciTech Connect

    Bu Sunyoung Huang Jingfang Boyer, Treavor H. Miller, Cass T.

    2010-07-01

    The focus of this work is on the modeling of an ion exchange process that occurs in drinking water treatment applications. The model formulation consists of a two-scale model in which a set of microscale diffusion equations representing ion exchange resin particles that vary in size and age are coupled through a boundary condition with a macroscopic ordinary differential equation (ODE), which represents the concentration of a species in a well-mixed reactor. We introduce a new age-averaged model (AAM) that averages all ion exchange particle ages for a given size particle to avoid the expensive Monte-Carlo simulation associated with previous modeling applications. We discuss two different numerical schemes to approximate both the original Monte-Carlo algorithm and the new AAM for this two-scale problem. The first scheme is based on the finite element formulation in space coupled with an existing backward difference formula-based ODE solver in time. The second scheme uses an integral equation based Krylov deferred correction (KDC) method and a fast elliptic solver (FES) for the resulting elliptic equations. Numerical results are presented to validate the new AAM algorithm, which is also shown to be more computationally efficient than the original Monte-Carlo algorithm. We also demonstrate that the higher order KDC scheme is more efficient than the traditional finite element solution approach and this advantage becomes increasingly important as the desired accuracy of the solution increases. We also discuss issues of smoothness, which affect the efficiency of the KDC-FES approach, and outline additional algorithmic changes that would further improve the efficiency of these developing methods for a wide range of applications.

  16. An Evaluation of Solution Algorithms and Numerical Approximation Methods for Modeling an Ion Exchange Process.

    PubMed

    Bu, Sunyoung; Huang, Jingfang; Boyer, Treavor H; Miller, Cass T

    2010-07-01

    The focus of this work is on the modeling of an ion exchange process that occurs in drinking water treatment applications. The model formulation consists of a two-scale model in which a set of microscale diffusion equations representing ion exchange resin particles that vary in size and age are coupled through a boundary condition with a macroscopic ordinary differential equation (ODE), which represents the concentration of a species in a well-mixed reactor. We introduce a new age-averaged model (AAM) that averages all ion exchange particle ages for a given size particle to avoid the expensive Monte-Carlo simulation associated with previous modeling applications. We discuss two different numerical schemes to approximate both the original Monte Carlo algorithm and the new AAM for this two-scale problem. The first scheme is based on the finite element formulation in space coupled with an existing backward-difference-formula-based ODE solver in time. The second scheme uses an integral equation based Krylov deferred correction (KDC) method and a fast elliptic solver (FES) for the resulting elliptic equations. Numerical results are presented to validate the new AAM algorithm, which is also shown to be more computationally efficient than the original Monte Carlo algorithm. We also demonstrate that the higher order KDC scheme is more efficient than the traditional finite element solution approach and this advantage becomes increasingly important as the desired accuracy of the solution increases. We also discuss issues of smoothness, which affect the efficiency of the KDC-FES approach, and outline additional algorithmic changes that would further improve the efficiency of these developing methods for a wide range of applications.

  17. An Evaluation of Solution Algorithms and Numerical Approximation Methods for Modeling an Ion Exchange Process

    PubMed Central

    Bu, Sunyoung; Huang, Jingfang; Boyer, Treavor H.; Miller, Cass T.

    2010-01-01

    The focus of this work is on the modeling of an ion exchange process that occurs in drinking water treatment applications. The model formulation consists of a two-scale model in which a set of microscale diffusion equations representing ion exchange resin particles that vary in size and age are coupled through a boundary condition with a macroscopic ordinary differential equation (ODE), which represents the concentration of a species in a well-mixed reactor. We introduce a new age-averaged model (AAM) that averages all ion exchange particle ages for a given size particle to avoid the expensive Monte-Carlo simulation associated with previous modeling applications. We discuss two different numerical schemes to approximate both the original Monte Carlo algorithm and the new AAM for this two-scale problem. The first scheme is based on the finite element formulation in space coupled with an existing backward-difference-formula-based ODE solver in time. The second scheme uses an integral equation based Krylov deferred correction (KDC) method and a fast elliptic solver (FES) for the resulting elliptic equations. Numerical results are presented to validate the new AAM algorithm, which is also shown to be more computationally efficient than the original Monte Carlo algorithm. We also demonstrate that the higher order KDC scheme is more efficient than the traditional finite element solution approach and this advantage becomes increasingly important as the desired accuracy of the solution increases. We also discuss issues of smoothness, which affect the efficiency of the KDC-FES approach, and outline additional algorithmic changes that would further improve the efficiency of these developing methods for a wide range of applications. PMID:20577570

  18. Factor Analysis with EM Algorithm Never Gives Improper Solutions when Sample Covariance and Initial Parameter Matrices Are Proper

    ERIC Educational Resources Information Center

    Adachi, Kohei

    2013-01-01

    Rubin and Thayer ("Psychometrika," 47:69-76, 1982) proposed the EM algorithm for exploratory and confirmatory maximum likelihood factor analysis. In this paper, we prove the following fact: the EM algorithm always gives a proper solution with positive unique variances and factor correlations with absolute values that do not exceed one,…

  19. Adjoints and Low-rank Covariance Representation

    NASA Technical Reports Server (NTRS)

    Tippett, Michael K.; Cohn, Stephen E.

    2000-01-01

    Quantitative measures of the uncertainty of Earth System estimates can be as important as the estimates themselves. Second moments of estimation errors are described by the covariance matrix, whose direct calculation is impractical when the number of degrees of freedom of the system state is large. Ensemble and reduced-state approaches to prediction and data assimilation replace full estimation error covariance matrices by low-rank approximations. The appropriateness of such approximations depends on the spectrum of the full error covariance matrix, whose calculation is also often impractical. Here we examine the situation where the error covariance is a linear transformation of a forcing error covariance. We use operator norms and adjoints to relate the appropriateness of low-rank representations to the conditioning of this transformation. The analysis is used to investigate low-rank representations of the steady-state response to random forcing of an idealized discrete-time dynamical system.

  20. Gauge mediation models with adjoint messengers

    NASA Astrophysics Data System (ADS)

    Gogoladze, Ilia; Mustafayev, Azar; Shafi, Qaisar; Ün, Cem Salih

    2016-10-01

    We present a class of models in the framework of gauge mediation supersymmetry breaking where the messenger fields transform in the adjoint representation of the standard model gauge symmetry. To avoid unacceptably light right-handed sleptons in the spectrum we introduce a nonzero U (1 )B-L D-term. This leads to an additional contribution to the soft supersymmetry breaking mass terms which makes the right-handed slepton masses compatible with the current experimental bounds. We show that in this framework the observed 125 GeV Higgs boson mass can be accommodated with the sleptons accessible at the LHC, while the squarks and gluinos lie in the multi-TeV range. We also discuss the issue of the fine-tuning and show that the desired relic dark matter abundance can also be accommodated.

  1. Efficient solution of liquid state integral equations using the Newton-GMRES algorithm

    NASA Astrophysics Data System (ADS)

    Booth, Michael J.; Schlijper, A. G.; Scales, L. E.; Haymet, A. D. J.

    1999-06-01

    We present examples of the accurate, robust and efficient solution of Ornstein-Zernike type integral equations which describe the structure of both homogeneous and inhomogeneous fluids. In this work we use the Newton-GMRES algorithm as implemented in the public-domain nonlinear Krylov solvers NKSOL [ P. Brown, Y. Saad, SIAM J. Sci. Stat. Comput. 11 (1990) 450] and NITSOL [ M. Pernice, H.F. Walker, SIAM J. Sci. Comput. 19 (1998) 302]. We compare and contrast this method with more traditional approaches in the literature, using Picard iteration (successive-substitution) and hybrid Newton-Raphson and Picard methods, and a recent vector extrapolation method [ H.H.H. Homeier, S. Rast, H. Krienke, Comput. Phys. Commun. 92 (1995) 188]. We find that both the performance and ease of implementation of these nonlinear solvers recommend them for the solution of this class of problem.

  2. Introduction of Parallel GPGPU Acceleration Algorithms for the Solution of Radiative Transfer

    NASA Technical Reports Server (NTRS)

    Godoy, William F.; Liu, Xu

    2011-01-01

    General-purpose computing on graphics processing units (GPGPU) is a recent technique that allows the parallel graphics processing unit (GPU) to accelerate calculations performed sequentially by the central processing unit (CPU). To introduce GPGPU to radiative transfer, the Gauss-Seidel solution of the well-known expressions for 1-D and 3-D homogeneous, isotropic media is selected as a test case. Different algorithms are introduced to balance memory and GPU-CPU communication, critical aspects of GPGPU. Results show that speed-ups of one to two orders of magnitude are obtained when compared to sequential solutions. The underlying value of GPGPU is its potential extension in radiative solvers (e.g., Monte Carlo, discrete ordinates) at a minimal learning curve.

  3. Implementation of a Multichannel Serial Data Streaming Algorithm using the Xilinx Serial RapidIO Solution

    NASA Technical Reports Server (NTRS)

    Doxley, Charles A.

    2016-01-01

    In the current world of applications that use reconfigurable technology implemented on field programmable gate arrays (FPGAs), there is a need for flexible architectures that can grow as the systems evolve. A project has limited resources and a fixed set of requirements that development efforts are tasked to meet. Designers must develop robust solutions that practically meet the current customer demands and also have the ability to grow for future performance. This paper describes the development of a high speed serial data streaming algorithm that allows for transmission of multiple data channels over a single serial link. The technique has the ability to change to meet new applications developed for future design considerations. This approach uses the Xilinx Serial RapidIO LOGICORE Solution to implement a flexible infrastructure to meet the current project requirements with the ability to adapt future system designs.

  4. Adjoint sensitivity analysis of plasmonic structures using the FDTD method.

    PubMed

    Zhang, Yu; Ahmed, Osman S; Bakr, Mohamed H

    2014-05-15

    We present an adjoint variable method for estimating the sensitivities of arbitrary responses with respect to the parameters of dispersive discontinuities in nanoplasmonic devices. Our theory is formulated in terms of the electric field components at the vicinity of perturbed discontinuities. The adjoint sensitivities are computed using at most one extra finite-difference time-domain (FDTD) simulation regardless of the number of parameters. Our approach is illustrated through the sensitivity analysis of an add-drop coupler consisting of a square ring resonator between two parallel waveguides. The computed adjoint sensitivities of the scattering parameters are compared with those obtained using the accurate but computationally expensive central finite difference approach.

  5. Self-adjointness and conservation laws of difference equations

    NASA Astrophysics Data System (ADS)

    Peng, Linyu

    2015-06-01

    A general theorem on conservation laws for arbitrary difference equations is proved. The theorem is based on an introduction of an adjoint system related with a given difference system, and it does not require the existence of a difference Lagrangian. It is proved that the system, combined by the original system and its adjoint system, is governed by a variational principle, which inherits all symmetries of the original system. Noether's theorem can then be applied. With some special techniques, e.g. self-adjointness properties, this allows us to obtain conservation laws for difference equations, which are not necessary governed by Lagrangian formalisms.

  6. Generation of perturbations by means of decoupled equations and their adjoints

    NASA Astrophysics Data System (ADS)

    Torres Del Castillo, G. F.

    1990-10-01

    It is shown that the procedure introduced by Wald for constructing solutions of a coupled system of linear partial differential equations from the solution of a single equation, based on the concept of the adjoint of a linear partial differential operator, can be extended to equations involving spinor fields, matrix fields and two or more fields. Some results concerning massless spinor fields are presented and the application of the method to linear perturbations of Yang-Mills fields and of Einstein-Maxwell fields is indicated.

  7. An inverse problem strategy based on forward model evaluations: Gradient-based optimization without adjoint solves

    SciTech Connect

    Aguilo Valentin, Miguel Alejandro

    2016-07-01

    This study presents a new nonlinear programming formulation for the solution of inverse problems. First, a general inverse problem formulation based on the compliance error functional is presented. The proposed error functional enables the computation of the Lagrange multipliers, and thus the first order derivative information, at the expense of just one model evaluation. Therefore, the calculation of the Lagrange multipliers does not require the solution of the computationally intensive adjoint problem. This leads to significant speedups for large-scale, gradient-based inverse problems.

  8. Quantum algorithms and mathematical formulations of biomolecular solutions of the vertex cover problem in the finite-dimensional hilbert space.

    PubMed

    Chang, Weng-Long; Ren, Ting-Ting; Feng, Mang

    2015-01-01

    In this paper, it is shown that the proposed quantum algorithm for implementing Boolean circuits generated from the DNA-based algorithm solving the vertex-cover problem of any graph G with m edges and n vertices is the optimal quantum algorithm. Next, it is also demonstrated that mathematical solutions of the same biomolecular solutions are represented in terms of a unit vector in the finite-dimensional Hilbert space. Furthermore, for testing our theory, a nuclear magnetic resonance (NMR) experiment of three quantum bits to solve the simplest vertex-cover problem is completed.

  9. A finite-difference approximate-factorization algorithm for solution of the unsteady transonic small-disturbance equation

    NASA Technical Reports Server (NTRS)

    Batina, John T.

    1992-01-01

    A time-accurate approximate-factorization (AF) algorithm is described for solution of the three-dimensional unsteady transonic small-disturbance equation. The AF algorithm consists of a time-linearization procedure coupled with a subiteration technique. The algorithm is the basis for the Computational Aeroelasticity Program-Transonic Small Disturbance (CAP-TSD) computer code, which was developed for the analysis of unsteady aerodynamics and aeroelasticity of realistic aircraft configurations. The paper describes details on the governing flow equations and boundary conditions, with an emphasis on documenting the finite-difference formulas of the AF algorithm.

  10. A forward operator and its adjoint for GPS slant total delays

    NASA Astrophysics Data System (ADS)

    Zus, Florian; Dick, Galina; Heise, Stefan; Wickert, Jens

    2015-05-01

    In a recent study we developed a fast and accurate algorithm to compute Global Positioning System (GPS) Slant Total Delay (STDs) utilizing numerical weather model data. Having developed a forward operator we construct in this study the tangent linear (adjoint) operator by application of the chain rule of differential calculus in forward (reverse) mode. Armed with these operators we show in a simulation study the potential benefit of GPS STDs in inverse modeling. We conclude that the developed operators are tailored for three (four)-dimensional variational data assimilation and/or travel time tomography.

  11. Sensitivity of Lumped Constraints Using the Adjoint Method

    NASA Technical Reports Server (NTRS)

    Akgun, Mehmet A.; Haftka, Raphael T.; Wu, K. Chauncey; Walsh, Joanne L.

    1999-01-01

    Adjoint sensitivity calculation of stress, buckling and displacement constraints may be much less expensive than direct sensitivity calculation when the number of load cases is large. Adjoint stress and displacement sensitivities are available in the literature. Expressions for local buckling sensitivity of isotropic plate elements are derived in this study. Computational efficiency of the adjoint method is sensitive to the number of constraints and, therefore, the method benefits from constraint lumping. A continuum version of the Kreisselmeier-Steinhauser (KS) function is chosen to lump constraints. The adjoint and direct methods are compared for three examples: a truss structure, a simple HSCT wing model, and a large HSCT model. These sensitivity derivatives are then used in optimization.

  12. Optimizing Spectral Wave Estimates with Adjoint-Based Sensitivity Maps

    DTIC Science & Technology

    2014-02-18

    forecasts of nearshore wave conditions are important to a diverse constituency, including vacation destinations such as Miami Beach or San Diego, coastal...a collection of information if it does not display a currently valid OMB control number. 1. REPORT DATE 18 FEB 2014 2. REPORT TYPE 3. DATES...Sensitivity maps for wave spectra For any type of adjoint, sensitivity maps may be constructed from adjoint output to track the response of system properties

  13. The Riccati equation with variable coefficients expansion algorithm to find more exact solutions of nonlinear differential equations

    NASA Astrophysics Data System (ADS)

    Yan, Zhenya

    2003-04-01

    In this paper based on a system of Riccati equations with variable coefficients, we present a new Riccati equation with variable coefficients expansion method and its algorithm, which are direct and more powerful than the tanh-function method, sine-cosine method, the generalized hyperbolic-function method and the generalized Riccati equation with constant coefficient expansion method to construct more new exact solutions of nonlinear differential equations in mathematical physics. A pair of generalized Hamiltonian equations is chosen to illustrate our algorithm such that more families of new exact solutions are obtained which contain soliton-like solution and periodic solutions. This algorithm can also be applied to other nonlinear differential equations.

  14. Fast inverse scattering solutions using the distorted Born iterative method and the multilevel fast multipole algorithm

    PubMed Central

    Hesford, Andrew J.; Chew, Weng C.

    2010-01-01

    The distorted Born iterative method (DBIM) computes iterative solutions to nonlinear inverse scattering problems through successive linear approximations. By decomposing the scattered field into a superposition of scattering by an inhomogeneous background and by a material perturbation, large or high-contrast variations in medium properties can be imaged through iterations that are each subject to the distorted Born approximation. However, the need to repeatedly compute forward solutions still imposes a very heavy computational burden. To ameliorate this problem, the multilevel fast multipole algorithm (MLFMA) has been applied as a forward solver within the DBIM. The MLFMA computes forward solutions in linear time for volumetric scatterers. The typically regular distribution and shape of scattering elements in the inverse scattering problem allow the method to take advantage of data redundancy and reduce the computational demands of the normally expensive MLFMA setup. Additional benefits are gained by employing Kaczmarz-like iterations, where partial measurements are used to accelerate convergence. Numerical results demonstrate both the efficiency of the forward solver and the successful application of the inverse method to imaging problems with dimensions in the neighborhood of ten wavelengths. PMID:20707438

  15. Fast inverse scattering solutions using the distorted Born iterative method and the multilevel fast multipole algorithm.

    PubMed

    Hesford, Andrew J; Chew, Weng C

    2010-08-01

    The distorted Born iterative method (DBIM) computes iterative solutions to nonlinear inverse scattering problems through successive linear approximations. By decomposing the scattered field into a superposition of scattering by an inhomogeneous background and by a material perturbation, large or high-contrast variations in medium properties can be imaged through iterations that are each subject to the distorted Born approximation. However, the need to repeatedly compute forward solutions still imposes a very heavy computational burden. To ameliorate this problem, the multilevel fast multipole algorithm (MLFMA) has been applied as a forward solver within the DBIM. The MLFMA computes forward solutions in linear time for volumetric scatterers. The typically regular distribution and shape of scattering elements in the inverse scattering problem allow the method to take advantage of data redundancy and reduce the computational demands of the normally expensive MLFMA setup. Additional benefits are gained by employing Kaczmarz-like iterations, where partial measurements are used to accelerate convergence. Numerical results demonstrate both the efficiency of the forward solver and the successful application of the inverse method to imaging problems with dimensions in the neighborhood of ten wavelengths.

  16. Global adjoint tomography: First-generation model

    SciTech Connect

    Bozdag, Ebru; Peter, Daniel; Lefebvre, Matthieu; Komatitsch, Dimitri; Tromp, Jeroen; Hill, Judith C.; Podhorszki, Norbert; Pugmire, David

    2016-09-22

    We present the first-generation global tomographic model constructed based on adjoint tomography, an iterative full-waveform inversion technique. Synthetic seismograms were calculated using GPU-accelerated spectral-element simulations of global seismic wave propagation, accommodating effects due to 3-D anelastic crust & mantle structure, topography & bathymetry, the ocean load, ellipticity, rotation, and self-gravitation. Fréchet derivatives were calculated in 3-D anelastic models based on an adjoint-state method. The simulations were performed on the Cray XK7 named ‘Titan’, a computer with 18 688 GPU accelerators housed at Oak Ridge National Laboratory. The transversely isotropic global model is the result of 15 tomographic iterations, which systematically reduced differences between observed and simulated three-component seismograms. Our starting model combined 3-D mantle model S362ANI with 3-D crustal model Crust2.0. We simultaneously inverted for structure in the crust and mantle, thereby eliminating the need for widely used ‘crustal corrections’. We used data from 253 earthquakes in the magnitude range 5.8 ≤ Mw ≤ 7.0. We started inversions by combining ~30 s body-wave data with ~60 s surface-wave data. The shortest period of the surface waves was gradually decreased, and in the last three iterations we combined ~17 s body waves with ~45 s surface waves. We started using 180 min long seismograms after the 12th iteration and assimilated minor- and major-arc body and surface waves. The 15th iteration model features enhancements of well-known slabs, an enhanced image of the Samoa/Tahiti plume, as well as various other plumes and hotspots, such as Caroline, Galapagos, Yellowstone and Erebus. Furthermore, we see clear improvements in slab resolution along the Hellenic and Japan Arcs, as well as subduction along the East of Scotia Plate, which does not exist in the starting model. Point-spread function tests demonstrate that we are approaching

  17. Global adjoint tomography: First-generation model

    DOE PAGES

    Bozdag, Ebru; Peter, Daniel; Lefebvre, Matthieu; ...

    2016-09-22

    We present the first-generation global tomographic model constructed based on adjoint tomography, an iterative full-waveform inversion technique. Synthetic seismograms were calculated using GPU-accelerated spectral-element simulations of global seismic wave propagation, accommodating effects due to 3-D anelastic crust & mantle structure, topography & bathymetry, the ocean load, ellipticity, rotation, and self-gravitation. Fréchet derivatives were calculated in 3-D anelastic models based on an adjoint-state method. The simulations were performed on the Cray XK7 named ‘Titan’, a computer with 18 688 GPU accelerators housed at Oak Ridge National Laboratory. The transversely isotropic global model is the result of 15 tomographic iterations, which systematicallymore » reduced differences between observed and simulated three-component seismograms. Our starting model combined 3-D mantle model S362ANI with 3-D crustal model Crust2.0. We simultaneously inverted for structure in the crust and mantle, thereby eliminating the need for widely used ‘crustal corrections’. We used data from 253 earthquakes in the magnitude range 5.8 ≤ Mw ≤ 7.0. We started inversions by combining ~30 s body-wave data with ~60 s surface-wave data. The shortest period of the surface waves was gradually decreased, and in the last three iterations we combined ~17 s body waves with ~45 s surface waves. We started using 180 min long seismograms after the 12th iteration and assimilated minor- and major-arc body and surface waves. The 15th iteration model features enhancements of well-known slabs, an enhanced image of the Samoa/Tahiti plume, as well as various other plumes and hotspots, such as Caroline, Galapagos, Yellowstone and Erebus. Furthermore, we see clear improvements in slab resolution along the Hellenic and Japan Arcs, as well as subduction along the East of Scotia Plate, which does not exist in the starting model. Point-spread function tests demonstrate that we are approaching

  18. Global adjoint tomography: first-generation model

    NASA Astrophysics Data System (ADS)

    Bozdağ, Ebru; Peter, Daniel; Lefebvre, Matthieu; Komatitsch, Dimitri; Tromp, Jeroen; Hill, Judith; Podhorszki, Norbert; Pugmire, David

    2016-12-01

    We present the first-generation global tomographic model constructed based on adjoint tomography, an iterative full-waveform inversion technique. Synthetic seismograms were calculated using GPU-accelerated spectral-element simulations of global seismic wave propagation, accommodating effects due to 3-D anelastic crust & mantle structure, topography & bathymetry, the ocean load, ellipticity, rotation, and self-gravitation. Fréchet derivatives were calculated in 3-D anelastic models based on an adjoint-state method. The simulations were performed on the Cray XK7 named `Titan', a computer with 18 688 GPU accelerators housed at Oak Ridge National Laboratory. The transversely isotropic global model is the result of 15 tomographic iterations, which systematically reduced differences between observed and simulated three-component seismograms. Our starting model combined 3-D mantle model S362ANI with 3-D crustal model Crust2.0. We simultaneously inverted for structure in the crust and mantle, thereby eliminating the need for widely used `crustal corrections'. We used data from 253 earthquakes in the magnitude range 5.8 ≤ Mw ≤ 7.0. We started inversions by combining ˜30 s body-wave data with ˜60 s surface-wave data. The shortest period of the surface waves was gradually decreased, and in the last three iterations we combined ˜17 s body waves with ˜45 s surface waves. We started using 180 min long seismograms after the 12th iteration and assimilated minor- and major-arc body and surface waves. The 15th iteration model features enhancements of well-known slabs, an enhanced image of the Samoa/Tahiti plume, as well as various other plumes and hotspots, such as Caroline, Galapagos, Yellowstone and Erebus. Furthermore, we see clear improvements in slab resolution along the Hellenic and Japan Arcs, as well as subduction along the East of Scotia Plate, which does not exist in the starting model. Point-spread function tests demonstrate that we are approaching the resolution

  19. Comparison of adjoint and nudging methods to initialise ice sheet model basal conditions

    NASA Astrophysics Data System (ADS)

    Mosbeux, Cyrille; Gillet-Chaulet, Fabien; Gagliardini, Olivier

    2016-07-01

    Ice flow models are now routinely used to forecast the ice sheets' contribution to 21st century sea-level rise. For such short term simulations, the model response is greatly affected by the initial conditions. Data assimilation algorithms have been developed to invert for the friction of the ice on its bedrock using observed surface velocities. A drawback of these methods is that remaining uncertainties, especially in the bedrock elevation, lead to non-physical ice flux divergence anomalies resulting in undesirable transient effects. In this study, we compare two different assimilation algorithms based on adjoints and nudging to constrain both bedrock friction and elevation. Using synthetic twin experiments with realistic observation errors, we show that the two algorithms lead to similar performances in reconstructing both variables and allow the flux divergence anomalies to be significantly reduced.

  20. Parallelized Three-Dimensional Resistivity Inversion Using Finite Elements And Adjoint State Methods

    NASA Astrophysics Data System (ADS)

    Schaa, Ralf; Gross, Lutz; Du Plessis, Jaco

    2015-04-01

    The resistivity method is one of the oldest geophysical exploration methods, which employs one pair of electrodes to inject current into the ground and one or more pairs of electrodes to measure the electrical potential difference. The potential difference is a non-linear function of the subsurface resistivity distribution described by an elliptic partial differential equation (PDE) of the Poisson type. Inversion of measured potentials solves for the subsurface resistivity represented by PDE coefficients. With increasing advances in multichannel resistivity acquisition systems (systems with more than 60 channels and full waveform recording are now emerging), inversion software require efficient storage and solver algorithms. We developed the finite element solver Escript, which provides a user-friendly programming environment in Python to solve large-scale PDE-based problems (see https://launchpad.net/escript-finley). Using finite elements, highly irregular shaped geology and topography can readily be taken into account. For the 3D resistivity problem, we have implemented the secondary potential approach, where the PDE is decomposed into a primary potential caused by the source current and the secondary potential caused by changes in subsurface resistivity. The primary potential is calculated analytically, and the boundary value problem for the secondary potential is solved using nodal finite elements. This approach removes the singularity caused by the source currents and provides more accurate 3D resistivity models. To solve the inversion problem we apply a 'first optimize then discretize' approach using the quasi-Newton scheme in form of the limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method (see Gross & Kemp 2013). The evaluation of the cost function requires the solution of the secondary potential PDE for each source current and the solution of the corresponding adjoint-state PDE for the cost function gradients with respect to the subsurface

  1. Modeling the Pulse Line Ion Accelerator (PLIA): an algorithm for quasi-static field solution.

    SciTech Connect

    Friedman, A; Briggs, R J; Grote, D P; Henestroza, E; Waldron, W L

    2007-06-18

    The Pulse-Line Ion Accelerator (PLIA) is a helical distributed transmission line. A rising pulse applied to the upstream end appears as a moving spatial voltage ramp, on which an ion pulse can be accelerated. This is a promising approach to acceleration and longitudinal compression of an ion beam at high line charge density. In most of the studies carried out to date, using both a simple code for longitudinal beam dynamics and the Warp PIC code, a circuit model for the wave behavior was employed; in Warp, the helix I and V are source terms in elliptic equations for E and B. However, it appears possible to obtain improved fidelity using a ''sheath helix'' model in the quasi-static limit. Here we describe an algorithmic approach that may be used to effect such a solution.

  2. Active and passive computed tomography algorithm with a constrained conjugate gradient solution

    SciTech Connect

    Goodman, D.; Jackson, J. A.; Martz, H. E.; Roberson, G. P.

    1998-10-01

    An active and passive computed tomographic technique (A&PCT) has been developed at the Lawrence Livermore National Laboratory (LLNL). The technique uses an external radioactive source and active tomography to map the attenuation within a waste drum as a function of mono-energetic gamma-ray energy. Passive tomography is used to localize and identify specific radioactive waste within the same container. The passive data is corrected for attenuation using the active data and this yields a quantitative assay of drum activity. A&PCT involves the development of a detailed system model that combines the data from the active scans with the geometry of the imaging system. Using the system model, iterative optimization techniques are used to reconstruct the image from the passive data. Requirements for high throughput yield measured emission levels in waste barrels that are too low to apply optimization techniques involving the usual Gaussian statistics. In this situation a Poisson distribution, typically used for cases with low counting statistics, is used to create an effective maximum likelihood estimation function. An optimization algorithm, Constrained Conjugate Gradient (CCG), is used to determine a solution for A&PCT quantitative assay. CCG, which was developed at LLNL, has proven to be an efficient and effective optimization method to solve limited-data problems. A detailed explanation of the algorithms used in developing the model and optimization codes is given.

  3. Adjoint operator approach in marginal separation theory

    NASA Astrophysics Data System (ADS)

    Braun, Stefan; Scheichl, Stefan; Kluwick, Alfred

    2013-10-01

    Thin airfoils are prone to localized flow separation at their leading edge if subjected to moderate angles of attack α. Although 'laminar separation bubbles' at first do not significantly alter the airfoil performance, they tend to 'burst' if a is increased further or perturbations acting upon the flow reach a certain intensity. This then leads either to global flow separation (stall) or triggers the laminar-turbulent transition process within the boundary layer flow. The present paper addresses the asymptotic analysis of the early stages of the latter phenomenon in the limit as the characteristic Reynolds number Re → ∞, commonly referred to as marginal separation theory (MST). A new approach based on the adjoint operator method is presented to derive the fundamental similarity laws of MST and to extend the analysis to higher order. Special emphasis is placed on the breakdown of the flow description, i.e. the formation of finite time singularities (a manifestation of the bursting process), and its resolution based on asymptotic reasoning. The computation of the spatio-temporal evolution of the flow in the subsequent triple deck stage is performed by means of a Chebyshev spectral method. The associated numerical treatment of fractional integrals characteristic of MST is based on barycentric Lagrange interpolation, which is described in detail.

  4. Baryogenesis via leptogenesis in adjoint SU(5)

    SciTech Connect

    Blanchet, Steve; Fileviez Perez, Pavel E-mail: fileviez@physics.wisc.edu

    2008-08-15

    The possibility of explaining the baryon asymmetry in the Universe through the leptogenesis mechanism in the context of adjoint SU(5) is investigated. In this model neutrino masses are generated through the type I and type III seesaw mechanisms, and the field responsible for the type III seesaw, called {rho}{sub 3}, generates the B-L asymmetry needed to satisfy the observed value of the baryon asymmetry in the Universe. We find that the CP asymmetry originates only from the vertex correction, since the self-energy contribution is not present. When neutrino masses have a normal hierarchy, successful leptogenesis is possible for 10{sup 11} GeV{approx}

  5. Adjoint estimation of ozone climate penalties

    NASA Astrophysics Data System (ADS)

    Zhao, Shunliu; Pappin, Amanda J.; Morteza Mesbah, S.; Joyce Zhang, J. Y.; MacDonald, Nicole L.; Hakami, Amir

    2013-10-01

    adjoint of a regional chemical transport model is used to calculate location-specific temperature influences (climate penalties) on two policy-relevant ozone metrics: concentrations in polluted regions (>65 ppb) and short-term mortality in Canada and the U.S. Temperature influences through changes in chemical reaction rates, atmospheric moisture content, and biogenic emissions exhibit significant spatial variability. In particular, high-NOx, polluted regions are prominently distinguished by substantial climate penalties (up to 6.2 ppb/K in major urban areas) as a result of large temperature influences through increased biogenic emissions and nonnegative water vapor sensitivities. Temperature influences on ozone mortality, when integrated across the domain, result in 369 excess deaths/K in Canada and the U.S. over a summer season—an impact comparable to a 5% change in anthropogenic NOx emissions. As such, we suggest that NOx control can be also regarded as a climate change adaptation strategy with regard to ozone air quality.

  6. Adjoint Sensitivity Analysis of Push-Pull Partitioning Tracer Test Data for DNAPL Saturation Estimation

    NASA Astrophysics Data System (ADS)

    Tang, T.; Boroumand, A.; Abriola, L. M.; Miller, E. L.

    2013-12-01

    Characterization of dense non-aqueous phase liquid (DNAPL) source zones is a critical component for successful remediation of sites contaminated by chlorinated solvents. Although Push-Pull Tracer Tests (PPTTs) offer a promising approach for local in situ source zone characterization, non-equilibrium mass transfer effects and the spatial variability of saturation make their interpretation difficult. To better understand the dependence of well test data on these factors and as the basis for the estimation of the spatial DNAPL distribution, here we develop numerical methods based on the use of adjoint sensitivity mehtods to explore the sensitivity of PPTT observations to the distribution of DNAPL saturation. We examine the utility of the developed approach using three-dimensional hypothetical source zones containing heterogeneous DNAPL distributions. For model applications the flow fields are generated with MODFLOW and non-equilibrium tracer mass transfer is described by a linear driving force expression. Comprehensive modeling of partitioning tracer tests requires the solution of tracer mass balance equations in the aqueous and DNAPL phases. Consistent with this process coupling, the developed adjoint method introduces a vector of adjoint variables to formulate the coupled adjoint states equations for tracer concentrations in both the aqueous and NAPL phases. For the sensitivity analysis, we investigate how the tracer concentration in the well changes with perturbations of the saturation within the interrogated zone. Using the calculated sensitivity functions, coupled with the observed tracer breakthrough curve, we develop a nonlinear least-squares inverse method to determine three metrics related to the spatial distribution of DNAPL in the source zone: average DNAPL saturation, total mass of DNAPL and distance of the DNAPL from the test well. These results have utility for local source zone characterization and can provide an initial quantitative understanding of

  7. Partially constrained ant colony optimization algorithm for the solution of constrained optimization problems: Application to storm water network design

    NASA Astrophysics Data System (ADS)

    Afshar, M. H.

    2007-04-01

    This paper exploits the unique feature of the Ant Colony Optimization Algorithm (ACOA), namely incremental solution building mechanism, to develop partially constraint ACO algorithms for the solution of optimization problems with explicit constraints. The method is based on the provision of a tabu list for each ant at each decision point of the problem so that some constraints of the problem are satisfied. The application of the method to the problem of storm water network design is formulated and presented. The network nodes are considered as the decision points and the nodal elevations of the network are used as the decision variables of the optimization problem. Two partially constrained ACO algorithms are formulated and applied to a benchmark example of storm water network design and the results are compared with those of the original unconstrained algorithm and existing methods. In the first algorithm the positive slope constraints are satisfied explicitly and the rest are satisfied by using the penalty method while in the second one the satisfaction of constraints regarding the maximum ratio of flow depth to the diameter are also achieved explicitly via the tabu list. The method is shown to be very effective and efficient in locating the optimal solutions and in terms of the convergence characteristics of the resulting ACO algorithms. The proposed algorithms are also shown to be relatively insensitive to the initial colony used compared to the original algorithm. Furthermore, the method proves itself capable of finding an optimal or near-optimal solution, independent of the discretisation level and the size of the colony used.

  8. A diagonal algorithm for the method of pseudocompressibility. [for steady-state solution to incompressible Navier-Stokes equation

    NASA Technical Reports Server (NTRS)

    Rogers, S. E.; Kwak, D.; Chang, J. L. C.

    1986-01-01

    The method of pseudocompressibility has been shown to be an efficient method for obtaining a steady-state solution to the incompressible Navier-Stokes equations. Recent improvements to this method include the use of a diagonal scheme for the inversion of the equations at each iteration. The necessary transformations have been derived for the pseudocompressibility equations in generalized coordinates. The diagonal algorithm reduces the computing time necessary to obtain a steady-state solution by a factor of nearly three. Implicit viscous terms are maintained in the equations, and it has become possible to use fourth-order implicit dissipation. The steady-state solution is unchanged by the approximations resulting from the diagonalization of the equations. Computed results for flow over a two-dimensional backward-facing step and a three-dimensional cylinder mounted normal to a flat plate are presented for both the old and new algorithms. The accuracy and computing efficiency of these algorithms are compared.

  9. Second-order p-iterative solution of the Lambert/Gauss problem. [algorithm for efficient orbit determination

    NASA Technical Reports Server (NTRS)

    Boltz, F. W.

    1984-01-01

    An algorithm is presented for efficient p-iterative solution of the Lambert/Gauss orbit-determination problem using second-order Newton iteration. The algorithm is based on a universal transformation of Kepler's time-of-flight equation and approximate inverse solutions of this equation for short-way and long-way flight paths. The approximate solutions provide both good starting values for iteration and simplified computation of the second-order term in the iteration formula. Numerical results are presented which indicate that in many cases of practical significance (except those having collinear position vectors) the algorithm produces at least eight significant digits of accuracy with just two or three steps of iteration.

  10. Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm

    NASA Astrophysics Data System (ADS)

    Dutta, S.; Patra, D.; Shankar, H.; Alok Verma, P.

    2014-11-01

    minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network. In this study, we have developed a new GIS tool using most commonly known rudimentary algorithm called Prim's algorithm to construct the minimum spanning tree of a connected, undirected and weighted road network. This algorithm is based on the weight (adjacency) matrix of a weighted network and helps to solve complex network MST problem easily, efficiently and effectively. The selection of the appropriate algorithm is very essential otherwise it will be very hard to get an optimal result. In case of Road Transportation Network, it is very essential to find the optimal results by considering all the necessary points based on cost factor (time or distance). This paper is based on solving the Minimum Spanning Tree (MST) problem of a road network by finding it's minimum span by considering all the important network junction point. GIS technology is usually used to solve the network related problems like the optimal path problem, travelling salesman problem, vehicle routing problems, location-allocation problems etc. Therefore, in this study we have developed a customized GIS tool using Python script in ArcGIS software for the solution of MST problem for a Road Transportation Network of Dehradun city by considering distance and time as the impedance (cost) factors. It has a number of advantages like the users do not need a greater knowledge of the subject as the tool is user-friendly and that allows to access information varied and adapted the needs of the users. This GIS tool for MST can be applied for a nationwide plan called Prime Minister Gram Sadak Yojana in India to provide optimal all weather road connectivity to unconnected villages (points). This tool is also useful for constructing highways or railways spanning several

  11. On the utility of the multi-level algorithm for the solution of nearly completely decomposable Markov chains

    NASA Technical Reports Server (NTRS)

    Leutenegger, Scott T.; Horton, Graham

    1994-01-01

    Recently the Multi-Level algorithm was introduced as a general purpose solver for the solution of steady state Markov chains. In this paper, we consider the performance of the Multi-Level algorithm for solving Nearly Completely Decomposable (NCD) Markov chains, for which special-purpose iteractive aggregation/disaggregation algorithms such as the Koury-McAllister-Stewart (KMS) method have been developed that can exploit the decomposability of the the Markov chain. We present experimental results indicating that the general-purpose Multi-Level algorithm is competitive, and can be significantly faster than the special-purpose KMS algorithm when Gauss-Seidel and Gaussian Elimination are used for solving the individual blocks.

  12. Dynamic simulation of concentrated macromolecular solutions with screened long-range hydrodynamic interactions: Algorithm and limitations

    PubMed Central

    Ando, Tadashi; Chow, Edmond; Skolnick, Jeffrey

    2013-01-01

    Hydrodynamic interactions exert a critical effect on the dynamics of macromolecules. As the concentration of macromolecules increases, by analogy to the behavior of semidilute polymer solutions or the flow in porous media, one might expect hydrodynamic screening to occur. Hydrodynamic screening would have implications both for the understanding of macromolecular dynamics as well as practical implications for the simulation of concentrated macromolecular solutions, e.g., in cells. Stokesian dynamics (SD) is one of the most accurate methods for simulating the motions of N particles suspended in a viscous fluid at low Reynolds number, in that it considers both far-field and near-field hydrodynamic interactions. This algorithm traditionally involves an O(N3) operation to compute Brownian forces at each time step, although asymptotically faster but more complex SD methods are now available. Motivated by the idea of hydrodynamic screening, the far-field part of the hydrodynamic matrix in SD may be approximated by a diagonal matrix, which is equivalent to assuming that long range hydrodynamic interactions are completely screened. This approximation allows sparse matrix methods to be used, which can reduce the apparent computational scaling to O(N). Previously there were several simulation studies using this approximation for monodisperse suspensions. Here, we employ newly designed preconditioned iterative methods for both the computation of Brownian forces and the solution of linear systems, and consider the validity of this approximation in polydisperse suspensions. We evaluate the accuracy of the diagonal approximation method using an intracellular-like suspension. The diffusivities of particles obtained with this approximation are close to those with the original method. However, this approximation underestimates intermolecular correlated motions, which is a trade-off between accuracy and computing efficiency. The new method makes it possible to perform large-scale and

  13. An adjoint method for a high-order discretization of deforming domain conservation laws for optimization of flow problems

    NASA Astrophysics Data System (ADS)

    Zahr, M. J.; Persson, P.-O.

    2016-12-01

    The fully discrete adjoint equations and the corresponding adjoint method are derived for a globally high-order accurate discretization of conservation laws on parametrized, deforming domains. The conservation law on the deforming domain is transformed into one on a fixed reference domain by the introduction of a time-dependent mapping that encapsulates the domain deformation and parametrization, resulting in an Arbitrary Lagrangian-Eulerian form of the governing equations. A high-order discontinuous Galerkin method is used to discretize the transformed equation in space and a high-order diagonally implicit Runge-Kutta scheme is used for the temporal discretization. Quantities of interest that take the form of space-time integrals are discretized in a solver-consistent manner. The corresponding fully discrete adjoint method is used to compute exact gradients of quantities of interest along the manifold of solutions of the fully discrete conservation law. These quantities of interest and their gradients are used in the context of gradient-based PDE-constrained optimization. The adjoint method is used to solve two optimal shape and control problems governed by the isentropic, compressible Navier-Stokes equations. The first optimization problem seeks the energetically optimal trajectory of a 2D airfoil given a required initial and final spatial position. The optimization solver, driven by gradients computed via the adjoint method, reduced the total energy required to complete the specified mission nearly an order of magnitude. The second optimization problem seeks the energetically optimal flapping motion and time-morphed geometry of a 2D airfoil given an equality constraint on the x-directed impulse generated on the airfoil. The optimization solver satisfied the impulse constraint to greater than 8 digits of accuracy and reduced the required energy between a factor of 2 and 10, depending on the value of the impulse constraint, as compared to the nominal configuration.

  14. Adjoint-Based Methodology for Time-Dependent Optimization

    NASA Technical Reports Server (NTRS)

    Yamaleev, N. K.; Diskin, B.; Nielsen, E. J.

    2008-01-01

    This paper presents a discrete adjoint method for a broad class of time-dependent optimization problems. The time-dependent adjoint equations are derived in terms of the discrete residual of an arbitrary finite volume scheme which approximates unsteady conservation law equations. Although only the 2-D unsteady Euler equations are considered in the present analysis, this time-dependent adjoint method is applicable to the 3-D unsteady Reynolds-averaged Navier-Stokes equations with minor modifications. The discrete adjoint operators involving the derivatives of the discrete residual and the cost functional with respect to the flow variables are computed using a complex-variable approach, which provides discrete consistency and drastically reduces the implementation and debugging cycle. The implementation of the time-dependent adjoint method is validated by comparing the sensitivity derivative with that obtained by forward mode differentiation. Our numerical results show that O(10) optimization iterations of the steepest descent method are needed to reduce the objective functional by 3-6 orders of magnitude for test problems considered.

  15. Adjoint simulation of stream depletion due to aquifer pumping.

    PubMed

    Neupauer, Roseanna M; Griebling, Scott A

    2012-01-01

    If an aquifer is hydraulically connected to an adjacent stream, a pumping well operating in the aquifer will draw some water from aquifer storage and some water from the stream, causing stream depletion. Several analytical, semi-analytical, and numerical approaches have been developed to estimate stream depletion due to pumping. These approaches are effective if the well location is known. If a new well is to be installed, it may be desirable to install the well at a location where stream depletion is minimal. If several possible locations are considered for the location of a new well, stream depletion would have to be estimated for all possible well locations, which can be computationally inefficient. The adjoint approach for estimating stream depletion is a more efficient alternative because with one simulation of the adjoint model, stream depletion can be estimated for pumping at a well at any location. We derive the adjoint equations for a coupled system with a confined aquifer, an overlying unconfined aquifer, and a river that is hydraulically connected to the unconfined aquifer. We assume that the stage in the river is known, and is independent of the stream depletion, consistent with the assumptions of the MODFLOW river package. We describe how the adjoint equations can be solved using MODFLOW. In an illustrative example, we show that for this scenario, the adjoint approach is as accurate as standard forward numerical simulation methods, and requires substantially less computational effort.

  16. Convection equation modeling: A non-iterative direct matrix solution algorithm for use with SINDA

    NASA Technical Reports Server (NTRS)

    Schrage, Dean S.

    1993-01-01

    The determination of the boundary conditions for a component-level analysis, applying discrete finite element and finite difference modeling techniques often requires an analysis of complex coupled phenomenon that cannot be described algebraically. For example, an analysis of the temperature field of a coldplate surface with an integral fluid loop requires a solution to the parabolic heat equation and also requires the boundary conditions that describe the local fluid temperature. However, the local fluid temperature is described by a convection equation that can only be solved with the knowledge of the locally-coupled coldplate temperatures. Generally speaking, it is not computationally efficient, and sometimes, not even possible to perform a direct, coupled phenomenon analysis of the component-level and boundary condition models within a single analysis code. An alternative is to perform a disjoint analysis, but transmit the necessary information between models during the simulation to provide an indirect coupling. For this approach to be effective, the component-level model retains full detail while the boundary condition model is simplified to provide a fast, first-order prediction of the phenomenon in question. Specifically for the present study, the coldplate structure is analyzed with a discrete, numerical model (SINDA) while the fluid loop convection equation is analyzed with a discrete, analytical model (direct matrix solution). This indirect coupling allows a satisfactory prediction of the boundary condition, while not subjugating the overall computational efficiency of the component-level analysis. In the present study a discussion of the complete analysis of the derivation and direct matrix solution algorithm of the convection equation is presented. Discretization is analyzed and discussed to extend of solution accuracy, stability and computation speed. Case studies considering a pulsed and harmonic inlet disturbance to the fluid loop are analyzed to

  17. A comparison of three-dimensional nonequilibrium solution algorithms applied to hypersonic flows with stiff chemical source terms

    NASA Technical Reports Server (NTRS)

    Palmer, Grant; Venkatapathy, Ethiraj

    1993-01-01

    Three solution algorithms, explicit underrelaxation, point implicit, and lower upper symmetric Gauss-Seidel (LUSGS), are used to compute nonequilibrium flow around the Apollo 4 return capsule at 62 km altitude. By varying the Mach number, the efficiency and robustness of the solution algorithms were tested for different levels of chemical stiffness. The performance of the solution algorithms degraded as the Mach number and stiffness of the flow increased. At Mach 15, 23, and 30, the LUSGS method produces an eight order of magnitude drop in the L2 norm of the energy residual in 1/3 to 1/2 the Cray C-90 computer time as compared to the point implicit and explicit under-relaxation methods. The explicit under-relaxation algorithm experienced convergence difficulties at Mach 23 and above. At Mach 40 the performance of the LUSGS algorithm deteriorates to the point it is out-performed by the point implicit method. The effects of the viscous terms are investigated. Grid dependency questions are explored.

  18. Sonic Boom Mitigation Through Aircraft Design and Adjoint Methodology

    NASA Technical Reports Server (NTRS)

    Rallabhandi, Siriam K.; Diskin, Boris; Nielsen, Eric J.

    2012-01-01

    This paper presents a novel approach to design of the supersonic aircraft outer mold line (OML) by optimizing the A-weighted loudness of sonic boom signature predicted on the ground. The optimization process uses the sensitivity information obtained by coupling the discrete adjoint formulations for the augmented Burgers Equation and Computational Fluid Dynamics (CFD) equations. This coupled formulation links the loudness of the ground boom signature to the aircraft geometry thus allowing efficient shape optimization for the purpose of minimizing the impact of loudness. The accuracy of the adjoint-based sensitivities is verified against sensitivities obtained using an independent complex-variable approach. The adjoint based optimization methodology is applied to a configuration previously optimized using alternative state of the art optimization methods and produces additional loudness reduction. The results of the optimizations are reported and discussed.

  19. A solution-adaptive mesh algorithm for dynamic/static refinement of two and three dimensional grids

    NASA Technical Reports Server (NTRS)

    Benson, Rusty A.; Mcrae, D. S.

    1991-01-01

    An adaptive grid algorithm has been developed in two and three dimensions that can be used dynamically with a solver or as part of a grid refinement process. The algorithm employs a transformation from the Cartesian coordinate system to a general coordinate space, which is defined as a parallelepiped in three dimensions. A weighting function, independent for each coordinate direction, is developed that will provide the desired refinement criteria in regions of high solution gradient. The adaptation is performed in the general coordinate space and the new grid locations are returned to the Cartesian space via a simple, one-step inverse mapping. The algorithm for relocation of the mesh points in the parametric space is based on the center of mass for distributed weights. Dynamic solution-adaptive results are presented for laminar flows in two and three dimensions.

  20. Adjoint-based optimization of fish swimming gaits

    NASA Astrophysics Data System (ADS)

    Floryan, Daniel; Rowley, Clarence W.; Smits, Alexander J.

    2016-11-01

    We study a simplified model of fish swimming, namely a flat plate periodically pitching about its leading edge. Using gradient-based optimization, we seek periodic gaits that are optimal in regards to a particular objective (e.g. maximal thrust). The two-dimensional immersed boundary projection method is used to investigate the flow states, and its adjoint formulation is used to efficiently calculate the gradient of the objective function needed for optimization. The adjoint method also provides sensitivity information, which may be used to elucidate the physics responsible for optimality. Supported under ONR MURI Grants N00014-14-1-0533, Program Manager Bob Brizzolara.

  1. Sensitivity analysis of numerically-simulated convective storms using direct and adjoint methods

    SciTech Connect

    Park, S.K.; Droegemeier, K.K.; Bischof, C.; Knauff, T.

    1994-06-01

    The goal of this project is to evaluate the sensitivity of numerically modeled convective storms to control parameters such as the initial conditions, boundary conditions, environment, and various physical and computational parameters. In other words, the authors seek the gradient of the solution vector with respect to specified parameters. One can use two approaches to accomplish this task. In the first or so-called brute force method, one uses a fully nonlinear model to generate a control forecast starting from a specified initial state. Then, a number of other forecasts are made in which chosen parameters (e.g., initial conditions) are systematically varied. The obvious drawback is that a large number of full model predictions are needed to examine the effects of only a single parameter. The authors describe herein an alternative, essentially automated method (ADIFOR, or Automatic DIfferentiation of FORtran) for obtaining the solution gradient that bypasses the adjoint altogether yet provides even more information about the gradient. (ADIFOR, like the adjoint technique, is constrained by the linearity assumption.) Applied to a 1-D moist cloud model, the authors assess the utility of ADIFOR relative to the brute force approach and evaluate the validity of the tangent linear approximation in the context of deep convection.

  2. Magnetic Field Separation Around Planets Using an Adjoint-Method Approach

    NASA Astrophysics Data System (ADS)

    Nabert, Christian; Glassmeier, Karl-Heinz; Heyner, Daniel; Othmer, Carsten

    The two spacecraft of the BepiColombo mission will reach planet Mercury in 2022. The magnetometers on-board these polar orbiting spacecraft will provide a detailed map of the magnetic field in Mercury's environment. Unfortunately, a separation of the magnetic field into internal and external parts using the classical Gauss-algorithm is not possible due to strong electric currents in the orbit region of the spacecraft. These currents are due to the interaction of the solar wind with Mercury's planetary magnetic field. We use an MHD code to simulate this interaction process. This requires a first choice of Mercury's planetary field which is used and modified until the simulation results fit to the actual measurements. This optimization process is carried out most efficiently using an adjoint-method. The adjoint-method is well known for its low computational cost in order to determine sensitivities required for the minimization. In a first step, the validity of our approach to separate magnetic field contributions into internal and external parts is demonstrated using synthetic generated data. Furthermore, we apply our approach to satellite measurements of the Earth's magnetic field. We can compare the results with the well known planetary field of the Earth to prove practical suitability.

  3. A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation.

    PubMed

    Sit, Atilla; Wu, Zhijun; Yuan, Yaxiang

    2009-11-01

    We propose a new geometric buildup algorithm for the solution of the distance geometry problem in protein modeling, which can prevent the accumulation of the rounding errors in the buildup calculations successfully and also tolerate small errors in given distances. In this algorithm, we use all instead of a subset of available distances for the determination of each unknown atom and obtain the position of the atom by using a least-squares approximation instead of an exact solution to the system of distance equations. We show that the least-squares approximation can be obtained by using a special singular value decomposition method, which not only tolerates and minimizes small distance errors, but also prevents the rounding errors from propagation effectively, especially when the distance data is sparse. We describe the least-squares formulations and their solution methods, and present the test results from applying the new algorithm for the determination of a set of protein structures with varying degrees of availability and accuracy of the distances. We show that the new development of the algorithm increases the modeling ability, and improves stability and robustness of the geometric buildup approach significantly from both theoretical and practical points of view.

  4. Assimilating Remote Ammonia Observations with a Refined Aerosol Thermodynamics Adjoint"

    EPA Science Inventory

    Ammonia emissions parameters in North America can be refined in order to improve the evaluation of modeled concentrations against observations. Here, we seek to do so by developing and applying the GEOS-Chem adjoint nested over North America to conductassimilation of observations...

  5. The efficiency of geophysical adjoint codes generated by automatic differentiation tools

    NASA Astrophysics Data System (ADS)

    Vlasenko, A. V.; Köhl, A.; Stammer, D.

    2016-02-01

    The accuracy of numerical models that describe complex physical or chemical processes depends on the choice of model parameters. Estimating an optimal set of parameters by optimization algorithms requires knowledge of the sensitivity of the process of interest to model parameters. Typically the sensitivity computation involves differentiation of the model, which can be performed by applying algorithmic differentiation (AD) tools to the underlying numerical code. However, existing AD tools differ substantially in design, legibility and computational efficiency. In this study we show that, for geophysical data assimilation problems of varying complexity, the performance of adjoint codes generated by the existing AD tools (i) Open_AD, (ii) Tapenade, (iii) NAGWare and (iv) Transformation of Algorithms in Fortran (TAF) can be vastly different. Based on simple test problems, we evaluate the efficiency of each AD tool with respect to computational speed, accuracy of the adjoint, the efficiency of memory usage, and the capability of each AD tool to handle modern FORTRAN 90-95 elements such as structures and pointers, which are new elements that either combine groups of variables or provide aliases to memory addresses, respectively. We show that, while operator overloading tools are the only ones suitable for modern codes written in object-oriented programming languages, their computational efficiency lags behind source transformation by orders of magnitude, rendering the application of these modern tools to practical assimilation problems prohibitive. In contrast, the application of source transformation tools appears to be the most efficient choice, allowing handling even large geophysical data assimilation problems. However, they can only be applied to numerical models written in earlier generations of programming languages. Our study indicates that applying existing AD tools to realistic geophysical problems faces limitations that urgently need to be solved to allow the

  6. Exact and approximate Fourier rebinning algorithms for the solution of the data truncation problem in 3-D PET.

    PubMed

    Bouallègue, Fayçal Ben; Crouzet, Jean-François; Comtat, Claude; Fourcade, Marjolaine; Mohammadi, Bijan; Mariano-Goulart, Denis

    2007-07-01

    This paper presents an extended 3-D exact rebinning formula in the Fourier space that leads to an iterative reprojection algorithm (iterative FOREPROJ), which enables the estimation of unmeasured oblique projection data on the basis of the whole set of measured data. In first approximation, this analytical formula also leads to an extended Fourier rebinning equation that is the basis for an approximate reprojection algorithm (extended FORE). These algorithms were evaluated on numerically simulated 3-D positron emission tomography (PET) data for the solution of the truncation problem, i.e., the estimation of the missing portions in the oblique projection data, before the application of algorithms that require complete projection data such as some rebinning methods (FOREX) or 3-D reconstruction algorithms (3DRP or direct Fourier methods). By taking advantage of all the 3-D data statistics, the iterative FOREPROJ reprojection provides a reliable alternative to the classical FOREPROJ method, which only exploits the low-statistics nonoblique data. It significantly improves the quality of the external reconstructed slices without loss of spatial resolution. As for the approximate extended FORE algorithm, it clearly exhibits limitations due to axial interpolations, but will require clinical studies with more realistic measured data in order to decide on its pertinence.

  7. Investigation of the Solution Space of Marine Controlled-Source Electromagnetic Inversion Problems By Using a Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Hunziker, J.; Thorbecke, J.; Slob, E. C.

    2014-12-01

    Commonly, electromagnetic measurements for exploring and monitoring hydrocarbon reservoirs are inverted for the subsurface conductivity distribution by minimizing the difference between the actual data and a forward modeled dataset. The convergence of the inversion process to the correct solution strongly depends on the shape of the solution space. Since this is a non-linear problem, there exist a multitude of minima of which only the global one provides the correct conductivity values. To easily find the global minimum we desire it to have a broad cone of attraction, while it should also feature a very narrow bottom in order to obtain the subsurface conductivity with high resolution. In this study, we aim to determine which combination of input data corresponds to a favorable shape of the solution space. Since the solution space is N-dimensional, with N being the number of unknown subsurface parameters, plotting it is out of the question. In our approach, we use a genetic algorithm (Goldberg, 1989) to probe the solution space. Such algorithms have the advantage that every run of the same problem will end up at a different solution. Most of these solutions are expected to lie close to the global minimum. A situation where only few runs end up in the global minimum indicates that the solution space consists of a lot of local minima or that the cone of attraction of the global minimum is small. If a lot of runs end up with a similar data-misfit but with a large spread of the subsurface medium parameters in one or more direction, it can be concluded that the chosen data-input is not sensitive with respect to that direction. Compared to the study of Hunziker et al. 2014, we allow also to invert for subsurface boundaries and include more combinations of input datasets. The results so far suggest that it is essential to include the magnetic field in the inversion process in order to find the anisotropic conductivity values. ReferencesGoldberg, D. E., 1989. Genetic

  8. Simultaneous inversion of mantle properties and initial conditions using an adjoint of mantle convection

    NASA Astrophysics Data System (ADS)

    Liu, Lijun; Gurnis, Michael

    2008-08-01

    Through the assimilation of present-day mantle seismic structure, adjoint methods can be used to constrain the structure of the mantle at earlier times, i.e., mantle initial conditions. However, the application to geophysical problems is restricted through both the high computational expense from repeated iteration between forward and adjoint models and the need to know mantle properties (such as viscosity and the absolute magnitude of temperature or density) a priori. We propose that an optimal first guess to the initial condition can be obtained through a simple backward integration (SBI) of the governing equations, thus lessening the computational expense. Given a model with known mantle properties, we show that a solution based on an SBI-generated first guess has smaller residuals than arbitrary guesses. Mantle viscosity and the effective Rayleigh number are crucial for mantle convection models, neither of which is exactly known. We place additional constraints on these basic mantle properties when the convection-induced dynamic topography on Earth's surface is considered within an adjoint inverse method. Besides assimilating present-day seismic structure as a constraint, we use dynamic topography and its rate of change in an inverse method that allows simultaneous inversion of the absolute upper and lower mantle viscosities, scaling between seismic velocity and thermal anomalies, and initial condition. The theory is derived from the governing equations of mantle convection and validated by synthetic experiments for both one-layer viscosity and two-layer viscosity regionally bounded spherical shells. For the one-layer model, at any instant of time, the magnitude of dynamic topography is controlled by the temperature scaling while the rate of change of topography is controlled by the absolute value of viscosity. For the two-layer case, the rate of change of topography constrains upper mantle viscosity while the magnitude of dynamic topography determines the

  9. Seismic imaging and inversion based on spectral-element and adjoint methods

    NASA Astrophysics Data System (ADS)

    Luo, Yang

    One of the most important topics in seismology is to construct detailed tomographic images beneath the surface, which can be interpreted geologically and geochemically to understand geodynamic processes happening in the interior of the Earth. Classically, these images are usually produced based upon linearized traveltime anomalies involving several particular seismic phases, whereas nonlinear inversion fitting synthetic seismograms and recorded signals based upon the adjoint method becomes more and more favorable. The adjoint tomography, also referred to as waveform inversion, is advantageous over classical techniques in several aspects, such as better resolution, while it also has several drawbacks, e.g., slow convergence and lack of quantitative resolution analysis. In this dissertation, we focus on solving these remaining issues in adjoint tomography, from a theoretical perspective and based upon synthetic examples. To make the thesis complete by itself and easy to follow, we start from development of the spectral-element method, a wave equation solver that enables access to accurate synthetic seismograms for an arbitrary Earth model, and the adjoint method, which provides Frechet derivatives, also named as sensitivity kernels, of a given misfit function. Then, the sensitivity kernels for waveform misfit functions are illustrated, using examples from exploration seismology, in other words, for migration purposes. Next, we show step by step how these gradient derivatives may be utilized in minimizing the misfit function, which leads to iterative refinements on the Earth model. Strategies needed to speed up the inversion, ensure convergence and improve resolution, e.g., preconditioning, quasi-Newton methods, multi-scale measurements and combination of traveltime and waveform misfit functions, are discussed. Through comparisons between the adjoint tomography and classical tomography, we address the resolution issue by calculating the point-spread function, the

  10. Quantum algorithms for biomolecular solutions of the satisfiability problem on a quantum machine.

    PubMed

    Chang, Weng-Long; Ren, Ting-Ting; Luo, Jun; Feng, Mang; Guo, Minyi; Weicheng Lin, Kawuu

    2008-09-01

    In this paper, we demonstrate that the logic computation performed by the DNA-based algorithm for solving general cases of the satisfiability problem can be implemented more efficiently by our proposed quantum algorithm on the quantum machine proposed by Deutsch. To test our theory, we carry out a three-quantum bit nuclear magnetic resonance experiment for solving the simplest satisfiability problem.

  11. Adaptive mesh refinement and adjoint methods in geophysics simulations

    NASA Astrophysics Data System (ADS)

    Burstedde, Carsten

    2013-04-01

    required by human intervention and analysis. Specifying an objective functional that quantifies the misfit between the simulation outcome and known constraints and then minimizing it through numerical optimization can serve as an automated technique for parameter identification. As suggested by the similarity in formulation, the numerical algorithm is closely related to the one used for goal-oriented error estimation. One common point is that the so-called adjoint equation needs to be solved numerically. We will outline the derivation and implementation of these methods and discuss some of their pros and cons, supported by numerical results.

  12. Multi-criteria optimisation problems for chemical engineering systems and algorithms for their solution based on fuzzy mathematical methods.

    PubMed

    Orazbayev, B B; Orazbayeva, K N; Kurmangaziyeva, L T; Makhatova, V E

    2015-01-01

    Mathematical equations for the multi-criteria task of the optimisation of chemical engineering systems, for example for the optimisation of working regimes for industrial installations for benzene production, have been formulated and developed, and based on fuzzy mathematical methods, algorithms for their solution have been developed. Since the chemical engineering system, which is being researched, is characterised by multiple criteria and often functions in conditions of uncertainty, the presenting problem is formulated in the form of multi-criteria equations for fuzzy mathematical programming. New mathematical formulations for the problems being solved in a fuzzy environment and heuristic algorithms for their solution have been developed by the modification of various optimisation principles based on fuzzy mathematical methods.

  13. Multi-criteria optimisation problems for chemical engineering systems and algorithms for their solution based on fuzzy mathematical methods

    PubMed Central

    Orazbayev, B. B.; Orazbayeva, K. N.; Kurmangaziyeva, L. T.; Makhatova, V.E.

    2015-01-01

    Mathematical equations for the multi-criteria task of the optimisation of chemical engineering systems, for example for the optimisation of working regimes for industrial installations for benzene production, have been formulated and developed, and based on fuzzy mathematical methods, algorithms for their solution have been developed. Since the chemical engineering system, which is being researched, is characterised by multiple criteria and often functions in conditions of uncertainty, the presenting problem is formulated in the form of multi-criteria equations for fuzzy mathematical programming. New mathematical formulations for the problems being solved in a fuzzy environment and heuristic algorithms for their solution have been developed by the modification of various optimisation principles based on fuzzy mathematical methods. PMID:28275318

  14. Adjoint Optimization of Multistage Axial Compressor Blades with Static Pressure Constraint at Blade Row Interface

    NASA Astrophysics Data System (ADS)

    Yu, Jia; Ji, Lucheng; Li, Weiwei; Yi, Weilin

    2016-06-01

    Adjoint method is an important tool for design refinement of multistage compressors. However, the radial static pressure distribution deviates during the optimization procedure and deteriorates the overall performance, producing final designs that are not well suited for realistic engineering applications. In previous development work on multistage turbomachinery blade optimization using adjoint method and thin shear-layer N-S equations, the entropy production is selected as the objective function with given mass flow rate and total pressure ratio as imposed constraints. The radial static pressure distribution at the interfaces between rows is introduced as a new constraint in the present paper. The approach is applied to the redesign of a five-stage axial compressor, and the results obtained with and without the constraint on the radial static pressure distribution at the interfaces between rows are discussed in detail. The results show that the redesign without the radial static pressure distribution constraint (RSPDC) gives an optimal solution that shows deviations on radial static pressure distribution, especially at rotor exit tip region. On the other hand, the redesign with the RSPDC successfully keeps the radial static pressure distribution at the interfaces between rows and make sure that the optimization results are applicable in a practical engineering design.

  15. Adjoint Tomography of Taiwan Region: From Travel-Time Toward Waveform Inversion

    NASA Astrophysics Data System (ADS)

    Huang, H. H.; Lee, S. J.; Tromp, J.

    2014-12-01

    The complicated tectonic environment such as Taiwan region can modulate the seismic waveform severely and hamper the discrimination and the utilization of later phases. Restricted to the use of only first arrivals of P- and S-wave, the travel-time tomographic models of Taiwan can simulate the seismic waveform barely to a frequency of 0.2 Hz to date. While it has been sufficient for long-period studies, e.g. source inversion, this frequency band is still far from the applications to the community and high-resolution studies. To achieve a higher-frequency simulation, more data and the considerations of off-path and finite-frequency effects are necessary. Based on the spectral-element and the adjoint method recently developed, we prepared 94 MW 3.5-6.0 earthquakes with well-defined location and focal mechanism solutions from Real-Time Moment Tensor Monitoring System (RMT), and preformed an iterative gradient-based inversion employing waveform modeling and finite-frequency measurements of adjoint method. By which the 3-D sensitivity kernels are taken into account realistically and the full waveform information are naturally sought, without a need of any phase pick. A preliminary model m003 using 10-50 sec data was demonstrated and compared with previous travel-time models. The primary difference appears in the mountainous area, where the previous travel-time model may underestimate the S-wave speed in the upper crust, but overestimates in the lower crust.

  16. Aerodynamic Shape Optimization of Complex Aircraft Configurations via an Adjoint Formulation

    NASA Technical Reports Server (NTRS)

    Reuther, James; Jameson, Antony; Farmer, James; Martinelli, Luigi; Saunders, David

    1996-01-01

    This work describes the implementation of optimization techniques based on control theory for complex aircraft configurations. Here control theory is employed to derive the adjoint differential equations, the solution of which allows for a drastic reduction in computational costs over previous design methods (13, 12, 43, 38). In our earlier studies (19, 20, 22, 23, 39, 25, 40, 41, 42) it was shown that this method could be used to devise effective optimization procedures for airfoils, wings and wing-bodies subject to either analytic or arbitrary meshes. Design formulations for both potential flows and flows governed by the Euler equations have been demonstrated, showing that such methods can be devised for various governing equations (39, 25). In our most recent works (40, 42) the method was extended to treat wing-body configurations with a large number of mesh points, verifying that significant computational savings can be gained for practical design problems. In this paper the method is extended for the Euler equations to treat complete aircraft configurations via a new multiblock implementation. New elements include a multiblock-multigrid flow solver, a multiblock-multigrid adjoint solver, and a multiblock mesh perturbation scheme. Two design examples are presented in which the new method is used for the wing redesign of a transonic business jet.

  17. A Multiple Time-Step Finite State Projection Algorithm for the Solution to the Chemical Master Equation

    DTIC Science & Technology

    2006-11-30

    of Mechanical and Environmental Engineering University of California, Santa Barbara Abstract At the mesoscopic scale, chemical processes have...linearity property of super-positioning, and we illustrate the benefits of this algorithm on a simplified model of the heat shock mechanism in E. coli...random number generator, the collected statistical data would converge to the exact solution to the CME. Unfortunately, the convergence rate for any

  18. Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: II. Solutions and applications

    DOE PAGES

    Frolov, Vladimir; Backhaus, Scott; Chertkov, Misha

    2014-10-01

    In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~ 2700 nodes and ~ 3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polishmore » grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements.« less

  19. Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Solutions and Applications (PART II)

    SciTech Connect

    Frolov, Vladimir; Backhaus, Scott N.; Chertkov, Michael

    2014-01-14

    In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~2700 nodes and ~3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polish grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements

  20. Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: II. Solutions and applications

    SciTech Connect

    Frolov, Vladimir; Backhaus, Scott; Chertkov, Misha

    2014-10-01

    In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~ 2700 nodes and ~ 3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polish grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements.

  1. A Piecewise Solution to the Reconfiguration Problem by a Minimal Spanning Tree Algorithm

    NASA Astrophysics Data System (ADS)

    Ramirez, Juan M.; Montoya, Diana P.

    2014-10-01

    This paper proposes a minimal spanning tree (MST) algorithm to solve the networks' reconfiguration problem in radial distribution systems (RDS). The paper focuses on power losses' reduction by selecting the best radial configuration. The reconfiguration problem is a non-differentiable and highly combinatorial optimization problem. The proposed methodology is a deterministic Kruskal's algorithm based on graph theory, which is appropriate for this application generating only a feasible radial topology. The proposed MST algorithm has been tested on an actual RDS, which has been split into subsystems.

  2. Development of a four-dimensional variational analysis system using the adjoint method at GLA. I - Dynamics

    NASA Technical Reports Server (NTRS)

    Chao, Winston C.; Chang, Lang-Ping

    1992-01-01

    Recent developments in the field of data assimilation have pointed to variational analysis (essentially least-squares fitting of a model solution to observed data) using the adjoint method as a new direction that holds the potential of major improvements over the current optimal interpolation method. This paper describes the initial effort in the development of a 4D variational analysis system. Although the development is based on the Goddard Laboratory for Atmospheres General Circulation Model (GCM), the methods and procedures described in this paper can be applied to any model. The adjoint code that computes the gradients needed in the analysis can be written directly from the GCM code. An easy error-detection technique was devised in the construction of the adjoint model. Also, a method of determining the weights and the preconditioning scales for the cases where model-generated data, which are error free, are used as observation is proposed. Two test experiments show that the dynamics part of the system has been successfully completed.

  3. Towards Multi-resolution Adjoint Tomography of the European Crust and Upper Mantle

    NASA Astrophysics Data System (ADS)

    Basini, P.; Nissen-Meyer, T.; Boschi, L.; Schenk, O.; Verbeke, J.; Hanasoge, S.; Giardini, D.

    2010-12-01

    Thanks to continuously improved instrument coverage, and the growth of high-performance computational infrastructure, it is now possible to enhance the resolution at which seismologists image the Earth's interior. While most algorithms in global seismic tomography today are grounded on the ray-theory approximation, however, resolution and model complexity can effectively be enhanced only through the application of more advanced techniques accounting for the many complexities of the partial derivatives relating seismic data and Earth structure. These include full-wave forward modelling methods and adjoint algorithms, which together set a framework for iterative, nonlinear inversion upon complex 3D structures. We take advantage of these methodological improvements using a newly developed, flexible spectral-element method (SPECFEM3D) with embedded adjoint capabilities to devise new tomographic models of the European crust and upper mantle. We chose a two-scale strategy, in which we use global surface wave data to first constrain the large-scale structures, and simultaneously invert for high-resolution, regional structures based on measurements of ambient noise in central and southern Europe. By its very nature, and as a result of the dense station coverage over the continent, the ambient-noise method affords us a particularly uniform seismic coverage. To define surface-wave sensitivity kernels, we construct a flexible, global mesh of the upper mantle only (i.e., a spherical shell) honoring all global discontinuities, and include 3D starting models down to periods of 30 seconds. The noise data are cross-correlated to obtain station-to-station Green's functions. We will present examples of sensitivity kernels computed for these noise-based Green's functions and discuss the data-specific validity of the underlying assumptions to extract Green's functions. The local setup, which is constructed using the same software as in the global case, needs to honor internal and

  4. Hybrid conjugate gradient-Occam algorithms for inversion of multifrequency and multitransmitter EM data

    NASA Astrophysics Data System (ADS)

    Egbert, Gary D.

    2012-07-01

    We describe novel hybrid algorithms for inversion of electromagnetic geophysical data, combining the computational and storage efficiency of a conjugate gradient approach with an Occam scheme for regularization and step-length control. The basic algorithm is based on the observation that iterative solution of the symmetric (Gauss-Newton) normal equations with conjugate gradients effectively generates a sequence of sensitivities for different linear combinations of the data, allowing construction of the Jacobian for a projection of the original full data space. The Occam scheme can then be applied to this projected problem, with the tradeoff parameter chosen by assessing fit to the full data set. For EM geophysical problems with multiple transmitters (either multiple frequencies or source geometries) an extension of the basic hybrid algorithm is possible. In this case multiple forward and adjoint solutions (one each for each transmitter) are required for each step in the iterative normal equation solver, and each corresponds to the sensitivity for a separate linear combination of data. From the perspective of the hybrid approach, with conjugate gradients generating an approximation to the full Jacobian, it is advantageous to save all of the component sensitivities, and use these to solve the projected problem in a larger subspace. We illustrate the algorithms on a simple problem, 2-D magnetotelluric inversion, using synthetic data. Both the basic and modified hybrid schemes produce essentially the same result as an Occam inversion based on a full calculation of the Jacobian, and the modified scheme requires significantly fewer steps (relative to the basic hybrid scheme) to converge to an adequate solution to the normal equations. The algorithms are expected to be useful primarily for 3-D inverse problems for which the computational burden is heavily dominated by solution to the forward and adjoint problems.

  5. Adjoint optimal control problems for the RANS system

    NASA Astrophysics Data System (ADS)

    Attavino, A.; Cerroni, D.; Da Vià, R.; Manservisi, S.; Menghini, F.

    2017-01-01

    Adjoint optimal control in computational fluid dynamics has become increasingly popular recently because of its use in several engineering and research studies. However the optimal control of turbulent flows without the use of Direct Numerical Simulation is still an open problem and various methods have been proposed based on different approaches. In this work we study optimal control problems for a turbulent flow modeled with a Reynolds-Averaged Navier-Stokes system. The adjoint system is obtained through the use of a Lagrangian multiplier method by setting as objective of the control a velocity matching profile or an increase or decrease in the turbulent kinetic energy. The optimality system is solved with an in-house finite element code and numerical results are reported in order to show the validity of this approach.

  6. Accurate adjoint design sensitivities for nano metal optics.

    PubMed

    Hansen, Paul; Hesselink, Lambertus

    2015-09-07

    We present a method for obtaining accurate numerical design sensitivities for metal-optical nanostructures. Adjoint design sensitivity analysis, long used in fluid mechanics and mechanical engineering for both optimization and structural analysis, is beginning to be used for nano-optics design, but it fails for sharp-cornered metal structures because the numerical error in electromagnetic simulations of metal structures is highest at sharp corners. These locations feature strong field enhancement and contribute strongly to design sensitivities. By using high-accuracy FEM calculations and rounding sharp features to a finite radius of curvature we obtain highly-accurate design sensitivities for 3D metal devices. To provide a bridge to the existing literature on adjoint methods in other fields, we derive the sensitivity equations for Maxwell's equations in the PDE framework widely used in fluid mechanics.

  7. Adjoint Fokker-Planck equation and runaway electron dynamics

    SciTech Connect

    Liu, Chang; Brennan, Dylan P.; Bhattacharjee, Amitava; Boozer, Allen H.

    2016-01-15

    The adjoint Fokker-Planck equation method is applied to study the runaway probability function and the expected slowing-down time for highly relativistic runaway electrons, including the loss of energy due to synchrotron radiation. In direct correspondence to Monte Carlo simulation methods, the runaway probability function has a smooth transition across the runaway separatrix, which can be attributed to effect of the pitch angle scattering term in the kinetic equation. However, for the same numerical accuracy, the adjoint method is more efficient than the Monte Carlo method. The expected slowing-down time gives a novel method to estimate the runaway current decay time in experiments. A new result from this work is that the decay rate of high energy electrons is very slow when E is close to the critical electric field. This effect contributes further to a hysteresis previously found in the runaway electron population.

  8. Adjoint Fokker-Planck equation and runaway electron dynamics

    NASA Astrophysics Data System (ADS)

    Liu, Chang; Brennan, Dylan P.; Bhattacharjee, Amitava; Boozer, Allen H.

    2016-01-01

    The adjoint Fokker-Planck equation method is applied to study the runaway probability function and the expected slowing-down time for highly relativistic runaway electrons, including the loss of energy due to synchrotron radiation. In direct correspondence to Monte Carlo simulation methods, the runaway probability function has a smooth transition across the runaway separatrix, which can be attributed to effect of the pitch angle scattering term in the kinetic equation. However, for the same numerical accuracy, the adjoint method is more efficient than the Monte Carlo method. The expected slowing-down time gives a novel method to estimate the runaway current decay time in experiments. A new result from this work is that the decay rate of high energy electrons is very slow when E is close to the critical electric field. This effect contributes further to a hysteresis previously found in the runaway electron population.

  9. Three-Dimensional Turbulent RANS Adjoint-Based Error Correction

    NASA Technical Reports Server (NTRS)

    Park, Michael A.

    2003-01-01

    Engineering problems commonly require functional outputs of computational fluid dynamics (CFD) simulations with specified accuracy. These simulations are performed with limited computational resources. Computable error estimates offer the possibility of quantifying accuracy on a given mesh and predicting a fine grid functional on a coarser mesh. Such an estimate can be computed by solving the flow equations and the associated adjoint problem for the functional of interest. An adjoint-based error correction procedure is demonstrated for transonic inviscid and subsonic laminar and turbulent flow. A mesh adaptation procedure is formulated to target uncertainty in the corrected functional and terminate when error remaining in the calculation is less than a user-specified error tolerance. This adaptation scheme is shown to yield anisotropic meshes with corrected functionals that are more accurate for a given number of grid points then isotropic adapted and uniformly refined grids.

  10. The fast neutron fluence and the activation detector activity calculations using the effective source method and the adjoint function

    SciTech Connect

    Hep, J.; Konecna, A.; Krysl, V.; Smutny, V.

    2011-07-01

    This paper describes the application of effective source in forward calculations and the adjoint method to the solution of fast neutron fluence and activation detector activities in the reactor pressure vessel (RPV) and RPV cavity of a VVER-440 reactor. Its objective is the demonstration of both methods on a practical task. The effective source method applies the Boltzmann transport operator to time integrated source data in order to obtain neutron fluence and detector activities. By weighting the source data by time dependent decay of the detector activity, the result of the calculation is the detector activity. Alternatively, if the weighting is uniform with respect to time, the result is the fluence. The approach works because of the inherent linearity of radiation transport in non-multiplying time-invariant media. Integrated in this way, the source data are referred to as the effective source. The effective source in the forward calculations method thereby enables the analyst to replace numerous intensive transport calculations with a single transport calculation in which the time dependence and magnitude of the source are correctly represented. In this work, the effective source method has been expanded slightly in the following way: neutron source data were performed with few group method calculation using the active core calculation code MOBY-DICK. The follow-up neutron transport calculation was performed using the neutron transport code TORT to perform multigroup calculations. For comparison, an alternative method of calculation has been used based upon adjoint functions of the Boltzmann transport equation. Calculation of the three-dimensional (3-D) adjoint function for each required computational outcome has been obtained using the deterministic code TORT and the cross section library BGL440. Adjoint functions appropriate to the required fast neutron flux density and neutron reaction rates have been calculated for several significant points within the RPV

  11. Reasons why current speech-enhancement algorithms do not improve speech intelligibility and suggested solutions.

    PubMed

    Loizou, Philipos C; Kim, Gibak

    2011-01-01

    Existing speech enhancement algorithms can improve speech quality but not speech intelligibility, and the reasons for that are unclear. In the present paper, we present a theoretical framework that can be used to analyze potential factors that can influence the intelligibility of processed speech. More specifically, this framework focuses on the fine-grain analysis of the distortions introduced by speech enhancement algorithms. It is hypothesized that if these distortions are properly controlled, then large gains in intelligibility can be achieved. To test this hypothesis, intelligibility tests are conducted with human listeners in which we present processed speech with controlled speech distortions. The aim of these tests is to assess the perceptual effect of the various distortions that can be introduced by speech enhancement algorithms on speech intelligibility. Results with three different enhancement algorithms indicated that certain distortions are more detrimental to speech intelligibility degradation than others. When these distortions were properly controlled, however, large gains in intelligibility were obtained by human listeners, even by spectral-subtractive algorithms which are known to degrade speech quality and intelligibility.

  12. A comparison of adjoint and data-centric verification techniques.

    SciTech Connect

    Wildey, Timothy Michael; Cyr, Eric C; Shadid, John N; Pawlowski, Roger P; Smith, Thomas Michael

    2013-03-01

    This document summarizes the results from a level 3 milestone study within the CASL VUQ effort. We compare the adjoint-based a posteriori error estimation approach with a recent variant of a data-centric verification technique. We provide a brief overview of each technique and then we discuss their relative advantages and disadvantages. We use Drekar::CFD to produce numerical results for steady-state Navier Stokes and SARANS approximations. 3

  13. Seismic Window Selection and Misfit Measurements for Global Adjoint Tomography

    NASA Astrophysics Data System (ADS)

    Lei, W.; Bozdag, E.; Lefebvre, M.; Podhorszki, N.; Smith, J. A.; Tromp, J.

    2013-12-01

    Global Adjoint Tomography requires fast parallel processing of large datasets. After obtaing the preprocessed observed and synthetic seismograms, we use the open source software packages FLEXWIN (Maggi et al. 2007) to select time windows and MEASURE_ADJ to make measurements. These measurements define adjoint sources for data assimilation. Previous versions of these tools work on a pair of SAC files---observed and synthetic seismic data for the same component and station, and loop over all seismic records associated with one earthquake. Given the large number of stations and earthquakes, the frequent read and write operations create severe I/O bottlenecks on modern computing platforms. We present new versions of these tools utilizing a new seismic data format, namely the Adaptive Seismic Data Format(ASDF). This new format shows superior scalability for applications on high-performance computers and accommodates various types of data, including earthquake, industry and seismic interferometry datasets. ASDF also provides user-friendly APIs, which can be easily integrated into the adjoint tomography workflow and combined with other data processing tools. In addition to solving the I/O bottleneck, we are making several improvements to these tools. For example, FLEXWIN is tuned to select windows for different types of earthquakes. To capture their distinct features, we categorize earthquakes by their depths and frequency bands. Moreover, instead of only picking phases between the first P arrival and the surface-wave arrivals, our aim is to select and assimilate many other later prominent phases in adjoint tomography. For example, in the body-wave band (17 s - 60 s), we include SKS, sSKS and their multiple, while in the surface-wave band (60 s - 120 s) we incorporate major-arc surface waves.

  14. Adjoint modeling for atmospheric pollution process sensitivity at regional scale

    NASA Astrophysics Data System (ADS)

    Menut, Laurent

    2003-09-01

    During the summer 1998, a strong pollution event was documented over Paris as part of the Etude et Simulation de la Qualité de l'air en Ile-de-France (ESQUIF) project (second intensive observation period (IOP2)). From 7 to 9 August 1998 the pollution event changes from a well-marked ozone plume issued from Paris to a more general pollution over the whole Ile-de-France region. Using a three-dimensional chemistry-transport model and its adjoint part, the sensitivity of ozone, Ox, and NOx peaks to model parameters is investigated. For two locations, Paris and a suburban site, the influence of both meteorological and chemical model parameters on the simulated field concentrations is hourly quantified for each day. Processes leading to a urban polluted event are compared. It is shown that the pollutant concentrations are mainly driven by traffic and solvent surface emissions and meteorological parameters such as temperature. Since the adjoint approach is limited to infinitesimal model perturbation, some scenario simulations are carried out to evaluate the linearity of the impact of the most sensitive parameters within the uncertainty range. It is shown that the sensitivities determined from the adjoint approach can be extrapolated until their uncertainty ranges except for the wind speed.

  15. Adjoint based sensitivity analysis of a reacting jet in crossflow

    NASA Astrophysics Data System (ADS)

    Sashittal, Palash; Sayadi, Taraneh; Schmid, Peter

    2016-11-01

    With current advances in computational resources, high fidelity simulations of reactive flows are increasingly being used as predictive tools in various industrial applications. In order to capture the combustion process accurately, detailed/reduced chemical mechanisms are employed, which in turn rely on various model parameters. Therefore, it would be of great interest to quantify the sensitivities of the predictions with respect to the introduced models. Due to the high dimensionality of the parameter space, methods such as finite differences which rely on multiple forward simulations prove to be very costly and adjoint based techniques are a suitable alternative. The complex nature of the governing equations, however, renders an efficient strategy in finding the adjoint equations a challenging task. In this study, we employ the modular approach of Fosas de Pando et al. (2012), to build a discrete adjoint framework applied to a reacting jet in crossflow. The developed framework is then used to extract the sensitivity of the integrated heat release with respect to the existing combustion parameters. Analyzing the sensitivities in the three-dimensional domain provides insight towards the specific regions of the flow that are more susceptible to the choice of the model.

  16. Unsteady Adjoint Approach for Design Optimization of Flapping Airfoils

    NASA Technical Reports Server (NTRS)

    Lee, Byung Joon; Liou, Meng-Sing

    2012-01-01

    This paper describes the work for optimizing the propulsive efficiency of flapping airfoils, i.e., improving the thrust under constraining aerodynamic work during the flapping flights by changing their shape and trajectory of motion with the unsteady discrete adjoint approach. For unsteady problems, it is essential to properly resolving time scales of motion under consideration and it must be compatible with the objective sought after. We include both the instantaneous and time-averaged (periodic) formulations in this study. For the design optimization with shape parameters or motion parameters, the time-averaged objective function is found to be more useful, while the instantaneous one is more suitable for flow control. The instantaneous objective function is operationally straightforward. On the other hand, the time-averaged objective function requires additional steps in the adjoint approach; the unsteady discrete adjoint equations for a periodic flow must be reformulated and the corresponding system of equations solved iteratively. We compare the design results from shape and trajectory optimizations and investigate the physical relevance of design variables to the flapping motion at on- and off-design conditions.

  17. A sequential quadratic programming algorithm using an incomplete solution of the subproblem

    SciTech Connect

    Murray, W.; Prieto, F.J.

    1993-05-01

    We analyze sequential quadratic programming (SQP) methods to solve nonlinear constrained optimization problems that are more flexible in their definition than standard SQP methods. The type of flexibility introduced is motivated by the necessity to deviate from the standard approach when solving large problems. Specifically we no longer require a minimizer of the QP subproblem to be determined or particular Lagrange multiplier estimates to be used. Our main focus is on an SQP algorithm that uses a particular augmented Lagrangian merit function. New results are derived for this algorithm under weaker conditions than previously assumed; in particular, it is not assumed that the iterates lie on a compact set.

  18. Approximate analytical solution of the nonlinear fractional KdV-Burgers equation: A new iterative algorithm

    NASA Astrophysics Data System (ADS)

    El-Ajou, Ahmad; Arqub, Omar Abu; Momani, Shaher

    2015-07-01

    In this paper, explicit and approximate solutions of the nonlinear fractional KdV-Burgers equation with time-space-fractional derivatives are presented and discussed. The solutions of our equation are calculated in the form of rabidly convergent series with easily computable components. The utilized method is a numerical technique based on the generalized Taylor series formula which constructs an analytical solution in the form of a convergent series. Five illustrative applications are given to demonstrate the effectiveness and the leverage of the present method. Graphical results and series formulas are utilized and discussed quantitatively to illustrate the solution. The results reveal that the method is very effective and simple in determination of solution of the fractional KdV-Burgers equation.

  19. Nonlinear self-adjointness and conservation laws of Klein-Gordon-Fock equation with central symmetry

    NASA Astrophysics Data System (ADS)

    Abdulwahhab, Muhammad Alim

    2015-05-01

    The concept of nonlinear self-adjointness, introduced by Ibragimov, has significantly extends approaches to constructing conservation laws associated with symmetries since it incorporates the strict self-adjointness, the quasi self-adjointness as well as the usual linear self-adjointness. Using this concept, the nonlinear self-adjointness condition for the Klein-Gordon-Fock equation was established and subsequently used to construct simplified but infinitely many nontrivial and independent conserved vectors. The Noether's theorem was further applied to the Klein-Gordon-Fock equation to explore more distinct first integrals, result shows that conservation laws constructed through this approach are exactly the same as those obtained under strict self-adjointness of Ibragimov's method.

  20. Adjoint-Based Sensitivity Maps for the Nearshore

    NASA Astrophysics Data System (ADS)

    Orzech, Mark; Veeramony, Jay; Ngodock, Hans

    2013-04-01

    The wave model SWAN (Booij et al., 1999) solves the spectral action balance equation to produce nearshore wave forecasts and climatologies. It is widely used by the coastal modeling community and is part of a variety of coupled ocean-wave-atmosphere model systems. A variational data assimilation system (Orzech et al., 2013) has recently been developed for SWAN and is presently being transitioned to operational use by the U.S. Naval Oceanographic Office. This system is built around a numerical adjoint to the fully nonlinear, nonstationary SWAN code. When provided with measured or artificial "observed" spectral wave data at a location of interest on a given nearshore bathymetry, the adjoint can compute the degree to which spectral energy levels at other locations are correlated with - or "sensitive" to - variations in the observed spectrum. Adjoint output may be used to construct a sensitivity map for the entire domain, tracking correlations of spectral energy throughout the grid. When access is denied to the actual locations of interest, sensitivity maps can be used to determine optimal alternate locations for data collection by identifying regions of greatest sensitivity in the mapped domain. The present study investigates the properties of adjoint-generated sensitivity maps for nearshore wave spectra. The adjoint and forward SWAN models are first used in an idealized test case at Duck, NC, USA, to demonstrate the system's effectiveness at optimizing forecasts of shallow water wave spectra for an inaccessible surf-zone location. Then a series of simulations is conducted for a variety of different initializing conditions, to examine the effects of seasonal changes in wave climate, errors in bathymetry, and variations in size and shape of the inaccessible region of interest. Model skill is quantified using two methods: (1) a more traditional correlation of observed and modeled spectral statistics such as significant wave height, and (2) a recently developed RMS

  1. Using Adjoint Methods to Improve 3-D Velocity Models of Southern California

    NASA Astrophysics Data System (ADS)

    Liu, Q.; Tape, C.; Maggi, A.; Tromp, J.

    2006-12-01

    We use adjoint methods popular in climate and ocean dynamics to calculate Fréchet derivatives for tomographic inversions in southern California. The Fréchet derivative of an objective function χ(m), where m denotes the Earth model, may be written in the generic form δχ=int Km(x) δln m(x) d3x, where δln m=δ m/m denotes the relative model perturbation. For illustrative purposes, we construct the 3-D finite-frequency banana-doughnut kernel Km, corresponding to the misfit of a single traveltime measurement, by simultaneously computing the 'adjoint' wave field s† forward in time and reconstructing the regular wave field s backward in time. The adjoint wave field is produced by using the time-reversed velocity at the receiver as a fictitious source, while the regular wave field is reconstructed on the fly by propagating the last frame of the wave field saved by a previous forward simulation backward in time. The approach is based upon the spectral-element method, and only two simulations are needed to produce density, shear-wave, and compressional-wave sensitivity kernels. This method is applied to the SCEC southern California velocity model. Various density, shear-wave, and compressional-wave sensitivity kernels are presented for different phases in the seismograms. We also generate 'event' kernels for Pnl, S and surface waves, which are the Fréchet kernels of misfit functions that measure the P, S or surface wave traveltime residuals at all the receivers simultaneously for one particular event. Effectively, an event kernel is a sum of weighted Fréchet kernels, with weights determined by the associated traveltime anomalies. By the nature of the 3-D simulation, every event kernel is also computed based upon just two simulations, i.e., its construction costs the same amount of computation time as an individual banana-doughnut kernel. One can think of the sum of the event kernels for all available earthquakes, called the 'misfit' kernel, as a graphical

  2. Modeling Finite Faults Using the Adjoint Wave Field

    NASA Astrophysics Data System (ADS)

    Hjörleifsdóttir, V.; Liu, Q.; Tromp, J.

    2004-12-01

    Time-reversal acoustics, a technique in which an acoustic signal is recorded by an array of transducers, time-reversed, and retransmitted, is used, e.g., in medical therapy to locate and destroy gallstones (for a review see Fink, 1997). As discussed by Tromp et al. (2004), time-reversal techniques for locating sources are closely linked to so-called `adjoint methods' (Talagrand and Courtier, 1987), which may be used to evaluate the gradient of a misfit function. Tromp et al. (2004) illustrate how a (finite) source inversion may be implemented based upon the adjoint wave field by writing the change in the misfit function, δ χ, due to a change in the moment-density tensor, δ m, as an integral of the adjoint strain field ɛ x,t) over the fault plane Σ : δ χ = ∫ 0T∫_Σ ɛ x,T-t) :δ m(x,t) d2xdt. We find that if the real fault plane is located at a distance δ h in the direction of the fault normal hat n, then to first order an additional factor of ∫ 0T∫_Σ δ h (x) ∂ n ɛ x,T-t):m(x,t) d2xdt is added to the change in the misfit function. The adjoint strain is computed by using the time-reversed difference between data and synthetics recorded at all receivers as simultaneous sources and recording the resulting strain on the fault plane. In accordance with time-reversal acoustics, all the resulting waves will constructively interfere at the position of the original source in space and time. The level of convergence will be deterimined by factors such as the source-receiver geometry, the frequency of the recorded data and synthetics, and the accuracy of the velocity structure used when back propagating the wave field. The terms ɛ x,T-t) and ∂ n ɛ x,T-t):m(x,t) can be viewed as sensitivity kernels for the moment density and the faultplane location respectively. By looking at these quantities we can make an educated choice of fault parametrization given the data in hand. The process can then be repeated to invert for the best source model, as

  3. Effect of the acoustic environment on adjoint sound speed inversions

    NASA Astrophysics Data System (ADS)

    Richards, Edward

    The recent prevalence of low cost robotic platforms such as oceanographic gliders has increased the availability of long-term measurements of the ocean environment. Gliders can take direct measurements of the ocean sound speed environment, which is of interest in many ocean acoustic problems, including source localization and tomography. These measurements, however, have a low spatial-temporal resolution that makes them difficult to use directly. These measurements have the potential to provide an accurate environmental parameterization for acoustic inversions, which could in turn be used to measure the sound speed field at a much higher spatial-temporal resolution. This study uses glider measurements to provide the environmental parameterization used in the adjoint inversion method. The adjoint method calculates the gradient of a cost function describing the mismatch between observed data and acoustic model predictions with respect to the ocean sound speed. This gradient is a measure of how changing the sound speed at any point in the acoustic environment would affect this misfit. This cost function and its gradient information is then used as inputs to a numerical optimization routine, which efficiently finds a local minimum. There are two challenges of this method addressed in this study; the first is restricting the search space of this inversion. Proper parameterization of the inversion will ensure that the local minimum found in the numerical optimization routine is the correct result of the inversion. This parameterization allows for the combination of the relative strengths of both methods of measuring the sound speed field, the robust direct measurement of the glider and the near instantaneous result of an acoustic inversion. A covariance matrix is created from glider measurements of the range dependent sound speed field, which is then decomposed into an empirical orthogonal function (EOF) base. The mean profile and the significant EOF bases then form the

  4. Multidimensional scaling for evolutionary algorithms--visualization of the path through search space and solution space using Sammon mapping.

    PubMed

    Pohlheim, Hartmut

    2006-01-01

    Multidimensional scaling as a technique for the presentation of high-dimensional data with standard visualization techniques is presented. The technique used is often known as Sammon mapping. We explain the mathematical foundations of multidimensional scaling and its robust calculation. We also demonstrate the use of this technique in the area of evolutionary algorithms. First, we present the visualization of the path through the search space of the best individuals during an optimization run. We then apply multidimensional scaling to the comparison of multiple runs regarding the variables of individuals and multi-criteria objective values (path through the solution space).

  5. A Nested Genetic Algorithm for the Numerical Solution of Non-Linear Coupled Equations in Water Quality Modeling

    NASA Astrophysics Data System (ADS)

    García, Hermes A.; Guerrero-Bolaño, Francisco J.; Obregón-Neira, Nelson

    2010-05-01

    Due to both mathematical tractability and efficiency on computational resources, it is very common to find in the realm of numerical modeling in hydro-engineering that regular linearization techniques have been applied to nonlinear partial differential equations properly obtained in environmental flow studies. Sometimes this simplification is also made along with omission of nonlinear terms involved in such equations which in turn diminishes the performance of any implemented approach. This is the case for example, for contaminant transport modeling in streams. Nowadays, a traditional and one of the most common used water quality model such as QUAL2k, preserves its original algorithm, which omits nonlinear terms through linearization techniques, in spite of the continuous algorithmic development and computer power enhancement. For that reason, the main objective of this research was to generate a flexible tool for non-linear water quality modeling. The solution implemented here was based on two genetic algorithms, used in a nested way in order to find two different types of solutions sets: the first set is composed by the concentrations of the physical-chemical variables used in the modeling approach (16 variables), which satisfies the non-linear equation system. The second set, is the typical solution of the inverse problem, the parameters and constants values for the model when it is applied to a particular stream. From a total of sixteen (16) variables, thirteen (13) was modeled by using non-linear coupled equation systems and three (3) was modeled in an independent way. The model used here had a requirement of fifty (50) parameters. The nested genetic algorithm used for the numerical solution of a non-linear equation system proved to serve as a flexible tool to handle with the intrinsic non-linearity that emerges from the interactions occurring between multiple variables involved in water quality studies. However because there is a strong data limitation in

  6. Extension of the ADjoint Approach to a Laminar Navier-Stokes Solver

    NASA Astrophysics Data System (ADS)

    Paige, Cody

    The use of adjoint methods is common in computational fluid dynamics to reduce the cost of the sensitivity analysis in an optimization cycle. The forward mode ADjoint is a combination of an adjoint sensitivity analysis method with a forward mode automatic differentiation (AD) and is a modification of the reverse mode ADjoint method proposed by Mader et al.[1]. A colouring acceleration technique is presented to reduce the computational cost increase associated with forward mode AD. The forward mode AD facilitates the implementation of the laminar Navier-Stokes (NS) equations. The forward mode ADjoint method is applied to a three-dimensional computational fluid dynamics solver. The resulting Euler and viscous ADjoint sensitivities are compared to the reverse mode Euler ADjoint derivatives and a complex-step method to demonstrate the reduced computational cost and accuracy. Both comparisons demonstrate the benefits of the colouring method and the practicality of using a forward mode AD. [1] Mader, C.A., Martins, J.R.R.A., Alonso, J.J., and van der Weide, E. (2008) ADjoint: An approach for the rapid development of discrete adjoint solvers. AIAA Journal, 46(4):863-873. doi:10.2514/1.29123.

  7. Aerodynamic shape optimization via discrete adjoint formulation using Euler equations on unstructured grids

    NASA Astrophysics Data System (ADS)

    Nath, Bijoyendra

    A methodology for aerodynamic shape optimization on two-dimensional unstructured grids using Euler equations is presented. The sensitivity derivatives are obtained using the discrete adjoint formulation. The Euler equations are solved using a fully implicit, upwind, cell-vertex, median-dual finite volume scheme. Roe's upwind flux-difference-splitting scheme is used to determine the inviscid fluxes. To enable discontinuities to be captured without oscillations, limiters are used at the reconstruction stage. The derivation of the accurate discretization of the flux Jacobians due to the conserved variables and the entire mesh required for the costate equation is developed and its efficient accumulation algorithm on an edge-based loop is implemented and documented. Exact linearization of Roe's approximate Riemann solver is incorporated into the aerodynamic analysis as well as the sensitivity analysis. Higher-order discretization is achieved by including all distance-one and -two terms due to the reconstruction and the limiter, although the limiter is not linearized. Two-dimensional body conforming grid movement strategy and grid sensitivity are obtained by considering the grid to be a system of interconnected springs. Arbitrary airfoil geometries are obtained using an algorithm for generalized von Mises airfoils with finite trailing edges. An incremental iterative formulation is used to solve the large sparse linear systems of equations obtained from the sensitivity analysis. The discrete linear systems obtained from the equations governing the flow and those from the sensitivity analysis are solved iteratively using the preconditioned GMRES (Generalized Minimum Residual) algorithm. For the optimization process, a constrained nonlinear programming package which uses a sequential quadratic programming algorithm is used. This study presents the process of analytically obtaining the exact discrete sensitivity derivatives and computationally cost-effective algorithms to

  8. Towards adjoint-based inversion of time-dependent mantle convection with non-linear viscosity

    NASA Astrophysics Data System (ADS)

    Li, Dunzhu; Gurnis, Michael; Stadler, Georg

    2017-01-01

    We develop and study an adjoint-based inversion method for the simultaneous recovery of initial temperature conditions and viscosity parameters in time-dependent mantle convection from the current mantle temperature and historic plate motion. Based on a realistic rheological model with temperature- and strain rate-dependent viscosity, we formulate the inversion as a PDE-constrained optimization problem. The objective functional includes the misfit of surface velocity (plate motion) history, the misfit of the current mantle temperature, and a regularization for the uncertain initial condition. The gradient of this functional with respect to the initial temperature and the uncertain viscosity parameters is computed by solving the adjoint of the mantle convection equations. This gradient is used in a preconditioned quasi-Newton minimization algorithm. We study the prospects and limitations of the inversion, as well as the computational performance of the method using two synthetic problems, a sinking cylinder and a realistic subduction model. The subduction model is characterized by the migration of a ridge toward a trench whereby both plate motions and subduction evolve. The results demonstrate: (1) for known viscosity parameters, the initial temperature can be well recovered, as in previous initial condition-only inversions where the effective viscosity was given; (2) for known initial temperature, viscosity parameters can be recovered accurately, despite the existence of trade-offs due to ill-conditioning; (3) for the joint inversion of initial condition and viscosity parameters, initial condition and effective viscosity can be reasonably recovered, but the high dimension of the parameter space and the resulting ill-posedness may limit recovery of viscosity parameters.

  9. Data assimilation for massive autonomous systems based on a second-order adjoint method

    NASA Astrophysics Data System (ADS)

    Ito, Shin-ichi; Nagao, Hiromichi; Yamanaka, Akinori; Tsukada, Yuhki; Koyama, Toshiyuki; Kano, Masayuki; Inoue, Junya

    2016-10-01

    Data assimilation (DA) is a fundamental computational technique that integrates numerical simulation models and observation data on the basis of Bayesian statistics. Originally developed for meteorology, especially weather forecasting, DA is now an accepted technique in various scientific fields. One key issue that remains controversial is the implementation of DA in massive simulation models under the constraints of limited computation time and resources. In this paper, we propose an adjoint-based DA method for massive autonomous models that produces optimum estimates and their uncertainties within reasonable computation time and resource constraints. The uncertainties are given as several diagonal elements of an inverse Hessian matrix, which is the covariance matrix of a normal distribution that approximates the target posterior probability density function in the neighborhood of the optimum. Conventional algorithms for deriving the inverse Hessian matrix require O (C N2+N3) computations and O (N2) memory, where N is the number of degrees of freedom of a given autonomous system and C is the number of computations needed to simulate time series of suitable length. The proposed method using a second-order adjoint method allows us to directly evaluate the diagonal elements of the inverse Hessian matrix without computing all of its elements. This drastically reduces the number of computations to O (C ) and the amount of memory to O (N ) for each diagonal element. The proposed method is validated through numerical tests using a massive two-dimensional Kobayashi phase-field model. We confirm that the proposed method correctly reproduces the parameter and initial state assumed in advance, and successfully evaluates the uncertainty of the parameter. Such information regarding uncertainty is valuable, as it can be used to optimize the design of experiments.

  10. A weighted adjoint-source for weight-window generation by means of a linear tally combination

    SciTech Connect

    Sood, Avneet; Booth, Thomas E; Solomon, Clell J

    2009-01-01

    A new importance estimation technique has been developed that allows weight-window optimization for a linear combination of tallies. This technique has been implemented in a local version of MCNP and effectively weights the adjoint source term for each tally in the combination. Optimizing weight window parameters for the linear tally combination allows the user to optimize weight windows for multiple regions at once. In this work, we present our results of solutions to an analytic three-tally-region test problem and a flux calculation on a 100,000 voxel oil-well logging tool problem.

  11. Direct Linearization and Adjoint Approaches to Evaluation of Atmospheric Weighting Functions and Surface Partial Derivatives: General Principles, Synergy and Areas of Application

    NASA Technical Reports Server (NTRS)

    Ustino, Eugene A.

    2006-01-01

    This slide presentation reviews the observable radiances as functions of atmospheric parameters and of surface parameters; the mathematics of atmospheric weighting functions (WFs) and surface partial derivatives (PDs) are presented; and the equation of the forward radiative transfer (RT) problem is presented. For non-scattering atmospheres this can be done analytically, and all WFs and PDs can be computed analytically using the direct linearization approach. For scattering atmospheres, in general case, the solution of the forward RT problem can be obtained only numerically, but we need only two numerical solutions: one of the forward RT problem and one of the adjoint RT problem to compute all WFs and PDs we can think of. In this presentation we discuss applications of both the linearization and adjoint approaches

  12. A local anisotropic adaptive algorithm for the solution of low-Mach transient combustion problems

    NASA Astrophysics Data System (ADS)

    Carpio, Jaime; Prieto, Juan Luis; Vera, Marcos

    2016-02-01

    A novel numerical algorithm for the simulation of transient combustion problems at low Mach and moderately high Reynolds numbers is presented. These problems are often characterized by the existence of a large disparity of length and time scales, resulting in the development of directional flow features, such as slender jets, boundary layers, mixing layers, or flame fronts. This makes local anisotropic adaptive techniques quite advantageous computationally. In this work we propose a local anisotropic refinement algorithm using, for the spatial discretization, unstructured triangular elements in a finite element framework. For the time integration, the problem is formulated in the context of semi-Lagrangian schemes, introducing the semi-Lagrange-Galerkin (SLG) technique as a better alternative to the classical semi-Lagrangian (SL) interpolation. The good performance of the numerical algorithm is illustrated by solving a canonical laminar combustion problem: the flame/vortex interaction. First, a premixed methane-air flame/vortex interaction with simplified transport and chemistry description (Test I) is considered. Results are found to be in excellent agreement with those in the literature, proving the superior performance of the SLG scheme when compared with the classical SL technique, and the advantage of using anisotropic adaptation instead of uniform meshes or isotropic mesh refinement. As a more realistic example, we then conduct simulations of non-premixed hydrogen-air flame/vortex interactions (Test II) using a more complex combustion model which involves state-of-the-art transport and chemical kinetics. In addition to the analysis of the numerical features, this second example allows us to perform a satisfactory comparison with experimental visualizations taken from the literature.

  13. An improved independent component analysis model for 3D chromatogram separation and its solution by multi-areas genetic algorithm

    PubMed Central

    2014-01-01

    Background The 3D chromatogram generated by High Performance Liquid Chromatography-Diode Array Detector (HPLC-DAD) has been researched widely in the field of herbal medicine, grape wine, agriculture, petroleum and so on. Currently, most of the methods used for separating a 3D chromatogram need to know the compounds' number in advance, which could be impossible especially when the compounds are complex or white noise exist. New method which extracts compounds from 3D chromatogram directly is needed. Methods In this paper, a new separation model named parallel Independent Component Analysis constrained by Reference Curve (pICARC) was proposed to transform the separation problem to a multi-parameter optimization issue. It was not necessary to know the number of compounds in the optimization. In order to find all the solutions, an algorithm named multi-areas Genetic Algorithm (mGA) was proposed, where multiple areas of candidate solutions were constructed according to the fitness and distances among the chromosomes. Results Simulations and experiments on a real life HPLC-DAD data set were used to demonstrate our method and its effectiveness. Through simulations, it can be seen that our method can separate 3D chromatogram to chromatogram peaks and spectra successfully even when they severely overlapped. It is also shown by the experiments that our method is effective to solve real HPLC-DAD data set. Conclusions Our method can separate 3D chromatogram successfully without knowing the compounds' number in advance, which is fast and effective. PMID:25474487

  14. A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem

    DTIC Science & Technology

    1990-09-01

    KKT point of NP. Such points are feasible and satisfy the following conditions : VF(x*) = Vc(x*)TA*, A*ci(x*) = 0 i = 1,...,m for some nonnegative...the same as the one for which the multiplier was obtained. The following conditions on Ilk are sufficient to ensure that the algorithm has the desired...It is shown in [Pr89] that there exists a constant M such that if Pk > M, condition MC2 is sufficient . Theorem 4.1. Under assumptions Al-AT, and

  15. Solution to Electric Power Dispatch Problem Using Fuzzy Particle Swarm Optimization Algorithm

    NASA Astrophysics Data System (ADS)

    Chaturvedi, D. K.; Kumar, S.

    2015-03-01

    This paper presents the application of fuzzy particle swarm optimization to constrained economic load dispatch (ELD) problem of thermal units. Several factors such as quadratic cost functions with valve point loading, ramp rate limits and prohibited operating zone are considered in the computation models. The Fuzzy particle swarm optimization (FPSO) provides a new mechanism to avoid premature convergence problem. The performance of proposed algorithm is evaluated on four test systems. Results obtained by proposed method have been compared with those obtained by PSO method and literature results. The experimental results show that proposed FPSO method is capable of obtaining minimum fuel costs in fewer numbers of iterations.

  16. The development of three-dimensional adjoint method for flow control with blowing in convergent-divergent nozzle flows

    NASA Astrophysics Data System (ADS)

    Sikarwar, Nidhi

    multiple experiments or numerical simulations. Alternatively an inverse design method can be used. An adjoint optimization method can be used to achieve the optimum blowing rate. It is shown that the method works for both geometry optimization and active control of the flow in order to deflect the flow in desirable ways. An adjoint optimization method is described. It is used to determine the blowing distribution in the diverging section of a convergent-divergent nozzle that gives a desired pressure distribution in the nozzle. Both the direct and adjoint problems and their associated boundary conditions are developed. The adjoint method is used to determine the blowing distribution required to minimize the shock strength in the nozzle to achieve a known target pressure and to achieve close to an ideally expanded flow pressure. A multi-block structured solver is developed to calculate the flow solution and associated adjoint variables. Two and three-dimensional calculations are performed for internal and external of the nozzle domains. A two step MacCormack scheme based on predictor- corrector technique is was used for some calculations. The four and five stage Runge-Kutta schemes are also used to artificially march in time. A modified Runge-Kutta scheme is used to accelerate the convergence to a steady state. Second order artificial dissipation has been added to stabilize the calculations. The steepest decent method has been used for the optimization of the blowing velocity after the gradients of the cost function with respect to the blowing velocity are calculated using adjoint method. Several examples are given of the optimization of blowing using the adjoint method.

  17. Solution to automatic generation control problem using firefly algorithm optimized I(λ)D(µ) controller.

    PubMed

    Debbarma, Sanjoy; Saikia, Lalit Chandra; Sinha, Nidul

    2014-03-01

    Present work focused on automatic generation control (AGC) of a three unequal area thermal systems considering reheat turbines and appropriate generation rate constraints (GRC). A fractional order (FO) controller named as I(λ)D(µ) controller based on crone approximation is proposed for the first time as an appropriate technique to solve the multi-area AGC problem in power systems. A recently developed metaheuristic algorithm known as firefly algorithm (FA) is used for the simultaneous optimization of the gains and other parameters such as order of integrator (λ) and differentiator (μ) of I(λ)D(µ) controller and governor speed regulation parameters (R). The dynamic responses corresponding to optimized I(λ)D(µ) controller gains, λ, μ, and R are compared with that of classical integer order (IO) controllers such as I, PI and PID controllers. Simulation results show that the proposed I(λ)D(µ) controller provides more improved dynamic responses and outperforms the IO based classical controllers. Further, sensitivity analysis confirms the robustness of the so optimized I(λ)D(µ) controller to wide changes in system loading conditions and size and position of SLP. Proposed controller is also found to have performed well as compared to IO based controllers when SLP takes place simultaneously in any two areas or all the areas. Robustness of the proposed I(λ)D(µ) controller is also tested against system parameter variations.

  18. Examining Tropical Cyclone - Kelvin Wave Interactions using Adjoint Diagnostics

    NASA Astrophysics Data System (ADS)

    Reynolds, C. A.; Doyle, J. D.; Hong, X.

    2015-12-01

    Adjoint-based tools can provide valuable insight into the mechanisms that influence the evolution and predictability of atmospheric phenomena, as they allow for the efficient and rigorous computation of forecast sensitivity to changes in the initial state. We apply adjoint-based tools from the non-hydrostatic Coupled Atmosphere/Ocean Mesoscale Prediction System (COAMPS) to explore the initial-state sensitivity and interactions between a tropical cyclone and atmospheric equatorial waves associated with the Madden Julian Oscillation (MJO) in the Indian Ocean during the DYNAMO field campaign. The development of Tropical Cyclone 5 (TC05) coincided with the passage of an equatorial Kelvin wave and westerly wind burst associated with an MJO that developed in the Indian Ocean in late November 2011, but it was unclear if and how one affected the other. COAMPS 24-h and 36-h adjoint sensitivities are analyzed for both TC05 and the equatorial waves to understand how the evolution of each system is sensitive to the other. The sensitivity of equatorial westerlies in the western Indian Ocean on 23 November shares characteristics with the classic Gill (1980) Rossby and Kelvin wave response to symmetric heating about the equator, including symmetric cyclonic circulations to the north and south of the westerlies, and enhanced heating in the area of convergence between the equatorial westerlies and easterlies. In addition, there is sensitivity in the Bay of Bengal associated with the cyclonic circulation that eventually develops into TC05. At the same time, the developing TC05 system shows strongest sensitivity to local wind and heating perturbations, but sensitivity to the equatorial westerlies is also clear. On 24 November, when the Kelvin wave is immediately south of the developing tropical cyclone, both phenomena are sensitive to each other. On 25 November TC05 no longer shows sensitivity to the Kelvin wave, while the Kelvin Wave still exhibits some weak sensitivity to TC05. In

  19. Advances in Global Adjoint Tomography -- Massive Data Assimilation

    NASA Astrophysics Data System (ADS)

    Ruan, Y.; Lei, W.; Bozdag, E.; Lefebvre, M. P.; Smith, J. A.; Krischer, L.; Tromp, J.

    2015-12-01

    Azimuthal anisotropy and anelasticity are key to understanding a myriad of processes in Earth's interior. Resolving these properties requires accurate simulations of seismic wave propagation in complex 3-D Earth models and an iterative inversion strategy. In the wake of successes in regional studies(e.g., Chen et al., 2007; Tape et al., 2009, 2010; Fichtner et al., 2009, 2010; Chen et al.,2010; Zhu et al., 2012, 2013; Chen et al., 2015), we are employing adjoint tomography based on a spectral-element method (Komatitsch & Tromp 1999, 2002) on a global scale using the supercomputer ''Titan'' at Oak Ridge National Laboratory. After 15 iterations, we have obtained a high-resolution transversely isotropic Earth model (M15) using traveltime data from 253 earthquakes. To obtain higher resolution images of the emerging new features and to prepare the inversion for azimuthal anisotropy and anelasticity, we expanded the original dataset with approximately 4,220 additional global earthquakes (Mw5.5-7.0) --occurring between 1995 and 2014-- and downloaded 300-minute-long time series for all available data archived at the IRIS Data Management Center, ORFEUS, and F-net. Ocean Bottom Seismograph data from the last decade are also included to maximize data coverage. In order to handle the huge dataset and solve the I/O bottleneck in global adjoint tomography, we implemented a python-based parallel data processing workflow based on the newly developed Adaptable Seismic Data Format (ASDF). With the help of the data selection tool MUSTANG developed by IRIS, we cleaned our dataset and assembled event-based ASDF files for parallel processing. We have started Centroid Moment Tensors (CMT) inversions for all 4,220 earthquakes with the latest model M15, and selected high-quality data for measurement. We will statistically investigate each channel using synthetic seismograms calculated in M15 for updated CMTs and identify problematic channels. In addition to data screening, we also modified

  20. A self-adjoint decomposition of the radial momentum operator

    NASA Astrophysics Data System (ADS)

    Liu, Q. H.; Xiao, S. F.

    2015-12-01

    With acceptance of the Dirac's observation that the canonical quantization entails using Cartesian coordinates, we examine the operator erPr rather than Pr itself and demonstrate that there is a decomposition of erPr into a difference of two self-adjoint but noncommutative operators, in which one is the total momentum and another is the transverse one. This study renders the operator Pr indirectly measurable and physically meaningful, offering an explanation of why the mean value of Pr over a quantum mechanical state makes sense and supporting Dirac's claim that Pr "is real and is the true momentum conjugate to r".

  1. Parameter estimates of a zero-dimensional ecosystem model applying the adjoint method

    NASA Astrophysics Data System (ADS)

    Schartau, Markus; Oschlies, Andreas; Willebrand, Jürgen

    Assimilation experiments with data from the Bermuda Atlantic Time-series Study (BATS, 1989-1993) were performed with a simple mixed-layer ecosystem model of dissolved inorganic nitrogen ( N), phytoplankton ( P) and herbivorous zooplankton ( H). Our aim is to optimize the biological model parameters, such that the misfits between model results and observations are minimized. The utilized assimilation method is the variational adjoint technique, starting from a wide range of first-parameter guesses. A twin experiment displayed two kinds of solutions, when Gaussian noise was added to the model-generated data. The expected solution refers to the global minimum of the misfit model-data function, whereas the other solution is biologically implausible and is associated with a local minimum. Experiments with real data showed either bottom-up or top-down controlled ecosystem dynamics, depending on the deep nutrient availability. To confine the solutions, an additional constraint on zooplankton biomass was added to the optimization procedure. This inclusion did not produce optimal model results that were consistent with observations. The modelled zooplankton biomass still exceeded the observations. From the model-data discrepancies systematic model errors could be determined, in particular when the chlorophyll concentration started to decline before primary production reached its maximum. A direct comparision of measured 14C-production data with modelled phytoplankton production rates is inadequate at BATS, at least when a constant carbon to nitrogen C : N ratio is assumed for data assimilation.

  2. Adjoint methods for adjusting three-dimensional atmosphere and surface properties to fit multi-angle/multi-pixel polarimetric measurements

    NASA Astrophysics Data System (ADS)

    Martin, William; Cairns, Brian; Bal, Guillaume

    2014-09-01

    This paper derives an efficient procedure for using the three-dimensional (3D) vector radiative transfer equation (VRTE) to adjust atmosphere and surface properties and improve their fit with multi-angle/multi-pixel radiometric and polarimetric measurements of scattered sunlight. The proposed adjoint method uses the 3D VRTE to compute the measurement misfit function and the adjoint 3D VRTE to compute its gradient with respect to all unknown parameters. In the remote sensing problems of interest, the scalar-valued misfit function quantifies agreement with data as a function of atmosphere and surface properties, and its gradient guides the search through this parameter space. Remote sensing of the atmosphere and surface in a three-dimensional region may require thousands of unknown parameters and millions of data points. Many approaches would require calls to the 3D VRTE solver in proportion to the number of unknown parameters or measurements. To avoid this issue of scale, we focus on computing the gradient of the misfit function as an alternative to the Jacobian of the measurement operator. The resulting adjoint method provides a way to adjust 3D atmosphere and surface properties with only two calls to the 3D VRTE solver for each spectral channel, regardless of the number of retrieval parameters, measurement view angles or pixels. This gives a procedure for adjusting atmosphere and surface parameters that will scale to the large problems of 3D remote sensing. For certain types of multi-angle/multi-pixel polarimetric measurements, this encourages the development of a new class of three-dimensional retrieval algorithms with more flexible parametrizations of spatial heterogeneity, less reliance on data screening procedures, and improved coverage in terms of the resolved physical processes in the Earth's atmosphere.

  3. Low-resolution structures of proteins in solution retrieved from X-ray scattering with a genetic algorithm.

    PubMed Central

    Chacón, P; Morán, F; Díaz, J F; Pantos, E; Andreu, J M

    1998-01-01

    Small-angle x-ray solution scattering (SAXS) is analyzed with a new method to retrieve convergent model structures that fit the scattering profiles. An arbitrary hexagonal packing of several hundred beads containing the problem object is defined. Instead of attempting to compute the Debye formula for all of the possible mass distributions, a genetic algorithm is employed that efficiently searches the configurational space and evolves best-fit bead models. Models from different runs of the algorithm have similar or identical structures. The modeling resolution is increased by reducing the bead radius together with the search space in successive cycles of refinement. The method has been tested with protein SAXS (0.001 < S < 0.06 A(-1)) calculated from x-ray crystal structures, adding noise to the profiles. The models obtained closely approach the volumes and radii of gyration of the known structures, and faithfully reproduce the dimensions and shape of each of them. This includes finding the active site cavity of lysozyme, the bilobed structure of gamma-crystallin, two domains connected by a stalk in betab2-crystallin, and the horseshoe shape of pancreatic ribonuclease inhibitor. The low-resolution solution structure of lysozyme has been directly modeled from its experimental SAXS profile (0.003 < S < 0.03 A(-1)). The model describes lysozyme size and shape to the resolution of the measurement. The method may be applied to other proteins, to the analysis of domain movements, to the comparison of solution and crystal structures, as well as to large macromolecular assemblies. PMID:9635731

  4. Tangent Adjoint Methods In a Higher-Order Space-Time Discontinuous-Galerkin Solver For Turbulent Flows

    NASA Technical Reports Server (NTRS)

    Diosady, Laslo; Murman, Scott; Blonigan, Patrick; Garai, Anirban

    2017-01-01

    Presented space-time adjoint solver for turbulent compressible flows. Confirmed failure of traditional sensitivity methods for chaotic flows. Assessed rate of exponential growth of adjoint for practical 3D turbulent simulation. Demonstrated failure of short-window sensitivity approximations.

  5. Conical intersections in solution: formulation, algorithm, and implementation with combined quantum mechanics/molecular mechanics method.

    PubMed

    Cui, Ganglong; Yang, Weitao

    2011-05-28

    The significance of conical intersections in photophysics, photochemistry, and photodissociation of polyatomic molecules in gas phase has been demonstrated by numerous experimental and theoretical studies. Optimization of conical intersections of small- and medium-size molecules in gas phase has currently become a routine optimization process, as it has been implemented in many electronic structure packages. However, optimization of conical intersections of small- and medium-size molecules in solution or macromolecules remains inefficient, even poorly defined, due to large number of degrees of freedom and costly evaluations of gradient difference and nonadiabatic coupling vectors. In this work, based on the sequential quantum mechanics and molecular mechanics (QM/MM) and QM/MM-minimum free energy path methods, we have designed two conical intersection optimization methods for small- and medium-size molecules in solution or macromolecules. The first one is sequential QM conical intersection optimization and MM minimization for potential energy surfaces; the second one is sequential QM conical intersection optimization and MM sampling for potential of mean force surfaces, i.e., free energy surfaces. In such methods, the region where electronic structures change remarkably is placed into the QM subsystem, while the rest of the system is placed into the MM subsystem; thus, dimensionalities of gradient difference and nonadiabatic coupling vectors are decreased due to the relatively small QM subsystem. Furthermore, in comparison with the concurrent optimization scheme, sequential QM conical intersection optimization and MM minimization or sampling reduce the number of evaluations of gradient difference and nonadiabatic coupling vectors because these vectors need to be calculated only when the QM subsystem moves, independent of the MM minimization or sampling. Taken together, costly evaluations of gradient difference and nonadiabatic coupling vectors in solution or

  6. Development of Web-Based Menu Planning Support System and its Solution Using Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Kashima, Tomoko; Matsumoto, Shimpei; Ishii, Hiroaki

    2009-10-01

    Recently lifestyle-related diseases have become an object of public concern, while at the same time people are being more health conscious. As an essential factor for causing the lifestyle-related diseases, we assume that the knowledge circulation on dietary habits is still insufficient. This paper focuses on everyday meals close to our life and proposes a well-balanced menu planning system as a preventive measure of lifestyle-related diseases. The system is developed by using a Web-based frontend and it provides multi-user services and menu information sharing capabilities like social networking services (SNS). The system is implemented on a Web server running Apache (HTTP server software), MySQL (database management system), and PHP (scripting language for dynamic Web pages). For the menu planning, a genetic algorithm is applied by understanding this problem as multidimensional 0-1 integer programming.

  7. Calculation of projected ranges — analytical solutions and a simple general algorithm

    NASA Astrophysics Data System (ADS)

    Biersack, J. P.

    1981-05-01

    The concept of multiple scattering is reconsidered for obtaining the directional spreading of ion motion as a function of energy loss. From this the mean projection of each pathlength element of the ion trajectory is derived which — upon summation or integration — leads to the desired mean projected range. In special cases, the calculation can be carried out analytically, otherwise a simple general algorithm is derived which is suitable even for the smallest programmable calculators. Necessary input for the present treatment consists only of generally accessable stopping power and straggling formulas. The procedure does not rely on scattering cross sections, e.g. power potential or f(t {1}/{2}) approximations. The present approach lends itself easily to include electronic straggling or to treat composite target materials, or even to account for the so-called "time integral".

  8. Study on adjoint-based optimization method for multi-stage turbomachinery

    NASA Astrophysics Data System (ADS)

    Li, Weiwei; Tian, Yong; Yi, Weilin; Ji, Lucheng; Shao, Weiwei; Xiao, Yunhan

    2011-10-01

    Adjoint-based optimization method is a hotspot in turbomachinery. First, this paper presents principles of adjoint method from Lagrange multiplier viewpoint. Second, combining a continuous route with thin layer RANS equations, we formulate adjoint equations and anti-physical boundary conditions. Due to the multi-stage environment in turbomachinery, an adjoint interrow mixing method is introduced. Numerical techniques of solving flow equations and adjoint equations are almost the same, and once they are converged respectively, the gradients of an objective function to design variables can be calculated using complex method efficiently. Third, integrating a shape perturbation parameterization and a simple steepest descent method, a frame of adjoint-based aerodynamic shape optimization for multi-stage turbomachinery is constructed. At last, an inverse design of an annular cascade is employed to validate the above approach, and adjoint field of an Aachen 1.5 stage turbine demonstrates the conservation and areflexia of the adjoint interrow mixing method. Then a direct redesign of a 1+1 counter-rotating turbine aiming to increase efficiency and apply constraints to mass flow rate and pressure ratio is taken.

  9. Comparison of the Adjoint and Adjoint-Free 4dVar Assimilation of the Hydrographic and Velocity Observations in the Adriatic Sea

    DTIC Science & Technology

    2015-11-10

    Accepted 12 October 2015 Available online 10 November 2015 Keywords: Data assimilation Ajoint analysis Regional modeling a b s t r a c t Performance of...the adjoint and adjoint-free 4-dimensional variational (4dVar) data assimilation techniques is compared in application to the hydrographic surveys...and velocity observations collected in the Adriatic Sea in 2006. Assimilating the data into the Navy Coastal Ocean Model (NCOM) has shown that both

  10. A deflation based parallel algorithm for spectral element solution of the incompressible Navier-Stokes equations

    SciTech Connect

    Fischer, P.F.

    1996-12-31

    Efficient solution of the Navier-Stokes equations in complex domains is dependent upon the availability of fast solvers for sparse linear systems. For unsteady incompressible flows, the pressure operator is the leading contributor to stiffness, as the characteristic propagation speed is infinite. In the context of operator splitting formulations, it is the pressure solve which is the most computationally challenging, despite its elliptic origins. We seek to improve existing spectral element iterative methods for the pressure solve in order to overcome the slow convergence frequently observed in the presence of highly refined grids or high-aspect ratio elements.

  11. Adjoint design sensitivity analysis of reduced atomic systems using generalized Langevin equation for lattice structures

    SciTech Connect

    Kim, Min-Geun; Jang, Hong-Lae; Cho, Seonho

    2013-05-01

    An efficient adjoint design sensitivity analysis method is developed for reduced atomic systems. A reduced atomic system and the adjoint system are constructed in a locally confined region, utilizing generalized Langevin equation (GLE) for periodic lattice structures. Due to the translational symmetry of lattice structures, the size of time history kernel function that accounts for the boundary effects of the reduced atomic systems could be reduced to a single atom’s degrees of freedom. For the problems of highly nonlinear design variables, the finite difference method is impractical for its inefficiency and inaccuracy. However, the adjoint method is very efficient regardless of the number of design variables since one additional time integration is required for the adjoint GLE. Through numerical examples, the derived adjoint sensitivity turns out to be accurate and efficient through the comparison with finite difference sensitivity.

  12. Spectral functions of non-essentially self-adjoint operators

    NASA Astrophysics Data System (ADS)

    Falomir, H. A.; Pisani, P. A. G.

    2012-09-01

    One of the many problems to which Dowker devoted his attention is the effect of a conical singularity in the base manifold on the behavior of the quantum fields. In particular, he studied the small-t asymptotic expansion of the heat-kernel trace on a cone and its effects on physical quantities as the Casimir energy. In this paper, we review some peculiar results found in the last decade, regarding the appearance of non-standard powers of t, and even negative integer powers of log t, in this asymptotic expansion for the self-adjoint extensions of some symmetric operators with singular coefficients. Similarly, we show that the ζ-function associated with these self-adjoint extensions presents an unusual analytic structure. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical in honour of Stuart Dowker’s 75th birthday devoted to ‘Applications of zeta functions and other spectral functions in mathematics and physics’.

  13. Application of Parallel Adjoint-Based Error Estimation and Anisotropic Grid Adaptation for Three-Dimensional Aerospace Configurations

    NASA Technical Reports Server (NTRS)

    Lee-Rausch, E. M.; Park, M. A.; Jones, W. T.; Hammond, D. P.; Nielsen, E. J.

    2005-01-01

    This paper demonstrates the extension of error estimation and adaptation methods to parallel computations enabling larger, more realistic aerospace applications and the quantification of discretization errors for complex 3-D solutions. Results were shown for an inviscid sonic-boom prediction about a double-cone configuration and a wing/body segmented leading edge (SLE) configuration where the output function of the adjoint was pressure integrated over a part of the cylinder in the near field. After multiple cycles of error estimation and surface/field adaptation, a significant improvement in the inviscid solution for the sonic boom signature of the double cone was observed. Although the double-cone adaptation was initiated from a very coarse mesh, the near-field pressure signature from the final adapted mesh compared very well with the wind-tunnel data which illustrates that the adjoint-based error estimation and adaptation process requires no a priori refinement of the mesh. Similarly, the near-field pressure signature for the SLE wing/body sonic boom configuration showed a significant improvement from the initial coarse mesh to the final adapted mesh in comparison with the wind tunnel results. Error estimation and field adaptation results were also presented for the viscous transonic drag prediction of the DLR-F6 wing/body configuration, and results were compared to a series of globally refined meshes. Two of these globally refined meshes were used as a starting point for the error estimation and field-adaptation process where the output function for the adjoint was the total drag. The field-adapted results showed an improvement in the prediction of the drag in comparison with the finest globally refined mesh and a reduction in the estimate of the remaining drag error. The adjoint-based adaptation parameter showed a need for increased resolution in the surface of the wing/body as well as a need for wake resolution downstream of the fuselage and wing trailing edge

  14. Application of the adjoint approach to optimise the initial conditions of a turbidity current with the AdjointTurbidity 1.0 model

    NASA Astrophysics Data System (ADS)

    Parkinson, Samuel D.; Funke, Simon W.; Hill, Jon; Piggott, Matthew D.; Allison, Peter A.

    2017-03-01

    Turbidity currents are one of the main drivers of sediment transport from the continental shelf to the deep ocean. The resulting sediment deposits can reach hundreds of kilometres into the ocean. Computer models that simulate turbidity currents and the resulting sediment deposit can help us to understand their general behaviour. However, in order to recreate real-world scenarios, the challenge is to find the turbidity current parameters that reproduce the observations of sediment deposits. This paper demonstrates a solution to the inverse sediment transportation problem: for a known sedimentary deposit, the developed model reconstructs details about the turbidity current that produced the deposit. The reconstruction is constrained here by a shallow water sediment-laden density current model, which is discretised by the finite-element method and an adaptive time-stepping scheme. The model is differentiated using the adjoint approach, and an efficient gradient-based optimisation method is applied to identify the turbidity parameters which minimise the misfit between the modelled and the observed field sediment deposits. The capabilities of this approach are demonstrated using measurements taken in the Miocene Marnoso-arenacea Formation (Italy). We find that whilst the model cannot match the deposit exactly due to limitations in the physical processes simulated, it provides valuable insights into the depositional processes and represents a significant advance in our toolset for interpreting turbidity current deposits.

  15. Studies of parallel algorithms for the solution of a Fokker-Planck equation

    SciTech Connect

    Deck, D.; Samba, G.

    1995-11-01

    The study of laser-created plasmas often requires the use of a kinetic model rather than a hydrodynamic one. This model change occurs, for example, in the hot spot formation in an ICF experiment or during the relaxation of colliding plasmas. When the gradients scalelengths or the size of a given system are not small compared to the characteristic mean-free-path, we have to deal with non-equilibrium situations, which can be described by the distribution functions of every species in the system. We present here a numerical method in plane or spherical 1-D geometry, for the solution of a Fokker-Planck equation that describes the evolution of stich functions in the phase space. The size and the time scale of kinetic simulations require the use of Massively Parallel Computers (MPP). We have adopted a message-passing strategy using Parallel Virtual Machine (PVM).

  16. Integrated algorithms for RFID-based multi-sensor indoor/outdoor positioning solutions

    NASA Astrophysics Data System (ADS)

    Zhu, Mi.; Retscher, G.; Zhang, K.

    2011-12-01

    Position information is very important as people need it almost everywhere all the time. However, it is a challenging task to provide precise positions indoor/outdoor seamlessly. Outdoor positioning has been widely studied and accurate positions can usually be achieved by well developed GPS techniques but these techniques are difficult to be used indoors since GPS signal reception is limited. The alternative techniques that can be used for indoor positioning include, to name a few, Wireless Local Area Network (WLAN), bluetooth and Ultra Wideband (UWB) etc.. However, all of these have limitations. The main objectives of this paper are to investigate and develop algorithms for a low-cost and portable indoor personal positioning system using Radio Frequency Identification (RFID) and its integration with other positioning systems. An RFID system consists of three components, namely a control unit, an interrogator and a transponder that transmits data and communicates with the reader. An RFID tag can be incorporated into a product, animal or person for the purpose of identification and tracking using radio waves. In general, for RFID positioning in urban and indoor environments three different methods can be used, including cellular positioning, trilateration and location fingerprinting. In addition, the integration of RFID with other technologies is also discussed in this paper. A typical combination is to integrate RFID with relative positioning technologies such as MEMS INS to bridge the gaps between RFID tags for continuous positioning applications. Experiments are shown to demonstrate the improvements of integrating multiple sensors with RFID which can be employed successfully for personal positioning.

  17. Adjoint-state inversion of electric resistivity tomography data of seawater intrusion at the Argentona coastal aquifer (Spain)

    NASA Astrophysics Data System (ADS)

    Fernández-López, Sheila; Carrera, Jesús; Ledo, Juanjo; Queralt, Pilar; Luquot, Linda; Martínez, Laura; Bellmunt, Fabián

    2016-04-01

    Seawater intrusion in aquifers is a complex phenomenon that can be characterized with the help of electric resistivity tomography (ERT) because of the low resistivity of seawater, which underlies the freshwater floating on top. The problem is complex because of the need for joint inversion of electrical and hydraulic (density dependent flow) data. Here we present an adjoint-state algorithm to treat electrical data. This method is a common technique to obtain derivatives of an objective function, depending on potentials with respect to model parameters. The main advantages of it are its simplicity in stationary problems and the reduction of computational cost respect others methodologies. The relationship between the concentration of chlorides and the resistivity values of the field is well known. Also, these resistivities are related to the values of potentials measured using ERT. Taking this into account, it will be possible to define the different resistivities zones from the field data of potential distribution using the basis of inverse problem. In this case, the studied zone is situated in Argentona (Baix Maresme, Catalonia), where the values of chlorides obtained in some wells of the zone are too high. The adjoint-state method will be used to invert the measured data using a new finite element code in C ++ language developed in an open-source framework called Kratos. Finally, the information obtained numerically with our code will be checked with the information obtained with other codes.

  18. Joint inversion of seismic velocities and source location without rays using the truncated Newton and the adjoint-state method

    NASA Astrophysics Data System (ADS)

    Virieux, J.; Bretaudeau, F.; Metivier, L.; Brossier, R.

    2013-12-01

    Simultaneous inversion of seismic velocities and source parameters have been a long standing challenge in seismology since the first attempts to mitigate trade-off between very different parameters influencing travel-times (Spencer and Gubbins 1980, Pavlis and Booker 1980) since the early development in the 1970s (Aki et al 1976, Aki and Lee 1976, Crosson 1976). There is a strong trade-off between earthquake source positions, initial times and velocities during the tomographic inversion: mitigating these trade-offs is usually carried empirically (Lemeur et al 1997). This procedure is not optimal and may lead to errors in the velocity reconstruction as well as in the source localization. For a better simultaneous estimation of such multi-parametric reconstruction problem, one may take benefit of improved local optimization such as full Newton method where the Hessian influence helps balancing between different physical parameter quantities and improving the coverage at the point of reconstruction. Unfortunately, the computation of the full Hessian operator is not easily computed in large models and with large datasets. Truncated Newton (TCN) is an alternative optimization approach (Métivier et al. 2012) that allows resolution of the normal equation H Δm = - g using a matrix-free conjugate gradient algorithm. It only requires to be able to compute the gradient of the misfit function and Hessian-vector products. Traveltime maps can be computed in the whole domain by numerical modeling (Vidale 1998, Zhao 2004). The gradient and the Hessian-vector products for velocities can be computed without ray-tracing using 1st and 2nd order adjoint-state methods for the cost of 1 and 2 additional modeling step (Plessix 2006, Métivier et al. 2012). Reciprocity allows to compute accurately the gradient and the full Hessian for each coordinates of the sources and for their initial times. Then the resolution of the problem is done through two nested loops. The model update Δm is

  19. On the local optimal solutions of metabolic regulatory networks using information guided genetic algorithm approach and clustering analysis.

    PubMed

    Zheng, Ying; Yeh, Chen-Wei; Yang, Chi-Da; Jang, Shi-Shang; Chu, I-Ming

    2007-08-31

    Biological information generated by high-throughput technology has made systems approach feasible for many biological problems. By this approach, optimization of metabolic pathway has been successfully applied in the amino acid production. However, in this technique, gene modifications of metabolic control architecture as well as enzyme expression levels are coupled and result in a mixed integer nonlinear programming problem. Furthermore, the stoichiometric complexity of metabolic pathway, along with strong nonlinear behaviour of the regulatory kinetic models, directs a highly rugged contour in the whole optimization problem. There may exist local optimal solutions wherein the same level of production through different flux distributions compared with global optimum. The purpose of this work is to develop a novel stochastic optimization approach-information guided genetic algorithm (IGA) to discover the local optima with different levels of modification of the regulatory loop and production rates. The novelties of this work include the information theory, local search, and clustering analysis to discover the local optima which have physical meaning among the qualified solutions.

  20. Reciprocal Grids: A Hierarchical Algorithm for Computing Solution X-ray Scattering Curves from Supramolecular Complexes at High Resolution.

    PubMed

    Ginsburg, Avi; Ben-Nun, Tal; Asor, Roi; Shemesh, Asaf; Ringel, Israel; Raviv, Uri

    2016-08-22

    In many biochemical processes large biomolecular assemblies play important roles. X-ray scattering is a label-free bulk method that can probe the structure of large self-assembled complexes in solution. As we demonstrate in this paper, solution X-ray scattering can measure complex supramolecular assemblies at high sensitivity and resolution. At high resolution, however, data analysis of larger complexes is computationally demanding. We present an efficient method to compute the scattering curves from complex structures over a wide range of scattering angles. In our computational method, structures are defined as hierarchical trees in which repeating subunits are docked into their assembly symmetries, describing the manner subunits repeat in the structure (in other words, the locations and orientations of the repeating subunits). The amplitude of the assembly is calculated by computing the amplitudes of the basic subunits on 3D reciprocal-space grids, moving up in the hierarchy, calculating the grids of larger structures, and repeating this process for all the leaves and nodes of the tree. For very large structures, we developed a hybrid method that sums grids of smaller subunits in order to avoid numerical artifacts. We developed protocols for obtaining high-resolution solution X-ray scattering data from taxol-free microtubules at a wide range of scattering angles. We then validated our method by adequately modeling these high-resolution data. The higher speed and accuracy of our method, over existing methods, is demonstrated for smaller structures: short microtubule and tobacco mosaic virus. Our algorithm may be integrated into various structure prediction computational tools, simulations, and theoretical models, and provide means for testing their predicted structural model, by calculating the expected X-ray scattering curve and comparing with experimental data.

  1. I-BIEM, an iterative boundary integral equation method for computer solutions of current distribution problems with complex boundaries: A new algorithm. I - Theoretical

    NASA Technical Reports Server (NTRS)

    Cahan, B. D.; Scherson, Daniel; Reid, Margaret A.

    1988-01-01

    A new algorithm for an iterative computation of solutions of Laplace's or Poisson's equations in two dimensions, using Green's second identity, is presented. This algorithm converges strongly and geometrically and can be applied to curved, irregular, or moving boundaries with nonlinear and/or discontinuous boundary conditions. It has been implemented in Pascal on a number of micro- and minicomputers and applied to several geometries. Cases with known analytic solutions have been tested. Convergence to within 0.1 percent to 0.01 percent of the theoretical values are obtained in a few minutes on a microcomputer.

  2. Self-adjoint integral operator for bounded nonlocal transport

    NASA Astrophysics Data System (ADS)

    Maggs, J. E.; Morales, G. J.

    2016-11-01

    An integral operator is developed to describe nonlocal transport in a one-dimensional system bounded on both ends by material walls. The "jump" distributions associated with nonlocal transport are taken to be Lévy α -stable distributions, which become naturally truncated by the bounding walls. The truncation process results in the operator containing a self-consistent, convective inward transport term (pinch). The properties of the integral operator as functions of the Lévy distribution parameter set [α ,γ ] and the wall conductivity are presented. The integral operator continuously recovers the features of local transport when α =2 . The self-adjoint formulation allows for an accurate description of spatial variation in the Lévy parameters in the nonlocal system. Spatial variation in the Lévy parameters is shown to result in internally generated flows. Examples of cold-pulse propagation in nonlocal systems illustrate the capabilities of the methodology.

  3. Self-adjoint integral operator for bounded nonlocal transport.

    PubMed

    Maggs, J E; Morales, G J

    2016-11-01

    An integral operator is developed to describe nonlocal transport in a one-dimensional system bounded on both ends by material walls. The "jump" distributions associated with nonlocal transport are taken to be Lévy α-stable distributions, which become naturally truncated by the bounding walls. The truncation process results in the operator containing a self-consistent, convective inward transport term (pinch). The properties of the integral operator as functions of the Lévy distribution parameter set [α,γ] and the wall conductivity are presented. The integral operator continuously recovers the features of local transport when α=2. The self-adjoint formulation allows for an accurate description of spatial variation in the Lévy parameters in the nonlocal system. Spatial variation in the Lévy parameters is shown to result in internally generated flows. Examples of cold-pulse propagation in nonlocal systems illustrate the capabilities of the methodology.

  4. Stabilized FE simulation of prototype thermal-hydraulics problems with integrated adjoint-based capabilities

    NASA Astrophysics Data System (ADS)

    Shadid, J. N.; Smith, T. M.; Cyr, E. C.; Wildey, T. M.; Pawlowski, R. P.

    2016-09-01

    A critical aspect of applying modern computational solution methods to complex multiphysics systems of relevance to nuclear reactor modeling, is the assessment of the predictive capability of specific proposed mathematical models. In this respect the understanding of numerical error, the sensitivity of the solution to parameters associated with input data, boundary condition uncertainty, and mathematical models is critical. Additionally, the ability to evaluate and or approximate the model efficiently, to allow development of a reasonable level of statistical diagnostics of the mathematical model and the physical system, is of central importance. In this study we report on initial efforts to apply integrated adjoint-based computational analysis and automatic differentiation tools to begin to address these issues. The study is carried out in the context of a Reynolds averaged Navier-Stokes approximation to turbulent fluid flow and heat transfer using a particular spatial discretization based on implicit fully-coupled stabilized FE methods. Initial results are presented that show the promise of these computational techniques in the context of nuclear reactor relevant prototype thermal-hydraulics problems.

  5. Stabilized FE simulation of prototype thermal-hydraulics problems with integrated adjoint-based capabilities

    SciTech Connect

    Shadid, J.N.; Smith, T.M.; Cyr, E.C.; Wildey, T.M.; Pawlowski, R.P.

    2016-09-15

    A critical aspect of applying modern computational solution methods to complex multiphysics systems of relevance to nuclear reactor modeling, is the assessment of the predictive capability of specific proposed mathematical models. In this respect the understanding of numerical error, the sensitivity of the solution to parameters associated with input data, boundary condition uncertainty, and mathematical models is critical. Additionally, the ability to evaluate and or approximate the model efficiently, to allow development of a reasonable level of statistical diagnostics of the mathematical model and the physical system, is of central importance. In this study we report on initial efforts to apply integrated adjoint-based computational analysis and automatic differentiation tools to begin to address these issues. The study is carried out in the context of a Reynolds averaged Navier–Stokes approximation to turbulent fluid flow and heat transfer using a particular spatial discretization based on implicit fully-coupled stabilized FE methods. Initial results are presented that show the promise of these computational techniques in the context of nuclear reactor relevant prototype thermal-hydraulics problems.

  6. Stabilized FE simulation of prototype thermal-hydraulics problems with integrated adjoint-based capabilities

    SciTech Connect

    Shadid, J. N.; Smith, T. M.; Cyr, E. C.; Wildey, T. M.; Pawlowski, R. P.

    2016-05-20

    A critical aspect of applying modern computational solution methods to complex multiphysics systems of relevance to nuclear reactor modeling, is the assessment of the predictive capability of specific proposed mathematical models. The understanding of numerical error, the sensitivity of the solution to parameters associated with input data, boundary condition uncertainty, and mathematical models is critical. Additionally, the ability to evaluate and or approximate the model efficiently, to allow development of a reasonable level of statistical diagnostics of the mathematical model and the physical system, is of central importance. In our study we report on initial efforts to apply integrated adjoint-based computational analysis and automatic differentiation tools to begin to address these issues. The study is carried out in the context of a Reynolds averaged Navier–Stokes approximation to turbulent fluid flow and heat transfer using a particular spatial discretization based on implicit fully-coupled stabilized FE methods. We present the initial results that show the promise of these computational techniques in the context of nuclear reactor relevant prototype thermal-hydraulics problems.

  7. Stabilized FE simulation of prototype thermal-hydraulics problems with integrated adjoint-based capabilities

    DOE PAGES

    Shadid, J. N.; Smith, T. M.; Cyr, E. C.; ...

    2016-05-20

    A critical aspect of applying modern computational solution methods to complex multiphysics systems of relevance to nuclear reactor modeling, is the assessment of the predictive capability of specific proposed mathematical models. The understanding of numerical error, the sensitivity of the solution to parameters associated with input data, boundary condition uncertainty, and mathematical models is critical. Additionally, the ability to evaluate and or approximate the model efficiently, to allow development of a reasonable level of statistical diagnostics of the mathematical model and the physical system, is of central importance. In our study we report on initial efforts to apply integrated adjoint-basedmore » computational analysis and automatic differentiation tools to begin to address these issues. The study is carried out in the context of a Reynolds averaged Navier–Stokes approximation to turbulent fluid flow and heat transfer using a particular spatial discretization based on implicit fully-coupled stabilized FE methods. We present the initial results that show the promise of these computational techniques in the context of nuclear reactor relevant prototype thermal-hydraulics problems.« less

  8. Optimizing spectral wave estimates with adjoint-based sensitivity maps

    NASA Astrophysics Data System (ADS)

    Orzech, Mark; Veeramony, Jay; Flampouris, Stylianos

    2014-04-01

    A discrete numerical adjoint has recently been developed for the stochastic wave model SWAN. In the present study, this adjoint code is used to construct spectral sensitivity maps for two nearshore domains. The maps display the correlations of spectral energy levels throughout the domain with the observed energy levels at a selected location or region of interest (LOI/ROI), providing a full spectrum of values at all locations in the domain. We investigate the effectiveness of sensitivity maps based on significant wave height ( H s ) in determining alternate offshore instrument deployment sites when a chosen nearshore location or region is inaccessible. Wave and bathymetry datasets are employed from one shallower, small-scale domain (Duck, NC) and one deeper, larger-scale domain (San Diego, CA). The effects of seasonal changes in wave climate, errors in bathymetry, and multiple assimilation points on sensitivity map shapes and model performance are investigated. Model accuracy is evaluated by comparing spectral statistics as well as with an RMS skill score, which estimates a mean model-data error across all spectral bins. Results indicate that data assimilation from identified high-sensitivity alternate locations consistently improves model performance at nearshore LOIs, while assimilation from low-sensitivity locations results in lesser or no improvement. Use of sub-sampled or alongshore-averaged bathymetry has a domain-specific effect on model performance when assimilating from a high-sensitivity alternate location. When multiple alternate assimilation locations are used from areas of lower sensitivity, model performance may be worse than with a single, high-sensitivity assimilation point.

  9. Admitting the Inadmissible: Adjoint Formulation for Incomplete Cost Functionals in Aerodynamic Optimization

    NASA Technical Reports Server (NTRS)

    Arian, Eyal; Salas, Manuel D.

    1997-01-01

    We derive the adjoint equations for problems in aerodynamic optimization which are improperly considered as "inadmissible." For example, a cost functional which depends on the density, rather than on the pressure, is considered "inadmissible" for an optimization problem governed by the Euler equations. We show that for such problems additional terms should be included in the Lagrangian functional when deriving the adjoint equations. These terms are obtained from the restriction of the interior PDE to the control surface. Demonstrations of the explicit derivation of the adjoint equations for "inadmissible" cost functionals are given for the potential, Euler, and Navier-Stokes equations.

  10. Adjoint-Based Methods for Estimating CO2 Sources and Sinks from Atmospheric Concentration Data

    NASA Technical Reports Server (NTRS)

    Andrews, Arlyn E.

    2003-01-01

    Work to develop adjoint-based methods for estimating CO2 sources and sinks from atmospheric concentration data was initiated in preparation for last year's summer institute on Carbon Data Assimilation (CDAS) at the National Center for Atmospheric Research in Boulder, CO. The workshop exercises used the GSFC Parameterized Chemistry and Transport Model and its adjoint. Since the workshop, a number of simulations have been run to evaluate the performance of the model adjoint. Results from these simulations will be presented, along with an outline of challenges associated with incorporating a variety of disparate data sources, from sparse, but highly precise, surface in situ observations to less accurate, global future satellite observations.

  11. Computational solution of spike overlapping using data-based subtraction algorithms to resolve synchronous sympathetic nerve discharge

    PubMed Central

    Su, Chun-Kuei; Chiang, Chia-Hsun; Lee, Chia-Ming; Fan, Yu-Pei; Ho, Chiu-Ming; Shyu, Liang-Yu

    2013-01-01

    Sympathetic nerves conveying central commands to regulate visceral functions often display activities in synchronous bursts. To understand how individual fibers fire synchronously, we establish “oligofiber recording techniques” to record “several” nerve fiber activities simultaneously, using in vitro splanchnic sympathetic nerve–thoracic spinal cord preparations of neonatal rats as experimental models. While distinct spike potentials were easily recorded from collagenase-dissociated sympathetic fibers, a problem arising from synchronous nerve discharges is a higher incidence of complex waveforms resulted from spike overlapping. Because commercial softwares do not provide an explicit solution for spike overlapping, a series of custom-made LabVIEW programs incorporated with MATLAB scripts was therefore written for spike sorting. Spikes were represented as data points after waveform feature extraction and automatically grouped by k-means clustering followed by principal component analysis (PCA) to verify their waveform homogeneity. For dissimilar waveforms with exceeding Hotelling's T2 distances from the cluster centroids, a unique data-based subtraction algorithm (SA) was used to determine if they were the complex waveforms resulted from superimposing a spike pattern close to the cluster centroid with the other signals that could be observed in original recordings. In comparisons with commercial software, higher accuracy was achieved by analyses using our algorithms for the synthetic data that contained synchronous spiking and complex waveforms. Moreover, both T2-selected and SA-retrieved spikes were combined as unit activities. Quantitative analyses were performed to evaluate if unit activities truly originated from single fibers. We conclude that applications of our programs can help to resolve synchronous sympathetic nerve discharges (SND). PMID:24198782

  12. Adjoint analyses of enhanced solidification for shape optimization in conjugate heat transfer problem

    NASA Astrophysics Data System (ADS)

    Morimoto, Kenichi; Kinoshita, Hidenori; Suzuki, Yuji

    2016-11-01

    In the present study, an adjoint-based shape-optimization method has been developed for designing extended heat transfer surfaces in conjugate heat transfer problems. Here we specifically consider heat conduction-dominated solidification problem under different thermal boundary conditions: (i) the isothermal condition, and (ii) the conjugate condition with thermal coupling between the solidified liquid and the solid wall inside the domain bounded by the extended heat transfer surface. In the present shape-optimization scheme, extended heat transfer surfaces are successively refined in a local way based on the variational information of a cost functional with respect to the shape modification. In the computation of the developed scheme, a meshless method is employed for dealing with the complex boundary shape. For high-resolution analyses with boundary-fitted node arrangement, we have introduced a bubble-mesh method combined with a high-efficiency algorithm for searching neighboring bubbles within a cut-off distance. The present technique can be easily applied to convection problems including high Reynolds number flow. We demonstrate, for the isothermal boundary condition, that the present optimization leads to tree-like fin shapes, which achieve the temperature field with global similarity for different initial fin shapes. We will also show the computational results for the conjugate condition, which would regularize the present optimization due to the fin-efficiency effect.

  13. Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

    DOE PAGES

    Jakeman, J. D.; Wildey, T.

    2015-01-01

    In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity. We show that utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this papermore » we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.« less

  14. Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

    SciTech Connect

    Jakeman, J. D.; Wildey, T.

    2015-01-01

    In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity. We show that utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.

  15. An object-oriented and quadrilateral-mesh based solution adaptive algorithm for compressible multi-fluid flows

    NASA Astrophysics Data System (ADS)

    Zheng, H. W.; Shu, C.; Chew, Y. T.

    2008-07-01

    In this paper, an object-oriented and quadrilateral-mesh based solution adaptive algorithm for the simulation of compressible multi-fluid flows is presented. The HLLC scheme (Harten, Lax and van Leer approximate Riemann solver with the Contact wave restored) is extended to adaptively solve the compressible multi-fluid flows under complex geometry on unstructured mesh. It is also extended to the second-order of accuracy by using MUSCL extrapolation. The node, edge and cell are arranged in such an object-oriented manner that each of them inherits from a basic object. A home-made double link list is designed to manage these objects so that the inserting of new objects and removing of the existing objects (nodes, edges and cells) are independent of the number of objects and only of the complexity of O( 1). In addition, the cells with different levels are further stored in different lists. This avoids the recursive calculation of solution of mother (non-leaf) cells. Thus, high efficiency is obtained due to these features. Besides, as compared to other cell-edge adaptive methods, the separation of nodes would reduce the memory requirement of redundant nodes, especially in the cases where the level number is large or the space dimension is three. Five two-dimensional examples are used to examine its performance. These examples include vortex evolution problem, interface only problem under structured mesh and unstructured mesh, bubble explosion under the water, bubble-shock interaction, and shock-interface interaction inside the cylindrical vessel. Numerical results indicate that there is no oscillation of pressure and velocity across the interface and it is feasible to apply it to solve compressible multi-fluid flows with large density ratio (1000) and strong shock wave (the pressure ratio is 10,000) interaction with the interface.

  16. MUFACT: An Algorithm for Multiple Factor Analyses of Singular and Nonsingular Data with Orthogonal and Oblique Transformation Solutions

    ERIC Educational Resources Information Center

    Hofmann, Richard J.

    1978-01-01

    A general factor analysis computer algorithm is briefly discussed. The algorithm is highly transportable with minimum limitations on the number of observations. Both singular and non-singular data can be analyzed. (Author/JKS)

  17. Inversion of tsunami sources by the adjoint method in the presence of observational and model errors

    NASA Astrophysics Data System (ADS)

    Pires, C.; Miranda, P. M. A.

    2003-04-01

    The adjoint method is applied to the inversion of tsumani sources from tide-gauge observations in both idealized and realistic setups, with emphasis on the effects of observational, bathymetric and other model errors in the quality of the inversion. The method is developed in a way that allows for the direct optimization of seismic focal parameters, in the case of seismic tsunamis, through a 4-step inversion procedure that can be fully automated, consisting in (i) source area delimitation, by adjoint backward ray-tracing, (ii) adjoint optimization of the initial sea state, from a vanishing first-guess, (iii) non-linear adjustment of the fault model and (iv) final adjoint optimization in the fault parameter space. The methodology is systematically tested with synthetic data, showing its flexibility and robustness in the presence of significant amounts of error.

  18. MS S4.03.002 - Adjoint-Based Design for Configuration Shaping

    NASA Technical Reports Server (NTRS)

    Nemec, Marian; Aftosmis, Michael J.

    2009-01-01

    This slide presentation discusses a method of inverse design for low sonic boom using adjoint-based gradient computations. It outlines a method for shaping a configuration in order to match a prescribed near-field signature.

  19. Discrete Adjoint-Based Design Optimization of Unsteady Turbulent Flows on Dynamic Unstructured Grids

    NASA Technical Reports Server (NTRS)

    Nielsen, Eric J.; Diskin, Boris; Yamaleev, Nail K.

    2009-01-01

    An adjoint-based methodology for design optimization of unsteady turbulent flows on dynamic unstructured grids is described. The implementation relies on an existing unsteady three-dimensional unstructured grid solver capable of dynamic mesh simulations and discrete adjoint capabilities previously developed for steady flows. The discrete equations for the primal and adjoint systems are presented for the backward-difference family of time-integration schemes on both static and dynamic grids. The consistency of sensitivity derivatives is established via comparisons with complex-variable computations. The current work is believed to be the first verified implementation of an adjoint-based optimization methodology for the true time-dependent formulation of the Navier-Stokes equations in a practical computational code. Large-scale shape optimizations are demonstrated for turbulent flows over a tiltrotor geometry and a simulated aeroelastic motion of a fighter jet.

  20. Almost commuting self-adjoint matrices: The real and self-dual cases

    NASA Astrophysics Data System (ADS)

    Loring, Terry A.; Sørensen, Adam P. W.

    2016-08-01

    We show that a pair of almost commuting self-adjoint, symmetric matrices is close to a pair of commuting self-adjoint, symmetric matrices (in a uniform way). Moreover, we prove that the same holds with self-dual in place of symmetric and also for paths of self-adjoint matrices. Since a symmetric, self-adjoint matrix is real, we get a real version of Huaxin Lin’s famous theorem on almost commuting matrices. Similarly, the self-dual case gives a version for matrices over the quaternions. To prove these results, we develop a theory of semiprojectivity for real C*-algebras and also examine various definitions of low-rank for real C*-algebras.

  1. On the role of self-adjointness in the continuum formulation of topological quantum phases

    NASA Astrophysics Data System (ADS)

    Tanhayi Ahari, Mostafa; Ortiz, Gerardo; Seradjeh, Babak

    2016-11-01

    Topological quantum phases of matter are characterized by an intimate relationship between the Hamiltonian dynamics away from the edges and the appearance of bound states localized at the edges of the system. Elucidating this correspondence in the continuum formulation of topological phases, even in the simplest case of a one-dimensional system, touches upon fundamental concepts and methods in quantum mechanics that are not commonly discussed in textbooks, in particular the self-adjoint extensions of a Hermitian operator. We show how such topological bound states can be derived in a prototypical one-dimensional system. Along the way, we provide a pedagogical exposition of the self-adjoint extension method as well as the role of symmetries in correctly formulating the continuum, field-theory description of topological matter with boundaries. Moreover, we show that self-adjoint extensions can be characterized generally in terms of a conserved local current associated with the self-adjoint operator.

  2. An implicit dispersive transport algorithm for the US Geological Survey MOC3D solute-transport model

    USGS Publications Warehouse

    Kipp, K.L.; Konikow, L.F.; Hornberger, G.Z.

    1998-01-01

    This report documents an extension to the U.S. Geological Survey MOC3D transport model that incorporates an implicit-in-time difference approximation for the dispersive transport equation, including source/sink terms. The original MOC3D transport model (Version 1) uses the method of characteristics to solve the transport equation on the basis of the velocity field. The original MOC3D solution algorithm incorporates particle tracking to represent advective processes and an explicit finite-difference formulation to calculate dispersive fluxes. The new implicit procedure eliminates several stability criteria required for the previous explicit formulation. This allows much larger transport time increments to be used in dispersion-dominated problems. The decoupling of advective and dispersive transport in MOC3D, however, is unchanged. With the implicit extension, the MOC3D model is upgraded to Version 2. A description of the numerical method of the implicit dispersion calculation, the data-input requirements and output options, and the results of simulator testing and evaluation are presented. Version 2 of MOC3D was evaluated for the same set of problems used for verification of Version 1. These test results indicate that the implicit calculation of Version 2 matches the accuracy of Version 1, yet is more efficient than the explicit calculation for transport problems that are characterized by a grid Peclet number less than about 1.0.

  3. A complete solution classification and unified algorithmic treatment for the one- and two-step asymmetric S-transverse mass event scale statistic

    NASA Astrophysics Data System (ADS)

    Walker, Joel W.

    2014-08-01

    The M T2, or "s-transverse mass", statistic was developed to associate a parent mass scale to a missing transverse energy signature, given that escaping particles are generally expected in pairs, while collider experiments are sensitive to just a single transverse momentum vector sum. This document focuses on the generalized extension of that statistic to asymmetric one- and two-step decay chains, with arbitrary child particle masses and upstream missing transverse momentum. It provides a unified theoretical formulation, complete solution classification, taxonomy of critical points, and technical algorithmic prescription for treatment of the event scale. An implementation of the described algorithm is available for download, and is also a deployable component of the author's selection cut software package AEAC uS (Algorithmic Event Arbiter and C ut Selector). appendices address combinatoric event assembly, algorithm validation, and a complete pseudocode.

  4. Preliminary Results from the Application of Automated Adjoint Code Generation to CFL3D

    NASA Technical Reports Server (NTRS)

    Carle, Alan; Fagan, Mike; Green, Lawrence L.

    1998-01-01

    This report describes preliminary results obtained using an automated adjoint code generator for Fortran to augment a widely-used computational fluid dynamics flow solver to compute derivatives. These preliminary results with this augmented code suggest that, even in its infancy, the automated adjoint code generator can accurately and efficiently deliver derivatives for use in transonic Euler-based aerodynamic shape optimization problems with hundreds to thousands of independent design variables.

  5. A new Green's function Monte Carlo algorithm for the estimation of the derivative of the solution of Helmholtz equation subject to Neumann and mixed boundary conditions

    NASA Astrophysics Data System (ADS)

    Chatterjee, Kausik

    2016-06-01

    The objective of this paper is the extension and application of a newly-developed Green's function Monte Carlo (GFMC) algorithm to the estimation of the derivative of the solution of the one-dimensional (1D) Helmholtz equation subject to Neumann and mixed boundary conditions problems. The traditional GFMC approach for the solution of partial differential equations subject to these boundary conditions involves "reflecting boundaries" resulting in relatively large computational times. My work, inspired by the work of K.K. Sabelfeld is philosophically different in that there is no requirement for reflection at these boundaries. The underlying feature of this algorithm is the elimination of the use of reflecting boundaries through the use of novel Green's functions that mimic the boundary conditions of the problem of interest. My past work has involved the application of this algorithm to the estimation of the solution of the 1D Laplace equation, the Helmholtz equation and the modified Helmholtz equation. In this work, this algorithm has been adapted to the estimation of the derivative of the solution which is a very important development. In the traditional approach involving reflection, to estimate the derivative at a certain number of points, one has to a priori estimate the solution at a larger number of points. In the case of a one-dimensional problem for instance, to obtain the derivative of the solution at a point, one has to obtain the solution at two points, one on each side of the point of interest. These points have to be close enough so that the validity of the first-order approximation for the derivative operator is justified and at the same time, the actual difference between the solutions at these two points has to be at least an order of magnitude higher than the statistical error in the estimation of the solution, thus requiring a significantly larger number of random-walks than that required for the estimation of the solution. In this new approach

  6. Important literature on the use of adjoint, variational methods and the Kalman filter in meteorology

    NASA Astrophysics Data System (ADS)

    Courtier, Philippe; Derber, John; Errico, Ron; Louis, Jean-Francois; Vukićević, Tomislava

    1993-10-01

    The use of adjoint equations is proving to be invaluable in many areas of meteorological research. Unlike a forecast model which describes the evolution of meteorological fields forward in time, the adjoint equations describe the evolution of sensitivity (to initial, boundary and parametric conditions) backward in time. Essentially, by utilizing this sensitivity information, many types of problems can be solved more efficiently than in the past, including variational data assimilation, parameter fitting, optimal instability and sensitivity analysis in general. For this reason, the adjoints of various models and their applications have been appearing more and more frequently in meteorological research. This paper is a bibliography in chronological order of published works in meteorology dealing with adjoints which have appeared prior to this issue of Tellus. Also included are meteorological works regarding variational methods (even without adjoints) and Kalman filtering in data assimilation, plus some references outside meteorology. These additional works are included here because the main thrust for adjoint application within meteorology is currently concentrated in the development of next-generation data assimilation systems.

  7. Adjoint-field errors in high fidelity compressible turbulence simulations for sound control

    NASA Astrophysics Data System (ADS)

    Vishnampet, Ramanathan; Bodony, Daniel; Freund, Jonathan

    2013-11-01

    A consistent discrete adjoint for high-fidelity discretization of the three-dimensional Navier-Stokes equations is used to quantify the error in the sensitivity gradient predicted by the continuous adjoint method, and examine the aeroacoustic flow-control problem for free-shear-flow turbulence. A particular quadrature scheme for approximating the cost functional makes our discrete adjoint formulation for a fourth-order Runge-Kutta scheme with high-order finite differences practical and efficient. The continuous adjoint-based sensitivity gradient is shown to to be inconsistent due to discretization truncation errors, grid stretching and filtering near boundaries. These errors cannot be eliminated by increasing the spatial or temporal resolution since chaotic interactions lead them to become O (1) at the time of control actuation. Although this is a known behavior for chaotic systems, its effect on noise control is much harder to anticipate, especially given the different resolution needs of different parts of the turbulence and acoustic spectra. A comparison of energy spectra of the adjoint pressure fields shows significant error in the continuous adjoint at all wavenumbers, even though they are well-resolved. The effect of this error on the noise control mechanism is analyzed.

  8. A Generalized Adjoint Approach for Quantifying Reflector Assembly Discontinuity Factor Uncertainties

    SciTech Connect

    Yankov, Artem; Collins, Benjamin; Jessee, Matthew Anderson; Downar, Thomas

    2012-01-01

    Sensitivity-based uncertainty analysis of assembly discontinuity factors (ADFs) can be readily performed using adjoint methods for infinite lattice models. However, there is currently no adjoint-based methodology to obtain uncertainties for ADFs along an interface between a fuel and reflector region. To accommodate leakage effects in a reflector region, a 1D approximation is usually made in order to obtain the homogeneous interface flux required to calculate the ADF. Within this 1D framework an adjoint-based method is proposed that is capable of efficiently calculating ADF uncertainties. In the proposed method the sandwich rule is utilized to relate the covariance of the input parameters of 1D diffusion theory in the reflector region to the covariance of the interface ADFs. The input parameters covariance matrix can be readily obtained using sampling-based codes such as XSUSA or adjoint-based codes such as TSUNAMI. The sensitivity matrix is constructed using a fixed-source adjoint approach for inputs characterizing the reflector region. An analytic approach is then used to determine the sensitivity of the ADFs to fuel parameters using the neutron balance equation. A stochastic approach is used to validate the proposed adjoint-based method.

  9. Adjoint-Based, Three-Dimensional Error Prediction and Grid Adaptation

    NASA Technical Reports Server (NTRS)

    Park, Michael A.

    2002-01-01

    Engineering computational fluid dynamics (CFD) analysis and design applications focus on output functions (e.g., lift, drag). Errors in these output functions are generally unknown and conservatively accurate solutions may be computed. Computable error estimates can offer the possibility to minimize computational work for a prescribed error tolerance. Such an estimate can be computed by solving the flow equations and the linear adjoint problem for the functional of interest. The computational mesh can be modified to minimize the uncertainty of a computed error estimate. This robust mesh-adaptation procedure automatically terminates when the simulation is within a user specified error tolerance. This procedure for estimating and adapting to error in a functional is demonstrated for three-dimensional Euler problems. An adaptive mesh procedure that links to a Computer Aided Design (CAD) surface representation is demonstrated for wing, wing-body, and extruded high lift airfoil configurations. The error estimation and adaptation procedure yielded corrected functions that are as accurate as functions calculated on uniformly refined grids with ten times as many grid points.

  10. Adjoint based data assimilation for phase field model using second order information of a posterior distribution

    NASA Astrophysics Data System (ADS)

    Ito, Shin-Ichi; Nagao, Hiromichi; Yamanaka, Akinori; Tsukada, Yuhki; Koyama, Toshiyuki; Inoue, Junya

    Phase field (PF) method, which phenomenologically describes dynamics of microstructure evolutions during solidification and phase transformation, has progressed in the fields of hydromechanics and materials engineering. How to determine, based on observation data, an initial state and model parameters involved in a PF model is one of important issues since previous estimation methods require too much computational cost. We propose data assimilation (DA), which enables us to estimate the parameters and states by integrating the PF model and observation data on the basis of the Bayesian statistics. The adjoint method implemented on DA not only finds an optimum solution by maximizing a posterior distribution but also evaluates the uncertainty in the estimations by utilizing the second order information of the posterior distribution. We carried out an estimation test using synthetic data generated by the two-dimensional Kobayashi's PF model. The proposed method is confirmed to reproduce the true initial state and model parameters we assume in advance, and simultaneously estimate their uncertainties due to quality and quantity of the data. This result indicates that the proposed method is capable of suggesting the experimental design to achieve the required accuracy.

  11. Big Data Challenges in Global Seismic 'Adjoint Tomography' (Invited)

    NASA Astrophysics Data System (ADS)

    Tromp, J.; Bozdag, E.; Krischer, L.; Lefebvre, M.; Lei, W.; Smith, J.

    2013-12-01

    The challenge of imaging Earth's interior on a global scale is closely linked to the challenge of handling large data sets. The related iterative workflow involves five distinct phases, namely, 1) data gathering and culling, 2) synthetic seismogram calculations, 3) pre-processing (time-series analysis and time-window selection), 4) data assimilation and adjoint calculations, 5) post-processing (pre-conditioning, regularization, model update). In order to implement this workflow on modern high-performance computing systems, a new seismic data format is being developed. The Adaptable Seismic Data Format (ASDF) is designed to replace currently used data formats with a more flexible format that allows for fast parallel I/O. The metadata is divided into abstract categories, such as "source" and "receiver", along with provenance information for complete reproducibility. The structure of ASDF is designed keeping in mind three distinct applications: earthquake seismology, seismic interferometry, and exploration seismology. Existing time-series analysis tool kits, such as SAC and ObsPy, can be easily interfaced with ASDF so that seismologists can use robust, previously developed software packages. ASDF accommodates an automated, efficient workflow for global adjoint tomography. Manually managing the large number of simulations associated with the workflow can rapidly become a burden, especially with increasing numbers of earthquakes and stations. Therefore, it is of importance to investigate the possibility of automating the entire workflow. Scientific Workflow Management Software (SWfMS) allows users to execute workflows almost routinely. SWfMS provides additional advantages. In particular, it is possible to group independent simulations in a single job to fit the available computational resources. They also give a basic level of fault resilience as the workflow can be resumed at the correct state preceding a failure. Some of the best candidates for our particular workflow

  12. Plumes, Hotspot & Slabs Imaged by Global Adjoint Tomography

    NASA Astrophysics Data System (ADS)

    Bozdag, E.; Lefebvre, M. P.; Lei, W.; Peter, D. B.; Smith, J. A.; Komatitsch, D.; Tromp, J.

    2015-12-01

    We present the "first generation" global adjoint tomography model based on 3D wave simulations, which is the result of 15 conjugate-gradient iterations with confined transverse isotropy to the upper mantle. Our starting model is the 3D mantle and crustal models S362ANI (Kustowski et al. 2008) and Crust2.0 (Bassin et al. 2000), respectively. We take into account the full nonlinearity of wave propagation in numerical simulations including attenuation (both in forward and adjoint simulations), topography/bathymetry, etc., using the GPU version of the SPECFEM3D_GLOBE package. We invert for crust and mantle together without crustal corrections to avoid any bias in mantle structure. We started with an initial selection of 253 global CMT events within the magnitude range 5.8 ≤ Mw ≤ 7.0 with numerical simulations having resolution down to 27 s combining 30-s body and 60-s surface waves. After the 12th iteration we increased the resolution to 17 s, including higher-frequency body waves as well as going down to 45 s in surface-wave measurements. We run 180-min seismograms and assimilate all minor- and major-arc body and surface waves. Our 15th iteration model update shows a tantalisingly enhanced image of the Tahiti plume as well as various other plumes and hotspots, such as Caroline, Galapagos, Yellowstone, Erebus, etc. Furthermore, we see clear improvements in slab resolution along the Hellenic and Japan Arcs, as well as subduction along the East of Scotia Plate, which does not exist in the initial model. Point-spread function tests (Fichtner & Trampert 2011) suggest that we are close to the resolution of continental-scale studies in our global inversions and able to confidently map features, for instance, at the scale of the Yellowstone hotspot. This is a clear consequence of our multi-scale smoothing strategy, in which we define our smoothing operator as a function of the approximate Hessian kernel and smooth our gradients less wherever we have good ray coverage

  13. Study and Investigation of Computer Algorithms for the Solution of the Shallow-Fluid Equations as a Means of Computing Terrain Influences on Wind Fields. Appendices A, B, C and D.

    DTIC Science & Technology

    1973-07-01

    COMPUTER ALGORITHMS FOR THE SOLUTION OF THE SHALLOW-FLUID EQUATIONS AS A MEANS OF COMPUTING TERRAIN INFLUENCES ON WIND FIELDS APPENDICES A, B, C AND D By...2- .A. .C-42 AD-A129 066 STUDY AND INVESTIGATION OF COMPUTER ALGORITHMS FOR THE I SOLUTION OF THE SN.. (U) CRAMER (H E) CO INC SALT LAKE CITY UT A G

  14. Least-Squares PN Formulation of the Transport Equation Using Self-Adjoint-Angular-Flux Consistent Boundary Conditions.

    SciTech Connect

    Vincent M. Laboure; Yaqi Wang; Mark D. DeHart

    2016-05-01

    In this paper, we study the Least-Squares (LS) PN form of the transport equation compatible with voids in the context of Continuous Finite Element Methods (CFEM).We first deriveweakly imposed boundary conditions which make the LS weak formulation equivalent to the Self-Adjoint Angular Flux (SAAF) variational formulation with a void treatment, in the particular case of constant cross-sections and a uniform mesh. We then implement this method in Rattlesnake with the Multiphysics Object Oriented Simulation Environment (MOOSE) framework using a spherical harmonics (PN) expansion to discretize in angle. We test our implementation using the Method of Manufactured Solutions (MMS) and find the expected convergence behavior both in angle and space. Lastly, we investigate the impact of the global non-conservation of LS by comparing the method with SAAF on a heterogeneous test problem.

  15. On the nonlinear self-adjointness and local conservation laws for a class of evolution equations unifying many models

    NASA Astrophysics Data System (ADS)

    Freire, Igor Leite; Santos Sampaio, Júlio Cesar

    2014-02-01

    In this paper we consider a class of evolution equations up to fifth-order containing many arbitrary smooth functions from the point of view of nonlinear self-adjointness. The studied class includes many important equations modeling different phenomena. In particular, some of the considered equations were studied previously by other researchers from the point of view of quasi self-adjointness or strictly self-adjointness. Therefore we find new local conservation laws for these equations invoking the obtained results on nonlinearly self-adjointness and the conservation theorem proposed by Nail Ibragimov.

  16. Joint Inversion of Mantle Viscosity and Thermal Structure: Applications of the Adjoint of Mantle Convection with Observational Constraints

    NASA Astrophysics Data System (ADS)

    Liu, L.; Gurnis, M.

    2007-12-01

    The adjoint method widely used in meteorology and oceanography was introduced into mantle convection by Bunge et al (2003) and Ismail et al (2004). We implemented the adjoint method in CitcomS, a finite-element code that solves for thermal convection within a spherical shell. This method constrains the initial condition by minimizing the mismatch of prediction to observation. Since the present day mantle thermal structure is inferred from seismic tomography, we converted seismic velocity to temperature, an uncertain conversion. Moreover, since mantle viscosity is also uncertain, the inference of mantle initial conditions from tomography is not unique. We have developed a method that incorporates dynamic topography as an additional constraint and are able to jointly invert for mantle viscosity and the seismic to thermal scaling. We assume the thermal structure of present day mantle has the same ¡°pattern¡± as inferred from tomography, but leave the scaling to temperature as an unknown. The other constraint is the evolving dynamic topography recorded at specific points on earth's surface. From the governing equations of mantle convection, we derive the relations between dynamic topography, thermal anomaly and mantle viscosities. These relations allow a two- layer looping algorithm that inverts for viscosity and thermal anomaly: the inner loop takes the tomographic image as a constraint and the outer loop takes dynamic topography and its rate of change. Starting with incorrect values of thermal anomaly and viscosities, we show with synthetic experiments that all variables converge to their correct values after a finite number of iterations. Our method is examined both in a uniformly viscous mantle and a mantle with depth- and temperature-dependent viscosity. The method has been applied to the descent of the Farallon slab beneath North America.

  17. An accelerated photo-magnetic imaging reconstruction algorithm based on an analytical forward solution and a fast Jacobian assembly method

    NASA Astrophysics Data System (ADS)

    Nouizi, F.; Erkol, H.; Luk, A.; Marks, M.; Unlu, M. B.; Gulsen, G.

    2016-10-01

    We previously introduced photo-magnetic imaging (PMI), an imaging technique that illuminates the medium under investigation with near-infrared light and measures the induced temperature increase using magnetic resonance thermometry (MRT). Using a multiphysics solver combining photon migration and heat diffusion, PMI models the spatiotemporal distribution of temperature variation and recovers high resolution optical absorption images using these temperature maps. In this paper, we present a new fast non-iterative reconstruction algorithm for PMI. This new algorithm uses analytic methods during the resolution of the forward problem and the assembly of the sensitivity matrix. We validate our new analytic-based algorithm with the first generation finite element method (FEM) based reconstruction algorithm previously developed by our team. The validation is performed using, first synthetic data and afterwards, real MRT measured temperature maps. Our new method accelerates the reconstruction process 30-fold when compared to a single iteration of the FEM-based algorithm.

  18. The application of the gradient-based adjoint multi-point optimization of single and double shock control bumps for transonic airfoils

    NASA Astrophysics Data System (ADS)

    Mazaheri, K.; Nejati, A.; Chaharlang Kiani, K.; Taheri, R.

    2016-07-01

    A shock control bump (SCB) is a flow control method that uses local small deformations in a flexible wing surface to considerably reduce the strength of shock waves and the resulting wave drag in transonic flows. Most of the reported research is devoted to optimization in a single flow condition. Here, we have used a multi-point adjoint optimization scheme to optimize shape and location of the SCB. Practically, this introduces transonic airfoils equipped with the SCB that are simultaneously optimized for different off-design transonic flight conditions. Here, we use this optimization algorithm to enhance and optimize the performance of SCBs in two benchmark airfoils, i.e., RAE-2822 and NACA-64-A010, over a wide range of off-design Mach numbers. All results are compared with the usual single-point optimization. We use numerical simulation of the turbulent viscous flow and a gradient-based adjoint algorithm to find the optimum location and shape of the SCB. We show that the application of SCBs may increase the aerodynamic performance of an RAE-2822 airfoil by 21.9 and by 22.8 % for a NACA-64-A010 airfoil compared to the no-bump design in a particular flight condition. We have also investigated the simultaneous usage of two bumps for the upper and the lower surfaces of the airfoil. This has resulted in a 26.1 % improvement for the RAE-2822 compared to the clean airfoil in one flight condition.

  19. The solution of singular optimal control problems using direct collocation and nonlinear programming

    NASA Astrophysics Data System (ADS)

    Downey, James R.; Conway, Bruce A.

    1992-08-01

    This paper describes work on the determination of optimal rocket trajectories which may include singular arcs. In recent years direct collocation and nonlinear programming has proven to be a powerful method for solving optimal control problems. Difficulties in the application of this method can occur if the problem is singular. Techniques exist for solving singular problems indirectly using the associated adjoint formulation. Unfortunately, the adjoints are not a part of the direct formulation. It is shown how adjoint information can be obtained from the direct method to allow the solution of singular problems.

  20. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.

    PubMed

    Guturu, Parthasarathy; Dantu, Ram

    2008-06-01

    Many graph- and set-theoretic problems, because of their tremendous application potential and theoretical appeal, have been well investigated by the researchers in complexity theory and were found to be NP-hard. Since the combinatorial complexity of these problems does not permit exhaustive searches for optimal solutions, only near-optimal solutions can be explored using either various problem-specific heuristic strategies or metaheuristic global-optimization methods, such as simulated annealing, genetic algorithms, etc. In this paper, we propose a unified evolutionary algorithm (EA) to the problems of maximum clique finding, maximum independent set, minimum vertex cover, subgraph and double subgraph isomorphism, set packing, set partitioning, and set cover. In the proposed approach, we first map these problems onto the maximum clique-finding problem (MCP), which is later solved using an evolutionary strategy. The proposed impatient EA with probabilistic tabu search (IEA-PTS) for the MCP integrates the best features of earlier successful approaches with a number of new heuristics that we developed to yield a performance that advances the state of the art in EAs for the exploration of the maximum cliques in a graph. Results of experimentation with the 37 DIMACS benchmark graphs and comparative analyses with six state-of-the-art algorithms, including two from the smaller EA community and four from the larger metaheuristics community, indicate that the IEA-PTS outperforms the EAs with respect to a Pareto-lexicographic ranking criterion and offers competitive performance on some graph instances when individually compared to the other heuristic algorithms. It has also successfully set a new benchmark on one graph instance. On another benchmark suite called Benchmarks with Hidden Optimal Solutions, IEA-PTS ranks second, after a very recent algorithm called COVER, among its peers that have experimented with this suite.

  1. Adjoint-based airfoil shape optimization in transonic flow

    NASA Astrophysics Data System (ADS)

    Gramanzini, Joe-Ray

    The primary focus of this work is efficient aerodynamic shape optimization in transonic flow. Adjoint-based optimization techniques are employed on airfoil sections and evaluated in terms of computational accuracy as well as efficiency. This study examines two test cases proposed by the AIAA Aerodynamic Design Optimization Discussion Group. The first is a two-dimensional, transonic, inviscid, non-lifting optimization of a Modified-NACA 0012 airfoil. The second is a two-dimensional, transonic, viscous optimization problem using a RAE 2822 airfoil. The FUN3D CFD code of NASA Langley Research Center is used as the ow solver for the gradient-based optimization cases. Two shape parameterization techniques are employed to study their effect and the number of design variables on the final optimized shape: Multidisciplinary Aerodynamic-Structural Shape Optimization Using Deformation (MASSOUD) and the BandAids free-form deformation technique. For the two airfoil cases, angle of attack is treated as a global design variable. The thickness and camber distributions are the local design variables for MASSOUD, and selected airfoil surface grid points are the local design variables for BandAids. Using the MASSOUD technique, a drag reduction of 72.14% is achieved for the NACA 0012 case, reducing the total number of drag counts from 473.91 to 130.59. Employing the BandAids technique yields a 78.67% drag reduction, from 473.91 to 99.98. The RAE 2822 case exhibited a drag reduction from 217.79 to 132.79 counts, a 39.05% decrease using BandAids.

  2. An Adjoint Sensitivity Analysis of the South Portion of the California Current and Ecosystem Using ROMS

    NASA Astrophysics Data System (ADS)

    Moore, A. M.; Dilorenzo, E.; Arango, H. G.; Lewis, C. V.; Powell, T. M.; Miller, A. J.; Cornuelle, B. D.

    2005-12-01

    The adjoint of the tangent linear version of the Regional Ocean Modeling System (ROMS) coupled to a four component nitrogen-based trophic model (NPZD) has been used to explore the sensitivity of various physical and biological aspects of the southern arm of the California Current system to linear variations in the physical and biological attributes of the system. The aspects of the system of interest are characterized by suitably defined indices of variability that include measures of coastal upwelling, eddy kinetic energy, and biological tracer concentrations. The adjoint approach is particularly well suited to this kind of analysis because all of the model linear sensitivities can be computed from a single integration of the adjoint model for each index. The adjoint model provides two- and three-dimensional, time-dependent fields of sensitivity from which clear signatures of processes such as advection and instability can be identified. By comparing the sensitivities that arise from perturbing different physical variables in an appropriate way, the relative importance of different physical and biological processes and their potential to control a chosen index can be determined. We will show examples of such adjoint sensitivity analyses for the coupled physical-biological model computed in this way, and discuss their implications.

  3. Aerodynamic Optimization Design of Multi-stage Turbine Using the Continuous Adjoint Method

    NASA Astrophysics Data System (ADS)

    Chen, Lei; Chen, Jiang

    2015-05-01

    This paper develops a continuous adjoint formulation for the aerodynamic shape design of a turbine in a multi-stage environment based on S2 surface governed by the Euler equations with source terms. First, given the general expression of the objective function, the adjoint equations and their boundary conditions are derived by introducing the adjoint variable vectors. Then, the final expression of the objective function gradient only includes the terms pertinent to the physical shape variations. The adjoint system is solved numerically by a finite-difference method with the Jameson spatial scheme employing first and third order dissipative flux and the time-marching is conducted by Runge-Kutta time method. Integrating the blade stagger angles, stacking lines and passage perturbation parameterization with the Quasi-Newton method of BFGS, a gradient-based aerodynamic optimization design system is constructed. Finally, the application of the adjoint method is validated through the blade and passage optimization of a 2-stage turbine with an objective function of entropy generation. The efficiency increased by 0.37% with the deviations of the mass flow rate and the pressure ratio within 1% via the optimization, which demonstrates the capability of the gradient-based system for turbine aerodynamic design.

  4. Generalized adjoint consistent treatment of wall boundary conditions for compressible flows

    NASA Astrophysics Data System (ADS)

    Hartmann, Ralf; Leicht, Tobias

    2015-11-01

    In this article, we revisit the adjoint consistency analysis of Discontinuous Galerkin discretizations of the compressible Euler and Navier-Stokes equations with application to the Reynolds-averaged Navier-Stokes and k- ω turbulence equations. Here, particular emphasis is laid on the discretization of wall boundary conditions. While previously only one specific combination of discretizations of wall boundary conditions and of aerodynamic force coefficients has been shown to give an adjoint consistent discretization, in this article we generalize this analysis and provide a discretization of the force coefficients for any consistent discretization of wall boundary conditions. Furthermore, we demonstrate that a related evaluation of the cp- and cf-distributions is required. The freedom gained in choosing the discretization of boundary conditions without loosing adjoint consistency is used to devise a new adjoint consistent discretization including numerical fluxes on the wall boundary which is more robust than the adjoint consistent discretization known up to now. While this work is presented in the framework of Discontinuous Galerkin discretizations, the insight gained is also applicable to (and thus valuable for) other discretization schemes. In particular, the discretization of integral quantities, like the drag, lift and moment coefficients, as well as the discretization of local quantities at the wall like surface pressure and skin friction should follow as closely as possible the discretization of the flow equations and boundary conditions at the wall boundary.

  5. Assessing the Impact of Observations on Numerical Weather Forecasts Using the Adjoint Method

    NASA Technical Reports Server (NTRS)

    Gelaro, Ronald

    2012-01-01

    The adjoint of a data assimilation system provides a flexible and efficient tool for estimating observation impacts on short-range weather forecasts. The impacts of any or all observations can be estimated simultaneously based on a single execution of the adjoint system. The results can be easily aggregated according to data type, location, channel, etc., making this technique especially attractive for examining the impacts of new hyper-spectral satellite instruments and for conducting regular, even near-real time, monitoring of the entire observing system. This talk provides a general overview of the adjoint method, including the theoretical basis and practical implementation of the technique. Results are presented from the adjoint-based observation impact monitoring tool in NASA's GEOS-5 global atmospheric data assimilation and forecast system. When performed in conjunction with standard observing system experiments (OSEs), the adjoint results reveal both redundancies and dependencies between observing system impacts as observations are added or removed from the assimilation system. Understanding these dependencies may be important for optimizing the use of the current observational network and defining requirements for future observing systems

  6. New Factorization Techniques and Parallel (log N) Algorithms for Forward Dynamics Solution of Single Closed-Chain Robot Manipulators

    NASA Technical Reports Server (NTRS)

    Fijany, Amir

    1993-01-01

    In this paper parallel 0(log N) algorithms for dynamic simulation of single closed-chain rigid multibody system as specialized to the case of a robot manipulatoar in contact with the environment are developed.

  7. Adjoint Methods for Adjusting Three-Dimensional Atmosphere and Surface Properties to Fit Multi-Angle Multi-Pixel Polarimetric Measurements

    NASA Technical Reports Server (NTRS)

    Martin, William G.; Cairns, Brian; Bal, Guillaume

    2014-01-01

    This paper derives an efficient procedure for using the three-dimensional (3D) vector radiative transfer equation (VRTE) to adjust atmosphere and surface properties and improve their fit with multi-angle/multi-pixel radiometric and polarimetric measurements of scattered sunlight. The proposed adjoint method uses the 3D VRTE to compute the measurement misfit function and the adjoint 3D VRTE to compute its gradient with respect to all unknown parameters. In the remote sensing problems of interest, the scalar-valued misfit function quantifies agreement with data as a function of atmosphere and surface properties, and its gradient guides the search through this parameter space. Remote sensing of the atmosphere and surface in a three-dimensional region may require thousands of unknown parameters and millions of data points. Many approaches would require calls to the 3D VRTE solver in proportion to the number of unknown parameters or measurements. To avoid this issue of scale, we focus on computing the gradient of the misfit function as an alternative to the Jacobian of the measurement operator. The resulting adjoint method provides a way to adjust 3D atmosphere and surface properties with only two calls to the 3D VRTE solver for each spectral channel, regardless of the number of retrieval parameters, measurement view angles or pixels. This gives a procedure for adjusting atmosphere and surface parameters that will scale to the large problems of 3D remote sensing. For certain types of multi-angle/multi-pixel polarimetric measurements, this encourages the development of a new class of three-dimensional retrieval algorithms with more flexible parametrizations of spatial heterogeneity, less reliance on data screening procedures, and improved coverage in terms of the resolved physical processes in the Earth?s atmosphere.

  8. Adjoint-based constrained topology optimization for viscous flows, including heat transfer

    NASA Astrophysics Data System (ADS)

    Kontoleontos, E. A.; Papoutsis-Kiachagias, E. M.; Zymaris, A. S.; Papadimitriou, D. I.; Giannakoglou, K. C.

    2013-08-01

    In fluid mechanics, topology optimization is used for designing flow passages, connecting predefined inlets and outlets, with optimal performance based on selected criteria. In this article, the continuous adjoint approach to topology optimization in incompressible ducted flows with heat transfer is presented. A variable porosity field, to be determined during the optimization, is the means to define the optimal topology. The objective functions take into account viscous losses and the amount of heat transfer. Turbulent flows are handled using the Spalart-Allmaras model and the proposed adjoint is exact, i.e. the adjoint to the turbulence model equation is formulated and solved, too. This is an important novelty in this article which extends the porosity-based method to account for heat transfer flow problems in turbulent flows. In problems such as the design of manifolds, constraints on the outlet flow direction, rates and mean outlet temperatures are imposed.

  9. Exact Solution of the One-Dimensional Non-Abelian Coulomb Gas at Large {ital N}

    SciTech Connect

    Semenoff, G.W.; Tirkkonen, O.; Zarembo, K. |

    1996-09-01

    The problem of computing the thermodynamic properties of a one-dimensional gas of particles which transform in the adjoint representation of the gauge group and interact through non-Abelian electric fields is formulated and solved in the large {ital N} limit. The explicit solution exhibits a first order confinement-deconfinement phase transition with computable properties and describes two-dimensional adjoint QCD in the limit where matter field masses are large. {copyright} {ital 1996 The American Physical Society.}

  10. Adjoint Sensitivity Analysis of a Coupled Groundwater-Surface Water Model

    NASA Astrophysics Data System (ADS)

    Kelley, V. A.

    2013-12-01

    Derivation of the exact equations of Adjoint Sensitivity Analysis for a coupled Groundwater-Surface water model is presented here, with reference to the Stream package in MODFLOW-2005. MODFLOW-2005 offers two distinct packages to simulate river boundary conditions in an aquifer model. They are the RIV (RIVer) Package and the STR (STReam) Package. The STR package simulates a coupled Groundwater and Surface Water flow model. As a result of coupling between the Groundwater and the Surface Water flows, the flows to/from the aquifer depend not just on the river stage and aquifer head at that location (as would happen in the RIV package); but on the river stages and aquifer heads at all upstream locations, in the complex network of streams with all its distributaries and diversions. This requires a substantial modification of the adjoint state equations (not required in RIV Package). The necessary equations for the STR Package have now been developed and implemented the MODFLOW-ADJOINT Code. The exact STR Adjoint code has been validated by comparing with the results from the parameter perturbation method, for the case of San Pedro Model (USGS) and Northern Arizona Regional Aquifer Model (USGS). When the RIV package is used for the same models, the sensitivity analysis results are incorrect for some nodes, indicating the advantage of using the exact methods of the STR Package in MODFLOW-Adjoint code. This exact analysis has been used for deriving the capture functions in the management of groundwater, subject to the constraints on the depletion of surface water supplies. Capture maps are used for optimal location of the pumping wells, their rates of withdrawals, and their timing. Because of the immense savings in computational times, with this Adjoint strategy, it is feasible to embed the groundwater management problem in a stochastic framework (probabilistic approach) to address the uncertainties in the groundwater model.

  11. Iterative algorithm to compute the maximal and stabilising solutions of a general class of discrete-time Riccati-type equations

    NASA Astrophysics Data System (ADS)

    Dragan, Vasile; Morozan, Toader; Stoica, Adrian-Mihail

    2010-04-01

    In this article an iterative method to compute the maximal solution and the stabilising solution, respectively, of a wide class of discrete-time nonlinear equations on the linear space of symmetric matrices is proposed. The class of discrete-time nonlinear equations under consideration contains, as special cases, different types of discrete-time Riccati equations involved in various control problems for discrete-time stochastic systems. This article may be viewed as an addendum of the work of Dragan and Morozan (Dragan, V. and Morozan, T. (2009), 'A Class of Discrete Time Generalized Riccati Equations', Journal of Difference Equations and Applications, first published on 11 December 2009 (iFirst), doi: 10.1080/10236190802389381) where necessary and sufficient conditions for the existence of the maximal solution and stabilising solution of this kind of discrete-time nonlinear equations are given. The aim of this article is to provide a procedure for numerical computation of the maximal solution and the stabilising solution, respectively, simpler than the method based on the Newton-Kantorovich algorithm.

  12. Aerodynamic Shape Optimization of Supersonic Aircraft Configurations via an Adjoint Formulation on Parallel Computers

    NASA Technical Reports Server (NTRS)

    Reuther, James; Alonso, Juan Jose; Rimlinger, Mark J.; Jameson, Antony

    1996-01-01

    This work describes the application of a control theory-based aerodynamic shape optimization method to the problem of supersonic aircraft design. The design process is greatly accelerated through the use of both control theory and a parallel implementation on distributed memory computers. Control theory is employed to derive the adjoint differential equations whose solution allows for the evaluation of design gradient information at a fraction of the computational cost required by previous design methods. The resulting problem is then implemented on parallel distributed memory architectures using a domain decomposition approach, an optimized communication schedule, and the MPI (Message Passing Interface) Standard for portability and efficiency. The final result achieves very rapid aerodynamic design based on higher order computational fluid dynamics methods (CFD). In our earlier studies, the serial implementation of this design method was shown to be effective for the optimization of airfoils, wings, wing-bodies, and complex aircraft configurations using both the potential equation and the Euler equations. In our most recent paper, the Euler method was extended to treat complete aircraft configurations via a new multiblock implementation. Furthermore, during the same conference, we also presented preliminary results demonstrating that this basic methodology could be ported to distributed memory parallel computing architectures. In this paper, our concern will be to demonstrate that the combined power of these new technologies can be used routinely in an industrial design environment by applying it to the case study of the design of typical supersonic transport configurations. A particular difficulty of this test case is posed by the propulsion/airframe integration.

  13. Aerodynamic Shape Optimization of Supersonic Aircraft Configurations via an Adjoint Formulation on Parallel Computers

    NASA Technical Reports Server (NTRS)

    Reuther, James; Alonso, Juan Jose; Rimlinger, Mark J.; Jameson, Antony

    1996-01-01

    This work describes the application of a control theory-based aerodynamic shape optimization method to the problem of supersonic aircraft design. The design process is greatly accelerated through the use of both control theory and a parallel implementation on distributed memory computers. Control theory is employed to derive the adjoint differential equations whose solution allows for the evaluation of design gradient information at a fraction of the computational cost required by previous design methods (13, 12, 44, 38). The resulting problem is then implemented on parallel distributed memory architectures using a domain decomposition approach, an optimized communication schedule, and the MPI (Message Passing Interface) Standard for portability and efficiency. The final result achieves very rapid aerodynamic design based on higher order computational fluid dynamics methods (CFD). In our earlier studies, the serial implementation of this design method (19, 20, 21, 23, 39, 25, 40, 41, 42, 43, 9) was shown to be effective for the optimization of airfoils, wings, wing-bodies, and complex aircraft configurations using both the potential equation and the Euler equations (39, 25). In our most recent paper, the Euler method was extended to treat complete aircraft configurations via a new multiblock implementation. Furthermore, during the same conference, we also presented preliminary results demonstrating that the basic methodology could be ported to distributed memory parallel computing architectures [241. In this paper, our concem will be to demonstrate that the combined power of these new technologies can be used routinely in an industrial design environment by applying it to the case study of the design of typical supersonic transport configurations. A particular difficulty of this test case is posed by the propulsion/airframe integration.

  14. A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers

    SciTech Connect

    Bakhos, Tania; Saibaba, Arvind K.; Kitanidis, Peter K.

    2015-10-15

    We consider the problem of estimating parameters in large-scale weakly nonlinear inverse problems for which the underlying governing equations is a linear, time-dependent, parabolic partial differential equation. A major challenge in solving these inverse problems using Newton-type methods is the computational cost associated with solving the forward problem and with repeated construction of the Jacobian, which represents the sensitivity of the measurements to the unknown parameters. Forming the Jacobian can be prohibitively expensive because it requires repeated solutions of the forward and adjoint time-dependent parabolic partial differential equations corresponding to multiple sources and receivers. We propose an efficient method based on a Laplace transform-based exponential time integrator combined with a flexible Krylov subspace approach to solve the resulting shifted systems of equations efficiently. Our proposed solver speeds up the computation of the forward and adjoint problems, thus yielding significant speedup in total inversion time. We consider an application from Transient Hydraulic Tomography (THT), which is an imaging technique to estimate hydraulic parameters related to the subsurface from pressure measurements obtained by a series of pumping tests. The algorithms discussed are applied to a synthetic example taken from THT to demonstrate the resulting computational gains of this proposed method.

  15. Finite-frequency sensitivity kernels for global seismic wave propagation based upon adjoint methods

    NASA Astrophysics Data System (ADS)

    Liu, Qinya; Tromp, Jeroen

    2008-07-01

    We determine adjoint equations and Fréchet kernels for global seismic wave propagation based upon a Lagrange multiplier method. We start from the equations of motion for a rotating, self-gravitating earth model initially in hydrostatic equilibrium, and derive the corresponding adjoint equations that involve motions on an earth model that rotates in the opposite direction. Variations in the misfit function χ then may be expressed as , where δlnm = δm/m denotes relative model perturbations in the volume V, δlnd denotes relative topographic variations on solid-solid or fluid-solid boundaries Σ, and ∇Σδlnd denotes surface gradients in relative topographic variations on fluid-solid boundaries ΣFS. The 3-D Fréchet kernel Km determines the sensitivity to model perturbations δlnm, and the 2-D kernels Kd and Kd determine the sensitivity to topographic variations δlnd. We demonstrate also how anelasticity may be incorporated within the framework of adjoint methods. Finite-frequency sensitivity kernels are calculated by simultaneously computing the adjoint wavefield forward in time and reconstructing the regular wavefield backward in time. Both the forward and adjoint simulations are based upon a spectral-element method. We apply the adjoint technique to generate finite-frequency traveltime kernels for global seismic phases (P, Pdiff, PKP, S, SKS, depth phases, surface-reflected phases, surface waves, etc.) in both 1-D and 3-D earth models. For 1-D models these adjoint-generated kernels generally agree well with results obtained from ray-based methods. However, adjoint methods do not have the same theoretical limitations as ray-based methods, and can produce sensitivity kernels for any given phase in any 3-D earth model. The Fréchet kernels presented in this paper illustrate the sensitivity of seismic observations to structural parameters and topography on internal discontinuities. These kernels form the basis of future 3-D tomographic inversions.

  16. Adjoint sensitivity studies of loop current and eddy shedding in the Gulf of Mexico

    NASA Astrophysics Data System (ADS)

    Gopalakrishnan, Ganesh; Cornuelle, Bruce D.; Hoteit, Ibrahim

    2013-07-01

    Adjoint model sensitivity analyses were applied for the loop current (LC) and its eddy shedding in the Gulf of Mexico (GoM) using the MIT general circulation model (MITgcm). The circulation in the GoM is mainly driven by the energetic LC and subsequent LC eddy separation. In order to understand which ocean regions and features control the evolution of the LC, including anticyclonic warm-core eddy shedding in the GoM, forward and adjoint sensitivities with respect to previous model state and atmospheric forcing were computed using the MITgcm and its adjoint. Since the validity of the adjoint model sensitivities depends on the capability of the forward model to simulate the real LC system and the eddy shedding processes, a 5 year (2004-2008) forward model simulation was performed for the GoM using realistic atmospheric forcing, initial, and boundary conditions. This forward model simulation was compared to satellite measurements of sea-surface height (SSH) and sea-surface temperature (SST), and observed transport variability. Despite realistic mean state, standard deviations, and LC eddy shedding period, the simulated LC extension shows less variability and more regularity than the observations. However, the model is suitable for studying the LC system and can be utilized for examining the ocean influences leading to a simple, and hopefully generic LC eddy separation in the GoM. The adjoint sensitivities of the LC show influences from the Yucatan Channel (YC) flow and Loop Current Frontal Eddy (LCFE) on both LC extension and eddy separation, as suggested by earlier work. Some of the processes that control LC extension after eddy separation differ from those controlling eddy shedding, but include YC through-flow. The sensitivity remains stable for more than 30 days and moves generally upstream, entering the Caribbean Sea. The sensitivities of the LC for SST generally remain closer to the surface and move at speeds consistent with advection by the high-speed core of

  17. CMT Source Inversions for Massive Data Assimilation in Global Adjoint Tomography

    NASA Astrophysics Data System (ADS)

    Lei, W.; Ruan, Y.; Bozdag, E.; Lefebvre, M. P.; Smith, J. A.; Modrak, R. T.; Komatitsch, D.; Song, X.; Liu, Q.; Tromp, J.; Peter, D. B.

    2015-12-01

    Full Waveform Inversion (FWI) is a vital tool for probing the Earth's interior and enhancing our knowledge of the underlying dynamical processes [e.g., Liu et al., 2012]. Using the adjoint tomography method, we have successfully obtained a first-generation global FWI model named M15 [Bozdag et al., 2015]. To achieve higher resolution of the emerging new structural features and to accommodate azimuthal anisotropy and anelasticity in the next-generation model, we expanded our database from 256 to 4,224 earthquakes. Previous studies have shown that ray-theory-based Centroid Moment Tensor (CMT) inversion algorithms can produce systematic biases in earthquake source parameters due to tradeoffs with 3D crustal and mantle heterogeneity [e.g., Hjorleifsdottir et al., 2010]. To reduce these well-known tradeoffs, we performed CMT inversions in our current 3D global model before resuming the structural inversion with the expanded database. Initial source parameters are selected from the global CMT database [Ekstrom et al., 2012], with moment magnitudes ranging from 5.5 to 7.0 and occurring between 1994 and 2015. Data from global and regional networks were retrieved from the IRIS DMC. Synthetic seismograms were generated based on the spectral-element-based seismic wave propagation solver (SPECFEM3D GLOBE) in model M15. We used a source inversion algorithm based on a waveform misfit function while allowing time shifts between data and synthetics to accommodate additional unmodeled 3D heterogeneity [Liu et al., 2004]. To accommodate the large number of earthquakes and time series (more than 10,000,000 records), we implemented a source inversion workflow based on the newly developed Adaptive Seismic Data Format (ASDF) [Krischer, Smith, et al., 2015] and ObsPy [Krischer et al., 2015]. In ASDF, each earthquake is associated with a single file, thereby eliminating I/O bottlenecks in the workflow and facilitating fast parallel processing. Our preliminary results indicate that errors

  18. Global Adjoint Tomography: Combining Big Data with HPC Simulations

    NASA Astrophysics Data System (ADS)

    Bozdag, E.; Lefebvre, M. P.; Lei, W.; Peter, D. B.; Smith, J. A.; Komatitsch, D.; Tromp, J.

    2014-12-01

    The steady increase in data quality and the number of global seismographic stations have substantially grown the amount of data available for construction of Earth models. Meanwhile, developments in the theory of wave propagation, numerical methods and HPC systems have enabled unprecedented simulations of seismic wave propagation in realistic 3D Earth models which lead the extraction of more information from data, ultimately culminating in the use of entire three-component seismograms.Our aim is to take adjoint tomography further to image the entire planet which is one of the extreme cases in seismology due to its intense computational requirements and vast amount of high-quality seismic data that can potentially be assimilated in inversions. We have started low resolution (T > 27 s, soon will be > 17 s) global inversions with 253 earthquakes for a transversely isotropic crust and mantle model on Oak Ridge National Laboratory's Cray XK7 "Titan" system. Recent improvements in our 3D solvers, such as the GPU version of the SPECFEM3D_GLOBE package, will allow us perform higher-resolution (T > 9 s) and longer-duration (~180 m) simulations to take the advantage of high-frequency body waves and major-arc surface waves to improve imbalanced ray coverage as a result of uneven distribution of sources and receivers on the globe. Our initial results after 10 iterations already indicate several prominent features reported in high-resolution continental studies, such as major slabs (Hellenic, Japan, Bismarck, Sandwich, etc.) and enhancement in plume structures (the Pacific superplume, the Hawaii hot spot, etc.). Our ultimate goal is to assimilate seismic data from more than 6,000 earthquakes within the magnitude range 5.5 ≤ Mw ≤ 7.0. To take full advantage of this data set on ORNL's computational resources, we need a solid framework for managing big data sets during pre-processing (e.g., data requests and quality checks), gradient calculations, and post-processing (e

  19. Modifying Cadzow's algorithm to generate the optimal TLS-solution for the structured EIV-Model of a similarity transformation

    NASA Astrophysics Data System (ADS)

    Schaffrin, B.; Neitzel, F.; Uzun, S.; Mahboub, V.

    2012-01-01

    In 2005, Felus and Schaffrin discussed the problem of a Structured Errors-in-Variables (EIV) Model in the context of a parameter adjustment for a classical similarity transformation. Their proposal, however, to perform a Total Least-Squares (TLS) adjustment, followed by a Cadzow step to imprint the proper structure, would not always guarantee the identity of this solution with the optimal Structured TLS solution, particularly in view of the residuals. Here, an attempt will be made to modify the Cadzow step in order to generate the optimal solution with the desired structure as it would, for instance, also result from a traditional LS-adjustment within an iteratively linearized Gauss-Helmert Model (GHM). Incidentally, this solution coincides with the (properly) Weighted TLS solution which does not need a Cadzow step.

  20. The truncated Newton using 1st and 2nd order adjoint-state method: a new approach for traveltime tomography without rays

    NASA Astrophysics Data System (ADS)

    Bretaudeau, F.; Metivier, L.; Brossier, R.; Virieux, J.

    2013-12-01

    Traveltime tomography algorithms generally use ray tracing. The use of rays in tomography may not be suitable for handling very large datasets and perform tomography in very complex media. Traveltime maps can be computed through finite-difference approach (FD) and avoid complex ray-tracing algorithm for the forward modeling (Vidale 1998, Zhao 2004). However, rays back-traced from receiver to source following the gradient of traveltime are still used to compute the Fréchet derivatives. As a consequence, the sensitivity information computed using back-traced rays is not numerically consistent with the FD modeling used (the derivatives are only a rough approximation of the true derivatives of the forward modeling). Leung & Quian (2006) proposed a new approach that avoid ray tracing where the gradient of the misfit function is computed using the adjoint-state method. An adjoint-state variable is thus computed simultaneously for all receivers using a numerical method consistent with the forward modeling, and for the computational cost of one forward modeling. However, in their formulation, the receivers have to be located at the boundary of the investigated model, and the optimization approach is limited to simple gradient-based method (i.e. steepest descent, conjugate gradient) as only the gradient is computed. However, the Hessian operator has an important role in gradient-based reconstruction methods, providing the necessary information to rescale the gradient, correct for illumination deficit and remove artifacts. Leung & Quian (2006) uses LBFGS, a quasi-Newton method that provides an improved estimation of the influence of the inverse Hessian. Lelievre et al. (2011) also proposed a tomography approach in which the Fréchet derivatives are computed directly during the forward modeling using explicit symbolic differentiation of the modeling equations, resulting in a consistent Gauss-Newton inversion. We are interested here in the use of a new optimization approach

  1. An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.

    PubMed

    Deb, Kalyanmoy; Sinha, Ankur

    2010-01-01

    Bilevel optimization problems involve two optimization tasks (upper and lower level), in which every feasible upper level solution must correspond to an optimal solution to a lower level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy developments, transportation problems, and others. However, they are commonly converted into a single level optimization problem by using an approximate solution procedure to replace the lower level optimization task. Although there exist a number of theoretical, numerical, and evolutionary optimization studies involving single-objective bilevel programming problems, not many studies look at the context of multiple conflicting objectives in each level of a bilevel programming problem. In this paper, we address certain intricate issues related to solving multi-objective bilevel programming problems, present challenging test problems, and propose a viable and hybrid evolutionary-cum-local-search based algorithm as a solution methodology. The hybrid approach performs better than a number of existing methodologies and scales well up to 40-variable difficult test problems used in this study. The population sizing and termination criteria are made self-adaptive, so that no additional parameters need to be supplied by the user. The study indicates a clear niche of evolutionary algorithms in solving such difficult problems of practical importance compared to their usual solution by a computationally expensive nested procedure. The study opens up many issues related to multi-objective bilevel programming and hopefully this study will motivate EMO and other researchers to pay more attention to this important and difficult problem solving activity.

  2. Towards magnetic sounding of the Earth's core by an adjoint method

    NASA Astrophysics Data System (ADS)

    Li, K.; Jackson, A.; Livermore, P. W.

    2013-12-01

    Earth's magnetic field is generated and sustained by the so called geodynamo system in the core. Measurements of the geomagnetic field taken at the surface, downwards continued through the electrically insulating mantle to the core-mantle boundary (CMB), provide important constraints on the time evolution of the velocity, magnetic field and temperature anomaly in the fluid outer core. The aim of any study in data assimilation applied to the Earth's core is to produce a time-dependent model consistent with these observations [1]. Snapshots of these ``tuned" models provide a window through which the inner workings of the Earth's core, usually hidden from view, can be probed. We apply a variational data assimilation framework to an inertia-free magnetohydrodynamic system (MHD) [2]. Such a model is close to magnetostrophic balance [3], to which we have added viscosity to the dominant forces of Coriolis, pressure, Lorentz and buoyancy, believed to be a good approximation of the Earth's dynamo in the convective time scale. We chose to study the MHD system driven by a static temperature anomaly to mimic the actual inner working of Earth's dynamo system, avoiding at this stage the further complication of solving for the time dependent temperature field. At the heart of the models is a time-dependent magnetic field to which the core-flow is enslaved. In previous work we laid the foundation of the adjoint methodology, applied to a subset of the full equations [4]. As an intermediate step towards our ultimate vision of applying the techniques to a fully dynamic mode of the Earth's core tuned to geomagnetic observations, we present the intermediate step of applying the adjoint technique to the inertia-free Navier-Stokes equation in continuous form. We use synthetic observations derived from evolving a geophysically-reasonable magnetic field profile as the initial condition of our MHD system. Based on our study, we also propose several different strategies for accurately

  3. A Coupled-Adjoint Method for High-Fidelity Aero-Structural Optimization

    DTIC Science & Technology

    2002-10-01

    geometry engine, and an efficient gradient-based optimization algorithm. The aero-structural solver ensures accurate solutions by using high-fidelity...22 2.3.1 Geometry Engine and Database . . . . . . . . . . . . . . . . . . . . . 23 2.3.2 Displacement Transfer...86 5-6 Airfoil geometry at the root. . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 5-7 Airfoil geometry at mid semi-span

  4. A new raytracing algorithm to compute slant total delays in a mesoscale atmospheric model

    NASA Astrophysics Data System (ADS)

    Zus, Florian; Bender, Michael; Dick, Galina; Deng, Zhiguo; Heise, Stefan; Wickert, Jens

    2010-05-01

    Ray-tracing is essential to accurately simulate Global Positioning System (GPS) Slant Total Delays (STD) in a mesoscale atmospheric model. A rigorous ray-tracing algorithm based on Fermat's principle was developed to simulate the propagation of radio signals in a gridded 3D refractivity field. The unique in the proposed algorithm is that the solution automatically involves the exact location of the receiver and the satellite, i.e. 'shooting' is not required. The structured non-linear system of equations, arising due to the applied finite difference scheme, is solved by Newton's iteration. For elevation angles as low as 5 degree at a ground-based receiver a single Newton iteration turns out to be sufficient. Subsequently the algorithm allows us to simulate about 1500 STDs per second on a single CPU. Having developed the forward operator for STDs, we constructed the tangent linear and adjoint code for sensitivity and variational data analysis. First results from three potential applications of the proposed ray-tracing algorithm are presented: (1) monitoring STD data processed at the GFZ Potsdam against European Centre for Medium-Range Weather Forecasts (ECMWF) analysis, (2) vertical profiling, i.e. the retrieval of the refractivity profile above a ground based receiver from the STD data by using a least square adjustment, and (3) direct mapping.

  5. Analysis of Correlated Coupling of Monte Carlo Forward and Adjoint Histories

    SciTech Connect

    Ueki, Taro; Hoogenboom, J.E.; Kloosterman, J. L.

    2001-02-15

    In Monte Carlo correlated coupling, forward and adjoint particle histories are initiated in exactly opposite directions at an arbitrarily placed surface between a physical source and a physical detector. It is shown that this coupling calculation can become more efficient than standard forward calculations. In many cases, the basic form of correlated coupling is less efficient than standard forward calculations. This inherent inefficiency can be overcome by applying a black absorber perturbation to either the forward or the adjoint problem and by processing the product of batch averages as one statistical entity. The usage of the black absorber is based on the invariance of the response flow integral with a material perturbation in either the physical detector side volume in the forward problem or the physical source side volume in the adjoint problem. The batch-average product processing makes use of a quadratic increase of the nonzero coupled-score probability. All the developments have been done in such a way that improved efficiency schemes available in widely distributed Monte Carlo codes can be applied to both the forward and adjoint simulations. Also, the physical meaning of the black absorber perturbation is interpreted based on surface crossing and is numerically validated. In addition, the immediate reflection at the intermediate surface with a controlled direction change is investigated within the invariance framework. This approach can be advantageous for a void streaming problem.

  6. Application of non-self-adjoint operators for description of electronic excitations in metallic lithium

    SciTech Connect

    Popov, A. V.

    2016-01-15

    Metallic lithium is used to demonstrate the possibilities of applying non-self-adjoint operators for quantitative description of orbital excitations of electrons in crystals. It is shown that, the nonequilibrium distribution function can be calculated when solving the spectral problem; therefore, the kinetic properties of a material can also be described with the unified band theory.

  7. Sensitivity analysis of a model of CO2 exchange in tundra ecosystems by the adjoint method

    SciTech Connect

    Waelbroek, C.; Louis, J.F. |

    1995-02-01

    A model of net primary production (NPP), decomposition, and nitrogen cycling in tundra ecosystems has been developed. The adjoint technique is used to study the sensitivity of the computed annual net CO2 flux to perturbation in initial conditions, climatic inputs, and model`s main parameters describing current seasonal CO2 exchange in wet sedge tundra at Barrow, Alaska. The results show that net CO2 flux is most sensitive to parameters characterizing litter chemical composition and more sensitive to decomposition parameters than to NPP parameters. This underlines the fact that in nutrient-limited ecosystems, decomposition drives net CO2 exchange by controlling mineralization of main nutrients. The results also indicate that the short-term (1 year) response of wet sedge tundra to CO2-induced warming is a significant increase in CO2 emission, creating a positive feedback to atmosphreic CO2 accumulation. However, a cloudiness increase during the same year can severely alter this response and lead to either a slight decrease or a strong increase in emitted CO2, depending on its exact timing. These results demonstrate that the adjoint method is well suited to study systems encountering regime changes, as a single run of the adjoint model provides sensitivities of the net CO2 flux to perturbations in all parameters and variables at any time of the year. Moreover, it is shown that large errors due to the presence of thresholds can be avoided by first delimiting the range of applicability of the adjoint results.

  8. Two-Point Boundary Value Problems and the Method of Adjoints.

    ERIC Educational Resources Information Center

    Fay, Temple H.; Miller, H. Vincent

    1990-01-01

    Discusses a numerical technique called the method of adjoints, turning a linear two-point boundary value problem into an initial value problem. Described are steps for using the method in linear or nonlinear systems. Applies the technique to solve a simple pendulum problem. Lists 15 references. (YP)

  9. 3-D crustal and uppermost mantle structure beneath NE China revealed by ambient noise adjoint tomography

    NASA Astrophysics Data System (ADS)

    Liu, Yaning; Niu, Fenglin; Chen, Min; Yang, Wencai

    2017-03-01

    We construct a new 3-D shear wave speed model of the crust and the uppermost mantle beneath Northeast China using the ambient noise adjoint tomography method. Without intermediate steps of measuring phase dispersion, the adjoint tomography inverts for shear wave speeds of the crust and uppermost mantle directly from 6-40 s waveforms of Empirical Green's functions (EGFs) of Rayleigh waves, which are derived from interferometry of two years of ambient noise data recorded by the 127 Northeast China Extended Seismic Array stations. With an initial 3-D model derived from traditional asymptotic surface wave tomography method, adjoint tomography refines the 3-D model by iteratively minimizing the frequency-dependent traveltime misfits between EGFs and synthetic Green's functions measured in four period bands: 6-15 s, 10-20 s, 15-30 s, and 20-40 s. Our new model shows shear wave speed anomalies that are spatially correlated with known tectonic units such as the Great Xing'an range and the Changbaishan mountain range. The new model also reveals low wave speed conduits in the mid-lower crust and the uppermost mantle with a wave speed reduction indicative of partial melting beneath the Halaha, Xilinhot-Abaga, and Jingpohu volcanic complexes, suggesting that the Cenozoic volcanism in the area has a deep origin. Overall, the adjoint tomographic images show more vertically continuous velocity anomalies with larger amplitudes due to the consideration of the finite frequency and 3-D effects.

  10. Use of an adjoint model for finding triggers for Alpine lee cyclogenesis

    NASA Technical Reports Server (NTRS)

    Vukicevic, Tomislava; Raeder, Kevin

    1995-01-01

    The authors propose a new procedure, designated the adjoint-based genesis diagnostic (AGD) procedure, for studying triggering mechanisms and the subsequent genesis of the synoptic phenomena of interest. This procedure makes use of a numerical model sensitivity to initial conditions and the nonlinear evolution of the initial perturbations that are designed using this sensitivity. The model sensitivity is evaluated using the associated adjoint model. This study uses the dry version of the National Center for Atmospheric Research Mesoscale Adjoint Modeling System (MAMS) for the numerical experiments. The authors apply the AGD procedure to two cases of Alpine lee cyclogenesis that were observed during the Alpine Experiment special observations period. The results show that the sensitivity fields that are produced by the adjoint model and the associated initial perturbations are readily related to the probable triggering mechanisms for these cyclones. Additionally, the nonlinear evolution of these initial perturbations points toward the physical processes involved in the lee cyclone formation. The AGD experiments for a weak cyclone case indicate that the MAMS forecast model has an underrepresented topographic forcing due to the sigma vertical coordinate and that this model error can be compensated by adjustments in the initial conditions that are related to the triggering mechanisms, which is not associated with the topographic blocking mechanism.

  11. Sensitivity analysis of a model of CO2 exchange in tundra ecosystems by the adjoint method

    NASA Technical Reports Server (NTRS)

    Waelbroek, C.; Louis, J.-F.

    1995-01-01

    A model of net primary production (NPP), decomposition, and nitrogen cycling in tundra ecosystems has been developed. The adjoint technique is used to study the sensitivity of the computed annual net CO2 flux to perturbation in initial conditions, climatic inputs, and model's main parameters describing current seasonal CO2 exchange in wet sedge tundra at Barrow, Alaska. The results show that net CO2 flux is most sensitive to parameters characterizing litter chemical composition and more sensitive to decomposition parameters than to NPP parameters. This underlines the fact that in nutrient-limited ecosystems, decomposition drives net CO2 exchange by controlling mineralization of main nutrients. The results also indicate that the short-term (1 year) response of wet sedge tundra to CO2-induced warming is a significant increase in CO2 emission, creating a positive feedback to atmosphreic CO2 accumulation. However, a cloudiness increase during the same year can severely alter this response and lead to either a slight decrease or a strong increase in emitted CO2, depending on its exact timing. These results demonstrate that the adjoint method is well suited to study systems encountering regime changes, as a single run of the adjoint model provides sensitivities of the net CO2 flux to perturbations in all parameters and variables at any time of the year. Moreover, it is shown that large errors due to the presence of thresholds can be avoided by first delimiting the range of applicability of the adjoint results.

  12. Using adjoint-based optimization to study wing flexibility in flapping flight

    NASA Astrophysics Data System (ADS)

    Wei, Mingjun; Xu, Min; Dong, Haibo

    2014-11-01

    In the study of flapping-wing flight of birds and insects, it is important to understand the impact of wing flexibility/deformation on aerodynamic performance. However, the large control space from the complexity of wing deformation and kinematics makes usual parametric study very difficult or sometimes impossible. Since the adjoint-based approach for sensitivity study and optimization strategy is a process with its cost independent of the number of input parameters, it becomes an attractive approach in our study. Traditionally, adjoint equation and sensitivity are derived in a fluid domain with fixed solid boundaries. Moving boundary is only allowed when its motion is not part of control effort. Otherwise, the derivation becomes either problematic or too complex to be feasible. Using non-cylindrical calculus to deal with boundary deformation solves this problem in a very simple and still mathematically rigorous manner. Thus, it allows to apply adjoint-based optimization in the study of flapping wing flexibility. We applied the ``improved'' adjoint-based method to study the flexibility of both two-dimensional and three-dimensional flapping wings, where the flapping trajectory and deformation are described by either model functions or real data from the flight of dragonflies. Supported by AFOSR.

  13. Second Order of Accuracy Stable Difference Schemes for Hyperbolic Problems Subject to Nonlocal Conditions with Self-Adjoint Operator

    NASA Astrophysics Data System (ADS)

    Ashyralyev, Allaberen; Yildirim, Ozgur

    2011-09-01

    In the present paper, two new second order of accuracy absolutely stable difference schemes are presented for the nonlocal boundary value problem {d2u(t)/dt2+Au(t) = f(t) (0≤t≤1),u(0) = ∑ j = 1nαju(λj)+φ,ut(0) = ∑ j = 1nβjut(λj)+ψ,0<λ1<λ2<…<λn≤1 for differential equations in a Hilbert space H with the self-adjoint positive definite operator A. The stability estimates for the solutions of these difference schemes are established. In practice, one-dimensional hyperbolic equation with nonlocal boundary conditions and multidimensional hyperbolic equation with Dirichlet conditions are considered. The stability estimates for the solutions of difference schemes for the nonlocal boundary value hyperbolic problems are obtained and the numerical results are presented to support our theoretical statements.

  14. Modeling Design Iteration in Product Design and Development and Its Solution by a Novel Artificial Bee Colony Algorithm

    PubMed Central

    2014-01-01

    Due to fierce market competition, how to improve product quality and reduce development cost determines the core competitiveness of enterprises. However, design iteration generally causes increases of product cost and delays of development time as well, so how to identify and model couplings among tasks in product design and development has become an important issue for enterprises to settle. In this paper, the shortcomings existing in WTM model are discussed and tearing approach as well as inner iteration method is used to complement the classic WTM model. In addition, the ABC algorithm is also introduced to find out the optimal decoupling schemes. In this paper, firstly, tearing approach and inner iteration method are analyzed for solving coupled sets. Secondly, a hybrid iteration model combining these two technologies is set up. Thirdly, a high-performance swarm intelligence algorithm, artificial bee colony, is adopted to realize problem-solving. Finally, an engineering design of a chemical processing system is given in order to verify its reasonability and effectiveness. PMID:25431584

  15. Modeling design iteration in product design and development and its solution by a novel artificial bee colony algorithm.

    PubMed

    Chen, Tinggui; Xiao, Renbin

    2014-01-01

    Due to fierce market competition, how to improve product quality and reduce development cost determines the core competitiveness of enterprises. However, design iteration generally causes increases of product cost and delays of development time as well, so how to identify and model couplings among tasks in product design and development has become an important issue for enterprises to settle. In this paper, the shortcomings existing in WTM model are discussed and tearing approach as well as inner iteration method is used to complement the classic WTM model. In addition, the ABC algorithm is also introduced to find out the optimal decoupling schemes. In this paper, firstly, tearing approach and inner iteration method are analyzed for solving coupled sets. Secondly, a hybrid iteration model combining these two technologies is set up. Thirdly, a high-performance swarm intelligence algorithm, artificial bee colony, is adopted to realize problem-solving. Finally, an engineering design of a chemical processing system is given in order to verify its reasonability and effectiveness.

  16. Finite Element Solution of a Self-Adjoint Transport Equation in One Dimension.

    DTIC Science & Technology

    1984-03-01

    8217STREAM’/ DATA BUGEI (6) /’ABSORB’/ DATA BUGEM(7) /’SCATI ’/ DATA BUGEM(8) /’SCAT2 𔃻 DATA BUGEM(9) /’SCAT3 ’/ DATA BUGEN(10) /’CASEDT’/ DATA BUGEM

  17. Simultaneous analysis of large INTEGRAL/SPI1 datasets: Optimizing the computation of the solution and its variance using sparse matrix algorithms

    NASA Astrophysics Data System (ADS)

    Bouchet, L.; Amestoy, P.; Buttari, A.; Rouet, F.-H.; Chauvin, M.

    2013-02-01

    Nowadays, analyzing and reducing the ever larger astronomical datasets is becoming a crucial challenge, especially for long cumulated observation times. The INTEGRAL/SPI X/γ-ray spectrometer is an instrument for which it is essential to process many exposures at the same time in order to increase the low signal-to-noise ratio of the weakest sources. In this context, the conventional methods for data reduction are inefficient and sometimes not feasible at all. Processing several years of data simultaneously requires computing not only the solution of a large system of equations, but also the associated uncertainties. We aim at reducing the computation time and the memory usage. Since the SPI transfer function is sparse, we have used some popular methods for the solution of large sparse linear systems; we briefly review these methods. We use the Multifrontal Massively Parallel Solver (MUMPS) to compute the solution of the system of equations. We also need to compute the variance of the solution, which amounts to computing selected entries of the inverse of the sparse matrix corresponding to our linear system. This can be achieved through one of the latest features of the MUMPS software that has been partly motivated by this work. In this paper we provide a brief presentation of this feature and evaluate its effectiveness on astrophysical problems requiring the processing of large datasets simultaneously, such as the study of the entire emission of the Galaxy. We used these algorithms to solve the large sparse systems arising from SPI data processing and to obtain both their solutions and the associated variances. In conclusion, thanks to these newly developed tools, processing large datasets arising from SPI is now feasible with both a reasonable execution time and a low memory usage.

  18. Adjoint-based sensitivity analysis for high-energy density radiative transfer using flux-limited diffusion

    NASA Astrophysics Data System (ADS)

    Humbird, Kelli D.; McClarren, Ryan G.

    2017-03-01

    Uncertainty quantification and sensitivity analyses are a vital component for predictive modeling in the sciences and engineering. The adjoint approach to sensitivity analysis requires solving a primary system of equations and a mathematically related set of adjoint equations. The information contained in the equations can be combined to produce sensitivity information in a computationally efficient manner. In this work, sensitivity analyses are performed on systems described by flux-limited radiative diffusion using the adjoint approach. The sensitivities computed are shown to agree with standard perturbation theory and require significantly less computational time. The adjoint approach saves the computational cost of one forward solve per sensitivity, making the method attractive when multiple sensitivities are of interest.

  19. Efficient Construction of Discrete Adjoint Operators on Unstructured Grids by Using Complex Variables

    NASA Technical Reports Server (NTRS)

    Nielsen, Eric J.; Kleb, William L.

    2005-01-01

    A methodology is developed and implemented to mitigate the lengthy software development cycle typically associated with constructing a discrete adjoint solver for aerodynamic simulations. The approach is based on a complex-variable formulation that enables straightforward differentiation of complicated real-valued functions. An automated scripting process is used to create the complex-variable form of the set of discrete equations. An efficient method for assembling the residual and cost function linearizations is developed. The accuracy of the implementation is verified through comparisons with a discrete direct method as well as a previously developed handcoded discrete adjoint approach. Comparisons are also shown for a large-scale configuration to establish the computational efficiency of the present scheme. To ultimately demonstrate the power of the approach, the implementation is extended to high temperature gas flows in chemical nonequilibrium. Finally, several fruitful research and development avenues enabled by the current work are suggested.

  20. Efficient Construction of Discrete Adjoint Operators on Unstructured Grids Using Complex Variables

    NASA Technical Reports Server (NTRS)

    Nielsen, Eric J.; Kleb, William L.

    2005-01-01

    A methodology is developed and implemented to mitigate the lengthy software development cycle typically associated with constructing a discrete adjoint solver for aerodynamic simulations. The approach is based on a complex-variable formulation that enables straightforward differentiation of complicated real-valued functions. An automated scripting process is used to create the complex-variable form of the set of discrete equations. An efficient method for assembling the residual and cost function linearizations is developed. The accuracy of the implementation is verified through comparisons with a discrete direct method as well as a previously developed handcoded discrete adjoint approach. Comparisons are also shown for a large-scale configuration to establish the computational efficiency of the present scheme. To ultimately demonstrate the power of the approach, the implementation is extended to high temperature gas flows in chemical nonequilibrium. Finally, several fruitful research and development avenues enabled by the current work are suggested.

  1. Application of Adjoint Methodology to Supersonic Aircraft Design Using Reversed Equivalent Areas

    NASA Technical Reports Server (NTRS)

    Rallabhandi, Sriram K.

    2013-01-01

    This paper presents an approach to shape an aircraft to equivalent area based objectives using the discrete adjoint approach. Equivalent areas can be obtained either using reversed augmented Burgers equation or direct conversion of off-body pressures into equivalent area. Formal coupling with CFD allows computation of sensitivities of equivalent area objectives with respect to aircraft shape parameters. The exactness of the adjoint sensitivities is verified against derivatives obtained using the complex step approach. This methodology has the benefit of using designer-friendly equivalent areas in the shape design of low-boom aircraft. Shape optimization results with equivalent area cost functionals are discussed and further refined using ground loudness based objectives.

  2. A Low-Order Galerkin Model Based on DMD and Adjoint-DMD modes

    NASA Astrophysics Data System (ADS)

    Zhang, Wei; Wei, Mingjun

    2016-11-01

    Dynamic Mode Decomposition (DMD) has emerged as a new tool for the understanding of flow dynamics associated with frequencies. The DMD modes computed by this process have been considered as an alternative of base functions for model order reduction. However, DMD modes are not orthogonal bases which are usually desired for the simplicity of Galerkin models. Therefore, we used the bi-orthogonal pair of DMD modes and adjoint DMD modes to solve this problem, and introduced an easy approach to derive a simple DMD-Galerkin projection model. The introduction of adjoint DMD modes also provides an easy way to rank DMD modes for order reduction. The approach is applied on a flow-passing-cylinder case in both transition and periodic stages. For the periodic case, DMD-Galerkin model is similar to POD-Galerkin model; and for the transition case, DMD-Galerkin model carries more clear frequency features. Supported by ARL.

  3. Second-order adjoint sensitivity analysis methodology (2nd-ASAM) for computing exactly and efficiently first- and second-order sensitivities in large-scale linear systems: II. Illustrative application to a paradigm particle diffusion problem

    NASA Astrophysics Data System (ADS)

    Cacuci, Dan G.

    2015-03-01

    This work presents an illustrative application of the second-order adjoint sensitivity analysis methodology (2nd-ASAM) to a paradigm neutron diffusion problem, which is sufficiently simple to admit an exact solution, thereby making transparent the underlying mathematical derivations. The general theory underlying 2nd-ASAM indicates that, for a physical system comprising Nα parameters, the computation of all of the first- and second-order response sensitivities requires (per response) at most (2Nα + 1) "large-scale" computations using the first-level and, respectively, second-level adjoint sensitivity systems (1st-LASS and 2nd-LASS). Very importantly, however, the illustrative application presented in this work shows that the actual number of adjoint computations needed for computing all of the first- and second-order response sensitivities may be significantly less than (2Nα + 1) per response. For this illustrative problem, four "large-scale" adjoint computations sufficed for the complete and exact computations of all 4 first- and 10 distinct second-order derivatives. Furthermore, the construction and solution of the 2nd-LASS requires very little additional effort beyond the construction of the adjoint sensitivity system needed for computing the first-order sensitivities. Very significantly, only the sources on the right-sides of the diffusion (differential) operator needed to be modified; the left-side of the differential equations (and hence the "solver" in large-scale practical applications) remained unchanged. All of the first-order relative response sensitivities to the model parameters have significantly large values, of order unity. Also importantly, most of the second-order relative sensitivities are just as large, and some even up to twice as large as the first-order sensitivities. In the illustrative example presented in this work, the second-order sensitivities contribute little to the response variances and covariances. However, they have the

  4. In Silico Calculation of Infinite Dilution Activity Coefficients of Molecular Solutes in Ionic Liquids: Critical Review of Current Methods and New Models Based on Three Machine Learning Algorithms.

    PubMed

    Paduszyński, Kamil

    2016-08-22

    The aim of the paper is to address all the disadvantages of currently available models for calculating infinite dilution activity coefficients (γ(∞)) of molecular solutes in ionic liquids (ILs)-a relevant property from the point of view of many applications of ILs, particularly in separations. Three new models are proposed, each of them based on distinct machine learning algorithm: stepwise multiple linear regression (SWMLR), feed-forward artificial neural network (FFANN), and least-squares support vector machine (LSSVM). The models were established based on the most comprehensive γ(∞) data bank reported so far (>34 000 data points for 188 ILs and 128 solutes). Following the paper published previously [J. Chem. Inf. Model 2014, 54, 1311-1324], the ILs were treated in terms of group contributions, whereas the Abraham solvation parameters were used to quantify an impact of solute structure. Temperature is also included in the input data of the models so that they can be utilized to obtain temperature-dependent data and thus related thermodynamic functions. Both internal and external validation techniques were applied to assess the statistical significance and explanatory power of the final correlations. A comparative study of the overall performance of the investigated SWMLR/FFANN/LSSVM approaches is presented in terms of root-mean-square error and average absolute relative deviation between calculated and experimental γ(∞), evaluated for different families of ILs and solutes, as well as between calculated and experimental infinite dilution selectivity for separation problems benzene from n-hexane and thiophene from n-heptane. LSSVM is shown to be a method with the lowest values of both training and generalization errors. It is finally demonstrated that the established models exhibit an improved accuracy compared to the state-of-the-art model, namely, temperature-dependent group contribution linear solvation energy relationship, published in 2011 [J. Chem

  5. Seismic wave-speed structure beneath the metropolitan area of Japan based on adjoint tomography

    NASA Astrophysics Data System (ADS)

    Miyoshi, T.; Obayashi, M.; Tono, Y.; Tsuboi, S.

    2015-12-01

    We have obtained a three-dimensional (3D) model of seismic wave-speed structure beneath the metropolitan area of Japan. We applied the spectral-element method (e.g. Komatitsch and Tromp 1999) and adjoint method (Liu and Tromp 2006) to the broadband seismograms in order to infer the 3D model. We used the travel-time tomography result (Matsubara and Obara 2011) as an initial 3D model and used broadband waveforms recorded at the NIED F-net stations. We selected 147 earthquakes with magnitude of larger than 4.5 from the F-net earthquake catalog and used their bandpass filtered seismograms between 5 and 20 second with a high S/N ratio. The 3D model used for the forward and adjoint simulations is represented as a region of approximately 500 by 450 km in horizontal and 120 km in depth. Minimum period of theoretical waveforms was 4.35 second. For the adjoint inversion, we picked up the windows of the body waves from the observed and theoretical seismograms. We used SPECFEM3D_Cartesian code (e.g. Peter et al. 2011) for the forward and adjoint simulations, and their simulations were implemented by K-computer in RIKEN. Each iteration required about 0.1 million CPU hours at least. The model parameters of Vp and Vs were updated by using the steepest descent method. We obtained the fourth iterative model (M04), which reproduced observed waveforms better than the initial model. The shear wave-speed of M04 was significantly smaller than the initial model at any depth. The model of compressional wave-speed was not improved by inversion because of small alpha kernel values. Acknowledgements: This research was partly supported by MEXT Strategic Program for Innovative Research. We thank to the NIED for providing seismological data.

  6. Estimating the time evolution of the geoid: An application of the adjoint method in global mantle circulation models

    NASA Astrophysics Data System (ADS)

    Horbach, A.; Bunge, H.-P.

    2012-04-01

    Forward simulations of mantle circulation processes in the Earth's interior suffer from the problem of an unknown initial condition, that is the temperature distribution of the past is not known a-priori. With the help of the adjoint method (Bunge (2003)), we are able to determine an optimal initial condition iteratively, given a temperature model of the present time. Here we use an s-wave tomography (Grand (1997)) as the estimator for present-day Earth structure. The seismic model is converted into temperature using a published self-consistent mineralogical model (Piazzoni (2007)), allowing us to constrain a time series of mantle flow consistent with the present-day estimator for the past 40 Myrs. Temperature fluctuations initiate density anomalies, which in turn influence the Earth's external gravitational field. Gravity provides an important constraint for geodynamic modelling. We find a very high correlation of our model geoid for the present time to current satellite derived geoid solutions. Furthermore, our models of paleo circulation allow us to determine time-series of the geoid for the past 40 Ma. Some remarkable geodynamic features can be recognized from our proof-of-concept models, especially the sinking of the Farallon and the Tethys slab through the Earth's mantle, and their associated effects on past topography and geoid.

  7. Algorithm development

    NASA Technical Reports Server (NTRS)

    Barth, Timothy J.; Lomax, Harvard

    1987-01-01

    The past decade has seen considerable activity in algorithm development for the Navier-Stokes equations. This has resulted in a wide variety of useful new techniques. Some examples for the numerical solution of the Navier-Stokes equations are presented, divided into two parts. One is devoted to the incompressible Navier-Stokes equations, and the other to the compressible form.

  8. Approximation algorithms

    PubMed Central

    Schulz, Andreas S.; Shmoys, David B.; Williamson, David P.

    1997-01-01

    Increasing global competition, rapidly changing markets, and greater consumer awareness have altered the way in which corporations do business. To become more efficient, many industries have sought to model some operational aspects by gigantic optimization problems. It is not atypical to encounter models that capture 106 separate “yes” or “no” decisions to be made. Although one could, in principle, try all 2106 possible solutions to find the optimal one, such a method would be impractically slow. Unfortunately, for most of these models, no algorithms are known that find optimal solutions with reasonable computation times. Typically, industry must rely on solutions of unguaranteed quality that are constructed in an ad hoc manner. Fortunately, for some of these models there are good approximation algorithms: algorithms that produce solutions quickly that are provably close to optimal. Over the past 6 years, there has been a sequence of major breakthroughs in our understanding of the design of approximation algorithms and of limits to obtaining such performance guarantees; this area has been one of the most flourishing areas of discrete mathematics and theoretical computer science. PMID:9370525

  9. Neural network training by integration of adjoint systems of equations forward in time

    NASA Technical Reports Server (NTRS)

    Toomarian, Nikzad (Inventor); Barhen, Jacob (Inventor)

    1992-01-01

    A method and apparatus for supervised neural learning of time dependent trajectories exploits the concepts of adjoint operators to enable computation of the gradient of an objective functional with respect to the various parameters of the network architecture in a highly efficient manner. Specifically, it combines the advantage of dramatic reductions in computational complexity inherent in adjoint methods with the ability to solve two adjoint systems of equations together forward in time. Not only is a large amount of computation and storage saved, but the handling of real-time applications becomes also possible. The invention has been applied it to two examples of representative complexity which have recently been analyzed in the open literature and demonstrated that a circular trajectory can be learned in approximately 200 iterations compared to the 12000 reported in the literature. A figure eight trajectory was achieved in under 500 iterations compared to 20000 previously required. The trajectories computed using our new method are much closer to the target trajectories than was reported in previous studies.

  10. Self-adjointness of the Fourier expansion of quantized interaction field Lagrangians

    PubMed Central

    Paneitz, S. M.; Segal, I. E.

    1983-01-01

    Regularity properties significantly stronger than were previously known are developed for four-dimensional non-linear conformally invariant quantized fields. The Fourier coefficients of the interaction Lagrangian in the interaction representation—i.e., evaluated after substitution of the associated quantized free field—is a densely defined operator on the associated free field Hilbert space K. These Fourier coefficients are with respect to a natural basis in the universal cosmos ˜M, to which such fields canonically and maximally extend from Minkowski space-time M0, which is covariantly a submanifold of ˜M. However, conformally invariant free fields over M0 and ˜M are canonically identifiable. The kth Fourier coefficient of the interaction Lagrangian has domain inclusive of all vectors in K to which arbitrary powers of the free hamiltonian in ˜M are applicable. Its adjoint in the rigorous Hilbert space sense is a-k in the case of a hermitian Lagrangian. In particular (k = 0) the leading term in the perturbative expansion of the S-matrix for a conformally invariant quantized field in M0 is a self-adjoint operator. Thus, e.g., if ϕ(x) denotes the free massless neutral scalar field in M0, then ∫M0:ϕ(x)4:d4x is a self-adjoint operator. No coupling constant renormalization is involved here. PMID:16593346

  11. Neural Network Training by Integration of Adjoint Systems of Equations Forward in Time

    NASA Technical Reports Server (NTRS)

    Toomarian, Nikzad (Inventor); Barhen, Jacob (Inventor)

    1999-01-01

    A method and apparatus for supervised neural learning of time dependent trajectories exploits the concepts of adjoint operators to enable computation of the gradient of an objective functional with respect to the various parameters of the network architecture in a highly efficient manner. Specifically. it combines the advantage of dramatic reductions in computational complexity inherent in adjoint methods with the ability to solve two adjoint systems of equations together forward in time. Not only is a large amount of computation and storage saved. but the handling of real-time applications becomes also possible. The invention has been applied it to two examples of representative complexity which have recently been analyzed in the open literature and demonstrated that a circular trajectory can be learned in approximately 200 iterations compared to the 12000 reported in the literature. A figure eight trajectory was achieved in under 500 iterations compared to 20000 previously required. Tbc trajectories computed using our new method are much closer to the target trajectories than was reported in previous studies.

  12. The forward sensitivity and adjoint-state methods of glacial isostatic adjustment

    NASA Astrophysics Data System (ADS)

    Martinec, Zdeněk; Sasgen, Ingo; Velímský, Jakub

    2015-01-01

    In this study, a new method for computing the sensitivity of the glacial isostatic adjustment (GIA) forward solution with respect to the Earth's mantle viscosity, the so-called the forward sensitivity method (FSM), and a method for computing the gradient of data misfit with respect to viscosity parameters, the so-called adjoint-state method (ASM), are presented. These advanced formal methods complement each other in the inverse modelling of GIA-related observations. When solving this inverse problem, the first step is to calculate the forward sensitivities by the FSM and use them to fix the model parameters that do not affect the forward model solution, as well as identifying and removing redundant parts of the inferred viscosity structure. Once the viscosity model is optimized in view of the forward sensitivities, the minimization of the data misfit with respect to the viscosity parameters can be carried out by a gradient technique which makes use of the ASM. The aim is this paper is to derive the FSM and ASM in the forms that are closely associated with the forward solver of GIA developed by Martinec. Since this method is based on a continuous form of the forward model equations, which are then discretized by spectral and finite elements, we first derive the continuous forms of the FSM and ASM and then discretize them by the spectral and finite elements used in the discretization of the forward model equations. The advantage of this approach is that all three methods (forward, FSM and ASM) have the same matrix of equations and use the same methodology for the implementation of the time evolution of stresses. The only difference between the forward method and the FSM and ASM is that the different numerical differencing schemes for the time evolution of the Maxwell and generalized Maxwell viscous stresses are applied in the respective methods. However, it requires only a little extra computational time for carrying out the FSM and ASM numerically. An

  13. Algorithms and Algorithmic Languages.

    ERIC Educational Resources Information Center

    Veselov, V. M.; Koprov, V. M.

    This paper is intended as an introduction to a number of problems connected with the description of algorithms and algorithmic languages, particularly the syntaxes and semantics of algorithmic languages. The terms "letter, word, alphabet" are defined and described. The concept of the algorithm is defined and the relation between the algorithm and…

  14. Between algorithm and model: different Molecular Surface definitions for the Poisson-Boltzmann based electrostatic characterization of biomolecules in solution.

    PubMed

    Decherchi, Sergio; Colmenares, José; Catalano, Chiara Eva; Spagnuolo, Michela; Alexov, Emil; Rocchia, Walter

    2013-01-01

    The definition of a molecular surface which is physically sound and computationally efficient is a very interesting and long standing problem in the implicit solvent continuum modeling of biomolecular systems as well as in the molecular graphics field. In this work, two molecular surfaces are evaluated with respect to their suitability for electrostatic computation as alternatives to the widely used Connolly-Richards surface: the blobby surface, an implicit Gaussian atom centered surface, and the skin surface. As figures of merit, we considered surface differentiability and surface area continuity with respect to atom positions, and the agreement with explicit solvent simulations. Geometric analysis seems to privilege the skin to the blobby surface, and points to an unexpected relationship between the non connectedness of the surface, caused by interstices in the solute volume, and the surface area dependence on atomic centers. In order to assess the ability to reproduce explicit solvent results, specific software tools have been developed to enable the use of the skin surface in Poisson-Boltzmann calculations with the DelPhi solver. Results indicate that the skin and Connolly surfaces have a comparable performance from this last point of view.

  15. Between algorithm and model: different Molecular Surface definitions for the Poisson-Boltzmann based electrostatic characterization of biomolecules in solution

    PubMed Central

    Decherchi, Sergio; Colmenares, José; Catalano, Chiara Eva; Spagnuolo, Michela; Alexov, Emil; Rocchia, Walter

    2011-01-01

    The definition of a molecular surface which is physically sound and computationally efficient is a very interesting and long standing problem in the implicit solvent continuum modeling of biomolecular systems as well as in the molecular graphics field. In this work, two molecular surfaces are evaluated with respect to their suitability for electrostatic computation as alternatives to the widely used Connolly-Richards surface: the blobby surface, an implicit Gaussian atom centered surface, and the skin surface. As figures of merit, we considered surface differentiability and surface area continuity with respect to atom positions, and the agreement with explicit solvent simulations. Geometric analysis seems to privilege the skin to the blobby surface, and points to an unexpected relationship between the non connectedness of the surface, caused by interstices in the solute volume, and the surface area dependence on atomic centers. In order to assess the ability to reproduce explicit solvent results, specific software tools have been developed to enable the use of the skin surface in Poisson-Boltzmann calculations with the DelPhi solver. Results indicate that the skin and Connolly surfaces have a comparable performance from this last point of view. PMID:23519863

  16. Investigating Sensitivity to Saharan Dust in Tropical Cyclone Formation Using Nasa's Adjoint Model

    NASA Technical Reports Server (NTRS)

    Holdaway, Daniel

    2015-01-01

    As tropical cyclones develop from easterly waves coming of the coast of Africa they interact with dust from the Sahara desert. There is a long standing debate over whether this dust inhibits or advances the developing storm and how much influence it has. Dust can surround the storm and absorb incoming solar radiation, cooling the air below. As a result an energy source for the system is potentially diminished, inhibiting growth of the storm. Alternatively dust may interact with clouds through micro-physical processes, for example by causing more moisture to condense, potentially increasing the strength. As a result of climate change, concentrations and amount of dust in the atmosphere will likely change. It it is important to properly understand its effect on tropical storm formation. The adjoint of an atmospheric general circulation model provides a very powerful tool for investigating sensitivity to initial conditions. The National Aeronautics and Space Administration (NASA) has recently developed an adjoint version of the Goddard Earth Observing System version 5 (GEOS-5) dynamical core, convection scheme, cloud model and radiation schemes. This is extended so that the interaction between dust and radiation is also accounted for in the adjoint model. This provides a framework for examining the sensitivity to dust in the initial conditions. Specifically the set up allows for an investigation into the extent to which dust affects cyclone strength through absorption of radiation. In this work we investigate the validity of using an adjoint model for examining sensitivity to dust in hurricane formation. We present sensitivity results for a number of systems that developed during the Atlantic hurricane season of 2006. During this period there was a significant outbreak of Saharan dust and it is has been argued that this outbreak was responsible for the relatively calm season. This period was also covered by an extensive observation campaign. It is shown that the

  17. Investigating sensitivity to Saharan dust in tropical cyclone formation using NASA's adjoint model

    NASA Astrophysics Data System (ADS)

    Holdaway, Daniel

    2015-04-01

    As tropical cyclones develop from easterly waves coming off the coast of Africa they interact with dust from the Sahara desert. There is a long standing debate over whether this dust inhibits or advances the developing storm and how much influence it has. Dust can surround the storm and absorb incoming solar radiation, cooling the air below. As a result an energy source for the system is potentially diminished, inhibiting growth of the storm. Alternatively dust may interact with clouds through micro-physical processes, for example by causing more moisture to condense, potentially increasing the strength. As a result of climate change, concentrations and amount of dust in the atmosphere will likely change. It it is important to properly understand its effect on tropical storm formation. The adjoint of an atmospheric general circulation model provides a very powerful tool for investigating sensitivity to initial conditions. The National Aeronautics and Space Administration (NASA) has recently developed an adjoint version of the Goddard Earth Observing System version 5 (GEOS-5) dynamical core, convection scheme, cloud model and radiation schemes. This is extended so that the interaction between dust and radiation is also accounted for in the adjoint model. This provides a framework for examining the sensitivity to dust in the initial conditions. Specifically the set up allows for an investigation into the extent to which dust affects cyclone strength through absorption of radiation. In this work we investigate the validity of using an adjoint model for examining sensitivity to dust in hurricane formation. We present sensitivity results for a number of systems that developed during the Atlantic hurricane season of 2006. During this period there was a significant outbreak of Saharan dust and it is has been argued that this outbreak was responsible for the relatively calm season. This period was also covered by an extensive observation campaign. It is shown that the

  18. Iterative solution of multiple radiation and scattering problems in structural acoustics using the BL-QMR algorithm

    SciTech Connect

    Malhotra, M.

    1996-12-31

    Finite-element discretizations of time-harmonic acoustic wave problems in exterior domains result in large sparse systems of linear equations with complex symmetric coefficient matrices. In many situations, these matrix problems need to be solved repeatedly for different right-hand sides, but with the same coefficient matrix. For instance, multiple right-hand sides arise in radiation problems due to multiple load cases, and also in scattering problems when multiple angles of incidence of an incoming plane wave need to be considered. In this talk, we discuss the iterative solution of multiple linear systems arising in radiation and scattering problems in structural acoustics by means of a complex symmetric variant of the BL-QMR method. First, we summarize the governing partial differential equations for time-harmonic structural acoustics, the finite-element discretization of these equations, and the resulting complex symmetric matrix problem. Next, we sketch the special version of BL-QMR method that exploits complex symmetry, and we describe the preconditioners we have used in conjunction with BL-QMR. Finally, we report some typical results of our extensive numerical tests to illustrate the typical convergence behavior of BL-QMR method for multiple radiation and scattering problems in structural acoustics, to identify appropriate preconditioners for these problems, and to demonstrate the importance of deflation in block Krylov-subspace methods. Our numerical results show that the multiple systems arising in structural acoustics can be solved very efficiently with the preconditioned BL-QMR method. In fact, for multiple systems with up to 40 and more different right-hand sides we get consistent and significant speed-ups over solving the systems individually.

  19. Gradient descent learning algorithm overview: a general dynamical systems perspective.

    PubMed

    Baldi, P

    1995-01-01

    Gives a unified treatment of gradient descent learning algorithms for neural networks using a general framework of dynamical systems. This general approach organizes and simplifies all the known algorithms and results which have been originally derived for different problems (fixed point/trajectory learning), for different models (discrete/continuous), for different architectures (forward/recurrent), and using different techniques (backpropagation, variational calculus, adjoint methods, etc.). The general approach can also be applied to derive new algorithms. The author then briefly examines some of the complexity issues and limitations intrinsic to gradient descent learning. Throughout the paper, the author focuses on the problem of trajectory learning.

  20. An optimized treatment for algorithmic differentiation of an important glaciological fixed-point problem

    NASA Astrophysics Data System (ADS)

    Goldberg, Daniel N.; Krishna Narayanan, Sri Hari; Hascoet, Laurent; Utke, Jean

    2016-05-01

    We apply an optimized method to the adjoint generation of a time-evolving land ice model through algorithmic differentiation (AD). The optimization involves a special treatment of the fixed-point iteration required to solve the nonlinear stress balance, which differs from a straightforward application of AD software, and leads to smaller memory requirements and in some cases shorter computation times of the adjoint. The optimization is done via implementation of the algorithm of Christianson (1994) for reverse accumulation of fixed-point problems, with the AD tool OpenAD. For test problems, the optimized adjoint is shown to have far lower memory requirements, potentially enabling larger problem sizes on memory-limited machines. In the case of the land ice model, implementation of the algorithm allows further optimization by having the adjoint model solve a sequence of linear systems with identical (as opposed to varying) matrices, greatly improving performance. The methods introduced here will be of value to other efforts applying AD tools to ice models, particularly ones which solve a hybrid shallow ice/shallow shelf approximation to the Stokes equations.

  1. The forward and adjoint sensitivity methods of glacial isostatic adjustment: Existence, uniqueness and time-differencing scheme

    NASA Astrophysics Data System (ADS)

    Martinec, Zdenek; Sasgen, Ingo; Velimsky, Jakub

    2014-05-01

    In this study, two new methods for computing the sensitivity of the glacial isostatic adjustment (GIA) forward solution with respect to the Earth's mantle viscosity are presented: the forward sensitivity method (FSM) and the adjoint sensitivity method (ASM). These advanced formal methods are based on the time-domain,spectral-finite element method for modelling the GIA response of laterally heterogeneous earth models developed by Martinec (2000). There are many similarities between the forward method and the FSM and ASM for a general physical system. However, in the case of GIA, there are also important differences between the forward and sensitivity methods. The analysis carried out in this study results in the following findings. First, the forward method of GIA is unconditionally solvable, regardless of whether or not a combined ice and ocean-water load contains the first-degree spherical harmonics. This is also the case for the FSM, however, the ASM must in addition be supplemented by nine conditions on the misfit between the given GIA-related data and the forward model predictions to guarantee the existence of a solution. This constrains the definition of data least-squares misfit. Second, the forward method of GIA implements an ocean load as a free boundary-value function over an ocean area with a free geometry. That is, an ocean load and the shape of ocean, the so-called ocean function, are being sought, in addition to deformation and gravity-increment fields, by solving the forward method. The FSM and ASM also apply the adjoint ocean load as a free boundary-value function, but instead over an ocean area with the fixed geometry given by the ocean function determined by the forward method. In other words, a boundary-value problem for the forward method of GIA is free with respect to determining (i) the boundary-value data over an ocean area and (ii) the ocean function itself, while the boundary-value problems for the FSM and ASM are free only with respect to

  2. The adjoint-state method for the downward continuation of the geomagnetic field

    NASA Astrophysics Data System (ADS)

    Hagedoorn, J. M.; Martinec, Z.

    2015-05-01

    The downward continuation of the observed geomagnetic field from the Earth's surface to the core-mantle boundary (CMB) is complicated due to induction and diffusion processes in the electrically conducting Earth mantle, which modify the amplitudes and morphology of the geomagnetic field. Various methods have been developed to solve this problem, for example, the perturbation approach by Benton & Whaler, or the non-harmonic downward continuation by Ballani et al. In this paper, we present a new approach for determining the geomagnetic field at the CMB by reformulating the ill-posed, one-sided boundary-value problem with time-variable boundary-value function on the Earth's surface into an optimization problem for the boundary condition at the CMB. The reformulated well-posed problem is solved by a conjugate gradient technique using the adjoint gradient of a misfit. For this purpose, we formulate the geomagnetic adjoint-state equations for efficient computations of the misfit gradient. Beside the theoretical description of the new adjoint-state method (ASM), the first applications to a global geomagnetic field model are presented. The comparison with other methods demonstrates the capability of the new method to determine the geomagnetic field at the CMB and allows us to investigate the variability of the determined field with respect to the applied methods. This shows that it is necessary to apply the ASM when investigating the effect of the Earth's mantle conductivity because the difference between the results of approximate methods (harmonic downward continuation, perturbation approach) and the rigorous ASM are of the same order as the difference between the results of the ASM applied for different mantle conductivities.

  3. Imaging the slab beneath central Chile using the Spectral Elements Method and adjoint techniques

    NASA Astrophysics Data System (ADS)

    Mercerat, E. D.; Nolet, G.; Marot, M.; Deshayes, P.; Monfret, T.

    2010-12-01

    This work focuses on imaging the subducting slab beneath Central Chile using novel inversion techniques based on the adjoint method and accurate wave propagation simulations using the Spectral Elements Method. The study area comprises the flat slab portion of the Nazca plate between 29 S and 34 S subducting beneath South America. We will use a database of regional seismicity consisting of both crustal and deep slab earthquakes with magnitude 3 < Mw < 6 recorded by different temporary and permanent seismological networks. Our main goal is to determine both the kinematics and the geometry of the subducting slab in order to help the geodynamical interpretation of such particular active margin. The Spectral Elements Method (SPECFEM3D code) is used to generate the synthetic seismograms and it will be applied for the iterative minimization based on adjoint techniques. The numerical mesh is 600 km x 600 km in horizontal coordinates and 220 km depth. As a first step, we are faced to well-known issues concerning mesh generation (resolution, quality, absorbing boundary conditions). In particular, we must evaluate the influence of free surface topography, as well as the MOHO and other geological interfaces in the synthetic seismograms. The initial velocity model from a previous travel-time tomography study, is linearly interpolated to the Gauss-Lobatto-Legendre grid. The comparison between the first forward simulations (up to 4 seconds minimum period) validate the initial velocity model of the study area, although many features not reproduced by the initial model have already been identified. Next step will concentrate in the comparison between finite-frequency kernels calculated by travel-time methods with ones based on adjoint methods, in order to highlight advantages and disadvantages in terms of resolution, accuracy, but also computational cost.

  4. Tomography, Adjoint Methods, Time-Reversal, and Banana-Doughnut Kernels

    NASA Astrophysics Data System (ADS)

    Tape, C.; Tromp, J.; Liu, Q.

    2004-12-01

    We demonstrate that Fréchet derivatives for tomographic inversions may be obtained based upon just two calculations for each earthquake: one calculation for the current model and a second, `adjoint', calculation that uses time-reversed signals at the receivers as simultaneous, fictitious sources. For a given model~m, we consider objective functions χ(m) that minimize differences between waveforms, traveltimes, or amplitudes. We show that the Fréchet derivatives of such objective functions may be written in the generic form δ χ=∫ VK_m( {x}) δ ln m( {x}) d3 {x}, where δ ln m=δ m/m denotes the relative model perturbation. The volumetric kernel Km is defined throughout the model volume V and is determined by time-integrated products between spatial and temporal derivatives of the regular displacement field {s} and the adjoint displacement field {s} obtained by using time-reversed signals at the receivers as simultaneous sources. In waveform tomography the time-reversed signal consists of differences between the data and the synthetics, in traveltime tomography it is determined by synthetic velocities, and in amplitude tomography it is controlled by synthetic displacements. For each event, the construction of the kernel Km requires one forward calculation for the regular field {s} and one adjoint calculation involving the fields {s} and {s}. For multiple events the kernels are simply summed. The final summed kernel is controlled by the distribution of events and stations and thus determines image resolution. In the case of traveltime tomography, the kernels Km are weighted combinations of banana-doughnut kernels. We demonstrate also how amplitude anomalies may be inverted for lateral variations in elastic and anelastic structure. The theory is illustrated based upon 2D spectral-element simulations.

  5. A user's manual for MASH 1. 0: A Monte Carlo Adjoint Shielding Code System

    SciTech Connect

    Johnson, J.O.

    1992-03-01

    The Monte Carlo Adjoint Shielding Code System, MASH, calculates neutron and gamma-ray environments and radiation protection factors for armored military vehicles, structures, trenches, and other shielding configurations by coupling a forward discrete ordinates air-over-ground transport calculation with an adjoint Monte Carlo treatment of the shielding geometry. Efficiency and optimum use of computer time are emphasized. The code system include the GRTUNCL and DORT codes for air-over-ground transport calculations, the MORSE code with the GIFT5 combinatorial geometry package for adjoint shielding calculations, and several peripheral codes that perform the required data preparations, transformations, and coupling functions. MASH is the successor to the Vehicle Code System (VCS) initially developed at Oak Ridge National Laboratory (ORNL). The discrete ordinates calculation determines the fluence on a coupling surface surrounding the shielding geometry due to an external neutron/gamma-ray source. The Monte Carlo calculation determines the effectiveness of the fluence at that surface in causing a response in a detector within the shielding geometry, i.e., the dose importance'' of the coupling surface fluence. A coupling code folds the fluence together with the dose importance, giving the desired dose response. The coupling code can determine the dose response a a function of the shielding geometry orientation relative to the source, distance from the source, and energy response of the detector. This user's manual includes a short description of each code, the input required to execute the code along with some helpful input data notes, and a representative sample problem (input data and selected output edits) for each code.

  6. On-line monitoring the extract process of Fu-fang Shuanghua oral solution using near infrared spectroscopy and different PLS algorithms

    NASA Astrophysics Data System (ADS)

    Kang, Qian; Ru, Qingguo; Liu, Yan; Xu, Lingyan; Liu, Jia; Wang, Yifei; Zhang, Yewen; Li, Hui; Zhang, Qing; Wu, Qing

    2016-01-01

    An on-line near infrared (NIR) spectroscopy monitoring method with an appropriate multivariate calibration method was developed for the extraction process of Fu-fang Shuanghua oral solution (FSOS). On-line NIR spectra were collected through two fiber optic probes, which were designed to transmit NIR radiation by a 2 mm flange. Partial least squares (PLS), interval PLS (iPLS) and synergy interval PLS (siPLS) algorithms were used comparatively for building the calibration regression models. During the extraction process, the feasibility of NIR spectroscopy was employed to determine the concentrations of chlorogenic acid (CA) content, total phenolic acids contents (TPC), total flavonoids contents (TFC) and soluble solid contents (SSC). High performance liquid chromatography (HPLC), ultraviolet spectrophotometric method (UV) and loss on drying methods were employed as reference methods. Experiment results showed that the performance of siPLS model is the best compared with PLS and iPLS. The calibration models for AC, TPC, TFC and SSC had high values of determination coefficients of (R2) (0.9948, 0.9992, 0.9950 and 0.9832) and low root mean square error of cross validation (RMSECV) (0.0113, 0.0341, 0.1787 and 1.2158), which indicate a good correlation between reference values and NIR predicted values. The overall results show that the on line detection method could be feasible in real application and would be of great value for monitoring the mixed decoction process of FSOS and other Chinese patent medicines.

  7. Progress on the Development of B-spline Collocation for the Solution of Differential Model Equations: A Novel Algorithm for Adaptive Knot Insertion

    SciTech Connect

    Johnson, Richard Wayne

    2003-05-01

    The application of collocation methods using spline basis functions to solve differential model equations has been in use for a few decades. However, the application of spline collocation to the solution of the nonlinear, coupled, partial differential equations (in primitive variables) that define the motion of fluids has only recently received much attention. The issues that affect the effectiveness and accuracy of B-spline collocation for solving differential equations include which points to use for collocation, what degree B-spline to use and what level of continuity to maintain. Success using higher degree B-spline curves having higher continuity at the knots, as opposed to more traditional approaches using orthogonal collocation, have recently been investigated along with collocation at the Greville points for linear (1D) and rectangular (2D) geometries. The development of automatic knot insertion techniques to provide sufficient accuracy for B-spline collocation has been underway. The present article reviews recent progress for the application of B-spline collocation to fluid motion equations as well as new work in developing a novel adaptive knot insertion algorithm for a 1D convection-diffusion model equation.

  8. Adjoint transport calculations for sensitivity analysis of the Hiroshima air-over-ground environment

    SciTech Connect

    Broadhead, B.L.; Cacuci, D.G.; Pace, J.V. III

    1984-01-01

    A major effort within the US Dose Reassessment Program is aimed at recalculating the transport of initial nuclear radiation in an air-over-ground environment. This paper is the first report of results from adjoint calculations in the Hiroshima air-over-ground environment. The calculations use a Hiroshima/Nagasaki multi-element ground, ENDF/B-V nuclear data, one-dimensional ANISN flux weighting for neutron and gamma cross sections, a source obtained by two-dimensional hydrodynamic and three-dimensional transport calculations, and best-estimate atmospheric conditions from Japanese sources. 7 references, 2 figures.

  9. Ginsparg-Wilson relation on a fuzzy 2-sphere for adjoint matter

    SciTech Connect

    Aoki, Hajime

    2010-10-15

    We formulate a Ginsparg-Wilson relation on a fuzzy 2-sphere for matter in the adjoint representation of the gauge group. Because of the Ginsparg-Wilson relation, an index theorem is satisfied. Our formulation is applicable to topologically nontrivial configurations as monopoles. It gives a solid basis for obtaining chiral fermions, which are an important ingredient of the standard model, from matrix model formulations of the superstring theory, such as the IIB matrix model, by considering topological configurations in the extra dimensions. We finally discuss whether this mechanism really works.

  10. Artificial neural network-genetic algorithm based optimization for the adsorption of methylene blue and brilliant green from aqueous solution by graphite oxide nanoparticle.

    PubMed

    Ghaedi, M; Zeinali, N; Ghaedi, A M; Teimuori, M; Tashkhourian, J

    2014-05-05

    In this study, graphite oxide (GO) nano according to Hummers method was synthesized and subsequently was used for the removal of methylene blue (MB) and brilliant green (BG). The detail information about the structure and physicochemical properties of GO are investigated by different techniques such as XRD and FTIR analysis. The influence of solution pH, initial dye concentration, contact time and adsorbent dosage was examined in batch mode and optimum conditions was set as pH=7.0, 2 mg of GO and 10 min contact time. Employment of equilibrium isotherm models for description of adsorption capacities of GO explore the good efficiency of Langmuir model for the best presentation of experimental data with maximum adsorption capacity of 476.19 and 416.67 for MB and BG dyes in single solution. The analysis of adsorption rate at various stirring times shows that both dyes adsorption followed a pseudo second-order kinetic model with cooperation with interparticle diffusion model. Subsequently, the adsorption data as new combination of artificial neural network was modeled to evaluate and obtain the real conditions for fast and efficient removal of dyes. A three-layer artificial neural network (ANN) model is applicable for accurate prediction of dyes removal percentage from aqueous solution by GO following conduction of 336 experimental data. The network was trained using the obtained experimental data at optimum pH with different GO amount (0.002-0.008 g) and 5-40 mg/L of both dyes over contact time of 0.5-30 min. The ANN model was able to predict the removal efficiency with Levenberg-Marquardt algorithm (LMA), a linear transfer function (purelin) at output layer and a tangent sigmoid transfer function (tansig) at hidden layer with 10 and 11 neurons for MB and BG dyes, respectively. The minimum mean squared error (MSE) of 0.0012 and coefficient of determination (R(2)) of 0.982 were found for prediction and modeling of MB removal, while the respective value for BG was the

  11. Artificial neural network-genetic algorithm based optimization for the adsorption of methylene blue and brilliant green from aqueous solution by graphite oxide nanoparticle

    NASA Astrophysics Data System (ADS)

    Ghaedi, M.; Zeinali, N.; Ghaedi, A. M.; Teimuori, M.; Tashkhourian, J.

    In this study, graphite oxide (GO) nano according to Hummers method was synthesized and subsequently was used for the removal of methylene blue (MB) and brilliant green (BG). The detail information about the structure and physicochemical properties of GO are investigated by different techniques such as XRD and FTIR analysis. The influence of solution pH, initial dye concentration, contact time and adsorbent dosage was examined in batch mode and optimum conditions was set as pH = 7.0, 2 mg of GO and 10 min contact time. Employment of equilibrium isotherm models for description of adsorption capacities of GO explore the good efficiency of Langmuir model for the best presentation of experimental data with maximum adsorption capacity of 476.19 and 416.67 for MB and BG dyes in single solution. The analysis of adsorption rate at various stirring times shows that both dyes adsorption followed a pseudo second-order kinetic model with cooperation with interparticle diffusion model. Subsequently, the adsorption data as new combination of artificial neural network was modeled to evaluate and obtain the real conditions for fast and efficient removal of dyes. A three-layer artificial neural network (ANN) model is applicable for accurate prediction of dyes removal percentage from aqueous solution by GO following conduction of 336 experimental data. The network was trained using the obtained experimental data at optimum pH with different GO amount (0.002-0.008 g) and 5-40 mg/L of both dyes over contact time of 0.5-30 min. The ANN model was able to predict the removal efficiency with Levenberg-Marquardt algorithm (LMA), a linear transfer function (purelin) at output layer and a tangent sigmoid transfer function (tansig) at hidden layer with 10 and 11 neurons for MB and BG dyes, respectively. The minimum mean squared error (MSE) of 0.0012 and coefficient of determination (R2) of 0.982 were found for prediction and modeling of MB removal, while the respective value for BG was the

  12. Technique for Calculating Solution Derivatives With Respect to Geometry Parameters in a CFD Code

    NASA Technical Reports Server (NTRS)

    Mathur, Sanjay

    2011-01-01

    A solution has been developed to the challenges of computation of derivatives with respect to geometry, which is not straightforward because these are not typically direct inputs to the computational fluid dynamics (CFD) solver. To overcome these issues, a procedure has been devised that can be used without having access to the mesh generator, while still being applicable to all types of meshes. The basic approach is inspired by the mesh motion algorithms used to deform the interior mesh nodes in a smooth manner when the surface nodes, for example, are in a fluid structure interaction problem. The general idea is to model the mesh edges and nodes as constituting a spring-mass system. Changes to boundary node locations are propagated to interior nodes by allowing them to assume their new equilibrium positions, for instance, one where the forces on each node are in balance. The main advantage of the technique is that it is independent of the volumetric mesh generator, and can be applied to structured, unstructured, single- and multi-block meshes. It essentially reduces the problem down to defining the surface mesh node derivatives with respect to the geometry parameters of interest. For analytical geometries, this is quite straightforward. In the more general case, one would need to be able to interrogate the underlying parametric CAD (computer aided design) model and to evaluate the derivatives either analytically, or by a finite difference technique. Because the technique is based on a partial differential equation (PDE), it is applicable not only to forward mode problems (where derivatives of all the output quantities are computed with respect to a single input), but it could also be extended to the adjoint problem, either by using an analytical adjoint of the PDE or a discrete analog.

  13. Exact Solutions and Conservation Laws for a New Integrable Equation

    SciTech Connect

    Gandarias, M. L.; Bruzon, M. S.

    2010-09-30

    In this work we study a generalization of an integrable equation proposed by Qiao and Liu from the point of view of the theory of symmetry reductions in partial differential equations. Among the solutions we obtain a travelling wave with decaying velocity and a smooth soliton solution. We determine the subclass of these equations which are quasi-self-adjoint and we get a nontrivial conservation law.

  14. Direct and adjoint sensitivity analysis of chemical kinetic systems with KPP: Part I—theory and software tools

    NASA Astrophysics Data System (ADS)

    Sandu, Adrian; Daescu, Dacian N.; Carmichael, Gregory R.

    The analysis of comprehensive chemical reactions mechanisms, parameter estimation techniques, and variational chemical data assimilation applications require the development of efficient sensitivity methods for chemical kinetics systems. The new release (KPP-1.2) of the kinetic preprocessor (KPP) contains software tools that facilitate direct and adjoint sensitivity analysis. The direct-decoupled method, built using BDF formulas, has been the method of choice for direct sensitivity studies. In this work, we extend the direct-decoupled approach to Rosenbrock stiff integration methods. The need for Jacobian derivatives prevented Rosenbrock methods to be used extensively in direct sensitivity calculations; however, the new automatic and symbolic differentiation technologies make the computation of these derivatives feasible. The direct-decoupled method is known to be efficient for computing the sensitivities of a large number of output parameters with respect to a small number of input parameters. The adjoint modeling is presented as an efficient tool to evaluate the sensitivity of a scalar response function with respect to the initial conditions and model parameters. In addition, sensitivity with respect to time-dependent model parameters may be obtained through a single backward integration of the adjoint model. KPP software may be used to completely generate the continuous and discrete adjoint models taking full advantage of the sparsity of the chemical mechanism. Flexible direct-decoupled and adjoint sensitivity code implementations are achieved with minimal user intervention. In a companion paper, we present an extensive set of numerical experiments that validate the KPP software tools for several direct/adjoint sensitivity applications, and demonstrate the efficiency of KPP-generated sensitivity code implementations.

  15. AN ADJOINT-BASED METHOD FOR THE INVERSION OF THE JUNO AND CASSINI GRAVITY MEASUREMENTS INTO WIND FIELDS

    SciTech Connect

    Galanti, Eli; Kaspi, Yohai

    2016-04-01

    During 2016–17, the Juno and Cassini spacecraft will both perform close eccentric orbits of Jupiter and Saturn, respectively, obtaining high-precision gravity measurements for these planets. These data will be used to estimate the depth of the observed surface flows on these planets. All models to date, relating the winds to the gravity field, have been in the forward direction, thus only allowing the calculation of the gravity field from given wind models. However, there is a need to do the inverse problem since the new observations will be of the gravity field. Here, an inverse dynamical model is developed to relate the expected measurable gravity field, to perturbations of the density and wind fields, and therefore to the observed cloud-level winds. In order to invert the gravity field into the 3D circulation, an adjoint model is constructed for the dynamical model, thus allowing backward integration. This tool is used for the examination of various scenarios, simulating cases in which the depth of the wind depends on latitude. We show that it is possible to use the gravity measurements to derive the depth of the winds, both on Jupiter and Saturn, also taking into account measurement errors. Calculating the solution uncertainties, we show that the wind depth can be determined more precisely in the low-to-mid-latitudes. In addition, the gravitational moments are found to be particularly sensitive to flows at the equatorial intermediate depths. Therefore, we expect that if deep winds exist on these planets they will have a measurable signature by Juno and Cassini.

  16. Calculation of the response of cylindrical targets to collimated beams of particles using one-dimensional adjoint transport techniques. [LMFBR

    SciTech Connect

    Dupree, S. A.

    1980-06-01

    The use of adjoint techniques to determine the interaction of externally incident collimated beams of particles with cylindrical targets is a convenient means of examining a class of problems important in radiation transport studies. The theory relevant to such applications is derived, and a simple example involving a fissioning target is discussed. Results from both discrete ordinates and Monte Carlo transport-code calculations are presented, and comparisons are made with results obtained from forward calculations. The accuracy of the discrete ordinates adjoint results depends on the order of angular quadrature used in the calculation. Reasonable accuracy by using EQN quadratures can be expected from order S/sub 16/ or higher.

  17. Neutron noise calculations in a hexagonal geometry and comparison with analytical solutions

    SciTech Connect

    Tran, H. N.; Demaziere, C.

    2012-07-01

    This paper presents the development of a neutronic and kinetic solver for hexagonal geometries. The tool is developed based on the diffusion theory with multi-energy groups and multi-groups of delayed neutron precursors allowing the solutions of forward and adjoint problems of static and dynamic states, and is applicable to both thermal and fast systems with hexagonal geometries. In the dynamic problems, the small stationary fluctuations of macroscopic cross sections are considered as noise sources, and then the induced first order noise is calculated fully in the frequency domain. Numerical algorithms for solving the static and noise equations are implemented with a spatial discretization based on finite differences and a power iterative solution. A coarse mesh finite difference method has been adopted for speeding up the convergence. Since no other numerical tool could calculate frequency-dependent noise in hexagonal geometry, validation calculations have been performed and benchmarked to analytical solutions based on a 2-D homogeneous system with two-energy groups and one-group of delayed neutron precursor, in which point-like perturbations of thermal absorption cross section at central and non-central positions are considered as noise sources. (authors)

  18. An analytic solution for the orbital perturbations of the Venus Radar Mapper due to gravitational harmonics

    NASA Technical Reports Server (NTRS)

    Vijayaraghavan, A.

    1984-01-01

    Hill's variational equations are solved analytically for the orbital perturbations of a spacecraft nominally in an elliptic orbit around a non-spherical body. The rotation of the central planet about its spin-axis is not considered in the analysis. The perturbations are restricted to the planetary gravitational harmonics only. An extremely simple algorithm is derived to transform the spherical harmonic potentials to the orbital coordinate system, and the resulting accelerations are shown to be simply trigonometric functions of the true anomaly. With the principal matrix solution for the differential equations of the adjoint system given in closed form, the orthogonality of the trigonometric functions makes it possible to obtain an analytic solution for the non-homogeneous problem, at intervals of 2 pi in true anomaly. The solution for orbital perturbations can be extended over several revolutions by applying well-known results from Floquet's theory. The technique is demonstrated with results presented on the spacecraft periapsis altitude for the forthcoming Venus Radar Mapper Mission.

  19. Seeking Energy System Pathways to Reduce Ozone Damage to Ecosystems through Adjoint-based Sensitivity Analysis

    NASA Astrophysics Data System (ADS)

    Capps, S. L.; Pinder, R. W.; Loughlin, D. H.; Bash, J. O.; Turner, M. D.; Henze, D. K.; Percell, P.; Zhao, S.; Russell, M. G.; Hakami, A.

    2014-12-01

    Tropospheric ozone (O3) affects the productivity of ecosystems in addition to degrading human health. Concentrations of this pollutant are significantly influenced by precursor gas emissions, many of which emanate from energy production and use processes. Energy system optimization models could inform policy decisions that are intended to reduce these harmful effects if the contribution of precursor gas emissions to human health and ecosystem degradation could be elucidated. Nevertheless, determining the degree to which precursor gas emissions harm ecosystems and human health is challenging because of the photochemical production of ozone and the distinct mechanisms by which ozone causes harm to different crops, tree species, and humans. Here, the adjoint of a regional chemical transport model is employed to efficiently calculate the relative influences of ozone precursor gas emissions on ecosystem and human health degradation, which informs an energy system optimization. Specifically, for the summer of 2007 the Community Multiscale Air Quality (CMAQ) model adjoint is used to calculate the location- and sector-specific influences of precursor gas emissions on potential productivity losses for the major crops and sensitive tree species as well as human mortality attributable to chronic ozone exposure in the continental U.S. The atmospheric concentrations are evaluated with 12-km horizontal resolution with crop production and timber biomass data gridded similarly. These location-specific factors inform the energy production and use technologies selected in the MARKet ALlocation (MARKAL) model.

  20. Improving the Fit of a Land-Surface Model to Data Using its Adjoint

    NASA Astrophysics Data System (ADS)

    Raoult, N.; Jupp, T. E.; Cox, P. M.; Luke, C.

    2015-12-01

    Land-surface models (LSMs) are of growing importance in the world of climate prediction. They are crucial components of larger Earth system models that are aimed at understanding the effects of land surface processes on the global carbon cycle. The Joint UK Land Environment Simulator (JULES) is the land-surface model used by the UK Met Office. It has been automatically differentiated using commercial software from FastOpt, resulting in an analytical gradient, or 'adjoint', of the model. Using this adjoint, the adJULES parameter estimation system has been developed, to search for locally optimum parameter sets by calibrating against observations. adJULES presents an opportunity to confront JULES with many different observations, and make improvements to the model parameterisation. In the newest version of adJULES, multiple sites can be used in the calibration, to giving a generic set of parameters that can be generalised over plant functional types. We present an introduction to the adJULES system and its applications to data from a variety of flux tower sites. We show that calculation of the 2nd derivative of JULES allows us to produce posterior probability density functions of the parameters and how knowledge of parameter values is constrained by observations.

  1. Efficient Adjoint Computation of Hybrid Systems of Differential Algebraic Equations with Applications in Power Systems

    SciTech Connect

    Abhyankar, Shrirang; Anitescu, Mihai; Constantinescu, Emil; Zhang, Hong

    2016-03-31

    Sensitivity analysis is an important tool to describe power system dynamic behavior in response to parameter variations. It is a central component in preventive and corrective control applications. The existing approaches for sensitivity calculations, namely, finite-difference and forward sensitivity analysis, require a computational effort that increases linearly with the number of sensitivity parameters. In this work, we investigate, implement, and test a discrete adjoint sensitivity approach whose computational effort is effectively independent of the number of sensitivity parameters. The proposed approach is highly efficient for calculating trajectory sensitivities of larger systems and is consistent, within machine precision, with the function whose sensitivity we are seeking. This is an essential feature for use in optimization applications. Moreover, our approach includes a consistent treatment of systems with switching, such as DC exciters, by deriving and implementing the adjoint jump conditions that arise from state and time-dependent discontinuities. The accuracy and the computational efficiency of the proposed approach are demonstrated in comparison with the forward sensitivity analysis approach.

  2. Eguchi-Kawai reduction with one flavor of adjoint Möbius fermion

    NASA Astrophysics Data System (ADS)

    Cunningham, William; Giedt, Joel

    2016-02-01

    We study the single site lattice gauge theory of S U (N ) coupled to one Dirac flavor of fermion in the adjoint representation. We utilize Möbius fermions for this study, and accelerate the calculation with graphics processing units. Our Monte Carlo simulations indicate that for sufficiently large inverse 't Hooft coupling b =1 /g2N , and for N ≤10 the distribution of traced Polyakov loops has "fingers" that extend from the origin. However, in the massless case the distribution of eigenvalues of the untraced Polyakov loop becomes uniform at large N , indicating preservation of center symmetry in the thermodynamic limit. By contrast, for a large mass and large b , the distribution is highly nonuniform in the same limit, indicating spontaneous center symmetry breaking. These conclusions are confirmed by comparing to the quenched case, as well as by examining another observable based on the average value of the modulus of the traced Polyakov loop. The result of this investigation is that with massless adjoint fermions center symmetry is stabilized and the Eguchi-Kawai reduction should be successful; this is in agreement with most other studies.

  3. Tide-surge adjoint modeling: A new technique to understand forecast uncertainty

    NASA Astrophysics Data System (ADS)

    Wilson, Chris; Horsburgh, Kevin J.; Williams, Jane; Flowerdew, Jonathan; Zanna, Laure

    2013-10-01

    For a simple dynamical system, such as a pendulum, it is easy to deduce where and when applied forcing might produce a particular response. However, for a complex nonlinear dynamical system such as the ocean or atmosphere, this is not as obvious. Knowing when or where the system is most sensitive, to observational uncertainty or otherwise, is key to understanding the physical processes, improving and providing reliable forecasts. We describe the application of adjoint modeling to determine the sensitivity of sea level at a UK coastal location, Sheerness, to perturbations in wind stress preceding an extreme North Sea storm surge event on 9 November 2007. Sea level at Sheerness is one of the most important factors used to decide whether to close the Thames Flood Barrier, which protects London. Adjoint modeling has been used by meteorologists since the 1990s, but is a relatively new technique for ocean modeling. It may be used to determine system sensitivity beyond the scope of ensemble modeling and in a computationally efficient way. Using estimates of wind stress error from Met Office forecasts, we find that for this event total sea level at Sheerness is most sensitive in the 3 h preceding the time of its unperturbed maximum level and over a radius of approximately 300 km. We also find that the pattern of sensitivity follows a simple sequence when considered in the reverse-time direction.

  4. Optimization of computations for adjoint field and Jacobian needed in 3D CSEM inversion

    NASA Astrophysics Data System (ADS)

    Dehiya, Rahul; Singh, Arun; Gupta, Pravin K.; Israil, M.

    2017-01-01

    We present the features and results of a newly developed code, based on Gauss-Newton optimization technique, for solving three-dimensional Controlled-Source Electromagnetic inverse problem. In this code a special emphasis has been put on representing the operations by block matrices for conjugate gradient iteration. We show how in the computation of Jacobian, the matrix formed by differentiation of system matrix can be made independent of frequency to optimize the operations at conjugate gradient step. The coarse level parallel computing, using OpenMP framework, is used primarily due to its simplicity in implementation and accessibility of shared memory multi-core computing machine to almost anyone. We demonstrate how the coarseness of modeling grid in comparison to source (comp`utational receivers) spacing can be exploited for efficient computing, without compromising the quality of the inverted model, by reducing the number of adjoint calls. It is also demonstrated that the adjoint field can even be computed on a grid coarser than the modeling grid without affecting the inversion outcome. These observations were reconfirmed using an experiment design where the deviation of source from straight tow line is considered. Finally, a real field data inversion experiment is presented to demonstrate robustness of the code.

  5. Sources and processes contributing to nitrogen deposition: an adjoint model analysis applied to biodiversity hotspots worldwide.

    PubMed

    Paulot, Fabien; Jacob, Daniel J; Henze, Daven K

    2013-04-02

    Anthropogenic enrichment of reactive nitrogen (Nr) deposition is an ecological concern. We use the adjoint of a global 3-D chemical transport model (GEOS-Chem) to identify the sources and processes that control Nr deposition to an ensemble of biodiversity hotspots worldwide and two U.S. national parks (Cuyahoga and Rocky Mountain). We find that anthropogenic sources dominate deposition at all continental sites and are mainly regional (less than 1000 km) in origin. In Hawaii, Nr supply is controlled by oceanic emissions of ammonia (50%) and anthropogenic sources (50%), with important contributions from Asia and North America. Nr deposition is also sensitive in complicated ways to emissions of SO2, which affect Nr gas-aerosol partitioning, and of volatile organic compounds (VOCs), which affect oxidant concentrations and produce organic nitrate reservoirs. For example, VOC emissions generally inhibit deposition of locally emitted NOx but significantly increase Nr deposition downwind. However, in polluted boreal regions, anthropogenic VOC emissions can promote Nr deposition in winter. Uncertainties in chemical rate constants for OH + NO2 and NO2 hydrolysis also complicate the determination of source-receptor relationships for polluted sites in winter. Application of our adjoint sensitivities to the representative concentration pathways (RCPs) scenarios for 2010-2050 indicates that future decreases in Nr deposition due to NOx emission controls will be offset by concurrent increases in ammonia emissions from agriculture.

  6. Forward and adjoint simulations of seismic wave propagation on fully unstructured hexahedral meshes

    NASA Astrophysics Data System (ADS)

    Peter, Daniel; Komatitsch, Dimitri; Luo, Yang; Martin, Roland; Le Goff, Nicolas; Casarotti, Emanuele; Le Loher, Pieyre; Magnoni, Federica; Liu, Qinya; Blitz, Céline; Nissen-Meyer, Tarje; Basini, Piero; Tromp, Jeroen

    2011-08-01

    We present forward and adjoint spectral-element simulations of coupled acoustic and (an)elastic seismic wave propagation on fully unstructured hexahedral meshes. Simulations benefit from recent advances in hexahedral meshing, load balancing and software optimization. Meshing may be accomplished using a mesh generation tool kit such as CUBIT, and load balancing is facilitated by graph partitioning based on the SCOTCH library. Coupling between fluid and solid regions is incorporated in a straightforward fashion using domain decomposition. Topography, bathymetry and Moho undulations may be readily included in the mesh, and physical dispersion and attenuation associated with anelasticity are accounted for using a series of standard linear solids. Finite-frequency Fréchet derivatives are calculated using adjoint methods in both fluid and solid domains. The software is benchmarked for a layercake model. We present various examples of fully unstructured meshes, snapshots of wavefields and finite-frequency kernels generated by Version 2.0 'Sesame' of our widely used open source spectral-element package SPECFEM3D.

  7. Dynamical sensitivity analysis of tropical cyclone steering and genesis using an adjoint model

    NASA Astrophysics Data System (ADS)

    Hoover, Brett T.

    The adjoint of a numerical weather prediction (NWP) model is a powerful tool for efficiently calculating the "sensitivity" of some function of the model forecast state with respect to small but otherwise arbitrary perturbations to the model state at earlier times. Physical interpretation of these sensitivity gradients for functions describing some phenomenon of dynamical interest allows the user to approach a variety of dynamical problems in atmospheric science from the perspective of the potential impact of small perturbations on the future development of that phenomenon; the integration of adjoint-derived sensitivity gradients as a dynamical tool for approaching these problems can be called dynamical sensitivity analysis. A methodology for dynamical sensitivity analysis is developed and applied to problems related to the steering and genesis of modeled tropical cyclones. Functions defining the steering and genesis of tropical cyclones are developed and tested, and sensitivity gradients of those functions with respect to model initial conditions are interpreted physically. Results indicate that regions of strong sensitivity tend to localize where small vorticity perturbations have the capacity to grow quickly and impact the future state of the model, such as regions of strong ascent and subsidence surrounding midlatitude troughs, or near zonal jets where upshear-tilted perturbations can grow barotropically. Consequences for dynamics and predictability of these events are discussed.

  8. Numerical study of tidal dynamics in the South China Sea with adjoint method

    NASA Astrophysics Data System (ADS)

    Gao, Xiumin; Wei, Zexun; Lv, Xianqing; Wang, Yonggang; Fang, Guohong

    2015-08-01

    We adopt a parameterized internal tide dissipation term to the two-dimensional (2-D) shallow water equations, and develop the corresponding adjoint model to investigate tidal dynamics in the South China Sea (SCS). The harmonic constants derived from 63 tidal gauge stations and 24 TOPEX/Poseidon (T/P) satellite altimeter crossover points are assimilated into the adjoint model to minimize the deviations of the simulated results and observations by optimizing the bottom friction coefficient and the internal tide dissipation coefficient. Tidal constituents M2, S2, K1 and O1 are simulated simultaneously. The numerical results (assimilating only tidal gauge data) agree well with T/P data showing that the model results are reliable. The co-tidal charts of M2, S2, K1 and O1 are obtained, which reflect the characteristics of tides in the SCS. The tidal energy flux is analyzed based on numerical results. The strongest tidal energy flux appears in the Luzon Strait (LS) for both semi-diurnal and diurnal tidal constituents. The analysis of tidal energy dissipation indicates that the bottom friction dissipation occurs mainly in shallow water area, meanwhile the internal tide dissipation is mainly concentrated in the LS and the deep basin of the SCS. The tidal energetics in the LS is examined showing that the tidal energy input closely balances the tidal energy dissipation.

  9. Imaging Earth's Interior based on Spectral-Element and Adjoint Methods (Invited)

    NASA Astrophysics Data System (ADS)

    Tromp, J.; Zhu, H.; Bozdag, E.

    2013-12-01

    We use spectral-element and adjoint methods to iteratively improve 3D tomographic images of Earth's interior, ranging from global to continental to exploration scales. The spectral-element method, a high-order finite-element method with the advantage of a diagonal mass matrix, is used to accurately calculate three-component synthetic seismograms in a complex 3D Earth model. An adjoint method is used to numerically compute Frechét derivatives of a misfit function based on the interaction between the wavefield for a reference Earth model and a wavefield obtained by using time-reversed differences between data and synthetics at all receivers as simultaneous sources. In combination with gradient-based optimization methods, such as a preconditioned conjugate gradient or L-BSGF method, we are able to iteratively improve 3D images of Earth's interior and gradually minimize discrepancies between observed and simulated seismograms. Various misfit functions may be chosen to quantify these discrepancies, such as cross-correlation traveltime differences, frequency-dependent phase and amplitude anomalies as well as full-waveform differences. Various physical properties of the Earth are constrained based on this method, such as elastic wavespeeds, radial anisotropy, shear attenuation and impedance contrasts. We apply this method to study seismic inverse problems at various scales, from global- and continental-scale seismic tomography to exploration-scale full-waveform inversion.

  10. A Matrix-Free Algorithm for Multidisciplinary Design Optimization

    NASA Astrophysics Data System (ADS)

    Lambe, Andrew Borean

    Multidisciplinary design optimization (MDO) is an approach to engineering design that exploits the coupling between components or knowledge disciplines in a complex system to improve the final product. In aircraft design, MDO methods can be used to simultaneously design the outer shape of the aircraft and the internal structure, taking into account the complex interaction between the aerodynamic forces and the structural flexibility. Efficient strategies are needed to solve such design optimization problems and guarantee convergence to an optimal design. This work begins with a comprehensive review of MDO problem formulations and solution algorithms. First, a fundamental MDO problem formulation is defined from which other formulations may be obtained through simple transformations. Using these fundamental problem formulations, decomposition methods from the literature are reviewed and classified. All MDO methods are presented in a unified mathematical notation to facilitate greater understanding. In addition, a novel set of diagrams, called extended design structure matrices, are used to simultaneously visualize both data communication and process flow between the many software components of each method. For aerostructural design optimization, modern decomposition-based MDO methods cannot efficiently handle the tight coupling between the aerodynamic and structural states. This fact motivates the exploration of methods that can reduce the computational cost. A particular structure in the direct and adjoint methods for gradient computation. motivates the idea of a matrix-free optimization method. A simple matrix-free optimizer is developed based on the augmented Lagrangian algorithm. This new matrix-free optimizer is tested on two structural optimization problems and one aerostructural optimization problem. The results indicate that the matrix-free optimizer is able to efficiently solve structural and multidisciplinary design problems with thousands of variables and

  11. A Matrix-Free Algorithm for Multidisciplinary Design Optimization

    NASA Astrophysics Data System (ADS)

    Lambe, Andrew Borean

    Multidisciplinary design optimization (MDO) is an approach to engineering design that exploits the coupling between components or knowledge disciplines in a complex system to improve the final product. In aircraft design, MDO methods can be used to simultaneously design the outer shape of the aircraft and the internal structure, taking into account the complex interaction between the aerodynamic forces and the structural flexibility. Efficient strategies are needed to solve such design optimization problems and guarantee convergence to an optimal design. This work begins with a comprehensive review of MDO problem formulations and solution algorithms. First, a fundamental MDO problem formulation is defined from which other formulations may be obtained through simple transformations. Using these fundamental problem formulations, decomposition methods from the literature are reviewed and classified. All MDO methods are presented in a unified mathematical notation to facilitate greater understanding. In addition, a novel set of diagrams, called extended design structure matrices, are used to simultaneously visualize both data communication and process flow between the many software components of each method. For aerostructural design optimization, modern decomposition-based MDO methods cannot efficiently handle the tight coupling between the aerodynamic and structural states. This fact motivates the exploration of methods that can reduce the computational cost. A particular structure in the direct and adjoint methods for gradient computation motivates the idea of a matrix-free optimization method. A simple matrix-free optimizer is developed based on the augmented Lagrangian algorithm. This new matrix-free optimizer is tested on two structural optimization problems and one aerostructural optimization problem. The results indicate that the matrix-free optimizer is able to efficiently solve structural and multidisciplinary design problems with thousands of variables and

  12. Utilisation de sources et d'adjoints dragon pour les calculs TRIPOLI

    NASA Astrophysics Data System (ADS)

    Camand, Corentin

    usually non significant. The second method is to use of the adjoint neutron flux calculated by DRAGON as an importance function for Monte Carlo biaising in TRIPOLI. The objective is to improve the figure of merit of the detector response located far away of the neutron source. The neutron source initialisation of a TRIPOLI calculation required to develop the development of a module in DRAGON that generates a list of sources in the TRIPOLI syntaxe, including for each source, its intensity, its position and the energy domain it covers. We tested our method on a complete 17×17 PWR-UOX assembly and on a reduced 3×3 model. We first verified that the DRAGON and TRIPOLI models were consistent in order to ensure that TRIPOLI receives a coherent source distribution. Then we tested the use of DRAGON sources in TRIPOLI with neutron flux and the effective multiplying coefficient (keff). We observe slightly better standard deviations, of an order of 10 pcm, on keff for simulations using DRAGON sources distributions as compared to simulations with less precise initial sources. Flux convergence is also improved. However some incoherence were also observed in the results, some flux converging slower with DRAGON sources when fewer neutrons per batch are considered. In addition, a very large number of sources is too heavy to insert in TRIPOLI. It seems that our method is perfectible in order to improve implementation and convergence. Study of more complex geometries, with less regular sources distributions (for instance using MOX or irradiated fuel) may provide better performances using our method. For biaising TRIPOLI calculations using the DRAGON adjoint flux we created a module that produces importance maps readable by TRIPOLI. We tested our method on a source-detector shielding problem in one dimension. After checking the coherence of DRAGON and TRIPOLI models, we biaised TRIPOLI simulations using the DRAGON adjoint flux, and using INIPOND, the internal biaising option of TRIPOLI. We

  13. Analytical solution for the advection-dispersion transport equation in layered media

    Technology Transfer Automated Retrieval System (TEKTRAN)

    The advection-dispersion transport equation with first-order decay was solved analytically for multi-layered media using the classic integral transform technique (CITT). The solution procedure used an associated non-self-adjoint advection-diffusion eigenvalue problem that had the same form and coef...

  14. Resolution of group velocity models obtained by adjoint inversion in the Czech Republic region

    NASA Astrophysics Data System (ADS)

    Valentova, Lubica; Gallovic, Frantisek; Ruzek, Bohuslav; de la Puente, Josep

    2013-04-01

    We performed tomographic inversion of crosscorrelation traveltimes of group waves in the Bohemian massif. The traveltimes used for inversion come from ambient seismic noise measurements between pairs of stations filtered for several period ranges between 2-20s. The inverse problem was solved by the conjugate gradients, which were calculated using efficient adjoint method. Assuming that the propagation of group waves can be approximated by membrane waves for each period separately, the computations are reduced to 2D domain. The numerical calculations were carried out using adjoint version of SeisSol, which solves elastodynamic system using Discontinuous Galerkin method with arbitrary high order time derivatives (ADER-DG). The adjoint inversion is based on computation of so called sensitivity kernels for each data, which are then combined into Fréchet kernel of misfit gradient. Therefore, if using only the longest wavelength data i.e. the traveltimes of 20s and 16s group waves, structures of even shorter wavelengths can be obtained by the inversion. However, these smaller-scale structures are possibly more affected by data noise and thus require careful treatment. Note that in the classical tomography based on ray method, such structures are subdued by regularization. This leads to question on the influence of data noise on the obtained models. Several synthetic tests were carried out to reveal the effect of data errors on the resulting model. Firstly, we tested the level of data noise required to obtain artificial small scale structures. As a target model we constructed simple heterogenous model consisting of one very long wavelength structure. The synthetic traveltime data were modified using random shifts for several distributions with different variances. The method appears to be extremely sensitive even for relatively small level of noise. The other set of tests concentrated on the main feature of models obtained from the real data. All models inverted using

  15. Self-adjoint Lyapunov variables, temporal ordering, and irreversible representations of Schroedinger evolution

    SciTech Connect

    Strauss, Y.

    2010-02-15

    In nonrelativistic quantum mechanics time enters as a parameter in the Schroedinger equation. However, there are various situations where the need arises to view time as a dynamical variable. In this paper we consider the dynamical role of time through the construction of a Lyapunov variable - i.e., a self-adjoint quantum observable whose expectation value varies monotonically as time increases. It is shown, in a constructive way, that a certain class of models admits a Lyapunov variable and that the existence of a Lyapunov variable implies the existence of a transformation mapping the original quantum mechanical problem to an equivalent irreversible representation. In addition, it is proven that in the irreversible representation there exists a natural time ordering observable splitting the Hilbert space at each t>0 into past and future subspaces.

  16. Adjoint-Based Methodology for Time-Dependent Optimal Control (AMTOC)

    NASA Technical Reports Server (NTRS)

    Yamaleev, Nail; Diskin, boris; Nishikawa, Hiroaki

    2012-01-01

    During the five years of this project, the AMTOC team developed an adjoint-based methodology for design and optimization of complex time-dependent flows, implemented AMTOC in a testbed environment, directly assisted in implementation of this methodology in the state-of-the-art NASA's unstructured CFD code FUN3D, and successfully demonstrated applications of this methodology to large-scale optimization of several supersonic and other aerodynamic systems, such as fighter jet, subsonic aircraft, rotorcraft, high-lift, wind-turbine, and flapping-wing configurations. In the course of this project, the AMTOC team has published 13 refereed journal articles, 21 refereed conference papers, and 2 NIA reports. The AMTOC team presented the results of this research at 36 international and national conferences, meeting and seminars, including International Conference on CFD, and numerous AIAA conferences and meetings. Selected publications that include the major results of the AMTOC project are enclosed in this report.

  17. Supersonic wing and wing-body shape optimization using an adjoint formulation

    NASA Technical Reports Server (NTRS)

    Reuther, James; Jameson, Antony

    1995-01-01

    This paper describes the implementation of optimization techniques based on control theory for wing and wing-body design of supersonic configurations. The work represents an extension of our earlier research in which control theory is used to devise a design procedure that significantly reduces the computational cost by employing an adjoint equation. In previous studies it was shown that control theory could be used toeviseransonic design methods for airfoils and wings in which the shape and the surrounding body-fitted mesh are both generated analytically, and the control is the mapping function. The method has also been implemented for both transonic potential flows and transonic flows governed by the Euler equations using an alternative formulation which employs numerically generated grids, so that it can treat more general configurations. Here results are presented for three-dimensional design cases subject to supersonic flows governed by the Euler equation.

  18. Mantle-driven uplift of Hangai Dome: New seismic constraints from adjoint tomography

    NASA Astrophysics Data System (ADS)

    Chen, Min; Niu, Fenglin; Liu, Qinya; Tromp, Jeroen

    2015-09-01

    The origin of Hangai Dome, an unusual large-scale, high-elevation low-relief landform in central Mongolia, remains enigmatic partly due to lack of constraints on its underlying seismic structure. Using adjoint tomography—a full waveform tomographic technique—and a large seismic waveform data set in East Asia, we discover beneath the dome a deep low shear wave speed (low-V) conduit indicating a slightly warmer (54 K to 127 K) upwelling from the transition zone. This upwelling is spatially linked to a broader uppermost mantle low-V region underlying the dome. Further observations of high compressional to shear wave speed ratios and positive radial anisotropy in the low-V region suggest partial melting and horizontal melt transport. We propose that the mantle upwelling induced decompression melting in the uppermost mantle and that excess heat associated with melt transport modified the lithosphere that isostatically compensates the surface uplift at upper mantle depths (>80 km).

  19. Discrete Adjoint-Based Design for Unsteady Turbulent Flows On Dynamic Overset Unstructured Grids

    NASA Technical Reports Server (NTRS)

    Nielsen, Eric J.; Diskin, Boris

    2012-01-01

    A discrete adjoint-based design methodology for unsteady turbulent flows on three-dimensional dynamic overset unstructured grids is formulated, implemented, and verified. The methodology supports both compressible and incompressible flows and is amenable to massively parallel computing environments. The approach provides a general framework for performing highly efficient and discretely consistent sensitivity analysis for problems involving arbitrary combinations of overset unstructured grids which may be static, undergoing rigid or deforming motions, or any combination thereof. General parent-child motions are also accommodated, and the accuracy of the implementation is established using an independent verification based on a complex-variable approach. The methodology is used to demonstrate aerodynamic optimizations of a wind turbine geometry, a biologically-inspired flapping wing, and a complex helicopter configuration subject to trimming constraints. The objective function for each problem is successfully reduced and all specified constraints are satisfied.

  20. Transition probabilities for non self-adjoint Hamiltonians in infinite dimensional Hilbert spaces

    SciTech Connect

    Bagarello, F.

    2015-11-15

    In a recent paper we have introduced several possible inequivalent descriptions of the dynamics and of the transition probabilities of a quantum system when its Hamiltonian is not self-adjoint. Our analysis was carried out in finite dimensional Hilbert spaces. This is useful, but quite restrictive since many physically relevant quantum systems live in infinite dimensional Hilbert spaces. In this paper we consider this situation, and we discuss some applications to well known models, introduced in the literature in recent years: the extended harmonic oscillator, the Swanson model and a generalized version of the Landau levels Hamiltonian. Not surprisingly we will find new interesting features not previously found in finite dimensional Hilbert spaces, useful for a deeper comprehension of this kind of physical systems.

  1. A new zonation algorithm with parameter estimation using hydraulic head and subsidence observations.

    PubMed

    Zhang, Meijing; Burbey, Thomas J; Nunes, Vitor Dos Santos; Borggaard, Jeff

    2014-01-01

    Parameter estimation codes such as UCODE_2005 are becoming well-known tools in groundwater modeling investigations. These programs estimate important parameter values such as transmissivity (T) and aquifer storage values (Sa ) from known observations of hydraulic head, flow, or other physical quantities. One drawback inherent in these codes is that the parameter zones must be specified by the user. However, such knowledge is often unknown even if a detailed hydrogeological description is available. To overcome this deficiency, we present a discrete adjoint algorithm for identifying suitable zonations from hydraulic head and subsidence measurements, which are highly sensitive to both elastic (Sske) and inelastic (Sskv) skeletal specific storage coefficients. With the advent of interferometric synthetic aperture radar (InSAR), distributed spatial and temporal subsidence measurements can be obtained. A synthetic conceptual model containing seven transmissivity zones, one aquifer storage zone and three interbed zones for elastic and inelastic storage coefficients were developed to simulate drawdown and subsidence in an aquifer interbedded with clay that exhibits delayed drainage. Simulated delayed land subsidence and groundwater head data are assumed to be the observed measurements, to which the discrete adjoint algorithm is called to create approximate spatial zonations of T, Sske , and Sskv . UCODE-2005 is then used to obtain the final optimal parameter values. Calibration results indicate that the estimated zonations calculated from the discrete adjoint algorithm closely approximate the true parameter zonations. This automation algorithm reduces the bias established by the initial distribution of zones and provides a robust parameter zonation distribution.

  2. A User's Manual for MASH V1.5 - A Monte Carlo Adjoint Shielding Code System

    SciTech Connect

    C. O. Slater; J. M. Barnes; J. O. Johnson; J.D. Drischler

    1998-10-01

    The Monte Carlo ~djoint ~ielding Code System, MASH, calculates neutron and gamma- ray environments and radiation protection factors for armored military vehicles, structures, trenches, and other shielding configurations by coupling a forward discrete ordinates air- over-ground transport calculation with an adjoint Monte Carlo treatment of the shielding geometry. Efficiency and optimum use of computer time are emphasized. The code system includes the GRTUNCL and DORT codes for air-over-ground transport calculations, the MORSE code with the GIFT5 combinatorial geometry package for adjoint shielding calculations, and several peripheral codes that perform the required data preparations, transformations, and coupling functions. The current version, MASH v 1.5, is the successor to the original MASH v 1.0 code system initially developed at Oak Ridge National Laboratory (ORNL). The discrete ordinates calculation determines the fluence on a coupling surface surrounding the shielding geometry due to an external neutron/gamma-ray source. The Monte Carlo calculation determines the effectiveness of the fluence at that surface in causing a response in a detector within the shielding geometry, i.e., the "dose importance" of the coupling surface fluence. A coupling code folds the fluence together with the dose importance, giving the desired dose response. The coupling code can determine the dose response as a function of the shielding geometry orientation relative to the source, distance from the source, and energy response of the detector. This user's manual includes a short description of each code, the input required to execute the code along with some helpful input data notes, and a representative sample problem.

  3. The design and implementation of cost-effective algorithms for direct solution of banded linear systems on the vector processor system 32 supercomputer

    NASA Technical Reports Server (NTRS)

    Samba, A. S.

    1985-01-01

    The problem of solving banded linear systems by direct (non-iterative) techniques on the Vector Processor System (VPS) 32 supercomputer is considered. Two efficient direct methods for solving banded linear systems on the VPS 32 are described. The vector cyclic reduction (VCR) algorithm is discussed in detail. The performance of the VCR on a three parameter model problem is also illustrated. The VCR is an adaptation of the conventional point cyclic reduction algorithm. The second direct method is the Customized Reduction of Augmented Triangles' (CRAT). CRAT has the dominant characteristics of an efficient VPS 32 algorithm. CRAT is tailored to the pipeline architecture of the VPS 32 and as a consequence the algorithm is implicitly vectorizable.

  4. A New Method for Computing Three-Dimensional Capture Fraction in Heterogeneous Regional Systems using the MODFLOW Adjoint Code

    NASA Astrophysics Data System (ADS)

    Clemo, T. M.; Ramarao, B.; Kelly, V. A.; Lavenue, M.

    2011-12-01

    Capture is a measure of the impact of groundwater pumping upon groundwater and surface water systems. The computation of capture through analytical or numerical methods has been the subject of articles in the literature for several decades (Bredehoeft et al., 1982). Most recently Leake et al. (2010) described a systematic way to produce capture maps in three-dimensional systems using a numerical perturbation approach in which capture from streams was computed using unit rate pumping at many locations within a MODFLOW model. The Leake et al. (2010) method advances the current state of computing capture. A limitation stems from the computational demand required by the perturbation approach wherein days or weeks of computational time might be required to obtain a robust measure of capture. In this paper, we present an efficient method to compute capture in three-dimensional systems based upon adjoint states. The efficiency of the adjoint method will enable uncertainty analysis to be conducted on capture calculations. The USGS and INTERA have collaborated to extend the MODFLOW Adjoint code (Clemo, 2007) to include stream-aquifer interaction and have applied it to one of the examples used in Leake et al. (2010), the San Pedro Basin MODFLOW model. With five layers and 140,800 grid blocks per layer, the San Pedro Basin model, provided an ideal example data set to compare the capture computed from the perturbation and the adjoint methods. The capture fraction map produced from the perturbation method for the San Pedro Basin model required significant computational time to compute and therefore the locations for the pumping wells were limited to 1530 locations in layer 4. The 1530 direct simulations of capture require approximately 76 CPU hours. Had capture been simulated in each grid block in each layer, as is done in the adjoint method, the CPU time would have been on the order of 4 years. The MODFLOW-Adjoint produced the capture fraction map of the San Pedro Basin model

  5. What can adjoint modelling tell about the response of the Greenland Ice Sheet to changes in basal sliding?

    NASA Astrophysics Data System (ADS)

    McGovern, Jonathan; Rutt, Ian; Murray, Tavi; Utke, Jean

    2013-04-01

    Studying the future behaviour of the Greenland Ice Sheet is important considering the ice sheet has a sea-level equivalent of 7 metres and the rate of mass loss from it is increasing (Velicogna, 2009). Examining the modelled response of the Greenland Ice Sheet to changes in forcing parameters can give insight into how it will behave in the future. The response of the ice sheet to specific changes in forcing parameters is referred to as the sensitivity. Being able to obtain model sensitivities in as little computation time as possible would be useful for examining the future response of the Greenland Ice Sheet. Adjoint models allow sensitivities to be obtained more efficiently than the conventional way, when considering spatially varying parameters. Conventionally, such sensitivities are obtained by perturbing a parameter at every grid point in turn and calculating the sensitivity at every grid point. Adjoint sensitivities, though, are calculated in a single step. This reduces the computational cost when obtaining sensitivities over large model domains. The adjoint method also has the advantage that it gives the exact value of the model sensitivity, rather than a finite difference approximation to it. We present the adjoint of a finite difference, shallow ice, thermomechanical ice sheet model with basal sliding, applied to the Greenland Ice Sheet. This adjoint model is obtained using the OpenAD automatic differentiation tool (Utke, 2006), which is open source. The adjoint model is validated by comparing adjoint and forward model sensitivities over 100 years. This work builds on the work of Heimbach (2009). We use the adjoint model to examine the sensitivity of the model to changes in basal sliding. About half the mass loss from the Greenland Ice Sheet occurs from surface runoff and half from dynamic mass loss (Broeke, 2009). Melt-water from Greenland Ice Sheet supra-glacial lakes can percolate to the bed through moulins. The melt-water that reaches the bed can then

  6. An Evolution Operator Solution for a Nonlinear Beam Equation

    DTIC Science & Technology

    1990-12-01

    uniqueness for the parabolic problem Ug + (-A) m u+ I I- u = f (14) on RN X (0, 1). Again, certain restrictions apply. The Schr ~ dinger equation , [68:pg 823...evolution equation because of the time dependence in the definition of the operator A. He identifies conditions for the existence of a unique solution. In...The arguments for the adjoint and dissipativity are not repeated. Because of the explicit time dependence , (71) is called an evolution equation . For

  7. Development of an adjoint model of GRAPES-CUACE and its application in tracking influential haze source areas in north China

    NASA Astrophysics Data System (ADS)

    An, Xing Qin; Xian Zhai, Shi; Jin, Min; Gong, Sunling; Wang, Yu

    2016-06-01

    The aerosol adjoint module of the atmospheric chemical modeling system GRAPES-CUACE (Global-Regional Assimilation and Prediction System coupled with the CMA Unified Atmospheric Chemistry Environment) is constructed based on the adjoint theory. This includes the development and validation of the tangent linear and the adjoint models of the three parts involved in the GRAPES-CUACE aerosol module: CAM (Canadian Aerosol Module), interface programs that connect GRAPES and CUACE, and the aerosol transport processes that are embedded in GRAPES. Meanwhile, strict mathematical validation schemes for the tangent linear and the adjoint models are implemented for all input variables. After each part of the module and the assembled tangent linear and adjoint models is verified, the adjoint model of the GRAPES-CUACE aerosol is developed and used in a black carbon (BC) receptor-source sensitivity analysis to track influential haze source areas in north China. The sensitivity of the average BC concentration over Beijing at the highest concentration time point (referred to as the Objective Function) is calculated with respect to the BC amount emitted over the Beijing-Tianjin-Hebei region. Four types of regions are selected based on the administrative division or the sensitivity coefficient distribution. The adjoint sensitivity results are then used to quantify the effect of reducing the emission sources at different time intervals over different regions. It is indicated that the more influential regions (with relatively larger sensitivity coefficients) do not necessarily correspond to the administrative regions. Instead, the influence per unit area of the sensitivity selected regions is greater. Therefore, controlling the most influential regions during critical time intervals based on the results of the adjoint sensitivity analysis is much more efficient than controlling administrative regions during an experimental time period.

  8. A heuristic for suffix solutions

    SciTech Connect

    Bilgory, A.; Gajski, D.D.

    1986-01-01

    The suffix problem has appeared in solutions of recurrence systems for parallel and pipelined machines and more recently in the design of gate and silicon compilers. In this paper the authors present two algorithms. The first algorithm generates parallel suffix solutions with minimum cost for a given length, time delay, availability of initial values, and fanout. This algorithm generates a minimal solution for any length n and depth range log/sub 2/ N to N. The second algorithm reduces the size of the solutions generated by the first algorithm.

  9. Variational data assimilation with a semi-Lagrangian semi-implicit global shallow-water equation model and its adjoint

    NASA Technical Reports Server (NTRS)

    Li, Y.; Navon, I. M.; Courtier, P.; Gauthier, P.

    1993-01-01

    An adjoint model is developed for variational data assimilation using the 2D semi-Lagrangian semi-implicit (SLSI) shallow-water equation global model of Bates et al. with special attention being paid to the linearization of the interpolation routines. It is demonstrated that with larger time steps the limit of the validity of the tangent linear model will be curtailed due to the interpolations, especially in regions where sharp gradients in the interpolated variables coupled with strong advective wind occur, a synoptic situation common in the high latitudes. This effect is particularly evident near the pole in the Northern Hemisphere during the winter season. Variational data assimilation experiments of 'identical twin' type with observations available only at the end of the assimilation period perform well with this adjoint model. It is confirmed that the computational efficiency of the semi-Lagrangian scheme is preserved during the minimization process, related to the variational data assimilation procedure.

  10. Coupled forward-adjoint Monte Carlo simulation of spatial-angular light fields to determine optical sensitivity in turbid media

    PubMed Central

    Gardner, Adam R.; Hayakawa, Carole K.; Venugopalan, Vasan

    2014-01-01

    Abstract. We present a coupled forward-adjoint Monte Carlo (cFAMC) method to determine the spatially resolved sensitivity distributions produced by optical interrogation of three-dimensional (3-D) tissue volumes. We develop a general computational framework that computes the spatial and angular distributions of the forward-adjoint light fields to provide accurate computations in mesoscopic tissue volumes. We provide full computational details of the cFAMC method and provide results for low- and high-scattering tissues probed using a single pair of optical fibers. We examine the effects of source-detector separation and orientation on the sensitivity distributions and consider how the degree of angular discretization used in the 3-D tissue model impacts the accuracy of the resulting absorption sensitivity profiles. We discuss the value of such computations for optical imaging and the design of optical measurements. PMID:24972356

  11. Adjoint-Based Design of Rotors using the Navier-Stokes Equations in a Noninertial Reference Frame

    NASA Technical Reports Server (NTRS)

    Nielsen, Eric J.; Lee-Rausch, Elizabeth M.; Jones, William T.

    2009-01-01

    Optimization of rotorcraft flowfields using an adjoint method generally requires a time-dependent implementation of the equations. The current study examines an intermediate approach in which a subset of rotor flowfields are cast as steady problems in a noninertial reference frame. This technique permits the use of an existing steady-state adjoint formulation with minor modifications to perform sensitivity analyses. The formulation is valid for isolated rigid rotors in hover or where the freestream velocity is aligned with the axis of rotation. Discrete consistency of the implementation is demonstrated using comparisons with a complex-variable technique, and a number of single- and multi-point optimizations for the rotorcraft figure of merit function are shown for varying blade collective angles. Design trends are shown to remain consistent as the grid is refined.

  12. Adjoint-Based Design of Rotors Using the Navier-Stokes Equations in a Noninertial Reference Frame

    NASA Technical Reports Server (NTRS)

    Nielsen, Eric J.; Lee-Rausch, Elizabeth M.; Jones, William T.

    2010-01-01

    Optimization of rotorcraft flowfields using an adjoint method generally requires a time-dependent implementation of the equations. The current study examines an intermediate approach in which a subset of rotor flowfields are cast as steady problems in a noninertial reference frame. This technique permits the use of an existing steady-state adjoint formulation with minor modifications to perform sensitivity analyses. The formulation is valid for isolated rigid rotors in hover or where the freestream velocity is aligned with the axis of rotation. Discrete consistency of the implementation is demonstrated by using comparisons with a complex-variable technique, and a number of single- and multipoint optimizations for the rotorcraft figure of merit function are shown for varying blade collective angles. Design trends are shown to remain consistent as the grid is refined.

  13. An approach to computing discrete adjoints for MPI-parallelized models applied to Ice Sheet System Model 4.11

    NASA Astrophysics Data System (ADS)

    Larour, Eric; Utke, Jean; Bovin, Anton; Morlighem, Mathieu; Perez, Gilberto

    2016-11-01

    Within the framework of sea-level rise projections, there is a strong need for hindcast validation of the evolution of polar ice sheets in a way that tightly matches observational records (from radar, gravity, and altimetry observations mainly). However, the computational requirements for making hindcast reconstructions possible are severe and rely mainly on the evaluation of the adjoint state of transient ice-flow models. Here, we look at the computation of adjoints in the context of the NASA/JPL/UCI Ice Sheet System Model (ISSM), written in C++ and designed for parallel execution with MPI. We present the adaptations required in the way the software is designed and written, but also generic adaptations in the tools facilitating the adjoint computations. We concentrate on the use of operator overloading coupled with the AdjoinableMPI library to achieve the adjoint computation of the ISSM. We present a comprehensive approach to (1) carry out type changing through the ISSM, hence facilitating operator overloading, (2) bind to external solvers such as MUMPS and GSL-LU, and (3) handle MPI-based parallelism to scale the capability. We demonstrate the success of the approach by computing sensitivities of hindcast metrics such as the misfit to observed records of surface altimetry on the northeastern Greenland Ice Stream, or the misfit to observed records of surface velocities on Upernavik Glacier, central West Greenland. We also provide metrics for the scalability of the approach, and the expected performance. This approach has the potential to enable a new generation of hindcast-validated projections that make full use of the wealth of datasets currently being collected, or already collected, in Greenland and Antarctica.

  14. Sensitivity analysis of a model of CO{sub 2} exchange in tundra ecosystems by the adjoint method

    SciTech Connect

    Waelbroeck, C.; Louis, J.F.

    1995-02-20

    A model of net primary production (NPP), decomposition, and nitrogen cycling in tundra ecosystems has been developed. The adjoint technique is used to study the sensitivity of the computed annual net CO{sub 2} flux to perturbations in initial conditions, climatic inputs, and model`s main parameters describing current seasonal CO{sub 2} exchange in wet sedge tundra at Barrow, Alaska. The results show that net CO{sub 2} flux is more sensitive to decomposition parameters than to NPP parameters. This underlines the fact that in nutrient-limited ecosystems, decomposition drives net CO{sub 2} exchange by controlling mineralization of main nutrients. The results also indicate that the short-term (1 year) response of wet sedge tundra to CO{sub 2}-induced warming is a significant increase in CO{sub 2} emission, creating a positive feedback to atmospheric CO{sub 2} accumulation. However, a cloudiness increase during the same year can severely alter this response and lead to either a slight decrease or a strong increase in emitted CO{sub 2}, depending on its exact timing. These results demonstrate that the adjoint method is well suited to study systems encountering regime changes, as a single run of the adjoint model provides sensitivities of the net CO{sub 2} flux to perturbations in all parameters and variables at any time of the year. Moreover, it is shown that large errors due to the presence of thresholds can be avoided by first delimiting the range of applicability of the adjoint results. 38 refs., 10 figs., 7 tabs.

  15. Assessing the Impact of Advanced Satellite Observations in the NASA GEOS-5 Forecast System Using the Adjoint Method

    NASA Technical Reports Server (NTRS)

    Gelaro, Ron; Liu, Emily; Sienkiewicz, Meta

    2011-01-01

    The adjoint of a data assimilation system provides a flexible and efficient tool for estimating observation impacts on short-range weather forecasts. The impacts of any or all observations can be estimated simultaneously based on a single execution of the adjoint system. The results can be easily aggregated according to data type, location, channel, etc., making this technique especially attractive for examining the impacts of new hyper-spectral satellite instruments and for conducting regular, even near-real time, monitoring of the entire observing system. In this talk, we present results from the adjoint-based observation impact monitoring tool in NASA's GEOS-5 global atmospheric data assimilation and forecast system. The tool has been running in various off-line configurations for some time, and is scheduled to run as a regular part of the real-time forecast suite beginning in autumn 20 I O. We focus on the impacts of the newest components of the satellite observing system, including AIRS, IASI and GPS. For AIRS and IASI, it is shown that the vast majority of the channels assimilated have systematic positive impacts (of varying magnitudes), although some channels degrade the forecast. Of the latter, most are moisture-sensitive or near-surface channels. The impact of GPS observations in the southern hemisphere is found to be a considerable overall benefit to the system. In addition, the spatial variability of observation impacts reveals coherent patterns of positive and negative impacts that may point to deficiencies in the use of certain observations over, for example, specific surface types. When performed in conjunction with selected observing system experiments (OSEs), the adjoint results reveal both redundancies and dependencies between observing system impacts as observations are added or removed from the assimilation system. Understanding these dependencies appears to pose a major challenge for optimizing the use of the current observational network and

  16. Calculating Air Quality and Climate Co-Benefits Metrics from Adjoint Elasticities in Chemistry-Climate Models

    NASA Astrophysics Data System (ADS)

    Spak, S.; Henze, D. K.; Carmichael, G. R.

    2013-12-01

    The science and policy communities both need common metrics that clearly, comprehensively, and intuitively communicate the relative sensitivities of air quality and climate to emissions control strategies, include emissions and process uncertainties, and minimize the range of error that is transferred to the metric. This is particularly important because most emissions control policies impact multiple short-lived climate forcing agents, and non-linear climate and health responses in space and time limit the accuracy and policy value of simple emissions-based calculations. Here we describe and apply new second-order elasticity metrics to support the direct comparison of emissions control policies for air quality and health co-benefits analyses using adjoint chemical transport and chemistry-climate models. Borrowing an econometric concept, the simplest elasticities in the atmospheric system are the percentage changes in concentrations due to a percentage change in the emissions. We propose a second-order elasticity metric, the Emissions Reduction Efficiency, which supports comparison across compounds, to long-lived climate forcing agents like CO2, and to other air quality impacts, at any temporal or spatial scale. These adjoint-based metrics (1) possess a single uncertainty range; (2) allow for the inclusion of related health and other impacts effects within the same framework; (3) take advantage of adjoint and forward sensitivity models; and (4) are easily understood. Using global simulations with the adjoint of GEOS-Chem, we apply these metrics to identify spatial and sectoral variability in the climate and health co-benefits of sectoral emissions controls on black carbon, sulfur dioxide, and PM2.5. We find spatial gradients in optimal control strategies on every continent, along with differences among megacities.

  17. NESTLE: Few-group neutron diffusion equation solver utilizing the nodal expansion method for eigenvalue, adjoint, fixed-source steady-state and transient problems

    SciTech Connect

    Turinsky, P.J.; Al-Chalabi, R.M.K.; Engrand, P.; Sarsour, H.N.; Faure, F.X.; Guo, W.

    1994-06-01

    NESTLE is a FORTRAN77 code that solves the few-group neutron diffusion equation utilizing the Nodal Expansion Method (NEM). NESTLE can solve the eigenvalue (criticality); eigenvalue adjoint; external fixed-source steady-state; or external fixed-source. or eigenvalue initiated transient problems. The code name NESTLE originates from the multi-problem solution capability, abbreviating Nodal Eigenvalue, Steady-state, Transient, Le core Evaluator. The eigenvalue problem allows criticality searches to be completed, and the external fixed-source steady-state problem can search to achieve a specified power level. Transient problems model delayed neutrons via precursor groups. Several core properties can be input as time dependent. Two or four energy groups can be utilized, with all energy groups being thermal groups (i.e. upscatter exits) if desired. Core geometries modelled include Cartesian and Hexagonal. Three, two and one dimensional models can be utilized with various symmetries. The non-linear iterative strategy associated with the NEM method is employed. An advantage of the non-linear iterative strategy is that NSTLE can be utilized to solve either the nodal or Finite Difference Method representation of the few-group neutron diffusion equation.

  18. Slope tomography based on eikonal solvers and the adjoint-state method

    NASA Astrophysics Data System (ADS)

    Tavakoli, B.; Operto, S.; Ribodetti, A.; Virieux, J.

    2017-03-01

    Velocity macro-model building is a crucial step in the seismic imaging workflow as it provides the necessary background model for migration or full waveform inversion. In this study, we present a new formulation of stereotomography that can handle more efficiently long-offset acquisition, complex geological structures and large-scale datasets. Stereotomography is a slope tomographic method based upon a semi-automatic picking of local coherent events. Each local coherent event, characterised by its two-way traveltime and two slopes in common-shot and common-receiver gathers, is tied to a scatterer or a reflector segment in the subsurface. Ray tracing provides a natural forward engine to compute traveltime and slopes but can suffer from non-uniform ray sampling in presence of complex media and long-offset acquisitions. Moreover, most implementations of stereotomography explicitly build a sensitivity matrix, leading to the resolution of large systems of linear equations, which can be cumbersome when large-scale datasets are considered. Overcoming these issues comes with a new matrix-free formulation of stereotomography: a factored eikonal solver based on the fast sweeping method to compute first-arrival traveltimes and an adjoint-state formulation to compute the gradient of the misfit function. By solving eikonal equation from sources and receivers, we make the computational cost proportional to the number of sources and receivers while it is independent of picked events density in each shot and receiver gather. The model space involves the subsurface velocities and the scatterer coordinates, while the dip of the reflector segments are implicitly represented by the spatial support of the adjoint sources and are updated through the joint localization of nearby scatterers. We present an application on the complex Marmousi model for a towed-streamer acquisition and a realistic distribution of local events. We show that the estimated model, built without any prior

  19. Adjoint tomography of crust and upper-mantle structure beneath Continental China

    NASA Astrophysics Data System (ADS)

    Chen, M.; Niu, F.; Liu, Q.; Tromp, J.

    2013-12-01

    Four years of regional earthquake recordings from 1,869 seismic stations are used for high-resolution and high-fidelity seismic imaging of the crust and upper-mantle structure beneath Continental China. This unprecedented high-density dataset is comprised of seismograms recorded by the China Earthquake Administration Array (CEArray), NorthEast China Extended SeiSmic Array (NECESSArray), INDEPTH-IV Array, F-net and other global and regional seismic networks, and involves 1,326,384 frequency-dependent phase measurements. Adjoint tomography is applied to this unprecedented dataset, aiming to resolve detailed 3D maps of compressional and shear wavespeeds, and radial anisotropy. Contrary to traditional ray-theory based tomography, adjoint tomography takes into account full 3D wave propagation effects and off-ray-path sensitivity. In our implementation, it utilizes a spectral-element method for precise wave propagation simulations. The tomographic method starts with a 3D initial model that combines smooth radially anisotropic mantle model S362ANI and 3D crustal model Crust2.0. Traveltime and amplitude misfits are minimized iteratively based on a conjugate gradient method, harnessing 3D finite-frequency kernels computed for each updated 3D model. After 17 iterations, our inversion reveals strong correlations of 3D wavespeed heterogeneities in the crust and upper mantle with surface tectonic units, such as the Himalaya Block, the Tibetan Plateau, the Tarim Basin, the Ordos Block, and the South China Block. Narrow slab features emerge from the smooth initial model above the transition zone beneath the Japan, Ryukyu, Philippine, Izu-Bonin, Mariana and Andaman arcs. 3D wavespeed variations appear comparable to or much sharper than in high-frequency P-and S-wave models from previous studies. Moreover our results include new information, such as 3D variations of radial anisotropy and the Vp/Vs ratio, which are expected to shed new light to the composition, thermal state, flow

  20. Adjoint-based computation of U.S. nationwide ozone exposure isopleths

    NASA Astrophysics Data System (ADS)

    Ashok, Akshay; Barrett, Steven R. H.

    2016-05-01

    Population exposure to daily maximum ozone is associated with an increased risk of premature mortality, and efforts to mitigate these impacts involve reducing emissions of nitrogen oxides (NOx) and volatile organic compounds (VOCs). We quantify the dependence of U.S. national exposure to annually averaged daily maximum ozone on ambient VOC and NOx concentrations through ozone exposure isopleths, developed using emissions sensitivities from the adjoint of the GEOS-Chem air quality model for 2006. We develop exposure isopleths for all locations within the contiguous US and derive metrics based on the isopleths that quantify the impact of emissions on national ozone exposure. This work is the first to create ozone exposure isopleths using adjoint sensitivities and at a large scale. We find that across the US, 29% of locations experience VOC-limited conditions (where increased NOx emissions lower ozone) during 51% of the year on average. VOC-limited conditions are approximately evenly distributed diurnally and occur more frequently during the fall and winter months (67% of the time) than in the spring and summer (37% of the time). The VOC/NOx ratio of the ridge line on the isopleth diagram (denoting a local maximum in ozone exposure with respect to NOx concentrations) is 9.2 ppbC/ppb on average across grid cells that experience VOC-limited conditions and 7.9, 10.1 and 6.7 ppbC/ppb at the three most populous US cities of New York, Los Angeles and Chicago, respectively. Emissions that are ozone exposure-neutral during VOC-limited exposure conditions result in VOC/NOx concentration ratios of 0.63, 1.61 and 0.72 ppbC/ppb at each of the three US cities respectively, and between 0.01 and 1.91 ppbC/ppb at other locations. The sensitivity of national ozone exposure to NOx and VOC emissions is found to be highest near major cities in the US. Together, this information can be used to assess the effectiveness of NOx and VOC emission reductions on mitigating ozone exposure in the

  1. Curvature theory for point-path and plane-envelope in spherical kinematics by new adjoint approach

    NASA Astrophysics Data System (ADS)

    Wang, Wei; Wang, Delun

    2014-11-01

    Planar kinematics has been studied systematically based on centrodes, however axodes are underutilized to set up the curvature theories in spherical and spatial kinematics. Through a spherical adjoint approach, an axode-based theoretical system of spherical kinematics is established. The spherical motion is re-described by the adjoint approach and vector equation of spherical instant center is concisely derived. The moving and fixed axodes for spherical motion are mapped onto a unit sphere to obtain spherical centrodes, whose kinematic invariants totally reflect the intrinsic property of spherical motion. Based on the spherical centrodes, the curvature theories for a point and a plane of a rigid body in spherical motion are revealed by spherical fixed point and plane conditions. The Euler-Savary analogue for point-path is presented. Tracing points with higher order curvature features are located in the moving body by means of algebraic equations. For plane-envelope, the construction parameters are obtained. The osculating conditions for plane-envelope and circular cylindrical surface or circular conical surface are given. A spherical four-bar linkage is taken as an example to demonstrate the spherical adjoint approach and the curvature theories. The research proposes systematic spherical curvature theories with the axode as logical starting-point, and sets up a bridge from the centrode-based planar kinematics to the axode-based spatial kinematics.

  2. Development of a High-Order Space-Time Matrix-Free Adjoint Solver

    NASA Technical Reports Server (NTRS)

    Ceze, Marco A.; Diosady, Laslo T.; Murman, Scott M.

    2016-01-01

    The growth in computational power and algorithm development in the past few decades has granted the science and engineering community the ability to simulate flows over complex geometries, thus making Computational Fluid Dynamics (CFD) tools indispensable in analysis and design. Currently, one of the pacing items limiting the utility of CFD for general problems is the prediction of unsteady turbulent ows.1{3 Reynolds-averaged Navier-Stokes (RANS) methods, which predict a time-invariant mean flowfield, struggle to provide consistent predictions when encountering even mild separation, such as the side-of-body separation at a wing-body junction. NASA's Transformative Tools and Technologies project is developing both numerical methods and physical modeling approaches to improve the prediction of separated flows. A major focus of this e ort is efficient methods for resolving the unsteady fluctuations occurring in these flows to provide valuable engineering data of the time-accurate flow field for buffet analysis, vortex shedding, etc. This approach encompasses unsteady RANS (URANS), large-eddy simulations (LES), and hybrid LES-RANS approaches such as Detached Eddy Simulations (DES). These unsteady approaches are inherently more expensive than traditional engineering RANS approaches, hence every e ort to mitigate this cost must be leveraged. Arguably, the most cost-effective approach to improve the efficiency of unsteady methods is the optimal placement of the spatial and temporal degrees of freedom (DOF) using solution-adaptive methods.

  3. Geothermal reservoir monitoring based upon spectral-element and adjoint methods

    NASA Astrophysics Data System (ADS)

    Morency, C.; Templeton, D. C.; Harris, D.; Mellors, R. J.

    2011-12-01

    Induced seismicity associated with CO2 sequestration, enhanced oil recovery, and enhanced geothermal systems is triggered by fracturing during fluid injection. These events range from magnitude -1 (microseismicity) up to 3.5, for induced seismicity on pre-existing faults. In our approach, we are using seismic data collected at the Salton Sea geothermal field, to improve the current structural model (SCEC CVM4.0 including a 10m resolution topography) and to invert for the moment tensor and source location of the microseismic events. The key here is to refine the velocity model to then precisely invert for the location and mechanism (tensile or shear) of fracture openings. This information is crucial for geothermal reservoir assessment, especially in an unconventional setting where hydrofracturing is used to enhance productivity. The location of pre-existing and formed fractures as well as their type of openings are important elements for strategic decisions. Numerical simulations are performed using a spectral-element method, which contrary to finite-element methods (FEM), uses high degree Lagrange polynomials, allowing the technique to not only handle complex geometries, like the FEM, but also to retain the strength of exponential convergence and accuracy due to the use of high degree polynomials. Finite-frequency sensitivity kernels, used in the non-linear iterative inversions, are calculated based on an adjoint method.

  4. Adjoint Monte Carlo simulation of fusion product activation probe experiment in ASDEX Upgrade tokamak

    NASA Astrophysics Data System (ADS)

    Äkäslompolo, S.; Bonheure, G.; Tardini, G.; Kurki-Suonio, T.; The ASDEX Upgrade Team

    2015-10-01

    The activation probe is a robust tool to measure flux of fusion products from a magnetically confined plasma. A carefully chosen solid sample is exposed to the flux, and the impinging ions transmute the material making it radioactive. Ultra-low level gamma-ray spectroscopy is used post mortem to measure the activity and, thus, the number of fusion products. This contribution presents the numerical analysis of the first measurement in the ASDEX Upgrade tokamak, which was also the first experiment to measure a single discharge. The ASCOT suite of codes was used to perform adjoint/reverse Monte Carlo calculations of the fusion products. The analysis facilitates, for the first time, a comparison of numerical and experimental values for absolutely calibrated flux. The results agree to within a factor of about two, which can be considered a quite good result considering the fact that all features of the plasma cannot be accounted in the simulations.Also an alternative to the present probe orientation was studied. The results suggest that a better optimized orientation could measure the flux from a significantly larger part of the plasma. A shorter version of this contribution is due to be published in PoS at: 1st EPS conference on Plasma Diagnostics

  5. Automated divertor target design by adjoint shape sensitivity analysis and a one-shot method

    SciTech Connect

    Dekeyser, W.; Reiter, D.; Baelmans, M.

    2014-12-01

    As magnetic confinement fusion progresses towards the development of first reactor-scale devices, computational tokamak divertor design is a topic of high priority. Presently, edge plasma codes are used in a forward approach, where magnetic field and divertor geometry are manually adjusted to meet design requirements. Due to the complex edge plasma flows and large number of design variables, this method is computationally very demanding. On the other hand, efficient optimization-based design strategies have been developed in computational aerodynamics and fluid mechanics. Such an optimization approach to divertor target shape design is elaborated in the present paper. A general formulation of the design problems is given, and conditions characterizing the optimal designs are formulated. Using a continuous adjoint framework, design sensitivities can be computed at a cost of only two edge plasma simulations, independent of the number of design variables. Furthermore, by using a one-shot method the entire optimization problem can be solved at an equivalent cost of only a few forward simulations. The methodology is applied to target shape design for uniform power load, in simplified edge plasma geometry.

  6. Improving NO(x) cap-and-trade system with adjoint-based emission exchange rates.

    PubMed

    Mesbah, S Morteza; Hakami, Amir; Schott, Stephan

    2012-11-06

    Cap-and-trade programs have proven to be effective instruments for achieving environmental goals while incurring minimum cost. The nature of the pollutant, however, affects the design of these programs. NO(x), an ozone precursor, is a nonuniformly mixed pollutant with a short atmospheric lifetime. NO(x) cap-and-trade programs in the U.S. are successful in reducing total NO(x) emissions but may result in suboptimal environmental performance because location-specific ozone formation potentials are neglected. In this paper, the current NO(x) cap-and-trade system is contrasted to a hypothetical NO(x) trading policy with sensitivity-based exchange rates. Location-specific exchange rates, calculated through adjoint sensitivity analysis, are combined with constrained optimization for prediction of NO(x) emissions trading behavior and post-trade ozone concentrations. The current and proposed policies are examined in a case study for 218 coal-fired power plants that participated in the NO(x) Budget Trading Program in 2007. We find that better environmental performance at negligibly higher system-wide abatement cost can be achieved through inclusion of emission exchange rates. Exposure-based exchange rates result in better environmental performance than those based on concentrations.

  7. Multi-point Adjoint-Based Design of Tilt-Rotors in a Noninertial Reference Frame

    NASA Technical Reports Server (NTRS)

    Jones, William T.; Nielsen, Eric J.; Lee-Rausch, Elizabeth M.; Acree, Cecil W.

    2014-01-01

    Optimization of tilt-rotor systems requires the consideration of performance at multiple design points. In the current study, an adjoint-based optimization of a tilt-rotor blade is considered. The optimization seeks to simultaneously maximize the rotorcraft figure of merit in hover and the propulsive efficiency in airplane-mode for a tilt-rotor system. The design is subject to minimum thrust constraints imposed at each design point. The rotor flowfields at each design point are cast as steady-state problems in a noninertial reference frame. Geometric design variables used in the study to control blade shape include: thickness, camber, twist, and taper represented by as many as 123 separate design variables. Performance weighting of each operational mode is considered in the formulation of the composite objective function, and a build up of increasing geometric degrees of freedom is used to isolate the impact of selected design variables. In all cases considered, the resulting designs successfully increase both the hover figure of merit and the airplane-mode propulsive efficiency for a rotor designed with classical techniques.

  8. Muon g -2 in gauge mediated supersymmetry breaking models with adjoint messengers

    NASA Astrophysics Data System (ADS)

    Gogoladze, Ilia; Ün, Cem Salih

    2017-02-01

    We explored the sparticle mass spectrum in light of the muon g -2 anomaly and the little hierarchy problem in a class of the gauge mediated supersymmetry breaking model. Here, the messenger fields transform in the adjoint representation of the Standard Model gauge symmetry. To avoid unacceptably light right-handed slepton masses, the Standard Model is supplemented by the additional U (1 )B-L gauge symmetry. A nonzero U (1 )B-L D term makes the right-handed slepton masses compatible with the current experimental bounds. We show that in the framework of Λ3<0 and μ <0 the muon g -2 anomaly and the observed 125 GeV Higgs boson mass can be simultaneously accommodated. The slepton masses in this case are predicted to lie in the few hundred GeV range, which can be tested at the LHC. Despite the heavy colored sparticle spectrum, the little hierarchy problem in this model can be ameliorated, and the electroweak fine-tuning parameter can be as low as 10 or so.

  9. An Efficient Radial Basis Function Mesh Deformation Scheme within an Adjoint-Based Aerodynamic Optimization Framework

    NASA Astrophysics Data System (ADS)

    Poirier, Vincent

    Mesh deformation schemes play an important role in numerical aerodynamic optimization. As the aerodynamic shape changes, the computational mesh must adapt to conform to the deformed geometry. In this work, an extension to an existing fast and robust Radial Basis Function (RBF) mesh movement scheme is presented. Using a reduced set of surface points to define the mesh deformation increases the efficiency of the RBF method; however, at the cost of introducing errors into the parameterization by not recovering the exact displacement of all surface points. A secondary mesh movement is implemented, within an adjoint-based optimization framework, to eliminate these errors. The proposed scheme is tested within a 3D Euler flow by reducing the pressure drag while maintaining lift of a wing-body configured Boeing-747 and an Onera-M6 wing. As well, an inverse pressure design is executed on the Onera-M6 wing and an inverse span loading case is presented for a wing-body configured DLR-F6 aircraft.

  10. Level density and level-spacing distributions of random, self-adjoint, non-Hermitian matrices

    NASA Astrophysics Data System (ADS)

    Joglekar, Yogesh N.; Karr, William A.

    2011-03-01

    We investigate the level density σ(x) and the level-spacing distribution p(s) of random matrices M=AF≠M†, where F is a (diagonal) inner product and A is a random, real, symmetric or complex, Hermitian matrix with independent entries drawn from a probability distribution q(x) with zero mean and finite higher moments. Although not Hermitian, the matrix M is self-adjoint with respect to F and thus has purely real eigenvalues. We find that the level density σF(x) is independent of the underlying distribution q(x) and solely characterized by F, and therefore generalizes the Wigner semicircle distribution σW(x). We find that the level-spacing distributions p(s) are independent of q(x), and are dependent upon both the inner product F and whether A is real or complex, and therefore generalize the Wigner surmise for level spacing. Our results suggest F-dependent generalizations of the well-known Gaussian Orthogonal Ensemble and Gaussian Unitary Ensemble classes.

  11. Seismic structure of the European crust and upper mantle based on adjoint tomography

    NASA Astrophysics Data System (ADS)

    Zhu, H.; Bozdag, E.; Peter, D.; Tromp, J.

    2013-12-01

    We present a new crustal and upper mantle model for the European continent and the North Atlantic Ocean, named EU60. It is constructed based on adjoint tomography and involves 3D variations in elastic wavespeeds, anelastic attenuation, and radial/azimuthal anisotropy. Long-wavelength elastic wavespeed structure of EU60 agree with previous body- and surface-wave tomographic models. Some hitherto unidentified features, such as the Adria microplate, naturally emerge from smoothed starting model. Subducting slabs, slab detachment, ancient suture zones, continental rifts and back-arc basins are well resolved in EU60. For anelastic structure, we find an anti-correlation between shear wavespeeds and anelastic attenuation at shallow depths. At greater depths, this anti-correlation becomes relatively weak, in agreement with previous attenuation studies at global scales. Consistent with radial anisotropy in 1D reference models, the European continent is dominated by features with radially anisotropic parameter xi>1, indicating the presence of horizontal flow within the upper mantle. In addition, subduction zones, such as the Apennines and Hellenic arcs, are characterized as vertical flow with xi<1 at depths greater than 150~km. For azimuthal anisotropy, we find that the direction of fast anisotropic axis is well correlated with complicated tectonic evolution in this region, such as extension along the North Atlantic Ridge, trench retreat in the Mediterranean and counter-clockwise rotation of the Anatolian Plate. The ``point spread function'' is used to assess image quality and analyze tradeoff between different model parameters.

  12. The Cartan algorithm in five dimensions

    NASA Astrophysics Data System (ADS)

    McNutt, D. D.; Coley, A. A.; Forget, A.

    2017-03-01

    In this paper, we introduce an algorithm to determine the equivalence of five dimensional spacetimes, which generalizes the Karlhede algorithm for four dimensional general relativity. As an alternative to the Petrov type classification, we employ the alignment classification to algebraically classify the Weyl tensor. To illustrate the algorithm, we discuss three examples: the singly rotating Myers-Perry solution, the Kerr (Anti-) de Sitter solution, and the rotating black ring solution. We briefly discuss some applications of the Cartan algorithm in five dimensions.

  13. The Superior Lambert Algorithm

    NASA Astrophysics Data System (ADS)

    der, G.

    2011-09-01

    Lambert algorithms are used extensively for initial orbit determination, mission planning, space debris correlation, and missile targeting, just to name a few applications. Due to the significance of the Lambert problem in Astrodynamics, Gauss, Battin, Godal, Lancaster, Gooding, Sun and many others (References 1 to 15) have provided numerous formulations leading to various analytic solutions and iterative methods. Most Lambert algorithms and their computer programs can only work within one revolution, break down or converge slowly when the transfer angle is near zero or 180 degrees, and their multi-revolution limitations are either ignored or barely addressed. Despite claims of robustness, many Lambert algorithms fail without notice, and the users seldom have a clue why. The DerAstrodynamics lambert2 algorithm, which is based on the analytic solution formulated by Sun, works for any number of revolutions and converges rapidly at any transfer angle. It provides significant capability enhancements over every other Lambert algorithm in use today. These include improved speed, accuracy, robustness, and multirevolution capabilities as well as implementation simplicity. Additionally, the lambert2 algorithm provides a powerful tool for solving the angles-only problem without artificial singularities (pointed out by Gooding in Reference 16), which involves 3 lines of sight captured by optical sensors, or systems such as the Air Force Space Surveillance System (AFSSS). The analytic solution is derived from the extended Godal’s time equation by Sun, while the iterative method of solution is that of Laguerre, modified for robustness. The Keplerian solution of a Lambert algorithm can be extended to include the non-Keplerian terms of the Vinti algorithm via a simple targeting technique (References 17 to 19). Accurate analytic non-Keplerian trajectories can be predicted for satellites and ballistic missiles, while performing at least 100 times faster in speed than most

  14. A hybridizable discontinuous Galerkin method combined to a Schwarz algorithm for the solution of 3d time-harmonic Maxwell's equation

    NASA Astrophysics Data System (ADS)

    Li, Liang; Lanteri, Stéphane; Perrussel, Ronan

    2014-01-01

    A Schwarz-type domain decomposition method is presented for the solution of the system of 3d time-harmonic Maxwell's equations. We introduce a hybridizable discontinuous Galerkin (HDG) scheme for the discretization of the problem based on a tetrahedrization of the computational domain. The discrete system of the HDG method on each subdomain is solved by an optimized sparse direct (LU factorization) solver. The solution of the interface system in the domain decomposition framework is accelerated by a Krylov subspace method. The formulation and the implementation of the resulting DD-HDG (Domain Decomposed-Hybridizable Discontinuous Galerkin) method are detailed. Numerical results show that the resulting DD-HDG solution strategy has an optimal convergence rate and can save both CPU time and memory cost compared to a classical upwind flux-based DD-DG (Domain Decomposed-Discontinuous Galerkin) approach.

  15. Genetic algorithms

    NASA Technical Reports Server (NTRS)

    Wang, Lui; Bayer, Steven E.

    1991-01-01

    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

  16. Aerosol Health Impact Source Attribution Studies with the CMAQ Adjoint Air Quality Model

    NASA Astrophysics Data System (ADS)

    Turner, M. D.

    Fine particulate matter (PM2.5) is an air pollutant consisting of a mixture of solid and liquid particles suspended in the atmosphere. Knowledge of the sources and distributions of PM2.5 is important for many reasons, two of which are that PM2.5 has an adverse effect on human health and also an effect on climate change. Recent studies have suggested that health benefits resulting from a unit decrease in black carbon (BC) are four to nine times larger than benefits resulting from an equivalent change in PM2.5 mass. The goal of this thesis is to quantify the role of emissions from different sectors and different locations in governing the total health impacts, risk, and maximum individual risk of exposure to BC both nationally and regionally in the US. We develop and use the CMAQ adjoint model to quantify the role of emissions from all modeled sectors, times, and locations on premature deaths attributed to exposure to BC. From a national analysis, we find that damages resulting from anthropogenic emissions of BC are strongly correlated with population and premature death. However, we find little correlation between damages and emission magnitude, suggesting that controls on the largest emissions may not be the most efficient means of reducing damages resulting from BC emissions. Rather, the best proxy for locations with damaging BC emissions is locations where premature deaths occur. Onroad diesel and nonroad vehicle emissions are the largest contributors to premature deaths attributed to exposure to BC, while onroad gasoline emissions cause the highest deaths per amount emitted. Additionally, emissions in fall and winter contribute to more premature deaths (and more per amount emitted) than emissions in spring and summer. From a regional analysis, we find that emissions from outside each of six urban areas account for 7% to 27% of the premature deaths attributed to exposure to BC within the region. Within the region encompassing New York City and Philadelphia

  17. Comparison of Observation Impacts in Two Forecast Systems using Adjoint Methods

    NASA Technical Reports Server (NTRS)

    Gelaro, Ronald; Langland, Rolf; Todling, Ricardo

    2009-01-01

    An experiment is being conducted to compare directly the impact of all assimilated observations on short-range forecast errors in different operational forecast systems. We use the adjoint-based method developed by Langland and Baker (2004), which allows these impacts to be efficiently calculated. This presentation describes preliminary results for a "baseline" set of observations, including both satellite radiances and conventional observations, used by the Navy/NOGAPS and NASA/GEOS-5 forecast systems for the month of January 2007. In each system, about 65% of the total reduction in 24-h forecast error is provided by satellite observations, although the impact of rawinsonde, aircraft, land, and ship-based observations remains significant. Only a small majority (50- 55%) of all observations assimilated improves the forecast, while the rest degrade it. It is found that most of the total forecast error reduction comes from observations with moderate-size innovations providing small to moderate impacts, not from outliers with very large positive or negative innovations. In a global context, the relative impacts of the major observation types are fairly similar in each system, although regional differences in observation impact can be significant. Of particular interest is the fact that while satellite radiances have a large positive impact overall, they degrade the forecast in certain locations common to both systems, especially over land and ice surfaces. Ongoing comparisons of this type, with results expected from other operational centers, should lead to more robust conclusions about the impacts of the various components of the observing system as well as about the strengths and weaknesses of the methodologies used to assimilate them.

  18. Forward and adjoint spectral-element simulations of seismic wave propagation using hardware accelerators

    NASA Astrophysics Data System (ADS)

    Peter, Daniel; Videau, Brice; Pouget, Kevin; Komatitsch, Dimitri

    2015-04-01

    Improving the resolution of tomographic images is crucial to answer important questions on the nature of Earth's subsurface structure and internal processes. Seismic tomography is the most prominent approach where seismic signals from ground-motion records are used to infer physical properties of internal structures such as compressional- and shear-wave speeds, anisotropy and attenuation. Recent advances in regional- and global-scale seismic inversions move towards full-waveform inversions which require accurate simulations of seismic wave propagation in complex 3D media, providing access to the full 3D seismic wavefields. However, these numerical simulations are computationally very expensive and need high-performance computing (HPC) facilities for further improving the current state of knowledge. During recent years, many-core architectures such as graphics processing units (GPUs) have been added to available large HPC systems. Such GPU-accelerated computing together with advances in multi-core central processing units (CPUs) can greatly accelerate scientific applications. There are mainly two possible choices of language support for GPU cards, the CUDA programming environment and OpenCL language standard. CUDA software development targets NVIDIA graphic cards while OpenCL was adopted mainly by AMD graphic cards. In order to employ such hardware accelerators for seismic wave propagation simulations, we incorporated a code generation tool BOAST into an existing spectral-element code package SPECFEM3D_GLOBE. This allows us to use meta-programming of computational kernels and generate optimized source code for both CUDA and OpenCL languages, running simulations on either CUDA or OpenCL hardware accelerators. We show here applications of forward and adjoint seismic wave propagation on CUDA/OpenCL GPUs, validating results and comparing performances for different simulations and hardware usages.

  19. A new Green's function Monte Carlo algorithm for the solution of the two-dimensional nonlinear Poisson–Boltzmann equation: Application to the modeling of the communication breakdown problem in space vehicles during re-entry

    SciTech Connect

    Chatterjee, Kausik; Roadcap, John R.; Singh, Surendra

    2014-11-01

    The objective of this paper is the exposition of a recently-developed, novel Green's function Monte Carlo (GFMC) algorithm for the solution of nonlinear partial differential equations and its application to the modeling of the plasma sheath region around a cylindrical conducting object, carrying a potential and moving at low speeds through an otherwise neutral medium. The plasma sheath is modeled in equilibrium through the GFMC solution of the nonlinear Poisson–Boltzmann (NPB) equation. The traditional Monte Carlo based approaches for the solution of nonlinear equations are iterative in nature, involving branching stochastic processes which are used to calculate linear functionals of the solution of nonlinear integral equations. Over the last several years, one of the authors of this paper, K. Chatterjee has been developing a philosophically-different approach, where the linearization of the equation of interest is not required and hence there is no need for iteration and the simulation of branching processes. Instead, an approximate expression for the Green's function is obtained using perturbation theory, which is used to formulate the random walk equations within the problem sub-domains where the random walker makes its walks. However, as a trade-off, the dimensions of these sub-domains have to be restricted by the limitations imposed by perturbation theory. The greatest advantage of this approach is the ease and simplicity of parallelization stemming from the lack of the need for iteration, as a result of which the parallelization procedure is identical to the parallelization procedure for the GFMC solution of a linear problem. The application area of interest is in the modeling of the communication breakdown problem during a space vehicle's re-entry into the atmosphere. However, additional application areas are being explored in the modeling of electromagnetic propagation through the atmosphere/ionosphere in UHF/GPS applications.

  20. Algorithmic differentiation and the calculation of forces by quantum Monte Carlo.

    PubMed

    Sorella, Sandro; Capriotti, Luca

    2010-12-21

    We describe an efficient algorithm to compute forces in quantum Monte Carlo using adjoint algorithmic differentiation. This allows us to apply the space warp coordinate transformation in differential form, and compute all the 3M force components of a system with M atoms with a computational effort comparable with the one to obtain the total energy. Few examples illustrating the method for an electronic system containing several water molecules are presented. With the present technique, the calculation of finite-temperature thermodynamic properties of materials with quantum Monte Carlo will be feasible in the near future.

  1. Totally parallel multilevel algorithms

    NASA Technical Reports Server (NTRS)

    Frederickson, Paul O.

    1988-01-01

    Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.

  2. The Algorithm Selection Problem

    NASA Technical Reports Server (NTRS)

    Minton, Steve; Allen, John; Deiss, Ron (Technical Monitor)

    1994-01-01

    Work on NP-hard problems has shown that many instances of these theoretically computationally difficult problems are quite easy. The field has also shown that choosing the right algorithm for the problem can have a profound effect on the time needed to find a solution. However, to date there has been little work showing how to select the right algorithm for solving any particular problem. The paper refers to this as the algorithm selection problem. It describes some of the aspects that make this problem difficult, as well as proposes a technique for addressing it.

  3. A user`s manual for MASH 1.0: A Monte Carlo Adjoint Shielding Code System

    SciTech Connect

    Johnson, J.O.

    1992-03-01

    The Monte Carlo Adjoint Shielding Code System, MASH, calculates neutron and gamma-ray environments and radiation protection factors for armored military vehicles, structures, trenches, and other shielding configurations by coupling a forward discrete ordinates air-over-ground transport calculation with an adjoint Monte Carlo treatment of the shielding geometry. Efficiency and optimum use of computer time are emphasized. The code system include the GRTUNCL and DORT codes for air-over-ground transport calculations, the MORSE code with the GIFT5 combinatorial geometry package for adjoint shielding calculations, and several peripheral codes that perform the required data preparations, transformations, and coupling functions. MASH is the successor to the Vehicle Code System (VCS) initially developed at Oak Ridge National Laboratory (ORNL). The discrete ordinates calculation determines the fluence on a coupling surface surrounding the shielding geometry due to an external neutron/gamma-ray source. The Monte Carlo calculation determines the effectiveness of the fluence at that surface in causing a response in a detector within the shielding geometry, i.e., the ``dose importance`` of the coupling surface fluence. A coupling code folds the fluence together with the dose importance, giving the desired dose response. The coupling code can determine the dose response a a function of the shielding geometry orientation relative to the source, distance from the source, and energy response of the detector. This user`s manual includes a short description of each code, the input required to execute the code along with some helpful input data notes, and a representative sample problem (input data and selected output edits) for each code.

  4. Forward and backward location probabilities for sorbing solutes in groundwater

    NASA Astrophysics Data System (ADS)

    Neupauer, R. M.; Wilson, J. L.

    Location probability can be used to describe the likely position of a solute particle as it travels through an aquifer. Forward location probability describes the likely future positions of a particle, and can be used to predict the movement of a contaminant plume. Backward location probability describes the likely prior positions of a solute particle, and can be used to identify sources of contamination. For sorbing solutes, the probability distributions must also account for the phase (aqueous or sorbed) of a solute particle. We present new phase-dependent forward and backward location probabilities to describe transport of a solute undergoing linear non-equilibrium sorption. The effects of sorption are incorporated directly into the governing equations that are used to calculate the probability distributions. The shape and magnitude of the distributions depend on the phase of the contamination at both the source (or prior location) and receptor (or future location). These probabilities are related to adjoint states of concentration. Using adjoint theory, Bayes' theorem, and a clever transformation, we develop a model to efficiently calculate backward location probabilities for one or a few receptors. We illustrate important features of backward location probabilities for a sorbing solute with a hypothetical, one-dimensional confined aquifer, and we demonstrate their use in identifying sources of contamination for a trichloroethylene plume at the Massachusetts Military Reservation using a three-dimensional numerical model.

  5. Global Modeling and Data Assimilation. Volume 11; Documentation of the Tangent Linear and Adjoint Models of the Relaxed Arakawa-Schubert Moisture Parameterization of the NASA GEOS-1 GCM; 5.2

    NASA Technical Reports Server (NTRS)

    Suarez, Max J. (Editor); Yang, Wei-Yu; Todling, Ricardo; Navon, I. Michael

    1997-01-01

    A detailed description of the development of the tangent linear model (TLM) and its adjoint model of the Relaxed Arakawa-Schubert moisture parameterization package used in the NASA GEOS-1 C-Grid GCM (Version 5.2) is presented. The notational conventions used in the TLM and its adjoint codes are described in detail.

  6. A hybrid algorithm with GA and DAEM

    NASA Astrophysics Data System (ADS)

    Wan, HongJie; Deng, HaoJiang; Wang, XueWei

    2013-03-01

    Although the expectation-maximization (EM) algorithm has been widely used for finding maximum likelihood estimation of parameters in probabilistic models, it has the problem of trapping by local maxima. To overcome this problem, the deterministic annealing EM (DAEM) algorithm was once proposed and had achieved better performance than EM algorithm, but it is not very effective at avoiding local maxima. In this paper, a solution is proposed by integrating GA and DAEM into one procedure to further improve the solution quality. The population based search of genetic algorithm will produce different solutions and thus can increase the search space of DAEM. Therefore, the proposed algorithm will reach better solution than just using DAEM. The algorithm retains the property of DAEM and gets the better solution by genetic operation. Experiment results on Gaussian mixture model parameter estimation demonstrate that the proposed algorithm can achieve better performance.

  7. An Iterative Solution to the Nonlinear Time-Discrete TEM Model - The Occurrence of Chaos and a Control Theoretic Algorithmic Approach

    NASA Astrophysics Data System (ADS)

    Pickl, S.

    2002-09-01

    This paper is concerned with a mathematical derivation of the nonlinear time-discrete Technology-Emissions Means (TEM-) model. A detailed introduction to the dynamics modelling a Joint Implementation Program concerning Kyoto Protocol is given at the end of the paper. As the nonlinear time-discrete dynamics tends to chaotic behaviour, the necessary introduction of control parameters in the dynamics of the TEM model leads to new results in the field of time-discrete control systems. Furthermore the numerical results give new insights into a Joint-Implementation Program and herewith, they may improve this important economic tool. The iterative solution presented at the end might be a useful orientation to anticipate and support Kyoto Process.

  8. Algorithm That Synthesizes Other Algorithms for Hashing

    NASA Technical Reports Server (NTRS)

    James, Mark

    2010-01-01

    An algorithm that includes a collection of several subalgorithms has been devised as a means of synthesizing still other algorithms (which could include computer code) that utilize hashing to determine whether an element (typically, a number or other datum) is a member of a set (typically, a list of numbers). Each subalgorithm synthesizes an algorithm (e.g., a block of code) that maps a static set of key hashes to a somewhat linear monotonically increasing sequence of integers. The goal in formulating this mapping is to cause the length of the sequence thus generated to be as close as practicable to the original length of the set and thus to minimize gaps between the elements. The advantage of the approach embodied in this algorithm is that it completely avoids the traditional approach of hash-key look-ups that involve either secondary hash generation and look-up or further searching of a hash table for a desired key in the event of collisions. This algorithm guarantees that it will never be necessary to perform a search or to generate a secondary key in order to determine whether an element is a member of a set. This algorithm further guarantees that any algorithm that it synthesizes can be executed in constant time. To enforce these guarantees, the subalgorithms are formulated to employ a set of techniques, each of which works very effectively covering a certain class of hash-key values. These subalgorithms are of two types, summarized as follows: Given a list of numbers, try to find one or more solutions in which, if each number is shifted to the right by a constant number of bits and then masked with a rotating mask that isolates a set of bits, a unique number is thereby generated. In a variant of the foregoing procedure, omit the masking. Try various combinations of shifting, masking, and/or offsets until the solutions are found. From the set of solutions, select the one that provides the greatest compression for the representation and is executable in the

  9. Spectral-Element Seismic Wave Propagation Codes for both Forward Modeling in Complex Media and Adjoint Tomography

    NASA Astrophysics Data System (ADS)

    Smith, J. A.; Peter, D. B.; Tromp, J.; Komatitsch, D.; Lefebvre, M. P.

    2015-12-01

    We present both SPECFEM3D_Cartesian and SPECFEM3D_GLOBE open-source codes, representing high-performance numerical wave solvers simulating seismic wave propagation for local-, regional-, and global-scale application. These codes are suitable for both forward propagation in complex media and tomographic imaging. Both solvers compute highly accurate seismic wave fields using the continuous Galerkin spectral-element method on unstructured meshes. Lateral variations in compressional- and shear-wave speeds, density, as well as 3D attenuation Q models, topography and fluid-solid coupling are all readily included in both codes. For global simulations, effects due to rotation, ellipticity, the oceans, 3D crustal models, and self-gravitation are additionally included. Both packages provide forward and adjoint functionality suitable for adjoint tomography on high-performance computing architectures. We highlight the most recent release of the global version which includes improved performance, simultaneous MPI runs, OpenCL and CUDA support via an automatic source-to-source transformation library (BOAST), parallel I/O readers and writers for databases using ADIOS and seismograms using the recently developed Adaptable Seismic Data Format (ASDF) with built-in provenance. This makes our spectral-element solvers current state-of-the-art, open-source community codes for high-performance seismic wave propagation on arbitrarily complex 3D models. Together with these solvers, we provide full-waveform inversion tools to image the Earth's interior at unprecedented resolution.

  10. High-resolution Adjoint Tomography of the Eastern Venezuelan Crust using Empirical Green's Function Waveforms from Ambient Noise Interferometry

    NASA Astrophysics Data System (ADS)

    Chen, M.; Masy, J.; Niu, F.; Levander, A.

    2014-12-01

    We present a high-resolution 3D crustal model of Eastern Venezuela from a full waveform inversion adjoint tomography technique, based on the spectral-element method. Empirical Green's functions (EGFs) of Rayleigh waves from ambient noise interferometry serve as the observed waveforms. Rayleigh wave signals in the period range of 10 - 50 s were extracted by cross-correlations of 48 stations from both Venezuelan national seismic network and the BOLIVAR project array. The synthetic Green's functions (SGFs) are calculated with an initial regional 3D shear wave model determined from ballistic Rayleigh wave tomography from earthquake records with periods longer than 20 s. The frequency-dependent traveltime time misfits between the SGFs and EGFs are minimized iteratively using adjoint tomography = to refine 3D crustal structure [Chen et al. 2014]. The final 3D model shows lateral shear wave velocity variations that are well correlated with the geological terranes within the continental interior. In particular, the final model reveals low velocities distributed along the axis of the Espino Graben, indicating that the graben has a substantially different crustal structure than the rest of the Eastern Venezuela Basin. We also observe high shear velocities in the lower crust beneath some of the subterranes of the Proterozoic-Archean Guayana Shield.

  11. Quantum Algorithms

    NASA Technical Reports Server (NTRS)

    Abrams, D.; Williams, C.

    1999-01-01

    This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.

  12. New Solutions for Non-Abelian Cosmic Strings

    NASA Astrophysics Data System (ADS)

    Hindmarsh, Mark; Rummukainen, Kari; Weir, David J.

    2016-12-01

    We study the properties of classical vortex solutions in a non-Abelian gauge theory. A system of two adjoint Higgs fields breaks the SU(2) gauge symmetry to Z2 , producing 't Hooft-Polyakov monopoles trapped on cosmic strings, termed beads; there are two charges of monopole and two degenerate string solutions. The strings break an accidental discrete Z2 symmetry of the theory, explaining the degeneracy of the ground state. Further symmetries of the model, not previously appreciated, emerge when the masses of the two adjoint Higgs fields are degenerate. The breaking of the enlarged discrete symmetry gives rise to additional string solutions and splits the monopoles into four types of "semipole": kink solutions that interpolate between the string solutions, classified by a complex gauge-invariant magnetic flux and a Z4 charge. At special values of the Higgs self-couplings, the accidental symmetry broken by the string is continuous, giving rise to supercurrents on the strings. The SU(2) theory can be embedded in a wide class of grand unified theories (GUTs), including SO(10). We argue that semipoles and supercurrents are generic on GUT strings.

  13. An Adjoint-Based Analysis of the Sampling Footprints of Tall Tower, Aircraft and Potential Future Lidar Observations of CO2

    NASA Technical Reports Server (NTRS)

    Andrews, Arlyn; Kawa, Randy; Zhu, Zhengxin; Burris, John; Abshire, Jim

    2004-01-01

    A detailed mechanistic understanding of the sources and sinks of CO2 will be required to reliably predict future CO2 levels and climate. A commonly used technique for deriving information about CO2 exchange with surface reservoirs is to solve an 'inverse problem', where CO2 observations are used with an atmospheric transport model to find the optimal distribution of sources and sinks. Synthesis inversion methods are powerful tools for addressing this question, but the results are disturbingly sensitive to the details of the calculation. Studies done using different atmospheric transport models and combinations of surface station data have produced substantially different distributions of surface fluxes. Adjoint methods are now being developed that will more effectively incorporate diverse datasets in estimates of surface fluxes of CO2. In an adjoint framework, it will be possible to combine CO2 concentration data from longterm surface and aircraft monitoring stations with data from intensive field campaigns and with proposed future satellite observations. We have recently developed an adjoint for the GSFC 3-D Parameterized Chemistry and Transport Model (PCTM). Here, we will present results from a PCTM Adjoint study comparing the sampling footprints of tall tower, aircraft and potential future lidar observations of CO2. The vertical resolution and extent of the profiles and the observation frequency will be considered for several sites in North America.

  14. Top-Down Inversion of Aerosol Emissions through Adjoint Integration of Satellite Radiance and GEOS-Chem Chemical Transport Model

    NASA Astrophysics Data System (ADS)

    Xu, X.; Wang, J.; Henze, D. K.; Qu, W.; Kopacz, M.

    2012-12-01

    The knowledge of aerosol emissions from both natural and anthropogenic sources are needed to study the impacts of tropospheric aerosol on atmospheric composition, climate, and human health, but large uncertainties persist in quantifying the aerosol sources with the current bottom-up methods. This study presents a new top-down approach that spatially constrains the amount of aerosol emissions from satellite (MODIS) observed reflectance with the adjoint of a chemistry transport model (GEOS-Chem). We apply this technique with a one-month case study (April 2008) over the East Asia. The bottom-up estimated sulfate-nitrate-ammonium precursors, such as sulfur dioxide (SO2), ammonia (NH3), and nitrogen oxides (NOx), all from INTEX-B 2006 inventory, emissions of black carbon (BC), organic carbon (OC) from Bond-2007 inventory, and mineral dust simulated from DEAD dust mobilization scheme, are spatially optimized from the GEOS-Chem model and its adjoint constrained by the aerosol optical depth (AOD) that are derived from MODIS reflectance with the GEOS-Chem aerosol single scattering properties. The adjoint inverse modeling for the study period yields notable decreases in anthropogenic aerosol emissions over China: 436 Gg (33.5%) for SO2, 378 Gg (34.5%) for NH3, 319 (18.8%) for NOx, 10 Gg (9.1%) for BC, and 30 Gg (15.0%) for OC. The total amount of the mineral dust emission is reduced by 56.4% from the DEAD mobilization module which simulates dust production of 19020 Gg. Sub-regional adjustments are significant and directions of changes are spatially different. The model simulation with optimized aerosol emissions shows much better agreement with independent observations from sun-spectrophotometer observed AOD from AERONET, MISR (Multi-angle Imaging SpectroRadiometer) AOD, OMI (Ozone Monitoring Instrument) NO2 and SO2 columns, and surface aerosol concentrations measured over both anthropogenic pollution and dust source regions. Assuming the used bottom-up anthropogenic

  15. Adjoint Method and Predictive Control for 1-D Flow in NASA Ames 11-Foot Transonic Wind Tunnel

    NASA Technical Reports Server (NTRS)

    Nguyen, Nhan; Ardema, Mark

    2006-01-01

    This paper describes a modeling method and a new optimal control approach to investigate a Mach number control problem for the NASA Ames 11-Foot Transonic Wind Tunnel. The flow in the wind tunnel is modeled by the 1-D unsteady Euler equations whose boundary conditions prescribe a controlling action by a compressor. The boundary control inputs to the compressor are in turn controlled by a drive motor system and an inlet guide vane system whose dynamics are modeled by ordinary differential equations. The resulting Euler equations are thus coupled to the ordinary differential equations via the boundary conditions. Optimality conditions are established by an adjoint method and are used to develop a model predictive linear-quadratic optimal control for regulating the Mach number due to a test model disturbance during a continuous pitch

  16. INVERSE ESTIMATION OF BED ROUGHNESS COEFFICIENTS IN OPEN-CHANNELS WITH FLOOD PLAINS BY USING ADJOINT SHALLOW-WATER MODEL

    NASA Astrophysics Data System (ADS)

    Yoshida, Keisuke

    This study describes the methodology on an inverse estimation of the bed roughness coefficients in open-channels with flood plains. The coefficients are identified by an adjoint shallow-water model and an optimal control theory. Several twin experiments were carried out with the synthetic data in order to validate the method. The data assimilated consists of values of the water level and depth-averaged velocity. The results showed that the coefficients can be accurately predicted with the velocity data, while the estimation fails with the water level data. This is because the cross-sectionally distributed bed roughness does not always influence the lateral profile of the water level, but the local velocity field. Namely, the relation between the lateral profile of the water level and the bed roughness turns out to be non-unique in open-channels with flood plains.

  17. Waveform Inversion of OBS Data and Illumination/Resolution Analyses on Marine Seismic Data Acquisitions by the Adjoint Wavefield Method

    NASA Astrophysics Data System (ADS)

    Chen, H.; Li, K.

    2012-12-01

    We applied a wave-equation based adjoint wavefield method for seismic illumination/resolution analyses and full waveform inversion. A two-way wave-equation is used to calculate directional and diffracted energy fluxes for waves propagating between sources and receivers to the subsurface target. The first-order staggered-grid pressure-velocity formulation, which lacks the characteristic of being self-adjoint is further validated and corrected to render the modeling operator before its practical application. Despite most published papers on synthetic kernel research, realistic applications to two field experiments are demonstrated and emphasize its practical needs. The Fréchet sensitivity kernels are used to quantify the target illumination conditions. For realistic illumination measurements and resolution analyses, two completely different survey geometries and nontrivial pre-conditioning strategies based on seismic data type are demonstrated and compared. From illumination studies, particle velocity responses are more sensitive to lateral velocity variations than pressure records. For waveform inversion, the more accurately estimated velocity model obtained the deeper the depth of investigation would be reached. To achieve better resolution and illumination, closely spaced OBS receiver interval is preferred. Based on the results, waveform inversion is applied for a gas hydrate site in Taiwan for shallow structure and BSR detection. Full waveform approach potentially provides better depth resolution than ray approach. The quantitative analyses, a by-product of full waveform inversion, are useful for quantifying seismic processing and depth migration strategies.llumination/resolution analysis for a 3D MCS/OBS survey in 2008. Analysis of OBS data shows that pressure (top), horizontal (middle) and vertical (bottom) velocity records produce different resolving power for gas hydrate exploration. ull waveform inversion of 8 OBS data along Yuan-An Ridge in SW Taiwan

  18. Issues in measure-preserving three dimensional flow integrators: Self-adjointness, reversibility, and non-uniform time stepping

    SciTech Connect

    Finn, John M.

    2015-03-01

    Properties of integration schemes for solenoidal fields in three dimensions are studied, with a focus on integrating magnetic field lines in a plasma using adaptive time stepping. It is shown that implicit midpoint (IM) and a scheme we call three-dimensional leapfrog (LF) can do a good job (in the sense of preserving KAM tori) of integrating fields that are reversible, or (for LF) have a 'special divergence-free' property. We review the notion of a self-adjoint scheme, showing that such schemes are at least second order accurate and can always be formed by composing an arbitrary scheme with its adjoint. We also review the concept of reversibility, showing that a reversible but not exactly volume-preserving scheme can lead to a fractal invariant measure in a chaotic region, although this property may not often be observable. We also show numerical results indicating that the IM and LF schemes can fail to preserve KAM tori when the reversibility property (and the SDF property for LF) of the field is broken. We discuss extensions to measure preserving flows, the integration of magnetic field lines in a plasma and the integration of rays for several plasma waves. The main new result of this paper relates to non-uniform time stepping for volume-preserving flows. We investigate two potential schemes, both based on the general method of Ref. [11], in which the flow is integrated in split time steps, each Hamiltonian in two dimensions. The first scheme is an extension of the method of extended phase space, a well-proven method of symplectic integration with non-uniform time steps. This method is found not to work, and an explanation is given. The second method investigated is a method based on transformation to canonical variables for the two split-step Hamiltonian systems. This method, which is related to the method of non-canonical generating functions of Ref. [35], appears to work very well.

  19. Optical tomography reconstruction algorithm with the finite element method: An optimal approach with regularization tools

    SciTech Connect

    Balima, O.; Favennec, Y.; Rousse, D.

    2013-10-15

    Highlights: •New strategies to improve the accuracy of the reconstruction through mesh and finite element parameterization. •Use of gradient filtering through an alternative inner product within the adjoint method. •An integral form of the cost function is used to make the reconstruction compatible with all finite element formulations, continuous and discontinuous. •Gradient-based algorithm with the adjoint method is used for the reconstruction. -- Abstract: Optical tomography is mathematically treated as a non-linear inverse problem where the optical properties of the probed medium are recovered through the minimization of the errors between the experimental measurements and their predictions with a numerical model at the locations of the detectors. According to the ill-posed behavior of the inverse problem, some regularization tools must be performed and the Tikhonov penalization type is the most commonly used in optical tomography applications. This paper introduces an optimized approach for optical tomography reconstruction with the finite element method. An integral form of the cost function is used to take into account the surfaces of the detectors and make the reconstruction compatible with all finite element formulations, continuous and discontinuous. Through a gradient-based algorithm where the adjoint method is used to compute the gradient of the cost function, an alternative inner product is employed for preconditioning the reconstruction algorithm. Moreover, appropriate re-parameterization of the optical properties is performed. These regularization strategies are compared with the classical Tikhonov penalization one. It is shown that both the re-parameterization and the use of the Sobolev cost function gradient are efficient for solving such an ill-posed inverse problem.

  20. New Results in Astrodynamics Using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Coverstone-Carroll, V.; Hartmann, J. W.; Williams, S. N.; Mason, W. J.

    1998-01-01

    Generic algorithms have gained popularity as an effective procedure for obtaining solutions to traditionally difficult space mission optimization problems. In this paper, a brief survey of the use of genetic algorithms to solve astrodynamics problems is presented and is followed by new results obtained from applying a Pareto genetic algorithm to the optimization of low-thrust interplanetary spacecraft missions.

  1. Solving Maximal Clique Problem through Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Rajawat, Shalini; Hemrajani, Naveen; Menghani, Ekta

    2010-11-01

    Genetic algorithm is one of the most interesting heuristic search techniques. It depends basically on three operations; selection, crossover and mutation. The outcome of the three operations is a new population for the next generation. Repeating these operations until the termination condition is reached. All the operations in the algorithm are accessible with today's molecular biotechnology. The simulations show that with this new computing algorithm, it is possible to get a solution from a very small initial data pool, avoiding enumerating all candidate solutions. For randomly generated problems, genetic algorithm can give correct solution within a few cycles at high probability.

  2. The linear theory of functional differential equations: existence theorems and the problem of pointwise completeness of the solutions

    SciTech Connect

    Beklaryan, Leva A

    2011-03-31

    A boundary value problem and an initial-boundary value problems are considered for a linear functional differential equation of point type. A suitable scale of functional spaces is introduced and existence theorems for solutions are stated in terms of this scale, in a form analogous to Noether's theorem. A key fact is established for the initial boundary value problem: the space of classical solutions of the adjoint equation must be extended to include impulsive solutions. A test for the pointwise completeness of solutions is obtained. The results presented are based on a formalism developed by the author for this type of equation. Bibliography: 7 titles.

  3. Scheduling algorithms

    NASA Astrophysics Data System (ADS)

    Wolfe, William J.; Wood, David; Sorensen, Stephen E.

    1996-12-01

    This paper discusses automated scheduling as it applies to complex domains such as factories, transportation, and communications systems. The window-constrained-packing problem is introduced as an ideal model of the scheduling trade offs. Specific algorithms are compared in terms of simplicity, speed, and accuracy. In particular, dispatch, look-ahead, and genetic algorithms are statistically compared on randomly generated job sets. The conclusion is that dispatch methods are fast and fairly accurate; while modern algorithms, such as genetic and simulate annealing, have excessive run times, and are too complex to be practical.

  4. Haplotyping algorithms

    SciTech Connect

    Sobel, E.; Lange, K.; O`Connell, J.R.

    1996-12-31

    Haplotyping is the logical process of inferring gene flow in a pedigree based on phenotyping results at a small number of genetic loci. This paper formalizes the haplotyping problem and suggests four algorithms for haplotype reconstruction. These algorithms range from exhaustive enumeration of all haplotype vectors to combinatorial optimization by simulated annealing. Application of the algorithms to published genetic analyses shows that manual haplotyping is often erroneous. Haplotyping is employed in screening pedigrees for phenotyping errors and in positional cloning of disease genes from conserved haplotypes in population isolates. 26 refs., 6 figs., 3 tabs.

  5. Irregular Applications: Architectures & Algorithms

    SciTech Connect

    Feo, John T.; Villa, Oreste; Tumeo, Antonino; Secchi, Simone

    2012-02-06

    Irregular applications are characterized by irregular data structures, control and communication patterns. Novel irregular high performance applications which deal with large data sets and require have recently appeared. Unfortunately, current high performance systems and software infrastructures executes irregular algorithms poorly. Only coordinated efforts by end user, area specialists and computer scientists that consider both the architecture and the software stack may be able to provide solutions to the challenges of modern irregular applications.

  6. Algorithmic advances in stochastic programming

    SciTech Connect

    Morton, D.P.

    1993-07-01

    Practical planning problems with deterministic forecasts of inherently uncertain parameters often yield unsatisfactory solutions. Stochastic programming formulations allow uncertain parameters to be modeled as random variables with known distributions, but the size of the resulting mathematical programs can be formidable. Decomposition-based algorithms take advantage of special structure and provide an attractive approach to such problems. We consider two classes of decomposition-based stochastic programming algorithms. The first type of algorithm addresses problems with a ``manageable`` number of scenarios. The second class incorporates Monte Carlo sampling within a decomposition algorithm. We develop and empirically study an enhanced Benders decomposition algorithm for solving multistage stochastic linear programs within a prespecified tolerance. The enhancements include warm start basis selection, preliminary cut generation, the multicut procedure, and decision tree traversing strategies. Computational results are presented for a collection of ``real-world`` multistage stochastic hydroelectric scheduling problems. Recently, there has been an increased focus on decomposition-based algorithms that use sampling within the optimization framework. These approaches hold much promise for solving stochastic programs with many scenarios. A critical component of such algorithms is a stopping criterion to ensure the quality of the solution. With this as motivation, we develop a stopping rule theory for algorithms in which bounds on the optimal objective function value are estimated by sampling. Rules are provided for selecting sample sizes and terminating the algorithm under which asymptotic validity of confidence interval statements for the quality of the proposed solution can be verified. Issues associated with the application of this theory to two sampling-based algorithms are considered, and preliminary empirical coverage results are presented.

  7. Kidney-inspired algorithm for optimization problems

    NASA Astrophysics Data System (ADS)

    Jaddi, Najmeh Sadat; Alvankarian, Jafar; Abdullah, Salwani

    2017-01-01

    In this paper, a population-based algorithm inspired by the kidney process in the human body is proposed. In this algorithm the solutions are filtered in a rate that is calculated based on the mean of objective functions of all solutions in the current population of each iteration. The filtered solutions as the better solutions are moved to filtered blood and the rest are transferred to waste representing the worse solutions. This is a simulation of the glomerular filtration process in the kidney. The waste solutions are reconsidered in the iterations if after applying a defined movement operator they satisfy the filtration rate, otherwise it is expelled from the waste solutions, simulating the reabsorption and excretion functions of the kidney. In addition, a solution assigned as better solution is secreted if it is not better than the worst solutions simulating the secreting process of blood in the kidney. After placement of all the solutions in the population, the best of them is ranked, the waste and filtered blood are merged to become a new population and the filtration rate is updated. Filtration provides the required exploitation while generating a new solution and reabsorption gives the necessary exploration for the algorithm. The algorithm is assessed by applying it on eight well-known benchmark test functions and compares the results with other algorithms in the literature. The performance of the proposed algorithm is better on seven out of eight test functions when it is compared with the most recent researches in literature. The proposed kidney-inspired algorithm is able to find the global optimum with less function evaluations on six out of eight test functions. A statistical analysis further confirms the ability of this algorithm to produce good-quality results.

  8. A generalized computationally efficient inverse characterization approach combining direct inversion solution initialization with gradient-based optimization

    NASA Astrophysics Data System (ADS)

    Wang, Mengyu; Brigham, John C.

    2017-03-01

    A computationally efficient gradient-based optimization approach for inverse material characterization from incomplete system response measurements that can utilize a generally applicable parameterization (e.g., finite element-type parameterization) is presented and evaluated. The key to this inverse characterization algorithm is the use of a direct inversion strategy with Gappy proper orthogonal decomposition (POD) response field estimation to initialize the inverse solution estimate prior to gradient-based optimization. Gappy POD is used to estimate the complete (i.e., all components over the entire spatial domain) system response field from incomplete (e.g., partial spatial distribution) measurements obtained from some type of system testing along with some amount of a priori information regarding the potential distribution of the unknown material property. The estimated complete system response is used within a physics-based direct inversion procedure with a finite element-type parameterization to estimate the spatial distribution of the desired unknown material property with minimal computational expense. Then, this estimated spatial distribution of the unknown material property is used to initialize a gradient-based optimization approach, which uses the adjoint method for computationally efficient gradient calculations, to produce the final estimate of the material property distribution. The three-step [(1) Gappy POD, (2) direct inversion, and (3) gradient-based optimization] inverse characterization approach is evaluated through simulated test problems based on the characterization of elastic modulus distributions with localized variations (e.g., inclusions) within simple structures. Overall, this inverse characterization approach is shown to efficiently and consistently provide accurate inverse characterization estimates for material property distributions from incomplete response field measurements. Moreover, the solution procedure is shown to be capable

  9. Issues in measure-preserving three dimensional flow integrators: Self-adjointness, reversibility, and non-uniform time stepping

    NASA Astrophysics Data System (ADS)

    Finn, John M.

    2015-03-01

    Properties of integration schemes for solenoidal fields in three dimensions are studied, with a focus on integrating magnetic field lines in a plasma using adaptive time stepping. It is shown that implicit midpoint (IM) and a scheme we call three-dimensional leapfrog (LF) can do a good job (in the sense of preserving KAM tori) of integrating fields that are reversible, or (for LF) have a "special divergence-free" (SDF) property. We review the notion of a self-adjoint scheme, showing that such schemes are at least second order accurate and can always be formed by composing an arbitrary scheme with its adjoint. We also review the concept of reversibility, showing that a reversible but not exactly volume-preserving scheme can lead to a fractal invariant measure in a chaotic region, although this property may not often be observable. We also show numerical results indicating that the IM and LF schemes can fail to preserve KAM tori when the reversibility property (and the SDF property for LF) of the field is broken. We discuss extensions to measure preserving flows, the integration of magnetic field lines in a plasma and the integration of rays for several plasma waves. The main new result of this paper relates to non-uniform time stepping for volume-preserving flows. We investigate two potential schemes, both based on the general method of Feng and Shang [Numer. Math. 71, 451 (1995)], in which the flow is integrated in split time steps, each Hamiltonian in two dimensions. The first scheme is an extension of the method of extended phase space, a well-proven method of symplectic integration with non-uniform time steps. This method is found not to work, and an explanation is given. The second method investigated is a method based on transformation to canonical variables for the two split-step Hamiltonian systems. This method, which is related to the method of non-canonical generating functions of Richardson and Finn [Plasma Phys. Controlled Fusion 54, 014004 (2012

  10. Issues in measure-preserving three dimensional flow integrators: Self-adjointness, reversibility, and non-uniform time stepping

    DOE PAGES

    Finn, John M.

    2015-03-01

    Properties of integration schemes for solenoidal fields in three dimensions are studied, with a focus on integrating magnetic field lines in a plasma using adaptive time stepping. It is shown that implicit midpoint (IM) and a scheme we call three-dimensional leapfrog (LF) can do a good job (in the sense of preserving KAM tori) of integrating fields that are reversible, or (for LF) have a 'special divergence-free' property. We review the notion of a self-adjoint scheme, showing that such schemes are at least second order accurate and can always be formed by composing an arbitrary scheme with its adjoint. Wemore » also review the concept of reversibility, showing that a reversible but not exactly volume-preserving scheme can lead to a fractal invariant measure in a chaotic region, although this property may not often be observable. We also show numerical results indicating that the IM and LF schemes can fail to preserve KAM tori when the reversibility property (and the SDF property for LF) of the field is broken. We discuss extensions to measure preserving flows, the integration of magnetic field lines in a plasma and the integration of rays for several plasma waves. The main new result of this paper relates to non-uniform time stepping for volume-preserving flows. We investigate two potential schemes, both based on the general method of Ref. [11], in which the flow is integrated in split time steps, each Hamiltonian in two dimensions. The first scheme is an extension of the method of extended phase space, a well-proven method of symplectic integration with non-uniform time steps. This method is found not to work, and an explanation is given. The second method investigated is a method based on transformation to canonical variables for the two split-step Hamiltonian systems. This method, which is related to the method of non-canonical generating functions of Ref. [35], appears to work very well.« less

  11. Issues in measure-preserving three dimensional flow integrators: Self-adjointness, reversibility, and non-uniform time stepping

    SciTech Connect

    Finn, John M.

    2015-03-15

    Properties of integration schemes for solenoidal fields in three dimensions are studied, with a focus on integrating magnetic field lines in a plasma using adaptive time stepping. It is shown that implicit midpoint (IM) and a scheme we call three-dimensional leapfrog (LF) can do a good job (in the sense of preserving KAM tori) of integrating fields that are reversible, or (for LF) have a “special divergence-free” (SDF) property. We review the notion of a self-adjoint scheme, showing that such schemes are at least second order accurate and can always be formed by composing an arbitrary scheme with its adjoint. We also review the concept of reversibility, showing that a reversible but not exactly volume-preserving scheme can lead to a fractal invariant measure in a chaotic region, although this property may not often be observable. We also show numerical results indicating that the IM and LF schemes can fail to preserve KAM tori when the reversibility property (and the SDF property for LF) of the field is broken. We discuss extensions to measure preserving flows, the integration of magnetic field lines in a plasma and the integration of rays for several plasma waves. The main new result of this paper relates to non-uniform time stepping for volume-preserving flows. We investigate two potential schemes, both based on the general method of Feng and Shang [Numer. Math. 71, 451 (1995)], in which the flow is integrated in split time steps, each Hamiltonian in two dimensions. The first scheme is an extension of the method of extended phase space, a well-proven method of symplectic integration with non-uniform time steps. This method is found not to work, and an explanation is given. The second method investigated is a method based on transformation to canonical variables for the two split-step Hamiltonian systems. This method, which is related to the method of non-canonical generating functions of Richardson and Finn [Plasma Phys. Controlled Fusion 54, 014004 (2012

  12. An Adjoint State Method for Three-Dimensional Transmission Traveltime Tomography Using First-Arrivals

    DTIC Science & Technology

    2006-01-30

    for travel-time [11], and the viscosity solution for the eikonal equation with a point -source condition is the least travel-time from the source to...paper. 2 Governing Equations We start from the eikonal equation with a point source condition in an isotropic medium which occupies an open, bounded...tomography so that we can avoid the cumbersome ray-tracing. We start from the eikonal equation, define a mismatching functional and derive the gradient

  13. Homotopy Solutions of Kepler's Equations

    NASA Technical Reports Server (NTRS)

    Fitz-Coy, Norman; Jang, Jiann-Woei

    1996-01-01

    Kepler's Equation is solved using an integrative algorithm developed using homotropy theory. The solution approach is applicable to both elliptic and hyperbolic forms of Kepler's Equation. The results from the proposed algorithm compare quite favorably with those from existing iterative schemes.

  14. Efficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT.

    PubMed

    Brabec, Jiri; Lin, Lin; Shao, Meiyue; Govind, Niranjan; Yang, Chao; Saad, Yousef; Ng, Esmond G

    2015-11-10

    We present a special symmetric Lanczos algorithm and a kernel polynomial method (KPM) for approximating the absorption spectrum of molecules within the linear response time-dependent density functional theory (TDDFT) framework in the product form. In contrast to existing algorithms, the new algorithms are based on reformulating the original non-Hermitian eigenvalue problem as a product eigenvalue problem and the observation that the product eigenvalue problem is self-adjoint with respect to an appropriately chosen inner product. This allows a simple symmetric Lanczos algorithm to be used to compute the desired absorption spectrum. The use of a symmetric Lanczos algorithm only requires half of the memory compared with the nonsymmetric variant of the Lanczos algorithm. The symmetric Lanczos algorithm is also numerically more stable than the nonsymmetric version. The KPM algorithm is also presented as a low-memory alternative to the Lanczos approach, but the algorithm may require more matrix-vector multiplications in practice. We discuss the pros and cons of these methods in terms of their accuracy as well as their computational and storage cost. Applications to a set of small and medium-sized molecules are also presented.

  15. Adjoint Sensitivities of Time-Periodic Nonlinear Structural Dynamics via Model Reduction

    DTIC Science & Technology

    2009-10-01

    element (ζk are the m-1 zeros of the Lobatto polynomials, as well as -1 and 1), and ψk j is the k th Lagrange polynomial within spectral element j...0 The approximate solution can be expanded in terms of the nodal degrees of freedom at the m Lobatto points (Eq. 39), m trial functions are...and ωk is the Gaussian quadrature weight at Lobatto point k. The equation of motion is now given by the following system of equations within the j th

  16. Evaluating Observational Constraints on N2O Emissions via Information Content Analysis Using GEOS-Chem and its Adjoint

    NASA Astrophysics Data System (ADS)

    Wells, K. C.; Millet, D. B.; Bousserez, N.; Henze, D. K.; Chaliyakunnel, S.; Griffis, T. J.; Dlugokencky, E. J.; Prinn, R. G.; O'Doherty, S.; Weiss, R. F.; Dutton, G. S.; Elkins, J. W.; Krummel, P. B.; Langenfelds, R. L.; Steele, P.

    2015-12-01

    Nitrous oxide (N2O) is a long-lived greenhouse gas with a global warming potential approximately 300 times that of CO2, and plays a key role in stratospheric ozone depletion. Human perturbation of the nitrogen cycle has led to a rise in atmospheric N2O, but large uncertainties exist in the spatial and temporal distribution of its emissions. Here we employ a 4D-Var inversion framework for N2O based on the GEOS-Chem chemical transport model and its adjoint to derive new constraints on the space-time distribution of global land and ocean N2O fluxes. Based on an ensemble of global surface measurements, we find that emissions are overestimated over Northern Hemisphere land areas and underestimated in the Southern Hemisphere. Assigning these biases to particular land or ocean regions is more difficult given the long lifetime of N2O. To quantitatively evaluate where the current N2O observing network provides local and regional emission constraints, we apply a new, efficient information content analysis technique involving radial basis functions. The technique yields optimal state vector dimensions for N2O source inversions, with model