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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Prototype tests of the electromagnetic particle injector-2 for fast time response disruption mitigation in tokamaks

Predicting and controlling disruptions is an important and urgent issue for ITER. Some disruptions with a short warning time may be unavoidable. For these cases, a fast time response disruption mitigation method is essential. Experimental tests on a prototype system of a novel, rapid time-response disruption mitigation system being developed for tokamak-based reactors and as a backup option for ITER, referred to as the electromagnetic particle injector (EPI), have been able to verify the primary advantages of the concept. These are its ability to meet short warning time scales of <10 ms while attaining the projected high velocities for deep radiative payload penetration in reactor-scale plasmas. The EPI relies on an electromagnetic propulsion system. A metallic sabot is accelerated electromagnetically to the required velocities (>1 km s -1 ) within 2 ms, at which point it releases a radiative payload consisting of a shell pellet or well-defined microspheres. Initial experimental tests from the prototype system show attainment of over 600 m s -1 in about 1 ms. Finally, essential aspects of payload separation from the sabot and sabot capture have also been demonstrated at 200 m s -1 , and the method can be extended to over 2 km s -1 .

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Novel strategies for modal-based structural material identification

Here, we present modal-based methods for model calibration in structural dynamics, and address several key challenges in the solution of gradient-based optimization problems with eigenvalues and eigenvectors, including the solution of singular Helmholtz problems encountered in sensitivity calculations, non-differentiable objective functions caused by mode swapping during optimization, and cases with repeated eigenvalues. Unlike previous literature that relied on direct solution of the eigenvector adjoint equations, we present a parallel iterative domain decomposition strategy (Adjoint Computation via Modal Superposition with Truncation Augmentation) for the solution of the singular Helmholtz problems. For problems with repeated eigenvalues we present a novel Mode Separation via Projection algorithm, and in order to address mode swapping between inverse iterations we present a novel Injective mode ordering metric. We present the implementation of these methods in a massively parallel finite element framework with the ability to use measured modal data to extract unknown structural model parameters from large complex problems. A series of increasingly complex numerical examples are presented that demonstrate the implementation and performance of the methods in a massively parallel finite element framework [7], [5], using gradient-based optimization techniques in the Rapid Optimization Library (ROL) [21].

36 MATERIALS SCIENCE↗
DOE OSTI2022

Asynchronous domain decomposition methods for nonlinear PDEs

One- and two-level parallel asynchronous methods for the numerical solution of nonlinear systems of equations, especially those arising from (nonlinear) partial differential equations, are studied. The proposed methods are based on domain decomposition techniques. Local convergence theorems are presented in several cases, with appropriate hypotheses. Computational results on a shared memory multiprocessor machine for various problems exhibiting nonlinearities are reported, illustrating the potential of these asynchronous methods, especially for heterogeneous clusters.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Inverse Calculation of Burden Distribution Matrix Using B-spline Model Based PDF control in Blast Furnace Burden Charging Process

The inverse calculation of burden distribution matrix (BDM) is one of the most important challenges in the blast furnace operation in iron-making processes. In general, blast furnace consumes 65% of the total energy for the whole steel-making. Focusing on this practical challenge, this article proposes a new burden distribution spatial model in calculating burden charging process, and develops a B-spline approximation-based probability density function (PDF) control algorithm to assign the expected thickness distribution of burden layer and, thus, develops a new method for the required inverse calculation of BDM. First, a novel method for the thickness distribution of burden layer is given using B-spline model to produce an expected distribution shape subjected to a desired tracking within a specific spatial constraint. Then, according to the coexistence of continuous and bounded discrete variables in BDM, a novel hybrid optimization control method by combining integer programming and PDF tracking is further established for the effective inverse calculation of BDM. Finally, the proposed PDF-based iterative inverse calculation of BDM using B-spline models are tested using various data from industrial examples. Furthermore, the simulation results show that the proposed method is well suited to solve the BDM inverse calculation problem in practice.

42 ENGINEERING↗
DOE OSTI2020

A quadratic programming flux correction method for high-order DG discretizations of S transport

In this work, we present a new flux-fixup approach for arbitrarily high-order discontinuous Galerkin (DG) discretizations of the S N transport equation, and we demonstrate the compatibility of this approach with the Variable Eddington Factor (VEF) method. The new fixup approach is sweep-compatible: during a transport sweep (block Gauss-Seidel iteration in which the scattering source is lagged), a local quadratic programming (QP) problem is solved in each spatial element to ensure that the solution satisfies certain physical constraints, including local particle balance. In this paper, we describe two choices of physical constraints, resulting in two variants of the method: QP Zero (QPZ) and QP Maximum Principle (QPMP). In QPZ, the finite element coefficients of the solution are constrained to be nonnegative. In QPMP, they are constrained to adhere to an approximate discrete maximum principle. There are two primary takeaways in this paper. First, when the positive Bernstein basis is used for DG discretization, the QPMP method eliminates negativities, preserves high-order accuracy for smooth problems, and significantly dampens unphysical oscillations in the solution. The latter feature – the dampening of unphysical oscillations – is an improvement upon standard, simpler fixup approaches such as the approach described in (denoted as the “zero and rescale” (ZR) method in this paper). This improvement comes at a moderate computational cost, but it is not prohibitive. Our results show that, even in an unrealistic worst-case scenario where 83% of the spatial elements require a fixup, the computational cost of performing a transport sweep with fixup is only ~31% greater than performing one without fixup. The second takeaway is that the VEF method can be used to accelerate the convergence of transport sweeps even when a fixup is applied. When optically thick regions are present, transport sweeps converge slowly, regardless of whether a fixup is applied, and acceleration is needed. However, attempting to apply standard diffusion synthetic acceleration (DSA) to fixed-up transport sweeps results in divergence for optically thick problems. Our results show that the same is not true for VEF. When VEF is combined with fixed-up transport sweeps, the result is a scheme that produces a nonnegative solution, converges independently of the mean free path, and, in the case of the QPMP fixup, adheres to an approximate discrete maximum principle.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The ABCs of phase retrieval: Connecting the acronyms of scanning transmission electron microscopy

High-resolution scanning transmission electron microscopy (S/TEM) is an indispensable tool for characterizing the structure and properties of materials down to the atomic scale. Conventional S/TEM imaging, however, is limited by the phase problem, whereby the phase of the electron exit wave is lost upon detection. Recent advances in diffractive imaging and 4D-STEM have enabled a range of phase-retrieval techniques that computationally reconstruct the missing information encoded in the phase of the transmission function. These approaches offer improved dose efficiency and enhanced sensitivity to weakly scattering signals, extending quantitative imaging to beam-sensitive materials composed of light elements. In this work, we introduce the phase problem in electron microscopy and survey the diverse landscape of phase-retrieval techniques used in the field. Despite their many acronyms and algorithmic variations, these techniques share a common physical and mathematical foundation. We present a unified framework that connects these seemingly distinct methods, from parallax imaging and tilt-corrected bright-field (tcBF-STEM), to aberration-corrected bright-field (acBF-STEM), optimum bright-field (OBF-STEM) and single-sideband (SSB) ptychography, as well as first-moment integrated center of mass techniques (iCOM) and iterative ptychographic algorithms. Based on these insights, we discuss the opportunities and practical limitations of applying these methods across different materials systems, detector designs, and microscope configurations.Graphical abstractRepresentative electron microscopy configurations used for phase retrieval and diffractive imaging in S/TEM: (a) Zernike phase-contrast transmission electron microscopy (TEM), (b) small-convergence-angle four-dimensional scanning transmission electron microscopy (4D-STEM) for nanobeam-based phase reconstruction methods, and (c) large-convergence-angle 4D-STEM for ptychographic and related diffractive imaging techniques reviewed in this work.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Learning-Accelerated ADMM for Distributed DC Optimal Power Flow

We suggest 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.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

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↗
DOE OSTI2022

Dancoff-based Wigner-Seitz approximation for the subgroup resonance self-shielding in the VERA neutronic simulator MPACT

The MPACT neutronics module of the Virtual Environment for Reactor Analysis (VERA) has used the subgroup method for resonance self-shielding calculation, for which two-dimensional (2D) fixed-source transport calculations are performed using the method of characteristics for resonance energy groups. When considering thermal feedbacks, the subgroup calculation must be performed at each outer iteration. Therefore, the computing time for cross section processing is a significant burden for computational efficiency. The Dancoff-based Wigner-Seitz approximation (DWA) capability has been implemented into MPACT in conjunction with the subgroup method, which has been used in SCALE/XSProc since SCALE version 6.0 and has recently been called an equivalent Dancoff-factor cell (EDC) method. The issue of relatively large reactivity bias in DWA for the gadolinia rods was resolved by introducing multiple Dancoff factors. Benchmark results for the VERA pressurized and boiling water reactor benchmark suites show that the DWA capability would significantly enhance computational efficiency with comparable accuracy. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. Here, the main challenge of such computations is the high memory effort of classical solvers, which limits the accuracy of chosen discretizations. In this work, we derive a method for the computation of effective eigenvalues when the underlying solution has a low-rank structure. This is accomplished by utilizing dynamical low-rank approximation (DLRA), which is an efficient strategy to derive time evolution equations for low-rank solution representations. The main idea is to interpret the iterates of the classical inverse power iteration as pseudo-time steps and apply the DLRA concepts in this framework. In our numerical experiment, we demonstrate that our method significantly reduces memory requirements while achieving the desired accuracy. Analytic investigations show that the proposed iteration scheme inherits the convergence speed of the inverse power iteration, at least for a simplified setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Bayesian Optimization of Catalysis with In-Context Learning

Large language models (LLMs) can perform accurate classification with zero or few examples through in-context learning (ICL), allowing the model to observe query-relevant examples at inference time and eliminating the need for additional weight updates to generalize beyond its original training data. We extend this capability to regression with uncertainty estimation using frozen LLMs (e.g., GPT-4o, Gemini), enabling Bayesian optimization (BO) in natural language without explicit model training or feature engineering. We apply this to materials discovery by representing materials as synthesis and testing procedures for use in natural language prompts. This Bayesian, design-first approach prioritizes optimization toward target material properties before detailed characterization, in contrast to conventional experimental workflows that often emphasize characterization of suboptimal materials. On benchmarks like aqueous solubility and oxidative coupling of methane (OCM), BO-ICL matches or outperforms Gaussian processes. In live experiments on the reverse water–gas shift (RWGS) reaction, BO-ICL identifies multimetallic catalysts that approach equilibrium CO yield within 6 and 10 iterations from a pool of 3,700 and 360,000 candidates, respectively. Our method redefines materials representation and accelerates discovery, with broad applications across catalysis, materials science, and AI.

Calibration↗
DOE OSTI2026

Mesh-based multiphysics coupling acceleration for fusion neutronics through clustering for fusion blanket applications

Accurate modeling of particle transport within fusion blankets is essential for predicting performance metrics such as heat deposition and the tritium breeding ratio (TBR). However, high-fidelity coupling of thermal fluids from computational fluid dynamics (CFD) to neutronics simulations often incurs significant computational costs due to the complexity of surface intersection calculations in Monte Carlo codes. This paper presents an accelerated multiphysics coupling method for neutronics that utilizes hierarchical agglomerative clustering to map complex material property distributions to a neutronics model. Implemented within the fusion reactor design and assessment (FREDA) framework, the method leverages existing Python packages to automate the creation of clustered geometries for OpenMC. The approach is demonstrated on a sector model of an ARC-class tokamak with an immersion molten salt blanket, and an simple geometry with varying isotopic concentrations. Results show that the clustering method significantly reduces computational burden without compromising fidelity, providing a foundation for agile iteration of neutronics simulations involving multiple coupled material properties.

Bae, Jin Whan [ORNL] (ORCID:0000000326548907)↗
DOE OSTI2024

Matilda v1.0: An R package for probabilistic climate projections using a reduced complexity climate model

A primary advantage to using reduced complexity climate models (RCMs) has been their ability to quickly conduct probabilistic climate projections, a key component of uncertainty quantification in many impact studies and multisector systems. Providing frameworks for such analyses has been a target of several RCMs used in studies of the future co-evolution of the human and Earth systems. In this paper, we present Matilda, an open-science R software package that facilitates probabilistic climate projection analysis, implemented here using the Hector simple climate model in a seamless and easily applied framework. The primary goal of Matilda is to provide the user with a turn-key method to build parameter sets from literature-based prior distributions, run Hector iteratively to produce perturbed parameter ensembles (PPEs), weight ensembles for realism against observed historical climate data, and compute probabilistic projections for different climate variables. This workflow gives the user the ability to explore viable parameter space and propagate uncertainty to model ensembles with just a few lines of code. The package provides significant freedom to select different scoring criteria and algorithms to weight ensemble members, as well as the flexibility to implement custom criteria. Additionally, the architecture of the package simplifies the process of building and analyzing PPEs without requiring significant programming expertise, to accommodate diverse use cases. We present a case study that provides illustrative results of a probabilistic analysis of mean global surface temperature as an example of the software application.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Integration of sensors through additive manufacturing leading to increased efficiencies of gas turbines for power generation and propulsion

To realize the full capability of additively manufactured components in complex energy systems, it is imperative to minimize early component failures during development phases and during operation. Traditional field feedback timelines and offline inspection protocols significantly reduce the design-manufacturing iteration times. To address this specific question, the project developed and demonstrated a method for the integration of sensors into complex components through additive manufacturing. The team used gas turbine engines as a platform, which meets the need of both power generation and propulsion and offer opportunities for cost reductions and efficiency increases. The innovation of this intelligent integration of sensors into complex components uniquely customized to address questions of integrity and durability for additively manufactured components. With real-time sensing data from additively manufactured components, turbine manufacturers will realize higher efficiencies, reduced component failures, and a 30-50% acceleration in product deployment of high efficiency gas turbine components due to a faster reduction in component risk assessment under actual operating conditions. This is a transformative shift towards a data-driven design and qualification of additively manufactured gas turbine components. To directly integrate sensors into additively manufactured components with all the complexities of actual hardware, powder bed fusion (direct metal laser sintering) and laser metal deposition technologies was developed. Validation took take place in two university laboratories both of which contain actual engine hardware and closely simulate a gas turbine prior to demonstrating the technology in a turbine development test. Indeed, two major technologies from this research cold impact turbine systems in the near future: (1) higher efficiency materials and designs enabled by additive manufacturing with 50% faster design to manufacturing cycle time, to enable faster time-to-market targets; and (2) integration of sensors into additively manufactured components enabling broad health and condition based prognostics for faster component and engine risk reduction.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Implicit Multirate GARK Methods

This article considers multirate generalized-structure additively partitioned Runge–Kutta methods for solving stiff systems of ordinary differential equations with multiple time scales. These methods treat different partitions of the system with different timesteps for a more targeted and efficient solution compared to monolithic single rate approaches. With implicit methods used across all partitions, methods must find a balance between stability and the cost of solving nonlinear equations for the stages. In order to characterize this important trade-off, we explore multirate coupling strategies, problems for assessing linear stability, and techniques to efficiently implement Newton iterations for stage equations. Unlike much of the existing multirate stability analysis which is limited in scope to particular methods, we present general statements on stability and describe fundamental limitations for certain types of multirate schemes. New implicit multirate methods up to fourth order are derived, and their accuracy and efficiency properties are verified with numerical tests.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Feasibility of DEIM for retrieving the initial field via dimensionality reduction

When parameter estimation is solved in a high-dimensional space, the dimensionality reduction strategy becomes the primary consideration for alleviating the tremendous computational cost. Here, the discrete empirical interpolation method (DEIM) is explored to retrieve the initial condition (IC) by combining the polynomial chaos (PC) based ensemble Kalman filter (i.e. PC-EnKF), where a non-intrusive PC expansion is considered as a surrogate model in place of the forward model in the prediction step of the ensemble Kalman filter, resulting in fewer forward model integrations but with a comparable accuracy as Monte Carlo-based approaches. The DEIM acts as a hyper-reduction tool to provide the low-dimensional input for the high-dimensional initial field, which can be reconstructed using the information on the sparse interpolation grid points that is adaptively obtained through PC-EnKF data assimilation method. Thus an innovative framework to reconstruct the IC is developed. The detailed procedure at each assimilation iteration includes: the determination of the spatial interpolation points, the estimation of the initial values on the interpolation locations using the optimal observations, and the reconstruction of IC in the full space. The current study uses the reconstruction field of initial conditions of the Navier-Stokes equations as an example to illustrate the efficacy of our method. The experimental results demonstrate the proposed algorithm achieves a satisfactory reconstruction for the initial field. The proposed method helps to extend the applicable area of DEIM in solving inverse problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Fast explicit solutions for neutrino-electron scattering: Explicit asymptotic methods

Here, we present results of explicit asymptotic approximations applied to neutrino-electron scattering in a representative model of neutrino population evolution under conditions characteristic of core-collapse supernova explosions or binary neutron star mergers. It is shown that this approach provides stable solutions of these stiff systems of equations, with accuracy and time stepping comparable to that for standard implicit treatments such as backward Euler, fixed point iteration, and Anderson-accelerated fixed point iteration. Because each time step can be computed more rapidly with the explicit asymptotic approximation than with implicit methods, this suggests that algebraically stabilized explicit integration methods could be used to compute neutrino evolution coupled to hydrodynamics more efficiently in stellar explosions and mergers than the methods currently in use.

79 ASTRONOMY AND ASTROPHYSICS↗