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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
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↗
NASA NTRS1990

Recursive dynamics for flexible multibody systems using spatial operators

Due to their structural flexibility, spacecraft and space manipulators are multibody systems with complex dynamics and possess a large number of degrees of freedom. Here the spatial operator algebra methodology is used to develop a new dynamics formulation and spatially recursive algorithms for such flexible multibody systems. A key feature of the formulation is that the operator description of the flexible system dynamics is identical in form to the corresponding operator description of the dynamics of rigid multibody systems. A significant advantage of this unifying approach is that it allows ideas and techniques for rigid multibody systems to be easily applied to flexible multibody systems. The algorithms use standard finite-element and assumed modes models for the individual body deformation. A Newton-Euler Operator Factorization of the mass matrix of the multibody system is first developed. It forms the basis for recursive algorithms such as for the inverse dynamics, the computation of the mass matrix, and the composite body forward dynamics for the system. Subsequently, an alternative Innovations Operator Factorization of the mass matrix, each of whose factors is invertible, is developed. It leads to an operator expression for the inverse of the mass matrix, and forms the basis for the recursive articulated body forward dynamics algorithm for the flexible multibody system. For simplicity, most of the development here focuses on serial chain multibody systems. However, extensions of the algorithms to general topology flexible multibody systems are described. While the computational cost of the algorithms depends on factors such as the topology and the amount of flexibility in the multibody system, in general, it appears that in contrast to the rigid multibody case, the articulated body forward dynamics algorithm is the more efficient algorithm for flexible multibody systems containing even a small number of flexible bodies. The variety of algorithms described here permits a user to choose the algorithm which is optimal for the multibody system at hand. The availability of a number of algorithms is even more important for real-time applications, where implementation on parallel processors or custom computing hardware is often necessary to maximize speed.

Jain, A.↗
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↗
DOE OSTI2020

Energy conservative SBP discretizations of the acoustic wave equation in covariant form on staggered curvilinear grids

In this work, we develop a numerical method for solving the acoustic wave equation in covariant form on staggered curvilinear grids in an energy conserving manner. The use of a covariant basis decomposition leads to a rotationally invariant scheme that outperforms a Cartesian basis decomposition on rotated grids. The discretization is based on high order Summation-By-Parts (SBP) operators and preserves both symmetry and positive definiteness of the contravariant metric tensor. To improve accuracy and decrease computational cost, we also derive a modified discretization of the metric tensor that leads to a conditionally stable discretization. Bounds are derived that yield a point-wise condition that can be evaluated to check for stability of the modified discretization. This condition shows that the interpolation operators should be constructed such that their norm is close to one.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗
DOE OSTI2023

Predicting wind farm operations with machine learning and the P2D‐RANS model: A case study for an AWAKEN site

Abstract The power performance and the wind velocity field of an onshore wind farm are predicted with machine learning models and the pseudo‐2D RANS model, then assessed against SCADA data. The wind farm under investigation is one of the sites involved with the American WAKE experimeNt (AWAKEN). The performed simulations enable predictions of the power capture at the farm and turbine levels while providing insights into the effects on power capture associated with wake interactions that operating upstream turbines induce, as well as the variability caused by atmospheric stability. The machine learning models show improved accuracy compared to the pseudo‐2D RANS model in the predictions of turbine power capture and farm power capture with roughly half the normalized error. The machine learning models also entail lower computational costs upon training. Further, the machine learning models provide predictions of the wind turbulence intensity at the turbine level for different wind and atmospheric conditions with very good accuracy, which is difficult to achieve through RANS modeling. Additionally, farm‐to‐farm interactions are noted, with adverse impacts on power predictions from both models.

17 WIND ENERGY↗
DOE OSTI2020

Simple and efficient algorithms for training machine learning potentials to force data

Machine learning models, trained on data from ab initio quantum simulations, are yielding molecular dynamics potentials with unprecedented accuracy. One limiting factor is the quantity of available training data, which can be expensive to obtain. A quantum simulation often provides all atomic forces, in addition to the total energy of the system. These forces provide much more information than the energy alone. It may appear that training a model to this large quantity of force data would introduce significant computational costs. Actually, training to all available force data should only be a few times more expensive than training to energies alone. Here, we present a new algorithm for efficient force training, and benchmark its accuracy by training to forces from real-world datasets for organic chemistry and bulk aluminum.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Continuous integration data-driven platform of industrial-scale subsurface storage for real-time analytics

This project helped address the growing need for efficient and scalable models to support geological carbon and energy storage, which are crucial for achieving net-zero emissions. Traditionally accurate high-fidelity numerical models have been used to simulate relevant storage processes under a handful of processes, however such models are computationally demanding, making uncertainty quantification impractical. Consequently, we first developed a machine learning framework, based on Graph Neural Operators (GNOs), to improving the accuracy of model predictions for a fixed computational budget. We then developed an Ensemble of Improved Neural Operators (ENO), which uses bagging and Monte Carlo dropout techniques, to further improve prediction accuracy. Lastly, we developed the way to explain progressive transfer learning methods to reduce the amount of training data and computational cost of training (i.e., reduce trainable parameters) when using our models for multiple storage sites. Our numerical investigation, which used real-world case studies, demonstrated that our framework can significantly improve the safety and efficiency of geological storage operations, with potential applications in other domains such as geothermal reservoirs and climate modeling.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Introduction to and comparison of deep learning and optimization approaches to analytical wake modeling of a tilted wind turbine

This paper introduces innovative optimization and deep learning techniques to enhance the prediction of complex wake dynamics in the downstream wind velocity of tilted wind turbines. Traditional methods for calibrating the Bastankhah wake model often lead to increased errors in wind velocity distribution due to overfitting of the local wake characteristics. To address this issue, we propose an additional global optimization step to reduce errors in wind velocity predictions with respect to various wake parameters. Despite this improvement, the Bastankhah model's axisymmetric Gaussian wake shape limits its accuracy for complex wake structures. Therefore, we also propose a deep learning approach, which demonstrates promising results by accurately modeling complex wake shapes across a broader range of tilt angles with minimal computational cost. The deep learning approach achieves near-identical predictions to high-fidelity large-eddy simulations, representing a promising advancement in wake modeling.

17 WIND ENERGY↗
NASA NTRSDate not supplied

Pragmatic Stress Prediction on Additively Manufactured Coupons

Prediction of residual stresses from process parameters for additively manufactured large metal parts is computationally expensive. NASA is currently developing meter-scale parts with direct energy deposition. Practically, the predictive computational methods need to efficiently scale-up to meter-scale parts. Coupled thermal-mechanical multi-physics simulations have been developed with the pragmatic method using ABAQUS, COMSOL Multiphysics, ALE3D software. The residual stresses are a result of the manufacturing process which creates thermal cycling of the build layers. The pragmatic method uses lumped thermal layers for stress predictions to reduce computational costs. The stress predictions as well as deformations of the different codes are compared with each other and with ANSYS Additive using identical material models, boundary and initial conditions. The codes were used to simulate three different geometries: a thin wall, hollow cylinder and twin-cantilever part. The coupon parts were then manufactured with Inconel-625. The residual stresses in these parts were measured using X-ray diffraction as well as neutron beam diffraction at NIST. The stress measurements for the two technologies are compared. The pragmatic stress prediction method enabled predictions of the multi-centimeter scale parts using desktop computer workstations in only a few hours for each coupon. The results of the simulated stress predictions compared favorably with the measured stresses even though thermally lumped layers were employed. Finally, a two-meter scale nozzle was simulated using ANSYS Additive. The simulations were used to examine the build orientation trade-space with respect to resulting geometric deformation. The predicted deformations were compared to measurements of an actual subscale part manufactured with direct energy deposition.

Additive Manufacturing↗
NASA NTRSDate not supplied

Pragmatic Stress Prediction on Additively Manufactured Coupons

Prediction of residual stresses from process parameters for additively manufactured large metal parts is computationally expensive. NASA is currently developing meter-scale parts with direct energy deposition. Practically, the predictive computational methods need to efficiently scale-up to meter-scale parts. Coupled thermal-mechanical multi-physics simulations have been developed with the pragmatic method using ABAQUS, COMSOL Multiphysics, ALE3D software. The residual stresses are a result of the manufacturing process which creates thermal cycling of the build layers. The pragmatic method uses lumped thermal layers for stress predictions to reduce computational costs. The stress predictions as well as deformations of the different codes are compared with each other and with ANSYS Additive using identical material models, boundary and initial conditions. The codes were used to simulate three different geometries: a thin wall, hollow cylinder and twin-cantilever part. The coupon parts were then manufactured with Inconel-625. The residual stresses in these parts were measured using X-ray diffraction as well as neutron beam diffraction at NIST. The stress measurements for the two technologies are compared. The pragmatic stress prediction method enabled predictions of the multi-centimeter scale parts using desktop computer workstations in only a few hours for each coupon. The results of the simulated stress predictions compared favorably with the measured stresses even though thermally lumped layers were employed. Finally, a two-meter scale nozzle was simulated using ANSYS Additive. The simulations were used to examine the build orientation trade-space with respect to resulting geometric deformation. The predicted deformations were compared to measurements of an actual subscale part manufactured with direct energy deposition.

pragmatic method↗
DOE OSTI2022

Iterative Workflow for Quantification and Minimization of Reduced Chemistry-Induced Uncertainties in Reacting Flow Simulation

Reduced chemistry models mitigate computational cost but introduce two sources of uncertainties in reacting flow simulation, including chemical information loss due to model reduction, and approximation errors due to non-optimal projection. We present an iterative workflow for quantification and minimization of reduced chemistry-induced uncertainties in reacting flow simulations.

chemistry↗
DOE OSTI2026

Scaling open-weight large language models for hydropower regulatory information extraction: A systematic analysis

Information extraction from regulatory and technical documents using large language models (LLMs) involves practical trade-offs between extraction quality and computational cost. We evaluate eight open-weight LLMs spanning 0.6B–70B parameters on hydropower licensing documents and report deployment-oriented evidence under a unified extraction schema and evaluation protocol. Across the model set, we observe clear scale-dependent trends in both baseline extraction quality and the effectiveness of reflective reasoning (self-checking) under our fixed-prompt, no-augmentation setting. Mid-scale models often provide a favorable balance of accuracy and efficiency, whereas the smallest models show limited or inconsistent gains from the reasoning variants tested. Larger models achieve the highest overall F1 scores but incur substantially greater compute and infrastructure requirements. We further find that reliability failure modes can distort conventional metrics in this domain: in particular, high recall can coincide with systematic extraction errors when models fabricate values for fields that are absent from the source text, underscoring the importance of conservative null handling and evidence-grounded evaluation. Overall, our study provides a reproducible resource–performance comparison for open-weight LLM-based extraction in hydropower regulatory documentation and offers practical guidance for model selection under different deployment constraints.

Evaluation protocol↗