Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative”

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 1,657 records · Page 92

PtychoNet: Fast and High Quality Phase Retrieval for Ptychography

Ptychography is a coherent diffractive imaging method that captures multiple diffraction patterns of a sample with a set of shifted localized illuminations (“probes”). The reconstruction problem, known as “phase retrieval”, is typically solved by iterative algorithms. In this paper, we propose PtychoNet, a deep learning based method to perform phase retrieval for ptychography in a non-iterative manner. We devise a generative network to encode a full ptychography scan, reverse the diffractions at each scanning point and compute the amplitude and phase of the object. We demonstrate successful reconstructions using PtychoNet as well as recovering fine features in the case of extreme sparse scanning where conventional iterative methods fail to give recognizable features.

97 MATHEMATICS AND COMPUTING↗

Measurement of kernel swelling and buffer densification in irradiated UCO and UO 2 TRISO fuel particles from AGR-2

The second Advanced Gas Reactor irradiation (AGR-2) featured UCO tristructural isotropic (TRISO)-coated particle fuel and, for comparison purposes, UO2 TRISO fuel. Particles from three UCO fuel compacts and one UO2 fuel compact were chosen for analysis of kernel swelling and buffer shrinkage. Both kernel swelling and buffer shrinkage are common elements of TRISO fuel performance models. More recently, the AGR program has determined that buffer shrinkage may impact the integrity of the inner pyrolytic carbon (IPyC) layer, which may impact SiC layer integrity (particularly during high-temperature heating tests). Therefore, measurements of buffer irradiation-induced shrinkage may be useful in improving existing models and developing new models that capture buffer-IPyC-SiC-fission product interactions observed in recent AGR post-irradiation examination (PIE). TRISO particles were mounted in epoxy, ground, polished, and imaged via optical microscopy in four separate iterations. Each of the four iterations revealed progressively deeper cross sections within the particles. Images collected from each iteration were analyzed for the circumferences/radii of the kernel, buffer, IPyC, and SiC. Spheres were fit to each set of measurements to generate spherical radii representative of the components of the fuel particle. From these radii, volumes were computed and compared to the as-fabricated volumes. UCO kernel swelling was similar among the three AGR-2 compacts ranging from approximately 28 to 32%. This is only slightly higher swelling than was measured in an earlier study of an AGR-1 compact. However, the burnup at which this swelling occurred in AGR-2 was lower than in AGR-1, indicating a faster swelling rate for the AGR-2 kernels for the irradiation conditions covered by these compacts. The AGR-2 UO2 kernel swelling was less, at 9.9%, comparable to other studies of UO2 kernel swelling. While AGR-2 UCO and UO2 kernels demonstrated different rates of swelling, the extent of buffer shrinkage was similar among the two fuel types, ranging from 24-28%. For comparison, a prior study showed that AGR-1 Compact 1-3-1 experienced 39% buffer shrinkage. A commonly-observed post-irradiation particle morphology is where the buffer pulls away from the IPyC (at least in some regions of the particle). Besides the possibility of the buffer degrading the IPyC when it pulls away from the IPyC, this gap is significant because it may also reduce heat transfer within the particle. Average AGR-2 buffer-IPyC gaps were similar for the UCO and UO2 particles, ranging from 22.2 to 26.0 µm. This is similar to what was measured for AGR-1 Compact 1-3-1.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis (V.6.14) (Theory Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Theory Manual (V.6.15)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.16 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota’s iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

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↗

MULTI-LEADER: MULTI-source LEarning-Accelerated Design of high-Efficiency multi-stage compRessor (Final Technical Report)

The objective of MULTI-LEADER is to cut design costs by 80% while generating more energy-efficient designs of multi-stage compressors by developing and implementing novel machine learning (ML) techniques, which enable faster and fewer design iterations, improved solver performance, and concurrent multi-disciplinary design. Current industrial practices for the design of multi-stage compressors involve simulation-based design optimization with successive levels of model fidelity, iteratively evaluated between distinct disciplines, one stage at a time to tackle the high dimensional design variations. This project addresses these key design challenges: (1) concurrent optimization of multiple stages under many non-linear constraints; (2) multitude of evaluation of high-fidelity and expensive solvers and their gradients during optimization convergence in high-dimensional design; (3) multi-disciplinary design to maximize aerodynamic performance while guaranteeing structural integrity and additive manufacturability; (4) utilization of multiple fidelity of solvers with disparate parameterization and modeling assumptions. MULTI-LEADER achieved more than 5x speed up in detailed design of more energy-efficient compressors via these machine learning (ML) innovations: (i) rapid design surrogates by multi-source learning from diverse fidelities across multiple disciplines, (ii) physics-constrained data-augmented modeling for improved empiricism, (iii) generative manifold embedding for high dimensional concurrent design without gradient information; (iv) budget-constrained fidelity-adaptive sampling towards fewer design iterations.

33 ADVANCED PROPULSION SYSTEMS↗

Adjoint waveform tomography of East Asia for improved waveform prediction

We present a preliminary version of the East Asia Tomography (EAT) model, an adjoint waveform tomography model of East and Southeast Asia. We used SPiRaL (Simmons et al., 2021) as our starting model and source parameters for 238 earthquakes from the Global Centroid Moment Tensor catalogue (Ekström et al., 2012). After 50 iterations on Lawrence Livermore National Laboratory’s Lassen supercomputer, we converge on a model with a minimum period of 50 seconds. The preliminary model shows improved slab structure compared to SPiRaL and shows significantly reduced misfit. In later versions of the model, we aim to harness techniques proposed in other studies to improve waveform predictions that travel through the ocean (e.g., Wehner et al., 2022) and use relative amplitude-based misfit functions (e.g., Tao et al., 2018) to better constrain Earth structure. We hope to iterate the current extent of the model to 25 seconds minimum period before iterating to shorter periods for a smaller subregion of the full model.

58 GEOSCIENCES↗

The Circular Home: Development and Demonstration of a Net Negative Carbon, Reusable Residence

This project started the development of an innovative modular building system intended for residential construction. The project was centered around single-family homes that were carbon-negative cradle-to-grave over a 100 year time frame, which is approximately double the current standard for operational life. The project sought to accomplish this objective by designing the modular home in a manner that ensures circularity, where the main house components can be used over several consecutive 50-year lifespans. To accomplish these objectives, this project utilized integrated design with the inclusion of life-cycle assessment to design the single-family house for architectural, structural, energy, mechanical, thermal, and moisture demands, while ensuring carbon negativity and annual net-zero energy use. The core technology of this project was the use of cross-laminated timber and biogenic materials, such as wood-fiber insulation, in the construction of the modular building units. The robustness and factory manufacturing ability of cross-laminated timber allow for factory construction of most of the home, which minimizes on-site time, saving money and reducing construction waste. During this project, initial milestones were met that delivered the architectural plans for the circular home and an initial structural testing matrix. Compared to current code-built homes, which average 13 kg CO2eq. / ft2 and are demolished at their end of life, the circular home has an estimated -30 kg CO2eq. / ft2 of embodied carbon emissions during its first build iteration. It is estimated that approximately 60%-70% of the total building mass could be reused and/or recycled during subsequent rebuilds. This project was concluded at approximately the 1/3 point and a separate project was established to conclude the remaining milestones. This project promises to benefit the public by delivering another option for single-family, and eventually multi-family, housing using a novel building construction system. The system of reusable modular construction facilitates not only lower emissions during the first building iteration, but also lower emissions during subsequent iterations that drastically reduce waste and help society meet its climate goals. Many other industries, such as clothing and technology sectors, are starting to focus on circularity and this project adds the residential building construction industry to that list.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

wa-hls4ml and lui-gnn: A benchmark and GNN-based surrogate model for hls4ml resource and latency estimation

As machine learning (ML) increasingly serves as a tool for addressing real-time challenges in scientific applications, the development of advanced tooling has significantly reduced the time required to iterate on various designs. These advancements have solved major obstacles, but also exposed new challenges. For example, processes that were not previously considered bottlenecks, such as model synthesis, are now becoming limiting factors in the rapid iteration of designs. To reduce these emerging constraints, multiple efforts are being launched toward designing an ML-based surrogate model that estimates resource usage of synthesized accelerator architectures. This model would reduce the design iteration time, especially when designing within a set of given hardware constraints. This approach shows considerable potential, but as it stands, the effort is early and would benefit from coordination and standardization to assist future work as it emerges. We introduce wa-hls4ml, a benchmark for ML accelerator resource and latency estimation, and its corresponding initial dataset of more than 100,000 fully connected neural networks, all synthesized using hls4ml and targeting Xilinx FPGAs. In addition to the resource utilization and latency data provided, the dataset includes generated artifacts and log files for many of the synthesized neural networks, in order to support future research in ML-based code generation. The benchmark evaluates the performance of resource and latency predictors against several common ML model architectures, primarily originating from scientific domains, as exemplar models, as well as the average performance across a subset of the dataset. We measure the performance of a given predictor model through multiple metrics, including $R^2$ score and SMAPE on regression tasks, as well as inference time to further characterize the estimator under test. Additionally, we introduce the latency/utilization inference graph neural network (lui-gnn), a surrogate model that uses a graph neural network to represent input architectures in the form of a directed graph. This graph representation allows for a diverse set of model architectures to all be effectively handled by a surrogate model. We present the architecture and performance of the model, as evaluated by the new proposed benchmark, including SMAPE, $R^2$ score, and inference times, and find that lui-gnn generally predicts latency and utilization for the 75\% quantile within several percent of the synthesized resources on the synthetic test dataset, indicating that this approach of estimating resource and latency via a surrogate models has promise and warrants further research.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Machine Learning for Real-time Fusion Plasma Behavior Prediction and Manipulation (Final Report)

The goal of this project is to implement real-time analysis of 2D Beam Emission Spectroscopy (BES) data to predict and control transient and high-bandwidth events at DIII-D. In essence, we wish to bring high-bandwidth fluctuation diagnostics into the realm of real-time measurements and control. The BES ML models will necessarily be deep neural networks (DNN) with a “data flow” architecture for compatibility with high-throughput, low-latency evaluation on a field-programmable gate array (FPGA) or other emerging processor technologies. The real-time output will be fed to the plasma control system (PCS) for real-time control tasks, specifically for ELM control and avoidance and for QH-mode access and sustainment. We anticipate that the real-time analysis of fluctuation diagnostics will create new enabling technologies to predict and control transient events such as confinement mode transitions, edge-localized modes, Alfven eigenmode events, and disruptions. The proposed research is aligned with ITER research needs and DIII-D programmatic goals. For instance, the prediction and avoidance of ELM events is critical for ITER machine safety. Also, H-mode access with RMP ELM suppression in ITER is an active research area due to high separatrix density, narrow SOL width, and elevated LH transition power threshold.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Solar and Storage Integration in the U.S. Southeast: Implications for Resource Adequacy [Slides]

In this study, we evaluate how an iterative portfolio approach compares to a more traditional capacity credit method, using the U.S. Southeast as a case study region. Using open-source planning and resource adequacy tools, we compare results using a capacity credit approximation method with those from iterating behind the two. We also explore how the iterative approach performs under a range of sensitivities, including higher load growth, regional coordination, and alternative weather years. We find that traditional capacity credit approximation methods can function well in today's system, but may face challenges for systems with higher levels of solar and storage. As such, integrating planning and resource adequacy models can address some of these gaps, helping planners deliver more reliable systems.

14 SOLAR ENERGY↗

Latency considerations for stochastic optimizers in variational quantum algorithms

Variational quantum algorithms, which have risen to prominence in the noisy intermediate-scale quantum setting, require the implementation of a stochastic optimizer on classical hardware. To date, most research has employed algorithms based on the stochastic gradient iteration as the stochastic classical optimizer. In this work we propose instead using stochastic optimization algorithms that yield stochastic processes emulating the dynamics of classical deterministic algorithms. This approach results in methods with theoretically superior worst-case iteration complexities, at the expense of greater per-iteration sample (shot) complexities. We investigate this trade-off both theoretically and empirically and conclude that preferences for a choice of stochastic optimizer should explicitly depend on a function of both latency and shot execution times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Partitioned Quantum Subspace Expansion

We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative sequence and provide numerical evidence that these good sequences display improved numerical stability over a single step in the presence of finite sampling noise. Implementing the generalisation requires additional classical processing with a polynomial overhead in the subspace dimension. By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware. Our work suggests that the numerical instability limiting the accuracy of this approach can be substantially alleviated in a parameter-free way.

97 MATHEMATICS AND COMPUTING↗

Robust Control of Wave Energy Converters Using Unstructured Uncertainty

In the design of ocean wave energy converters, proper control design is essential to the maximization of the power generation performance for the device. However, in realistic applications, this control design must be undertaken in the presence of model uncertainty. This paper considers the use of robust control theory to optimize the nominal performance for a wave energy converter in stochastic waves, subject to the constraint that the controller be stability-robust to unstructured uncertainties. We formulate the problem as a multi-objective optimal control problem, in which the primary objective is the maximization of power generation for the nominal system, and the competing objective is the norm of the uncertainty input/output channel. This optimal control problem is nonconvex, and we therefore propose an iterative algorithm that can be used to arrive at a local optimal solution. This iterative approach employs the concept of Iterative Convex Overbounding, in the context of the classical Method of Centers. Here, the methodology is demonstrated on a model of a single, buoy- type wave energy converter.

16 TIDAL AND WAVE POWER↗

Learning-Accelerated ADMM for Distributed DC Optimal Power Flow

We propose a novel data-driven method to accelerate the convergence of Alternating Direction Method of Multipliers (ADMM) for solving distributed DC optimal power flow (DC-OPF) where lines are shared between independent network partitions. Using previous observations of ADMM trajectories for a given system under varying load, the method trains a recurrent neural network (RNN) to predict the converged values of dual and consensus variables. Given a new realization of system load, a small number of initial ADMM iterations is taken as input to infer the converged values and directly inject them into the iteration. We empirically demonstrate that the online injection of these values into the ADMM iteration accelerates convergence by a significant factor for partitioned 14-, 118- and 2848-bus test systems under differing load scenarios. The proposed method has several advantages: it maintains the security of private decision variables inherent in consensus ADMM; inference is fast and so may be used in online settings; RNN-generated predictions can dramatically improve time to convergence but, by construction, can never result in infeasible ADMM subproblems; it can be easily integrated into existing software implementations. While we focus on the ADMM formulation of distributed DC-OPF in this paper, the ideas presented are naturally extended to other distributed optimization problems.

alternating direction method of multipliers↗