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 217 records · Page 12

An adaptive, data-driven multiscale approach for dense granular flows

The accuracy of coarse-grained continuum models of dense granular flows is limited by the lack of high-fidelity closure models for granular rheology. One approach to addressing this issue, referred to as the hierarchical multiscale method, is to use a high-fidelity fine-grained model to compute the closure terms needed by the coarse-grained model. The difficulty with this approach is that the overall model can become computationally intractable due to the high computational cost of the high-fidelity model. In this work, we describe a multiscale modeling approach for dense granular flows that utilizes neural networks trained using high-fidelity discrete element method (DEM) simulations to approximate the constitutive granular rheology for a continuum incompressible flow model. Our approach leverages an ensemble of neural networks to estimate predictive uncertainty that allows us to determine whether the rheology at a given point is accurately represented by the neural network model. Additional DEM simulations are only performed when needed, minimizing the number of additional DEM simulations required when updating the rheology. This adaptive coupling significantly reduces the overall computational cost of the approach while controlling the error. In addition, the neural networks are customized to learn regularized rheological behavior to ensure well-posedness of the continuum solution. We first validate the approach using two-dimensional steady-state and decelerating inclined flows. We then demonstrate the efficiency of our approach by modeling three-dimensional sub-aerial granular column collapse for varying initial column aspect ratios, where our multiscale method compares well with the computationally expensive computational fluid dynamics (CFD)-DEM simulation.

Dense granular flows↗

Investigation of grid-based vorticity-velocity large eddy simulation off-body solvers for application to overset CFD

Accurately predicting unsteady wakes and vortex-dominated flows is essential to a wide range of engineering applications, including aircraft, rotorcraft, shipboard operations, bio-inspired unsteady flight and propulsion, wind turbines, and urban flows. While current CFD software can model the complete flow field and wake system, the computational costs incurred in high Reynolds number unsteady turbulent flow simulations often remain prohibitive for routine engineering use, particularly for applications involving moving components. Prior work has demonstrated that by adopting a vorticity-velocity formulation in a grid-based off-body flow solver (VorTran-M and VorTran-M2) one can lower these costs by several orders of magnitude when compared to conventional approaches. This paper describes the extensions made to VorTran-M2 to support turbulent flows, and associated benchmarking activity to assess its performance for problems involving strong stretching and diffusion processes, whose competing contributions to the vorticity field are core drivers of turbulent flow evolution. Predictions are presented for: (i) the Kida-Pelz problem whose inviscid form is of mathematical interest due to its apparent formation of singular flow in finite time; and (ii) the Taylor Green vortex arrangement, which has been extensively studied as a fundamental simulation challenge in the turbulent modeling community. Here, the results are used to evaluate the overall predictive ability and performance of two sub-grid scale models incorporated into VorTran-M2. Results indicate that the computational cost savings seen previously for inviscid and convection dominated problems extend to turbulent flow simulations supporting the viability of VorTran-M2 as a low cost means for accurately modeling the far-field and background flow, particularly when long duration vorticity evolution is of interest.

42 ENGINEERING↗

MedNAS: Multiscale Training-Free Neural Architecture Search for Medical Image Analysis

Deep neural networks have demonstrated impressive results in medical image analysis, but designing suitable architectures for each specific task is expertise dependent and time consuming. Neural architecture search (NAS) offers an effective means of discovering architectures. It has been highly successful in numerous applications, particularly in natural image classification. Yet, medical images possess unique characteristics, such as small regions and a wide variety of lesion sizes, that differentiate them from natural images. Furthermore, most current NAS methods struggle with high computational costs, especially when dealing with high-resolution image datasets. In this article, we present a novel evolutionary NAS method called multiscale training-free neural architecture search (MSTF-NAS) to address these challenges. Specifically, to accommodate the broad range of lesion region sizes in disease diagnosis, we develop a new reduction cell search space that enables the search algorithm to explicitly identify the optimal scale combination for multiscale feature extraction. Further, to overcome the issue of high computational costs, we utilize training-free indicators as performance measures for candidate architectures, which allows us to search for the optimal architecture more efficiently. More specifically, by considering the capability and simplicity of various networks, we formulate a multiobjective optimization problem that involves two training-free indicators and model complexity for candidate architectures. Extensive experiments on a large medical image benchmark and a publicly available breast cancer detection dataset are conducted. The empirical results demonstrate that our MSTF-NAS outperforms both human-designed architectures and current state-of-the-art NAS algorithms on both datasets, indicating the effectiveness of our proposed method.

60 APPLIED LIFE SCIENCES↗

Design Optimization of Stiffened Panels with Postbuckling Constraints

The funding provided by the grant is used to complete the final stages of the development of a geometrically nonlinear analysis and design capability for the static response of compressively loaded prismatic plate structures. The analysis is based on the nonlinear finite strip method and is applicable for structures, such as stiffened panels or box columns, that can be modeled as assemblages of finite length plate strips. In an effort to reduce the computational cost of the nonlinear finite strip method, thus making it suitable for use in the design optimization environment, reduced basis techniques as described in various references by Noor are used in conjunction with the finite strip method. In addition, an efficient scheme for tracing the nonlinear equilibrium paths through highly nonlinear response curves was implemented. The new scheme, which is referred to as the normal flow algorithm, is based on homotopy methods, and is capable of negotiating highly nonlinear limit point instabilities with a reduced computational cost compared to the popular Ricks/Wempner and Chrisfield algorithms.

Guerdal, Zafer↗

Persistent Sampling: Enhancing the Efficiency of Sequential Monte Carlo

Sequential Monte Carlo (SMC) samplers are powerful tools for Bayesian inference but suffer from high computational costs due to their reliance on large particle ensembles for accurate estimates. We introduce persistent sampling (PS), an extension of SMC that systematically retains and reuses particles from all prior iterations to construct a growing, weighted ensemble. By leveraging multiple importance sampling and resampling from a mixture of historical distributions, PS mitigates the need for excessively large particle counts, directly addressing key limitations of SMC such as particle impoverishment and mode collapse. Crucially, PS achieves this without additional likelihood evaluations-weights for persistent particles are computed using cached likelihood values. This framework not only yields more accurate posterior approximations but also produces marginal likelihood estimates with significantly lower variance, enhancing reliability in model comparison. Furthermore, the persistent ensemble enables efficient adaptation of transition kernels by leveraging a larger, decorrelated particle pool. Experiments on high-dimensional Gaussian mixtures, hierarchical models, and non-convex targets demonstrate that PS consistently outperforms standard SMC and related variants, including recycled and waste-free SMC, achieving substantial reductions in mean squared error for posterior expectations and evidence estimates, all at reduced computational cost. PS thus establishes itself as a robust, scalable, and efficient alternative for complex Bayesian inference tasks.

Karamanis, Minas↗

Iterative methods for plasma sheath calculations: Application to spherical probe

The computer cost of a Poisson-Vlasov iteration procedure for the numerical solution of a steady-state collisionless plasma-sheath problem depends on: (1) the nature of the chosen iterative algorithm, (2) the position of the outer boundary of the grid, and (3) the nature of the boundary condition applied to simulate a condition at infinity (as in three-dimensional probe or satellite-wake problems). Two iterative algorithms, in conjunction with three types of boundary conditions, are analyzed theoretically and applied to the computation of current-voltage characteristics of a spherical electrostatic probe. The first algorithm was commonly used by physicists, and its computer costs depend primarily on the boundary conditions and are only slightly affected by the mesh interval. The second algorithm is not commonly used, and its costs depend primarily on the mesh interval and slightly on the boundary conditions.

Parker, L. W.↗

Advanced modeling and simulation of research reactors using dynamic mode decomposition

Full text of publication follows. Due to the ever-increasing safety requirements, the current trend of nuclear reactor analysis is shifting towards high-fidelity multi-physics models, which have a very high computational cost and modelling complexity. As the cost of even a single model run makes it impossible to analyse the behaviour and performance of these models on large-scale commercial plants, it has become even more significant to provide suitable benchmarks to validate and test them extensively. In this sense, research reactors offer a promising solution for the initial validation of high-fidelity models, as they are significantly smaller than commercial reactors and their characteristics are well known. In particular, the reactors of the TRIGA family have been used to assess and validate models and methods for Generation-IV designs, as they have some similar features (such as the dominance of natural convection as cooling mechanism and the difficulties in performing sub-channel analysis using standard codes). Still, the computational requirements of high-fidelity models make them unsuitable for real-time analysis, even following their assessment on research reactors. In this sense, Model Order Reduction (MOR) techniques give an additional strategy to reduce the computational cost of high-fidelity models (whilst preserving sufficient accuracy). In particular, this work focuses on Dynamic Mode Decomposition (DMD), a non-intrusive MOR technique that aims at representing models with explicit temporal dynamics by extracting the time-varying characteristics and the governing structures based only on a set of available data, thus without needing any underlying knowledge of the governing equations. In addition, DMD also computes a low-dimensional surrogate of the dynamic matrix of the system, making it suited for stability analysis and real-time evaluations. This work focuses on the application and validation of the DMD method on the Computational Fluid-Dynamics (CFD) model TRIGA Mark II reactor, also discussing in detail the potentiality of this algorithm as an advanced modelling tool for nuclear reactor analysis. (author)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Data-driven selection of stiff chemistry ODE solver in operator-splitting schemes

Most computational fluid dynamics simulations of practical combustion applications employ operator-splitting schemes, where chemistry and transport are separated and integrated with distinct numerical methods. The changes in composition due to chemistry are evaluated by solving ordinary differential equations (ODE) in each cell of the computational domain, which typically dominates the computational cost when detailed chemistry is considered. In this work, a data-driven approach for the selection of chemistry ODE solvers in operator-splitting schemes is presented. Neural networks are used to predict the ODE solvers CPU times and errors for a given thermochemical state. This allows the selection of an optimal ODE solver on a cell-by-cell, timestep-by-timestep basis. The models are trained using a wide set of thermochemical states generated through partially-stirred reactors and flames simulations. The methodology is validated by quantifying the prediction errors, the classification accuracy, and the computational speedup. The model predicts the optimal ODE solver for 70 to 95% of the validation cases and decreases the computional cost by a factor of 3 or more. The generalizability of the methodology to different chemical mechanisms and different fuels is assessed and it is shown that the model’s performance is only slightly degraded and its applicability is significantly enhanced if the inputs to the neural networks are restricted to a small set of thermochemical state variables present in most chemical mechanisms. In conclusion, the models are used in an homogeneous reactor case and a multi-dimensional CFD simulation of a diesel spray at high pressure where a speedup of more than 3 is achieved.

42 ENGINEERING↗

Gaussian Mixture Models for Temporal Depth Fusion

Sensing the 3D environment of a moving robot is essential for collision avoidance. Most 3D sensors produce dense depth maps, which are subject to imperfections due to various environmental factors. Temporal fusion of depth maps is crucial to overcome those. Temporal fusion is traditionally done in 3D space with voxel data structures, but it can be approached by temporal fusion in image space, with potential benefits in reduced memory and computational cost for applications like reactive collision avoidance for micro air vehicles. In this paper, we present an efficient Gaussian Mixture Models based depth map fusion approach, introducing an online update scheme for dense representations. The environment is modeled from an ego-centric point of view, where each pixel is represented by a mixture of Gaussian inverse-depth models. Consecutive frames are related to each other by transformations obtained from visual odometry. This approach achieves better accuracy than alternative image space depth map fusion techniques at lower computational cost.

Matthies, Larry↗

A Wavelet based Suboptimal Kalman Filter for Assimilation of Stratospheric Chemical Tracer Observations

A suboptimal Kalman filter system which evolves error covariances in terms of a truncated set of wavelet coefficients has been developed for the assimilation of chemical tracer observations of CH4. This scheme projects the discretized covariance propagation equations and covariance matrix onto an orthogonal set of compactly supported wavelets. Wavelet representation is localized in both location and scale, which allows for efficient representation of the inherently anisotropic structure of the error covariances. The truncation is carried out in such a way that the resolution of the error covariance is reduced only in the zonal direction, where gradients are smaller. Assimilation experiments which last 24 days, and used different degrees of truncation were carried out. These reduced the covariance size by 90, 97 and 99 % and the computational cost of covariance propagation by 80, 93 and 96 % respectively. The difference in both error covariance and the tracer field between the truncated and full systems over this period were found to be not growing in the first case, and growing relatively slowly in the later two cases. The largest errors in the tracer fields were found to occur in regions of largest zonal gradients in the constituent field. This results indicate that propagation of error covariances for a global two-dimensional data assimilation system are currently feasible. Recommendations for further reduction in computational cost are made with the goal of extending this technique to three-dimensional global assimilation systems.

Tangborn, Andrew↗

Advancing attenuation estimation through integration of the Hessian in multiparameter viscoacoustic full-waveform inversion

Accurate seismic attenuation models of subsurface structures not only enhance subsequent migration processes by improving fidelity, resolution, and facilitating amplitude-compliant angle gather generation but also provide valuable constraints on subsurface physical properties. Leveraging full-wavefield information, multiparameter viscoacoustic full-waveform inversion ( Q-FWI) simultaneously estimates seismic velocity and attenuation ( Q) models. However, a major challenge in Q-FWI is the contamination of crosstalk artifacts, where inaccuracies in the velocity model are mistakenly mapped to the inverted attenuation model. While incorporating the Hessian is expected to mitigate these artifacts, the explicit implementation is prohibitively expensive due to its formidable computational cost. In this study, we formulate and develop a Q-FWI algorithm via the Newton-conjugate gradient (CG) framework, where the search direction at each iteration is determined through an internal CG loop. In particular, the Hessian is integrated into each CG step in a matrix-free fashion using the second-order adjoint-state method. We find through synthetic experiments that our Newton-CG Q-FWI significantly mitigates crosstalk artifacts compared with the limited-memory Broyden-Fletcher-Goldfarb-Shanno method and the CG method, albeit with a notable computational cost. In the discussion of several key implementation details, we also determine the significance of the approximate Gauss-Newton Hessian, the second-order adjoint-state method, and the two-stage inversion strategy.

Geochemistry & Geophysics↗

Combining regional mesh refinement with vertically enhanced physics to target marine stratocumulus biases as demonstrated in the Energy Exascale Earth System Model version 1

Abstract. In this paper we develop a novel framework aimed to significantly reduce biases related to marine stratocumulus clouds in general circulation models (GCMs) while circumventing excessive computational cost requirements. Our strategy is to increase the horizontal resolution using a regionally refined mesh (RRM) over our region of interest in addition to using the Framework for Improvement by Vertical Enhancement (FIVE) to increase the vertical resolution only for specific physical processes that are important for stratocumulus. We apply the RRM off the coast of Peru in the southeastern Pacific, a region that climatologically contains the most marine stratocumulus in the subtropics. We find that our new modeling framework is able to replicate the results of our high-resolution benchmark simulation with much fidelity, while reducing the computational cost by several orders of magnitude. In addition, this framework is able to greatly reduce the long-standing biases associated with marine stratocumulus in GCMs when compared to the standard-resolution control simulation.

54 ENVIRONMENTAL SCIENCES↗

An Adaptive Geometry-Free Thermo-Mechanical Model for Directed Energy Deposition Process Modeling

This presentation describes a novel, geometry-free thermo-mechanical model with adaptive subdomain con- struction to accurately predict the thermal conditions, distortions, and residual stresses throughout the directed energy deposition (DED) process. A novel finite element workflow is designed to con- duct the numerical analysis, based on the multi-app and data transfer capabilities in the open-source Multiphysics Object-Oriented Simulation Environment (MOOSE). Unlike with traditional methods, the part geometry in this model is not predefined. Instead, it is a combined effect of the processing parameters and material properties. At each time step, the model utilizes a subdomain construction paradigm to model the material deposition. A specialized mesh adaptivity scheme is incorporated to provide an accurate prediction while reducing the overall computational cost. The results generated by the proposed model show general agreement with the experimental measurements for the single track scan with varying processing parameters and demonstrate reasonable predictions for higher material buildups.

36 MATERIALS SCIENCE↗

Adaptive immersed isogeometric level-set topology optimization

Here, this paper presents for the first time an adaptive immersed approach for level-set topology optimization using higher-order truncated hierarchical B-spline discretizations for design and state variable fields. Boundaries and interfaces are represented implicitly by the iso-contour of one or multiple level-set functions. An immersed finite element method, the eXtended IsoGeometric Analysis, is used to predict the physical response. The proposed optimization framework affords different adaptively refined higher-order B-spline discretizations for individual design and state variable fields. The increased continuity of higher-order B-spline discretizations together with local refinement enables direct control over the accuracy of the representation of each field while simultaneously reducing computational cost compared to uniformly refined discretizations. A flexible mesh adaptation strategy enables local refinement based on geometric measures or physics-based error indicators. These adaptive discretization and analysis approaches are integrated into gradient-based optimization schemes, evaluating the design sensitivities using the adjoint method. Numerical studies illustrate the features of the proposed framework with static, linear elastic, multi-material, two- and three-dimensional problems. The examples provide insight into the effect of refining the design variable field on the optimization result and the convergence rate of the optimization process. Using coarse higher-order B-spline discretizations for level-set fields promotes the development of smooth designs and suppresses the emergence of small features. Moreover, adaptive mesh refinement for state variable fields results in a reduction of overall computational cost. Higher-order B-spline discretizations are especially interesting when evaluating gradients of state variable fields due to their higher inter-element continuity.

36 MATERIALS SCIENCE↗

Implementation and Validation of Constrained Density Functional Theory Forces in the CP2K Package

Constrained density functional theory (CDFT) is a powerful tool for the prediction of electron transfer parameters in condensed phase simulations at a reasonable computational cost. In this work we present an extension to CDFT in the popular mixed Gaussian/plane wave electronic structure package CP2K, implementing the additional force terms arising from a constraint based on Hirshfeld charge partitioning. This improves upon the existing Becke partitioning scheme, which is prone to give unphysical atomic charges. We verify this implementation for a variety of systems: electron transfer in (H 2 O) 2 + in vacuum, electron tunnelling between oxygen vacancy centers in solid MgO, and electron self-exchange in aqueous Ru 2+ -Ru 3+ . We find good agreement with previous plane-wave CDFT results for the same systems, but at a significantly lower computational cost, and we discuss the general reliability of condensed phase CDFT calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Impacts of Bulk Microphysics Scheme Structural Choices on Simulations of Rain Initiation Through Drop Coalescence

This study examines how different structural choices in bulk microphysics schemes impact the simulation of warm rain initiation. A single liquid category (SLC) approach prognosing up to four moments of a single drop size distribution (DSD) is compared to the traditional two-category, two-moment approach with separate DSDs for cloud and rain (four total prognostic variables). Different methods for calculating tendencies of the prognostic variables from drop collision-coalescence are also tested: a discretized numerical-integration approach, machine learning via neural networks, lookup tables, and traditional power law fits. Relative to simulations using a bin microphysics model, SLC gives smaller error overall than the two-category approach when numerical integration is used to calculate the collision-coalescence tendencies for both. Replacing the numerical integration with a pre-computed lookup table reduces computational cost with little loss of accuracy. However, using fitted power laws with SLC to represent the collision-coalescence tendencies substantially reduces accuracy and leads to an order of magnitude increase in error. It is also demonstrated that with SLC, reasonably accurate solutions are obtained using only three prognostic moments, while a two-moment SLC scheme leads to substantial error. Overall, both the choice of prognostic moments (e.g., SLC vs. two-category) and method to calculate the collision-coalescence tendencies are important to consider for minimizing errors in bulk schemes. SLC with a sufficiently detailed calculation of the collision-coalescence tendencies provides accurate solutions for a reasonable computational cost, providing a viable alternative to the traditional two-category, two-moment approach for bulk microphysics.

320 (cloud physics and chemistry)↗

Multilevel Monte Carlo Predictions of First Passage Times in Three-Dimensional Discrete Fracture Networks: A Graph-Based Approach

In this paper, we present a method combining multilevel Monte Carlo (MLMC) and a graph-based primary subnetwork identification algorithm to provide estimates of the mean and variance of the distribution of first passage times in fracture media at significantly lower computational cost than standard Monte Carlo (MC) methods. Simulations of solute transport are performed using a discrete fracture network (DFN), and instead of using various grid resolutions for levels in the MLMC, which is standard practice in MLMC, we identify a hierarchy of subnetworks in the DFN based on the shortest topological paths through the network using a graph-based method. While the mean of these ensembles is of critical importance, the variance is also essential in fractured media where uncertainty is an overarching theme, and understanding variability across an ensemble is a requirement for safety assessments. The method provides good estimates of the mean and variance at two orders of magnitude lower computational cost than MC.

54 ENVIRONMENTAL SCIENCES↗

Generating An Advanced Cross-section Library For HTGR Pebble Bed Depletion Calculations Using Reduced-Order Model Generation Techniques

For code development, Advanced Reactor Technologies - Gas Cooled Reactors Program (ART-GCR) rely on a collaboration with the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, but the cross sections generation and the methodology definition is part of this program area goals. Based on previous studies in FY23, the size of microscopic cross section libraries increases rapidly with the number of tabulations, requiring significant amount of memory and drastically slowing down the Griffin calculations when evaluating cross sections via the multivariate linear interpolation approach. Rising to these challenges, this work investigates constructing Reduced-order Models (ROMs) for the multi-group microscopic cross sections to accelerate the cross section evaluation in Griffin. A database of multigroup cross sections is first collected considering all possible parameters that a designer could change for optimization. Down-selection of the ROM techniques afterward shows Deep Neural Network (DNN) as the best candidate when jointly consider memory efficiency, predictive accuracy, computational cost, scalability, flexibility and ease of implementation of the algorithms in comparison to the multidimensional interpolation. This work develops a specific interface that enables the cross section predictions using pre-trained DNN models into Griffin leveraging the existing ROM capabilities. DNNs have been trained for all isotopes for use in Griffin. Preliminary Griffin testing shows that DNNs exhibit exceptional predictive accuracy and the use of DNNs provides orders of magnitude improvement in memory efficiency compared to conventional interpolation techniques. With such ROM techniques, it holds great promise to further increase the fidelity of the Pebble Bed Reactor (PBR) simulation by increasing the number of tabulations/state variables during cross section evaluation, while maintaining the computational cost affordable in Griffin.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗