Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear approximation”

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 307 records · Page 17

Liquid Structure of Iron and Iron–Nitrogen–Carbon Alloys Within the Cores of Small Terrestrial Bodies

Abstract Nitrogen has been proposed to be stored within planetary cores, but its effects on the structure and density of molten Fe–alloys have not been explored experimentally. Using energy‐dispersive X‐ray diffraction, we determined the structure of Fe–N(–C) liquids at core conditions (1–7 GPa and 1700–1900°C) within a Paris‐Edinburgh press. Variation of N up to 7 wt.% and C up to 1.5 wt.% results in near‐linear changes in Fe–Fe atom distances and structure factor with increasing light element content. We did not observe a significant pressure‐driven structural transition in Fe–N(–C) liquids. We model the expansion of the Fe–Fe bonds using a modified Birch‐Murnaghan equation of state. With this model, we demonstrate that N or C contamination could lead to an overestimation of the Fe–Fe distances of pure Fe. We observe that the incorporation of 1 wt.% N or C into Fe results in a change in Fe–Fe distances that is twice as significant as the effect of 1 GPa. By approximating the change in volume, we infer that N and C incorporated in liquid iron could contribute to the density deficit observed in the cores of terrestrial bodies.

Pease, Allison [Department of Earth and Environmen↗

Global stellarator coil optimization with quadratic constraints and objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvements in conditioning, regularization, sparsity, and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10$ 2 x faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL’s effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Implementation of the Glued Sphere Discrete Element Model for Non-Spherical Particles in MFiX Software

To enhance solver capabilities, simulation flexibility and model validation within the MFiX software, the U.S. Department of Energy (DOE) is funding efforts to develop and integrate the glued-sphere discrete element method into the latest version of MFiX as a dedicated computational module. The glued-sphere discrete element method is a numerical technique to depict the behavior of non-spherical particles in granular flows or particulate systems by representing them as a collection of component spheres. These spheres are bonded together to approximate the shape and mechanical/chemical properties of a more complex particle. The method effectively reuses the existing sphere-sphere collision algorithm, interphase momentum and heat transfer calculations utilized in the traditional discrete element method, extending these capabilities to non-spherical particles. Additionally, this method explicitly resolves intra-particle temperature and species distributions. The MFiX glued-sphere computational module includes tools for generating glued sphere configurations, a dedicated solver, and visualization capabilities in post-processing. More specifically within the computational module, collision detection and calculations were first performed on component spheres and then mapped onto non-spherical particles. The linear spring-dashpot model was utilized to simulate the sphere-sphere interactions.

Ke, Renjie↗

Decomposing a renewable energy design and dispatch model

We address a mixed-integer linear programming model which selects a cost-minimizing set of available technologies with which to design a renewable energy system and prescribe their associated dispatch decisions. Realistically sized instances of such models pose computational challenges. To this end, we develop a Lagrangian heuristic based on a decomposition methodology which partitions the model into blocks and optimizes these more manageable, smaller subproblems. It also provides a lower bound to assess solution quality. In conclusion, we apply this methodology to the National Renewable Energy Laboratory's Renewable Energy Integration and Optimization (REopt TM ) model to generate near-optimal solutions to realistic instances containing, on average, approximately 300,000 variables and at least as many constraints, with a mean 30% optimality gap improvement using a five-minute solution time limit, compared to directly solving the original monolith.

97 MATHEMATICS AND COMPUTING↗

Chapter 7: Learning Stable Local Volt/Var Controllers in Distribution Grids

This chapter describes a framework to synthesize provably stable local Volt/Var controllers for distributed energy resources (DERs) in power distribution grids (DGs). The goal is to control the reactive power injections of DERs to improve the system performance as quantified by a generic optimal reactive power flow (ORPF) problem. To achieve this, we jointly design for each DER the control function, which prescribes the reactive power update rule, and the equilibrium function, which approximates the ORPF solutions from local measurements of voltages and powers. We provide conditions on the equilibrium functions and the control parameters ensuring the stability of the closed-loop system. In particular, we discuss the trade-offs between each set of conditions accounting for practical considerations, like fully exploiting the DERs' generation capabilities and reducing the optimality gap. These conditions are then translated into learning constraints on the neural networks' parameters that are enforced in the training phase. We validate our framework with numerical simulations on the IEEE 37-bus network and through a comparison with an optimized version of standard piece wise linear control rules.

closed-loop asymptotic stability↗

Stabilizing homogeneous CaMn6Sn6via oscillatory crystal growth: structural complexity in a kagome metal

CaMn6Sn6 is a member of the large family of Mn-based kagome metals derived by filling voids of the prototypical CoSn structure. We observed Ca-deficiency and structural complexity, with approximately 10% deficiency of calcium relative to the ideal 166 stoichiometry. These features are common in related Ca-based materials. We find that growth conditions stabilize different phases with varying Curie temperatures. Diffraction and magnetization measurements reveal that conventional growth profiles yield inhomogeneity both within and between crystals in a given batch, whereas an oscillatory temperature profile promotes homogeneous crystals that adopt a superstructure beyond the parent hexagonal structure type. We present the physical properties of crystals grown using the oscillatory approach. The crystals are highly conductive, with a c-axis residual resistivity ratio ρ(300 K)/ρ(2 K) exceeding 100 and a positive, linear magnetoresistance at base temperature. Magnetically, the crystals are quite similar to MgMn6Sn6, with easy-plane ferromagnetic behavior and a Curie temperature of TC ≈ 237 K. These results highlight the critical role of growth conditions in stabilizing homogeneous crystals of complex phases such as Ca0.9Mn6Sn6. The oscillatory growth approach provides an effective route for accessing the intrinsic properties of this complex material and may be broadly useful for the growth of related kagome systems.

May, Andrew [ORNL] (ORCID:0000000307778539)↗

A practical control strategy for demand flexibility with ensured occupant comfort in grid-interactive efficient buildings

This study proposes a practical and simplified demand response (DR) control strategy from the perspective of grid-interactive efficient buildings (GEBs), aiming to secure demand flexibility while ensuring occupant thermal comfort. Focusing on summer on-peak periods, a linear demand response (LDR) strategy that integrates cooling setpoint adjustment and lighting dimming was designed, and its performance was quantitatively evaluated. A case study was conducted using EnergyPlus-based simulations for a U.S. DOE small office prototype building under summer on-peak weather conditions. Compared with a conventional rapid demand response (RDR) strategy, the proposed LDR approach gradually reduced electrical loads while maintaining occupant thermal comfort indices, including predicted mean vote (PMV) and predicted percentage of dissatisfied (PPD), within acceptable comfort ranges. Quantitative analysis of demand flexibility using the grid-interactive impact index (GII) and the flexibility strength index (FSI) showed that the LDR strategy provided approximately 12.5% demand flexibility during DR periods and achieved an electricity cost reduction of about 8.8%. In addition, the results of the part-load ratio (PLR)-based cooling system performance analysis showed that, in the on-peak period, the LDR strategy exhibited improved cooling performance compared with the baseline. Overall, this study shows the potential of a practical DR control strategy that can simultaneously achieve occupant comfort and demand flexibility without relying on complex advanced control technologies.

Jung, Dong Eun↗

High‐speed 4‐dimensional scanning transmission electron microscopy using compressive sensing techniques

Abstract Here we show that compressive sensing allows 4‐dimensional (4‐D) STEM data to be obtained and accurately reconstructed with both high‐speed and reduced electron fluence. The methodology needed to achieve these results compared to conventional 4‐D approaches requires only that a random subset of probe locations is acquired from the typical regular scanning grid, which immediately generates both higher speed and the lower fluence experimentally. We also consider downsampling of the detector, showing that oversampling is inherent within convergent beam electron diffraction (CBED) patterns and that detector downsampling does not reduce precision but allows faster experimental data acquisition. Analysis of an experimental atomic resolution yttrium silicide dataset shows that it is possible to recover over 25 dB peak signal‐to‐noise ratio in the recovered phase using 0.3% of the total data. Lay abstract : Four‐dimensional scanning transmission electron microscopy (4‐D STEM) is a powerful technique for characterizing complex nanoscale structures. In this method, a convergent beam electron diffraction pattern (CBED) is acquired at each probe location during the scan of the sample. This means that a 2‐dimensional signal is acquired at each 2‐D probe location, equating to a 4‐D dataset. Despite the recent development of fast direct electron detectors, some capable of 100kHz frame rates, the limiting factor for 4‐D STEM is acquisition times in the majority of cases, where cameras will typically operate on the order of 2kHz. This means that a raster scan containing 256^2 probe locations can take on the order of 30s, approximately 100‐1000 times longer than a conventional STEM imaging technique using monolithic radial detectors. As a result, 4‐D STEM acquisitions can be subject to adverse effects such as drift, beam damage, and sample contamination. Recent advances in computational imaging techniques for STEM have allowed for faster acquisition speeds by way of acquiring only a random subset of probe locations from the field of view. By doing this, the acquisition time is significantly reduced, in some cases by a factor of 10‐100 times. The acquired data is then processed to fill‐in or inpaint the missing data, taking advantage of the inherently low‐complex signals which can be linearly combined to recover the information. In this work, similar methods are demonstrated for the acquisition of 4‐D STEM data, where only a random subset of CBED patterns are acquired over the raster scan. We simulate the compressive sensing acquisition method for 4‐D STEM and present our findings for a variety of analysis techniques such as ptychography and differential phase contrast. Our results show that acquisition times can be significantly reduced on the order of 100‐300 times, therefore improving existing frame rates, as well as further reducing the electron fluence beyond just using a faster camera.

Robinson, Alex W.↗

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗

Learning linear optical circuits with coherent states

We analyze the energy and training data requirements for supervised learning of an M-mode linear optical circuit by minimizing an empirical risk defined solely from the action of the circuit on coherent states. When the linear optical circuit acts non-trivially only on k < M unknown modes (i.e. a linear optical k-junta), we provide an energy-efficient, adaptive algorithm that identifies the junta set and learns the circuit. We compare two schemes for allocating a total energy, E, to the learning algorithm. In the first scheme, each of the T random training coherent states has energy E/T. In the second scheme, a single random MT-mode coherent state with energy E is partitioned into T training coherent states. The latter scheme exhibits a polynomial advantage in training data size sufficient for convergence of the empirical risk to the full risk due to concentration of measure on the $(2MT-1)$-sphere. Specifically, generalization bounds for both schemes are proven, which indicate that for ε-approximation of the full risk by the empirical risk with high probability, $O(E^{2/3}M^{2/3}/\epsilon^{2/3})$ training states are sufficient for the first scheme and $O(E^{1/3}M^{1/3}/\epsilon^{2/3})$ training states are sufficient for the second scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Vibrational Energy Harvesting Sensor Based on Linear and Rotational Electromechanical Effects

In this investigation, a magnetically coupled double-spring design is presented for harvesting low-level non-stationary random vibrational energy. The sensor relies on multimodal coupling between the translation and rotation of a two-spring magnet and coil system to widen the harvesting bandwidth. Energy methods are used to develop a model to characterize the electromechanical response of the system, the solution of which is obtained using stochastic techniques based on a particle swarm algorithm. This approach provides an efficient method to estimate system parameters that otherwise are difficult or impossible to determine with independent measurements. The experimental results demonstrate agreement with the theoretical predictions over a limited bandwidth. The sensor can effectively harvest non-stationary vibration energy down to 10 -4 g within a limited bandwidth of 130–150 Hz. The sensor prototype has an operational volume of 2.6 cm 3 with a calculated power density of 0.2 W/cm 3 . The sensor’s small size results in a coupling efficiency of approximately 6% across the tested bandwidth.

42 ENGINEERING↗

A reduced-order model for nonlinear radiative transfer problems based on moment equations and POD-Petrov-Galerkin projection of the normalized Boltzmann transport equation

A data-driven projection-based reduced-order model (ROM) for nonlinear thermal radiative transfer (TRT) problems is presented. The TRT ROM is formulated by (i) a hierarchy of low-order quasidiffusion (aka variable Eddington factor) equations for moments of the radiation intensity and (ii) the normalized Boltzmann transport equation (BTE). The multilevel system of moment equations is derived by projection of the BTE onto a sequence of subspaces which represent elements of the phase space of the problem. Exact closure for the moment equations is provided by the Eddington tensor. A Petrov-Galerkin (PG) projection of the normalized BTE is formulated using a proper orthogonal decomposition (POD) basis representing the normalized radiation intensity over the whole phase space and time. The Eddington tensor linearly depends on the solution of the normalized BTE. By linear superposition of the POD basis functions, a low-rank expansion of the Eddington tensor is constructed with coefficients defined by the PG projected normalized BTE. The material energy balance (MEB) equation is coupled with the effective gray low-order equations which exist on the same dimensional scale as the MEB equation. The resulting TRT ROM is structure and asymptotic preserving. A detailed analysis of the ROM is performed on the classical Fleck-Cummings (F-C) TRT multigroup test problem in 2D geometry. Numerical results are presented to demonstrate the ROM's effectiveness in the simulation of radiation wave phenomena. Importantly, the ROM is shown to produce solutions with sufficiently high accuracy while using low-rank approximation of the normalized BTE solution. Essential physical characteristics of supersonic radiation wave are preserved in the ROM solutions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Simultaneous enhancement of tritium burn efficiency and fusion power with low-tritium spin-polarized fuel

This study demonstrates that using spin-polarized deuterium-tritium (D-T) fuel with more deuterium than tritium can increase tritium burn efficiency (TBE) by at least an order of magnitude without compromising fusion power output, compared to unpolarized fuel. Although previous studies show that a low tritium fraction can enhance TBE, this strategy resulted in reduced fusion power density. The surprising improvement in TBE at fixed power reported here is due to the TBE increasing nonlinearly with decreasing tritium fraction but the fusion power density increasing roughly linearly with D-T cross section. A study is performed for an ARC-like tokamak producing 481 MW of fusion power with unpolarized 53:47 D-T fuel, finding the minimum startup tritium inventory (I startup,min ) is 0.69 kg. By spin-polarizing half of the fuel and using a 60:40 D-T mix, I startup,min is reduced to 0.08 kg, and fully spin-polarizing the fuel with a 63:37 D-T mix further reduces I startup,min to 0.03 kg. Some ARC-like scenarios are predicted to achieve plasma ignition with relatively modest spin polarization. These findings indicate that, with advancements in helium divertor pumping efficiency, TBE values of approximately 10%–40% could be achieved using low-tritium-fraction and spin-polarized fuel with minimal power loss. This would dramatically lower tritium startup inventory requirements and reduce the amount of on-site tritium. More generally than just for spin-polarized fuels, increased plasma performance can be used to increase TBE. This strongly motivates the development of spin-polarized fuels and low-tritium-fraction operation for burning plasmas.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Inertial collapse of a gas bubble in a shear flow near a rigid wall

Despite the extensive research on bubble collapse near rigid walls, the bubble collapse dynamics in the presence of shear flow near a rigid wall is poorly understood. We conduct direct simulations of the Navier–Stokes equations to explore the bubble dynamics and pressures during bubble collapse near a rigid, flat wall under linear shear flow conditions. We examine the dependence of the bubble collapse morphology and wall pressures on the initial bubble location and shear rate. We find that shear distorts the bubble, generating two re-entrant jets – one developing from the side opposite to the mean flow and the other from the far end toward the wall. Upon impact of the jet on the opposite side of the bubble, water-hammer shocks are produced, which propagate outward and interact with the convoluted bubble shape. The shock stretches the bubble towards the wall, resulting in a closer impact location for the jet originating from the far end compared with the case with no shear flow. The water-hammer pressure location can be approximated as the theoretical distance travelled by a particle initialised at the bubble centre with the corresponding constant shear flow velocity. The maximum wall pressures can thus be predicted by considering the distance between the far jet impingement location and the wall along the wall-normal direction. As the shear rate is increased, the maximum wall pressure increases, although only marginally. We determine the critical initial stand-off distance from the wall at which the bubble morphology is shear dominated, i.e. characterised by converging re-entrant jets.

Bhola, Sahil (ORCID:0000000236766302)↗

A Low-Rank QTT-based Finite Element Method for Elasticity Problems

We present an efficient and robust numerical algorithm for solving the linear elasticity problem that combines the Quantized Tensor Train format and a domain partitioning strategy. This approach makes it possible to solve the linear elasticity problem on a computational domain that is more general than a square. By integrating Z-ordering and subdomain concatenation, our method substantially decreases memory usage and achieves a notable reduction in rank compared to established Finite Element implementations like the FEniCS platform. This efficiency is maintained while still guaranteeing exponential convergence with respect to the number of degrees of freedom. This performance gain, however, requires a fundamental rethinking of how core finite element operations are implemented. This includes changes to mesh discretization, node and degree of freedom ordering, stiffness matrix and internal nodal force assembly, and the execution of algebraic matrix-vector operations. In this work, we discuss all these aspects in detail and assess the method’s performance in the numerical approximation of three representative test cases.

97 MATHEMATICS AND COMPUTING↗

Score-based deterministic density sampling

We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density π given only its score ∇ log π. Our method approximates the Wasserstein gradient flow on KL($f_t$∥π) by learning the time-varying score ∇ log $f_t$ on the fly using score matching. While having the same marginal distribution as Langevin dynamics, our method produces smooth deterministic trajectories, resulting in monotone noise-free convergence. We prove that our method dissipates relative entropy at the same rate as the exact gradient flow, provided sufficient training. Numerical experiments validate our theoretical findings: our method converges at the optimal rate, has smooth trajectories, and is often more sample efficient than its stochastic counterpart. Experiments on high-dimensional image data show that our method produces high-quality generations in as few as 15 steps and exhibits natural exploratory behavior. The memory and runtime scale linearly in the sample size.

97 MATHEMATICS AND COMPUTING↗

Compensating slice emittance growth in high brightness photoinjectors using sacrificial charge

Achieving maximum electron beam brightness in photoinjectors requires detailed control of the 3D bunch shape and precise tuning of the beam focusing. Even in state-of-the-art designs, slice emittance growth due to nonlinear space charge forces and partial nonlaminarity often remains non-negligible. In this work, we introduce a new means to linearize the transverse slice phase space: a sacrificial portion of the bunch’s own charge distribution, formed into a wavebroken shock front by highly nonlinear space charge forces within the gun, whose downstream purpose is to dynamically linearize the desired bunch core. We show that linearization of an appropriately prepared bunch can be achieved via strongly nonlaminar focusing of the sacrificial shock front, while the inner core focuses laminarly. This leads to a natural spatial separation of the two distributions: a dense core surrounded by a diffuse halo of sacrificial charge that can be collimated. Multiobjective genetic algorithm optimizations of the ultracompact x-ray free electron laser injector employ this concept, and we interpret it with an analytic model that agrees well with the simulations. In simulation, we demonstrate a final bunch charge of 100 pC, peak current ∼ 30 A, and a sacrificial charge of 150 pC (250 pC total emitted from cathode) with normalized emittance growth of < 20 nm rad due to space charge. This implies a maximum achievable brightness approximately an order of magnitude greater than existing free electron laser injector designs. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗