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 397 records · Page 22

Learning a General Model of Single Phase Flow in Complex 3D Porous Media

Modeling effective transport properties of 3D porous media, such as permeability, at multiple scales is challenging as a result of the combined complexity of the pore structures and fluid physics—in particular, confinement effects which vary across the nanoscale to the microscale. While numerical simulation is possible, the computational cost is prohibitive for realistic domains, which are large and complex. Although machine learning (ML) models have been proposed to circumvent simulation, none so far has simultaneously accounted for heterogeneous 3D structures, fluid confinement effects, and multiple simulation resolutions. By utilizing numerous computer science techniques to improve the scalability of training, we have for the first time developed a general flow model that accounts for the pore-structure and corresponding physical phenomena at scales from Angstrom to the micrometer. Using synthetic computational domains for training, our ML model exhibits strong performance (R 2 = 0.9) when tested on extremely diverse real domains at multiple scales.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Shadow molecular dynamics and atomic cluster expansions for flexible charge models

A shadow molecular dynamics scheme for flexible charge models is presented, where the shadow Born-Oppenheimer potential is derived from a coarse-grained approximation of range-separated density functional theory. The interatomic potential, including the atomic electronegativities and the charge-independent short-range part of the potential and force terms, are modeled by the linear atomic cluster expansion (ACE), which provides a computationally efficient alternative to many machine learning methods. The shadow molecular dynamics scheme is based on extended Lagrangian (XL) Born-Oppenheimer molecular dynamics (BOMD) [Eur. Phys. J. B 94, 164 (2021)]. XL-BOMD provides a stable dynamics, while avoiding the costly computational overhead associated with solving an all-to-all system of equations, which normally is required to determine the relaxed electronic ground state prior to each force evaluation. To demonstrate the proposed shadow molecular dynamics scheme for flexible charge models using the atomic cluster expansion, we emulate the dynamics generated from self-consistent charge density functional tight-binding (SCC-DFTB) theory using a second-order charge equilibration (QEq) model. The charge-independent potentials and electronegativities of the QEq model are trained for a supercell of uranium oxide (UO2) and a molecular system of liquid water. The combined ACE + XL-QEq dynamics are stable over a wide range of temperatures both for the oxide and the molecular systems, and provide a precise sampling of the Born-Oppenheimer potential energy surfaces. Accurate ground Coulomb energies are produced by the ACE-based electronegativity model during an NVE simulation of UO 2 , predicted to be within 1 meV of those from SCC-DFTB on average during comparable simulations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Leveraging Large Language Models for Real-World Data Evidence: A Framework for Automated Treatment Extraction and Data Harmonization

Background: The ability to comprehensively collect treatment information from cancer patient medical records would enable studies to evaluate real-world benefits and risks tied to specific treatments. Currently, it is difficult to system- atically collect high-quality treatment information because it is often stored in unstructured text. Manually extracting and standardizing drug and regimen data is time-intensive. Recent advances in large language models (LLMs) offer a potential solution for automated extraction of structured treatment information from clinical text. Objective: This study systematically evaluates the utility of four LLMs from the Llama family for automated extraction of oncology treatment information from clinical text. This information can guide researchers using cancer registry data to provide insights into cancer care and outcomes beyond clinical trials. Methods: Four instruction-tuned Llama models with varying parameter counts (1B, 3B, 8B, and 70B) were evaluated for their ability to extract treatment information from clinical documents. A unified oncology knowledge base integrating seven major public data sources was developed to standardize and normalize extracted entities—a critical step for harmonizing data from diverse sources. Extracted treatment data were compared against expert-annotated ground truth. Model performance was assessed using accuracy metrics (Precision, Recall, F1-Score) and opera- tional feasibility metrics, including processing speed and structural compliance of the output. Results: A strong positive correlation was observed between model size and extraction accuracy. F1-score improved from 0.609 for the 1B model to 0.710 (3B), 0.807 (8B), and 0.828 (70B). While larger models demonstrated superior accuracy and compliance, they incurred higher computational costs. The modest performance difference between 8B and 70B suggests diminishing returns with increasing model size. Conclusions: LLMs represent a viable technology for automating oncology treatment extraction. The 8B-parameter model emerged as a highly effective option, balancing high accuracy and computational efficiency. Selecting an appropriate LLM for deployment in cancer registries involves a trade-off between desired accuracy and available operational resources. Harmonizing extracted entities with the oncology knowledge base facilitates standardized integration into common data models, enhancing data quality for real-world evidence analyses.

artificial intelligence↗

A hybrid surrogate modeling framework for the Digital Twin of a Fluoride-salt-cooled High-temperature Reactor (FHR)

While nuclear energy is a non-greenhouse-gas emitting energy source, expensive operational costs due to the high-level of safety requirements decreases their competitiveness in the sustainable energy market. Advanced reactor concepts paired with Digital Twins aim to increase the commercialization gains of nuclear energy by reducing operational costs, increasing reactor reliability and enhancing power generation. To support Digital Twin tasks such as real-time autonomous control, proactive maintenance monitoring or optimizing power demand operations, a fast and accurate virtual representation of the Nuclear Power Plant (NPP) is required. The computational cost of high-fidelity, physics-based models are unsuitable for real-time analysis or scalability. Here, in this work, a hybrid surrogate modeling framework is developed fora Fluoride-salt-cooled High-temperature Reactor (FHR) that leverages physics-inspired models for key reactor components and uses data-driven methods for rapid system state space prediction. The Xenon reactivity feedback model is integrated to inform the surrogate model about the reactor core and the homologous pump theory model is the basis for representing pump degradation. Using a detailed, two dimensional thermal hydraulics model to generate data on the FHR, we train a network of Vectorized Autoregressive Moving-Average with eXogenous input (VARMAX) models to predict the remaining state values. The result is a surrogate model that provides a detailed reactor state representation of 41 system states and a pump degradation analysis. The framework is applied to Load Follows profiles, yielding high accuracy and a speedup that is more than 4000x faster compared to the higher- fidelity thermal hydraulics model, enabling real-time operational intelligence and applications in long horizon predictions. While the surrogate model framework is demonstrated for the particular case of FHR, the hybrid physical/data-driven modeling approach including the network of surrogates and the underlying modularity has the potential to be applied to other physical asset systems.

Digital Twins↗

Using Machine Learning to Greatly Accelerate Path Integral Ab Initio Molecular Dynamics

Ab initio molecular dynamics (AIMD) has become one of the most popular and robust approaches for modeling complicated chemical, liquid, and material systems. However, the formidable computational cost often limits its widespread application in simulations of the largest-scale systems. Furthermore, the situation becomes even more severe in cases where the hydrogen nuclei may be better described as quantized particles using a path integral representation. Here, we present a computational approach that combines machine learning with recent advances in path integral contraction schemes, and we achieve a 2 orders of magnitude acceleration over direct path integral AIMD simulation while at the same time maintaining its accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Numerically exact configuration interaction at quadrillion-determinant scale

The combinatorial growth of configuration interaction (CI) has long limited this formally exact quantum chemistry method to only the smallest molecules. Here, we report a numerically exact CI calculation exceeding one quadrillion (10 15 ) determinants, made possible by a lossless categorical compression strategy within the small-tensor-product distributed active space (STP-DAS) framework. This approach overcomes the traditional memory bottlenecks of CI by a numerically exact compression of the wavefunction representation and reformulating the most computationally demanding matrix–vector operations. Using this method, we performed a fully relativistic CI calculation of the ground state of HBrTe with over 10 15 complex-valued determinants in just 34.5 h on 1000 computing nodes—the largest CI calculation ever reported. We further achieved fast computation for systems with hundreds of billions of determinants on only a few compute nodes. Extensive benchmarks confirm that the method retains full numerical exactness while cutting memory and computational cost by orders of magnitude. Compared to previous state-of-the-art CI calculations, this work achieves a 1000 times increase in CI space, a 10 6 -fold increase in floating-point operations performed, and a 10 6 -fold improvement in computational speed.

Computational chemistry↗

Randomized Algorithms for Linear Solvers

Recently, randomized algorithms in numerical linear algebra, specifically those centered around random sketching, have gained traction in primarily theoretical research due to their potential to significantly reduce problem dimensionality at the cost of an O(1) multiplicative distortion factor. It has been assumed that this sketching can be done efficiently, but thorough investigation into how precisely to do it has been neglected. Moreover, the theory-based community has argued for sketching’s ability to reduce computational cost via complexity analysis, but has not researched how it affects the stability of the algorithms. At Sandia, efficient linear solvers that scale well on modern HPC architectures while maintaining stability are imperative for practical applications. In this LDRD, we developed a random sketching strategy that is substantially faster than existing ones, and demonstrate its superior performance in practice on a NVIDIA H100 GPU. Moreover, we show how this can be used to significantly outperform existing linear least squares solvers while improving the solver’s stability as well. Additionally, we demonstrate how this sketching strategy can be used to make a fast, stable QR factorization that can subsequently be used in s-step and block Krylov solvers. Finally, we incorporate a sketching-based block orthogonalization scheme into s-step GMRES, which is stable and faster than existing approaches on the Perlmutter supercomputer.

97 MATHEMATICS AND COMPUTING↗

Spectral deferred correction methods for high-order accuracy in poroelastic problems

In this work, we investigate high-order accuracy in time integration by examining two operator splitting methods for poroelastic problems: the two-pass and the spectral deferred correction (SDC) methods. To enhance the order of accuracy, the two-pass method partitions a coupled operator symmetrically, whereas the SDC method corrects truncation errors by establishing an error equation. These high-order methods are applied to underlying solution strategies, i.e., monolithic, fixed-stress sequential, and undrained sequential methods. We observe that semi-discretized systems from spatial discretization have forms similar to those of index-1 differential algebraic equations (DAEs), causing order reduction against the two-pass method when it is used in conjunction with either the monolithic or sequential method. On the other hand, the SDC in conjunction with the monolithic method exhibits the desired second-order accuracy in poroelastic problems while increasing the order of accuracy for index-1 DAEs. However, the SDC in conjunction with either of the two sequential methods does not achieve the desired order of accuracy, and maintains first order because the flow equation for poroelasticity has an additional approximation associated with the volumetric strain rate term, which does not yield exactly the same forms as those of conventional DAEs. Thus, the monolithic SDC method can achieve higher-order accuracy, but may require higher computational costs because it involves solving matrix systems larger than those for the sequential methods.

02 PETROLEUM↗

Nonlinear proper orthogonal decomposition for convection-dominated flows

Autoencoder techniques find increasingly common use in reduced order modeling as a means to create a latent space. This reduced order representation offers a modular data-driven modeling approach for nonlinear dynamical systems when integrated with a time series predictive model. In this Letter, we put forth a nonlinear proper orthogonal decomposition (POD) framework, which is an end-to-end Galerkin-free model combining autoencoders with long short-term memory networks for dynamics. By eliminating the projection error due to the truncation of Galerkin models, a key enabler of the proposed nonintrusive approach is the kinematic construction of a nonlinear mapping between the full-rank expansion of the POD coefficients and the latent space where the dynamics evolve. We test our framework for model reduction of a convection-dominated system, which is generally challenging for reduced order models. Our approach not only improves the accuracy, but also significantly reduces the computational cost of training and testing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parametric model-order reduction for radiation transport using multi-resolution proper orthogonal decomposition

For parametric high-fidelity simulations, it is often desirable to utilize a reduced-order model (ROM) to emulate, at a reduced computational cost, parametric solutions of the governing partial differential equations (PDEs) for unseen parameter values. One commonly employed option is to utilize a data-driven, projection-based ROM supplemented with subspace identification via proper orthogonal decomposition (POD). POD discovers the ROM subspace by computing the singular value decomposition (SVD) of a set of training data from the full-order model (FOM). In streaming-dominated radiation transport simulations with localized sources, solutions often greatly vary over the spatial domain by many orders of magnitude. In such cases, machine-precision arithmetic can be insufficient to obtain an accurate SVD, resulting in a poorly performing ROM. We present a method called multiresolution POD (mrPOD) that mitigates these inaccuracies. The mrPOD method works by decomposing the spatial domain into regions and performing proper orthogonal decomposition on the training dataset separately in each region. In conclusion, mrPOD is tested on single energy group and multigroup atmospheric shielding transport problems and is shown to outperform classic POD.

42 ENGINEERING↗

A layered 2D computational framework: Theory and applications to nuclear fuel behavior

Nuclear fuel performance computer codes have been developed over the last 50 years to analyze fuel behavior under various operating conditions. Traditionally, these codes used quasi-two-dimensional (also commonly known as 1.5D) representations of the fuel rod, which model the rod using a set of one-dimensional axisymmetric models that represent the behavior at specific axial positions on the rod. Modern fuel performance codes have the ability to investigate full three-dimensional (3D) effects and couple to other physics-based codes for true multiphysics simulations. However, with increasing complexity comes increasing computational costs. Many phenomena of interest involve azimuthally-varying behavior that cannot be represented using the aforementioned quasi-two-dimensional approach, but do not require the use of a full 3D model. To efficiently address these problems, there is a need for a computational framework that provides a compromise between the quasi-two-dimensional and full 3D models. In this paper, we present a new quasi-three-dimensional approach that represents the fuel as a set of 2D planar models that represent the behavior of the fuel cross-section at various axial positions. Presented here are the theory behind the methodology, test cases to illustrate proper implementation, and practical applications of its use in the BISON fuel performance code for a variety of cases in nuclear fuel analysis, such as fuel fracture, axial fuel relocation, and cladding distension and oxidation.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Combined First-Principles Calculations of Electron–Electron and Electron–Phonon Self-Energies in Condensed Systems

In this work, we present a method to efficiently combine the computation of electron–electron and electron–phonon self-energies, which enables the evaluation of electron–phonon coupling at the G 0 W 0 level of theory for systems with hundreds of atoms. In addition, our approach, which is a generalization of a method recently proposed for molecules [J. Chem. Theory Comput.2018, 14, 6269–6275], enables the inclusion of nonadiabatic and temperature effects at no additional computational cost. We present results for diamond and defects in diamond and discuss the importance of numerically accurate G 0 W 0 band structures to obtain robust predictions of zero point renormalization (ZPR) of band gaps, and of the inclusion of nonadiabatic effects to accurately compute the ZPR of defect states in the band gap.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Deep learning to estimate permeability using geophysical data

Time-lapse electrical resistivity tomography (ERT) is a popular geophysical method to estimate three-dimensional (3D) permeability fields from electrical potential difference measurements. Traditional inversion and data assimilation methods are used to ingest this ERT data into hydrogeophysical models to estimate permeability. Due to ill-posedness and the curse of dimensionality, existing inversion strategies provide poor estimates and low resolution of the 3D permeability field. Recent advances in deep learning provide us with powerful algorithms to overcome this challenge. This paper presents a deep learning (DL) framework to estimate the 3D subsurface permeability from time-lapse ERT data. To test the feasibility of the proposed framework, we train DL-enabled inverse models on simulation data. Each measurement in both synthetic and field data is standardized by removing the mean and scaling the time-series to unit variance. This pre-processing step is necessary to bring simulation data closer to field observations. Subsurface process models based on hydrogeophysics are used to generate this synthetic data. Training performed on limited simulation data resulted in the DL model over-fitting. An advanced data augmentation based on mixup is implemented to generate additional training samples to overcome this issue. This mixup technique creates weakly labeled (low-fidelity) samples from strongly labeled (high-fidelity) data. The weakly labeled training data is then used to develop DL-enabled inverse models and reduce over-fitting. As both time-lapse ERT (1133048 features/realization) and 3D permeability (585453 features/realization) data samples are from a high-dimensional space, principal component analysis (PCA) is employed to reduce dimensionality. Encoded ERT and encoded permeability are generated using the trained PCA estimators. A deep neural network is then trained to map the encoded ERT to encoded permeability. This mixup training and unsupervised learning allowed us to build a fast and reasonably accurate DL-based inverse model under limited simulation data. Results show that proposed weak supervised learning can capture salient spatial features in the 3D permeability field. Quantitatively, the average mean squared error (in terms of the natural log) on the strongly labeled training, validation, and test datasets is less than 0.5. The R 2 -score (global metric) is greater than 0.75, and the percent error in each cell (local metric) is less than 10%. Finally, an added benefit in terms of computational cost is that the proposed DL-based inverse model is at least O(10 4 ) times faster than running a forward model once it is trained. Data generation, DL model training, and hyperparameter tuning to identify optimal neural network architectures utilized high-performance computing resources while the DL inference is performed on a standard laptop. Approximately, O(10 5 ) processor hours are used for generating data and DL tuning and training. We acknowledge that the data generation and DL model development are expensive. But once a DL model is trained, it can be re-used for inversion rapidly for the given system, with set physics and domain. Note that traditional inversion may require multiple forward model simulations (e.g., in the order of 10 to 1000), which are very expensive. This computational savings ≈ O(10 5 ) – O(10 7 )) makes the proposed DL-based inverse model attractive for subsurface imaging and real-time ERT monitoring applications due to fast and yet reasonably accurate estimations of permeability field.

58 GEOSCIENCES↗

Incorporating Coverage-Dependent Reaction Barriers into First-Principles-Based Microkinetic Models: Approaches and Challenges

Mean-field microkinetic models (MKMs) are appealing for their relatively facile construction, computational tractability, and high-throughput catalyst screening capabilities. As such, they will continue to be a valuable tool for materials design in heterogeneous catalysis even as the field aims to describe more complex systems. Numerous prior reports have provided the groundwork for constructing first-principles-based MKMs, including the analysis of strategies for incorporating lateral interactions into thermodynamic parameters (e.g., adsorption energies). Yet, there remains a need for concerted dialogue on methods for calculating and incorporating coverage-dependent kinetic parameters into MKMs. In this Perspective, we assess strategies for doing so, including the corresponding key physical implications and computational challenges. Here, we emphasize that decoupling thermodynamic and kinetic parameters within MKMs can violate thermodynamic consistency and risk unphysical solutions. For some reactions and catalyst materials, scaling relationships can predict coverage-dependent activation energies, but there are several exceptions evident in the literature, indicating that this approach is not universally applicable and that the field could benefit from research aimed at elucidating the limitations. Conducting high-coverage transition state searches is a rigorous but computationally costly strategy, and the effects of various methods for mitigating this cost on resulting energetics have yet to be broadly explored and validated. The goal of this Perspective is to generate discussion on and inspire focused research into the physical relevance of approaches for describing coverage-dependent reaction barriers in MKMs, including the development of computationally tractable methodologies, to advance the applicability of MKMs across diverse reaction chemistries and conditions.

36 MATERIALS SCIENCE↗

Task-oriented machine learning surrogates for tipping points of agent-based models

We present a machine learning framework bridging manifold learning, neural networks, Gaussian processes, and Equation-Free multiscale approach, for the construction of different types of effective reduced order models from detailed agent-based simulators and the systematic multiscale numerical analysis of their emergent dynamics. The specific tasks of interest here include the detection of tipping points, and the uncertainty quantification of rare events near them. Our illustrative examples are an event-driven, stochastic financial market model describing the mimetic behavior of traders, and a compartmental stochastic epidemic model on an Erdös-Rényi network. We contrast the pros and cons of the different types of surrogate models and the effort involved in learning them. Importantly, the proposed framework reveals that, around the tipping points, the emergent dynamics of both benchmark examples can be effectively described by a one-dimensional stochastic differential equation, thus revealing the intrinsic dimensionality of the normal form of the specific type of the tipping point. This allows a significant reduction in the computational cost of the tasks of interest.

97 MATHEMATICS AND COMPUTING↗

Efficient evaluation of the Breit operator in the Pauli spinor basis

The frequency-independent Coulomb–Breit operator gives rise to the most accurate treatment of two-electron interaction in the non-quantum-electrodynamics regime. The Breit interaction in the Coulomb gauge consists of magnetic and gauge contributions. The high computational cost of the gauge term limits the application of the Breit interaction in relativistic molecular calculations. In this work, we apply the Pauli component integral–density matrix contraction scheme for gauge interaction with a maximum spin- and component separation scheme. We also present two different computational algorithms for evaluating gauge integrals. One is the generalized Obara–Saika algorithm, where the Laplace transformation is used to transform the gauge operator into Gaussian functions and the Obara–Saika recursion is used for reducing the angular momentum. The other algorithm is the second derivative of Coulomb interaction evaluated with Rys-quadrature. This work improves the efficiency of performing Dirac–Hartree–Fock with the variational treatment of Breit interaction for molecular systems. In conclusion, we use this formalism to examine relativistic trends in the Periodic Table and analyze the relativistic two-electron interaction contributions in heavy-element complexes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SO(3)-invariant PCA with application to molecular data

Principal component analysis (PCA) is a fundamental technique for dimensionality reduction and denoising; however, its application to three-dimensional data with arbitrary orientations -- common in structural biology -- presents significant challenges. A naive approach requires augmenting the dataset with many rotated copies of each sample, incurring prohibitive computational costs. In this paper, we extend PCA to 3D volumetric datasets with unknown orientations by developing an efficient and principled framework for SO(3)-invariant PCA that implicitly accounts for all rotations without explicit data augmentation. By exploiting underlying algebraic structure, we demonstrate that the computation involves only the square root of the total number of covariance entries, resulting in a substantial reduction in complexity. We validate the method on real-world molecular datasets, demonstrating its effectiveness and opening up new possibilities for large-scale, high-dimensional reconstruction problems.

Fraiman, Michael [Tel Aviv Univ., Tel Aviv (Israel↗

CAFE AU LAIT: Compute-Aware Federated Augmented Low-Rank AI Training

Federated finetuning is crucial for unlocking the knowledge embedded in pretrained Large Language Models (LLMs) when data are geographically distributed across clients. Unlike finetuning with data from a single institution, federated finetuning allows collaboration across multiple institutions, enabling the utilization of diverse and decentralized datasets while preserving data privacy. Given the high computing costs of LLM training and the emphasis on energy efficiency in Federated Learning (FL), Low-Rank Adaptation (LoRA) has emerged as a widely adopted algorithm due to its significantly reduced number of trainable parameters. However, this assumes that all data silos have the necessary computing resources to compute local updates of LLMs. Nevertheless, in practice, the computing resources across clients are highly heterogeneous: while some may have access to hundreds of GPUs, others might have limited or no GPU access. Recently, federated finetuning using synthetic data has been proposed, allowing clients to participate in a collaborative training run without training LLMs locally. However, our experimental results reveal a performance gap between models trained using synthetic data and those trained using local updates. Motivated by the observed heterogeneity in computing resources and the performance gap, we propose a novel two-stage algorithm that leverages the storage and computing capabilities of a strong server. In the first stage, under the coordination of the strong server, clients with limited computing resources collaborate to generate synthetic data, which is transferred to and stored on the strong server. In the second stage, the strong server uses this synthetic data on behalf of the resource-constrained clients to perform federated LoRA finetuning alongside clients with sufficient computing resources. This approach ensures that all clients can participate in the finetuning process. Experimental results demonstrate that incorporating local updates from even a small fraction of clients improves performance compared to using synthetic data for all clients. Furthermore, we incorporate the Gaussian mechanism in both stages to guarantee client-level differential privacy.

Wang, Jiayi [ORNL]↗