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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

An iterative learning and inference approach to managing dynamic cyber-vulnerabilities of complex systems

As modern systems become increasingly reliant on cyber-technologies and continue to be integrated with physical systems, managing risks from deliberate and non-deliberate sources is a significant research challenge. Unlike strictly physical systems, cyber-enabled physical systems are influenced by dynamic and evolving technologies, environments, and attack mechanisms. As a result, vulnerabilities are rapidly changing and difficult to detect and manage. While there is recent interest in the dynamic properties of performance through resilience analysis, limited research addresses the dynamic nature of cyber-system vulnerability. This paper presents a dynamic iterative learning approach to evaluate the state of health for systems as related to cyber-vulnerabilities. These time-varying system health characteristics may not be visible, but can be inferred using observable characteristics. The approach recognizes that multiple types of vulnerabilities need to be included in a holistic system health assessment. The methods are applied to the Common Vulnerability Scoring System database containing over 100,000 documented cybersecurity vulnerabilities. This work is the first to acknowledge the dynamic properties of cyber-vulnerability, while also inferring system health using observable data and hidden states of system health. This work will be of interest to managers of large-scale cyber-enabled physical systems who are seeking to prioritize system health investments.

Chatterjee, Samrat↗
DOE OSTI2024

Multi‐Scale Seismic Imaging of the Ridgecrest, CA, Region With Waveform Inversion of Regional and Dense Array Data

Abstract We develop an inversion procedure for deriving multi‐scale velocity models with waveform inversions of earthquake and ambient noise data at multi‐frequency bands recorded by regional and dense sensor configurations. The method is applied for the area around the 2019 Ridgecrest earthquake rupture zones, utilizing data recorded by regional stations and dense 2D and 1D arrays with station spacings of ∼5 km and ∼100 m, respectively. Starting with regional Vp, Vs models and locations of Ridgecrest aftershocks, the velocity models and event locations are improved iteratively by inversions of waveforms recorded by regional stations and the 2D array, using a minimum spectral element size of ∼600 m. Waveforms from local events recorded by dense 1D arrays across the M7.1 rupture zone with frequencies of up to 10 Hz are used to resolve small‐scale features of the rupture zone and shallow crust with a local spectral element size of 80 m. The refined models provide self‐consistent descriptions of the rupture zone and the shallow crust embedded in the regional structures. The results reveal pronounced low Vs and high Vp/Vs in the M6.4 and M7.1 rupture zones coinciding with concentrations of seismicity, and also around the Garlock fault and in several local basins. We also observe clear velocity contrasts across the Garlock fault with polarity reversals along strike and with depth. The obtained multi‐scale velocity models can be used to improve derivations of earthquake source properties, simulations of dynamic ruptures and ground motions, and the understanding of fault and tectonic processes in the region.

Geochemistry & Geophysics↗
DOE OSTI2023

Solving multiphysics-based inverse problems with learned surrogates and constraints

Abstract Solving multiphysics-based inverse problems for geological carbon storage monitoring can be challenging when multimodal time-lapse data are expensive to collect and costly to simulate numerically. We overcome these challenges by combining computationally cheap learned surrogates with learned constraints. Not only does this combination lead to vastly improved inversions for the important fluid-flow property, permeability, it also provides a natural platform for inverting multimodal data including well measurements and active-source time-lapse seismic data. By adding a learned constraint, we arrive at a computationally feasible inversion approach that remains accurate. This is accomplished by including a trained deep neural network, known as a normalizing flow, which forces the model iterates to remain in-distribution, thereby safeguarding the accuracy of trained Fourier neural operators that act as surrogates for the computationally expensive multiphase flow simulations involving partial differential equation solves. By means of carefully selected experiments, centered around the problem of geological carbon storage, we demonstrate the efficacy of the proposed constrained optimization method on two different data modalities, namely time-lapse well and time-lapse seismic data. While permeability inversions from both these two modalities have their pluses and minuses, their joint inversion benefits from either, yielding valuable superior permeability inversions and CO 2 plume predictions near, and far away, from the monitoring wells.

Yin, Ziyi (ORCID:0000000250248771)↗
DOE OSTI2025

Construction of approximate invariants for non-integrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for non integrable Hamiltonian dynamical systems, and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps in the form of a square matrix, AIs can be constructed order-by-order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Review of recent activities with MOOSE, an open-source finite element & finite volume multi-fidelity simulation framework

Modeling and simulation are an increasing part of engineering. This is undoubtedly driven by the high costs of constructing experimental facilities, but also enabled by the exponential increase in computing powers over the last decades, which allows computational models to be closer than ever to reality. One of the main drivers for the development of MOOSE is supporting advanced nuclear reactor simulations. A challenging aspect of modeling advanced nuclear reactors is the plurality of physics involved, including neutronics, thermal hydraulics and fuel performance. These physics are all coupled to some extent and are generally solved in a sequential but iterative fashion. The United States (U.S.) national laboratories have been developing MOOSE, an open source multiphysics framework since its inception at the Idaho National Laboratory (INL) in 2008. This framework enables seamless coupling of multiphysics simulations and facilitates the implementation of new physics and material governing laws. It is continuously expanded with novel numerical methods and new pre-implemented physics module. Numerous applications, developed within the Department of Energy (DOE) laboratories, academia, and industry, including outside of nuclear engineering, have been developed to study specialized physics problems. International collaborations are welcome on this open-source modeling and simulation project.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Increased accuracy and signal-to-noise ratio through recent improvements in infra-red video bolometer fabrication and calibration

The infra-red video bolometer (IRVB) is a diagnostic equipped with an infra-red camera that measures the total radiated power in thousands of lines of sight within a large field of view. Recently validated in MAST-U [Fderici et al., Rev. Sci. Instrum. 94, 033502 (2023)], it offers a high spatial resolution map of the radiated power in the divertor region, where large gradients are expected. The IRVB’s sensing element comprises a thin layer of high Z absorbing material, typically platinum, usually coated with carbon to reduce reflections [Peterson et al., Rev. Sci. Instrum. 79, 10E301 (2008)].Here, the possibility of using a relatively inert material such as titanium, is explored that can be produced in layers up to 1 μm compared to 2.5 μm for Pt and then coat it with Pt of the desired thickness (0.3 μm per side here) and carbon. This leads to a higher temperature signal (about 3 times) and better spatial resolution (about 4 times), resulting in higher accuracy in the measured power [Peterson et al., Rev. Sci. Instrum. 79, 10E301 (2008)]. This assembly is also expected to improve foil uniformity, as the Pt layer is obtained via deposition rather than mechanical processes [Mukai et al., Rev. Sci. Instrum. 87, 2014 (2016)].Given its multi-material composition, measuring the thermal properties of the foil assembly is vital. Various methods using a calibrated laser as a heat source have been developed, analyzing the temperature profile shape [Sano et al., Plasma and Fusion Res. 7, 2405039 (2012)] and [Mukai et al., Rev. Sci. Instrum. 89, 10E114 (2018)] or fitting the calculated laser power for different intensities and frequencies [Fderici et al., Rev. Sci. Instrum. 94, 033502 (2023)]. Here, a simpler approach is presented, which relies on analyzing the separate components of the foil heat equation for a single laser exposure in a given area. This can then be iterated over the entire foil to capture local deviations.

Magnetic Fusion Energy↗
DOE OSTI2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Merging the computational design of chimeric type I polyketide synthases with enzymatic pathways for chemical biosynthesis

Synthetic biology offers the promise of manufacturing chemicals more sustainably than petrochemistry. Yet, both the rate at which biomanufacturing can synthesize these molecules and the net chemical accessible space are limited by existing pathway discovery methods, which can often rely on arduous literature searches. Here, we introduce BioPKS pipeline, an automated retrobiosynthesis tool combining multifunctional type I polyketide synthases (PKSs) and monofunctional enzymes via two complementary tools: RetroTide and DORAnet. Monofunctional enzymes are valuable for carefully decorating a substrate’s carbon backbone while PKSs are unique in their ability to iteratively catalyze carbon-carbon bond formation reactions, thereby expanding carbon backbones in a predictable fashion. We evaluate the performance of BioPKS pipeline using a previously reported set of 155 biomanufacturing candidates, achieving exact synthetic designs for 93 compounds and generating chemically similar pathways for most remaining targets. Furthermore, BioPKS pipeline can propose pathways for the complex therapeutic natural products cryptofolione and basidalin.

Chainani, Yash↗
DOE OSTI2020

Extended Lagrangian Born–Oppenheimer molecular dynamics using a Krylov subspace approximation

It is shown how the electronic equations of motion in extended Lagrangian Born–Oppenheimer molecular dynamics simulations can be integrated using low-rank approximations of the inverse Jacobian kernel. This kernel determines the metric tensor in the harmonic oscillator extension of the Lagrangian that drives the evolution of the electronic degrees of freedom. The proposed kernel approximation is derived from a pseudoinverse of a low-rank estimate of the Jacobian, which is expressed in terms of a generalized set of directional derivatives with directions that are given from a Krylov subspace approximation. The approach allows a tunable and adaptive approximation that can take advantage of efficient preconditioning techniques. The proposed kernel approximation for the integration of the electronic equations of motion makes it possible to apply extended Lagrangian first-principles molecular dynamics simulations to a broader range of problems, including reactive chemical systems with numerically sensitive and unsteady charge solutions. This can be achieved without requiring exact full calculations of the inverse Jacobian kernel in each time step or relying on iterative non-linear self-consistent field optimization of the electronic ground state prior to the force evaluations as in regular direct Born–Oppenheimer molecular dynamics. We note the low-rank approximation of the Jacobian is directly related to Broyden’s class of quasi-Newton algorithms and Jacobian-free Newton–Krylov methods and provides a complementary formulation for the solution of nonlinear systems of equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Radiation Mapping for an Unmanned Aerial Vehicle: Development and Simulated Testing of Algorithms for Source Mapping and Navigation Path Generation

Image reconstruction algorithms were developed for radiation source mapping and used for generating the search path of a moving radiation detector, such as one onboard an unmanned aerial vehicle. Simulations consisted of first assuming radioactive sources of varying complexity and estimating the radiation fields that would then be produced by that source distribution. Next, the "measurements" that would result from a pair of adjacent spatial locations were computed. A crude estimate of the source distribution likely to have produced such "measurements" was reconstructed based upon the limited measurements. Location of the next "measurement" was then determined as halfway between the location of the estimated source and the current "measurement." With each additional sample, improved source distribution reconstructions were made and used to inform the immediate direction of detector motion. Source reconstruction or mapping was formulated as an inverse problem solved with either maximum a posteriori or least squares (LS) regression deconvolution methods. Different amounts of noise were added to the simulated "measurements," allowing evaluation of the methods' performances as functions of signal-to-noise ratio of the measured map. As expected, methods that promote sparsity were better suited in reconstructing point sources. Reliable prior information of the source distribution also improved the reconstruction results, especially with distributed sources. With a non-negative least square algorithm and the suggested paths it generated, location of sources was successfully estimated to an accuracy of 0.014 m within nine iterations in a single-source scenario and 12 iterations in a two-source scenario, given a 10% error on the integrated counts and a Poisson distribution of the noise associated with the measured counts.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2020

Developing an Active Learning algorithm for learning Bayesian classifiers under the Multiple Instance Learning scenario

In the Multiple Instance Learning scenario, the training data consists of instances grouped into bags, and each bag is labelled with whether it is positive, i.e. contains at least one positive instance. First, Active Learning, in which additional labels can be iteratively requested, has the potential to allow more accurate classifiers to be learned with less labels. Active Learning has been applied to the Multiple Instance Learning under two settings: when bag labels of unlabelled bags can be requested, and when instance labels within bags known to be positive can be requested. Second, Bayesian Active learning methods have the potential to learn accurate classifiers with few labels, because they explicitly track the classifier uncertainty and can thus address its knowledge gaps. Yet, there does not exist any Bayesian Active Learning method for the Multiple Instance Learning Scenario. In this work, we develop the first such method. We develop a Bayesian classifier for the Multiple Instance Learning scenario, show how it can be efficiently used for Bayesian Active Learning, and perform experiments assessing its performance. While its performance exceeds that when no Active Learning is used, it is sometimes better, sometimes worse than the naive baseline of uncertainty sampling, depending on the situation. This suggests future work: building more customizable Bayesian Active Learning methods for the Multiple Instance Scenario, customizable to whether bag or instance label accuracy is targeted, and the labeling budget.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

High-Throughput Microfluidic Electroporation (HTME): A Scalable, 384-Well Platform for Multiplexed Cell Engineering

Electroporation-mediated gene delivery is a cornerstone of synthetic biology, offering several advantages over other methods: higher efficiencies, broader applicability, and simpler sample preparation. Yet, electroporation protocols are often challenging to integrate into highly multiplexed workflows, owing to limitations in their scalability and tunability. These challenges ultimately increase the time and cost per transformation. As a result, rapidly screening genetic libraries, exploring combinatorial designs, or optimizing electroporation parameters requires extensive iterations, consuming large quantities of expensive custom-made DNA and cell lines or primary cells. To address these limitations, we have developed a High-Throughput Microfluidic Electroporation (HTME) platform that includes a 384-well electroporation plate (E-Plate) and control electronics capable of rapidly electroporating all wells in under a minute with individual control of each well. Fabricated using scalable and cost-effective printed-circuit-board (PCB) technology, the E-Plate significantly reduces consumable costs and reagent consumption by operating on nano to microliter volumes. Furthermore, individually addressable wells facilitate rapid exploration of large sets of experimental conditions to optimize electroporation for different cell types and plasmid concentrations/types. Use of the standard 384-well footprint makes the platform easily integrable into automated workflows, thereby enabling end-to-end automation. We demonstrate transformation of E. coli with pUC19 to validate the HTME's core functionality, achieving at least a single colony forming unit in more than 99% of wells and confirming the platform's ability to rapidly perform hundreds of electroporations with customizable conditions. This work highlights the HTME's potential to significantly accelerate synthetic biology Design-Build-Test-Learn (DBTL) cycles by mitigating the transformation/transfection bottleneck.

Gaillard, William R↗
DOE OSTI2021

Automatic method of material identification for computed tomography

A method is provided for isolating and labeling discrete features in a spectral radiographic image recorded as a set of images in different energy channels. The disclosed method involves creating a profile for each of at least some pixels in the spectral radiographic image. The profiles are sequences of pixel values, in which each pixel value is a photon count or a similar radiographic exposure value indicative of the attenuation of a portion of the scanning beam in a respective energy channel. Iterative hierarchical clustering is used to cluster the pixels on the basis of their respective profiles. Labels are assigned to one or more of the resulting clusters. In implementations, each label can be associated with an inferred material composition or with an inference that the material composition is unknown.

Jimenez, Jr., Edward Steven↗
DOE OSTI2020

A hybrid calibration approach to Hertz-type contact parameters for discrete element models

This study aims at providing a hybrid calibration framework to estimate Hertz-type contact parameters (particle-scale shear modulus and Poisson ratio) for both two-dimensional and three-dimensional discrete element modelling (DEM). On the basis of statistically isotropic granular packings, a set of analytical formulae between macroscopic material parameters (Young modulus and Poisson ratio) and particle-scale Hertz-type contact parameters for granular systems are derived under small-strain isotropic stress conditions. However, the derived analytical solutions are only estimated values for general models. By viewing each DEM modelling as an implicit mathematical function taking the particle-level parameters as independent variables and employing the derived analytical solutions as the initial input parameters, an automatic iterative scheme is proposed to obtain the calibrated parameters with higher accuracies. Considering highly nonlinear features and discontinuities of the macro-micro relationship in Hertz-based discrete element models, the adaptive moment estimation algorithm is adopted in this study because of its capacity of dealing with noise gradients of cost functions. Here, the proposed method is validated with several numerical cases including randomly distributed monodisperse and polydisperse packings. Noticeable improvements in terms of calibration efficiency and accuracy have been made.

Constitutive law↗
DOE OSTI2022

Modeling the effect of nitrogen recycling on the erosion and leakage of tungsten impurities from the SAS-VW divertor in DIII-D during nitrogen gas injection

The new SAS-VW divertor in DIII-D has tungsten-coated components to enable the study of tungsten erosion and leakage from a closed, slot-like divertor. A proposed method of actively managing the tungsten impurities is to inject low-Z impurities, such as nitrogen, into the Scrape-off-Layer (SOL) to modify the conditions in the plasma boundary and in turn manipulate both the erosion and subsequent transport of tungsten. Nitrogen injection from the SOL crown has been modeled using SOLPS-ITER to calculate the background plasma including the intrinsic carbon and the injected nitrogen impurities, and subsequently DIVIMP has been used to calculate the tungsten erosion and transport on top of the background plasma solution. This workflow has been used to model scenarios at a variety of nitrogen injection rates with different assumptions about the nitrogen recycling at the target. In the scenario modeled here, an optimal nitrogen injection rate around 3-4 x 10 20 N/s is found to reduce the amount of tungsten reaching the core by a factor of about 2.4. However, when the nitrogen recycling rate at the divertor targets is high, the nitrogen redistributes within the slot leading to increased tungsten sputtering, and the range of injection rates resulting in tungsten mitigation becomes narrower.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Coherent correlation imaging for resolving fluctuating states of matter

Fluctuations and stochastic transitions are ubiquitous in nanometre-scale systems, especially in the presence of disorder. However, their direct observation has so far been impeded by a seemingly fundamental, signal-limited compromise between spatial and temporal resolution. Here we develop coherent correlation imaging (CCI) to overcome this dilemma. Our method begins by classifying recorded camera frames in Fourier space. Contrast and spatial resolution emerge by averaging selectively over same-state frames. Temporal resolution down to the acquisition time of a single frame arises independently from an exceptionally low misclassification rate, which we achieve by combining a correlation-based similarity metric with a modified, iterative hierarchical clustering algorithm. We apply CCI to study previously inaccessible magnetic fluctuations in a highly degenerate magnetic stripe domain state with nanometre-scale resolution. We uncover an intricate network of transitions between more than 30 discrete states. Our spatiotemporal data enable us to reconstruct the pinning energy landscape and to thereby explain the dynamics observed on a microscopic level. CCI massively expands the potential of emerging high-coherence X-ray sources and paves the way for addressing large fundamental questions such as the contribution of pinning and topology in phase transitions and the role of spin and charge order fluctuations in high-temperature superconductivity.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Ptychographic phase retrieval by proximal algorithms

We derive a set of ptychography phase-retrieval iterative engines based on proximal algorithms originally developed in convex optimization theory, and discuss their connections with existing ones. The use of proximal operator creates a simple frame work that allows us to incorporate the effect of noise from a maximum-likelihood (ML) principle. We focus on three particular algorithms, namely proximal minimization, alternating direction method of multiplier and accelerated proximal gradient (APG). We benchmark their performance with numerical simulations, and discuss their optimal conditions for convergence and accuracy. An experimental dataset is used to demonstrate their effectiveness as well, in which case an array of cubic Au nanoparticles with a size of 50 nm is imaged. We show that with the presence of Poisson noise, a dataset with photon counts up to 10 4 at one detector pixel already requires ML-based methods to achieve a stable convergence. Among the three algorithms derived in this work, APG method is reported first time for its application in ptychographic reconstruction and shows superior performance in terms of both accuracy and convergence rate with a noisy dataset.

36 MATERIALS SCIENCE↗