Search NASA⌕ Search

SEARCH · Search NASA

Results for “adjoint problem”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 433 records · Page 24

Quantum Optimal Control Using High Performance Computing

This feasibility study developed numerical methods for the optimal control problem for realizing logical gates in closed quantum systems, where the evolution of the state vector is governed by the time dependent Schrodinger equation. The number of parameters in the control functions is made independent of the number of time steps by expanding them in terms of B-spline basis functions, with and without carrier waves. We use an interior point gradient-based technique from the IPOPT package to minimize the gate infidelity subject to amplitude constraints on the control functions. The symplectic Stromer-Verlet scheme is used to integrate a real-valued formulation of Schrodinger's equation in time and the gradient of the gate infidelity is obtained by solving the corresponding adjoint equation. This allows all components of the gradient to be calculated at the cost of solving three Schrodinger systems, independently of the number of parameters in the control functions. The correctness of the method is verified and applied to Hamiltonians that model the dynamics of coupled super-conducting qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Green's formula and variational principles for cosmic-ray transport with application to rotating and shearing flows

Green's theorem and Green's formula for the diffusive cosmic-ray transport equation in relativistic flows are derived. Green's formula gives the solution of the transport equation in terms of the Green's function of the adjoint transport equation, and in terms of distributed sources throughout the region R of interest, plus terms involving the particle intensity and streaming on the boundary. The adjoint transport equation describes the time-reversed particle transport. An Euler-Lagrange variational principle is then obtained for both the mean scattering frame distribution function f, and its adjoint f(dagger). Variations of the variational functional with respect to f(dagger) yield the transport equation, whereas variations of f yield the adjoint transport equation. The variational principle, when combined with Noether's theorem, yields the conservation law associated with Green's theorem. An investigation of the transport equation for steady, azimuthal, rotating flows suggests the introduction of a new independent variable H to replace the comoving frame momentum variable p'. For the case of rigid rotating flows, H is conserved and is shown to be analogous to the Hamiltonian for a bead on a rigidly rotating wire. The variable H corresponds to a balance between the centrifugal force and the particle inertia in the rotating frame. The physical interpretation of H includes a discussion of nonrelativistic and special relativistic rotating flows as well as the cases of aziuthal, differentially rotating flows about Schwarzs-child and Kerr black holes. Green's formula is then applied to the problem of the acceleration of ultra-high-energy cosmic rays by galactic rotation. The model for galactic rotation assumes an angular velocity law Omega = Omega(sub 0)(omega(sub 0)/omega), where omega denotes radial distance from the axis of rotation. Green's functions for the galactic rotation problem are used to investigate the spectrum of accelerated particles arising from monoenergetic and truncated power-law sources. We conclude that it is possible to accelerate particles beyond the knee by galactic rotation, but not in sufficient number to adequately explain the observed spectrum.

Webb, G. M.↗

The Impulse Approximation Scattering Function and Its Use in Monte Carlo Photon Transport Simulations

The viability of using the impulse approximation scattering function in Monte Carlo photon transport simulations is explored. This scattering function can be constructed from the double differential incoherent scattering cross section developed by Ribberfors and Berggren. A commonly used method for modeling photon Doppler broadening, which is referred to as the hybrid Doppler broadening method, can also be derived from this cross section. A new photon Doppler broadening method, called the consistent Doppler broadening method, is derived and discussed. This method eliminates some of the commonly employed approximations in the hybrid Doppler broadening method, in part, by using the impulse approximation scattering function. Integrated incoherent cross sections generated using the impulse approximation scattering function and the widely used Waller-Hartree scattering function are in good agreement above 20 keV. Below 20 keV, differences as high as 70% are observed, which differs from the roughly 5% differences observed by Ribberfors for some of the materials. Integral and spectral quantities for two problems are also generated using the Monte Carlo photon transport capabilities of the Framework for REsearch in Nuclear ScIence and Engineering (FRENSIE). Due to the small, relative result differences observed when using the impulse approximation scattering function, it is considered a viable alternative to the Waller-Hartree scattering function. In addition, some small, but expected, differences in spectral fluxes at low energies can be avoided by adopting the consistent Doppler broadening method.

42 ENGINEERING↗

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗

A Full Multigrid Method for the Self-Adjoint Angular Flux Equation Based on Cellwise Block Jacobi Iteration

Previous work by Densmore et al. has demonstrated that multigrid methods for the self-adjoint angular flux (SAAF) equation with cellwise block Jacobi smoothing can be extremely effective at solving for the angular flux in one dimension. The extension of that work to two dimensions demonstrated that while the smoother works well, the use of a direct coarse-grid approximation can severely limit the rate of convergence for optically thin cells. In that paper, this convergence limit was evaded through the use of a partially Galerkin coarse-grid approximation. However, relying on a Galerkin coarse-grid approximation is not ideal as constructing the coarse-grid discretization in this approach is complicated. The motivation for this summary is to find a method that can work without the need for a Galerkin coarse-grid approximation. The Full Multigrid (FMG) method is well known as a method that can theoretically solve a problem to its discretization accuracy with optimal linear computational complexity, that is in just O(N) operations for N unknowns. Indeed, we develop an FMG method for the 2-D SAAF equation that yields discretization accuracy and does not require the use of a Galerkin coarse-grid approximation. Until recently, aside from proofs about the order of the error for FMG, little work had been done in quantifying when and how FMG can obtain discretization accuracy. However, recent work by Rodrigo et al. has introduced a Fourier analysis technique called worst-case right-hand side analysis used to calculate the FMG accuracy measure. The FMG accuracy measure is the upper bound on the constant of proportionality between the error of the FMG solution and the discretization error. In this summary, we develop and implement an FMG method for the 2-D Cartesian SAAF equations. We then perform worst-case right-hand side analysis and give numerical examples that demonstrate under what circumstances the method can solve the 2-D SAAF equations to discretization accuracy, for optically thin cells, without the need for a Galerkin coarse-grid approximation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Computing the shape gradient of stellarator coil complexity with respect to the plasma boundary

Coil complexity is a critical consideration in stellarator design. The traditional two-step optimization approach, in which the plasma boundary is optimized for physics properties and the coils are subsequently optimized to be consistent with this boundary, can result in plasma shapes which cannot be produced with sufficiently simple coils. To address this challenge, we propose a method to incorporate considerations of coil complexity in the optimization of the plasma boundary. Coil complexity metrics are computed from the current potential solution obtained with the REGCOIL code (Landreman, Nucl. Fusion , vol. 57, 2017, 046003). While such metrics have previously been included in derivative-free fixed-boundary optimization (Drevlak et al. , Nucl. Fusion , vol. 59, 2018, 016010), we compute the local sensitivity of these metrics with respect to perturbations of the plasma boundary using the shape gradient (Landreman & Paul, Nucl. Fusion , vol. 58, 2018, 076023). We extend REGCOIL to compute derivatives of these metrics with respect to parameters describing the plasma boundary. In keeping with previous research on winding surface optimization (Paul et al. , Nucl. Fusion , vol. 58, 2018, 076015), the shape derivatives are computed with a discrete adjoint method. In contrast with the previous work, derivatives are computed with respect to the plasma surface parameters rather than the winding surface parameters. To further reduce the resolution required to compute the shape gradient, we present a more efficient representation of the plasma surface which uses a single Fourier series to describe the radial distance from a coordinate axis and a spectrally condensed poloidal angle. This representation is advantageous over the standard cylindrical representation used in the VMEC code (Hirshman & Whitson, Phys. Fluids , vol. 26, 1983, pp. 3553–3568), as it provides a uniquely defined poloidal angle, eliminating a null space in the optimization of the plasma surface. In comparison with previous spectral condensation methods (Hirshman & Breslau, Phys. Plasmas , vol. 5, 1998, p. 2664), the modified poloidal angle is obtained algebraically rather than through the solution of a nonlinear optimization problem. The resulting shape gradient highlights features of the plasma boundary that are consistent with simple coils and can be used to couple coil and fixed-boundary optimization.

Physics↗

A theory of quark vs. gluon discrimination

Understanding jets initiated by quarks and gluons is of fundamental importance in collider physics. Efficient and robust techniques for quark versus gluon jet discrimination have consequences for new physics searches, precision αs studies, parton distribution function extractions, and many other applications. Numerous machine learning analyses have attacked the problem, demonstrating that good performance can be obtained but generally not providing an understanding for what properties of the jets are responsible for that separation power. In this paper, we provide an extensive and detailed analysis of quark versus gluon discrimination from first-principles theoretical calculations. Working in the strongly-ordered soft and collinear limits, we calculate probability distributions for fixed N-body kinematics within jets with up through three resolved emissions (O(α$3\atop{s}$)). This enables explicit calculation of quantities central to machine learning such as the likelihood ratio, the area under the receiver operating characteristic curve, and reducibility factors within a well-defined approximation scheme. Further, we relate the existence of a consistent power counting procedure for discrimination to ideas for operational flavor definitions, and we use this relationship to construct a power counting for quark versus gluon discrimination as an expansion in e C F -C A $\ll$1, the exponential of the fundamental and adjoint Casimirs. Our calculations provide insight into the discrimination performance of particle multiplicity and show how observables sensitive to all emissions in a jet are optimal. We compare our predictions to the performance of individual observables and neural networks with parton shower event generators, validating that our predictions describe the features identified by machine learning

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Efficient Multiblock Method for Aerodynamic Analysis and Design on Distributed Memory Systems

The work presented in this paper describes the application of a multiblock gridding strategy to the solution of aerodynamic design optimization problems involving complex configurations. The design process is parallelized using the MPI (Message Passing Interface) Standard such that it can be efficiently run on a variety of distributed memory systems ranging from traditional parallel computers to networks of workstations. Substantial improvements to the parallel performance of the baseline method are presented, with particular attention to their impact on the scalability of the program as a function of the mesh size. Drag minimization calculations at a fixed coefficient of lift are presented for a business jet configuration that includes the wing, body, pylon, aft-mounted nacelle, and vertical and horizontal tails. An aerodynamic design optimization is performed with both the Euler and Reynolds Averaged Navier-Stokes (RANS) equations governing the flow solution and the results are compared. These sample calculations establish the feasibility of efficient aerodynamic optimization of complete aircraft configurations using the RANS equations as the flow model. There still exists, however, the need for detailed studies of the importance of a true viscous adjoint method which holds the promise of tackling the minimization of not only the wave and induced components of drag, but also the viscous drag.

Reuther, James↗

Drag reduction at a plane wall

The objective is to determine by analytical means how drag on a plane wall may be modified favorably using a minimal amount of flow information - preferably only information at the wall. What quantities should be measured? How should that information be assimilated in order to arrive at effective control? As a prototypical problem, incompressible, viscous flow, governed by the Navier-Stokes equations, past a plane wall at which the no-slip condition was modified was considered. The streamwise and spanwise velocity components are required to be zero, but the normal component is to be specified according to some control law. The challenge is to choose the wall-normal velocity component based on flow conditions at the wall so that the mean drag is as small as possible. There can be no net mass flux through the wall, and the total available control energy is constrained. A turbulent flow is highly unsteady and has detailed spatial structure. The mean drag on the wall is the integral over the wall of the local shear forces exerted by the fluid, which is then averaged in time; it is a 'macroscopic' property of the flow. It is not obvious how unsteady boundary control is to be applied in order to modify the mean flow most effectively, especially in view of the non- self-adjoint nature of the governing equations. An approximate analytical solution to the suboptimal scheme is pursued.

Hill, D. C.↗

Online adaptive basis refinement and compression for reduced-order models via vector-space sieving

In many applications, projection-based reduced-order models (ROMs) have demonstrated the ability to provide rapid approximate solutions to high-fidelity full-order models (FOMs). However, there is no a priori assurance that these approximate solutions are accurate; their accuracy depends on the ability of the low-dimensional trial basis to represent the FOM solution. As a result, ROMs can generate inaccurate approximate solutions, e.g., when the FOM solution at the online prediction point is not well represented by training data used to construct the trial basis. To address this fundamental deficiency of standard model-reduction approaches, this work proposes a novel online-adaptive mechanism for efficiently enriching the trial basis in a manner that ensures convergence of the ROM to the FOM, yet does not incur any FOM solves. The mechanism is based on the previously proposed adaptive $h$-refinement method for ROMs, but improves upon this work in two crucial ways. First, the proposed method enables basis refinement with respect to any orthogonal basis (not just the Kronecker basis), thereby generalizing the refinement mechanism and enabling it to be tailored to the physics characterizing the problem at hand. Second, the proposed method provides a fast online algorithm for periodically compressing the enriched basis via an efficient proper orthogonal decomposition (POD) method, which does not incur any operations that scale with the FOM dimension. We report these two features allow the proposed method to serve as (1) a failsafe mechanism for ROMs, as the method enables the ROM to satisfy any prescribed error tolerance online (even in the case of inadequate training), and (2) an efficient online basis-adaptation mechanism, as the combination of basis enrichment and compression enables the basis to adapt online while controlling its dimension.

42 ENGINEERING↗

An Immersed Boundary method with divergence-free velocity interpolation and force spreading

The Immersed Boundary (IB) method is a mathematical framework for constructing robust numerical methods to study fluid–structure interaction in problems involving an elastic structure immersed in a viscous fluid. The IB formulation uses an Eulerian representation of the fluid and a Lagrangian representation of the structure. The Lagrangian and Eulerian frames are coupled by integral transforms with delta function kernels. The discretized IB equations use approximations to these transforms with regularized delta function kernels to interpolate the fluid velocity to the structure, and to spread structural forces to the fluid. It is well-known that the conventional IB method can suffer from poor volume conservation since the interpolated Lagrangian velocity field is not generally divergence-free, and so this can cause spurious volume changes. In practice, the lack of volume conservation is especially pronounced for cases where there are large pressure differences across thin structural boundaries. The aim of this paper is to greatly reduce the volume error of the IB method by introducing velocity-interpolation and force-spreading schemes with the properties that the interpolated velocity field in which the structure moves is at least $\mathscr{C}$ 1 and satisfies a continuous divergence-free condition, and that the force-spreading operator is the adjoint of the velocity-interpolation operator. We confirm through numerical experiments in two and three spatial dimensions that this new IB method is able to achieve substantial improvement in volume conservation compared to other existing IB methods, at the expense of a modest increase in the computational cost. Further, the new method provides smoother Lagrangian forces (tractions) than traditional IB methods. Finally, the method presented here is restricted to periodic computational domains. Its generalization to non-periodic domains is important future work.

97 MATHEMATICS AND COMPUTING↗

Elastic full-waveform inversion and parameterization analysis applied to walk-away vertical seismic profile data for unconventional (heavy oil) reservoir characterization

We report seismic full-waveform inversion (FWI) methods hold strong potential to recover multiple subsurface elastic properties for hydrocarbon reservoir characterization. Simultaneously updating multiple physical parameters introduces the problem of interparameter tradeoff, arising from the covariance between different physical parameters, which increases nonlinearity and uncertainty of multiparameter FWI. The coupling effects of different physical parameters are significantly influenced by model parameterization and acquisition arrangement. An appropriate choice of model parameterization is critical to successful field data applications of multiparameter FWI. The objective of this paper is to examine the performance of various model parameterizations in isotropic-elastic FWI with walk-away vertical seismic profile (W-VSP) dataset for unconventional heavy oil reservoir characterization. Six model parameterizations are considered: velocity-density (α, β and ρ'), modulus-density (κ, μ and ρ), Lamé-density (λ, μ' and ρ'''), impedance-density (IP, IS and ρ''), velocity-impedance-I (α', β' and I' P ), and velocity-impedance-II (α'', β'' and I'S). We begin analyzing the interparameter tradeoff by making use of scattering radiation patterns, which is a common strategy for qualitative parameter resolution analysis. In this paper, we discuss the advantages and limitations of the scattering radiation patterns and recommend that interparameter tradeoffs be evaluated using interparameter contamination kernels, which provide quantitative, second-order measurements of the interparameter contaminations and can be constructed efficiently with an adjoint-state approach. Synthetic W-VSP isotropic-elastic FWI experiments in the time domain verify our conclusions about interparameter tradeoffs for various model parameterizations. Density profiles are most strongly influenced by the interparameter contaminations; depending on model parameterization, the inverted density profile can be over-estimated, under-estimated or spatially distorted. Among the six cases, only the velocity-density parameterization provides stable and informative density features not included in the starting model. Field data applications of multicomponent W-VSP isotropic-elastic FWI in the time domain were also carried out. Finally, the heavy oil reservoir target zone, characterized by low α-to-β ratios and low Poisson’s ratios, can be identified clearly with the inverted isotropic-elastic parameters.

58 GEOSCIENCES↗

Variational Methods in Sensitivity Analysis and Optimization for Aerodynamic Applications

Variational methods (VM) sensitivity analysis, which is the continuous alternative to the discrete sensitivity analysis, is employed to derive the costate (adjoint) equations, the transversality conditions, and the functional sensitivity derivatives. In the derivation of the sensitivity equations, the variational methods use the generalized calculus of variations, in which the variable boundary is considered as the design function. The converged solution of the state equations together with the converged solution of the costate equations are integrated along the domain boundary to uniquely determine the functional sensitivity derivatives with respect to the design function. The determination of the sensitivity derivatives of the performance index or functional entails the coupled solutions of the state and costate equations. As the stable and converged numerical solution of the costate equations with their boundary conditions are a priori unknown, numerical stability analysis is performed on both the state and costate equations. Thereafter, based on the amplification factors obtained by solving the generalized eigenvalue equations, the stability behavior of the costate equations is discussed and compared with the state (Euler) equations. The stability analysis of the costate equations suggests that the converged and stable solution of the costate equation is possible only if the computational domain of the costate equations is transformed to take into account the reverse flow nature of the costate equations. The application of the variational methods to aerodynamic shape optimization problems is demonstrated for internal flow problems at supersonic Mach number range. The study shows, that while maintaining the accuracy of the functional sensitivity derivatives within the reasonable range for engineering prediction purposes, the variational methods show a substantial gain in computational efficiency, i.e., computer time and memory, when compared with the finite difference sensitivity analysis.

Ibrahim, A. H.↗

Reconfigurable Model Execution in the OpenMDAO Framework

NASA's OpenMDAO framework facilitates constructing complex models and computing their derivatives for multidisciplinary design optimization. Decomposing a model into components that follow a prescribed interface enables OpenMDAO to assemble multidisciplinary derivatives from the component derivatives using what amounts to the adjoint method, direct method, chain rule, global sensitivity equations, or any combination thereof, using the MAUD architecture. OpenMDAO also handles the distribution of processors among the disciplines by hierarchically grouping the components, and it automates the data transfer between components that are on different processors. These features have made OpenMDAO useful for applications in aircraft design, satellite design, wind turbine design, and aircraft engine design, among others. This paper presents new algorithms for OpenMDAO that enable reconfigurable model execution. This concept refers to dynamically changing, during execution, one or more of: the variable sizes, solution algorithm, parallel load balancing, or set of variables-i.e., adding and removing components, perhaps to switch to a higher-fidelity sub-model. Any component can reconfigure at any point, even when running in parallel with other components, and the reconfiguration algorithm presented here performs the synchronized updates to all other components that are affected. A reconfigurable software framework for multidisciplinary design optimization enables new adaptive solvers, adaptive parallelization, and new applications such as gradient-based optimization with overset flow solvers and adaptive mesh refinement. Benchmarking results demonstrate the time savings for reconfiguration compared to setting up the model again from scratch, which can be significant in large-scale problems. Additionally, the new reconfigurability feature is applied to a mission profile optimization problem for commercial aircraft where both the parametrization of the mission profile and the time discretization are adaptively refined, resulting in computational savings of roughly 10% and the elimination of oscillations in the optimized altitude profile.

Hwang, John T.↗

Assessment of Multi-Step CADIS Parameter Sensitivity to Neutron Flux Spectrum in Shutdown Dose Rate Calculations

Shutdown dose rate (SDDR) analysis requires (a) a neutron transport calculation to estimate neutron flux fields, (b) an activation calculation to compute radionuclide inventories and associated photon sources, and (c) a photon transport calculation to estimate final dose rate. In some applications, accurate full-scale Monte Carlo (MC) SDDR simulations are needed for very large systems with massive amounts of shielding materials. For example, SDDR assessments are required throughout the biological shield (bio-shield) of the ITER experimental facility to evaluate the required waiting period after the shutdown of ITER and to identify the locations where human accessibility should be prohibited. The bio-shield is a large cylindrical concrete structure (30 m tall and 34 m in diameter) surrounding the very complex tokamak machine. Determining the effects on SDDR of important factors, such as the cross talk (interactions) between the different ports of ITER, is possible only through full-scale simulations that involve all the complex inner details of the ITER tokamak machine. These simulations are impractical because calculation of space- and energy-dependent neutron fluxes throughout the structural materials is needed to estimate the distribution of radioisotopes causing the SDDR. Determining a good importance function that can be used in biasing a neutron MC calculation for SDDR is complicated because it is difficult to explicitly express the SDDR response function, which depends on subsequent computational steps. The Multi-Step Consistent Adjoint Driven Importance Sampling (MS-CADIS) hybrid MC/deterministic method was developed to speed up the SDDR MC neutron transport calculation using an importance function that represents the neutron importance to the final SDDR. The MS-CADIS method uses the CADIS method, which has been Notice: This manuscript has been authored by UT-Battelle, LLC, under Contract No. DE-AC0500OR22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript, or allow others to do so, for the United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan). successfully used for more than a decade in radiation shielding applications to generate consistent source biasing and weight window (WW) variance reduction parameters to accelerate continuous-energy MC simulations. However, because MS-CADIS focuses on multi-step shielding calculations such as SDDR calculations, it develops an importance function for the initial radiation transport calculation (e.g., the neutron calculations in SDDR simulations) that represents the importance of particles to the final response of the overall simulation. To develop this importance function, the MS-CADIS method uses an adjoint calculation with a specific neutron adjoint source that represents the neutron's contribution to the final SDDR. Brute force calculation of the MS-CADIS neutron adjoint source requires a deterministic neutron transport calculation coupled with activation calculations in each element of the deterministic mesh. These calculations are needed to determine the MS-CADIS parameter for the neutron interactions that produce radioisotopes contributing to the SDDR. The MS-CADIS parameter is the microscopic cross section of the radioisotope-producing interaction, multiplied by the mass of this radioisotope existing at the end of the irradiation and decay scenario, and divided by the steady-state rate of the interaction. Because the activation calculations are performed for each radionuclide in each mesh element, implementation of the MS-CADIS method can be computationally expensive. However, these neutron transport and activation calculations are not needed if we assume that the radioisotopes are created due to single neutron interactions and their concentrations do not change as a result of burnup by neutron irradiation. The use of this approximation, which renders the MS-CADIS parameter independent of the neutron flux, seems reasonable in calculating the MS-CADIS importance function because this function is needed only to speed up the MC calculation, not to calculate the final SDDR. In this work, we investigate the validity of this approximation by investigating the behavior of the MS-CADIS parameter as a function of the neutron flux spectra in the Fusion Evaluated Nuclear Data Library (FENDL) Neutronics and Shielding Benchmark problem that contains representative isotopes and flux environments of fusion energy systems. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

TurboRVB: A many-body toolkit for ab initio electronic simulations by quantum Monte Carlo

TurboRVB is a computational package for ab initio Quantum Monte Carlo (QMC) simulations of both molecular and bulk electronic systems. The code implements two types of well established QMC algorithms: Variational Monte Carlo (VMC) and diffusion Monte Carlo in its robust and efficient lattice regularized variant. A key feature of the code is the possibility of using strongly correlated many-body wave functions (WFs), capable of describing several materials with very high accuracy, even when standard mean-field approaches [e.g., density functional theory (DFT)] fail. The electronic WF is obtained by applying a Jastrow factor, which takes into account dynamical correlations, to the most general mean-field ground state, written either as an antisymmetrized geminal power with spin-singlet pairing or as a Pfaffian, including both singlet and triplet correlations. This WF can be viewed as an efficient implementation of the so-called resonating valence bond (RVB) Ansatz, first proposed by Pauling and Anderson in quantum chemistry [L. Pauling, The Nature of the Chemical Bond (Cornell University Press, 1960)] and condensed matter physics [P.W. Anderson, Mat. Res. Bull 8, 153 (1973)], respectively. The RVB Ansatz implemented in TurboRVB has a large variational freedom, including the Jastrow correlated Slater determinant as its simplest, but nontrivial case. Moreover, it has the remarkable advantage of remaining with an affordable computational cost, proportional to the one spent for the evaluation of a single Slater determinant. Therefore, its application to large systems is computationally feasible. The WF is expanded in a localized basis set. Several basis set functions are implemented, such as Gaussian, Slater, and mixed types, with no restriction on the choice of their contraction. The code implements the adjoint algorithmic differentiation that enables a very efficient evaluation of energy derivatives, comprising the ionic forces. Thus, one can perform structural optimizations and molecular dynamics in the canonical NVT ensemble at the VMC level. For the electronic part, a full WF optimization (Jastrow and antisymmetric parts together) is made possible, thanks to state-of-the-art stochastic algorithms for energy minimization. In the optimization procedure, the first guess can be obtained at the mean-field level by a built-in DFT driver. The code was efficiently parallelized by using a hybrid MPI-OpenMP protocol, which is also an ideal environment for exploiting the computational power of modern Graphics Processing Unit accelerators.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bi-orthogonal approach to non-Hermitian Hamiltonians with the oscillator spectrum: Generalized coherent states for nonlinear algebras

A set of Hamiltonians that are not self-adjoint but have the spectrum of the harmonic oscillator is studied. The eigenvectors of these operators and those of their Hermitian conjugates form a bi-orthogonal system that provides a mathematical procedure to satisfy the superposition principle. In this form the non-Hermitian oscillators can be studied in much the same way as in the Hermitian approaches. Two different nonlinear algebras generated by properly constructed ladder operators are found and the corresponding generalized coherent states are obtained. The non-Hermitian oscillators can be steered to the conventional one by the appropriate selection of parameters. In such limit, the generators of the nonlinear algebras converge to generalized ladder operators that would represent either intensity-dependent interactions or multi-photon processes if the oscillator is associated with single mode photon fields in nonlinear media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Group Structure Optimization Using the PyGroup Code

Group constants are used as coefficients in the energy domain discretized Linear Boltzmann Equation (LBE), in which the Continuous-Energy (CE) fluxes are also integrated over energy bins and transformed into group fluxes. This procedure, based on the Multi-Group (MG) theory, is widely applied in radiation transport and diffusion simulations Careful preparation of MG cross section data, or group constants, is thus a prerequisite for success in acquiring high-fidelity LBE solutions. Generation of MG cross section data itself is a complicated multi-step task, since group constants are indispensably coupled with the solution of the LBE, i.e. the flux spectrum in the problem to be solved. Theoretically, a MG cross section library is only valid for the problem that it is built upon. Nevertheless, in practice MG cross section libraries are prepared for similar type of problems, such as thermal reactors, fast reactors, etc., to facilitate the neutronic simulations. Generally, CE point-wise cross section data set, generated by both theoretical models and experimental data, is first converted to Fine-Group (FG) libraries using a pre-defined or precalculated flux spectra, then, Broad-Group (BG) libraries are collapsed from the fine-group libraries using problem-dependent flux spectra. Proper treatments of energy and spatial self-shielding and resonance cross section are required in the CE-to-MG converting process Previously, we have developed a computer code, YGROUP, for fine-to-broad group cross section collapsing. To maintain high accuracy of the resulting BG libraries, YGROUP provides users several options on collapsing strategies and weighting schemes for group binning and evaluation of BG cross section data in users' specific problems.. An approach based on Particle Swarm Optimization was applied to automatically determine the optimal group structure. We also developed a hybrid weighting scheme to further improve BG library performance for Special Nuclear Materials (SNM) detection applications. In this work, a new computer code, PyGroup, has been developed to implement the PSO approach with an improved simulation-driven fitness function design that includes both response and forward/adjoint flux errors. Together with YGROUP, and deterministic transport code TITAN/PENMSHXP, the PyGroup code package is tested on a Dual Range Coincident Counter (DRCC) model. In this paper, we demonstrated the capability of the PyGroup code for group structure optimization using the DRCC detector model. In the future, an iteration scheme can be implemented to determine the number of broad groups based on a user-defined tolerance. we will also apply PyGroup to more complicated reactor models, and investigate physics-based fitness function designs to further reduce computational cost. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗