Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast”

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 559 records · Page 31

Fast Fourier transform evaluation of the Fresnel integral for gravitational-wave lensing

Gravitational waves (GWs) exhibit wave-optics effects when their wavelength is comparable to the scale of the gravitational lens. This may occur in lensing from galactic subhalos in GWs emitted by binary black-hole mergers and is gaining interest as a novel probe of dark matter. Predictions for observables in these cases ultimately rely on evaluating a Fresnel integral that quantifies the effect of lensing on the amplitude of a GW at a given frequency. However, numerical evaluation of this Fresnel integral is tricky, and several algorithms and publicly available codes that implement it have been developed. Here, we show that the dependence of this integral on the lens position can be written as a two-dimensional Fourier transform. Modern FFT techniques then enable rapid evaluation at all-sky positions simultaneously for general lenses without symmetry. Vectorization of FFT routines allows for derivatives with respect to model parameters to be obtained with only incremental additional computational cost. If the lens is axisymmetric, further speedups can be achieved with recently developed techniques for nonuniform fast Hankel transforms. To demonstrate, we make available Fresnel Integral Optimization with Nonuniform Transforms (fiona), an efficient and accurate code that is significantly faster than current methods for dense source grids, reaching 2 orders of magnitude speedups for ∼10 6 GW-emitting points. As part of FIONA , we developed code that provides vectorized nonuniform fast Hankel transforms that may have other uses (e.g., calculation of cosmological two-point correlation functions) beyond those considered here.

dark matter↗

Fast Relaxation on Qutrit Transitions of Nitrogen-Vacancy Centers in Nanodiamonds

Thanks to their versatility, nitrogen-vacancy (N-𝑉) centers in nanodiamonds have been widely adopted as nanoscale sensors. However, their sensitivities are limited by their short coherence times relative to N-𝑉⁢s in bulk diamond. A more complete understanding of the origins of decoherence in nanodiamonds is critical to improving their performance. Here we present measurements of fast spin relaxation on qutrit transitions between the energy eigenstates composed of the 𝑚 𝑠 =|±1⟩ states of the N-𝑉 − electronic ground state in approximately 40-nm nanodiamonds under ambient conditions. For frequency splittings between these states of 20 MHz or less the maximum theoretically achievable coherence time of the N-𝑉 spin is approximately 2 orders of magnitude shorter than would be expected if the N-𝑉 spin is treated as a qubit. We attribute this fast relaxation to electric field noise. We observe a strong falloff of the qutrit relaxation rate with the splitting between the states, suggesting that, whenever possible, measurements with N-𝑉⁢s in nanodiamonds should be performed at moderate axial magnetic fields (>60 G). We also observe that the qutrit relaxation rate changes with time. As a result, these findings indicate that surface electric field noise is a major source of decoherence for N-𝑉⁢s in nanodiamonds.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Fast neutrino flavor conversion modes in multidimensional core-collapse supernova models: The role of the asymmetric neutrino distributions

A dense neutrino gas, such as the one anticipated in the supernova environment, can experience fast neutrino flavor conversions on scales much shorter than those expected in vacuum probably provided that the angular distributions of ν e and $\bar{v}_e$ cross each other. We perform a detailed investigation of the neutrino angular distributions obtained by solving the Boltzmann equations for fixed matter profiles of some representative snapshots during the postbounce phase of core-collapse supernovae in multidimensional calculations of a 11.2 M ⊙ and a 27 M ⊙ progenitor model. Although the 11.2 M ⊙ model features ν e - $\bar{v}_e$ angular crossings and the associated fast modes at different time snapshots, the 27 M ⊙ model does not show any crossings within the decoupling region. We show that this can be understood by studying the multipole components of the neutrino distributions. In fact, there is a higher chance for the occurrence of ν e - $\bar{v}_e$ angular crossings for the zones where the multipole components of the neutrino distributions are strong enough. We also show that there can exist more than one crossing between the angular distributions of ν e and $\bar{v}_e$. In addition, apart from the crossings within the neutrino decoupling region, there is a class of ν e - $\bar{v}_e$ angular crossings that appears very deep inside the protoneutron star.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast and accurate simulations of calorimeter showers with normalizing flows

In this study, we introduce caloflow, a fast detector simulation framework based on normalizing flows. For the first time, we demonstrate that normalizing flows can reproduce many-channel calorimeter showers with extremely high fidelity, providing a fresh alternative to computationally expensive geant4 simulations, as well as other state-of-the-art fast simulation frameworks based on generative adversarial networks (GANs) or variational autoencoders (VAEs). In addition to the usual histograms of physical features and images of calorimeter showers, we introduce a new metric for judging the quality of generative modeling: the performance of a classifier trained to differentiate real from generated images. We show that GAN-generated images can be identified by the classifier with nearly 100% accuracy, while images generated from caloflow are better able to fool the classifier. More broadly, normalizing flows offer several advantages compared to other state-of-the-art approaches (GANs and VAEs), including tractable likelihoods, stable and convergent training, and principled model selection. Normalizing flows also provide a bijective mapping between data and the latent space, which could have other applications beyond simulation, for example, to detector unfolding.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Neutrino fast flavor oscillations with moments: Linear stability analysis and application to neutron star mergers

Providing an accurate modeling of neutrino physics in dense astrophysical environments such as binary neutron star mergers presents a challenge for hydrodynamic simulations. Nevertheless, understanding how flavor transformation can occur and affect the dynamics, the mass ejection, and the nucleosynthesis will need to be achieved in the future. Computationally expensive, large-scale simulations frequently evolve the first classical angular moments of the neutrino distributions. By promoting these quantities to matrices in flavor space, we develop a linear stability analysis of fast flavor oscillations using only the first two “quantum” moments, which notably requires generalizing the classical closure relations that appropriately truncate the hierarchy of moment equations in order to treat quantum flavor coherence. After showing the efficiency of this method on a well-understood test situation, we perform a systematic search of the occurrence of fast flavor instabilities in a neutron star merger simulation. Here, we discuss the successes and shortcomings of moment linear stability analysis, as this framework provides a time-efficient way to design and study better closure prescriptions in the future.

79 ASTRONOMY AND ASTROPHYSICS↗

Collisions and collective flavor conversion: Integrating out the fast dynamics

In dense astrophysical environments, notably core-collapse supernovae and neutron star mergers, neutrino-neutrino forward scattering can spawn flavor conversion on very short scales. Scattering with the background medium can impact collective flavor conversion in various ways, either damping oscillations or possibly setting off novel collisional flavor instabilities (CFIs). A key feature in this process is the slowness of collisions compared to the much faster dynamics of neutrino-neutrino refraction. Assuming spatial homogeneity, we leverage this hierarchy of scales to simplify the description accounting only for the slow dynamics driven by collisions. We illustrate our new approach both in the case of CFIs and in the case of fast instabilities damped by collisions. In both cases, our strategy provides new equations, the , that simplify the description of flavor conversion and allow us to qualitatively understand the final state of the system after the instability, either collisional or fast, has saturated. Published by the American Physical Society 2024

79 ASTRONOMY AND ASTROPHYSICS↗

Fast and accurate algorithm for calculating long-baseline neutrino oscillation probabilities with matter effects

Neutrino oscillation experiments will be entering the precision era in the next decade with the advent of high statistics experiments like DUNE, HK, and JUNO. Correctly estimating the confidence intervals from data for the oscillation parameters requires very large Monte Carlo datasets involving calculating the oscillation probabilities in matter many, many times. In this paper, we leverage past work to present a new, fast, precise technique for calculating neutrino oscillation probabilities in matter optimized for long-baseline neutrino oscillations in the Earth’s crust including both accelerator and reactor experiments. For ease of use by theorists and experimentalists, we provide fast ++ and codes . Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Slow and Fast Light in Plasma Using Optical Wave Mixing

Slow and fast light, or large changes in the group velocity of light, have been observed in a range of optical media, but the fine optical control necessary to induce an observable effect has not been achieved in a plasma. Here, we describe how the ion-acoustic response in a fully ionized plasma can produce large and measurable changes in the group velocity of light. In this work, we show the first experimental demonstration of slow and fast light in a plasma, measuring group velocities between 0.12c and -0.34c.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fast Preparation and Detection of a Rydberg Qubit Using Atomic Ensembles

Here, we demonstrate a new approach for fast preparation, manipulation, and collective readout of an atomic Rydberg-state qubit. By making use of Rydberg blockade inside a small atomic ensemble, we prepare a single qubit within 3 μs with a success probability of $F_p$ = 0.93 ± 0.02, rotate it, and read out its state in 6 μs with a single-shot fidelity of $F_d$ = 0.92 ± 0.04. The ensemble-assisted detection is 10 3 times faster than imaging of a single atom with the same optical resolution, and enables fast repeated nondestructive measurement. We observe qubit coherence times of 15 μs, much longer than the π rotation time of 90 ns. Potential applications ranging from faster quantum information processing in atom arrays to efficient implementation of quantum error correction are discussed.

74 ATOMIC AND MOLECULAR PHYSICS↗

Fast and Accurate Greenberger-Horne-Zeilinger Encoding Using All-to-All Interactions

The 𝑁-qubit Greenberger-Horne-Zeilinger (GHZ) state is an important resource for quantum technologies. Here, we consider the task of GHZ encoding using all-to-all interactions, which prepares the GHZ state in a special case, and is furthermore useful for quantum error correction, interaction-rate enhancement, and transmitting information using power-law interactions. The naive protocol based on parallelizing CNOT gates takes O(1)-time of Hamiltonian evolution. In this work, we propose a fast protocol that achieves GHZ encoding with high accuracy. The evolution time O⁡(log 2 ⁡𝑁/𝑁) almost saturates the theoretical limit Ω⁡(log⁡𝑁/𝑁). Moreover, the final state is close to the ideal encoded one with high fidelity >1–10 −3 , up to large system sizes 𝑁 ≲ 2000. The protocol only requires a few stages of time-independent Hamiltonian evolution; the key idea is to use the data qubit as control, and to use fast spin-squeezing dynamics generated by e.g., two-axis twisting.

quantum computation↗

ChemEnv : a fast and robust coordination environment identification tool

Coordination or local environments have been used to describe, analyze and understand crystal structures for more than a century. Here, a new tool called ChemEnv, which can identify coordination environments in a fast and robust manner, is presented. In contrast to previous tools, the assessment of the coordination environments is not biased by small distortions of the crystal structure. Its robust and fast implementation enables the analysis of large databases of structures. The code is available open source within the pymatgen package and the software can also be used through a web app available on http://crystaltoolkit.org through the Materials Project.

42 ENGINEERING↗

Fast Active-Set Thresholding Method for Nonnegative Least Squares

Nonnegative Least Squares (NNLS) is a fundamental constrained optimization problem encountered in many applications such as image deblurring, signal processing, nonnegative matrix factorization, magnetic microscopy, and hyperspectral imaging. Active-set based methods are a common class of algorithms for solving NNLS which identify the optimal variable set of the NNLS solution. They do so by iteratively solving a series of unconstrained least squares problems, identifying which variables violate the nonnegativity constraints, and then swapping variables in/out of consideration until the optimal set of variables is found. Several variations improving upon this method exist in the literature. In this work, we propose an active-set swap heuristic which further improves upon existing active-set based methods for NNLS. Our optimizations are based upon adding multiple variables to the passive set within a threshold of the smallest gradient value and removing variables within a similar threshold of the closest boundary constraint. We leverage these optimizations to yield a Fast Active-Set Thresholding NNLS (FAST-NNLS) algorithm which significantly outperforms the existing state-of-the-art NNLS algorithms for a wide range of problems. Rigorous convergence guarantees are proven for the proposed method. We demonstrate the effectiveness of our proposed method on multiple synthetic datasets and two realworld text analysis applications. In doing so, we present the most comprehensive NNLS solver comparison in the literature to date.

Cobb, Benjamin [Georgia Institute of Technology]↗

Model-less Source Location for Forced Oscillation based on Synchrophasor and Moving Fast Fourier Transformation

Forced oscillations in power systems occur when the grid is driven by an external and periodic force. To quickly detect and locate the source of the forced oscillation is critical in terms of ensuring the reliability of an interconnected power grid. This paper explores the electromechanical wave propagation theory and the Fast Fourier Transformation to analyze the forced oscillations. It proposes a model-less, adaptive, fast, and accurate source location algorithm. The proposed algorithm is extensively evaluated through simulation data from a 70k-bus U.S. Eastern Interconnection test system and field-collected synchrophasor data from the distribution-level wide-area monitoring system, FNET/GridEye. The evaluation results demonstrate the correctness and effectiveness of the proposed model-less forced oscillation source location algorithm.

Wang, Weikang↗

Electromagnetic Transient Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (Distribution Grid Models)

The distribution and transmission grids are observing an increased penetration of power electronics in loads and generations. For example, there is increasing interest in integrating in extreme fast charging (XFC) systems for fast charging of electrical vehicles. As these systems are integrated, developing high-fidelity electromagnetic transient model of XFC systems in distribution grids and evaluating their interactions with the power grid would be of significant interest. This model will be utilized for design of XFC systems, to identify upgrades in distribution and/or transmission grids, for planning purposes by transmission planners or operators or owners, among others. It can also be utilized in operations for improved reliable performance of the grid and/or XFC station. The challenge with simulating these models is the high computational complexity introduced by the large number of states present in the system and the time-step needed to simulate the system. In this paper, advanced simulations algorithms are applied to reduce the computational complexity of simulating large-scale XFC systems. The algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. While the first three algorithms split the matrix that needs to be inverted from a large matrix to much smaller matrices, the final algorithm reduces the computational burden of applying higher-order integration approaches in the complete system. The comparison made in the previous sentence is with respect to use of homogeneous integration approaches used in conventional electromagnetic transient simulators like power systems computer aided design (PSCAD). The approaches mentioned here have resulted in speed-up of 36x in the simulation of a single distribution system with 15 XFCs.

Debnath, Suman↗

A MW scale charging architecture for supporting extreme fast charging of heavy-duty electric vehicles

Extreme fast charging of electric vehicles technologies is coming. Heavy duty electric vehicles (HD-EVs) are in development and are expected to have multipliers bigger in battery capacity compared to the light duty counterparts. To meet short charging times, MW charging will be necessary. This paper presents a MW scale extreme DC fast charger with a communication and control architecture for HD-EVs. The system is validated in a controller hardware in the loop platform.

Starke, Michael↗

Optimal Managed Fast-Charging Model for Electric Vehicle Fleets with High Utilization and Multiple Charge-Acceptance Curves

A predictive control/scheduling optimization model is proposed for managed charging of an electric vehicle (EV) fleet - under time-of-use energy and demand prices, high vehicle utilization frequency (short dwell times), multiple charge- acceptance curves (configurable charging rates), and flexible vehicle demand. This context is particularly relevant for flight schools (small electric aircraft) or other commercial facilities where an EV fleet performs multiple operating and fast-charging sessions on the same day. The proposed model performs both the operational and charging scheduling of the vehicles, which is not typically done for residential managed charging and significantly increases problem complexity. The problem is formulated as a MILP model and a case study of a small fast-charging station is presented. Results demonstrate a significant reduction in operating cost, mainly from peak shaving during high demand price periods, achieved by coordinating the operation of different vehicles, chargers and charging rates.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗

Fast Iterative Multi-site Hosting Capacity Analysis for Distribution Systems With Search Space Pruning

Interconnection studies for distributed energy resources (DERs) is a time-intensive process, primarily due to the necessity of solving large number of power flow scenarios. Hosting capacity analysis (HCA) is a time-consuming aspect of interconnection studies that is divided into single-site HCA (SHCA) and multi-site HCA (MHCA). From a computational and understandable standpoint, the industry seeks iteration-based solutions for SHCA, although it doesn't maximize the total DER hosting capacity (DERHC) of the grid, as MHCA does. While non-iterative solutions are available for MHCA, they involve a trade-off between the modeling accuracy of the distribution system, solution quality, and ease of understanding. In this work, we present a fast iterative solution for MHCA, reducing computational complexity by eliminating the need to solve power flows for a large amount of search space, thus making iterative solutions feasible. This iterative approach guarantees both a global optimal solution with sufficient time and a fast, close-to-optimal solution through efficient search space pruning. It also easily integrates with existing utility HCA tools. The results are demonstrated on select locations in the IEEE-123 bus system for community-scale interconnection studies. We highlight the benefits of skipping the need to solve millions of power flows, all while maximizing the grid's total DERHC.

Guddanti, Kishan Prudhvi↗

Fast Hyperspectral Neutron Tomography

Hyperspectral neutron computed tomography is a tomographic imaging technique in which thousands of wavelength-specific neutron radiographs are measured for each tomographic view. In conventional hyperspectral reconstruction, data from each neutron wavelength bin are reconstructed separately, which is extremely time-consuming. These reconstructions often suffer from poor quality due to low signal-to-noise ratios. Consequently, material decomposition based on these reconstructions tends to produce inaccurate estimates of the material spectra and erroneous volumetric material separation. In this paper, we present two novel algorithms for processing hyperspectral neutron data: fast hyperspectral reconstruction and fast material decomposition. Both algorithms rely on a subspace decomposition procedure that transforms hyperspectral views into low-dimensional projection views within an intermediate subspace, where tomographic reconstruction is performed. The use of subspace decomposition dramatically reduces reconstruction time while reducing both noise and reconstruction artifacts. We apply our algorithms to both simulated and measured neutron data and demonstrate that they reduce computation and improve the quality of the results relative to conventional methods.

Chowdhury, Mohammad Samin Nur [Purdue University]↗