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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Topology optimization of finite strain viscoplastic systems under transient loads [Dynamic topology optimization based on finite strain visco-plasticity]

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capability of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.

42 ENGINEERING↗
DOE OSTI2022

Tunable phononic bandgap materials designed via topology optimization

Topology optimization is used to design phononic bandgap materials that are tunable by mechanical deformation. A periodic media is considered, which due to the assumption of length scale separation, allows the dispersion relations to be obtained by analyzing a single unit cell subjected to Floquet–Bloch boundary conditions. A finite macroscopic deformation is applied to the unit cell to affect its geometry and hence dispersion. We tune the dispersion–deformation relation to our liking by solving a topology optimization problem using nonlinear programming. The adjoint method is employed to compute the sensitivities, and the non-differentiability of degenerate eigenvalues is avoided using symmetric polynomials. Several tunable phononic crystal designs are presented. Also, a verification analysis is performed, wherein the optimized design is interpreted and analyzed using a conforming finite element mesh.

42 ENGINEERING↗
DOE OSTI2015

ACCELERATING FUSION REACTOR NEUTRONICS MODELING BY AUTOMATIC COUPLING OF HYBRID MONTE CARLO/DETERMINISTIC TRANSPORT ON CAD GEOMETRY

Detailed radiation transport calculations are necessary for many aspects of the design of fusion energy systems (FES) such as ensuring occupational safety, assessing the activation of system components for waste disposal, and maintaining cryogenic temperatures within superconducting magnets. Hybrid Monte Carlo (MC)/deterministic techniques are necessary for this analysis because FES are large, heavily shielded, and contain streaming paths that can only be resolved with MC. The tremendous complexity of FES necessitates the use of CAD geometry for design and analysis. Previous ITER analysis has required the translation of CAD geometry to MCNP5 form in order to use the AutomateD VAriaNce reducTion Generator (ADVANTG) for hybrid MC/deterministic transport. In this work, ADVANTG was modified to support CAD geometry, allowing hybrid (MC)/deterministic transport to be done automatically and eliminating the need for this translation step. This was done by adding a new ray tracing routine to ADVANTG for CAD geometries using the Direct Accelerated Geometry Monte Carlo (DAGMC) software library. This new capability is demonstrated with a prompt dose rate calculation for an ITER computational benchmark problem using both the Consistent Adjoint Driven Importance Sampling (CADIS) method an the Forward Weighted (FW)-CADIS method. The variance reduction parameters produced by ADVANTG are shown to be the same using CAD geometry and standard MCNP5 geometry. Significant speedups were observed for both neutrons (as high as a factor of 7.1) and photons (as high as a factor of 59.6).

Biondo, Elliott D↗
DOE OSTI2022

Blade planform design optimization to enhance turbine wake control

Abstract This study considers optimizing the planform of wind turbine blades to ultimately enhance wind plant controls, namely, wake steering strategies. Adjoint‐enabled unsteady actuator line simulations are carried out to obtain gradients for optimization of several different performance objectives with respect to blade chord length at 10 locations along blade span. We demonstrate different blade design optimizations that can maximize time‐averaged lateral wake deflection, entrainment of kinetic energy, or total power of multiple turbines. Our optimized designs can produce a 4+% increase in wake deflection, a 4× increase in vertical kinetic energy entrainment, or a 3.6% increase in power when compared with the baseline case. While lateral wake deflection is only modestly sensitive to chord changes, we find that increasing the outboard chord length can dramatically increase kinetic energy entrainment, resulting in faster wake recovery and gains in net power. While this work develops only a few case studies emphasizing relative performance improvements and general trends, these results show the promise of a framework that combines mid‐fidelity computation with adjoint‐based optimization for control and design problems.

WIND ENERGY↗
DOE OSTI2019

α-weighted Transition Rate Matrix Method

Relative effectiveness of an α-weighted Transition Rate Matrix Method (TRMM) as compared to the normally used κ- weighted, for solving reactor transient problem is investigated. An improved Monte Carlo κ-α iteration with delayed neutron is implemented to the OpenMC to generate the fundamental α-eigenfunction to be used as the weighting function in calculating the TRMM forward and adjoint operators. A prompt supercritical transient problem and a deep subcritical transient problem of a two-region slab system are devised to compare the relative performance of the α- and κ-weighted TRMM.

Variansyah, Ilham↗
DOE OSTI2017

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

We present two efficient iterative algorithms for solving the linear response eigen- value problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into a product eigenvalue problem that is self-adjoint with respect to a K-inner product. This product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. However, the other component of the eigenvector can be easily recovered in a postprocessing procedure. Therefore, the algorithms we present here are more efficient than existing algorithms that try to approximate both components of the eigenvectors simultaneously. The efficiency of the new algorithms is demonstrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Transient and Steady-State Inverse Problems in Sierra/Aria

Inverse problems arise in a wide range of applications, whenever unknown model parameters cannot be measured directly. Instead, the unknown parameters are estimated using experimental data and forward simulations. Thermal inverse problems, such as material characterization problems, are often large-scale and transient. Therefore, they require intrusive adjoint-based gradient implementations in order to be solved efficiently. The capability to solve large-scale transient thermal inverse problems using an adjoint-based approach was recently implemented in SNL Sierra Mechanics, a massively parallel capable multiphysics code suite. This report outlines the theory, optimization formulation, and path taken to implement thermal inverse capabilities in Sierra within a unit test framework. The capability utilizes Sierra/Aria and Sierra/Fuego data structures, the Rapid Optimization Library, and an interface to the Sierra/InverseOpt library. The existing Sierra/Aria time integrator is leveraged to implement a time-dependent adjoint solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Adjoint-enabled multidimensional optimization of satellite electron/proton shields - 25452

The design of satellites usually includes the objective of minimizing mass due to high launch costs, which is complicated by the need to protect sensitive electronics from the space radiation environment. There is growing interest in automated design optimization techniques to help achieve that objective. Traditional optimization approaches that rely exclusively on response functions (e.g. dose calculations) can be quite expensive when applied to transport problems. Previously we showed how adjoint-based transport sensitivities used in conjunction with gradient-based optimization algorithms can be quite effective in designing mass-efficient electron/proton shields in one-dimensional slab geometries. In this paper we extend that work to two-dimensional Cartesian geometries. This consists primarily of deriving the sensitivities to geometric changes, given a particular prescription for parameterizing the shield geometry. We incorporate these sensitivities into our optimization process and demonstrate their effectiveness in such design calculations. (authors)

42 ENGINEERING↗
DOE OSTI2023

hIPPYlib-MUQ: A Bayesian Inference Software Framework for Integration of Data with Complex Predictive Models under Uncertainty

Bayesian inference provides a systematic framework for integration of data with mathematical models to quantify the uncertainty in the solution of the inverse problem. However, the solution of Bayesian inverse problems governed by complex forward models described by partial differential equations (PDEs) remains prohibitive with black-box Markov chain Monte Carlo (MCMC) methods. We present hIPPYlib-MUQ, an extensible and scalable software framework that contains implementations of state-of-the art algorithms aimed to overcome the challenges of high-dimensional, PDE-constrained Bayesian inverse problems. These algorithms accelerate MCMC sampling by exploiting the geometry and intrinsic low-dimensionality of parameter space via derivative information and low rank approximation. The software integrates two complementary open-source software packages, hIPPYlib and MUQ. hIPPYlib solves PDE-constrained inverse problems using automatically-generated adjoint-based derivatives, but it lacks full Bayesian capabilities. MUQ provides a spectrum of powerful Bayesian inversion models and algorithms, but expects forward models to come equipped with gradients and Hessians to permit large-scale solution. By combining these two complementary libraries, we created a robust, scalable, and efficient software framework that realizes the benefits of each and allows us to tackle complex large-scale Bayesian inverse problems across a broad spectrum of scientific and engineering disciplines. To illustrate the capabilities of hIPPYlib-MUQ, we present a comparison of a number of MCMC methods available in the integrated software on several high-dimensional Bayesian inverse problems. These include problems characterized by both linear and nonlinear PDEs, various noise models, and different parameter dimensions. The results demonstrate that large (~ 50×) speedups over conventional black box and gradient-based MCMC algorithms can be obtained by exploiting Hessian information (from the log-posterior), underscoring the power of the integrated hIPPYlib-MUQ framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Three-dimensional traction microscopy accounting for cell-induced matrix degradation

Tractions exerted by cells on the extracellular matrix (ECM) are critical in many important physiological and pathological processes such as embryonic morphogenesis, wound healing, and cancer metastasis. Three-dimensional Traction Microscopy (3DTM) is a tool to quantify cellular tractions by first measuring the displacement field in the ECM in response to these tractions, and then using this measurement to infer tractions. Most applications of 3DTM have assumed that the ECM has spatially-uniform mechanical properties, but cells secrete enzymes that can locally degrade the ECM. In this work, a novel computational method is developed to quantify both cellular tractions and ECM degradation. In particular, the ECM is modeled as a hyperelastic, Neo-Hookean solid, whose material parameters are corrupted by a single degradation parameter. The feasibility of determining both the traction and the degradation parameter is first demonstrated by showing the existence and uniqueness of the solution. An inverse problem is then formulated to determine the nodal values of the traction vector and the degradation parameter, with the objective of minimizing the difference between a predicted and measured displacement field, under the constraint that the predicted displacement field satisfies the equation of equilibrium. The inverse problem is solved by means of a gradient-based optimization approach, and the gradient is computed efficiently using appropriately derived adjoint fields. The computational method is validated in-silico using a geometrically realistic neuronal cell model and synthetic traction and degradation fields. It is found that the method accurately recovers both the traction and degradation fields. Moreover, it is found that neglecting ECM degradation can yield significant errors in traction measurements. Finally, our method can extend the range of context where tractions can be appropriately measured.

42 ENGINEERING↗
DOE OSTI2016

Optimal Multistage Algorithm for Adjoint Computation

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.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Fission matrix capability for MCNP, Part I - Theory

The theory underlying the fission matrix method is derived using a rigorous Green's function approach. The method is then used to investigate fundamental properties of the transport equation for a continuous-energy physics treatment. We provide evidence that an infinite set of discrete, real eigenvalues and eigenfunctions exist for the continuous-energy problem, and that the eigenvalue spectrum converges smoothly as the spatial mesh for the fission matrix is refined. We also derive equations for the adjoint solution. We show that if the mesh is sufficiently refined so that both forward and adjoint solutions are valid, then the adjoint fission matrix is identical to the transpose of the forward matrix. While the energy-dependent transport equation is strictly bi-orthogonal, we provide surprising results that the forward modes are very nearly self-adjoint for a variety of continuous-energy problems. A companion paper (Part II - Applications) describes the initial experience and results from implementing this fission matrix capability into the MCNP Monte Carlo code. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Adjoint-Based Constant-Mass Partial Derivatives

It is well known that the adjoint equation in transport theory provides an economical means of computing derivatives of a system response to system parameters. It is also well known, though not often remarked on, that adjoint-based partial derivatives with respect to mass density are constant-volume derivatives. Likewise, adjoint-based partial derivatives with respect to dimensions (i.e., internal interface locations and the outer system boundary) are constant-density derivatives. In this paper, we derive a formula for the constant-mass partial derivative of a response with respect to internal interface locations and the outer system boundary. The formula uses the partial derivatives for density and dimensions, which may be adjoint-based. This paper includes numerical comparisons for a two-dimensional (r-z) cylinder that also demonstrate the correctness of the regular adjoint-based derivatives for surface locations. Adjoint-based derivatives for the neutron problems were computed using the new SENSMG code at Los Alamos National Laboratory.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Adjoint DSMC for nonlinear Boltzmann equation constrained optimization

Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Here, several numerical examples are presented to demonstrate their accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

On the spin- 1/2 Aharonov–Bohm problem in conical space: Bound states, scattering and helicity nonconservation

In this work the bound state and scattering problems for a spin- 1/2 particle undergone to an Aharonov–Bohm potential in a conical space in the nonrelativistic limit are considered. The presence of a δ-function singularity, which comes from the Zeeman spin interaction with the magnetic flux tube, is addressed by the self-adjoint extension method. One of the advantages of the present approach is the determination of the self-adjoint extension parameter in terms of physics of the problem. Expressions for the energy bound states, phase-shift and S matrix are determined in terms of the self-adjoint extension parameter, which is explicitly determined in terms of the parameters of the problem. The relation between the bound state and zero modes and the failure of helicity conservation in the scattering problem and its relation with the gyromagnetic ratio g are discussed. Also, as an application, we consider the spin- 1/2 Aharonov–Bohm problem in conical space plus a two-dimensional isotropic harmonic oscillator. -- Highlights: •Planar dynamics of a spin- 1/2 neutral particle. •Bound state for Aharonov–Bohm systems. •Aharonov–Bohm scattering. •Helicity nonconservation. •Determination of the self-adjoint extension parameter.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2016

Fission Matrix Convergence Diagnostic of the Iterated Fission Probability Method

Monte Carlo methods have been applied to reactor problems in order to solve for adjoint-weighted quantities. The Iterated Fission Probability (IFP) method allows adjoint-weighted tallies to be recorded during a forward Monte-Carlo simulation. A key parameter in the IFP method is the number of generations that must pass before the progeny neutrons of a progenitor neutron are tallied. A convergence diagnostic for the IFP is developed using a deterministic code. In particular, a discrete ordinates code is used as a surrogate to demonstrate the theoretical properties of the proposed Monte Carlo convergence diagnostic. The diagnostic is applied to 1-D slab problems and quantifies the error associated with tallying the neutron progeny before an asymptotic distribution is achieved. The results show that the default value of 10 for the number of generations used in MCNP is acceptable for most classes of problems. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

Monte Carlo Perturbation Theory Estimates of Sensitivities to System Dimensions

Here, Monte Carlo methods are developed using adjoint-based perturbation theory and the differential operator method to compute the sensitivities of the k-eigenvalue, linear functions of the flux (reaction rates), and bilinear functions of the forward and adjoint flux (kinetics parameters) to system dimensions for uniform expansions or contractions. The calculation of sensitivities to system dimensions requires computing scattering and fission sources at material interfaces using collisions occurring at the interface—which is a set of events with infinitesimal probability. Kernel density estimators are used to estimate the source at interfaces using collisions occurring near the interface. The methods for computing sensitivities of linear and bilinear ratios are derived using the differential operator method and adjoint-based perturbation theory and are shown to be equivalent to methods previously developed using a collision history–based approach. The methods for determining sensitivities to system dimensions are tested on a series of fast, intermediate, and thermal critical benchmarks as well as a pressurized water reactor benchmark problem with iterated fission probability used for adjoint-weighting. The estimators are shown to agree within 5% and 3σ of reference solutions obtained using direct perturbations with central differences for the majority of test problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗