Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic differentiation”

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 703 records · Page 39

A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers

We consider the problem of estimating parameters in large-scale weakly nonlinear inverse problems for which the underlying governing equations is a linear, time-dependent, parabolic partial differential equation. A major challenge in solving these inverse problems using Newton-type methods is the computational cost associated with solving the forward problem and with repeated construction of the Jacobian, which represents the sensitivity of the measurements to the unknown parameters. Forming the Jacobian can be prohibitively expensive because it requires repeated solutions of the forward and adjoint time-dependent parabolic partial differential equations corresponding to multiple sources and receivers. We propose an efficient method based on a Laplace transform-based exponential time integrator combined with a flexible Krylov subspace approach to solve the resulting shifted systems of equations efficiently. Our proposed solver speeds up the computation of the forward and adjoint problems, thus yielding significant speedup in total inversion time. We consider an application from Transient Hydraulic Tomography (THT), which is an imaging technique to estimate hydraulic parameters related to the subsurface from pressure measurements obtained by a series of pumping tests. The algorithms discussed are applied to a synthetic example taken from THT to demonstrate the resulting computational gains of this proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimisation of dynamic reactive power sources using mesh adaptive direct search

Dynamic reactive power sources can be used to effectively mitigate the fault-induced delayed voltage recovery and transient voltage instability issues. When many var sources need to be installed at planned locations, optimisation of their sizes is a complicated non-linear optimisation problem due to its non-convexity and the dependence of the constraint on time-series trajectories of post-fault voltages. Solving this optimal sizing problem needs to utilise both a non-linear optimisation solver and a power system differential-algebraic equation solver. This study proposes a new approach for solving this problem under both a single contingency and multiple contingencies by using the mesh adaptive direct search algorithm interfaced with a power system simulator. The proposed approach is validated by case studies on a North American Eastern Interconnection model to optimise the sizes of planned STATCOMs against critical contingencies.

Huang, Weihong↗

A backward Monte-Carlo method for time-dependent runaway electron simulations

Kinetic descriptions of runaway electrons (REs) are usually based on Fokker-Planck models that determine the probability distribution function of REs in 2-dimensional momentum space. Despite the simplification involved, the Fokker-Planck equation can rarely be solved analytically and direct numerical approaches [e.g., continuum and particle-based Monte Carlo (MC)] can be time consuming, especially in the computation of asymptotic-type observables including the runaway probability, the slowing-down and runaway mean times, and the energy limit probability. In this study, we present a novel backward MC approach to these problems based on backward stochastic differential equations that describe the dynamics of the runaway probability by means of the Feynman-Kac theory. The key ingredient of the backward MC algorithm is to place all the particles in a runaway state and simulate them backward from the terminal time to the initial time. As such, our approach can provide much faster convergence than direct MC methods (by significantly reducing the number of particles required to achieve a prescribed accuracy) while at the same time maintaining the advantages of particle-based methods (compared to continuum approaches). The proposed algorithm is unconditionally stable and can be parallelized as easy as the direct MC method, and its extension to dimensions higher than two is straightforward, thus paving the way for conducting large-scale RE simulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Modeling and Algorithmic Approaches to Constitutively-Complex, Microstructured Fluids

We present a new multiscale model for complex fluids based on three scales: microscopic, kinetic, and continuum. We choose the microscopic level as Kramers' bead-rod model for polymers, which we describe as a system of stochastic differential equations with an implicit constraint formulation. The associated Fokker-Planck equation is then derived, and adiabatic elimination removes the fast momentum coordinates. Approached in this way, the kinetic level reduces to a dispersive drift equation. The continuum level is modeled with a finite volume Godunov-projection algorithm. We demonstrate computation of viscoelastic stress divergence using this multiscale approach.

36 MATERIALS SCIENCE↗

Holistic Portfolio Optimization using Directed Mutations

Genetic algorithms provide attractive options for performing nonlinear multi-objective combinatorial design optimization, and they have proven very useful for optimizing individual systems. However, conventional genetic algorithms fall short when performing holistic portfolio optimizations in which the decision variables also include the integer counts of multiple system types over multiple time periods. When objective functions are formulated as analytic functions, we can formally differentiate with respect to system counts and use the resulting gradient information to generate favorable mutations in the count variables. We apply several variations on this basic idea to an idealized hanging chain example to obtain >> 1000x speedups over conventional genetic algorithms in both single - and multi-objective cases. We develop a more complex example of a notional military portfolio that includes combinatorial design variables and dependency constraints between the design choices. In this case, our initial results are mixed, but many variations are still open to further research.

97 MATHEMATICS AND COMPUTING↗

Extracting and Interpreting Electrochemical Impedance Spectra (EIS) from Physics-Based Models of Lithium-Ion Batteries

This paper implements a highly efficient algorithm to extract electrochemical impedance spectra (EIS) from physics-based battery models (e.g., a P2D model). The mathematical approach is different from how EIS is practiced experimentally. Experimentally, the voltage (current) is harmonically perturbed over a wide range of frequencies and the amplitude and phase shift of the corresponding current (voltage) is measured. The experimental approach can be implemented in simulation software, but is computationally expensive. The approach here is to determine locally linear state-space models from the full physical model. The four Jacobian matrices that are the basis of the state-space models can be derived by numerical differentiation of the physical model. The EIS is then extracted from the state-space model using computationally efficient matrix-manipulation techniques. The algorithm can evaluate the full EIS at an instant in time during a transient, independent of whether the battery is in a stationary state. The approach is also able to separate the full-cell impedance to evaluate partial EIS, such as for a battery anode alone. Although such partial EIS is difficult to measure experimentally, the partial EIS provides valuable insights in interpreting the full-cell EIS.

25 ENERGY STORAGE↗

Sparsified time-dependent Fourier neural operators for fusion simulations

This paper presents a sparsified Fourier neural operator for coupled time-dependent partial differential equations (ST-FNO) as an efficient machine learning surrogate for fluid and particle-based fusion codes such as NIMROD (Non-Ideal Magnetohydrodynamics with Rotation - Open Discussion) and GTC (Gyrokinetic Toroidal Code). ST-FNO leverages the structures in the governing equations and utilizes neural operators to represent Green's function-like numerical operators in the corresponding numerical solvers. Once trained, ST-FNO can rapidly and accurately predict dynamics in fusion devices compared with first-principle numerical algorithms. In general, ST-FNO represents an efficient and accurate machine learning surrogate for numerical simulators for multi-variable nonlinear time-dependent partial differential equations, with the proposed architectures and loss functions. The efficacy of ST-FNO has been demonstrated using quiescent H-mode simulation data from NIMROD and kink-mode simulation data from GTC. The ST-FNO H-mode results show orders of magnitude reduction in memory and central processing unit usage in comparison with the numerical solvers in NIMROD when computing fields over a selected poloidal plane. The ST-FNO kink-mode results achieve a factor of 2 reduction in the number of parameters compared to baseline FNO models without accuracy loss.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Anonymization of Network Traces Data through Condensation-based Differential Privacy

Network traces are considered a primary source of information to researchers, who use them to investigate research problems such as identifying user behavior, analyzing network hierarchy, maintaining network security, classifying packet flows, and much more. However, most organizations are reluctant to share their data with a third party or the public due to privacy concerns. Therefore, data anonymization prior to sharing becomes a convenient solution to both organizations and researchers. Although several anonymization algorithms are available, few of them allow sufficient privacy (organization need), acceptable data utility (researcher need), and efficient data analysis at the same time. This article introduces a condensation-based differential privacy anonymization approach that achieves an improved tradeoff between privacy and utility compared to existing techniques and produces anonymized network trace data that can be shared publicly without lowering its utility value. Our solution also does not incur extra computation overhead for the data analyzer. A prototype system has been implemented, and experiments have shown that the proposed approach preserves privacy and allows data analysis without revealing the original data even when injection attacks are launched against it. When anonymized datasets are given as input to graph-based intrusion detection techniques, they yield almost identical intrusion detection rates as the original datasets with only a negligible impact.

97 MATHEMATICS AND COMPUTING↗

An Elegant Sufficiency: Load-Aware Differentiated Scheduling of Data Transfers

We investigate the file transfer scheduling problem, where transfers among different endpoints must be scheduled to maximize pertinent metrics. We propose two new algorithms that exploit the fact that the aggregate bandwidth obtained over a network or at a storage system tends to increase with the number of concurrent transfers—but only up to a certain limit. The first algorithm, SEAL, uses runtime information and data-driven models to approximate system load and adapt transfer schedules and concurrency so as to maximize performance while avoiding saturation. We implement this algorithm using GridFTP as the transfer protocol and evaluate it using real transfer logs in a production WAN environment. Results show that SEAL can improve average slowdowns and turnaround times by up to 25% and worst-case slowdown and turnaround times by up to 50%, compared with the best-performing baseline scheme. Our second algorithm, STEAL, further leverages user-supplied categorization of transfers as either “interactive” (requiring immediate processing) or “batch” (less time-critical). Results show that STEAL reduces the average slowdown of interactive transfers by 63% compared to the best-performing baseline and by 21% compared to SEAL. For batch transfers, compared to the best-performing baseline, STEAL improves by 18% the utilization of the bandwidth unused by interactive transfers. By elegantly ensuring a sufficient, but not excessive, allocation of concurrency to the right transfers, we significantly improve overall performance despite constraints.

Kettimuthu, Rajkumar↗

A DOUBLE-RING ALGORITHM FOR MODELING SOLAR ACTIVE REGIONS: UNIFYING KINEMATIC DYNAMO MODELS AND SURFACE FLUX-TRANSPORT SIMULATIONS

The emergence of tilted bipolar active regions (ARs) and the dispersal of their flux, mediated via processes such as diffusion, differential rotation, and meridional circulation, is believed to be responsible for the reversal of the Sun's polar field. This process (commonly known as the Babcock-Leighton mechanism) is usually modeled as a near-surface, spatially distributed {alpha}-effect in kinematic mean-field dynamo models. However, this formulation leads to a relationship between polar field strength and meridional flow speed which is opposite to that suggested by physical insight and predicted by surface flux-transport simulations. With this in mind, we present an improved double-ring algorithm for modeling the Babcock-Leighton mechanism based on AR eruption, within the framework of an axisymmetric dynamo model. Using surface flux-transport simulations, we first show that an axisymmetric formulation-which is usually invoked in kinematic dynamo models-can reasonably approximate the surface flux dynamics. Finally, we demonstrate that our treatment of the Babcock-Leighton mechanism through double-ring eruption leads to an inverse relationship between polar field strength and meridional flow speed as expected, reconciling the discrepancy between surface flux-transport simulations and kinematic dynamo models.

79 ASTRONOMY AND ASTROPHYSICS↗

Measurement of groomed jet substructure observables in p+p collisions at $\sqrt{s} =$ 200 GeV with STAR

In this letter, measurements of the shared momentum fraction ( z g ) and the groomed jet radius ( R g ), as defined in the SoftDrop algorithm, are reported in p+p collisions at s = 200 GeV collected by the STAR experiment. These substructure observables are differentially measured for jets of varying resolution parameters from R = 0.2 – 0.6 in the transverse momentum range 15 < p T , jet < 60 GeV/ c . These studies show that, in the p T , jet range accessible at s = 200 GeV and with increasing jet resolution parameter and jet transverse momentum, the z g distribution asymptotically converges to the DGLAP splitting kernel for a quark radiating a gluon. The groomed jet radius measurements reflect a momentum-dependent narrowing of the jet structure for jets of a given resolution parameter, i.e., the larger the p T , jet , the narrower the first splitting. For the first time, these fully corrected measurements are compared to Monte Carlo generators with leading order QCD matrix elements and leading log in the parton shower, and to state-of-the-art theoretical calculations at next-to-leading-log accuracy. We observe that PYTHIA 6 with parameters tuned to reproduce RHIC measurements is able to quantitatively describe data, whereas PYTHIA 8 and HERWIG 7, tuned to reproduce LHC data, are unable to provide a simultaneous description of both z g and R g , resulting in opportunities for fine parameter tuning of these models for p+p collisions at RHIC energies. We also find that the theoretical calculations without non-perturbative corrections are able to qualitatively describe the trend in data for jets of large resolution parameters at high p T , jet , but fail at small jet resolution parameters and low jet transverse momenta.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum mechanical generalized phase-shift approach to atom-surface scattering: A Feshbach projection approach to dealing with closed channel effects

We have developed a new method for solving quantum dynamical scattering problems, using the time-independent Schroedinger equation (TISE), based on a novel method to generalize a ''one-way'' quantum mechanical wave equation, impose correct boundary conditions, and eliminate exponentially growing closed channel solutions. The approach is readily parallelized to achieve approximate N{sup 2} scaling, where N is the number of coupled equations. The full two-way nature of the TISE is included while propagating the wave function in the scattering variable and the full S-matrix is obtained. The new algorithm is based on a ''Modified Cayley'' operator splitting approach, generalizing earlier work where the method was applied to the time-dependent Schroedinger equation. All scattering variable propagation approaches to solving the TISE involve solving a Helmholtz-type equation, and for more than one degree of freedom, these are notoriously ill-behaved, due to the unavoidable presence of exponentially growing contributions to the numerical solution. Traditionally, the method used to eliminate exponential growth has posed a major obstacle to the full parallelization of such propagation algorithms. We stabilize by using the Feshbach projection operator technique to remove all the nonphysical exponentially growing closed channels, while retaining all of the propagating open channel components, as well as exponentially decaying closed channel components.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Geometry optimization speedup through a geodesic approach to internal coordinates

We present a new geodesic-based method for geometry optimization in a basis set of redundant internal coordinates. Overall, our method updates the molecular geometry by following the geodesic generated by a displacement vector on the internal coordinate manifold, which dramatically reduces the number of steps required to converge to a minimum. Our method can be implemented in any existing optimization code, requiring only implementation of derivatives of the Wilson B-matrix and the ability to numerically solve an ordinary differential equation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exponential Time Differencing Schemes for Fuel Depletion and Transport in Molten Salt Reactors: Theory and Implementation

A numerical framework for modeling depletion and mass transport in liquid-fueled molten salt reactions is presented based on exponential time differencing. The solution method involves using the finite volume method to transform the system of partial differential equations (PDEs) into a much larger system of ordinary differential equations. The key part of this method involves solving for the exponential of a matrix. We explore six different algorithms to compute the exponential in a series of progression problems that explore physical transport phenomena in molten salt reactors. This framework shows good results for solving linear parabolic PDEs with each of the six matrix exponential algorithms. For large problems, the series solvers such as Padé and Taylor have large run times, which can be mitigated by using the Krylov subspace.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Combined magnetic and kinetic control of advanced tokamak steady state scenarios based on semi-empirical modelling

Our paper shows that semi-empirical data-driven models based on a two-time-scale approximation for the magnetic and kinetic control of advanced tokamak (AT) scenarios can be advantageously identified from simulated rather than real data, and used for control design. The method is applied to the combined control of the safety factor profile, q(x), and normalized pressure parameter, beta(N), using DIII-D parameters and actuators (on-axis co-current neutral beam injection (NBI) power, off-axis co-current NBI power, electron cyclotron current drive power, and ohmic coil). The approximate plasma response model was identified from simulated open-loop data obtained using a rapidly converging plasma transport code, METIS, which includes an MHD equilibrium and current diffusion solver, and combines plasma transport nonlinearity with 0D scaling laws and 1.5D ordinary differential equations. The paper discusses the results of closed-loop METIS simulations, using the near-optimal ARTAEMIS control algorithm (MoreauDet al 2013 Nucl. Fusion 53 063020) for steady stateAT operation. With feedforward plus feedback control, the steady state target q-profile and beta(N) are satisfactorily tracked with a time scale of about 10 s, despite large disturbances applied to the feedforward powers and plasma parameters. We also show the robustness of the control algorithm with respect to disturbances of the H&CD actuators and of plasma parameters such as the H-factor, plasma density and effective charge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantitative phase retrieval and characterization of magnetic nanostructures via Lorentz (scanning) transmission electron microscopy

Magnetic materials phase reconstruction using Lorentz transmission electron microscopy (LTEM) measurements have traditionally been achieved using longstanding methods such as off-axis holography (OAH) fast-Fourier transform technique and the transport-of-intensity equation (TIE). The increase in access to processing power alongside the development of advanced algorithms have allowed for phase retrieval of nanoscale magnetic materials with greater efficacy and resolution. Specifically, reverse-mode automatic differentiation (RMAD) and the extended electron ptychography iterative engine (ePIE) are two recent developments of phase retrieval that can be applied to analyzing micro-to-nano- scale magnetic materials. This work evaluates phase retrieval using TIE, RMAD, and ePIE in simulations of Permalloy (Ni 80 Fe 20 ) nanoscale islands, or nanomagnets. Extending beyond simulations, we demonstrate total phase retrieval and image reconstructions of a NiFe nanowire using OAH and RMAD in LTEM and ePIE in Lorentz-mode-4D scanning transmission electron microscopy experiments and determine the saturation magnetization through corroborations with micromagnetic modeling. Finally, we demonstrate the efficacy of these methods in retrieving the total phase and highlight its use in characterizing and analyzing the proximity effect of the magnetic nanostructures.

Lorentz transmission electron microscopy↗

Measurement of inclusive jet and dijet production in p p collisions at s = 7 TeV using the ATLAS detector

CERN-LHC. Measurements of the inclusive jet and di-jet cross sections in proton-proton collisions at a centre-of-mass energy of 7 TeV. The analysis is based on the 2010 data sample with a total integrated luminosity of 37 pb^{-1}. The anti-KT algorithm is used for jet clustering with data given using both the parameters R=0.4 and R=0.6. Double-differential cross sections are given as a function of the inclusive jet PT in rapidity (y) bins and of the di-jet invariant mass in bins of half of the rapidity separation of the two jets (y*). Details of the systematic errors and their correlations are given in the link below. In the tables the first (sys) error is the correlated (in PT) systematic error and the second is the uncorrelated systematic error, both produced by combining the relevant errors in quadrature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum Computing Strategy 2026

Quantum computing (QC) is a rapidly maturing technology with the potential for revolutionary impacts on stockpile stewardship science and national security. Recent developments in fault-tolerant architectures have compressed vendor roadmaps, and predictions of a production-ready quantum computer by the mid-2030s are becoming increasingly credible. This strategy provides a roadmap for integrating QC into the Advanced Simulation and Computing (ASC) program by investing in four strategic focus areas: 1. Develop Capabilities in Mission-Relevant Quantum Applications: ASC will prioritize developing quantum-ready applications in mission areas that have shown significant promise for quantum advantage, including simulations of materials in extreme environments, nuclear dynamics, solving linear and nonlinear partial differential equations, and uncertainty quantification. These applications directly support stockpile stewardship science and modernization objectives. 2. Conduct R&D in Algorithms, Software, and Hardware: Sustained research into quantum algorithms, robust software tools, and quantum hardware is essential. ASC will develop efficient quantum algorithms; invest in quantum compilers, debuggers, and performance tools; and explore specialized quantum hardware tailored to NNSA’s unique requirements. 3. Engage with Vendors and Partners: Early and active collaboration with commercial quantum hardware vendors and academic partners is critical. Through testbeds, co-design agreements, and quantum demonstration facilities, ASC will influence hardware design, gain early access to emerging technologies, and ensure that quantum platforms evolve to meet mission needs. 4. Build Knowledge, Experience, and Workforce: Expanding and upskilling the quantum-trained workforce is essential to long-term success. This includes hiring, internal training, university outreach, and postdoctoral support to ensure ASC maintains the expertise required to operate, program, and integrate quantum systems as they become available. While quantum computing will never replace classical computing, it has the potential to solve certain problems with speed and accuracy that would be unachievable using any conceivable classical high-performance computing (HPC) system. By investing strategically in QC, ASC will help propel the emergent QC industry, maintain U.S. technological leadership, ensure mission readiness, and position itself to rapidly adopt quantum technologies as they mature.

97 MATHEMATICS AND COMPUTING↗