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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗
DOE OSTI2023

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Physics constrained unsupervised deep learning for rapid, high resolution scanning coherent diffraction reconstruction

By circumventing the resolution limitations of optics, coherent diffractive imaging (CDI) and ptychography are making their way into scientific fields ranging from X-ray imaging to astronomy. Yet, the need for time consuming iterative phase recovery hampers real-time imaging. While supervised deep learning strategies have increased reconstruction speed, they sacrifice image quality. Furthermore, these methods’ demand for extensive labeled training data is experimentally burdensome. Here, we propose an unsupervised physics-informed neural network reconstruction method, PtychoPINN, that retains the factor of 100-to-1000 speedup of deep learning-based reconstruction while improving reconstruction quality by combining the diffraction forward map with real-space constraints from overlapping measurements. In particular, PtychoPINN gains a factor of 4 in linear resolution and an 8 dB improvement in PSNR while also accruing improvements in generalizability and robustness. This blend of performance and computational efficiency offers exciting prospects for high-resolution real-time imaging in high-throughput environments such as X-ray free electron lasers (XFELs) and diffraction-limited light sources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Gate-based quantum computing for protein design

Protein design is a technique to engineer proteins by permuting amino acids in the sequence to obtain novel functionalities. However, exploring all possible combinations of amino acids is generally impossible due to the exponential growth of possibilities with the number of designable sites. The present work introduces circuits implementing a pure quantum approach, Grover’s algorithm, to solve protein design problems. Our algorithms can adjust to implement any custom pair-wise energy tables and protein structure models. Moreover, the algorithm’s oracle is designed to consist of only adder functions. Quantum computer simulators validate the practicality of our circuits, containing up to 234 qubits. However, a smaller circuit is implemented on real quantum devices. Our results show that using iterations, the circuits find the correct results among all N possibilities, providing the expected quadratic speed up of Grover’s algorithm over classical methods (i.e.,).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Evolution of Two-Phase High Explosive Reactive Flow [Slides]

Reactive hydrodynamics involve rapid conversion of reactants to products along a detonation wave and needs a closure rule: P-T equilibrium. To calculate P-T equilibrium, we use a root finding method, which can be a computational bottleneck. We evolve the guess for the root finder rather than using the previous value to reduce iterations. Evolving products volume fraction Φ p for an initial root finding guess does reduce root finding iterations and seems to give the best results immediately following a detonation wave (reducing root finding iterations from 5 to 2).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Volt-Var Curve Reactive Power Control Requirements and Risks for Feeders with Distributed Roof-Top Photovoltaic Systems

The benefits and risks associated with Volt-Var Curve (VVC) control for management of voltages in electric feeders with distributed, roof-top photovoltaic (PV) can be defined using a stochastic hosting capacity analysis methodology. Although past work showed that a PV inverter’s reactive power can improve grid voltages for large PV installations, this study adds to the past research by evaluating the control method’s impact (both good and bad) when deployed throughout the feeder within small, distributed PV systems. The stochastic hosting capacity simulation effort iterated through hundreds of load and PV generation scenarios and various control types. The simulations also tested the impact of VVCs with tampered settings to understand the potential risks associated with a cyber-attack on all of the PV inverters scattered throughout a feeder. The simulation effort found that the VVC can have an insignificant role in managing the voltage when deployed in distributed roof-top PV inverters. This type of integration strategy will result in little to no harm when subjected to a successful cyber-attack that alters the VVC settings.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Equation-Free Coarse Control of Distributed Parameter Systems via Local Neural Operators

The control of high-dimensional distributed parameter systems (DPS) remains a challenge when explicit coarse-grained equations are unavailable. Classical equation-free (EF) approaches rely on fine-scale simulators treated as black-box timesteppers. However, repeated simulations for steady-state computation, linearization, and control design are often computationally prohibitive, or the microscopic timestepper may not even be available, leaving us with data as the only resource. We propose a data-driven alternative that uses local neural operators, trained on spatiotemporal microscopic/mesoscopic data, to obtain efficient short-time solution operators. These surrogates are employed within Krylov subspace methods to compute coarse steady and unsteady-states, while also providing Jacobian information in a matrix-free manner. Krylov-Arnoldi iterations then approximate the dominant eigenspectrum, yielding reduced models that capture the open-loop slow dynamics without explicit Jacobian assembly. Both discrete-time Linear Quadratic Regulator (dLQR) and pole-placement (PP) controllers are based on this reduced system and lifted back to the full nonlinear dynamics, thereby closing the feedback loop.

93B52, 93C20, 47N70, 65J15, 65M32, 68T07, 68T20, 6↗
DOE OSTI2025

Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM SciDAC) (Technical Final Report)

Runaway electrons can severely damage the plasma facing components on ITER during a major disruption and pose a major risk for tokamak fusion. It has been recognized that an adequate disruption mitigation system (DMS) is essential for the safe operation of ITER. The United States is responsible for the design and implementation of the disruption mitigation system on ITER, and in July 2016 the Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM) was launched by DOE, in a joint Fusion Energy Sciences (FES) and Advanced Scientific Computing Research (ASCR) collaboration. SCREAM was a comprehensive theory and simulation SciDAC center that provided physics guidance in the avoidance and mitigation of runaway electrons, and in tandem with domestic and international experiments, helped establish the qualitative and quantitative bases for safe operational scenarios and viable mitigation techniques. The SCREAM center assembled a national team of experts in runaway electron physics, tokamak disruptions, magnetohydrodynamic (MHD) simulation, and advanced algorithms and computing. The team combined advanced simulation and analysis capability facilitated by direct participation of ASCR SciDAC institutes with theoretical models and code development by FES scientists to focus on the runaway risk for ITER and tokamaks in general. The research scope was focussed on integrated simulations of kinetic runaway electrons, including MHD and fluid models of impurity transport, within a research plan guided by theory. The specific research tasks were (1) establish the fundamental physics of runaway generation, saturation, and dynamical evolution in a tokamak; (2) examine the critical path toward runaway avoidance; and (3) investigate the viability and effectiveness of the leading candidate schemes for runaway mitigation. In all three areas, members of the team carried out scoping studies that established the readiness for rapid and critical advances, especially in the deployment and further development of large-to extreme-scale simulation tools. Our multi-pronged computational approach included (1) relativistic Fokker-Planck solvers with discretization in phase space, (2) self-consistent particle-in-cell techniques, (3) particle-based Monte-Carlo, and (4) MHD-particle hybrid simulations. Cross-check between these different methods provided an additional means for verification and further bolstered the fidelity of our physics prediction. Validation against experimental results brings confidence to the predictive capability for ITER and frequently leads to new ideas for understanding and mitigating the thermal quench driven runaway electron phenomenon.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

A Design for Remanufacturing Framework Incorporating Identification, Evaluation, and Validation: A Case Study of Hydraulic Manifold

In recent years, academic researchers and engineers in the industry have widely recognized the necessity of integrating remanufacturing considerations into product design iterations to advance sustainability objectives. Acknowledging the importance of design for remanufacturing (DfRem), efforts were made to develop tools and guidelines that could be implemented in practice. However, such methods largely rely upon experiential insights and qualitative assessments, leaving a gap in the ability to quantitatively assess the economic and environmental impacts of design choices. To bridge this gap, we investigate existing efforts and present a framework for DfRem that integrates established design and remanufacturing practices into a cohesive workflow with quantitative assessments. To demonstrate its efficacy for making practical design changes for remanufacturing, we apply the framework to a hydraulic manifold in a transmission system for heavy-duty tractors. Through this industry-relevant case study, we focus on showcasing the practical utility of our framework. Based on the identified design modifications from remanufacturability analysis, we estimate the reductions in life cycle costs, energy consumption, and emissions. Afterward, the modifications are tested using physical experiments with plans for integration into future iterations of the hydraulic manifold design and production. Here, we anticipate this framework can illustrate the process of remanufacturing that ensures improvements in sustainability while maintaining performance and reliability standards.

design for X↗
DOE OSTI2020

Process optimization of complex geometries using feed forward control for laser powder bed fusion additive manufacturing

Additive manufacturing (AM) enables the fabrication of complex designs that are difficult to create by other means. Metal parts manufactured by laser powder bed fusion (LPBF) can incorporate intricate design features and demonstrate desirable mechanical properties. However, printing a part that is qualified for its intended application often involves reprinting and discarding many parts to eliminate defects, improve dimensional accuracy, and increase repeatability. The process of iteratively converging on the appropriate build parameters increases the time and cost of creating functional LPBF manufactured parts. This work describes a fast, scalable method for part-scale process optimization of arbitrary geometries. Additionally, the computational approach uses feature extraction to identify scan vectors in need of parameter adaptation and applies results from simulation-based feed forward control models. This method provides a framework to quickly optimize complex parts through the targeted application of models with a range of fidelity and by automating the transfer of optimization strategies to new part designs. The computational approach and algorithmic framework are described, a software package is implemented, the method is applied to parts with complex features, and parts are printed on a customized open architecture LPBF machine.

3D printing↗
DOE OSTI2024

Autocalibration of the E3SM Version 2 Atmosphere Model Using a PCA-Based Surrogate for Spatial Fields

Global Climate Model tuning (calibration) is a tedious and time-consuming process, with high-dimensional input and output fields. Experts typically tune by iteratively running climate simulations with hand-picked values of tuning parameters. Many, in both the statistical and climate literature, have proposed alternative calibration methods, but most are impractical or difficult to implement. We present a practical, robust, and rigorous calibration approach on the atmosphere-only model of the Department of Energy's Energy Exascale Earth System Model (E3SM) version 2. Our approach can be summarized into two main parts: (a) the training of a surrogate that predicts E3SM output in a fraction of the time compared to running E3SM, and (b) gradient-based parameter optimization. To train the surrogate, we generate a set of designed ensemble runs that span our input parameter space and use polynomial chaos expansions on a reduced output space to fit the E3SM output. We use this surrogate in an optimization scheme to identify values of the input parameters for which our model best matches gridded spatial fields of climate observations. To validate our choice of parameters, we run E3SMv2 with the optimal parameter values and compare prediction results to expertly-tuned simulations across 45 different output fields. This flexible, robust, and automated approach is straightforward to implement, and we demonstrate that the resulting model output matches present day climate observations as well or better than the corresponding output from expert tuned parameter values, while considering high-dimensional output and operating in a fraction of the time.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Microscopic calculations of nuclear level densities with the Lanczos method

A new method for computing the density of states in nuclei making use of an extrapolated form of the tridiagonal matrix obtained from the Lanczos method is presented. It will be shown that the global, average properties of the entire Lanczos matrix can be predicted from just four Lanczos iterations. The extrapolated Lanczos matrix (ELM) approach provides for an accurate computation of the density of states described within the configuration space, which, in some cases, is sufficient to accurately calculate the density of states at, or near, the neutron separation energy. Comparisons between theory and experiment are shown for $^{57}Fe$, $^{74}Ge$, and $^6Ge$. In addition, we show results for the J -dependence of moments and the level density for these three nuclei.

Shell model↗
DOE OSTI2025

Optimizing transmit field inhomogeneity of parallel RF transmit design in 7T MRI using deep learning

Ultrahigh field (UHF) Magnetic Resonance Imaging (MRI) provides a higher signal-to-noise ratio and, thereby, higher spatial resolution. However, UHF MRI introduces challenges such as transmit radiofrequency (RF) field (B+1) inhomogeneities, leading to uneven flip angles and image intensity anomalies. These issues can significantly degrade imaging quality and its medical applications. This study addresses B+1 field homogeneity through a novel deep learning-based strategy. Traditional methods like Magnitude Least Squares (MLS) optimization have been effective but are time-consuming and dependent on the patient’s presence. Recent machine learning approaches, such as RF Shim Prediction by Iteratively Projected Ridge Regression and deep learning frameworks, have shown promise but face limitations like extensive training times and oversimplified architectures. We propose a two-step deep learning strategy. First, we obtain the desired reference RF shimming weights from multi-channel B+1 fields using random-initialized Adaptive Moment Estimation. Then, we employ Residual Networks (ResNets) to train a model that maps B+1 fields to target RF shimming outputs. Our approach does not rely on pre-calculated reference optimizations for the testing process and efficiently learns residual functions. Comparative studies with traditional MLS optimization demonstrate our method’s advantages in terms of speed and accuracy. The proposed strategy achieves a faster and more efficient RF shimming design, significantly improving imaging quality at UHF. This advancement holds potential for broader applications in medical imaging and diagnostics.

Lu, Zhengyi [Vanderbilt University]↗
DOE OSTI2023

Accurate Prediction of Algal Biomass Lipid, Protein, and Carbohydrate Composition with Machine Learning Regression Modelling of Near-IR Spectra

During large scale algal biomass cultivation, it is difficult to reliably control relative composition to target levels. Rapid determination of chemical composition is feasible by using near infrared (NIR) spectral data. We sought to build and improve on reliable high-throughput screening prediction method based on partial least squares regression (PLSR) by the application of artificial neural networks (ANN) and associated optimization strategies. The algal biomass sample set was designed and created in an iterative process of culturing in physiologically diverse conditions at the GAI field site, followed by compositional analyses at NREL. The workflow allowed us to identify gaps in compositional space for informing the subsequent cultivation and sampling efforts and generated a high quality set of 210 unique samples with chemical analysis results, spectral scanning data, and cultivation metadata. We observed a significant improvement in the performance of carbohydrate content predictions using an optimized ANN model compared to PLSR, with > 16% reduction in mean absolute percent error (MAPE) when tested on the same set of reserved data. The optimized ANN models for FAME and protein prediction performed exceptionally well with 5.99% and 5.09% MAPE, respectively. Application of these methods to detection and quantification of minor biomass constituents that are relevant to certain product streams has shown positive preliminary results, opening the possibility for extensions to the outputs of this powerful data type. All models are accompanied by prediction uncertainties and unsupervised spectral outlier detection to alert an operator to unreliable spectral data. These tools can be deployed for rapid determination of algal culture status, and cultivation and biomass quality improvement.

algal biofuels↗
DOE OSTI2023

Efficient generalized boundary detection

Fast, efficient, and robust compression-based methods for detecting boundaries in arbitrary datasets, including sequences (1D datasets), are desired. The methods, each employing three simple algorithms, approximate the information distance between two adjacent sliding windows within a dataset. One of the algorithms calculates an initial ordered list of subsequences; while a second algorithm updates the ordered list of subsequences by dropping a first entry and appending a last entry rather than calculating completely new ordered lists with each iteration. Large values in the distance metric are indicative of boundary locations. A smoothed z-score or a wavelet-based algorithm may then be used to locate peaks in the distance metric, thereby identifying boundary locations. An adaptive version of the method employs a collection of window sizes and corresponding weighting functions, making it more amenable to real datasets with unknown, complex, and changing structures.

Ting, Christina↗
DOE OSTI2023

Effective cosmic density field reconstruction with convolutional neural network

ABSTRACT We present a cosmic density field reconstruction method that augments the traditional reconstruction algorithms with a convolutional neural network (CNN). Following previous work, the key component of our method is to use the reconstructed density field as the input to the neural network. We extend this previous work by exploring how the performance of these reconstruction ideas depends on the input reconstruction algorithm, the reconstruction parameters, and the shot noise of the density field, as well as the robustness of the method. We build an eight-layer CNN and train the network with reconstructed density fields computed from the Quijote suite of simulations. The reconstructed density fields are generated by both the standard algorithm and a new iterative algorithm. In real space at z = 0, we find that the reconstructed field is 90 per cent correlated with the true initial density out to $k\sim 0.5 \, \mathrm{ h}\, \rm {Mpc}^{-1}$, a significant improvement over $k\sim 0.2 \, \mathrm{ h}\, \rm {Mpc}^{-1}$ achieved by the input reconstruction algorithms. We find similar improvements in redshift space, including an improved removal of redshift space distortions at small scales. We also find that the method is robust across changes in cosmology. Additionally, the CNN removes much of the variance from the choice of different reconstruction algorithms and reconstruction parameters. However, the effectiveness decreases with increasing shot noise, suggesting that such an approach is best suited to high density samples. This work highlights the additional information in the density field beyond linear scales as well as the power of complementing traditional analysis approaches with machine learning techniques.

Astronomy & Astrophysics↗
DOE OSTI2023

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗