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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Characterization of single-shot attosecond pulses with angular streaking photoelectron spectra

Most of the traditional attosecond pulse retrieval algorithms are based on a so-called attosecond streak camera technique, in which the momentum of the electron is shifted by an amount depending on the relative time delay between the attosecond pulse and the streaking infrared pulse. Thus, temporal information of the attosecond pulse is encoded in the amount of momentum shift in the streaked photoelectron momentum spectrogram S(p,τ), where p is the momentum of the electron along the polarization direction and τ is the time delay. An iterative algorithm is then employed to reconstruct the attosecond pulse from the streaking spectrogram. This method, however, cannot be applied to attosecond pulses generated from free-electron x-ray lasers where each single shot is different and stochastic in time. However, using a circularly polarized infrared laser as the streaking field, a two (or three)-dimensional angular streaking electron spectrum can be used to retrieve attosecond pulses for each shot, as well as the time delay with respect to the circularly polarized IR field. Here we show that a retrieval algorithm previously developed for the traditional streaking spectrogram can be modified to efficiently characterize single-shot attosecond pulses. The methods have been applied to retrieve 188 single shots from recent experiments. We analyze the statistical behavior of these 188 pulses in terms of pulse duration, bandwidth, pulse peak energy, and time delay with respect to the IR field. Furthermore, the retrieval algorithm is efficient and can be easily used to characterize a large number of shots in future experiments for attosecond pulses at free-electron x-ray laser facilities.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Decision-Making Under Uncertainty for a Digital Thread-Enabled Design Process

Abstract Digital thread is a data-driven architecture that links together information from all stages of the product lifecycle. Despite increasing application in manufacturing, maintenance/operations, and design related tasks, a principled formulation of analyzing the decision-making problem under uncertainty for the digital thread remains absent. The contribution of this article is to present a formulation using Bayesian statistics and decision theory. First, we address how uncertainty propagates in the product lifecycle and how the digital thread evolves based on the decisions we make and the data we collect. By using these mechanics, we explore designing over multiple product generations or iterations and provide an algorithm to solve the underlying multistage decision problem. We illustrate our method on an example structural design problem where our method can quantify and optimize different types and sequences of decisions, ranging from experimentation, manufacturing, and sensor placement/selection, to minimize total accrued costs.

Engineering↗
DOE OSTI2025

Chemical classification program synthesis using generative artificial intelligence

Accurately classifying chemical structures is essential for cheminformatics and bioinformatics, including tasks such as identifying bioactive compounds of interest, screening molecules for toxicity to humans, finding non-organic compounds with desirable material properties, or organizing large chemical libraries for drug discovery or environmental monitoring. However, manual classification is labor-intensive and difficult to scale to large chemical databases. Existing automated approaches either rely on manually constructed classification rules, or are deep learning methods that lack explainability. This work presents an approach that uses generative artificial intelligence to automatically write chemical classifier programs for classes in the Chemical Entities of Biological Interest (ChEBI) database. These programs can be used for efficient deterministic run-time classification of SMILES structures, with natural language explanations. The programs themselves constitute an explainable computable ontological model of chemical class nomenclature, which we call the ChEBI Chemical Class Program Ontology (C3PO). We validated our approach against the ChEBI database, and compared our results against deep learning models and a naive SMARTS pattern based classifier. C3PO outperforms the naive classifier, but does not reach the performance of state of the art deep learning methods. However, C3PO has a number of strengths that complement deep learning methods, including explainability and reduced data dependence. C3PO can be used alongside deep learning classifiers to provide an explanation of the classification, where both methods agree. The programs can be used as part of the ontology development process, and iteratively refined by expert human curators.

Artificial Intelligence↗
DOE OSTI2021

Probabilistic Data Association for Orbital-Element Estimation Using Multistage Expectation–Maximization

Tracking space objects is important for managing space traffic and predicting collisions, but is difficult in part due to data association and orbit model uncertainty. Expectation–maximization (EM) is a commonly used tracking method that has not been widely considered for tracking space objects. The technique consists of iteratively computing data association probabilities with a set of current element estimates, and updating estimates of the elements by solving a nonlinear weighted least-squares regression problem where the weights are the data association probabilities. In this paper, we demonstrate the use of EM for probabilistic data association and orbital-element estimation by applying the technique to simulated data from two angles-only tracking scenarios. In both scenarios, EM provides correct data associations and accurate maximum likelihood estimates of orbital elements. One scenario considers tracking a single object in clutter and quantifies the improvement of the orbital-element estimates and data associations as the detection probability increases. However, standard application of EM requires knowing the number of objects or may fail when a large number of objects are present. To address these issues, this paper employs a multistage version of EM that is applicable when there are a large and possibly unknown number of objects.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear system of equations at each iteration. In common applications of linear programming, particularly in machine learning and scientific computing, the size of this linear system can become prohibitively large, requiring the use of iterative solvers, which provide an approximate solution to the linear system. However, approximately solving the linear system at each iteration of an IPM invalidates the theoretical guarantees of common IPM analyses. To remedy this, we theoretically and empirically analyze (slightly modified) predictor-corrector IPMs when using approximate linear solvers: our approach guarantees that, when certain conditions are satisfied, the number of IPM iterations does not increase and that the final solution remains feasible. We also provide practical instantiations of approximate linear solvers that satisfy these conditions for special classes of constraint matrices using randomized linear algebra.

Dexter, Gregory↗
DOE OSTI2025

Melting LHC detectors: a novel search for stopped long-lived particles

Particles at the TeV scale with lifetimes of a year or longer could have been abundantly produced at the LHC yet escaped detection because of backgrounds, and could still be trapped within detector materials. With gluinos in split-supersymmetry as a working example, we show that these trapped particles can be recovered from detector materials once prepared in liquid form, for example, by melting silicon detectors, extracting liquid argon from the electromagnetic calorimeter, or constructing a large water pool near ATLAS or CMS. These liquid samples can then be processed using iterative centrifugation followed by mass spectrometry, enabling single-particle sensitivity in macroscopic samples. This method can potentially discover gluinos up to 3 TeV in mass at the HL-LHC. It can also improve upon existing limits for other long-lived particles. For example, it can discover the stop up to 2 TeV, and will also be sensitive to integer-charged particles in the TeV range.

Gonski, Julia L. [SLAC]↗
DOE OSTI2023

Analysis of Needlet Internal Linear Combination performance on B -mode data from sub-orbital experiments

The observation of primordial B modes in cosmic microwave background (CMB) polarisation data represents the main scientific goal of most of the future CMB experiments. This signal is predicted to be much lower than polarised Galactic emission (foregrounds) in any region of the sky, pointing to the need for effective component separation methods. Aims. Among all the techniques, the blind Needlet Internal Linear Combination (NILC) is of great relevance given our current limited knowledge of the B-mode foregrounds. In this work, we explore the possibility of employing NILC for the analysis of B modes reconstructed from partial-sky data, specifically addressing the complications that such an application yields such as E–B leakage, needlet filtering, and beam convolution. We consider two complementary simulated datasets of future experiments: the balloon-borne Short Wavelength Instrument for the Polarisation Explorer (SWIPE) of the Large Scale Polarisation Explorer, which targets the observation of both reionisation and recombination peaks of the primordial CMB B-mode angular power spectrum, and the ground-based Small Aperture Telescope of Simons Observatory, which, instead, is designed to observe only the recombination bump at ℓ ~ 80. We assessed the performance of the following two alternative techniques to correct for the CMB E–B leakage: the recycling technique and the Zhao-Baskaran method. We find that both techniques reduce the E–B leakage residuals at a negligible level given the sensitivity of the considered experiments, except for the recycling method in the SWIPE footprint at ℓ < 20. Thus, we implemented two extensions of the pipeline, the iterative B decomposition and the diffusive inpainting, which enabled us to recover the input CMB B-mode power for ℓ ≥ 5. For the considered experiments, we demonstrate that needlet filtering and beam convolution do not affect the CMB B-mode reconstruction. Finally, with an appropriate masking strategy, we find that NILC foregrounds subtraction allows one to achieve sensitivities on the tensor-to-scalar ratio in agreement with the targets of the considered CMB experiments.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Source-encoded waveform inversion in the Northern Hemisphere

SUMMARY We use source-encoded waveform inversion to image Earth’s Northern Hemisphere. The encoding method is based on measurements of Laplace coefficients of stationary wavefields. By assigning to each event a unique frequency, we compute Fréchet derivatives for all events simultaneously based on one ‘super’ forward and one ‘super’ adjoint simulation for a small fraction of the computational cost of classical waveform inversion with the same data set. No cross-talk noise is introduced in the process, and the method does not require all events to be recorded by all stations. Starting from global model GLAD_M25, we performed 100 conjugate gradient iterations using a data set consisting of 786 earthquakes recorded by 9846 stations. Synthetic inversion tests show that we achieve good convergence based on this data set, and we see a consistent misfit reduction during the inversion. The new model, named SE100, has much higher spatial resolution than GLAD_M25, revealing details of the Yellowstone and Iceland hotspots, subduction beneath the Western United States and the upper mantle structure beneath the Arctic Ocean.

Cui, Congyue↗
DOE OSTI2024

Modelling and experiment to stabilize disruptive tearing modes in the ITER baseline scenario in DIII-D

Abstract The achievement of high gain, stationary conditions in a tokamak scenario aimed at producing fusion energy in the ITER Project is crucial to the demonstration that this form of energy can be used in future reactors to provide cheap and clean energy globally. Disruptions are a challenge for the fusion energy field, in particular for the ‘ITER Baseline Scenario’ (IBS), as reproduced in the DIII-D tokamak. This work shows that a solution has been found for the m = 2/ n = 1 tearing modes that have consistently caused disruptions in the IBS: stable operation down to zero input torque was achieved by modifying the current density profile at the beginning of the pressure flattop and the ELM character later in the discharges, guided by previous results showing that the most likely cause of these instabilities is the current density profile. The coupling between sawteeth, n>2 modes and the 2/1 TMs is shown to not be statistically significant, nor the leading origin for the evolution towards instability. Ideal and resistive MHD modeling provide positive verification that a steeper ‘well’ in the region of the q = 2 rational surface leads to worse ideal stability, higher tearing index Δ’ and lower threshold Δ’ c for resistive instabilities, consistent with the experimental results. This provides confidence that the methods used in this work can be extrapolated to other devices and applied to avoid disruptions in ITER and pulsed fusion devices worldwide.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Realizability-preserving discontinuous Galerkin method for spectral two-moment radiation transport in special relativity

Here we present a realizability-preserving numerical method for solving a spectral two-moment model to simulate the transport of massless, neutral particles interacting with a steady background material moving with relativistic velocities. The model is obtained as the special relativistic limit of a four-momentum-conservative general relativistic two-moment model. Using a maximum-entropy closure, we solve for the Eulerian-frame energy and momentum. The proposed numerical method is designed to preserve moment realizability, which corresponds to moments defined by a nonnegative phase-space density. The realizability-preserving method is achieved with the following key components: (i) a discontinuous Galerkin phase-space discretization with specially constructed numerical fluxes in the spatial and energy dimensions; (ii) a strong stability-preserving implicit-explicit time-integration method; (iii) a realizability-preserving conserved to primitive moment solver; (iv) a realizability-preserving implicit collision solver; and (v) a realizability-enforcing limiter. Component (iii) is necessitated by the closure procedure, which closes higher order moments nonlinearly in terms of primitive moments. The nonlinear conserved to primitive and the implicit collision solves are formulated as fixed-point problems, which are solved with custom iterative solvers designed to preserve the realizability of each iterate. With a series of numerical tests, we demonstrate the accuracy and robustness of this discontinuous-Galerkin-implicit-explicit method.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Pre-conditioned BFGS-based uncertainty quantification in elastic full-waveform inversion

SUMMARY Full-waveform inversion has become an essential technique for mapping geophysical subsurface structures. However, proper uncertainty quantification is often lacking in current applications. In theory, uncertainty quantification is related to the inverse Hessian (or the posterior covariance matrix). Even for common geophysical inverse problems its calculation is beyond the computational and storage capacities of the largest high-performance computing systems. In this study, we amend the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to perform uncertainty quantification for large-scale applications. For seismic inverse problems, the limited-memory BFGS (L-BFGS) method prevails as the most efficient quasi-Newton method. We aim to augment it further to obtain an approximate inverse Hessian for uncertainty quantification in FWI. To facilitate retrieval of the inverse Hessian, we combine BFGS (essentially a full-history L-BFGS) with randomized singular value decomposition to determine a low-rank approximation of the inverse Hessian. Setting the rank number equal to the number of iterations makes this solution efficient and memory-affordable even for large-scale problems. Furthermore, based on the Gauss–Newton method, we formulate different initial, diagonal Hessian matrices as pre-conditioners for the inverse scheme and compare their performances in elastic FWI applications. We highlight our approach with the elastic Marmousi benchmark model, demonstrating the applicability of pre-conditioned BFGS for large-scale FWI and uncertainty quantification.

58 GEOSCIENCES↗
DOE OSTI2020

An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation

In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Control simulations of many-body quantum systems by a synergism of discrete real-time learning and optimal control theory

We present a self-consistent algorithm for optimal control simulations of many-body quantum systems. The algorithm features a two-step synergism that combines discrete real-time machine learning (DRTL) with Quantum Optimal Control Theory (QOCT) using the time-dependent Schrödinger equation. Specifically, in step (1), DRTL is employed to identify a compact working space (i.e., the important portion of the Hilbert space) for the time evolution of the many-body quantum system in the presence of a control field (i.e., the initial or previously updated field), and in step (2), QOCT utilizes the DRTL-determined working space to find a newly updated control field for a chosen objective. Steps 1 and 2 are iterated until a self-consistent control objective value is reached such that the resulting optimal control field yields the same targeted objective value when the corresponding working space is systematically enlarged. Furthermore, to demonstrate this two-step self-consistent DRTL-QOCT synergistic algorithm, we perform optimal control simulations of strongly interacting 1D as well as 2D Heisenberg spin systems. In both scenarios, only a single spin (at the left end site for 1D and the upper left corner site for 2D) is driven by the time-dependent control fields to create an excitation at the opposite site as the target. It is found that, starting from all spin-down zero excitation states, the synergistic method is able to identify working spaces and convergence of the desired controlled dynamics with just a few iterations of the overall algorithm. In the cases studied, the dimensionality of the working space scales only quasi-linearly with the number of spins.

Artificial neural networks↗
DOE OSTI2023

Higher-Order Corrections to Optimisers based on Newton's Method

The Newton, Gauss–Newton and Levenberg–Marquardt methods all use the first derivative of a vector function (the Jacobian) to minimise its sum of squares. When the Jacobian matrix is ill-conditioned, the function varies much faster in some directions than others and the space of possible improvement in sum of squares becomes a long narrow ellipsoid in the linear model. This means that even a small amount of nonlinearity in the problem parameters can cause a proposed point far down the long axis of the ellipsoid to fall outside of the actual curved valley of improved values, even though it is quite nearby. This paper presents a differential equation that ‘follows’ these valleys, based on the technique of geodesic acceleration, which itself provides a 2 nd order improvement to the Levenberg–Marquardt iteration step. Higher derivatives of this equation are computed that allow n th order improvements to the optimisation methods to be derived. These higher-order accelerated methods up to 4 th order are tested numerically and shown to provide substantial reduction of both number of steps and computation time.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Improving scalability of parallel CNN training by adaptively adjusting parameter update frequency

Synchronous SGD with data parallelism, the most popular parallelization strategy for CNN training, suffers from the expensive communication cost of averaging gradients among all workers. The iterative parameter updates of SGD cause frequent communications and it becomes the performance bottleneck. In this paper, we propose a lazy parameter update algorithm that adaptively adjusts the parameter update frequency to address the expensive communication cost issue. Our algorithm accumulates the gradients if the difference of the accumulated gradients and the latest gradients is sufficiently small. Here, the less frequent parameter updates reduce the per-iteration communication cost while maintaining the model accuracy. Our experimental results demonstrate that the lazy update method remarkably improves the scalability while maintaining the model accuracy. For ResNet50 training on ImageNet, the proposed algorithm achieves a significantly higher speedup (739.6 on 2048 Cori KNL nodes) as compared to the vanilla synchronous SGD (276.6) while the model accuracy is almost not affected (<0.2% difference).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Accelerating cosmological inference with Gaussian processes and neural networks – an application to LSST Y1 weak lensing and galaxy clustering

ABSTRACT Studying the impact of systematic effects, optimizing survey strategies, assessing tensions between different probes and exploring synergies of different data sets require a large number of simulated likelihood analyses, each of which cost thousands of CPU hours. In this paper, we present a method to accelerate cosmological inference using emulators based on Gaussian process regression and neural networks. We iteratively acquire training samples in regions of high posterior probability which enables accurate emulation of data vectors even in high dimensional parameter spaces. We showcase the performance of our emulator with a simulated 3×2 point analysis of LSST-Y1 with realistic theoretical and systematics modelling. We show that our emulator leads to high-fidelity posterior contours, with an order of magnitude speed-up. Most importantly, the trained emulator can be re-used for extremely fast impact and optimization studies. We demonstrate this feature by studying baryonic physics effects in LSST-Y1 3×2 point analyses where each one of our MCMC runs takes approximately 5 min. This technique enables future cosmological analyses to map out the science return as a function of analysis choices and survey strategy.

Astronomy & Astrophysics↗
DOE OSTI2021

A Parallel Cut-Cell Algorithm for the Free-Boundary Grad--Shafranov Problem

A parallel cut-cell algorithm is described to solve the free-boundary problem of the Grad--Shafranov equation. The algorithm reformulates the free-boundary problem in an irregular bounded domain and its important aspects include a searching algorithm for the magnetic axis and separatrix, a surface integral along the irregular boundary to determine the boundary values, an approach to optimize the coil current based on a targeting plasma shape, Picard iterations with Aitken's acceleration for the resulting nonlinear problem, and a Cartesian grid embedded boundary method to handle the complex geometry. Here the algorithm is implemented in parallel using a standard domain-decomposition approach and a good parallel scaling is observed. Numerical results verify the accuracy and efficiency of the free-boundary Grad--Shafranov solver.

97 MATHEMATICS AND COMPUTING↗