Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear accelerators”

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 415 records · Page 23

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗

Cathode to Target Simulations for Scorpius: I. Simulation Codes and Models

The new Scorpius linear induction electron accelerator is under development for multi-pulse flash radiography of large, explosively-driven hydrodynamic experiments. Beam physics from the cathode to the target was examined with computer simulations, including envelope, ray-trace, and particle-in cell (PIC) codes. Beam instabilities investigated included beam breakup (BBU), image displacement, diocotron, parametric envelope, ion hose, and the resistive wall instability. Beam corkscrew motion and emittance growth from beam mismatch were also studied. The results of these simulations is documented in a series of reports. In this report the computer codes and physical models used for these simulations are described. The conclusion of this study is that Scorpius will produce and accelerate a beam with radiographic quality equivalent to the present accelerators at Los Alamos National Laboratory if the same engineering standards and construction details are upheld.

43 PARTICLE ACCELERATORS↗

Overview of H- radio frequency ion sources for particle accelerators

Particle accelerators are among the most important scientific tools of the modern era. Large accelerator complexes have supported scientific user facilities which have had an enormous societal impact spanning many decades and enabling the work of thousands of scientific users worldwide contributing to many Nobel prizes in physics, biology and chemistry [1]. Many of the large hadron facilities employ accelerator complexes which include cyclotrons, synchrotrons, storage rings, linear or tandem accelerators and deliver ion beams of very high-intensity and/or very high-energy to their user facilities. These accelerator complexes require the injection of high-intensity beams of ions which are produced within an ion source and formed within a plasma or by bombardment of a surface [2]. Increasingly, RF systems are being utilized, to generate these ion-rich plasmas due to their high reliability and minimal use of consumable components. This report will first discuss the basic mechanisms of ion formation and plasma generation as well as some specifics of RF/microwave generators, matching circuits and plasma coupling structures typically employed. A detailed discussion will then be given of the RF-driven negative ion source systems employed by US Spallation Neutron Source as well as those used in similar facilities located around the globe. REFERENCES [1]Vladimir Shiltsev, “Particle beams behind physics discoveries”, Physics Today 73, Issue 4, 32 (2020) [2]Robert Welton et al, “Negative hydrogen ion sources for particle accelerators: Sustainability issues and recent improvements in long-term operations”, Journal of Physics Conf Series, 2244 012045

Welton, Robert F.↗

Experimental Safe Extremum Seeking for Accelerators

Here, we demonstrate the recent designs of safe extremum seeking (Safe ES) on the 1-km-long charged particle accelerator at the Los Alamos Neutron Science Center (LANSCE). Safe ES is a modification of extremum seeking (ES) which, in addition to minimizing an analytically unknown cost, also employs a safety filter based on an analytically unknown control barrier function (CBF) safety metric. Tuning is necessitated by accelerators being large complex systems, with many drifting parameters due to thermal effects and degradation. At the same time, safe operation (the maintenance of state constraints) is crucial, as damage brings astronomical costs, both financially and in operation downtime. Our measured (but analytically unknown) safety metric is the beam current. We perform multivariable Safe ES on three accelerator applications, in which we adapt 4, 6, and 3 magnet strength parameters, respectively. Two of the three applications are for validated simulation models of beamlines at LANSCE: the first for the proton radiography (pRad) beamline of 800-MeV protons for spot size tuning; the second on a high-performance code, HPSim, for tuning the low-energy beam transport (LEBT) region that contains a beam of 750-keV protons. The third is an experimental tuning of the steering magnets in the LEBT at LANSCE.

43 PARTICLE ACCELERATORS↗

AXI4MLIR: User-Driven Automatic Host Code Generation for Custom AXI-Based Accelerators

Tensor algebra operations represent an important class of algorithms used across many applications, including machine learning, scientific computing, and data analytics. As a result, the efficient generation of custom accelerators for tensor operations has received increased attention. Previous efforts have produced automated tools enabling users to prototype and explore optimized accelerators. However, little effort has been focused on the host-accelerator interaction in these tools. Efficient use of hardware accelerators requires knowledge about the accelerator's capabilities (operations, data formats, and opcode support), the host CPU microarchitecture (e.g., memory hierarchy), the host-accelerator interface, and the application's features (which code regions should be mapped onto an accelerator). Manually rewriting the original applications to facilitate improved custom accelerator mapping is an error-prone and time-consuming endeavor. To cope with this, we propose AXI4MLIR, a new framework to automatically generate and optimize the communication between the host CPU and arbitrary accelerators that implement linear algebra algorithms. AXI4MLIR extends the MLIR compiler framework to automatically generate efficient host-accelerator driver code for accelerators with AXI-based interfaces. Our compiler extensions enable automatic driver code generation while carefully considering the host's memory hierarchy and target accelerator features. To demonstrate the flexibility and utility of AXI4MLIR, we test it with diverse use cases that include different types of accelerators, tiling scenarios, and dataflow schemes. We compare our experimental results to manual implementations of host-accelerator driver code and find that our approach can reduce CPU cache references by 56% and deliver up to a 1.65x speedup.

Bohm Agostini, Nicolas↗

First results from a high-frame-rate, multi-GHz ionizing particle detection system geared toward accelerator diagnostic applications

An integrated detection system, consists of a thin diamond sensor incorporated into a compact signal loop, coupled in turn to an application-specific integrated circuit readout chip, has been tested for the first time, using ps-duration electron pulses from the Next Linear Collider Test Accelerator at the SLAC National Accelerator Laboratory. For readout frame rates as high as 120 kHz, the detection system is shown to achieve a linear dynamic range of 10 3 and a bandwidth of 4–5 GHz, with no ringing seen on the tail of the output pulse. These results represent the best-performing multi-GHz ionizing particle detection system achieved to date.

Ferezghi, Mohammadreza Mohseni [University of Cali↗

Application of linear prolongation to coarse mesh finite difference acceleration in CASMO5

The Coarse-Mesh Finite Difference (CMFD) method has been used for over a decade to accelerate the convergence of the Method of Characteristics (MOC) solution to the two- dimensional particle transport equation in CASMO5. Numerical testing, along with widespread use in production-level calculations, have shown that the current CMFD implementation provides stability and robustness for a wide range of realistic reactor physics problems. However, the recent development of linear prolongation has attracted attention from the community as a way to further improve the performance and stability of CMFD. Two interpolation methods for linear prolongation are presented in this work and implemented into a test version of CASMO5. The performance of the proposed interpolations, referred to as the bilinear and linear directional schemes, is evaluated in terms of runtime relative to the default constant or uniform scaling update. Numerical results indicate that the use of linear prolongation can reduce the transport solver runtime on average by approximately 10% when tested with two hundred randomly selected cases. The new directional linear interpolation, combined with default constant boundary updates, is found to provide the highest reduction in runtime for the cases analyzed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

2D Simulations of Diamagnetic Loop Calibrations

Diamagnetic loops can be used as a non-invasive method for measurements of beam size in electron beam accelerators that use solenoidal magnetic transport. A comprehensive theory for interpreting data from a diamagnetic loop relates the rms beam radius to the excluded flux measured by the loop and the beam current. Thus, primary calibration of the loop must relate the loop signal directly to the exclude d flux. We have simulated these calibrations with a 2D field solver in order to identify possible sources of uncertainty in our calibration technique.

43 PARTICLE ACCELERATORS↗

Diamagnetic Loop Testing on DARHT-I

Diamagnetic loops (DML) can be used as a noninvasive method for measurements of beam size in electron beam accelerators that use solenoidal magnetic transport. The loop fundamentally measures the magnetic flux excluded by a diamagnetic object. A comprehensive theory relates the rms beam radius to the excluded flux measured by the DML. We have built, and calibrated a DML apparatus. Recently, this DML has been used to measure the size of the electron beam near the final focus of the DARHT-I flash-radiography accelerator. Results are in agreement with beam transport code predictions. In this article, we review and summarize the construction, calibration, and electron-beam testing of this DML.

43 PARTICLE ACCELERATORS↗

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗

Fast and scalable quantum Monte Carlo simulations of electron-phonon models

We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a widely used tool for simulating simple electron-phonon models at finite temperatures, but incurs a computational cost that scales cubically with system size. Alternatively, near-linear scaling with system size can be achieved with the hybrid Monte Carlo (HMC) method and an integral representation of the Fermion determinant. Here, we introduce a collection of methodologies that make such simulations even faster. To combat "stiffness" arising from the bosonic action, we review how Fourier acceleration can be combined with time-step splitting. To overcome phonon sampling barriers associated with strongly-bound bipolaron formation, we design global Monte Carlo updates that approximately respect particle-hole symmetry. To accelerate the iterative linear solver, we introduce a preconditioner that becomes exact in the adiabatic limit of infinite atomic mass. Finally, we demonstrate how stochastic measurements can be accelerated using fast Fourier transforms. Here, these methods are all complementary and, combined, may produce multiple orders of magnitude speedup, depending on model details.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Linear stability analysis via simulated annealing and accelerated relaxation

Simulated annealing (SA) is a kind of relaxation method for finding equilibria of Hamiltonian systems. A set of evolution equations is solved with SA, which is derived from the original Hamiltonian system so that the energy of the system changes monotonically while preserving Casimir invariants inherent to noncanonical Hamiltonian systems. The energy extremum reached by SA is an equilibrium. Since SA searches for an energy extremum, it can also be used for stability analysis when initiated from a state where a perturbation is added to an equilibrium. The procedure of the stability analysis is explained, and some examples are shown. Because the time evolution is computationally time consuming, efficient relaxation is necessary for SA to be practically useful. An acceleration method is developed by introducing time dependence in the symmetric kernel used in the double bracket, which is part of the SA formulation described here. An explicit formulation for low-beta reduced magnetohydrodynamics (MHD) in cylindrical geometry is presented. In conclusion, since SA for low-beta reduced MHD has two advection fields that relax, it is important to balance the orders of magnitude of these advection fields.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hardware acceleration for HPS algorithms in two and three dimensions

We provide a flexible, open-source framework for hardware acceleration, namely massively-parallel execution on general-purpose graphics processing units (GPUs), applied to the hierarchical Poincaré–Steklov (HPS) family of algorithms for building fast direct solvers for linear elliptic partial differential equations. To take full advantage of the power of hardware acceleration, we propose two variants of HPS algorithms to improve performance on two- and three-dimensional problems. In the two-dimensional setting, we introduce a novel recomputation strategy that minimizes costly data transfers to and from the GPU; in three dimensions, we modify and extend the adaptive discretization technique of Geldermans and Gillman [1] to greatly reduce peak memory usage. We provide an open-source implementation of these methods written in JAX, a high-level accelerated linear algebra package, which allows for the first integration of a high-order fast direct solver with automatic differentiation tools. We conclude with extensive numerical examples showing our methods are fast and accurate on two- and three-dimensional problems.

Fast direct solvers↗

The positron arm of a plasma-based linear collider

Plasma-based acceleration of electrons has produced high-energy beams at high accelerating gradients with a narrow energy spread and high efficiency both in experiments and simulations. Furthermore, it is now being considered as a complementary approach to the use of radiofrequency cavities in next-generation lepton accelerators. However, compared with electrons, plasma-based positron acceleration is at the present time much less advanced. Although high-gradient positron acceleration in a plasma has been achieved, we are one to three orders of magnitude away from delivering the high-quality positron beams needed for a future high-energy linear collider. Here we review the status of plasma-based acceleration of electrons and positrons and discuss the prospects for substantial progress towards developing the positron arm of a plasma-based electron–positron linear collider in the next decade.

Plasma-based accelerators↗

Capacitated p -hub approach for park-and-ride facility location problem under nested logit demand function: polyhedral approaches

By generalizing the unconstrained p-hub approach for the park-and-ride (P&R) facility location problem under the multinomial logit demand function, the capacitated p-hub approach for the problem under the nested logit demand function captures a broader range of real-world cases. To solve this problem optimally, we introduce a mixed-integer linear program and accelerate its solution by enhancing the branch-and-cut procedure. To address the problem at a large scale, we introduce two other polyhedral approaches: variable neighborhood search (VNS) and adaptive randomized rounding (ARR). Downtown areas in Seoul have a high modal share of public transportation and congested road traffic, yet P&R has not been widely implemented. Therefore, we apply the ARR procedure to solve a real-world problem using traffic and geographic data from the Seoul metropolitan area. ARR performs better than VNS and addresses real-world cases. The solutions obtained by ARR present a phased expansion plan that encourages policymakers to start installing a small number of P&Rs immediately.

Capacitated p-hub approach↗

Design of Cylindrical Implosion Experiments to Demonstrate Scale-Invariant Rayleigh-Taylor Instability Growth

Radiation-hydrodynamics simulations are used to design laser-driven cylindrical implosion experiments to directly measure hydrodynamic instability growth in convergent geometry. Designs for two different size targets, varying in radial dimension by a factor of three, are presented. A set of beam pointings and powers are identified for each scale design that result in a nearly axially uniform implosion of an embedded marker layer. The implosion trajectories are shown to be scale-invariant between designs, with nearly identical scaled acceleration profiles. Finally, linear theory and radiation-hydrodynamics simulations predict that Rayleigh-Taylor instability growth of an azimuthal perturbation, machined on the inner surface of the embedded marker, is also scale-invariant between designs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On the convergence of an IEQ-based first-order semi-discrete scheme for the Beris-Edwards system

We present a convergence analysis of an unconditionally energy-stable first-order semi-discrete numerical scheme designed for a hydrodynamic Q-tensor model, the so-called Beris-Edwards system, based on the Invariant Energy Quadratization Method (IEQ). The model consists of the Navier–Stokes equations for the fluid flow, coupled to the Q-tensor gradient flow describing the liquid crystal molecule alignment. By using the Invariant Energy Quadratization Method, we obtain a linearly implicit scheme, accelerating the computational speed. However, this introduces an auxiliary variable to replace the bulk potential energy and it is a priori unclear whether the reformulated system is equivalent to the Beris-Edward system. In this work, we prove stability properties of the scheme and show its convergence to a weak solution of the coupled liquid crystal system. We also demonstrate the equivalence of the reformulated and original systems in the weak sense.

Weber, Franziska↗