Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational costs”

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 649 records · Page 36

Autoregressive long-horizon prediction of plasma edge dynamics *

Accurate modeling of scrape-off layer (SOL) and divertor-edge dynamics is vital for designing plasma-facing components in fusion devices. High-fidelity edge fluid/neutral codes such as SOLPS-ITER capture SOL physics with high accuracy, but their computational cost limits broad parameter scans and long transient studies. We present transformer-based, autoregressive surrogates for efficient prediction of 2D, time-dependent plasma edge state fields. Trained on SOLPS-ITER spatiotemporal data for the KSTAR tokamak, the surrogates forecast electron temperature, electron density, and radiated power over extended horizons. We evaluate model variants trained with increasing autoregressive horizons (1–100 steps) on short- and long-horizon prediction tasks. Longer-horizon training systematically improves rollout stability and mitigates error accumulation, enabling stable predictions over hundreds to thousands of steps and reproducing key dynamical features such as the motion of high-radiation regions. Measured end-to-end wall-clock times show the surrogate is orders of magnitude faster than SOLPS-ITER, enabling rapid parameter exploration. Prediction accuracy degrades when the surrogate enters physical regimes not represented in the training dataset, motivating future work on data enrichment and physics-informed constraints. Overall, this approach provides a fast, accurate surrogate for computationally intensive plasma edge simulations, supporting rapid scenario exploration, control-oriented studies, and progress toward real-time applications in fusion devices.

autoregressive deep learning↗

Multi-Area Distribution System State Estimation Using Decentralized Physics-Aware Neural Networks

The development of active distribution grids requires more accurate and lower computational cost state estimation. In this paper, the authors investigate a decentralized learning-based distribution system state estimation (DSSE) approach for large distribution grids. The proposed approach decomposes the feeder-level DSSE into subarea-level estimation problems that can be solved independently. The proposed method is decentralized pruned physics-aware neural network (D-P2N2). The physical grid topology is used to parsimoniously design the connections between different hidden layers of the D-P2N2. Monte Carlo simulations based on one-year of load consumption data collected from smart meters for a three-phase distribution system power flow are developed to generate the measurement and voltage state data. The IEEE 123-node system is selected as the test network to benchmark the proposed algorithm against the classic weighted least squares and state-of-the-art learning-based DSSE approaches. Numerical results show that the D-P2N2 outperforms the state-of-the-art methods in terms of estimation accuracy and computational efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Adaptive Determination of the Optimal Exchange Location in Wall-Modeled Large-Eddy Simulation

Wall-modeled large-eddy simulation introduces a modeling interface (or exchange location) separating the wall-modeled layer from the rest of the domain. The current state-of-the-art is to rely on user expertise when choosing where to place this modeling interface, whether this choice is tied to the grid or not. This paper presents a postprocessing algorithm that determines the exchange location systematically. The algorithm is based on a model for the error in the predicted wall shear stress and a model for the computational cost, and then finds the exchange location that minimizes a combination of the two. Here, the algorithm is tested both a priori and a posteriori using an equilibrium wall model for the flow over a wall-mounted hump, a boundary layer in an adverse pressure gradient, and a shock/boundary-layer interaction. The algorithm produces exchange locations that mostly agree with what an experienced user would suggest, with thinner wall-modeled layers in nonequilibrium flow regions and thicker wall-modeled layers where the boundary layer is closer to equilibrium. This suggests that the algorithm should be useful in simulations of realistic and highly complex geometries.

42 ENGINEERING↗

Smart Proxy Modeling Application of Artificial Intelligence & Machine Learning in Computational Fluid Dynamics

Smart proxy technology leverages the art of artificial intelligence and machine learning in order to build accurate and very fast proxy models for highly complex numerical simulation models. In this project, smart proxy technology is used to replicate the results of a highly complex single phase CFD simulation with reasonable degree of accuracy while reducing the computational cost associated with such CFD simulations. The CFD model under study simulates the combustion of natural gas under various conditions such as varying natural gas composition and flow rate, inlet air flow rate and temperature, and outlet pressure in a High-Pressure Combustion Facility (B6 Combustor) with more than 4 million simulation cells. Only eight CFD simulation runs were used to create a smart proxy model that replicates the detail distribution of Pressure, Temperature, Nitrogen, Oxygen and Carbon-dioxide concentration in the CFD simulation model in seconds with less than 10% error.

03 NATURAL GAS↗

Moment-based adaptive time integration for thermal radiation transport

Here, in this paper we develop a framework for moment-based adaptive time integration of deterministic multifrequency thermal radiation transpot (TRT). We generalize our recent semi-implicit-explicit (IMEX) integration framework for gray TRT to multifrequency TRT, and also introduce a semi-implicit variation that facilitates higher-order integration of TRT, where each stage is implicit in all components except opacities. To appeal to the broad literature on adaptivity with Runge–Kutta methods, we derive new embedded methods for four asymptotic preserving IMEX Runge–Kutta schemes we have found to be robust in our previous work on TRT and radiation hydrodynamics. We then use a moment-based high-order-low-order representation of the transport equations. Due to the high dimensionality, memory is always a concern in simulating TRT. We form error estimates and adaptivity in time purely based on temperature and radiation energy, for a trivial overhead in computational cost and memory usage compared with the base second order integrators. We then test the adaptivity in time on the tophat and Larsen problem, demonstrating the ability of the adaptive algorithm to naturally vary the timestep across 4–5 orders of magnitude, ranging from the dynamical timescales of the streaming regime to the thick diffusion limit.

97 MATHEMATICS AND COMPUTING↗

Improved Water Sound Synthesis using Coupled Bubbles

We introduce a practical framework for synthesizing bubble-based water sounds that captures the rich inter-bubble coupling effects responsible for low-frequency acoustic emissions from bubble clouds. We propose coupled-bubble oscillator models with regularized singularities, and techniques to reduce the computational cost of time stepping with dense, time-varying mass matrices. Airborne acoustic emissions are estimated using finite-difference time-domain (FDTD) methods. We propose a simple, analytical surface-acceleration model, and a sample-and-hold GPU wavesolver that is simple and faster than prior CPU wavesolvers. Sound synthesis results are demonstrated using bubbly flows from incompressible, two-phase simulations, as well as procedurally generated examples using single-phase FLIP fluid animations. Our results demonstrate sound simulations with hundreds of thousands of bubbles, and perceptually significant frequency transformations with fuller low-frequency content.

Computer Science↗

Processing Aleatory and Epistemic Uncertainties in Experimental Data From Sparse Replicate Tests of Stochastic Systems for Real-Space Model Validation

This paper presents a practical methodology for propagating and processing uncertainties associated with random measurement and estimation errors (that vary from test-to-test) and systematic measurement and estimation errors (uncertain but similar from test-to-test) in inputs and outputs of replicate tests to characterize response variability of stochastically varying test units. Also treated are test condition control variability from test-to-test and sampling uncertainty due to limited numbers of replicate tests. These aleatory variabilities and epistemic uncertainties result in uncertainty on computed statistics of output response quantities. The methodology was developed in the context of processing experimental data for “real-space” (RS) model validation comparisons against model-predicted statistics and uncertainty thereof. The methodology is flexible and sufficient for many types of experimental and data uncertainty, offering the most extensive data uncertainty quantification (UQ) treatment of any model validation method the authors are aware of. It handles both interval and probabilistic uncertainty descriptions and can be performed with relatively little computational cost through use of simple and effective dimension- and order-adaptive polynomial response surfaces in a Monte Carlo (MC) uncertainty propagation approach. A key feature of the progressively upgraded response surfaces is that they enable estimation of propagation error contributed by the surrogate model. Sensitivity analysis of the relative contributions of the various uncertainty sources to the total uncertainty of statistical estimates is also presented. Finally, the methodologies are demonstrated on real experimental validation data involving all the mentioned sources and types of error and uncertainty in five replicate tests of pressure vessels heated and pressurized to failure. Simple spreadsheet procedures are used for all processing operations.

97 MATHEMATICS AND COMPUTING↗

Enhancements to Overset Methods for Achieving Higher Accuracy and Solution Convergence: Preprint

Overset methods, when utilized within a multi-solver framework, provide a very flexible and powerful toolset for analyzing moving body problem. However, many overset framework suffer from several deficiencies such as (1) convergence degradation of the non-linear iterative schemes (2) difficulty in achieving higher-order accuracy and (3) high computational costs over long simulation times. In this work, we explore approaches that mitigate these deficiencies and provide a pathway for improved accuracy and fidelity of overset methods. A high-order, discontinuous Galerkin solver is integrated into an existing overset framework and applied to an unsteady ROBIN fuselage case. For convergence acceleration, an Overset-GMRES linear solver with a timestep controller is applied to a DLR-F6 aircraft steady simulation and an unsteady, notional rotor-fuselage. Finally the same rotor-fuselage case as well as the JVX rotor/wing case is simulated using a reduced-order aerodynamic model.

aerospace↗

Efficient quadrature rules for finite element discretizations of nonlocal equations

Here, in this paper, we design efficient quadrature rules for finite element (FE) discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work, we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient FE assembly.

97 MATHEMATICS AND COMPUTING↗

Efficient and flexible multirate temporal adaptivity

In this work we present two new families of multirate time step adaptivity controllers, that are designed to work with embedded multirate infinitesimal (MRI) time integration methods for adapting time steps when solving problems with multiple time scales. We compare these controllers against competing approaches on two benchmark problems, showing that the proposed methods offer dramatically improved performance and flexibility. The combination of embedded MRI methods and the proposed controllers enable adaptive simulations of problems with a potentially arbitrary number of time scales, achieving high accuracy while maintaining low computational cost. Additionally, we introduce a new set of embeddings for the family of explicit multirate exponential Runge–Kutta (MERK) methods of orders 2 through 5, resulting in the first-ever fifth-order embedded MRI method. Finally, we compare the performance of a wide range of embedded MRI methods on our benchmark problems to provide guidance on how to select an appropriate MRI method and multirate controller.

97 MATHEMATICS AND COMPUTING↗

Efficient quadrature rules for finite element discretizations of nonlocal equations

In this paper we design efficient quadrature rules for finite element discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first showthat the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient finite element assembly.

97 MATHEMATICS AND COMPUTING↗

Optimizing group structures using hierarchical division

Creating group structures with few groups that give low errors is a difficult problem in reactor analysis. In recent years, automated optimization techniques have been applied to this task. We continue this trend by applying the hierarchical division algorithm to generate optimized group structures that minimize a cost function. At each stage, the algorithm adds a single group boundary to an existing group structure, dividing one group into two to increase the resolution of the group structure. The location of the added boundary is the one that gives the lowest error over all possible new boundary locations. Our implementation requires a beginning group structure, a set of candidate new boundary locations, and a set of reference reaction rates. As a proof of concept, we used WIMS-69 as the initial group structure, XMAS-172 as the ending group structures, and a 344-group reference group structure. Testing on two simple, homogenized reactor problems, we found that hierarchical division was able to reduce the error by a factor of around 5 with an increase of only 15% in the number of groups. Because hierarchical division can get stuck in local minima, it often reaches a plateau in its error reduction capability as many groups are added. Nevertheless, we find hierarchical division has strong potential to make good group structures into great group structures at a modest increase in computational cost. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Feasible Actuator Range Modifier (FARM), a Tool Aiding the Solution of Unit Dispatch Problems for Advanced Energy Systems

Integrated energy systems (IESs) seek to minimize power generating costs in future power grids through the coupling of different energy technologies. To accommodate fluctuations in load demand due to the penetration of renewable energy sources, flexible operation capabilities must be fully exploited, and even power plants that are traditionally considered as base-load units need to be operated according to unconventional paradigms. Thermomechanical loads induced by frequent power adjustments can accelerate the wear and tear. If a unit is flexibly operated without respecting limits on materials, the risk of failures of expensive components will eventually increase, nullifying the additional profits ensured by flexible operation. In addition to the bounds on power variations (explicit constraints),the solution of the unit dispatch problem needs to meet the limits on the variation of key process variables, including temperature, pressure and flow rate (implicit constraints).The FARM (Feasible Actuator Range Modifier) module was developed to enable existing optimization algorithms to identify solutions to the unit dispatch problem that are both economically favorable and technologically sustainable. Thanks to the iterative dispatcher–validator scheme, FARM permits addressing all the imposed constraints without excessively increasing the computational costs. In this work, the algorithms constituting the module are described, and the performance was assessed by solving the unit dispatch problem for an IES composed of three units, i.e., balance of plant, gas turbine, and high-temperature steam electrolysis. Finally, the FARM module provides dedicated tools for visualizing the response of the constrained variables of interest during operational transients and a tool aiding the operator at making decisions. These techniques might represent the first step towards the deployment of an ecological interface design (EID) for IES units.

47 OTHER INSTRUMENTATION↗

A Decision-Relevant Factor-Fixing Framework: Application to Uncertainty Analysis of a High-Dimensional Water Quality Model

Factor Fixing (FF) is a common method for reducing the number of model parameters to lower computational cost. FF typically starts with distinguishing the insensitive parameters from the sensitive and pursues uncertainty quantification (UQ) on the resulting reduced-order model, fixing each insensitive parameter at a fixed value. There is a need, however, to expand such a common approach to consider the effects of decision choices in the FF-UQ procedure on metrics of interest. Therefore, to guide the use of FF and increase confidence in the resulting dimension-reduced model, we propose a new adaptive framework consisting of four principles: (a) re-parameterize the model first to reduce obvious non-identifiable parameter combinations, (b) focus on decision relevance especially with respect to errors in quantities of interest (QoI), (c) conduct adaptive evaluation and robustness assessment of errors in the QoI across FF choices as sample size increases, and (d) reconsider whether fixing is warranted. The framework is demonstrated on a spatially-distributed water quality model. The error in estimates of QoI caused by FF can be estimated using a Polynomial Chaos Expansion (PCE) surrogate model. Built with 70 model runs, the surrogate is computationally inexpensive to evaluate and can provide global sensitivity indices for free. For the selected catchment, just two factors may provide an acceptably accurate estimate of model uncertainty in the average annual load of Total Suspended Solids (TSS), suggesting that reducing the uncertainty in these two parameters is a priority for future work before undertaking further formal uncertainty quantification.

54 ENVIRONMENTAL SCIENCES↗

Metaplectic geometrical optics for ray-based modeling of caustics: Theory and algorithms

The optimization of radio frequency-wave (RF) systems for fusion experiments is often performed using ray-tracing codes, which rely on the geometrical-optics (GO) approximation. However, GO fails at caustics such as cutoffs and focal points, erroneously predicting the wave intensity to be infinite. This is a critical shortcoming of GO, since the caustic wave intensity is often the quantity of interest, e.g., RF heating. Full-wave modeling can be used instead, but the computational cost limits the speed at which such optimizations can be performed. Here, we have developed a less expensive alternative called metaplectic geometrical optics (MGO). Instead of evolving waves in the usual x (coordinate) or k (spectral) representation, MGO uses a mixed X$\equiv$Ax+Bk representation. By continuously adjusting the matrix coefficients A and B along the rays, one can ensure that GO remains valid in the X coordinates without caustic singularities. The caustic-free result is then mapped back onto the original x space using metaplectic transforms. Here, we overview the MGO theory and review algorithms that will aid the development of an MGO-based ray-tracing code. We show how using orthosymplectic transformations leads to considerable simplifications compared to previously published MGO formulas. We also prove explicitly that MGO exactly reproduces standard GO when evaluated far from caustics (an important property that until now has only been inferred from numerical simulations), and we relate MGO to other semiclassical caustic-removal schemes published in the literature. Finally this discussion is then augmented by an explicit comparison of the computed spectrum for a wave bounded between two cutoffs.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Image feature extraction and galaxy classification: a novel and efficient approach with automated machine learning

ABSTRACT In this work, we explore the possibility of applying machine learning methods designed for 1D problems to the task of galaxy image classification. The algorithms used for image classification typically rely on multiple costly steps, such as the point spread function deconvolution and the training and application of complex Convolutional Neural Networks of thousands or even millions of parameters. In our approach, we extract features from the galaxy images by analysing the elliptical isophotes in their light distribution and collect the information in a sequence. The sequences obtained with this method present definite features allowing a direct distinction between galaxy types. Then, we train and classify the sequences with machine learning algorithms, designed through the platform Modulos AutoML. As a demonstration of this method, we use the second public release of the Dark Energy Survey (DES DR2). We show that we are able to successfully distinguish between early-type and late-type galaxies, for images with signal-to-noise ratio greater than 300. This yields an accuracy of $86{{\ \rm per\ cent}}$ for the early-type galaxies and $93{{\ \rm per\ cent}}$ for the late-type galaxies, which is on par with most contemporary automated image classification approaches. The data dimensionality reduction of our novel method implies a significant lowering in computational cost of classification. In the perspective of future data sets obtained with e.g. Euclid and the Vera Rubin Observatory, this work represents a path towards using a well-tested and widely used platform from industry in efficiently tackling galaxy classification problems at the peta-byte scale.

79 ASTRONOMY AND ASTROPHYSICS↗

Projection-based multifidelity linear regression for data-scarce applications

Surrogate modeling for systems with high-dimensional quantities of interest remains challenging, particularly when training data are costly to acquire. This work develops multifidelity methods for multiple-input multiple-output linear regression targeting data-limited applications with high-dimensional outputs. Multifidelity methods integrate many inexpensive low-fidelity model evaluations with limited, costly high-fidelity evaluations. We introduce two projection-based multifidelity linear regression approaches with linear and nonlinear features that leverage principal component basis vectors for dimensionality reduction and combine multifidelity data through: (i) a direct data augmentation using low-fidelity data, and (ii) a data augmentation incorporating explicit linear corrections between low-fidelity and high-fidelity data. The data augmentation approaches combine high-fidelity and low-fidelity data into a unified training set and train the linear regression model through weighted least squares with fidelity-specific weights. We introduce a proximity-based weighting scheme with automatic weight selection strategy through cross-validation. Here, the proposed multifidelity linear regression methods are demonstrated on approximating the surface pressure field of a hypersonic vehicle in flight and the temperature field on an aircraft disc braking system. In an ultra low-data regime of no more than twelve high-fidelity samples, multifidelity linear regression achieves approximately 2% – 12% improvement in median accuracy and a higher R 2 score relative to single-fidelity methods at comparable computational cost.

data augmentation↗

AutoTandemML: Active Learning Enhanced Tandem Neural Networks for Inverse Design Problems

Inverse design in science and engineering involves determining optimal design parameters that achieve desired performance outcomes, a process often hindered by the complexity and high dimensionality of design spaces, leading to significant computational costs. To tackle this challenge, we propose a novel hybrid approach that combines active learning with Tandem Neural Networks to enhance the efficiency and effectiveness of solving inverse design problems. Active learning allows to selectively sample the most informative data points, reducing the required dataset size without compromising accuracy. We investigate this approach using three benchmark problems: airfoil inverse design, photonic surface inverse design, and scalar boundary condition reconstruction in diffusion partial differential equations. We demonstrate that integrating active learning with Tandem Neural Networks outperforms standard approaches across the benchmark suite, achieving better accuracy with fewer training samples.

97 MATHEMATICS AND COMPUTING↗