Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational challenges”

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 757 records · Page 42

High Resolution Stereoscopic PIV Measurements in a 5 x 5 Rod Bundle with Mixing Vane

Spacer grids are used in the pressurized water reactor (PWR) to fix, clamp the fuel rods, and enhance the turbulence mixing within the spaces of the rods and overall heat transfer performance. Proper understanding on the thermal-hydraulic characteristics of the turbulent mixing and heat transfer created by the space grids is important. However, spacer grids having complex design structure with dimple, mixing vane and spring have been challenges for computational fluid dynamics (CFD) turbulent models. High fidelity experimental data with spatial-temporal resolutions is essential to validate and assess the performances of CFD models. Baglietto and Ninokata applied an improved realizable anisotropic turbulence models via direct numerical simulation (DNS)-based near-wall formulation data to study the wall shear stresses and flow structures in tight bundle subchannels. These authors have shown that their models are able to capture the stress distribution and velocity field at an acceptable accuracy. The authors numerically studied the flow field characteristics at the region downstream of the spacer grids, and validated their results to particle imagery velocimetry (PIV) measurements. Dominguez and Hassan performed two-dimensional time resolved PIV (TR-PIV) measurements within a 5 x 5 PWR rod bundle with spacer-grids that utilized a matching index of refraction (MIR) approach. Their averaged data showed a rather uniform direction velocity profile after the spacer grid while the downstream illustrated a no slip wall profile. In this paper, we presents flow measurements in the MIR 5 x 5 fuel rod bundle with a spacer grid. Time resolved stereoscopic PIV (TR-SPIV) measurements were performed to obtain high spatial-temporal resolution two-dimensional three-component (2D3C) velocity vector fields in the subchannels between the rods. Flow statistics such as mean velocity, and Reynolds stresses were computed. The obtained experimental data can be used to improve the computational modeling and validate the numerical models that are currently applied to light and pressurized water reactors.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Data-Driven Unit Commitment Refinement - a Scalable Approach for Complex Modern Power Grids

Integration of renewable generation, which is often intermittent and decentralized, substantially increases the stochasticity and complexity of power grid operations. Future power systems planning will require significant computational capability to evaluate balance between demand and supply under varying conditions, both temporally and spatially. The standard approach for generation unit commitment is to use mixed-integer linear programming to find the optimal generation schedule considering ramping and generator constraints. In the future grid this poses computational scalability challenges because generation and demand are not known with certainty due to stochasticity in weather and complexity of the grid. To address this challenge, we present a data-driven unit commitment approach that can efficiently include stochastic weather impacts and contingency considerations to improve unit commitment. Our approach uses graph-based data analytics techniques on solutions to the security constrained (and possibly stochastic) economic dispatch problem to identify potential improvements to a given unit commitment. Recent breakthroughs in fully-parallel stochastic economic dispatch software allow this approach to be scalably deployed. Simulations on synthetic South Carolina and Texas grids show this method can improve grid reliability with security constraints over a set of contingencies, while also meaningfully lowering total generation cost.

Holt, Timothy↗

Elimination LArTPC Simulation Uncertainty With Modifcations to TPC Wire Waveforms

This paper introduces a novel approach to reducing systematic uncertainties in LArTPC detector simulations, which arise from known detector effects that are challenging and computationally intensive to model. The proposed method involves modifying simulated waveforms based on observed discrepancies in ionization signals from the TPC between actual data and simulations. This approach reduces the sensitivity to detailed detector modeling and decreases the computational resources required for accurate simulations.

Mktchyan, Karen↗

Studying light–matter interactions and energy transfer at the nanoscale with a trapped–ion quantum computer

A grand challenge in materials sciences is to control energy transduction, transfer and dissipation at the nanoscale. Meeting this challenge requires progress in nanoscale fabrication and synthesis, but equally importantly, also progress in our understanding of how nanoscale structure influences these phenomena. Although detailed quantum mechanical models exist that capture the structure and physics of materials and molecular species, solving these models to calculate the relevant emergent phenomena, which often occur over vastly different time and energy scales, has so far proven difficult. In this project, we studied how to model energy transfer and light-matter interactions using trapped-ion quantum computers. Our studies focused on emulation of critical processes in natural systems, such as the well-known photosynthetic pigment-protein complexes responsible for capturing and transducing light to electrons. In addition, we implemented proof-of-principle experiments demonstrating that such calculations are possible on trapped-ion quantum computing hardware. These studies and experiments pave the way to investigate energy transport and transduction in a detail not accessible with classical computing technologies. We expect that our studies will allow to extract important guiding principles on how to improve the efficiency of nano-scale light-harvesting and transduction devices.

36 MATERIALS SCIENCE↗

The NASA Computational Fluid Dynamics (CFD) program - Building technology to solve future challenges

This paper presents the NASA Computational Fluid Dynamics program in terms of a strategic vision and goals as well as NASA's financial commitment and personnel levels. The paper also identifies the CFD program customers and the support to those customers. In addition, the paper discusses technical emphasis and direction of the program and some recent achievements. NASA's Ames, Langley, and Lewis Research Centers are the research hubs of the CFD program while the NASA Headquarters Office of Aeronautics represents and advocates the program.

Richardson, Pamela F.↗

Computational Complexity of Neuromorphic Algorithms

Neuromorphic computing has several characteristics that make it an extremely compelling computing paradigm for post Moore computation. Some of these characteristics include intrinsic parallelism, inherent scalability, collocated processing and memory, and event-driven computation. While these characteristics impart energy efficiency to neuromorphic systems, they do come with their own set of challenges. One of the biggest challenges in neuromorphic computing is to establish the theoretical underpinnings of the computational complexity of neuromorphic algorithms. In this paper, we take the first steps towards defining the space and time complexity of neuromorphic algorithms. Specifically, we describe a model of neuromorphic computation and state the assumptions that govern the computational complexity of neuromorphic algorithms. Next, we present a theoretical framework to define the computational complexity of a neuromorphic algorithm. We explicitly define what space and time complexities mean in the context of neuromorphic algorithms based on our model of neuromorphic computation. Finally, we leverage our approach and define the computational complexities of six neuromorphic algorithms: constant function, successor function, predecessor function, projection function, neuromorphic sorting algorithm and neighborhood subgraph extraction algorithm.

Date, Prasanna↗

Final Report from The University of Texas at Austin for DEGAS: Dynamic Global Address Space programming environments

The Dynamic, Exascale Global Address Space programming environment (DEGAS) project will develop the next generation of programming models and runtime systems to meet the challenges of Exascale computing. Our approach is to provide an efficient and scalable programming model that can be adapted to application needs through the use of dynamic runtime features and domain-specific languages for computational kernels. We address the following technical challenges: Programmability: Rich set of programming constructs based on a Hierarchical Partitioned Global Address Space (HPGAS) model, demonstrated in UPC++. Scalability: Hierarchical locality control, lightweight communication (extended GASNet), and ef- ficient synchronization mechanisms (Phasers). Performance Portability: Just-in-time specialization (SEJITS) for generating hardware-specific code and scheduling libraries for domain-specific adaptive runtimes (Habanero). Energy Efficiency: Communication-optimal code generation to optimize energy efficiency by re- ducing data movement. Resilience: Containment Domains for flexible, domain-specific resilience, using state capture mechanisms and lightweight, asynchronous recovery mechanisms. Interoperability: Runtime and language interoperability with MPI and OpenMP to encourage broad adoption.

97 MATHEMATICS AND COMPUTING↗

Efficient Computation Of Behavior Of Aircraft Tires

NASA technical paper discusses challenging application of computational structural mechanics to numerical simulation of responses of aircraft tires during taxing, takeoff, and landing. Presents details of three main elements of computational strategy: use of special three-field, mixed-finite-element models; use of operator splitting; and application of technique reducing substantially number of degrees of freedom. Proposed computational strategy applied to two quasi-symmetric problems: linear analysis of anisotropic tires through use of two-dimensional-shell finite elements and nonlinear analysis of orthotropic tires subjected to unsymmetric loading. Three basic types of symmetry and combinations exhibited by response of tire identified.

Tanner, John A.↗

Gradient-Enhanced Reliability Analysis of Transonic Aeroelastic Flutter

Reliability computation for transonic aeroelastic systems is a challenging task, given the complex physical mechanisms involved, and broader challenges associated with computing small probabilities of failure/flutter. This paper demonstrates the use of four different reliability estimation tools, with a particular focus on tools that can utilize gradient information: the derivative of flutter boundaries with respect to random parametric inputs. Results are shown for two test cases: the AGARD 445.6 case and the Common Research Model, and the strength and weaknesses of each UQ tool are compared in terms of cost and accuracy. Two of the UQ tools used here require gradients as part of a search process, but the other two are sample-based, and are able to leverage the existence of gradients for improved performance.

Bret K Stanford↗

The Future of Electronic Device Design: Device and Process Simulation Find Intelligence on the World Wide Web

We are on the path to meet the major challenges ahead for TCAD (technology computer aided design). The emerging computational grid will ultimately solve the challenge of limited computational power. The Modular TCAD Framework will solve the TCAD software challenge once TCAD software developers realize that there is no other way to meet industry's needs. The modular TCAD framework (MTF) also provides the ideal platform for solving the TCAD model challenge by rapid implementation of models in a partial differential solver.

Biegel, Bryan A.↗

Big Data: Next-Generation Machines for Big Science

Addressing the scientific grand challenges identified by the US Department of Energy’s (DOE’s) Office of Science’s programs alone demands a total leadership-class computing capability of 150 to 400 Pflops by the end of this decade. The successors to three of the DOE’s most powerful leadership-class machines are set to arrive in 2017 and 2018—the products of the Collaboration Oak Ridge Argonne Livermore (CORAL) initiative, a national laboratory–industry design/build approach to engineering nextgeneration petascale computers for grand challenge science. These mission-critical machines will enable discoveries in key scientific fields such as energy, biotechnology, nanotechnology, materials science, and high-performance computing, and serve as a milestone on the path to deploying exascale computing capabilities.

High-performance computing↗

Multiphysics coupling in the Exascale computing project

Multiphysics coupling presents a significant challenge in terms of both computational accuracy and performance. Achieving high performance on coupled simulations can be particularly challenging in a high-performance computing context. The US Department of Energy Exascale Computing Project has the mission to prepare mission-relevant applications for the delivery of the exascale computers starting in 2023. Many of these applications require multiphysics coupling, and the implementations must be performant on exascale hardware. In this special issue we feature six articles performing advanced multiphysics coupling that span the computational science domains in the Exascale Computing Project.

97 MATHEMATICS AND COMPUTING↗

PV Hosting Capacity Estimation: Experiences with Scalable Framework; Preprint

Hosting capacity is an indication of the amount of photovoltaics (PV) can be hosted in a distribution system. This paper presents a framework for estimating distributed PV hosting capacity at scale. We first analyze the key challenges of performing relevant large scale simulation including computational and modeling challenges. Then, we develop two python-based software tools in order to conduct repeatable distribution analyses: Distribution Integration Solution Cost Options (DISCO) for configuring and analyzing simulations, and JADE for parallelizing jobs on HPC clusters. A case study of hosting capacity estimation for SMART-DS SFO 2000+ synthetic feeders is used to demonstrate the capability of the developed framework and tools. The framework and tools can help utilities assess the overall hosting capacity of their service territory, through which the overall upgrade cost can be better planned in order to integrate more PV in the future.

distributed energy resources↗

COVID-19 Knowledge Graph -- Dataset for SMCDC 2021 Challenge 2

This repository contains the data for the 2021 Smoky Mountains Computational Sciences Data Challenge (SMCDC21) Challenge 2 -- Finding Novel Links in COVID-19 Knowledge Graph. The total size of all files in this repository is 285MB. Challenge website: https://smc-datachallenge.ornl.gov/2021-challenge-2/ More information about the challenge and the data: https://github.com/ORNL/smcdc-2021-covid-kg

60 APPLIED LIFE SCIENCES↗

Track reconstruction as a service for collider physics

Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa.TrkX, a machine learning-based algorithm. The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Development of multi-scale computational frameworks to solve fusion materials science challenges

Over the past two decades, the US-DOE has funded multiple projects that rely on high-performance computing and exascale computing platforms to accelerate scientific discoveries and address grand scientific challenges, such as harnessing fusion energy. In this article, we review in detail one of these efforts aimed at enhancing our capability to model plasma-facing materials subject to plasma and high-energy ion/neutron irradiation. The plasma surface interactions project has built a multi-scale modeling framework where many of the plasma- and high-energy ion/neutron irradiation-induced effects occurring in tungsten are explored. Here, this knowledge is used to develop atomistically-informed, high-fidelity continuum and meso-scale models that can be validated against experiments. We review the developments within this project, with attention to experimental validation efforts, and specifically highlight activities associated with: helium bubble bursting and equation of state, and hydrogen-helium interactions in tungsten; atomistically-informed model development for beryllium-tungsten material mixing; coupling of scrape-of-layer plasma, sheath and material models; and coupling of stochastic cluster-dynamics and crystal plasticity models to address radiation effects in tungsten under stress. Finally, we present how the project is preparing for future computational architectures, for instance through efforts to adapt atomistic methods to exascale computing.

36 MATERIALS SCIENCE↗

Solving reaction dynamics with quantum computing algorithms

The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. However, the time evolution of quantum states is a natural application for quantum computers that are designed to efficiently perform unitary transformations. Here, in this paper, we study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations. For the case of a contact interaction, we develop an algorithm for time evolution based on the Trotter approximation that scales logarithmically with the lattice size and is combined with quantum phase estimation. We eventually focus on the nuclear two-body system and a typical response function relevant for electron scattering as an example. We also investigate ground-state preparation and examine the total circuit depth required for a realistic calculation and the hardware noise level required to interpret the signal.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗