Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adjoint methods”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2011

Canonical quantization of lattice Higgs-Maxwell-Chern-Simons fields: Osterwalder-Schrader positivity

A Euclidean representation is given for a canonically quantized relativistic Maxwell-Chern-Simons field on a lattice, which approximates a complex measure on a space of distributions. Using a path-space formula for the nonself-adjoint Hamiltonian, the relation between Euclidean Osterwalder-Schrader positivity, the Krein metric, and Gauss' law is examined.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

A deterministic method for PWR loading pattern optimization

A new deterministic approach to core loading optimization is presented. Selection of fuel enrichment and burnable poison (BP) arrangement in a pressurized water reactor (PWR) core are optimally determined subject to power peaking factor (PF) constraints. The deterministic approach is based on the method of Lagrange multipliers and the direct adjoining approach for the inequality power PF constraint. The optimality conditions are derived using calculus of variations resulting in the presence of jump conditions and a linear control Hamiltonian. The optimal control problems are addressed by simultaneously minimizing the Hamiltonian using the gradient method and performing Newton's method in different regions of the core to produce viable solutions for the controls. Without active control of the power profile in PWRs during depletion, our methodology is able to satisfy the power PF constraint at all times by proper loading selection at the beginning of cycle (BOC). This is achieved by promoting the proper burnup path forward in time during the calculation of the forward optimality conditions. Here this information is utilized in the adjoint burnup calculation, which acts to propagate the optimal control path back to the BOC during the calculation of the adjoint optimality conditions. The methodology has been developed into a new code DMCO (Deterministic Multi-Control Optimization) which can produce two-dimensional two-group depletion results in approximately seven minutes per optimization iteration on a personal computer. No application of heuristics is required and the code is capable of finding solutions from initial control distributions. A preliminary case study is presented for the Westinghouse AP600 first cycle fuel loading design which achieved an extended fuel cycle while satisfying power PF constraints.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

Performance Improvements for the Griffin Transport Solvers

Griffin is a Multiphysics Object-Oriented Simulation Environment based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. Griffin includes a variety of deterministic radiation transport solvers for fixed source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. A code assessment performed in FY-20 identified two significant issues with the transport solvers in Griffin: first, the primary heterogeneous SN (discrete ordinates) transport solver based on continuous finite element methods required significant mesh refinement and higher memory usage compared to solvers based on the method of characteristic for equivalent accuracy. Second, the homogeneous PN (spherical harmonics expansion) transport solver did not adequately support polynomial refinement, which is a feature usually required for problems with spatial homogenization and pronounced streaming, typical in fast or gas-cooled reactor systems. To address the first issue, the development effort focused on the more promising discontinuous finite element method (DFEM)-based SN transport solver in Griffin. The addition of an asynchronous parallel transport sweeper and coarse mesh finite difference (CMFD) acceleration have rendered a superior heterogeneous SN transport capability for multiphysics problems that requires far less computing resources in terms of both CPU time and memory usage. This is demonstrated with typical thermal- and fast-spectrum reactor benchmark problems, including 2D Transient Reactor Test, 3D Advanced Burner Test Reactor (ABTR), and 2D and 3D Empire microreactor. For the second issue, the development effort focused on a new transport solver based on the hybrid finite element PN method (HFEM-PN), equivalent to the variational nodal method, as well as a new diffusion solver based on HFEM-Diffusion. This solver is intended for homogenized domains with multiphysics coupling (i.e., supports mesh displacement, seamless temperature feedback, etc.). Initial calculations with the HFEM-Diffusion implementation show very good parallel efficiency for the residual evaluations with the 2D ABTR benchmark. A future development effort will be centered on further improvements to the CMFD, HFEM-PN, and DFEM diffusion solvers to ensure Griffin meets performance and software quality assurance requirements for advanced reactor design and analysis.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
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 OSTI2021

A Sparse-Grid Probabilistic Scheme for Approximation of the Runaway Probability of Electrons in Fusion Tokamak Simulation

Runaway electrons (RE) generated during magnetic disruptions present a major threat to the safe operation of plasma nuclear fusion reactors. A critical aspect of understanding RE dynamics is to calculate the runaway probability, i.e., the probability that an electron in the phase space will runaway on, or before, a prescribed time. Such probability can be obtained by solving the adjoint equation of the underlying Fokker-Planck equation that controls the electron dynamics. In this effort, we present a sparse-grid probabilistic scheme for computing the runaway probability. The key ingredient of our approach is to represent the solution of the adjoint equation as a conditional expectation, such that discretizing the differential operator reduces to the approximation of a set of integrals. Adaptive sparse grid interpolation is utilized to approximate the map from the phase space to the runaway probability. The main novelties of this effort are the integration of the sparse-grid method into the probabilistic numerical scheme for computing escape probability, and the application of the proposed method in computing RE probabilities. Two numerical examples are given to illustrate that the proposed method can achieve O(Δt) convergence, and that the local anisotropic adaptive refinement strategy (M. Stoyanov, Adaptive sparse grid construction in a context of local anisotropy and multiple hierarchical parents. In: Sparse Grids and Applications-Miami 2016, Springer, Berlin, 2018, pp. 175–199) can effectively handle the sharp transition layer between the runaway and non-runaway regions.

Yang, Minglei↗
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 OSTI2022

Improvements to the Griffin Transport Solvers

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. The code includes a variety of steady-state solvers for fixed-source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. This document summarizes the transport solver development efforts pursued during Fiscal Year 2022. We added the multiphysics transient capability for the coarse-mesh finite difference accelerated Richardson iteration for discontinuous finite element method discrete ordinates (DFEM-SN) scheme to support high-order heterogeneous transport simulations. HFEM (hybrid finite element method) - PN (spherical harmonics expansion) was completed and red-black iteration was added for solving the HFEM-PN system with both preconditioned Jacobian-free Newton Krylov and Richardson iteration solvers. The HFEM-PN scheme, as one of the low-order transport schemes, is expected for supporting routine design simulations. Pin power reconstruction capability was also designed and implemented with the Griffin ISOXML module to enhance all the low-order transport solvers for more accurate multiphysics simulations. Numerical results are presented for demonstrating the capabilities and verifying their performance, and future works are discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Depletion GPT-free sensitivity analysis for reactor eigenvalue problems

This manuscript introduces a novel approach to solving depletion perturbation theory problems without the need to set up or solve the generalized perturbation theory (GPT) equations. The approach, hereinafter denoted generalized perturbation theory free (GPT-Free), constructs a reduced order model (ROM) using methods based in perturbation theory and computes response sensitivity profiles in a manner that is independent of the number or type of responses, allowing for an efficient computation of sensitivities when many responses are required. Moreover, the reduction error from using the ROM is quantified in the GPT-Free approach by means of a Wilks' order statistics error metric denoted the K-metric. Traditional GPT has been recognized as the most computationally efficient approach for performing sensitivity analyses of models with many input parameters, e.g. when forward sensitivity analyses are computationally intractable. However, most neutronics codes that can solve the fundamental (homogenous) adjoint eigenvalue problem do not have GPT capabilities unless envisioned during code development. The GPT-Free approach addresses this limitation by requiring only the ability to compute the fundamental adjoint. This manuscript demonstrates the GPT-Free approach for depletion reactor calculations performed in SCALE6 using the 7x7 UAM assembly model. A ROM is developed for the assembly over a time horizon of 990 days. The approach both calculates the reduction error over the lifetime of the simulation using the K-metric and benchmarks the obtained sensitivities using sample calculations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2014

Optimal Shielding Design For Minimum Materials Cost or Mass - Paper 128

Material costs dominate some shielding design problems. This is certainly the case for manned nuclear power space applications for which shielding is essential and the cost of launching by rocket from Earth is high. In such situations or in those where shielding volume or mass is constrained, it is important to optimize the design. Although trial and error synthesis methods may succeed, a more systematic approach is warranted. Design automation may also potentially reduce engineering costs. The objective is to automate the design of optimal radiation shielding to meet specified attenuation requirements given a menu of allowed shielding materials, their properties and their delivered costs per unit volume. The cost-optimal design is one which, at each location in the shield, chooses the menu material minimizing a particular functional of forward and adjoint angular fluxes plus material cost. Thus a Boltzmann forward and adjoint angular flux solver with additional calculations can evaluate whether a shield design is optimal or whether improvements are possible. An iterative algorithm based on approximated optimality is proposed to solve for the optimal shield design and numerical experiments with it are discussed. The future use of 3D Boltzmann solvers will allow extending results to shaped shield designs in which material is not wasted to maintain unneeded spherical symmetry. The largest cost savings of automated optimal design of shielding is expected to be for applications involving nuclear powered manned space missions where the required shielding attenuation of radiation and costs are both large. However, less exotic applications such as the shielding of radiation facilities on Earth could also benefit from optimal shielding design, and automation of the design process may reduce engineering costs. (author)

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2011

Spectral Solutions of Self-adjoint Elliptic Problems with Immersed Interfaces

This paper describes a spectral representation of solutions of self-adjoint elliptic problems with immersed interfaces. The interface is assumed to be a simple non-self-intersecting closed curve that obeys some weak regularity conditions. The problem is decomposed into two problems, one with zero interface data and the other with zero exterior boundary data. The problem with zero interface data is solved by standard spectral methods. The problem with non-zero interface data is solved by introducing an interface space H{sub {Gamma}}({Omega}) and constructing an orthonormal basis of this space. This basis is constructed using a special class of orthogonal eigenfunctions analogously to the methods used for standard trace spaces by Auchmuty (SIAM J. Math. Anal. 38, 894-915, 2006). Analytical and numerical approximations of these eigenfunctions are described and some simulations are presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Earth System Reanalysis in Support of Climate Model Improvements

Recent climate model developments, established through increased model resolution, have led to substantial improvements in model simulations of the time-evolving, coupled Earth system and its subcomponents. However, regardless of resolution, climate models will always produce climate features and variability that differ from the real world and will be prone to biases. This is due to many remaining uncertainties, such as in parametric and structural model uncertainty, in the initial conditions prescribed, and in the prescribed (scenario) forcing which varies on decadal to centennial timescales. Further model improvements are expected to arise specifically from improved representation of physical processes realized through model-data fusion. This will create an unprecedented opportunity to better exploit a large array of Earth observations, from in situ measurements to weather radars and satellite observations, as the resolved scales of the models approach those of the observations. For this, climate DA will be the central tool to bring models and observations into consistency, by improving initial conditions, inferring uncertain model parameters and structure, and quantifying uncertainty. Generally, there will be advantages and complementarities of adjoint-based smoother approaches, ensemble-based filter approaches, or new ML-inspired approaches. Yet, the ever-increasing model resolution will present growing challenges arising from computational cost, calling for new ways of performing data assimilation and model optimization. Using the complementarity in a hybrid approach, blending tools and concepts from variational, ensemble and ML methods might be what is required in the future. In this context ML could be important to handle non-linear responses, and to better approximate non-Gaussian distributions.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1976

Complex symmetric root square locus with an application to a spinning drag-free satellite

The parameters and relations associated with optimal systems are examined, taking into account a quadratic performance index and a root square locus plot, including the characteristic roots of the optimal system and its adjoint system as a function of the cost function weights. The calculation of the locus is described and the employment of the considered relations in studies of a drag-free satellite is discussed. Attention is given to weights regarding the initial states, questions of rotating integral control, approaches for experimental verification, and the performance of various methods for the reduction of fuel consumption due to center of spin offsets.

Tashker, M. G.↗
DOE OSTI2017

Sensitivity Analysis of Neutron Multiplicity Counting Statistics Using First-Order Perturbation Theory and Application to a Subcritical Plutonium Metal Benchmark

It is frequently important to estimate the uncertainty and sensitivity of measured and computed detector responses in subcritical experiments and simulations. These uncertainties arise from the physical construction of the experiment, uncertainties in the transport parameters, and counting uncertainties. Perturbation theory enables sensitivity analysis (SA) and uncertainty quantification on integral quantities like detector responses. Here the aim of our work is to apply SA to the statistics of subcritical neutron multiplicity counting distributions. Current SA methods have only been applied to mean detector responses and the keff eigenvalue. For multiplicity counting experiments, knowledge of the higher-order counting moments and their uncertainties are essential for a complete SA. We apply perturbation theory to compute the sensitivity of neutron multiplicity counting moments to arbitrarily high order. Each moment is determined by solving an adjoint transport equation with a source term that is a function of the adjoint solutions for lower-order moments. This enables moments of arbitrarily high order to be sequentially determined, and it shows that each moment is sensitive to the uncertainties of all lower-order moments. To close our SA of the moments, we derive forward transport equations that are functions of the forward flux and lower-order moment adjoint fluxes. We verify our calculations for the first three moments by comparison with multiplicity counting measurements of a subcritical plutonium metal sphere. For the first three moments, the most influential parameters are ranked, and the validity of first-order perturbation theory is demonstrated by examining the series truncation error. This enables a detailed SA of subcritical multiplicity counting measurements of fissionable material based on transport theory.

42 ENGINEERING↗
DOE OSTI2015

Enabling Predictive Simulation and UQ of Complex Multiphysics PDE Systems by the Development of Goal-Oriented Variational Sensitivity Analysis and a-Posteriori Error Estimation Methods

This project addressed the challenge of predictive computational analysis of strongly coupled, highly nonlinear multiphysics systems characterized by multiple physical phenomena that span a large range of length- and time-scales. Specifically, the project was focused on computational estimation of numerical error and sensitivity analysis of computational solutions with respect to variations in parameters and data. In addition, the project investigated the use of accurate computational estimates to guide efficient adaptive discretization. The project developed, analyzed and evaluated new variational adjoint-based techniques for integration, model, and data error estimation/control and sensitivity analysis, in evolutionary multiphysics multiscale simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Multiscale Capability in Rattlesnake using Contiguous Discontinuous Discretization of Self-Adjoint Angular Flux Equation

In this report, we present a new upwinding scheme for the multiscale capability in Rattlesnake, the MOOSE based radiation transport application. Comparing with the initial implementation of multiscale utilizing Lagrange multipliers to impose strong continuity of angular flux on interface of in-between subdomains, this scheme does not require the particular domain partitioning. This upwinding scheme introduces discontinuity of angular flux and resembles the classic upwinding technique developed for solving first order transport equation using discontinuous finite element method (DFEM) on the subdomain interfaces. Because this scheme restores the causality of radiation streaming on the interfaces, significant accuracy improvement can be observed with moderate increase of the degrees of freedom comparing with the continuous method over the entire solution domain. Hybrid SN-PN is implemented and tested with this upwinding scheme. Numerical results show that the angular smoothing required by Lagrange multiplier method is not necessary for the upwinding scheme.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2016

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

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.

42 ENGINEERING↗
NASA NTRS1989

Ritz method for transient response in systems having unsymmetric stiffness

The DMAP coding was automated to such an extent by using the device of bubble vectors, that it is useable for analyses in its present form. This feasibility study demonstrates that the Ritz Method is so compelling as to warrant coding its modules in FORTRAN and organizing the resulting coding into a new Rigid Format. Even though this Ritz technique was developed for unsymmetric stiffness matrices, it offers advantages to problems with symmetric stiffnesses. If used for the symmetric case the solution would be simplified to one set of modes, because the adjoint would be the same as the primary. Its advantage in either type of symmetry over a classical eigenvalue modal expansion is that information density per Ritz mode is far richer than per eigenvalue mode; thus far fewer modes would be needed for the same accuracy and every mode would actively participate in the response. Considerable economy can be realized in adapting Ritz vectors for modal solutions. This new Ritz capability now makes NASTRAN even more powerful than before.

Butler, Thomas G.↗
DOE OSTI2025

A note on the reliability of goal-oriented error estimates for Galerkin finite element methods with nonlinear functionals

Here, we consider estimating the discretization error in a nonlinear functional J (u) in the setting of an abstract variational problem: find u ϵ $\mathscr{V}$ such that B (u, φ) = L (φ) ∀φ ϵ $\mathscr{V}$, as approximated by a Galerkin finite element method. Here, $\mathscr{V}$ is a Hilbert space, B (. , .) is a bilinear form, and L (∙) is a linear functional. We consider well-known error estimates η of the form J (u) - J (u h ) ≈ η = L (z) - B (u h , z), where u h denotes a finite element approximation to u, and z denotes the solution to an auxiliary adjoint variational problem. We show that there exist nonlinear functionals for which error estimates of this form are not reliable, even in the presence of an exact adjoint solution z. An estimate η is said to be reliable if there exists a constant C ϵ $\mathbb{R}$ >0 independent of u h such that |J (u) - J (u h )| ≤ C|η|. We present several example pairs of bilinear forms and nonlinear functionals where reliability of η is not achieved.

A posteriori↗