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

BEYONDPLANCK III. Commander3

We describe the computational infrastructure for end-to-end Bayesian cosmic microwave background (CMB) analysis implemented by the BeyondPlanck Collaboration. The code is called Commander3. It provides a statistically consistent framework for global analysis of CMB and microwave observations and may be useful for a wide range of legacy, current, and future experiments. The paper has three main goals. Firstly, we provide a high-level overview of the existing code base, aiming to guide readers who wish to extend and adapt the code according to their own needs or re-implement it from scratch in a different programming language. Secondly, we discuss some critical computational challenges that arise within any global CMB analysis framework, for instance in-memory compression of time-ordered data, fast Fourier transform optimization, and parallelization and load-balancing. Thirdly, we quantify the CPU and RAM requirements for the current BEYONDPLANCK analysis, finding that a total of 1.5 TB of RAM is required for efficient analysis and that the total cost of a full Gibbs sample for LFI is 170 CPU-hrs, including both low-level processing and high-level component separation, which is well within the capabilities of current low-cost computing facilities. The existing code base is made publicly available under a GNU General Public Library (GPL) license.

79 ASTRONOMY AND ASTROPHYSICS↗

Extended dynamic mode decomposition for model reduction in fluid dynamics simulations

High computational cost and storage/memory requirements of fluid dynamics simulations constrain their usefulness as a predictive tool. Reduced-order models (ROMs) provide a viable solution to this challenge by extracting the key underlying dynamics of a complex system directly from data. We investigate the efficacy and robustness of an extended dynamic mode decomposition (xDMD) algorithm in constructing ROMs of three-dimensional cardiovascular computations. Focusing on the ROMs' accuracy in representation and interpolation, we relate these metrics to the truncation rank of singular value decomposition, which underpins xDMD and other approaches to ROM construction. Our key innovation is to relate the truncation rank to the singular values of the original flow problem. This result establishes a priori guidelines for the xDMD deployment and its likely success as a means of data compression and reconstruction of the system's dynamics from dominant spatiotemporal structures present in the data.

Mechanics↗

Deep Learning Approaches to Surrogates for Solving the Diffusion Equation for Mechanistic Real-World Simulations

In many mechanistic medical, biological, physical, and engineered spatiotemporal dynamic models the numerical solution of partial differential equations (PDEs), especially for diffusion, fluid flow and mechanical relaxation, can make simulations impractically slow. Biological models of tissues and organs often require the simultaneous calculation of the spatial variation of concentration of dozens of diffusing chemical species. One clinical example where rapid calculation of a diffusing field is of use is the estimation of oxygen gradients in the retina, based on imaging of the retinal vasculature, to guide surgical interventions in diabetic retinopathy. Furthermore, the ability to predict blood perfusion and oxygenation may one day guide clinical interventions in diverse settings, i.e., from stent placement in treating heart disease to BOLD fMRI interpretation in evaluating cognitive function (Xie et al., 2019; Lee et al., 2020). Since the quasi-steady-state solutions required for fast-diffusing chemical species like oxygen are particularly computationally costly, we consider the use of a neural network to provide an approximate solution to the steady-state diffusion equation. Machine learning surrogates, neural networks trained to provide approximate solutions to such complicated numerical problems, can often provide speed-ups of several orders of magnitude compared to direct calculation. Surrogates of PDEs could enable use of larger and more detailed models than are possible with direct calculation and can make including such simulations in real-time or near-real time workflows practical. Creating a surrogate requires running the direct calculation tens of thousands of times to generate training data and then training the neural network, both of which are computationally expensive. Often the practical applications of such models require thousands to millions of replica simulations, for example for parameter identification and uncertainty quantification, each of which gains speed from surrogate use and rapidly recovers the up-front costs of surrogate generation. We use a Convolutional Neural Network to approximate the stationary solution to the diffusion equation in the case of two equal-diameter, circular, constant-value sources located at random positions in a two-dimensional square domain with absorbing boundary conditions. Such a configuration caricatures the chemical concentration field of a fast-diffusing species like oxygen in a tissue with two parallel blood vessels in a cross section perpendicular to the two blood vessels. To improve convergence during training, we apply a training approach that uses roll-back to reject stochastic changes to the network that increase the loss function. The trained neural network approximation is about 1000 times faster than the direct calculation for individual replicas. Because different applications will have different criteria for acceptable approximation accuracy, we discuss a variety of loss functions and accuracy estimators that can help select the best network for a particular application. We briefly discuss some of the issues we encountered with overfitting, mismapping of the field values and the geometrical conditions that lead to large absolute and relative errors in the approximate solution.

60 APPLIED LIFE SCIENCES↗

Denoising Convolutional Networks to Accelerate Detector Simulation

The high accuracy of detector simulation is crucial for modern particle physics experiments. However, this accuracy comes with a high computational cost, which will be exacerbated by the large datasets and complex detector upgrades associated with next-generation facilities such as the High Luminosity LHC. We explore the viability of regression-based machine learning (ML) approaches using convolutional neural networks (CNNs) to "denoise" faster, lower-quality detector simulations, augmenting them to produce a higher-quality final result with a reduced computational burden. The denoising CNN works in concert with classical detector simulation software rather than replacing it entirely, increasing its reliability compared to other ML approaches to simulation. We obtain promising results from a prototype based on photon showers in the CMS electromagnetic calorimeter. Future directions are also discussed.

Banerjee, Sunanda↗

Denoising Convolutional Networks to Accelerate Detector Simulation [Poster]

The high accuracy of detector simulation is crucial for modern particle physics experiments. However, this accuracy comes with a high computational cost, which will be exacerbated by the large datasets and complex detector upgrades associated with next-generation facilities such as the High Luminosity LHC. We explore the viability of regression-based machine learning (ML) approaches using convolutional neural networks (CNN) to ``denoise'' faster, lower-quality detector simulations, augmenting them to produce a higher-quality final result with a reduced computational burden. The denoising CNN works in concert with classical detector simulation software rather than replacing it entirely, increasing its reliability compared to other ML approaches to simulation. We obtain promising results from a prototype based on photon showers in the CMS electromagnetic calorimeter. Future directions are also discussed.

43 PARTICLE ACCELERATORS↗

Modeling of Cavity Residence Time via Modeled Lagrangian Particle Tracking

One of the critical components in a scramjet is the cavity flame holder. In evaluating the sizing of this component, the residence time of the fuel in the cavity is a common parameter used. However, to obtain the residence time via CFD is an expensive undertaking. One method is to perform an LES simulation of the cavity and use Lagrangian particle tracking to obtain both the mean and probability density function of the time that the particles remain in the cavity. While this method affords a significant amount of information, it is very costly in CPU run time. A simpler method involves performing a time accurate RANS simulation of the cavity, and when converged, overlay a traceable scalar in the cavity region, and then record the decay of this scalar’s flux at a downstream location. The time scale of the decay rate can then be estimated and a residence time inferred. This method is less computationally expensive than the LES approach, but still requires a time-accurate solution while only providing a mean cavity residence time evaluation. In this paper a method of determining the mean cavity residence time as well as the Probability Density Function (PDF) of the residence time is proposed and demonstrated. This method is based on Lagrangian particle tracking modeled by the Generalized Langevin Equation and is implemented as a post-processing step for a steady RANS solution. Computational cost is on the order of minutes and the results are in agreement with values obtained by the LES and scalar decay methods.

Langevin↗

Insights into Methodologies and Operational Details of Resource Adequacy Assessment: A Case Study with Application to a Broader Flexibility Framework

Assessing and maintaining resource adequacy (RA) is a core pillar of power systems. However, recent changes in the physical makeup of these systems and the conditions under which these systems must operate have yielded a renewed interest in the methods, metrics, and assumptions that underpin RA assessments. In this paper, we systematically explore a wide range of RA modeling dimensions, including: the objective function and level of operational detail in the underlying model formulation; the quantity (look-ahead) and quality (accuracy) of data that is available for making operational decisions within those models; and the physical configuration of solar photovoltaics (PV) with battery storage hybrid resources. We apply a set of probabilistic RA tools and production cost modeling tools to a realistic test system based loosely on a future Electric Reliability Council of Texas power system dominated by solar PV resources. Under the assumptions of our system and models, we find that multi-stage probabilistic assessments may provide a more robust evaluation of RA by capturing a wider range of operational and system interactions, but this comes at a computational cost of 1-2 orders of magnitude longer run time depending on the specific configuration. In addition, the information on thermal generator availability impacts RA performance by an order of magnitude more than solar resource forecasts, which is driven by the comparatively larger magnitude of thermal outages than solar forecast errors within our test system. Lastly, the flexibility provided by hybrid and other resources can help reduce system load-shedding event frequencies and enable the system to be more robust to inaccurate forecast information, and alternative hybrid inverter sizes can impact RA levels by 1-2 orders of magnitude. Our results point to the importance of a broader flexibility framework to describe the interaction between (1) flexibility "supply" from both physical resource capabilities and operational constraints considered in the modeling, and (2) flexibility "demand" from forecast errors, thermal generator outages, and other sources of uncertainty, as well as their RA impacts. Results are likely sensitive to the system buildout explored; future work could consider additional system configurations and conditions.

ENERGY PLANNING, POLICY, AND ECONOMY,POWER TRANSMI↗

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems

Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.

Miao, Qiang [Duke Quantum Center, Duke University,↗

A Reduced-frequency Approach for Calculating Dynamic Derivatives

Computational Fluid Dynamics (CFD) is increasingly being used to both augment and create an aerodynamic performance database for aircraft configurations. This aerodynamic database contains the response of the aircraft to varying flight conditions and control surface deflections. The current work presents a novel method for calculating dynamic stability derivatives which reduces the computational cost over traditional unsteady CFD approaches by an order of magnitude, while still being applicable to arbitrarily complex geometries over a wide range of flow regimes. The primary thesis of this work is that the response to a forced motion can often be represented with a small, predictable number of frequency components without loss of accuracy. By resolving only those frequencies of interest, the computational effort is significantly reduced so that the routine calculation of dynamic derivatives becomes practical. The current implementation uses this same non-linear, frequency-domain approach and extends the application to the 3-D Euler equations. The current work uses a Cartesian, embedded-boundary method to automate the generation of dynamic stability derivatives.

Murman, Scott M.↗

Semi-Lagrangian nodal discontinuous Galerkin method for the BGK model

In this work, we propose a semi-Lagrangian (SL) nodal discontinuous Galerkin (DG) solver for the BGK equation. The BGK model was introduced by Bhatnagar, Gross, and Krook [1] as a relaxation model for the fundamental Boltzmann equation [5], which describes the kinetic dynamic of rarefied gases with a probability distribution function. The challenges of designing efficient numerical schemes for the Boltzmann equation mainly come from its high dimensionality and complicated nonlinear collision operator. The BGK model gains interests since it has much lower computational cost, due to the relatively simple structure of the relaxation operator in replacement of the collision operator, while simultaneously preserving several important physical properties, such as macroscopic quantities and dissipation of entropy.

97 MATHEMATICS AND COMPUTING↗

Numerical Strip-Yield Calculation of CTOD

Many existing methods to calculate CTOD can be costly and complicated, or apply only to particular configurations. A new numerical method for calculating CTOD was investigated. NASGRO's Boundary Element module NASBEM was adapted to calculate displacements at any point on the crack. Demonstrated for a number of crack configurations: a) finite and infinite domains; b) center and edge cracks; and c) complex cases with several cracks and holes. Great accuracy at minimal computational cost.

Beek, Joachim↗

Interface PINNs (I-PINNs): A physics-informed neural networks framework for interface problems

Here, we present a novel physics-informed neural networks (PINNs) framework for modeling interface problems, termed Interface PINNs (I-PINNs). I-PINNs uses different neural networks for any two subdomains separated by a sharp interface such that the neural networks differ only through their activation functions while the other parameters remain identical. The performance of I-PINNs, conventional PINNs, and other existing domain-decomposition PINNs methods such as extended PINNs (XPINNs) and multi-domain PINN (M-PINN) is compared through several one-dimensional, two-dimensional, and three-dimensional benchmark elliptic interface problems. The results demonstrate that I-PINNs provides a root-mean-square-error accuracy, at least two orders of magnitude better than conventional PINNs and XPINNs at approximately one-tenth of the computational cost of conventional PINNs and half the cost of XPINNs. Additionally, while I-PINNs and M-PINN provide comparable accuracies, M-PINN is found to be approximately 50% more expensive.

42 ENGINEERING↗

Estimation of distributions via multilevel Monte Carlo with stratified sampling

We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-driven discovery of dynamics from time-resolved coherent scattering

Coherent X-ray scattering (CXS) techniques are capable of interrogating dynamics of nano- to mesoscale materials systems at time scales spanning several orders of magnitude. However, obtaining accurate theoretical descriptions of complex dynamics is often limited by one or more factors—the ability to visualize dynamics in real space, computational cost of high-fidelity simulations, and effectiveness of approximate or phenomenological models. In this work, we develop a data-driven framework to uncover mechanistic models of dynamics directly from time-resolved CXS measurements without solving the phase reconstruction problem for the entire time series of diffraction patterns. Our approach uses neural differential equations to parameterize unknown real-space dynamics and implements a computational scattering forward model to relate real-space predictions to reciprocal-space observations. This method is shown to recover the dynamics of several computational model systems under various simulated conditions of measurement resolution and noise. Moreover, the trained model enables estimation of long-term dynamics well beyond the maximum observation time, which can be used to inform and refine experimental parameters in practice. Finally, we demonstrate an experimental proof-of-concept by applying our framework to recover the probe trajectory from a ptychographic scan. Our proposed framework bridges the wide existing gap between approximate models and complex data.

36 MATERIALS SCIENCE↗

Design and execution of a verification, validation, and uncertainty quantification plan for a numerical model of left ventricular flow after LVAD implantation

Left ventricular assist devices (LVADs) are implantable pumps that act as a life support therapy for patients with severe heart failure. Despite improving the survival rate, LVAD therapy can carry major complications. Particularly, the flow distortion introduced by the LVAD in the left ventricle (LV) may induce thrombus formation. While previous works have used numerical models to study the impact of multiple variables in the intra-LV stagnation regions, a comprehensive validation analysis has never been executed. The main goal of this work is to present a model of the LV-LVAD system and to design and follow a verification, validation and uncertainty quantification (VVUQ) plan based on the ASME V&V40 and V&V20 standards to ensure credible predictions. The experiment used to validate the simulation is the SDSU cardiac simulator, a bench mock-up of the cardiovascular system that allows mimicking multiple operation conditions for the heart-LVAD system. The numerical model is based on Alya, the BSC’s in-house platform for numerical modelling. Alya solves the Navier-Stokes equation with an Arbitrary Lagrangian-Eulerian (ALE) formulation in a deformable ventricle and includes pressure-driven valves, a 0D Windkessel model for the arterial output and a LVAD boundary condition modeled through a dynamic pressure-flow performance curve. The designed VVUQ plan involves: (a) a risk analysis and the associated credibility goals; (b) a verification stage to ensure correctness in the numerical solution procedure; (c) a sensitivity analysis to quantify the impact of the inputs on the four quantities of interest (QoIs) (average aortic root flow $Q^{avg}_{Ao}$, maximum aortic root flow $Q^{max}_{Ao}$, average LVAD flow $Q^{avg}_{VAD}$, and maximum LVAD flow $Q^{max}_{VAD}$; (d) an uncertainty quantification using six validation experiments that include extreme operating conditions. Numerical code verification tests ensured correctness of the solution procedure and numerical calculation verification showed a grid convergence index (GCI)95% <3.3%. The total Sobol indices obtained during the sensitivity analysis demonstrated that the ejection fraction, the heart rate, and the pump performance curve coefficients are the most impactful inputs for the analysed QoIs. The Minkowski norm is used as validation metric for the uncertainty quantification. It shows that the midpoint cases have more accurate results when compared to the extreme cases. The total computational cost of the simulations was above 100 [core-years] executed in around three weeks time span in Marenostrum IV supercomputer. This work details a novel numerical model for the LV-LVAD system, that is supported by the design and execution of a VVUQ plan created following recognised international standards. We present a methodology demonstrating that stringent VVUQ according to ASME standards is feasible but computationally expensive.

59 BASIC BIOLOGICAL SCIENCES↗

Understanding Discrete Fracture Networks Through Spectral Graph Theory

Discrete Fracture Network models (DFNs) are used to simulate fluid flow and particle transport through fracture networks in low permeability rock. Understanding these processes are essential in many subsurface applications, such as environmental restoration of contaminated fractured media, CO 2 sequestration, detection of low-level nuclear tests, and hydrocarbon extraction. Compared with other models, DFNs allow for incorporation of a wider range of network characteristics but have substantially greater computation cost. These networks can be represented with graphs, allowing the use of graph theory tools to study the networks. I used Python to simulate flow and transport on a range of DFNs and analyzed these networks using methods from network analysis and spectral graph theory. My purpose was to find ways to gain insight about flow and transport on DFNs using these graph representations, bypassing the computationally intensive meshing typically required. My work is still in progress, but I have discovered several interesting trends and patterns that I believe could be useful towards my goal. If I am able to bring these results to fruition, they will aid subsurface geologists in extracting flow and transport information about fracture networks more efficiently.

54 ENVIRONMENTAL SCIENCES↗

Acceleration of Thermochemistry Solves in MOOSE and Pronghorn

This work focuses on the development and implementation of strategies to accelerate thermochemical calculations within MOOSE-based multiphysics simulations, particularly for applications in MSRs. We highlight the inherent complexity of nuclear materials, which require a multiscale approach to accurately model their behavior across various physical domains, including mechanical, chemical, and thermal phenomena. Thermochemical equilibrium calculations are crucial for predicting material properties and enhancing the fidelity of these simulations. The integration of Thermochimica, a Gibbs energy minimizer, into MOOSE allows for the direct minimization of Gibbs energy at every point on the mesh. However, the computational cost of such integration is significant. To address this, we explored acceleration strategies such as multi-threading support and the use of a thermodynamic ValueCache to reduce redundant calculations. Additionally, we investigated modifications to Thermochimica to enable phase constraints and improve its coupling with phase-field models, which are essential for simulating microstructural evolution and corrosion in MSR. These efforts aim to optimize the computational efficiency and accuracy of multiphysics simulations, thereby supporting the development of reliable and efficient nuclear materials for next-generation reactor technologies.

36 - MATERIALS SCIENCE↗

Two-Level Sketching Alternating Anderson Acceleration for Complex Physics Applications

We present a novel two-level sketching extension of the Alternating Anderson–Picard (AAP) method for accelerating fixed-point iterations in challenging single- and multiphysics simulations governed by discretized PDEs. Our approach combines a static, physics-based projection that reduces the least-squares (LS) problem to the most informative field (e.g., via Schur-complement insight) with a dynamic, algebraic sketching stage driven by a backward stability analysis under Lipschitz continuity. We introduce inexpensive estimators for stability thresholds and cache-aware randomized selection strategies to balance computational cost against memory access overhead. The resulting algorithm solves reduced LS systems in place, minimizes memory footprints, and seamlessly alternates between low-cost Picard updates and Anderson mixing. Implemented in Julia, our two-level sketching AAP achieves up to 50% time-to-solution reductions compared to standard Anderson acceleration—without degrading convergence rates—on benchmark problems including Stokes, 𝑝-Laplacian, bidomain, and Navier–Stokes formulations at varying problem sizes. These results demonstrate the method’s robustness, scalability, and potential for integration into high-performance scientific computing frameworks. Our implementation is available open source in the AAP.jl library.

Barnafi, Nicolas [University of Chile, Santiago]↗