Search NASA⌕ Search

SEARCH · Search NASA

Results for “adjoint method”

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 361 records · Page 20

A posteriori error analysis of fluid–structure interactions: Time dependent error

A posteriori error analysis is a technique to quantify the error in particular simulations of a numerical approximation method. In this article, we use such an approach to analyze how various error components propagate in certain moving boundary problems. We study quasi-steady state simulations where slowly moving boundaries remain in mechanical equilibrium with a surrounding fluid. Such problems can be numerically approximated with the Method of Regularized Stokelets (MRS), a popular method used for studying viscous fluid–structure interactions, especially in biological applications. Our approach to monitoring the regularization error of the MRS is novel, along with the derivation of linearized adjoint equations to the governing equations of the MRS with a elastic elements. Our main numerical results provide a clear illustration of how the error evolves over time in several MRS simulations.

97 MATHEMATICS AND COMPUTING↗

ADVANCED WAVEFORM SIMULATION FOR SEISMIC MONITORING EVENTS

High-Resolution Source Parameters using Calibration from Ambient Seismic Noise (ASN) Zhongwen Zhan, Shengji Wei, Sidao Ni, and Don V. Helmberger Abstract Several new methods have been developed to retrieve local Green's functions based on the cross-correlation of ambient seismic noise (station-to-station) and conventional (source-to-station) inversions. The latter methods provide the most broadband results but require accurate source parameters for phase-delay recovery which depends on the starting model. Considerable progress is being made in providing such information from 3D modeling, Tape et al. (2008), using Adjoint Tomography. But to match waveforms for the recent Chino Hills event still requires shifting synthetics to align on data. This means that it is difficult to use 3D simulations to refine source locations in near-real time. We can avoid the 3D problems by applying the CAP method and storing shifts from past events, Tan (2006), and/or using ASN, Shapiro et al. (2005), to predict lags for surface waves. Here, we directly compare results from CAP predictions with ASN results using stations near the Chino Hills event. We use the same SC seismic model as used in the Library of Earthquakes to generate Green's functions for noise (single force) for comparison with ASN correlations and allow Cap delays. We apply these delays or corrections to determine precise Centroid locations.

58 GEOSCIENCES↗

A Weighted Least-Squares Transport Equation Compatible with Source Iteration and Voids

We present that second-order forms of the transport equation allow the use of continuous finite elements (CFEMs). This can be desired in multiphysics calculations where other physics require CFEM discretizations. Second-order transport operators are generally self-adjoint, yielding symmetric positive-definite (SPD) matrices, which allow the use of efficient linear algebra solvers with an enormous advantage in memory usage. Least-squares (LS) forms of the transport equation can circumvent the void problems of other second-order forms but are almost always nonconservative. Additionally, the standard LS form is not compatible with discrete ordinates method (SN) iterative solution techniques such as source iteration. A new form of the LS transport equation has recently been developed that is compatible with voids and standard SN iterative solution techniques. Performing nonlinear diffusion acceleration (NDA) using an independently differenced low-order equation enforces conservation for the whole system and makes this equation suitable for reactor physics calculations. In this context, “independent” means that both the transport and low-order solutions converge to the same scalar flux and current as the spatial mesh is refined, but for a given mesh, the solutions are not necessarily equal. In this paper we show that introducing a weight function into this LS equation improves issues with causality and can render our equation equal to the self-adjoint angular flux (SAAF) equation. Causality is a principle of the transport equation that states that information travels only downstream along characteristics. This principle can be violated numerically. We show how to limit the weight function in voids and demonstrate the effect of this limit on accuracy. Using the C5G7 benchmark, we compare our method to the SAAF formulation with a void treatment (SAAFτ) that is not self-adjoint and has a nonsymmetric coefficient matrix. Finallyl, we show that the weighted LS equation with NDA gives acceptable accuracy relative to the SAAFτ equation while maintaining a SPD system matrix.

97 MATHEMATICS AND COMPUTING↗

Support Operators Method for the Diffusion Equation in Multiple Materials

A second-order finite difference scheme for the solution of the diffusion equation on non-uniform meshes is implemented. The method allows the heat conductivity to be discontinuous. The algorithm is formulated on a one dimensional mesh and is derived using the support operators method. A key component of the derivation is that the discrete analog of the flux operator is constructed to be the negative adjoint of the discrete divergence, in an inner product that is a discrete analog of the continuum inner product. The resultant discrete operators in the fully discretized diffusion equation are symmetric and positive definite. The algorithm is generalized to operate on meshes with cells which have mixed material properties. A mechanism to recover intermediate temperature values in mixed cells using a limited linear reconstruction is introduced. The implementation of the algorithm is verified and the linear reconstruction mechanism is compared to previous results for obtaining new material temperatures.

97 MATHEMATICS AND COMPUTING↗

On quantum integrability of the Landau-Lifshitz model

We investigate the quantum integrability of the Landau-Lifshitz (LL) model and solve the long-standing problem of finding the local quantum Hamiltonian for the arbitrary n-particle sector. The particular difficulty of the LL model quantization, which arises due to the ill-defined operator product, is dealt with by simultaneously regularizing the operator product and constructing the self-adjoint extensions of a very particular structure. The diagonalizibility difficulties of the Hamiltonian of the LL model, due to the highly singular nature of the quantum-mechanical Hamiltonian, are also resolved in our method for the arbitrary n-particle sector. We explicitly demonstrate the consistency of our construction with the quantum inverse scattering method due to Sklyanin [Lett. Math. Phys. 15, 357 (1988)] and give a prescription to systematically construct the general solution, which explains and generalizes the puzzling results of Sklyanin for the particular two-particle sector case. Moreover, we demonstrate the S-matrix factorization and show that it is a consequence of the discontinuity conditions on the functions involved in the construction of the self-adjoint extensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New construction of the magnetohydrodynamic spectrum of stationary plasma flows. I. Solution path and alternator

A new method of systematically constructing the full structure of the complex magnetohydrodynamic spectra of stationary flows is presented. It is based on the self-adjointness of the generalized force operator G and the Doppler-Coriolis shift operator U, and the associated quadratic forms for the normalized energy W and the normalized Doppler-Coriolis shift V, which may be constructed for all complex values of omega if the original eigenvalue problem is converted into a one-sided boundary value problem. This turns W into a complex expression, while V remains real. Whereas the solution path P{sub s} of stable modes is just the real axis, the solution path P{sub u} of unstable modes in the complex omega plane is found by requiring that the solution-averaged Doppler-Coriolis shifted real part of the frequency vanishes, sigma-V[xi(omega)]=0, or that the energy is real, Im W[xi(omega)]=0. The location of the eigenvalues on these solution paths is determined by two quadratic forms, which may straightforwardly be evaluated in any of the finite element spectral codes in existence. A new oscillation theorem is proved about the monotonicity of complex eigenvalues for one-dimensional systems. Instead of counting internal nodes of the real displacement vector xi (as in static plasmas), it is based on counting the zeros of the alternating ratio, or alternator, Rident toxi/PI of the boundary values of the complex functions xi and the total pressure perturbation PI, which is real on the solution path. This finally provides the generalization of the basic structural properties of the magnetohydrodynamic spectrum of static plasmas, which has been known for a long time, to stationary plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Gradient-Informed Design Optimization of Select Nuclear Systems

In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.

97 MATHEMATICS AND COMPUTING↗

Adiabatic continuity and confinement in supersymmetric Yang-Mills theory on the lattice

This work is a step towards merging the ideas that arise from semi-classical methods in continuum QFT with analytic/numerical lattice field theory. In this context, we consider Yang-Mills theories coupled to fermions transforming in the adjoint representation of the gauge group. These theories have the remarkable property that confinement and discrete chiral symmetry breaking can persist at weak coupling on R 3 × S 1 up to small (non-thermal) compactification radii. This work presents a lattice investigation of a gauge theory coupled to a single adjoint Majorana fermion, the N=1 Supersymmetric Yang-Mills theory (SYM), and opens the prospect to understand analytically a number of non-perturbative phenomena, such as confinement, mass gap, chiral and center symmetry realizations, both on the lattice and in the continuum. We study the compactification of N=1 SYM on the lattice with periodic and thermal boundary conditions applied to the fermion field. We provide numerical evidences for the conjectured absence of phase transitions with periodic boundary conditions for sufficiently light lattice fermions (stability of center-symmetry), for the suppression of the chiral transition, and we provide also a diagnostic for Abelian vs. non-Abelian confinement, based on per-site Polyakov loop eigenvalue distribution functions. We identify the role of the lattice artefacts that become relevant in the very small radius regime, and we resolve some puzzles in the naive comparison between continuum and lattice.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Direct computation of magnetic surfaces in Boozer coordinates and coil optimization for quasisymmetry

We propose a new method to compute magnetic surfaces that are parametrized in Boozer coordinates for vacuum magnetic fields. We also propose a measure for quasisymmetry on the computed surfaces and use it to design coils that generate a magnetic field that is quasisymmetric on those surfaces. The rotational transform of the field and complexity measures for the coils are also controlled in the design problem. Using an adjoint approach, we are able to obtain analytic derivatives for this optimization problem, yielding an efficient gradient-based algorithm. Starting from an initial coil set that presents nested magnetic surfaces for a large fraction of the volume, our method converges rapidly to coil systems generating fields with excellent quasisymmetry and low particle losses. In particular for low complexity coils, we are able to significantly improve the performance compared with coils obtained from the standard two-stage approach, e.g. reduce losses of fusion-produced alpha particles born at half-radius from $17.7\,\%$ to $6.6\,\%$ . We also demonstrate 16-coil configurations with alpha loss ${<}1\,\%$ and neoclassical transport magnitude $\epsilon _{\text {eff}}^{3/2}$ less than approximately $5\times 10^{-9}$ .

Physics↗

Second-order adjoint sensitivity analysis methodology (2ND-ASAM) for computing exactly and efficiently first- and second-order sensitivities in large-scale systems - 14356

This work presents the second-order adjoint sensitivity analysis methodology (2.-ASAM) for computing exactly and efficiently the second-order functional derivatives ('sensitivities') of system responses to the system's model parameters. For a physical system comprising N{sub α} parameters and N{sub r} responses, forward methods require a total of at least (N{sup 2}{sub α}/2+3N{sub α}/2) large-scale computations for obtaining all of the first- and second-order sensitivities, for all N{sub r} system responses. On the other hand, for one functional-type system response, the 2.-ASAM requires one large-scale computation using the first-level adjoint sensitivity system (1.-LASS) for obtaining all of the first-order sensitivities, followed by at most (2N{sub α}+1) large-scale computations using the second-level adjoint sensitivity systems (2.-LASS) for obtaining all of the second-order sensitivities. The second-order sensitivities contribute decisively to causing asymmetries in the response distribution, since they are the leading contributors to the third-order response correlations (skewness). They also cause the 'expected value of the response' to differ from the 'computed nominal value of the response'. The implementation of the 2.-ASAM requires very little additional effort beyond the construction of the adjoint sensitivity system needed for computing the first-order sensitivities. Only the sources on the right-sides of the diffusion (differential) operator needed to be modified; the left-side of the differential equations (and hence the 'solver' in large-scale practical applications) remain unchanged. The application of the 2.-ASAM is illustrated on a benchmark heat conduction/convection problem, which makes transparent the underlying mathematical derivations. For this illustrative problem, 4 'large-scale' adjoint computations suffice for computing exactly all of the 6 first- and 21 distinct second-order derivatives. The 2.-ASAM presented in this work should enable the hitherto very difficult, if not intractable, exact computation of all of the second-order response sensitivities for large-systems involving many parameters, which is expected to affect significantly other fields that need efficiently computed second-order response sensitivities, such as optimization, data assimilation/adjustment, model calibration, and predictive modeling. (author)

42 ENGINEERING↗

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed, and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modelled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi [12], and by Pazy and Rabinowitz [14].

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method

Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility of the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.

97 MATHEMATICS AND COMPUTING↗

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗

Efficient, automated Monte Carlo methods for radiation transport

Monte Carlo simulations provide an indispensible model for solving radiative transport problems, but their slow convergence inhibits their use as an everyday computational tool. In this paper, we present two new ideas for accelerating the convergence of Monte Carlo algorithms based upon an efficient algorithm that couples simulations of forward and adjoint transport equations. Forward random walks are first processed in stages, each using a fixed sample size, and information from stage k is used to alter the sampling and weighting procedure in stage k+1. This produces rapid geometric convergence and accounts for dramatic gains in the efficiency of the forward computation. In case still greater accuracy is required in the forward solution, information from an adjoint simulation can be added to extend the geometric learning of the forward solution. The resulting new approach should find widespread use when fast, accurate simulations of the transport equation are needed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

LA17-V-InverseRadTransportProblem-PD2Kb. Final Project Report

In the inverse radiation transport problem, a radiation signal emanating from an unknown object is used to reconstruct geometric and material parameters of the object , e.g., the mass of special nuclear material (SNM), the isotopic composition of the SNM (e.g., the enrichment of 235U), the thickness of shielding, etc. The inverse radiation transport problem is one of the most fundamental and important in the emergency response mission, and has been addressed in previous NA-22 and NA-42/84 investments by using derivative-free optimization methods. Our project was aimed at (i) consolidating previous work by applying polynomial chaos expansion (PCE) for reducing significantly the number of forward model simulations required by derivative-free optimization methods; (ii) developing a general-purpose framework and stand-alone software for solving the inverse radiation transport problem by applying a new “predictive modeling” methodology (predictive modeling of coupled multi-physics systems, PM_CMPS) which enables the fusing of experimental and computational information; and (iii) developing several benchmarks (for unscattered gamma rays) for demonstrating the quantification of non-Gaussian features (e.g., skewness and kurtosis, which characterize asymmetries and long tails) of response distributions by deterministically and efficiently propagating parameter uncertainties (covariances and higher-order moments, where available) using high-order sensitivities computed by the recently developed comprehensive adjoint sensitivity analysis methodology (C-ASAM). With regard to (i), application of PCE, the most significant accomplishment of this project was an implementation of PCE into INVERSE that significantly reduced computation time for the DiffeRential Evolution Adaptive Metropolis (DREAM) and Differential Evolution (DE) methods. For inverse transport problems with measurements of neutron leakage, neutron multiplication, and neutron-induced gamma-rays, the solution times for the DREAM and DE methods were reduced by factors of 30-300, reducing run times from hours to minutes while maintaining the same accuracy as the standard (non-PCE) DREAM and DE. Speedups were further improved by exploring sparse grid quadrature sets using the Toolkit for Adaptive Stochastic Modeling and Non-Intrusive ApproximatioN (Tasmanian) toolset. An initial exploration of sparse grids indicated that further speedups factors of 5-10 are obtainable. The implementation of PCE in INVERSE is not in a form that users can easily access. With regard to (ii), solving the inverse problem using a predictive modeling paradigm, the most significant accomplishment of this project were the derivation and implementation of adjoint-based second derivatives in neutron and photon transport theory. There are two codes that compute these derivatives. SENSPG computes them for uncollided gamma rays and SENSMG computes them for neutron leakage. SENSMG is open-source code available on github. Other significant accomplishments included a stand-alone code, MULTI-PRED, that implements the predictive modeling paradigm, along with a detailed manual. The code was implemented in the existing INVERSE code for inverse problems, but a head-to-head comparison of inverse methods was not achieved. We also derived and implemented the capability to compute sensitivities for multiplicity measurements into the SENSMG code, and this capability was used in a data assimilation application, but it was not used for solving inverse problems. With regard to (iii), developing benchmarks to demonstrate the importance of high-order sensitivity and uncertainty analysis, the most significant accomplishment of this project were two test problems that showed how important second-order sensitivities are.

07 ISOTOPE AND RADIATION SOURCES↗

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↗