Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative methods”

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 703 records · Page 39

Automated Gold Nanorod Spectral Morphology Analysis Pipeline

The development of a colloidal synthesis procedure to produce nanomaterials with high shape and size purity is often a time-consuming, iterative process. This is often due to quantitative uncertainties in the required reaction conditions and the time, resources, and expertise intensive characterization methods required for quantitative determination of nanomaterial size and shape. Absorption spectroscopy is often the easiest method for colloidal nanomaterial characterization. However, due to the lack of a reliable method to extract nanoparticle shapes from absorption spectroscopy, it is generally treated as a more qualitative measure for metal nanoparticles. This work demonstrates a gold nanorod (AuNR) spectral morphology analysis tool, called AuNR-SMA, which is a fast and accurate method to extract quantitative structural information from colloidal AuNR absorption spectra. To demonstrate the practical utility of this model, we apply it to three distinct applications. First, we demonstrate this model's utility as an automated analysis tool in a high-throughput AuNR synthesis procedure by generating quantitative size information from optical spectra. Second, we use the predictions generated by this model to train a machine learning model to predict the resulting AuNR size distributions under specified reaction conditions. Third, we apply this model to spectra extracted from the literature where no size distributions are reported and impute unreported quantitative information on AuNR synthesis. This approach can potentially be extended to any other nanocrystal system where absorption spectra are size dependent, and accurate numerical simulation of absorption spectra is possible. In addition, this pipeline could be integrated into automated synthesis apparatuses to provide interpretable data from simple measurements, help explore the synthesis science of nanoparticles in a rational manner, or facilitate closed-loop workflows.

36 MATERIALS SCIENCE↗

Deblending galaxies with variational autoencoders: A joint multiband, multi-instrument approach

ABSTRACT Blending of galaxies has a major contribution in the systematic error budget of weak-lensing studies, affecting photometric and shape measurements, particularly for ground-based, deep, photometric galaxy surveys, such as the Rubin Observatory Legacy Survey of Space and Time (LSST). Existing deblenders mostly rely on analytic modelling of galaxy profiles and suffer from the lack of flexible yet accurate models. We propose to use generative models based on deep neural networks, namely variational autoencoders (VAE), to learn probabilistic models directly from data. We train a VAE on images of centred, isolated galaxies, which we reuse, as a prior, in a second VAE-like neural network in charge of deblending galaxies. We train our networks on simulated images including six LSST bandpass filters and the visible and near-infrared bands of the Euclid satellite, as our method naturally generalizes to multiple bands and can incorporate data from multiple instruments. We obtain median reconstruction errors on ellipticities and r-band magnitude between ±0.01 and ±0.05, respectively, in most cases, and ellipticity multiplicative bias of 1.6 per cent for blended objects in the optimal configuration. We also study the impact of decentring and prove the method to be robust. This method only requires the approximate centre of each target galaxy, but no assumptions about the number of surrounding objects, pointing to an iterative detection/deblending procedure we leave for future work. Finally, we discuss future challenges about training on real data and obtain encouraging results when applying transfer learning.

Arcelin, Bastien↗

Inversion of Many-Beam Bragg Intensities for Phasing by Iterated Projections: Removal of Multiple Scattering Artifacts from Diffraction Data

An iterated projection algorithm (N-Phaser) is developed that reconstructs a scattering potential from N-beam multiple Bragg scattered intensities. The method may be used to eliminate multiple scattering artifacts from electron diffraction data, solving the phase problem and increasing the thicknesses of samples used in materials science, solid-state chemistry, and small molecule crystallography. For high-energy transmission electron diffraction, we show that the algorithm recovers accurate complex structure factors from a wide range of thicknesses, orientations, and relativistic beam energies, and does not require known thickness or atomic-resolution data if sufficient multiple scattering occurs. Furthermore, extensions to Cryo-electron microscopy and Micro-electron diffraction are suggested.

36 MATERIALS SCIENCE↗

A Theoretical Approach for Reliability Within Information Supply Chains With Cycles and Negations

Complex networks of information processing systems, or information supply chains, present challenges for performance analysis. Here, we establish a mathematical setting, in which a process within an information supply chain can be analyzed in terms of the functionality of the system’s components. Principles of this methodology are rigorously defended and induce a model for determining the reliability for the various products in these networks. Our model does not limit us from having cycles in the network, as long as the cycles do not contain negation. It is shown that our approach to reliability resolves the nonuniqueness caused by cycles in a probabilistic Boolean network. An iterative algorithm is given to find the reliability values of the model, using a process that can be fully automated. This automated method of discerning reliability is beneficial for systems managers. As a systems manager considers systems modification, such as the replacement of owned and maintained hardware systems with cloud computing resources, the need for comparative analysis of system reliability is paramount. The model is extended to handle conditional knowledge about the network, allowing one to make predictions of weaknesses in the system. Finally, to illustrate the model’s flexibility over different forms, it is demonstrated on a system of components and subcomponents.

97 MATHEMATICS AND COMPUTING↗

Targeted rRNA depletion enables efficient mRNA sequencing in diverse bacterial species and complex co-cultures

Bacterial mRNA sequencing is inefficient due to the abundance of ribosomal RNA that is challenging to deplete. While commercial kits target rRNA from common bacterial species, they are frequently inefficient when applied to divergent species, including those from environmental isolates. Similarly, other methods typically employ large probe sets that tile the entire length of rRNAs; however, such approaches are infeasible when applied to many species. Therefore, we present EMBR-seq+, which requires fewer than 10 oligonucleotides per rRNA by combining rRNA blocking primers with RNase H-mediated depletion to achieve rRNA removal efficiencies of up to 99% in diverse bacterial species. Furthermore, in more complex microbial co-cultures between Fibrobacter succinogenes strain UWB7 and anaerobic fungi, EMBR-seq+ depleted both bacterial and fungal rRNA, with a fourfold improvement in bacterial rRNA depletion compared with a commercial kit, thereby demonstrating that the method can be applied to non-model microbial mixtures. Notably, for microbes with unknown rRNA sequences, EMBR-seq+ enables rapid iterations in probe design without requiring to start experiments from total RNA. Finally, efficient depletion of rRNA enabled systematic quantification of the reprogramming of the bacterial transcriptome when cultured in the presence of the anaerobic fungi Anaeromyces robustus or Caecomyces churrovis. We observed that F. succinogenes strain UWB7 downregulated several lignocellulose-degrading carbohydrate-active enzymes in the presence of anaerobic gut fungi, suggesting close interactions between two cellulolytic species that specialize in different aspects of biomass breakdown. Thus, EMBR-seq+ enables efficient, cost-effective, and rapid quantification of the transcriptome to gain insights into non-model microbial systems.

59 BASIC BIOLOGICAL SCIENCES↗

Field To Farm Aggregation For Agricultural Systems

The Fields to Farms methodology illustrates the generation of farm parcels from the Crop Data Layer (CDL), a raster dataset containing 133 categories representing various crop types and land uses. This methodology involves two primary steps: Field Delineation and Farm Aggregation. The code specifically addresses the aggregation of pre-delineated fields within a county to form farms, adhering to predefined criteria for farm size categories. It is assumed that the field delineation process, which involves creating vector polygons from CDL raster, has been completed beforehand, possibly through external tools or methods. Upon initialization, the script processes county-level fields, preparing them for farm aggregation. In the Farm Aggregation phase, the code iteratively combines delineated fields into farms based on specified criteria, continuing until the aggregated farm size meets predefined thresholds derived from data from the 2017 National Agricultural Statistics Service (NASS) census. Throughout this iterative process, the script dynamically adjusts the aggregation to ensure alignment with the desired distribution reported by NASS. The resulting output of the script is a GeoDataFrame containing classified farms, which are subsequently saved as GeoPackage files. These files enable further analysis and visualization, facilitating comprehensive exploration of the farm landscape generated through the methodology.

Paudel, Rajiv [Idaho National Laboratory (INL), Id↗

Cost-optimized Automated Variance Reduction for Highly Angle-dependent Radiation Transport Analyses [Dissertation]

Monte Carlo variance-reduction techniques that directly bias particle direction have historically received limited attention despite being useful for many radiation transport applications such as those in which radiation travels through large regions with a low probability of colliding. One such technique is known as DXTRAN (short for deterministic transport) in the MCNP Monte Carlo radiation transport code. Until now, effectively applying DXTRAN in calculations is largely based on empirical observations of computational performance. Optimal DXTRAN parameters are identified through manual iteration. This work develops new mathematical descriptions of the DXTRAN variance-reduction process and demonstrates a new automated variance-reduction method that applies these mathematical formulations to determine the optimal application of DXTRAN in a given problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Similarity Downselection: Finding the n Most Dissimilar Molecular Conformers for Reference-Free Metabolomics

Computational methods for creating in silico libraries of molecular descriptors (e.g., collision cross sections) are becoming increasingly prevalent due to the limited number of authentic reference materials available for traditional library building. These so-called “reference-free metabolomics” methods require sampling sets of molecular conformers in order to produce high accuracy property predictions. Due to the computational cost of the subsequent calculations for each conformer, there is a need to sample the most relevant subset and avoid repeating calculations on conformers that are nearly identical. The goal of this study is to introduce a heuristic method of finding the most dissimilar conformers from a larger population in order to help speed up reference-free calculation methods and maintain a high property prediction accuracy. Finding the set of the n items most dissimilar from each other out of a larger population becomes increasingly difficult and computationally expensive as either n or the population size grows large. Because there exists a pairwise relationship between each item and all other items in the population, finding the set of the n most dissimilar items is different than simply sorting an array of numbers. For instance, if you have a set of the most dissimilar n = 4 items, one or more of the items from n = 4 might not be in the set n = 5. An exact solution would have to search all possible combinations of size n in the population exhaustively. We present an open-source software called similarity downselection (SDS), written in Python and freely available on GitHub. SDS implements a heuristic algorithm for quickly finding the approximate set(s) of the n most dissimilar items. We benchmark SDS against a Monte Carlo method, which attempts to find the exact solution through repeated random sampling. We show that for SDS to find the set of n most dissimilar conformers, our method is not only orders of magnitude faster, but it is also more accurate than running Monte Carlo for 1,000,000 iterations, each searching for set sizes n = 3–7 out of a population of 50,000. We also benchmark SDS against the exact solution for example small populations, showing that SDS produces a solution close to the exact solution in these instances. Using theoretical approaches, we also demonstrate the constraints of the greedy algorithm and its efficacy as a ratio to the exact solution.

97 MATHEMATICS AND COMPUTING↗

Optimal Control of the Energy-Saving Hybrid Hydraulic-Electric Architecture (HHEA) for Off-Highway Mobile Machines

Most off-highway constructions and agriculture equipment use hydraulics, which has unmatched power density, for power transmission and throttling as a means for control. A novel hybrid hydraulic-electric architecture (HHEA) has recently been proposed to improve efficiency for high-power machines that would have been cost-prohibitive to electrify directly. HHEA uses a set of common pressure rails (CPRs) to transmit the majority of power hydraulically and small electric motor drives to modulate that power and to achieve precise control. This article proposes a computationally efficient Lagrange multiplier method (LMM) for computing the optimal sequence of pressure rail selections to minimize energy use. This is needed to evaluate HHEA's energy-saving potential and for iterative architecture design and sizing. An interesting complication is that the cost function is not fully defined until the candidate control sequence is fully specified. This issue is dealt with by decomposing the original problem into a set of sub-problems with additional constraints that can be solved efficiently. Computational effort can be further reduced if actuators are optimized individually instead of together. However, additional steps are required to prevent the constraint functions from becoming discontinuous with respect to the Lagrange multipliers, which is necessary for meeting the constraints. Lastly, a case study of a construction machine demonstrates the efficacy of the method and shows that the HHEA reduces energy consumption by 68%-73% compared to the baseline load-sensing architecture.

Lagrange multiplier↗

Characterization of the GEM chambers for the SBS/BB Front Tracker at JLAB HallA

The present thesis discusses the main aspects and results of the ongoing SBS-GEM development, production and test, according to the following structure: - In chapter 1 the theoretical and experimental importance of nucleon electromagnetic form factors is described. Furthermore, the discrepancy of ep scattering data obtained about the FFs ratio between the Rosenbluth separation method and the polarization transfer method is highlighted and, therefore, the Super Bigbite Program at JLab is introduced. - In chapter 2 the experimental apparatus of the SBS project is described, focusing on the main components of the spectrometers involved; the Super Bigbite Spectrometer for the hadron arm and the BigBite spectrometer for the electron arm. - Chapter 3 describes the SBS/BB front tracker and the motivation on the GEM technology choice. In addition, the main features and advantages of the technology used are also described. - Chapter 4 describes the commissioning of the GEM trackers at JLab. The whole iter of the GEM modules is presented, from the assembly in clean-room to the characterization tests with cosmic rays performed at JLab. - In chapter 5 a new method of analyzing the signals extracted from the strips of GEM modules is introduced. This study goal is the real-time suppression of noisy data by mean of innovative A.I. techniques.

Re, Leonard Giuseppe↗

Modifying Network Guided Vehicle for Repeatable EcoCAR ACC Energy Testing

The newest iteration of the Department of Energy (DOE) Advanced Vehicle Technology Competitions is the EcoCAR Mobility Challenge. In this paper, ANL and HORIBA MIRA collaborate to propose and pilot a test method that enables controlled, repeatable track-based energy consumption testing of semi-autonomous features. The testing was performed at MIRA’s proving ground facility in Nuneaton, UK, using their Network Guided Vehicle (NGV) connectivity and automation test platform. The NGV served as a repeatable lead vehicle following prescribed drive traces around two different track circuits while the host vehicle under test, a Honda Civic with full speed range Adaptive Cruise Control, followed behind. Over the course of a two day test, multiple iterations of certification and custom EPA drive traces were performed on track, demonstrating the viability of a two vehicle energy test. Results were analyzed to assess NGV lead vehicle performance in following the prescribed cycle using SAE J2951 standard calculations in an effort to quantify how repeatably and accurately the lead vehicle followed the trace. Host vehicle energy consumption was assessed using both vehicle CAN bus monitoring and an on-board fuel flow meter.

ACC↗

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗

Meshfree Multiphysics Damage Modeling of Li-ion Battery Materials

Through repeated charging and discharging cycles, the electrodes of a Li-ion battery experience significant swelling and contraction due to the movement of lithium, also known as intercalation. This research focuses specifically on the chemo-mechanical cracking in the cathode. Because cathode particles are comprised of many randomly-oriented grains, which have highly anisotropic material properties, the expansion and contraction is very non-uniform. As a result, stress concentrations tend to form between grains, which necessitates the modeling of crack propagation largely along grain boundaries and material interfaces. Chemo-mechanical damage models are generally simulated by one of two methods: the cohesive zone model (CZM) and the continuous damage model (CDM). The CZM is more accurate at capturing the sharp discontinuities of a crack but is very computationally expensive and intractable for large-scale models as a result. Conversely, the CDM is easily computed but not well-suited to easily allow for discontinuous field variables, which are inherent across a crack. This study aims to improve the CDM's ability to capture discontinuous cracks. Current versions of the CDM use the finite element method (FEM), which is one of the most widely used approaches for spatial discretization. This research investigates the use of the Reproducing Kernel Particle Method (RKPM), a meshfree method, for spatial discretization and aims to achieve a coupled chemo-mechanical crack propagation model that enhances accuracy while maintaining high computational efficiency. This model features a fully coupled, iterative electrochemistry solution, which informs the meshfree damage model of impending crack formation. To gain a better understanding of how the meshfree model compares to the current FEM model in capturing cathode crack propagation, further investigation is needed.

damage modeling↗

Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis

Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier analysis is that it can be used to minimize an estimate of the spectral radius of a stationary iteration, or the condition number of a preconditioned system, in terms of a symbol representation of the algorithm. In practice, this is a “minimax” problem, minimizing with respect to solver parameters the appropriate measure of work, which involves maximizing over the Fourier frequency. Often, several algorithmic parameters may be determined by local Fourier analysis in order to obtain efficient algorithms. Analytical solutions to minimax problems are rarely possible beyond simple problems; the status quo in local Fourier analysis involves grid sampling, which is prohibitively expensive in high dimensions. In this paper, we propose and explore optimization algorithms to solve these problems efficiently. Finally, several examples, with known and unknown analytical solutions, are presented to show the effectiveness of these approaches.

97 MATHEMATICS AND COMPUTING↗

Application of automated iterative target detection for standoff hyperspectral imaging

The utility of hyperspectral imaging (HSI) has been well established for a wide array of applications but has generated a need for automated screening of high volumes of large HSI cubes. We report two important automated algorithms for more efficient standoff processing: atmospheric correction and target detection. The atmospheric correction method is based on a fast asymmetric least squares approach that is applied on a pixel-by-pixel basis. Here, the correction can be applied to entire images without manually identifying regions of interest and utilizes only in-scene information, no ancillary modeling of the atmosphere is required. An iterative target detection approach is also introduced which demonstrates faster speeds relative to moving window approaches. The target detection algorithm classifies each pixel as true target detections, near target detections, clutter, and no-calls. The algorithms were tested on forty images of twenty-two solid mineral targets placed at a 14-meter standoff distance allowing general observations on expected detection performance for a variety of minerals. In addition to identifying anomalous pixels, the inclusion of “no-calls” reduced the number of false detections significantly.

47 OTHER INSTRUMENTATION↗

Initial Exploration of the Use of Mixed Precision in Iterative Solvers (B639388 Subcontract Quarter I Report)

The first quarter of the project was primarily spent identifying potential projects at the intersection of finite precision analysis, mixed precision computation, and Krylov subspace methods. We summarize our findings in the remainder of the document. Other activities include attending biweekly xSDK meetings as well as contributing material to the technical report and journal versions of the multiprecision landscape paper. The subsequent quarter will be spent selecting a subset of the described projects to focus on, performing initial numerical experiments to evaluate the potential for the use of mixed precision, and developing initial theoretical analysis.

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↗

Retrieval of energy spectra for all flavours of neutrinos from core-collapse supernova with multiple detectors

ABSTRACT We present a new method by which to retrieve energy spectrum for all falvours of neutrinos from core-collapse supernova (CCSN). In the retrieval process, we do not assume any analytic formulas to express the energy spectrum of neutrinos but rather take a direct way of spectrum reconstruction from the observed data; the singular value decomposition algorithm with a newly developed adaptive energy-gridding technique is adopted. We employ three independent reaction channels having different flavour sensitivity to neutrinos. Two reaction channels, inverse beta decay on proton and elastic scattering on electrons, from a water Cherenkov detector such as Super-Kamiokande (SK) and Hyper-Kamiokande (HK), and a charged current reaction channel with Argon from the Deep Underground Neutrino Experiment (DUNE) are adopted. Given neutrino oscillation models, we iteratively search the neutrino energy spectra at the CCSN source until they provide the consistent event counts in the three reaction channels. We test the capability of our method by demonstrating the spectrum retrieval to a theoretical neutrino data computed by our recent three-dimensional CCSN simulation. Although the energy spectrum with either electron-type or electron-type antineutrinos at the CCSN source has relatively large error compared to that of other species, the joint analysis with HK + DUNE or SK + DUNE will provide precise energy spectrum of all flavours of neutrinos at the source. Finally, we discuss perspectives for improvements of our method by using neutrino data of other detectors.

79 ASTRONOMY AND ASTROPHYSICS↗