Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adjoint equation”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Juqbox.jl

The Juqbox.jl package implements functionality for solving the quantum optimal control problem for realizing logical gates in closed quantum systems. The dynamics of the quantum system is modeled by Schroedinger's equation, which takes to form of a linear system of ordinary differential equations (ODE). Juqbox.jl solves this ODE by numerical time stepping and applies a gradient-based optimization technique to determine control pulses for driving an initial state to a final state, according to the desired logical gate transformation. To evaluate the gradient, Juqbox.jl applies the ``first discretize, then optimize'' approach based on a discrete adjoint time stepping technique. The actual optimization is performed by the open source Ipopt libaray. Juqbox.jl is written in the Julia programming language which, among many other features, provides a convenient interface to the Ipopt library.

PETERSSON, NILSA.↗
NASA NTRS1972

Surface roughness effects on equilibrium temperature.

An analysis is presented for evaluation of equilibrium temperature distribution on radiatively adiabatic, adjoint planes which are uniformly irradiated by a collimated solar flux. The analysis employs a semigrey spectral model. Radiation properties for surface emitted radiation are obtained from the expressions of electromagnetic theory for smooth surfaces. Rough surface properties for solar radiation are given by the Beckmann bidirectional reflectance model. Numerical solutions to the governing equations yield equilibrium temperature distributions for a range of the influencing parameters. Surface roughness has little influence on equilibrium temperature for materials with high values for solar absorptance. However, for low or intermediate values of solar absorptance, roughness effects on the spatial distribution of reflected solar radiation can significantly alter equilibrium temperature particularly at surface elements where radiant interaction is small.

Houchens, A. F.↗
NASA NTRS1993

Receptivity in parallel flows: An adjoint approach

Linear receptivity studies in parallel flows are aimed at understanding how external forcing couples to the natural unstable motions which a flow can support. The vibrating ribbon problem models the original Schubauer and Skramstad boundary layer experiment and represents the classic boundary layer receptivity problem. The process by which disturbances are initiated in convectively-unstable jets and shear layers has also received attention. Gaster was the first to handle the boundary layer analysis with the recognition that spatial modes, rather than temporal modes, were relevant when studying convectively-unstable flows that are driven by a time-harmonic source. The amplitude of the least stable spatial mode, far downstream of the source, is related to the source strength by a coupling coefficient. The determination of this coefficient is at the heart of this type of linear receptivity study. The first objective of the present study was to determine whether the various wave number derivative factors, appearing in the coupling coefficients for linear receptivity problems, could be reexpressed in a simpler form involving adjoint eigensolutions. Secondly, it was hoped that the general nature of this simplification could be shown; indeed, a rather elegant characterization of the receptivity properties of spatial instabilities does emerge. The analysis is quite distinct from the usual Fourier-inversion procedures, although a detailed knowledge of the spectrum of the Orr-Sommerfeld equation is still required. Since the cylinder wake analysis proved very useful in addressing control considerations, the final objective was to provide a foundation upon which boundary layer control theory may be developed.

Hill, D. Christopher↗
NASA NTRS1989

Eigenvector derivatives of repeated eigenvalues using singular value decomposition

An explicit formula is obtained for the first-order eigenvector derivative that corresponds to the eigenvector of a repeated eigenvalue, in the case of the nonself-adjoint eigenvalue problem. This method applies to the class of nondefective problems whose first eigenvalue derivatives of the repeated eigenvalues are distinct. A singular-value decomposition approach is used to compute four requisite bases for eigenspaces, as well as to keep track of the dimensions of state variables and the conditioning of the state equations.

Lim, Kyong B.↗
NASA NTRS1977

A numerical scheme to solve unstable boundary value problems

The considered scheme makes it possible to determine an unstable steady state solution in cases in which, because of lack of symmetry, such a solution cannot be obtained analytically, and other time integration or relaxation schemes, because of instability, fail to converge. The iterative solution of a single complex equation is discussed and a nonlinear system of equations is considered. Described applications of the scheme are related to a steady state solution with shear instability, an unstable nonlinear Ekman boundary layer, and the steady state solution of a baroclinic atmosphere with asymmetric forcing. The scheme makes use of forward and backward time integrations of the original spatial differential operators and of an approximation of the adjoint operators. Only two computations of the time derivative per iteration are required.

Kalnay-Rivas, E.↗
DOE OSTI2020

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗
DOE OSTI2023

MrHyDE v.1.0

SAND2024-01324O MrHyDE, which stands for Multi-resolution Hybridized Differential Equations, is a general-purpose C++ package for the solution of coupled multiphysics and multiscale systems on massively parallel computing systems. MrHyDE is designed to enable moving beyond forward simulation for multiscale applications which includes optimization, control, uncertainty quantification, and stochastic inversion. The framework provides interfaces to several packages within the Trilinos framework and leverages automatic differentiation to enable adjoint capabilities for large-scale, gradient-based optimization. MrHyDE provides automated multiscale capabilities through a subgrid model interface and multiscale Dirichlet-to-Neumann maps. For extreme-scale applications, MrHyDE provides in situ data-compression algorithms to reduce memory requirements while maintaining performance. MrHyDE is a general-purpose, computational framework for the solution of multiscale and multiphysics applications. It uses a combination of structure-preserving, physics-compatible discretizations, fully implicit methods, multi-resolution schemes, or fully explicit methods. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗
DOE OSTI2022

Causal diamonds, cluster polytopes and scattering amplitudes

The “amplituhedron” for tree-level scattering amplitudes in the bi-adjoint φ 3 theory is given by the ABHY associahedron in kinematic space, which has been generalized to give a realization for all finite-type cluster algebra polytopes, labelled by Dynkin diagrams. In this letter we identify a simple physical origin for these polytopes, associated with an interesting (1 + 1)-dimensional causal structure in kinematic space, along with solutions to the wave equation in this kinematic “spacetime” with a natural positivity property. The notion of time evolution in this kinematic spacetime can be abstracted away to a certain “walk”, associated with any acyclic quiver, remarkably yielding a finite cluster polytope for the case of Dynkin quivers. The A n–3 , B n–1 /C n–1 and D n polytopes are the amplituhedra for n-point tree amplitudes, one-loop tadpole diagrams, and full integrand of one-loop amplitudes. We also introduce a polytope D¯ n , which chops the D n polytope in half along a symmetry plane, capturing one-loop amplitudes in a more efficient way.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

An autoencoder compression approach for accelerating large-scale inverse problems

Abstract Partial differential equation (PDE)-constrained inverse problems are some of the most challenging and computationally demanding problems in computational science today. Fine meshes required to accurately compute the PDE solution introduce an enormous number of parameters and require large-scale computing resources such as more processors and more memory to solve such systems in a reasonable time. For inverse problems constrained by time-dependent PDEs, the adjoint method often employed to compute gradients and higher order derivatives efficiently requires solving a time-reversed, so-called adjoint PDE that depends on the forward PDE solution at each timestep. This necessitates the storage of a high-dimensional forward solution vector at every timestep. Such a procedure quickly exhausts the available memory resources. Several approaches that trade additional computation for reduced memory footprint have been proposed to mitigate the memory bottleneck, including checkpointing and compression strategies. In this work, we propose a close-to-ideal scalable compression approach using autoencoders to eliminate the need for checkpointing and substantial memory storage, thereby reducing the time-to-solution and memory requirements. We compare our approach with checkpointing and an off-the-shelf compression approach on an earth-scale ill-posed seismic inverse problem. The results verify the expected close-to-ideal speedup for the gradient and Hessian-vector product using the proposed autoencoder compression approach. To highlight the usefulness of the proposed approach, we combine the autoencoder compression with the data-informed active subspace (DIAS) prior showing how the DIAS method can be affordably extended to large-scale problems without the need for checkpointing and large memory.

Mathematics↗
NASA NTRS1988

Helicopter trajectory planning using optimal control theory

A methodology for optimal trajectory planning, useful in the nap-of-the-earth guidance of helicopters, is presented. This approach uses an adjoint-control transformation along with a one-dimensional search scheme for generating the optimal trajectories. In addition to being useful for helicopter nap-of-the-earth guidance, the trajectory planning solution is of interest in several other contexts, such as robotic vehicle guidance and terrain-following guidance for cruise missiles and aircraft. A distinguishing feature of the present research is that the terrain constraint and the threat envelopes are incorporated in the equations of motion. Second-order necessary conditions are examined.

Menon, P. K. A.↗
DOE OSTI2022

Adjoint sensitivity analysis and data assimilation for verification of dry storage cask contents

Dry cask storage is a method for interim storage of spent fuel assemblies which contain fissile isotopes of uranium and plutonium. These can present a proliferation concern and consequently there is a need for non-destructive testing methods to verify a dry cask's contents for proliferation protection. We present an application of adjoint sensitivity analysis and data assimilation to a multigroup diffusion model of dry cask storage. Adjoint sensitivity analysis allows the efficient calculation of sensitivities for use in data assimilation to calibrate imprecisely known parameter values and data consistency tests to detect diversion scenarios. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRSDate not supplied

Cartesian Mesh Simulations for the Third AIAA Sonic Boom Prediction Workshop

Simulation results are presented for all cases from the Third AIAA Sonic Boom Prediction Workshop. An inviscid, embedded-boundary Cartesian-mesh flow solver is used in conjunction with adjoint-based mesh adaptation to compute nearfield pressure signatures. Specialized techniques are applied to maximize accuracy and minimize cost on Cartesian meshes. The Richardson-based error estimate highlights regions of the signatures most sensitive to mesh refinement. Timing results and coarse, medium, and fine mesh sizes for nearfield cases demonstrate that the parallel decomposition approach is efficient in both computational time and wall-clock. Pressure signals are propagated to the ground using an augmented Burgers’ equation solver to predict boom carpets. Ground signatures and loudness metrics are presented for a standard atmosphere as well as more realistic atmospheric profiles, which affect overall noise levels and can significantly widen the boom carpet. Mesh convergence studies show that high sampling frequencies, around 500 kHz, are required for propagation, and the sampling frequency increases at large off-track angles with longer acoustic ray paths and propagation times. The numerical methods yield accurate results for predicting low sonic boom signatures while being among the least computationally expensive of the workshop.

ARMD↗
DOE OSTI2022

Reduced-order modeling of neutron transport separated in energy by Minimax Proper Generalized Decomposition

In this article, we demonstrate a Petrov-Galerkin Proper Generalized Decomposition (PGD) known as Minimax PGD for modeling neutron transport separated in energy. To compare the Minimax with the classical Galerkin PGD, we assess both on a model problem of UO{sub 2} or Mixed Oxide (MOX) fuel pins in an infinite lattice with 3 industry-standard energy meshes. We find the Minimax PGD achieves a superior decomposition to Galerkin PGD, both with and without update of the energy modes. This suggests Minimax PGD may be more computationally efficient, provided this reduction in modes (to achieve a given accuracy) outweighs the cost of solving the necessary adjoint problems. In either case, we note that PGD offers an a priori Reduced-Order Model (ROM) which may be dramatically cheaper to solve than the full-order model, especially in problems with fine to ultrafine energy meshes. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Real-Time Bayesian Inference at Extreme Scale: A Digital Twin for Tsunami Early Warning Applied to the Cascadia Subduction Zone

We present a Bayesian inversion-based digital twin that employs acoustic pressure data from seafloor sensors, along with 3D coupled acoustic–gravity wave equations, to infer earthquake-induced spatiotemporal seafloor motion in real time and forecast tsunami propagation toward coastlines for early warning with quantified uncertainties. Our target is the Cascadia subduction zone, with one billion parameters. Computing the posterior mean alone would require 50 years on a 512 GPU machine. Instead, exploiting the shift invariance of the parameter-to-observable map and devising novel parallel algorithms, we induce a fast offline–online decomposition. The offline component requires just one adjoint wave propagation per sensor; using MFEM, we scale this part of the computation to the full El Capitan system (43,520 GPUs) with 92% weak parallel efficiency. Moreover, given real-time data, the online component exactly solves the Bayesian inverse and forecasting problems in 0.2 seconds on a modest GPU system, a ten-billion-fold speedup.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

On the Definition of the Prompt Neutron Lifetime

There are myriad definitions for the mean neutron lifetime, neutron generation time, and other related quantities to characterize a neutron and its progeny’s propagation through an assembly. In this document, we consider lifetime definitions that are associated with eigenvalue forms of the neutron transport equation. Specifically, we focus on the two most widely used eigenvalues: the $\kappa$ eigenvalue and the $\alpha$ eigenvalue. These eigenvalues are used more often than other eigenvalues due to the physical phenomenon they capture. The $\kappa$ eigenvalue allows for the ability to determine if the system can sustain a chain reaction, while the $\alpha$ eigenvalue captures the asymptotic time dependent behavior of the system. An advantage of using these eigenvalues resides in the biorthogonality of the solutions with their adjoint counterpart. This feature allows us to simplify the expressions and to obtain appropriately weighted definitions that highlight important physics and regions of an assembly.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Differentiable Multiphysics Codes: A Breakthrough Technology for Simulation and Computing

This document summarizes the findings of a strategic planning exercise commissioned by the Weapons Simulation and Computing, Computational Physics (WSC/CP) program at the Lawrence Livermore National Laboratory (LLNL) in FY24. During the year, the committee met with multiple stakeholder communities to gather input, opinions, suggestions and concerns which have been incorporated throughout this document. The key findings from this exercise are summarized: • The development of multiphysics modelling and simulation (mod/sim) codes and software technologies, their deployment on exascale compute platforms, and their broad adoption across the NNSA is a major success of the Advanced Simulation and Computing (ASC) program and the Exascale Computing Project (ECP). Sustained investment in these core technologies is essential. • Today’s state of the art involves running ensembles of O(100K) simulations to perform uncertainty quantification (UQ) and design studies using multiple statistical methods such as Bayesian optimization to understand sensitivities of our models and explore parameterized design spaces. Even with exascale computing, we are practically limited to O(10) parameters in these studies since the number of simulations required to sample the space scales exponentially with the number of design parameters. • The data from these simulation ensembles is increasingly being used to train machine learned (ML) surrogates (or reduced order models, ROMs) which can then be used for optimization or real time design exploration. However, the trained surrogates are still limited in the number of parameters they can represent due to the sampling limitations previously noted. • Augmenting our suite of integrated multiphysics simulation codes, both current and emerging, with the ability to compute gradients (solution derivatives) of arbitrary simulation outputs with respect to (some or all) simulation inputs would be a breakthrough technology, opening the door to a new era of efficient and automated inverse design based on verified and validated mod/sim capabilities. • This capability, which we refer to as differentiable multiphysics codes (DMCs), would revolutionize both UQ and optimization studies by breaking the curse of dimensionality that presently limits our “gradient-free” ensemble based computing approach. A similar breakthrough occurred in the AI/ML community once the ability to compute gradients of arbitrary loss functions using back-propagation became commonplace. Gradient information from the multiphysics codes can also be used to dramatically improve the efficiency and scale of training of ML/ROM surrogates for rapid assessments. • Achieving this in our suite of codes will be a grand challenge, similar to the amount of effort that was required to transition from CPU to GPU computing. It will require buy-in from the entire WSC/CP program and beyond, including all integrated codes, physics and engineering models, third-party library dependencies and performance portability abstractions. It will also require investment in research and development of numerical methods for computing adjoints of coupled physics across multiple adaptively refined moving meshes and of stochastic (Monte Carlo) and mesh free (SPH) methods. • New software and numerical techniques, largely pioneered by the AI/ML community, make this feasible. Chief among these is automatic differentiation (AD), the ability to employ AD at point-wise locations in a physics calculation (instead of traditional black-box approaches) and the ability to perform “back-propagation in time” (or reverse mode AD) for non-linear partial differential equations (PDEs). Fundamentally, the conclusion of this strategic planning exercise is that the time is right to undertake a large scale effort in WSC, centered on the existing integrated codes, to continue the natural evolution of mod/sim in the age of AI/ML. Instead of attempting to replace mod/sim with purely data driven AI/ML models, we believe the key to success is to integrate AI/ML by building on top of the decades of hard-won knowledge and the verified/validated multiphysics modelling capability that is the hallmark of the ASC program.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Statistical Treatment of Inverse Problems Constrained by Differential Equations-based Models with Stochastic Terms

This paper introduces a statistical treatment of inverse problems constrained by models with stochastic terms. The solution of the forward problem is given by a distribution represented numerically by an ensemble of simulations. The goal is to formulate the inverse problem, in particular the objective function, to find the closest forward distribution (i.e., the output of the stochastic forward problem) that best explains the distribution of the observations in a certain metric. We use proper scoring rules, a concept employed in statistical forecast verification, namely energy, variogram, and hybrid (i.e., combination of the two) scores. We study the performance of the proposed formulation in the context of two applications: a coefficient field inversion for subsurface flow governed by an elliptic partial differential equation with a stochastic source and a parameter inversion for power grid governed by differential-algebraic equations. In both cases we show that the variogram and the hybrid scores produce better parameter inversion results than does the energy score, whereas the energy score leads to better probabilistic predictions.

97 MATHEMATICS AND COMPUTING↗