SEARCH · Search NASA

Results for “CONNECT”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21

All sources NASA NTRS DOE OSTI

DOE OSTI2025

An approach to urban waterway assessment using holistic values and reciprocity

Current aquatic ecosystem assessment methods and tools often focus on physical, chemical, and biological indicators of ecosystem health. This approach to ecosystem assessment is not always straightforward to execute in urban environments and ignores potential connectivity between social and environmental outcomes. During a workshop at the Symposium on Urbanization and Stream Ecology in Brisbane, Australia in 2023 (SUSE6), we developed an approach to urban aquatic ecosystem assessment that incorporates a holistic perspective. Specifically, our approach considers both environmental (biological, chemical, and physical integrity) and social (community connection, human safety, resource use) values of urban waterways. This approach is inclusive of Indigenous perspectives, such as the concept of reciprocity, whereby consideration of both the environment and society leads to a healthy ecosystem. Here, to highlight how this holistic assessment approach could be used, we present real-world examples that included assessing both environmental and societal values informed by reciprocity or balanced perspectives. This approach can be broadly applied and adapted to specific aquatic ecosystem conditions and projects, providing an inclusive, community-centered approach for assessing the health of waterways in urban environments.

Indigenous knowledge↗

DOE OSTI2024

Low-cost sensor-based damage localization for large-area monitoring of FRP composites

Abstract In recent years, there has been growing interest in self-sensing structural materials across research and industry sectors. Detecting and locating structural damage typically requires numerous sensors wired to a data acquisition (DAQ) circuit, rendering implementation impractical in real structures. This paper proposes an innovative, cost-effective sensor network for damage detection and localization in fiber-reinforced polymer composites. The innovation encompasses three key elements: (1) utilizing carbon fiber tows within the composite as piezoresistive sensors, eliminating the need for additional foreign sensor devices; (2) introducing a novel sensor layout wherein sensor tow branches with varied resistance values are connected in parallel, reducing the number of connections to the DAQ circuit and cutting manufacturing costs significantly; (3) developing a practical sensor terminal fabrication technique to minimize manufacturing expenses. The proposed design methodology for the branch resistance values is first validated using a demonstration panel. Subsequently, the overall strategy is assessed by conducting impact tests on carbon and glass fiber-reinforced composite specimens. Results validate the sensor’s ability to accurately detect and locate structural damage.

Demo, Luke B. (ORCID:0000000208806522)↗

DOE OSTI2025

Mitigation of ICRF—edge plasma interaction in Alcator C-Mod

The parasitic interaction between ion cyclotron range of frequencies (ICRF) waves and the edge plasma has long limited high-power ICRF utilization in magnetically confined fusion plasmas. In this paper, we report on the successful mitigation of this interaction by power tapering a four-strap field-aligned (FA) antenna in the Alcator C-Mod tokamak. With the antenna operated in dipole phasing ($0\pi0\pi$), the ratio of the power coupled by the central two straps ($P_\mathrm {cent}$) to the power coupled by the outer two straps was varied at fixed total coupled ICRF power ($P_\mathrm {tot}$). With $P_\mathrm {cent}$/$P_\mathrm {tot} \approx 0.8-0.9$, no enhancement of the plasma potential was measured despite 1 MW of coupled ICRF power. When the antenna is powered, energy deposition increases on its four corners and on neighboring limiter tiles magnetically connected to some of those corners. The energy deposited on the antenna and limiter is minimized together with near-field plasma potentials. Additionally, we show that deviation from $P_\mathrm {cent}$/$P_\mathrm {tot} \approx 0.8$ enhances wave-plasma interactions in places not magnetically connected to the antenna. These far-field effects are correlated with changes in the antenna spectrum. Hence, on C-Mod, near-field and far-field interactions were minimized for about the same range of $P_\mathrm {cent}$/$P_\mathrm {tot}$. Optimal power tapering was also found to improve ICRF heating efficiency and facilitate H-mode access. Finally, we show that the heat flux pattern on the toroidally aligned antennas reverses with the direction of the RF-induced E×B flow in front of the antenna, a correlation not observed for the FA antenna. We argue that the RF-induced E×B flow, which carries high-density plasma from the near-SOL, is aligned with the FA antenna and does not intercept its corners, where the plasma potential is large. This could explain the previously reported smaller impurity generation by the FA antenna (Wukitch et al 2013 Phys. Plasmas 20 056117).

Alcator C-Mod↗

DOE OSTI2024

Integration of a new Cryogenic Liquefier into the IB-1 Cryogenic Test Facility

The increase over the last years of the testing activities related to quantum systems, SRF cavities for the PIP-II and the LCLS-II projects, as well as superconducting magnets for the HL-LHC project and Fusion research activities, has required the addition of a new Helium cryogenic plant into the existing IB-1 Industrial Cryogenic Test Facility. The new cryogenic plant is composed of a cryogenic liquefier (Cold Box) able to provide up to 340 L/h, a 4 kL Dewar and two Mycom ® compressors providing up to 120 g/s. AL-AT (Air Liquide Advanced Technologies) has taken part of this project by designing and manufacturing the cryogenic liquefier. This new cryogenic plant is connected through a cryogenic distribution system to a 10 kL Dewar, which is part of the existing cryogenic test facility, itself composed of another Cold Box and a Sullair ® compressor. The new cryogenic plant has two main operating modes: one allows to transfer liquid helium at 1.7 bar between the two Dewars, the other allows to transfer supercritical Helium at 2 bar or more between the new Cold Box and the 10 kL Dewar. The entire industrial cryogenic facility is handled by a common Inventory Control System, composed of three control valves, and 9 tanks giving a total buffer volume of more than 1000 m3. This paper presents the technical features of the new Helium cryogenic plant, as well as the main results of the liquefier commissioning phase and details of the helium transfer between the two Dewars, making the connection between the cryogenic plants at the IB-1 Industrial Cryogenic Test Facility.

43 PARTICLE ACCELERATORS↗

DOE OSTI2024

Enhancing quantum annealing accuracy through replication-based error mitigation *

Abstract Quantum annealers like those manufactured by D-Wave Systems are designed to find high quality solutions to optimization problems that are typically hard for classical computers. They utilize quantum effects like tunneling to evolve toward low-energy states representing solutions to optimization problems. However, their analog nature and limited control functionalities present challenges to correcting or mitigating hardware errors. As quantum computing advances towards applications, effective error suppression is an important research goal. We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing (QA). In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware. This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is well-suited for currently available noisy intermediate-scale quantum annealers. Our experimental analysis shows that RBM provides solution quality on par with previous methods while being more flexible and compatible with a wider range of hardware connectivity patterns. In comparisons against standard QA without error mitigation on larger problem instances that could not be handled by previous methods, RBM consistently gets better energies and ground state probabilities across parameterized problem sets.

Djidjev, Hristo N. (ORCID:0000000192868824)↗

DOE OSTI2025

Exploring the energy landscape of RBMs: reciprocal space insights into bosons, hierarchical learning and symmetry breaking

Deep generative models have become ubiquitous due to their ability to learn and sample from complex distributions. Despite the proliferation of various frameworks, the relationships among these models remain largely unexplored, a gap that hinders the development of a unified theory of AI learning. In this work, we address two central challenges: clarifying the connections between different deep generative models and deepening our understanding of their learning mechanisms. We focus on Restricted Boltzmann Machines (RBMs), a class of generative models known for their universal approximation capabilities for discrete distributions. By introducing a reciprocal space formulation for RBMs, we reveal a connection between these models, diffusion processes, and systems of coupled bosons. Our analysis shows that at initialization, the RBM operates at a saddle point, where the local curvature is determined by the singular values of the weight matrix, whose distribution follows the Marc̆enko-Pastur law and exhibits rotational symmetry. During training, this rotational symmetry is broken due to hierarchical learning, where different degrees of freedom progressively capture features at multiple levels of abstraction. This leads to a symmetry breaking in the energy landscape, reminiscent of Landau’s theory. This symmetry breaking in the energy landscape is characterized by the singular values and the weight matrix eigenvector matrix. We derive the corresponding free energy in a mean-field approximation. We show that in the limit of infinite size RBM, the reciprocal variables are Gaussian distributed. Our findings indicate that in this regime, there will be some modes for which the diffusion process will not converge to the Boltzmann distribution. To illustrate our results, we trained replicas of RBMs with different hidden layer sizes using the MNIST dataset. Our findings not only bridge the gap between disparate generative frameworks but also shed light on the fundamental processes underpinning learning in deep generative models.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Leveraging dendritic complexity for neuromorphic computing

Abstract Beyond-von Neumann computing approaches are necessary to sustain the growth of microelectronics and the increasing appetite for artificial intelligence/machine learning algorithms. Neuromorphic computing is an emerging paradigm that takes inspiration from the brain to provide a path forward to improve the computational efficiency and computational density of next-generation computing architectures. In nature, we observe brains performing complex computations with a much smaller energy footprint than conventional computing approaches. Current neuromorphic systems are focused primarily on scalability, namely, increasing the number of computational units (neurons) and connections between units (synapses). However, for brain-like cognition and efficiency in next-generation computing hardware, we need increased complexity in function, as well as improved connection density for scalability. Here, we present our work that aims to incorporate dendrites for ‘compute-on-wire’ in neuromorphic architectures to increase the computational complexity (e.g. number of programmable parameters, nonlinear dynamics) as well as computational efficiency (energy/compute) of artificial neural networks (ANNs). We do this by showcasing neuromorphic dendrite elements that can be leveraged for various applications. We will present examples of neuroscience-inspired direction-selective circuits and an ANN with active dendrites leveraging shunting inhibition. We also demonstrate the benefits of using dendrites in deep neural networks. To conclude, we discuss how we can utilize emerging hardware devices in these systems and design next-generation neuromorphic architectures with dendrites.

Cardwell, Suma G. (ORCID:0000000226575545)↗

DOE OSTI2024

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

DOE OSTI2024

SUNBIRD : a simulation-based model for full-shape density-split clustering

Combining galaxy clustering information from regions of different environmental densities can help break cosmological parameter degeneracies and access non-Gaussian information from the density field that is not readily captured by the standard two-point correlation function (2PCF) analyses. However, modelling these density-dependent statistics down to the non-linear regime has so far remained challenging. We present a simulation-based model that is able to capture the cosmological dependence of the full shape of the density-split clustering (DSC) statistics down to intra-halo scales. Our models are based on neural-network emulators that are trained on high-fidelity mock galaxy catalogues within an extended-ΛCDM framework, incorporating the effects of redshift-space, Alcock–Paczynski distortions, and models of the halo–galaxy connection. Our models reach sub-percent level accuracy down to $1 \, h^{-1}\text{Mpc}$ and are robust against different choices of galaxy–halo connection modelling. When combined with the galaxy 2PCF, DSC can tighten the constraints on ω cdm , σ 8 , and n s by factors of 2.9, 1.9, and 2.1, respectively, compared to a 2PCF-only analysis. DSC additionally puts strong constraints on environment-based assembly bias parameters.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

The beyond-halo mass effects of the cosmic web environment on galaxies

ABSTRACT Galaxy properties primarily depend on their host halo mass. Halo mass, in turn, depends on the cosmic web environment. We explore if the effect of the cosmic web on galaxy properties is entirely transitive via host halo mass, or if the cosmic web has an effect independent of mass. The secondary galaxy bias, sometimes referred to as ‘galaxy assembly bias’, is the beyond-mass component of the galaxy–halo connection. We investigate the link between the cosmic web environment and the secondary galaxy bias in simulations. We measure the secondary galaxy bias through the following summary statistics: projected two-point correlation function, $w_{\mathrm{p}}(r_{\mathrm{p}})$, and counts-in-cylinders statistics, $P(N_{\mathrm{CIC}})$. First, we examine the extent to which the secondary galaxy bias can be accounted for with a measure of the environment as a secondary halo property. We find that the total secondary galaxy bias preferentially places galaxies in more strongly clustered haloes. In particular, haloes at fixed mass tend to host more galaxies when they are more strongly associated with nodes or filaments. This tendency accounts for a significant portion, but not the entirety, of the total secondary galaxy bias effect. Secondly, we quantify how the secondary galaxy bias behaves differently depending on the host halo proximity to nodes and filaments. We find that the total secondary galaxy bias is relatively stronger in haloes more associated with nodes or filaments. We emphasize the importance of removing halo mass effects when considering the cosmic web environment as a factor in the galaxy–halo connection.

Astronomy & Astrophysics↗

DOE OSTI2025

Galaxy-multiplet clustering from DESI DR2

We present an efficient estimator for higher-order galaxy clustering using small groups of nearby galaxies, or multiplets. Using the Luminous Red Galaxy (LRG) sample from the Dark Energy Spectroscopic Instrument (DESI) Data Release 2, we identify galaxy multiplets as discrete objects and measure their cross-correlations with the general galaxy field. Our results show that the multiplets exhibit stronger clustering bias as they trace more massive dark matter halos than individual galaxies. When comparing the observed clustering statistics with the mock catalogs generated from the N-body simulation AbacusSummit, we find that the mocks underpredict multiplet clustering despite reproducing the galaxy two-point auto-correlation reasonably well. This discrepancy indicates that the standard Halo Occupation Distribution (HOD) model is insufficient to describe the properties of galaxy multiplets, revealing the greater constraining power of this higher-order statistic on galaxy-halo connection and the possibility that multiplets are specific to additional assembly bias. We demonstrate that incorporating secondary biases into the HOD model improves agreement with the observed multiplet statistics, specifically by allowing galaxies to preferentially occupy halos in denser environments. Our results highlight the potential of utilizing multiplet clustering, beyond traditional two-point correlation measurements, to break degeneracies in models describing the galaxy-dark matter connection.

cosmology↗

DOE OSTI2025

Neutrino heating in 1D, 2D, and 3D core-collapse supernovae: characterizing the explosion of high-compactness stars

Massive stars can end their lives with a successful supernova explosion (leaving behind a neutron star or, more rarely, a black hole), or a failed explosion that leaves behind a black hole. The density structure of the pre-collapse progenitor star already encodes much of the information regarding the outcome and properties of the explosion. However, the complexity of the collapse and subsequent shock expansion phases prevents drawing a straightforward connection between the pre-collapse and post-explosion properties. In order to derive such a connection several explodability studies have been performed in recent years. However, different studies can predict different explosion outcomes. In this article, we show how compactness, which is related to the average density of the star’s core, has an important role in determining the efficiency of neutrino heating, and therefore the outcome of the explosion. Commonly, high-compactness progenitors are assumed to yield failed explosions, due to their large mass accretion rates, preventing the shock from expanding. We show by analysing ~150 2D flash and F ornax simulations and 20 3D F ornax simulations that this is not the case. Instead, due to the rapid increase of neutrino heating with compactness, high-compactness progenitors lead to successful shock revival. We also show that 1D+ simulations that include v-driven convection using a mixing-length theory approach correctly reproduce this trend. Finally, we compare 1D+ models, which we show can reproduce some aspects of multi-D simulations with reasonable accuracy, with other widely used 1D models in the literature.

neutrinos↗

DOE OSTI2025

Noise-aware circuit compilations for a continuously parameterized two-qubit gateset

State-of-the-art noisy-intermediate-scale quantum processors are currently implemented across a variety of hardware platforms, each with their own distinct gatesets. As such, circuit compilation should not only be aware of but also deeply connect to the native gateset and noise properties of each. Trapped-ion processors are one such platform that provides a gateset that can be continuously parameterized across both one- and two-qubit gates. Here we use the Quantum Scientific Computing Open User Testbed to study noise-aware compilations focused on continuously parameterized two-qubit 𝑍⁢𝑍 gates (based on the Mølmer-Sørensen interaction) using $\scriptsize{SUPERSTAQ}$, a quantum software platform for hardware-aware circuit compiler optimizations. We discuss the realization of 𝑍⁢𝑍 gates with arbitrary angle on the all-to-all connected trapped-ion system. Then we discuss a variety of different compiler optimizations that innately target these 𝑍⁢𝑍 gates and their noise properties. These optimizations include moving from a restricted maximally entangling gateset to a continuously parameterized one, swap mirroring to further reduce the total entangling angle of the operations, focusing the heaviest 𝑍⁢𝑍 angle participation on the best-performing gate pairs, and circuit approximation to remove the least impactful 𝑍⁢𝑍 gates. We demonstrate these compilation approaches on the hardware with randomized quantum volume circuits, observing the potential to realize a larger quantum volume as a result of these optimizations. Using differing yet complementary analysis techniques, we observe the distinct improvements in system performance provided by these noise-aware compilations and study the role of stochastic and coherent error channels for each compilation choice.

Noise↗

DOE OSTI2026

Continuous Family of Conformal Field Theories and Exactly Marginal Operators

Does a conformal manifold imply the existence of exactly marginal operators? We answer this question affirmatively under the assumption that there exists a conformal interface with certain properties connecting nearby conformal field theories. We show that the exactly marginal operator that connects the conformal field theories can be reconstructed from the interface displacement operator. Our construction is model independent and based on the general principles of conformal symmetry.

conformal field theory↗

DOE OSTI2026

IR side of bounds on theories with spontaneously broken Lorentz symmetry

In nature, some UV features of dynamics are reflected in IR quantities. In fully relativistic theories, this connection can be probed through the analyticity properties of scattering amplitudes, allowing one to understand which IR theories respect the UV assumptions of quantum field theory. The ensuing analyticity bounds can usually be rephrased as the absence of faster-than-light propagation for low-energy excitations. While it is interesting to understand these relations and their IR characterization for theories that have less idealized properties, it is also more difficult to derive analyticity bounds in these cases. For theories that spontaneously break Lorentz symmetry, recent progress was made by considering correlators of conserved currents and their analyticity properties. In this work, we focus on such theories and work to close the gap from the IR side, finding a natural way to express the known analyticity bounds purely in terms of low-energy kinematical quantities. Our analysis shows that the bounds require gapped excitations to have a slower speed than the gapless ones, at least for momenta that are low with respect to the mass gap. These results suggest a way to interpret the UV/IR connection in more complex theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

Braiding for the win: Harnessing braiding statistics in topological states to play quantum games

Nonlocal quantum games provide proof of principle that quantum resources can confer an advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent paper [O. Hart et al., Phys. Rev. Lett. 134, 130602 (2025)], we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this paper we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Additionally, by connecting the win probability to twist products, we show that success at the game serves as a many-body entanglement witness. Namely, if the players implement a perfect quantum strategy on large length scales, the quantum state they share cannot be connected to a trivial product state via a constant-depth local unitary circuit. Lastly, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.

Fractons↗

DOE OSTI2024

0D, 1D, 2D, and 3D simulations of an idealized coaxial impedance-matched Marx generator

We have conducted 0D, 1D, 2D, and 3D simulations of an idealized coaxial impedance-matched Marx generator (IMG) []. The 0D calculations were conducted with a four-element circuit model; the 1D, 2D, and 3D calculations were conducted with highly resolved, fully electromagnetic representations. The IMG consists of 30 stages distributed axially and connected electrically in series. Each stage is powered by two bricks separated by 180° and connected electrically in parallel. Each brick comprises two opposite-polarity capacitors in series with a single switch. The bricks drive an internal impedance-matched coaxial transmission line terminated by a resistive load. The simulations neglect effects due to the switch-triggering circuit, the capacitor-charging circuit, external conducting boundaries, and reactive components of the load. We find dimensionality does not significantly affect the electrical power delivered by the IMG to its load: peak load powers estimated by the 0D, 1D, 2D, and 3D simulations agree to within 1%. The 3D calculations demonstrate that electromagnetic power radiated by the bricks, and axial gaps between stages, reduces the peak load power by less than ∼ 1 % . Each simulation assumes the load impedance is 34% above that at which the load power is maximized. Operating an IMG with such an overmatched load offers several advantages while decreasing the peak load power by only 2%. The 0D, 1D, 2D, and 3D models outlined herein could be adapted to assess computationally competing IMG designs, and conduct a variety of numerical IMG experiments, an IMG is constructed. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗