Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm”

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 1,531 records · Page 85
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

A High-Order Low-Order Algorithm with Exponentially Convergent Monte Carlo for Thermal Radiative Transfer

In this paper, we have implemented a new high-order low-order (HOLO) algorithm for solving thermal radiative transfer problems. The low-order (LO) system is based on the spatial and angular moments of the transport equation and a linear-discontinuous finite-element spatial representation, producing equations similar to the standard S 2 equations. The LO solver is fully implicit in time and efficiently resolves the nonlinear temperature dependence at each time step. The high-order (HO) solver utilizes exponentially convergent Monte Carlo (ECMC) to give a globally accurate solution for the angular intensity to a fixed-source pure-absorber transport problem. This global solution is used to compute consistency terms, which require the HO and LO solutions to converge toward the same solution. The use of ECMC allows for the efficient reduction of statistical noise in the Monte Carlo solution, reducing inaccuracies introduced through the LO consistency terms. Finally, we compare results with an implicit Monte Carlo code for one-dimensional gray test problems and demonstrate the efficiency of ECMC over standard Monte Carlo in this HOLO algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

On the novel 3-D neutron transport kinetic tRAPID algorithm and its validation

The Real-time Analysis for Particle-transport and In-situ Detection (RAPID) Code System, based on the Multi-stage Response-function Transport (MRT) methodology, allows for real-time simulation of nuclear systems based on 3-D continuous-energy particle transport. RAPID's steady-state (criticality) neutron transport algorithm is based on the Fission Matrix (FM) method, and has been extensively verified and validated against computational benchmarks and experiments. This paper introduces the novel 3-D time-dependent transport algorithm that has been implemented into the code, tRAPID, and its validation using the JSI TRIGA Mark-II reactor. tRAPID accurately and efficiently calculates neutron kinetics parameters (such as β{sub eff}, l{sub eff} , Λ, α{sub Rossi}) and 3-D time-dependent neutron fission source distribution and neutron importances for both prompt and delayed neutrons. tRAPID is used to simulate a rod insertion experiment performed at the JSI TRIGA Mark-II reactor, during which signals from four fission chambers at four different locations in the core were collected. The results demonstrate how tRAPID is capable of calculating detailed and accurate results with only a minimal use computational resources and time.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Optimization of microwave emission from laser filamentation with a machine learning algorithm

We demonstrate that is it possible to optimize the yield of microwave radiation from plasmas generated by laser filamentation in atmosphere through manipulation of the laser wavefront. A genetic algorithm controls a deformable mirror that reconfigures the wavefront using the microwave waveform amplitude as feedback. Optimization runs performed as a function of air pressure show that the genetic algorithm can double the microwave field strength relative to when the mirror surface is flat. Here, an increase in the volume and brightness of the plasma fluorescence accompanies the increase in microwave radiation, implying an improvement in the laser beam intensity profile through the filamentation region due to the optimized wavefront.

Englesbe, Alexander↗
DOE OSTI2016

Adaptive step-size algorithm for Fourier beam-propagation method with absorbing boundary layer of auto-determined width

Two algorithms that enhance the utility of the absorbing boundary layer are presented, mainly in the framework of the Fourier beam-propagation method. One is an automated boundary layer width selector that chooses a near-optimal boundary size based on the initial beam shape. Furthermore, the second algorithm adjusts the propagation step sizes based on the beam shape at the beginning of each step in order to reduce aliasing artifacts.

42 ENGINEERING↗
DOE OSTI2019

Pseudo-differential representation of the metaplectic transform and its application to fast algorithms

The metaplectic transform (MT), also known as the linear canonical transform, is a unitary integral mapping that is widely used in signal processing and can be viewed as a generalization of the Fourier transform. For a given function $ψ$ on an $N$-dimensional continuous space q , the MT of $ψ$ is parameterized by a rotation (or more generally, a linear symplectic transformation) of the 2$N$-dimensional phase space ( q,p ), where p is the wavevector space dual to q . In this study, we derive a pseudo-differential form of the MT. For small-angle rotations, or near-identity transformations of the phase space, it readily yields asymptotic differential representations of the MT, which are easy to compute numerically. Rotations by larger angles are implemented as successive applications of $K \gg 1$ small-angle MTs. The algorithm complexity scales as $O(KN^3N_p)$ where $N_p$ is the number of grid points. Here, we present a numerical implementation of this algorithm and discuss how to mitigate the associated numerical instabilities.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Emulating the Deutsch-Josza algorithm with an inverse-designed terahertz gradient-index lens

An all-dielectric photonic metastructure is investigated for application as a quantum algorithm emulator (QAE) in the terahertz frequency regime; specifically, we show implementation of the Deustsh-Josza algorithm. The design for the QAE consists of a gradient-index (GRIN) lens as the Fourier transform subblock and patterned silicon as the oracle subblock. First, we detail optimization of the GRIN lens through numerical analysis. Then, we employed inverse design through a machine learning approach to further optimize the structural geometry. Through this optimization, we enhance the interaction of the incident light with the metamaterial via spectral improvements of the outgoing wave.

Blackwell, Ashley N.↗
DOE OSTI2026

Development of a pattern recognition algorithm for reconstructing multi-particle events in the Mu2e detector

Mu2e is an upcoming experiment at Fermilab and its main goal is to search for the Charged Lepton Flavor Violation (CLFV) in the coherent transition of a muon into an electron on an Al target. In Mu2e, multi-particle events can occur simultaneously within the same time region and it is crucial to accurately identify each particle track, including signals, to improve the robustness of track finding methods and enhance reconstruction efficiency. ¯p annihilation is one of the background events and produces multiple particles that can mimic signal events. Additionally, photons from radiative pion captures can produce a γ → $e+e−$ pair, which can be used to calibrate the Mu2e momentum scale and the resolution. The Mu2e track reconstruction sequence begins by grouping hits produced in the tracker based on time and z coordinate information, called TimeCluster, and selected hits are processed to reconstruct helices and determine their momentum. The current pattern recognition algorithms identify a single helix per TimeCluster for single track events. A new pattern recognition algorithm is being developed to reconstruct multi-particle events and its features for finding multiple tracks and the current evaluation results are reported.

Kitagawa, H. [Pisa U.]↗
DOE OSTI2016

Robustness of Dynamical Cluster Analysis in a Glass-Forming Metallic Liquid using an Unsupervised Machine Learning Algorithm

We performed dynamical cluster analysis in a Cu-Zr-Al based glass-forming metallic liquid using an unsupervised machine learning algorithm. The size of the dynamical clusters is used to quantify the onset of cooperative dynamics as the underlying mechanism leading to the Arrhenius dynamic crossover in transport coefficients of the metallic liquid. This technique is useful to directly visualize dynamical clusters and quantify their sizes upon cooling. Here, we demonstrate the robustness of this algorithm by performing sensitivity analysis against two key parameters: number of mobility groups and inconsistency coefficient of the hierarchical cluster tree. The results elucidate the optimized range of values for both of these parameters that capture the underlying physical picture of increasing cooperative dynamics appropriately.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Simultaneous prediction of structural properties in epitaxially–grown GaN with quantum and conventional multi–output learning algorithms

Hundreds of GaN thin film crystal plasma–assisted molecular beam epitaxy synthesis experiment records spanning two decades were organized into a dataset correlating the growth experiment design parameters with discrete, binary determinations of crystallinity and surface morphology. Conventional data science techniques as well as both quantum and classical multi–output supervised machine learning algorithms were implemented to investigate the relationships between the operating parameter data and the structural figures of merit. Correlation coefficients, decision tree nodes, p–values, and SHAP values all support substrate temperature and gallium effusion cell conditions as being statistically significant for simultaneously influencing GaN crystallinity and surface morphology. Here, a conventional deep neural network learned best from the data, followed by a quantum–classical hybrid gradient boosting algorithm. When combined with calculations of uncertainty intervals based on VennAbers predictors, machine learning predictions of both structural properties show good agreement with results reported in published experimental literature.

36 MATERIALS SCIENCE↗
DOE OSTI2016

A Parameter Subset Selection Algorithm for Mixed-Effects Models

Mixed-effects models are commonly used to statistically model phenomena that include attributes associated with a population or general underlying mechanism as well as effects specific to individuals or components of the general mechanism. This can include individual effects associated with data from multiple experiments. However, the parameterizations used to incorporate the population and individual effects are often unidentifiable in the sense that parameters are not uniquely specified by the data. As a result, the current literature focuses on model selection, by which insensitive parameters are fixed or removed from the model. Model selection methods that employ information criteria are applicable to both linear and nonlinear mixed-effects models, but such techniques are limited in that they are computationally prohibitive for large problems due to the number of possible models that must be tested. To limit the scope of possible models for model selection via information criteria, we introduce a parameter subset selection (PSS) algorithm for mixed-effects models, which orders the parameters by their significance. In conclusion, we provide examples to verify the effectiveness of the PSS algorithm and to test the performance of mixed-effects model selection that makes use of parameter subset selection.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Forward and inverse uncertainty quantification using multilevel Monte Carlo algorithms for an elliptic non-local equation

Our paper considers uncertainty quantification for an elliptic nonlocal equation. In particular, it is assumed that the parameters which define the kernel in the nonlocal operator are uncertain and a priori distributed according to a probability measure. It is shown that the induced probability measure on some quantities of interest arising from functionals of the solution to the equation with random inputs is well-defined,s as is the posterior distribution on parameters given observations. As the elliptic nonlocal equation cannot be solved approximate posteriors are constructed. The multilevel Monte Carlo (MLMC) and multilevel sequential Monte Carlo (MLSMC) sampling algorithms are used for a priori and a posteriori estimation, respectively, of quantities of interest. Furthermore, these algorithms reduce the amount of work to estimate posterior expectations, for a given level of error, relative to Monte Carlo and i.i.d. sampling from the posterior at a given level of approximation of the solution of the elliptic nonlocal equation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Frequency-Domain-Based Algorithm for Detecting Microseismicity Using Dense Surface Seismic Arrays

We propose a new frequency-domain-based algorithm for detecting small-magnitude seismic events using dense surface seismic arrays. Our proposed method takes advantage of the high energy carried by S waves, and approximate known source locations, which are used to rotate the horizontal components to obtain the maximum amplitude. By surrounding the known source area with surface geophones, we achieve a favorable geometry for locating the detected seismic events with the backprojection method. To test our new detection method, we used a dense circular array, consisting of 151 5 Hz three-component geophones, over a 5 km aperture that was in operation at the Utah Frontier Observatory for Research in Geothermal Energy (FORGE) in southcentral Utah. We apply the new detection method during a small-scale test injection phase at FORGE, and during an aftershock sequence of an Mw 4.1 earthquake located ~30 km north of the geophone array, within the Black Rock volcanic field. We are able to detect and locate microseismic events (Mw<0) during injections, despite the high level of anthropogenic activity, and several aftershocks that are missing from the regional catalog. By comparing our method with known algorithms that operate both in the time and frequency domain, we show that our proposed method performs better in the case of the FORGE injection monitoring, and equally well for the off-array aftershock sequence. Our new method has the potential to improve microseismic event detections even in extremely noisy environments, and the proposed location scheme serves as a direct discriminant between true and false detections.

Geochemistry & Geophysics↗
DOE OSTI2019

Global- and Local-Scale High-Resolution Event Catalogs for Algorithm Testing

During the development of new seismic data processing methods, the verification of potential events and associated signals can present a nontrivial obstacle to the assessment of algorithm performance, especially as detection thresholds are lowered, resulting in the inclusion of significantly more anthropogenic signals. Here, we present two 14 day seismic event catalogs, a local–scale catalog developed using data from the University of Utah Seismograph Stations network, and a global–scale catalog developed using data from the International Monitoring System. Each catalog was built manually to comprehensively identify events from all sources that were locatable using phase arrival timing and directional information from seismic network stations, resulting in significant increases compared to existing catalogs. Here, the new catalogs additionally contain challenging event sequences (prolific aftershocks and small events at the detection and location threshold) and novel event types and sources (e.g., infrasound only events and long–wall mining events) that make them useful for algorithm testing and development, as well as valuable for the unique tectonic and anthropogenic event sequences they contain.

58 GEOSCIENCES↗
DOE OSTI2021

Optimizing Mu2e Spill Regulation System Algorithms

A slow extraction system is being developed for the Fermilab’s Delivery Ring to deliver protons to the Mu2e experiment. During the extraction, the beam on target experiences small intensity variations owing to many factors. Various adaptive learning algorithms will be employed for beam regulation to achieve the required spill quality. We discuss here preliminary results of the slow and fast regulation algorithms validation through the computer simulations before their implementation in the FPGA. Particle tracking with sextupole resonance was used to determine the fine shape of the spill profile. Fast semi-analytical simulation schemes and Machine Learning models were used to optimize the fast regulation loop.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

First SELAP Algorithm Operational Experience of the New LLRF 3.0 RF Control System

The JLAB LLRF 3.0 system has been developed and is replacing the 30-year-old LLRF systems in the CEBAF accelerator. The LLRF system builds upon 25 years of design and operational RF control experience (digital and analog), and our recent collaboration in the design of the LCLSII LLRF system. The new system also incorporates a cavity control algorithm using a fully functional phase and amplitude locked Self Exciting Loop (SELAP). The first system (controlling 8 cavities) was installed and commissioned in August of 2021. Since then the new LLRF system has been operating with cavity gradients up to 20 MV/m, and electron beam currents up to 350 uA. This paper discusses the operational experience of the LLRF 3.0 SELAP algorithm along with other software and firmware tools like cavity and klystron characterization and quench detection.

Plawski, T. E.↗
DOE OSTI2022

Grid-tied Multilevel Inverter with Phase-locked Loop Algorithm

A multilevel inverter is an electronic device capable of changing direct current energy to alternant current energy with a voltage and frequency established by the user. They are ideal for connecting renewable energy sources to the AC grid, energy plants, and smart grids. The voltage must be balanced and synchronized with the electrical network for adequate performance. This paper shows the voltage synchronization between an inverter output voltage and the AC grid using a phase-locked loop based on an adaptive observer. The proposed algorithm can perform under grid uncertainties such as noise and generates a reference signal for the modulation used in the inverter. The algorithm is robust and computationally efficient and can be implemented through basic elements such as operational amplifiers, resistors, and capacitors, reducing its difficulty in executing it in a system.

42 ENGINEERING↗
DOE OSTI2017

A single-stage flux-corrected transport algorithm for high-order finite-volume methods

We present a new limiter method for solving the advection equation using a high-order, finite-volume discretization. The limiter is based on the flux-corrected transport algorithm. Here, we modify the classical algorithm by introducing a new computation for solution bounds at smooth extrema, as well as improving the preconstraint on the high-order fluxes. We compute the high-order fluxes via a method-of-lines approach with fourth-order Runge-Kutta as the time integrator. For computing low-order fluxes, we select the corner-transport upwind method due to its improved stability over donor-cell upwind. Several spatial differencing schemes are investigated for the high-order flux computation, including centered- difference and upwind schemes. We show that the upwind schemes perform well on account of the dissipation of high-wavenumber components. The new limiter method retains high-order accuracy for smooth solutions and accurately captures fronts in discontinuous solutions. Further, we need only apply the limiter once per complete time step.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A path integral ground state Monte Carlo algorithm for entanglement of lattice bosons

A ground state path integral quantum Monte Carlo algorithm is introduced that allows for the study of entanglement in lattice bosons at zero temperature. The Rényi entanglement entropy between spatial subregions is explored across the phase diagram of the one dimensional Bose-Hubbard model for systems consisting of up to L=256 L = 256 sites at unit-filling without any restrictions on site occupancy, far beyond the reach of exact diagonalization. The favorable scaling of the algorithm is demonstrated through a further measurement of the Rényi entanglement entropy at the two dimensional superfluid-insulator critical point for large system sizes, confirming the existence of the expected entanglement boundary law in the ground state. The Rényi estimator is extended to measure the symmetry resolved entanglement that is operationally accessible as a resource for experimentally relevant lattice gases with fixed total particle number.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗