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

A score-based diffusion model approach for adaptive learning of stochastic partial differential equation solutions

In this paper, we propose a novel framework for adaptively learning the time-evolving solutions of stochastic partial differential equations (SPDEs) using score-based diffusion models within a recursive Bayesian inference setting. SPDEs play a central role in modeling complex physical systems under uncertainty, but their numerical solutions often suffer from model errors and reduced accuracy due to incomplete physical knowledge and environmental variability. To address these challenges, we encode the governing physics into the score function of a diffusion model using simulation data and incorporate observational information via a likelihood-based correction in a reverse-time stochastic differential equation. This enables adaptive learning through iterative refinement of the solution as new data becomes available. To improve computational efficiency in high-dimensional settings, we introduce the ensemble score filter, a training-free approximation of the score function designed for real-time inference. Numerical experiments on benchmark SPDEs demonstrate the accuracy and robustness of the proposed method under sparse and noisy observations.

97 MATHEMATICS AND COMPUTING↗

Real-space solution to the electronic structure problem for nearly a million electrons

We report a Kohn–Sham density functional theory calculation of a system with more than 200 000 atoms and 800 000 electrons using a real-space high-order finite-difference method to investigate the electronic structure of large spherical silicon nanoclusters. Our system of choice was a 20 nm large spherical nanocluster with 202 617 silicon atoms and 13 836 hydrogen atoms used to passivate the dangling surface bonds. To speed up the convergence of the eigenspace, we utilized Chebyshev-filtered subspace iteration, and for sparse matrix–vector multiplications, we used blockwise Hilbert space-filling curves, implemented in the PARSEC code. For this calculation, we also replaced our orthonormalization + Rayleigh–Ritz step with a generalized eigenvalue problem step. We utilized all of the 8192 nodes (458 752 processors) on the Frontera machine at the Texas Advanced Computing Center. We achieved two Chebyshev-filtered subspace iterations, yielding a good approximation of the electronic density of states. Our work pushes the limits on the capabilities of the current electronic structure solvers to nearly 106 electrons and demonstrates the potential of the real-space approach to efficiently parallelize large calculations on modern high-performance computing platforms.

Chemistry↗

A Weakly Supervised Machine Learning Procedure for Magnet Quench Diagnostics

Voltage taps remain the standard and reliable diagnostic tool for detecting quenches in superconducting magnets. However, they identify a quench only at the time of voltage rise and do not provide information on earlier physical precursors. In this work, we investigate whether acoustic emission data can reveal precursor activity that occurs before conventional voltage detection using machine learning techniques. We introduce an event selection method and a weakly supervised machine learning procedure to learn data-driven criteria for identifying potential acoustic precursors to quenches. Two Convolutional Neural Network (CNN) architectures are trained: one on acoustic sensor events from our selection procedure and one on the Fast Fourier Transforms (FFTs) of these events. Both networks are trained iteratively using confidence-weighted loss functions to associate certain subsets of training data with a precursor label. We evaluate the performance of these models by examining the time distribution of events classified as potential precursors relative to the quench onset. Results indicate that the proposed approach can possibly distinguish acoustic emission events occurring closer to the quench from earlier acoustic activity during ramping, suggesting the potential for flagging quench precursors in acoustic data.

Khan, Maira [Fermilab] (ORCID:0009000891602387)↗

Summary of the 5th IAEA technical meeting on fusion data processing, validation and analysis (FDPVA)

The purpose of the 5th International Atomic Energy Agency technical meeting on fusion data processing, validation and analysis (FDPVA) (Ghent University, Ghent, Belgium, 12–15 June 2023) was to provide a platform during which a set of topics relevant to FDPVA were discussed with the view of meeting the needs of next step fusion devices such as ITER. The validation and analysis of experimental data obtained from diagnostics used to characterize fusion plasmas are crucial for a knowledge-based understanding of the physical processes governing the dynamics of these plasmas. This paper presents the recent progress and achievements in the domain of plasma diagnostics data analysis and synthetic diagnostics reported at the meeting, including concept description of new devices; fusion databases; integrated data analysis; inverse problems; uncertainty propagation, verification and validation; probabilistic methods and machine learning. The relevant results underline trends observed in the current major fusion confinement devices.

fusion databases↗

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↗

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↗

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)↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗