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

Full 3D Kinetic Modeling and Quantification of Positive Streamer Evolution in an Azimuthally Swept Pin-to-Plane Wedge Geometry

Cathode-directed streamer evolution in near atmospheric air is modeled in 3D pin-to-plane geometries using a 3D kinetic Particle-In-Cell (PIC) code that simulates particle-particle collisions via the Direct Simulation Monte Carlo (DSMC) method. Due to the computational challenges associated with a complete 360° volumetric domain, a practical alternative was achieved using a wedge domain and a range of azimuthal angles was explored (5°, 15°, 30°, and 45°) to study possible effects on the streamer growth and propagation due to the finite wedge angle. A DC voltage of 6 kV is administered to a hemispherical anode of radius 100 μm, with a planar cathode held at ground potential, generating an over-volted state with an electric field of 4 MV/m across a 1500 μm gap. The domain is seeded with an initial ion and electron density of 10 18 m -3 at 1 eV temperature confined to a spherical region of radius 100 μm centered at the tip of the anode. The air chemistry model [1] includes standard Townsend breakdown mechanisms (electron-neutral elastic, excitation, ionization, attachment, and detachment collision chemistry and secondary electron emission) as well as streamer mechanisms (photoionization and ion-neutral collisions) via tracking excited state neutrals which can then either quench via collisions or spontaneously emit a photon based on specific Einstein-A coefficients [2, 3]. In this work, positive streamer dynamics are formally quantified for each wedge angle in terms of electron velocity and density as temporal functions of coordinates r, Φ, and z. Applying a random plasma seed for each simulation, particles of interest are tracked with near femtosecond temporal resolution out to 1.4 ns and spatially binned. This process is repeated six times and results are averaged. Prior 2D studies have shown that the reduced electric field, E/n, can significantly impact streamer evolution [4]. We extend the analysis to 3D wedge geometries, to limit computational costs, and examine the wedge angle’s effect on streamer branching, propagation, and velocity. Results indicate that the smallest wedge angle that produced an acceptably converged solution is 30°. The potential effects that a mesh, when under-resolved with respect to the Debye length, can impart on streamer dynamics and numerical heating were not investigated, and we explicitly state here that the smallest cell size was approximately 10 times the minimum λ D in the streamer channel at late times. This constraint on cell size was the result of computational limitations on total mesh count.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Prediction of Solute Segregation at Metal/Oxide Interfaces Using Machine Learning Approaches

The atomic structure and chemistry at metal/oxide interfaces play a crucial role in determining their properties. However, studying semi-coherent metal/oxide interfaces that include misfit dislocations through density functional theory (DFT) is often computationally expensive due to the large number of atoms involved, ranging from hundreds to thousands. In this study, we explore solute segregation behavior at the Fe/Y 2 O 3 interface—an important model interface for cladding applications in nuclear fission reactors—by combining DFT calculations with a machine learning (ML) approach. ML models are trained using DFT-calculated segregation energies (𝐸 𝑆𝑒𝑔 ) to identify the key chemical and geometric factors influencing solute segregation at metal/oxide interfaces, revealing the competition between these features in determining 𝐸 𝑆𝑒𝑔 . Moreover, the segregation behavior at a specific Fe/Y 2 O 3 interface is predicted with high accuracy using ML models trained on data from this interface. Furthermore, it is found that the ML models could also predict solute segregation at a different Fe/Y 2 O 3 interface with a new orientation relationship (OR), at a computational cost of less than 1/45 of that required for similar DFT calculations.

36 - MATERIALS SCIENCE↗
DOE OSTI2023

Optimizing the regularization in size-consistent second-order Brillouin-Wigner perturbation theory

Despite its simplicity and relatively low computational cost, second-order Møller-Plesset perturbation theory (MP2) is well-known to overbind noncovalent interactions between polarizable monomers and some organometallic bonds. In such situations, the pairwise-additive correlation energy expression in MP2 is inadequate. Although energy-gap dependent amplitude regularization can substantially improve the accuracy of conventional MP2 in these regimes, the same regularization parameter worsens the accuracy for small molecule thermochemistry and density-dependent properties. Recently, we proposed a repartitioning of Brillouin-Wigner perturbation theory that is size-consistent to second order (BW-s2), and a free parameter ($α$) was set to recover the exact dissociation limit of H 2 in a minimal basis set. Alternatively $α$ can be viewed as a regularization parameter, where each value of $α$ represents a valid variant of BW-s2, which we denote as BW-s2($α$). In this work, we semi-empirically optimize $α$ for noncovalent interactions, thermochemistry, alkane conformational energies, electronic response properties, and transition metal datasets, leading to improvements in accuracy relative to the ab initio parameterization of BW-s2 and MP2. We demonstrate that the optimal $α$ parameter ($α$ = 4) is more transferable across chemical problems than energy-gap-dependent regularization parameters. This is attributable to the fact that the BW-s2($α$) regularization strength depends on all of the information encoded in the t amplitudes rather than just orbital energy differences. While the computational scaling of BW-s2($α$) is iterative $\mathcal{O}$($N^5$), this effective and transferable approach to amplitude regularization is a promising route to incorporate higher-order correlation effects at second-order cost.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Deep learning uncertainty quantification for clinical text classification

Machine learning algorithms are expected to work side-by-side with humans in decision-making pipelines. Thus, the ability of classifiers to make reliable decisions is of paramount importance. Deep neural networks (DNNs) represent the state-of-the-art models to address real-world classification. Although the strength of activation in DNNs is often correlated with the network’s confidence, in-depth analyses are needed to establish whether they are well calibrated. In this paper, we demonstrate the use of DNN-based classification tools to benefit cancer registries by automating information extraction of disease at diagnosis and at surgery from electronic text pathology reports from the US National Cancer Institute (NCI) Surveillance, Epidemiology, and End Results (SEER) population-based cancer registries. In particular, we introduce multiple methods for selective classification to achieve a target level of accuracy on multiple classification tasks while minimizing the rejection amount—that is, the number of electronic pathology reports for which the model’s predictions are unreliable. We evaluate the proposed methods by comparing our approach with the current in-house deep learning-based abstaining classifier. Overall, all the proposed selective classification methods effectively allow for achieving the targeted level of accuracy or higher in a trade-off analysis aimed to minimize the rejection rate. On in-distribution validation and holdout test data, with all the proposed methods, we achieve on all tasks the required target level of accuracy with a lower rejection rate than the deep abstaining classifier (DAC). Interpreting the results for the out-of-distribution test data is more complex; nevertheless, in this case as well, the rejection rate from the best among the proposed methods achieving 97% accuracy or higher is lower than the rejection rate based on the DAC. We show that although both approaches can flag those samples that should be manually reviewed and labeled by human annotators, the newly proposed methods retain a larger fraction and do so without retraining—thus offering a reduced computational cost compared with the in-house deep learning-based abstaining classifier.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Estimating basis functions in massive fields under the spatial mixed effects model

Abstract Spatial prediction is commonly achieved under the assumption of a Gaussian random field by obtaining maximum likelihood estimates of parameters, and then using the kriging equations to arrive at predicted values. For massive datasets, fixed rank kriging using the expectation–maximization algorithm for estimation has been proposed as an alternative to the usual but computationally prohibitive kriging method. The method reduces computation cost of estimation by redefining the spatial process as a linear combination of basis functions and spatial random effects. A disadvantage of this method is that it imposes constraints on the relationship between the observed locations and the knots. We develop an alternative method that utilizes the spatial mixed effects model, but allows for additional flexibility by estimating the range of the spatial dependence between the observations and the knots via an alternating expectation conditional maximization algorithm. Experiments show that our methodology improves estimation without sacrificing prediction accuracy while also minimizing the additional computational burden of extra parameter estimation. The methodology is applied to a temperature dataset archived by the United States National Climate Data Center, with improved results over previous methodology.

Pazdernik, Karl↗
DOE OSTI2025

Real-Space Quantification of Exciton Localization in Acene Crystals Using Wannier Function Decomposition

Here, we introduce the Wannier function decomposition of excitons (WFDX) method to quantify exciton localization in solids within the ab initio Bethe-Salpeter equation framework. By decomposing each Bloch exciton wave function into products of single-particle electron and hole maximally localized Wannier functions, this real-space approach provides well-defined orbital- and spatial-resolved measures of both Frenkel and charge-transfer excitons at low computational cost. We apply WFDX to excitons in acene crystals, quantifying how the number of rings, the exciton spin state, and the center-of-mass momentum affect spatial localization. Additionally, we show how this real-space representation reflects structural nonsymmorphic symmetries that are hidden in standard reciprocal-space descriptions. We demonstrate how the WFDX framework can be used to efficiently interpolate exciton expansion coefficients in reciprocal-space and outline how it may facilitate evaluation of observables involving position operators, highlighting its potential as a general tool for both analyzing and computing excitonic properties in solids.

Tao, Zui [University of California, Berkeley, CA (↗
DOE OSTI2020

An Entropy-Maximization Approach to Automated Training Set Generation for Interatomic Potentials

Machine learning-based interatomic potentials are currently garnering a lot of attention as they strive to achieve the accuracy of electronic structure methods at the computational cost of empirical potentials. Given their generic functional forms, the transferability of these potentials is highly dependent on the quality of the training set, the generation of which can be highly labor-intensive. Good training sets should at once contain a very diverse set of configurations while avoiding redundancies that incur cost without providing benefits. We formalize these requirements in a local entropy-maximization framework and propose an automated sampling scheme to sample from this objective function. We show that this approach generates much more diverse training sets than unbiased sampling and is competitive with hand-crafted training sets.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

Analytical Voltage Sensitivity Analysis for Unbalanced Power Distribution System

Large scale integration of distributed energy resources and electric vehicles in a transactive energy environment present new challenges in terms of voltage stability and fluctuations in a power distribution system. The impact of different level of DER/EV penetration on the voltages across the network is typically quantified through voltage sensitivity analyses. Existing methods of voltage sensitivity analysis are computationally expensive and prior efforts to develop analytical approximation lacks generality and have not been effectively validated. The objective of this work is to provide a new analytical method of voltage sensitivity analysis that has low computational cost and also allows for stochastic analysis of voltage change. This paper first derives an analytical approximation of change in voltage at a particular bus due to change in power consumption at other bus in a radial three phase unbalanced power distribution system. Then, the proposed method is shown to be valid for different load configurations, which demonstrates its generality. The results from our analytical approach is validated via classical load flow simulation of the test system based on IEEE 37 bus network. The proposed method is shown to have good accuracy, and computation complexity is of order O(1), compared to O(n3) in classical sensitivity analysis approaches.

Munikoti, Sai↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

First-principles molten salt phase diagrams through thermodynamic integration

Precise prediction of phase diagrams in molecular dynamics simulations is challenging due to the simultaneous need for long time and large length scales and accurate interatomic potentials. Here, we show that thermodynamic integration from low-cost force fields to neural network potentials trained using density-functional theory (DFT) enables rapid first-principles prediction of the solid–liquid phase boundary in the model salt NaCl. We use this technique to compare the accuracy of several DFT exchange–correlation functionals for predicting the NaCl phase boundary and find that the inclusion of dispersion interactions is critical to obtain good agreement with experiment. Importantly, our approach introduces a method to predict solid–liquid phase boundaries for any material at an ab initio level of accuracy, with the majority of the computational cost at the level of classical potentials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Magnetohydrodynamics with physics informed neural operators

Abstract The modeling of multi-scale and multi-physics complex systems typically involves the use of scientific software that can optimally leverage extreme scale computing. Despite major developments in recent years, these simulations continue to be computationally intensive and time consuming. Here we explore the use of AI to accelerate the modeling of complex systems at a fraction of the computational cost of classical methods, and present the first application of physics informed neural operators (NOs) (PINOs) to model 2D incompressible magnetohydrodynamics (MHD) simulations. Our AI models incorporate tensor Fourier NOs as their backbone, which we implemented with the TensorLY package. Our results indicate that PINOs can accurately capture the physics of MHD simulations that describe laminar flows with Reynolds numbers Re ⩽ 250 . We also explore the applicability of our AI surrogates for turbulent flows, and discuss a variety of methodologies that may be incorporated in future work to create AI models that provide a computationally efficient and high fidelity description of MHD simulations for a broad range of Reynolds numbers. The scientific software developed in this project is released with this manuscript.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Excitonic effects in absorption spectra of carbon dioxide reduction photocatalysts

Abstract The formation and disassociation of excitons play a crucial role in any photovoltaic or photocatalytic application. However, excitonic effects are seldom considered in materials discovery studies due to the monumental computational cost associated with the examination of these properties. Here, we study the excitonic properties of nearly 50 photocatalysts using state-of-the-art Bethe–Salpeter formalism. These ~50 materials were recently recognized as promising photocatalysts for CO 2 reduction through a data-driven screening of 68,860 materials. Here, we propose three screening criteria based on the optical properties of these materials, taking excitonic effects into account, to further down select six materials. Furthermore, we study the correlation between the exciton binding energies obtained from the Bethe–Salpeter formalism and those obtained from the computationally much less-expensive Wannier–Mott model for these chemically diverse ~50 materials. This work presents a paradigm towards the inclusion of excitonic effects in future materials discovery for solar-energy harvesting applications.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Combining shallow-water and analytical wake models for tidal array micro-siting

For tidal-stream energy to become a competitive renewable energy source, clustering multiple turbines into arrays is paramount. Array optimisation is thus critical for achieving maximum power performance and reducing cost of energy. However, ascertaining an optimal array layout is a complex problem, subject to specific site hydrodynamics and multiple inter-disciplinary constraints. In this work, we present a novel optimisation approach that combines an analytical-based wake model, FLORIS, with an ocean model, Thetis. The approach is demonstrated through applications of increasing complexity. By utilising the method of analytical wake superposition, the addition or alteration of turbine position does not require re-calculation of the entire flow field, thus allowing the use of simple heuristic techniques to perform optimisation at a fraction of the computational cost of more sophisticated methods. Using a custom condition-based placement algorithm, this methodology is applied to the Pentland Firth for arrays with turbines of 3.05 m/s rated speed, demonstrating practical implications whilst considering the temporal variability of the tide. For a 24-turbine array case, micro-siting using this technique delivered an array 15.8% more productive on average than a staggered layout, despite flow speeds regularly exceeding the rated value. Performance was evaluated through assessment of the optimised layout within the ocean model that treats turbines through a discrete turbine representation. Used iteratively, this methodology could deliver improved array configurations in a manner that accounts for local hydrodynamic effects.

16 TIDAL AND WAVE POWER↗
DOE OSTI2020

A machine learning approach for increased throughput of density functional theory substitutional alloy studies

In this study, a machine learning-based technique is developed to reduce the computational cost required to explore large design spaces of substitutional alloys. The first advancement is based on a neural network (NN) approach to predict the initial position of minority and majority ions prior to DFT relaxation. The second advancement is to allow the NN to predict the total energy for every possibility minority ion position and select the most stable configuration in the absence of relaxing each trial minority configuration. A bismuth oxide materials system, (Bi x La y Yb z ) 2 MoO 6 , was used as the model system to demonstrate the developed methods and quantify the resulting computational speedup. Compared to a brute force method that requires the calculation of every permutation of minority configuration and subsequent DFT relaxation, a 1.3× speedup was realized if the NN predicted the initial configuration of ions prior to relaxation. Implementation of the second advancement allowed the NN to predict the total energy for all possible trial configurations and downselect the most stable configurations prior to relaxation, resulting in a speedup of approximately 37×. Validation was done by comparing position and energy between the NN and DFT predictions. A maximum position vector mean squared error (MSE) of 1.6 × 10 -2 and a maximum energy MSE of 2.3 × 10 -7 was predicted for the worst case configuration. This method demonstrates a significant computational speedup, which has the potential for even greater computational savings for larger compositional design spaces.

36 MATERIALS SCIENCE↗
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 OSTI2025

GeoLoRA: Geometric integration for parameter efficient fine-tuning

Low-Rank Adaptation (LoRA) has become a widely used method for parameter-efficient fine-tuning of large-scale, pre-trained neural networks. However, LoRA and its extensions face several challenges, including the need for rank adaptivity, robustness, and computational efficiency during the fine-tuning process. We introduce GeoLoRA, a novel approach that addresses these limitations by leveraging dynamical low-rank approximation theory. GeoLoRA requires only a single backpropagation pass over the small-rank adapters, significantly reducing computational cost as compared to similar dynamical low-rank training methods and making it faster than popular baselines such as AdaLoRA. This allows GeoLoRA to efficiently adapt the allocated parameter budget across the model, achieving smaller low-rank adapters compared to heuristic methods like AdaLoRA and LoRA, while maintaining critical convergence, descent, and error-bound theoretical guarantees. The resulting method is not only more efficient but also more robust to varying hyperparameter settings. We demonstrate the effectiveness of GeoLoRA on several state-of-the-art benchmarks, showing that it outperforms existing methods in both accuracy and computational efficiency.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2026

A tensor train-based isogeometric solver for large-scale 3D poisson problems

We introduce a three-dimensional (3D), fully tensor train (TT) assembled isogeometric analysis (IGA) framework, TT-IGA, for solving partial differential equations (PDEs). Our method reformulates IGA discrete operators into TT format, enabling efficient compression and computation. Geometry evaluations use the original NURBS description at sampling points and TT approximation is applied to geometry-derived coefficient fields and discrete operators. We demonstrate the effectiveness of the proposed TT-IGA framework on the three-dimensional Poisson equation, achieving substantial reductions in memory and computational cost without compromising solution quality.

97 MATHEMATICS AND COMPUTING↗