Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational efficiency”

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 19 records

DEMONSTRATION OF A DATA-DRIVEN PHYSICS-BASED APPROACH FOR COMPUTATIONALLY EFFICIENT CFD PREDICTION OF TWO-PHASE BUBBLY FLOW

To realize efficient computational fluid dynamics (CFD) prediction of two-phase flow, a multi-scale physics-guided data-driven approach, Feature Similarity Measurement (FSM) technique was developed for error estimation in two-phase flow simulation using coarse-mesh CFD, to achieve a comparable accuracy as fine-mesh simulations with fast-running feature. By defining physics-guided parameters and variable gradients as physical features, FSM has the capability to capture the underlying local patterns in the coarse-mesh CFD simulation. Massive low-fidelity data and respective high-fidelity data are used to explore the underlying information relevant to the main simulation errors and the effects of phenomenological scaling. By learning from previous simulation data, a surrogate model using deep feedforward neural network (DFNN) can be developed and trained to estimate the simulation error of coarse-mesh CFD. In a demonstration case of two-phase bubbly flow, the DFNN model well captured and corrected the unphysical “peaks” in the velocity and void fraction profiles near the wall in the coarse-mesh configuration, even for extrapolative predictions. The research documented supports the feasibility of the physics-guided deep learning methods for coarse mesh CFD simulations which has a potential for the efficient industrial design.

42 ENGINEERING↗

An efficient computational framework for charge density estimation in twisted bilayer graphene

Electronic properties such as band structure and Fermi velocity in low-angle twisted bilayer graphene (TBG) are intrinsically dependent on the atomic structure. Rigid rotation between individual graphene layers provides an approximate description of the bilayer symmetry. Upon relaxation, in-plane displacement of the atoms in low angle TBG causes a change in the symmetry through the enlargement of the AB stacking regions and the reduction in size of AA and SP stacking regions. However, the effect of this in-plane relaxation on the charge density remains unexplored, because the necessary electronic structure calculations of such large supercells of low twist angle TBG are computationally infeasible. Therefore, we develop a computationally efficient framework that enables the exploration of the charge density symmetry of the low twist angle TBG. This framework is based on the Fourier representation of the charge density which presents high intensity Bragg peaks. Here we find that with the decrease of twist angle, low intensity satellite peaks also become apparent. Our framework incorporates these satellite peaks which reveals transformation of symmetry in the charge density distribution from high to low twist angle TBG. One striking outcome is the demonstration of the electron localization in the AA region of low twist angle TBG. Our framework helps to explain the effect of the atomistic relaxation on the charge density distribution and thus, it provides information about exotic electronic properties of low twist angle TBG at a low computational expense.

36 MATERIALS SCIENCE↗

Computationally efficient CFD prediction of bubbly flow using physics-guided deep learning

To realize efficient computational fluid dynamics (CFD) prediction of two-phase flow, a multi-scale framework was proposed in this paper by applying a physics-guided data-driven approach. Instrumental to this framework, Feature Similarity Measurement (FSM) technique was developed for error estimation in two-phase flow simulation using coarse-mesh CFD, to achieve a comparable accuracy as fine-mesh simulations with fast-running feature. In this work, by defining physics-guided parameters and variable gradients as physical features, FSM has the capability to capture the underlying local patterns in the coarse-mesh CFD simulation. Massive low-fidelity data and respective high-fidelity data are used to explore the underlying information relevant to the main simulation errors and the effects of phenomenological scaling. By learning from previous simulation data, a surrogate model using deep feedforward neural network (DFNN) can be developed and trained to estimate the simulation error of coarse-mesh CFD. In a demonstration case of two-phase bubbly flow, the DFNN model well captured and corrected the unphysical “peaks” in the velocity and void fraction profiles near the wall in the coarse-mesh configuration, even for extrapolative predictions. The research documented supports the feasibility of the physics-guided deep learning methods for coarse mesh CFD simulations which has a potential for the efficient industrial design.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Computationally Efficient Decompositions of Oblique Projection Matrices

Oblique projection matrices arise in problems in weighted least squares, signal processing, and optimization. While these matrices can be potentially very large, their low-rank structure can be exploited for efficient computation. Here, we propose fast and scalable algorithms for computing their eigendecomposition and singular value decomposition (SVD). Numerical experiments that compare our proposed approaches to existing methods, including randomized SVD, are presented. In addition, we test their accuracy on linear systems from equality constrained optimization problems.

97 MATHEMATICS AND COMPUTING↗

A computationally efficient algorithm for computing convex hull prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, in this work, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A Computationally Efficient Algorithm for Computing Convex Hull Prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may execute side payments when a participant’s cost is not covered through energy sale settlements from locational marginal pricing schemes, or when a participant incurs lost opportunity costs to follow the dispatch signal. Convex hull pricing minimizes these and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. However, computing convex hull prices involves solving either a large-scale linear program - which in turn requires explicit descriptions of market participants’ convex hulls -or the Lagrangian dual of the corresponding non-convex scheduling problem. Here, we propose a computationally feasible and industrially scalable Benders decomposition approach to computing convex hull prices at least an order of magnitude faster than the current state-of-the-art while leveraging recent advances in convex hull formulations for thermal generating units.

61 RADIATION PROTECTION AND DOSIMETRY↗

Computationally Efficient Training of Deep Neural Networks via Transfer Learning

Transfer learning is a highly successful approach to train deep neural networks for customized image recognition tasks. Transfer learning leverages deep learning models that are previously trained on massive datasets and re-trains the network for a novel image recognition dataset. Typically, the advantage of transfer learning has been measured in sample efficiency, but instead, we investigate the computational efficiency of transfer learning. A good pre-trained model provides features that can be used as input to a new classifier (usually the top layers of a neural network). We show that if a good pre-trained model is selected, that training a new classifier can be much more computationally efficient than training a deep neural network without transfer learning. The first step in transfer learning is to select a pre-trained model to use as a feed-forward network for generating features. Here this selection process either uses human intuition/convenience or a methodical but computationally intensive validation loop. Instead, we would prefer a method to select the pre-trained model that will produce the best transfer results for the least amount of computation. To this end, we provide a computationally efficient metric for the fit between a pre-trained model and a novel image recognition task. The better the fit, the less computation will be needed to re-train the pre-trained model for the novel task. As machine learning becomes ubiquitous, highly-accurate trained models will proliferate and computationally efficient transfer learning methods will enable rapid development of new image recognition models.

97 MATHEMATICS AND COMPUTING↗

Energy Efficient Computing R&D Roadmap Outline for Automated Vehicles

Automated vehicles (AV) hold great promise for improving safety, as well as reducing congestion and emissions. In order to make automated vehicles commercially viable, a reliable and highperformance vehicle-based computing platform that meets ever-increasing computational demands will be key. Given the state of existing digital computing technology, designers will face significant challenges in meeting the needs of highly automated vehicles without exceeding thermal constraints or consuming a large portion of the energy available on vehicles, thus reducing range between charges or refills. The accompanying increases in energy for AV use will place increased demand on energy production and distribution infrastructure, which also motivates increasing computational energy efficiency.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

ElasTool v3.0: Efficient computational and visualization toolkit for elastic and mechanical properties of materials

Efficient computation and visualization of elastic and mechanical properties are crucial in the selection of materials and the design of new materials. Here, the ElasTool v3.0 toolkit marks a significant advancement in the computational analysis and visualization of elastic and mechanical properties of materials, essential in material selection and design. This enhanced version extends beyond standard calculations like elastic tensor, Young's modulus, bulk modulus, and Poisson's ratio. It introduces capabilities for computing minimum thermal conductivity, linear compressibility, rendering the Christoffel equation, and elastic energy density. Notably, it integrates advanced visualization tools, including compatibility with Plotly and Elate web platforms for interactive web-based property exploration. A key feature of ElasTool v3.0 is the implementation of second-order elastic constants (SOECs) for tubular 2D-based nanostructures and nanotubes. Leveraging high-efficiency strain-matrix sets (OHESS), the toolkit now facilitates efficient computation of elastic constants and mechanical properties at both zero and finite temperatures for 1D, 2D, and 3D dimensions. ElasTool is openly accessible on GitHub: https://github.com/gmp007/elastool.

1D, 2D, 3D, and tubular 2D nanostructure and nanot↗

Integrating Energy-Efficient Computing with Computational Research to Accelerate Energy Technology

NREL's computational sciences center hosts the largest high performance computing (HPC) capabilities dedicated to energy research while functioning as a living laboratory for energy-efficient computing. NREL's HPC capabilities support the research needs of the Department of Energy's Office of Energy Efficiency and Renewable Energy (EERE). In ten years of operation, HPC use in EERE-sponsored research has grown by a factor of 30, including work in electricity generation, energy efficiency, transportation, and energy system modeling. This paper analyzes this research portfolio, providing examples of individual use cases. The paper documents NREL's history of operating one of the world's most energy-efficient data centers while examining pathways to reduce economic and environmental impact beyond reduction of Power Usage Efficiency (PUE). This paper concludes by examining the unique opportunities created for accelerating improvements in data center efficiency created by combining an HPC system dedicated to energy research and a research program in energy-efficient computing.

97 MATHEMATICS AND COMPUTING↗

Historical review and proof-of-concept future method demonstration of adaptive mesh refinement in nuclear engineering for increased fidelity and computational efficiency

As the nuclear industry's use of computational tool increases, the need for increased fidelity and computational efficiency is well known. While most approaches to increased fidelity rely on applying a fine mesh over the problem domain, a more efficient method is to apply an adaptive mesh refinement (AMR) algorithm to the mesh definition. In the field of nuclear engineering, AMR has previously been used in conjunction with deterministic methods, including: S{sub N} transport methods, Lattice Boltzmann Methods, and COMSOL. The future of AMR in nuclear engineering is to couple it to a Monte Carlo code with the goal of reducing calculation time. A proof-of-concept example yielded positive results for using the gradient of the flux as a refinement criteria. The refinement criteria was varied from 0.01 to 0.10, which yielded a recommended range of 0.01 to 0.04, and the number of refinement iterations was varied from 0 to 7, with diminishing returns seen after 5 iterations. After the success of the proof-of-concept exercise, work began on creating a full program coupling MCNP6.2 and the AMR algorithm in the deal.II library. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A dynamic 2D Borehole Thermal Energy Storage (BTES) model for enhanced computational efficiency

Progressing toward a future increasingly reliant on renewable energy sources, the development of effective, durable energy storage solutions becomes essential to balance supply and demand fluctuations. Borehole Thermal Energy Storage (BTES) is a long-duration thermal energy storage technology that captures excess heat generated from renewable energy sources and stores it underground for later use, enabling the efficient utilization of sustainable energy. This approach is particularly valuable in district energy networks when integrated with Ground Source Heat Pumps (GSHP) to provide stable heating and cooling. However, traditional three-dimensional (3D) numerical models of BTES systems demand extensive computational resources, limiting their practicality for real-time and large-scale applications. This study introduces a novel two-dimensional (2D) modeling approach that reduces computational costs while maintaining high accuracy. By employing a radial ring-based discretization method, the model simulates heat injection, retention, and retrieval dynamics over seasonal cycles. A new thermal-mass weighted-average temperature parameter is introduced to evaluate the performance of BTES systems. Model validation against FEFLOW simulations demonstrates a 17-fold improvement in computational speed compared to traditional Computational Fluid Dynamics (CFD) models while achieving a mean absolute percentage error (MAPE) of 2 % during charging and 4 % during discharging. Additionally, a trade-off analysis between computational efficiency and accuracy is conducted, ensuring the model's applicability for real-world scenarios. The findings of this research contribute to the development of computationally efficient BTES models, facilitating better optimization, control, and integration into renewable energy systems. This work provides a foundation for further studies in techno-economic analysis, multi-year performance evaluation, and real-time operational strategies for BTES applications, supporting a more sustainable energy future.

2D modeling↗

Report for the 2024 ASCR Workshop on Energy-Efficient Computing for Science

In September 2024, the US Department of Energy’s Advanced Scientific Computing Research pro gram convened a Workshop on Energy-Efficient Computing for Science to address the critical research challenges and opportunities in this field. The workshop brought together experts from academia, government, and industry to explore innovative approaches to improve energy efficiency across the computing stack over the next two decades. Participants identified five priority research directions (PRDs) that emphasize the need for a holistic approach.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗