Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational physics”

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 1,621 records · Page 90
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Summary of research in applied mathematics, numerical analysis, and computer sciences

The major categories of current ICASE research programs addressed include: numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; control and parameter identification problems, with emphasis on effective numerical methods; computational problems in engineering and physical sciences, particularly fluid dynamics, acoustics, and structural analysis; and computer systems and software, especially vector and parallel computers.

Source record↗
NASA NTRS1999

Prediction of Fatigue Crack Growth Using Regularized Numerical Models

Though it is known in the engineering community that successful analyses rest upon the proper balance of (1) theoretical analysis of mathematical models, (2) physical experimentation and (3) computational simulation, this balance is currently handled in sometimes unwieldy and inefficient manner. It is proposed to investigate and develop rigorous and computationally efficient method to effectively combine all available information, from both experimental measurements and mathematical models, in the emulation of physical systems. This will be specifically applied to fatigue crack growth in metallic structures of interest to NASA.

Meade, Andrew J.↗
DOE OSTI2023

Roadmap on electronic structure codes in the exascale era

Electronic structure calculations have been instrumental in providing many important insights into a range of physical and chemical properties of various molecular and solid-state systems. Their importance to various fields, including materials science, chemical sciences, computational chemistry and device physics, is underscored by the large fraction of available public supercomputing resources devoted to these calculations. As we enter the exascale era, exciting new opportunities to increase simulation numbers, sizes, and accuracies present themselves. In order to realize these promises, the community of electronic structure software developers will however first have to tackle a number of challenges pertaining to the efficient use of new architectures that will rely heavily on massive parallelism and hardware accelerators. This roadmap provides a broad overview of the state-of-the-art in electronic structure calculations and of the various new directions being pursued by the community. It covers 14 electronic structure codes, presenting their current status, their development priorities over the next five years, and their plans towards tackling the challenges and leveraging the opportunities presented by the advent of exascale computing.

36 MATERIALS SCIENCE↗
DOE OSTI2014

High Energy Electromagnetic Particle Transportation on the GPU

We present massively parallel high energy electromagnetic particle transportation through a finely segmented detector on a Graphics Processing Unit (GPU). Simulating events of energetic particle decay in a general-purpose high energy physics (HEP) detector requires intensive computing resources, due to the complexity of the geometry as well as physics processes applied to particles copiously produced by primary collisions and secondary interactions. The recent advent of hardware architectures of many-core or accelerated processors provides the variety of concurrent programming models applicable not only for the high performance parallel computing, but also for the conventional computing intensive application such as the HEP detector simulation. The components of our prototype are a transportation process under a non-uniform magnetic field, geometry navigation with a set of solid shapes and materials, electromagnetic physics processes for electrons and photons, and an interface to a framework that dispatches bundles of tracks in a highly vectorized manner optimizing for spatial locality and throughput. Core algorithms and methods are excerpted from the Geant4 toolkit, and are modified and optimized for the GPU application. Program kernels written in C/C++ are designed to be compatible with CUDA and OpenCL and with the aim to be generic enough for easy porting to future programming models and hardware architectures. To improve throughput by overlapping data transfers with kernel execution, multiple CUDA streams are used. Issues with floating point accuracy, random numbers generation, data structure, kernel divergences and register spills are also considered. Performance evaluation for the relative speedup compared to the corresponding sequential execution on CPU is presented as well.

Canal, P.↗
DOE OSTI2016

WE-H-BRA-04: Biological Geometries for the Monte Carlo Simulation Toolkit TOPASNBio

Purpose: New advances in radiation therapy are most likely to come from the complex interface of physics, chemistry and biology. Computational simulations offer a powerful tool for quantitatively investigating radiation interactions with biological tissue and can thus help bridge the gap between physics and biology. The aim of TOPAS-nBio is to provide a comprehensive tool to generate advanced radiobiology simulations. Methods: TOPAS wraps and extends the Geant4 Monte Carlo (MC) simulation toolkit. TOPAS-nBio is an extension to TOPAS which utilizes the physics processes in Geant4-DNA to model biological damage from very low energy secondary electrons. Specialized cell, organelle and molecular geometries were designed for the toolkit. Results: TOPAS-nBio gives the user the capability of simulating biological geometries, ranging from the micron-scale (e.g. cells and organelles) to complex nano-scale geometries (e.g. DNA and proteins). The user interacts with TOPAS-nBio through easy-to-use input parameter files. For example, in a simple cell simulation the user can specify the cell type and size as well as the type, number and size of included organelles. For more detailed nuclear simulations, the user can specify chromosome territories containing chromatin fiber loops, the later comprised of nucleosomes on a double helix. The chromatin fibers can be arranged in simple rigid geometries or within factual globules, mimicking realistic chromosome territories. TOPAS-nBio also provides users with the capability of reading protein data bank 3D structural files to simulate radiation damage to proteins or nucleic acids e.g. histones or RNA. TOPAS-nBio has been validated by comparing results to other track structure simulation software and published experimental measurements. Conclusion: TOPAS-nBio provides users with a comprehensive MC simulation tool for radiobiological simulations, giving users without advanced programming skills the ability to design and run complex simulations.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Techniques for improved statistical convergence in quantification of eddy diffusivity moments

While recent approaches, such as the macroscopic forcing method (MFM) or Green's function-based approaches, can be used to compute Reynolds-averaged Navier-Stokes closure operators using forced direct numerical simulations, MFM can also be used to directly compute moments of the effective nonlocal and anisotropic eddy diffusivities. The low-order spatial and temporal moments contain limited information about the eddy diffusivity but are often sufficient for quantification and modeling of nonlocal and anisotropic effects. However, when using MFM to compute eddy diffusivity moments, the statistical convergence can be slow for higher-order moments. In this work, we demonstrate that using the same direct numerical simulation (DNS) for all forced MFM simulations improves statistical convergence of the eddy diffusivity moments. We present its implementation in conjunction with a decomposition method that handles the MFM forcing semianalytically and allows for consistent boundary condition treatment, which we develop for both scalar and momentum transport. We demonstrate that for a two-dimensional Rayleigh-Taylor instability case study, using the same DNS for all forced MFM simulations results in convergence with 𝒪⁡(100) simulations rather than 𝒪⁡(1000) simulations. In conclusion, we then demonstrate the impacts of improved convergence on the quantification of the eddy diffusivity.

general physics↗
DOE OSTI2017

Revealing Fundamental Physics from the Daya Bay Neutrino Experiment Using Deep Neural Networks

Experiments in particle physics produce enormous quantities of data that must be analyzed and interpreted by teams of physicists. This analysis is often exploratory, where scientists are unable to enumerate the possible types of signal prior to performing the experiment. Thus, tools for summarizing, clustering, visualizing and classifying high-dimensional data are essential. Here in this work, we show that meaningful physical content can be revealed by transforming the raw data into a learned high-level representation using deep neural networks, with measurements taken at the Daya Bay Neutrino Experiment as a case study. We further show how convolutional deep neural networks can provide an effective classification filter with greater than 97% accuracy across different classes of physics events, significantly better than other machine learning approaches.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Application of Quantum Computing to Biochemical Systems: A Look to the Future

Chemistry is considered as one of the more promising applications to science of near-term quantum computing. Recent work in transitioning classical algorithms to a quantum computer has led to great strides in improving quantum algorithms and illustrating their quantum advantage. Because of the limitations of near-term quantum computers, the most effective strategies split the work over classical and quantum computers. There is a proven set of methods in computational chemistry and materials physics that has used this same idea of splitting a complex physical system into parts that are treated at different levels of theory to obtain solutions for the complete physical system for which a brute force solution with a single method is not feasible. These methods are variously known as embedding, multi-scale, and fragment techniques and methods. We review these methods and then propose the embedding approach as a method for describing complex biochemical systems, with the parts not only treated with different levels of theory, but computed with hybrid classical and quantum algorithms. Such strategies are critical if one wants to expand the focus to biochemical molecules that contain active regions that cannot be properly explained with traditional algorithms on classical computers. While we do not solve this problem here, we provide an overview of where the field is going to enable such problems to be tackled in the future.

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

PPPL Laboratory Directed Research and Development (Project Final Reports, FY2018 - FY2020)

The U.S. Department of Energy’s (DOE) Princeton Plasma Physics Laboratory (PPPL) is a collaborative national center for fusion energy science, basic sciences, and advanced technology. The Laboratory has three major missions: (1) to develop the scientific knowledge and advanced engineering to enable fusion to power the U.S. and the world; (2) to advance the science of nanoscale fabrication for technologies of tomorrow; and (3) to further the development of the scientific understanding of the plasma universe from laboratory to astrophysical scales. PPPL’s Laboratory Directed Research and Development (LDRD) program supports and encourages creativity and innovation and contributes to its long-term viability. New scientific and technical research areas emerge and are nurtured through the program. Furthermore, new capabilities are developed to enable the Laboratory to meet its and DOE’s missions. The program is used to systematically diversify the Laboratory’s programs and mission. In the last few years, the program has started projects in nanomaterial synthesis, microelectronics, advanced x-ray spectroscopy, high-energy-density physics, superconducting magnet technology, machine learning and artificial intelligence, 3D magnetic fields to optimize fusion plasmas, integration of permanent magnets with simple high-field magnets to reduce the cost of producing complex 3D magnetic fields, advanced computational methods for predictive understanding and control of fusion plasma, development of quantum computing algorithms for plasma physics, liquid metal plasma-facing components for fusion reactors, virtual engineering, and plasma-based space propulsion. The program is also the vehicle to recruit and train talented scientists and engineers with the new skills needed to perform the Laboratory’s mission. Many of the new hires through the program go on to become world-class scientists and engineers in their fields. This report provides descriptions and accomplishments of those LDRD projects that were completed during fiscal years 2018 through 2020.

36 MATERIALS SCIENCE↗
DOE OSTI2016

Global optimization algorithms to compute thermodynamic equilibria in large complex systems with performance considerations

Several global optimization methods are reviewed that attempt to ensure that the integral Gibbs energy of a closed isothermal isobaric system is a global minimum to satisfy the necessary and sufficient conditions for thermodynamic equilibrium. In particular, the integral Gibbs energy function of a multicomponent system containing non-ideal phases may be highly non-linear and non-convex, which makes finding a global minimum a challenge. Consequently, a poor numerical approach may lead one to the false belief of equilibrium. Furthermore, confirming that one reaches a global minimum and that this is achieved with satisfactory computational performance becomes increasingly more challenging in systems containing many chemical elements and a correspondingly large number of species and phases. Several numerical methods that have been used for this specific purpose are reviewed with a benchmark study of three of the more promising methods using five case studies of varying complexity. A modification of the conventional Branch and Bound method is presented that is well suited to a wide array of thermodynamic applications, including complex phases with many constituents and sublattices, and ionic phases that must adhere to charge neutrality constraints. Also, a novel method is presented that efficiently solves the system of linear equations that exploits the unique structure of the Hessian matrix, which reduces the calculation from a O(N 3 ) operation to a O(N) operation. As a result, this combined approach demonstrates efficiency, reliability and capabilities that are favorable for integration of thermodynamic computations into multi-physics codes with inherent performance considerations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Data distribution service-based interoperability framework for smart grid testbed infrastructure

This study presents the design and implementation of a communication and control infrastructure for smart grid operation. The proposed infrastructure enhances the reliability of the measurements and control network. The advantages of utilizing the data-centric over message-centric communication approach are discussed in the context of smart grid applications. The data distribution service (DDS) is used to implement a data-centric common data bus for the smart grid. This common data bus improves the communication reliability, enabling distributed control and smart load management. These enhancements are achieved by avoiding a single point of failure while enabling peer-to-peer communication and an automatic discovery feature for dynamic participating nodes. The infrastructure and ideas presented in this paper were implemented and tested on the smart grid testbed. A toolbox and application programing interface for the testbed infrastructure are developed in order to facilitate interoperability and remote access to the testbed. This interface allows control, monitoring, and performing of experiments remotely. Furthermore, it could be used to integrate multidisciplinary testbeds to study complex cyber-physical systems (CPS).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

FPGAs as a Service to Accelerate Machine Learning Inference [PowerPoint]

Large-scale particle physics experiments face challenging demands for high-throughput computing resources both now and in the future. New heterogeneous computing paradigms on dedicated hardware with increased parallelization, such as Field Programmable Gate Arrays (FPGAs), offer exciting solutions with large potential gains. The growing applications of machine learning algorithms in particle physics for simulation, reconstruction, and analysis are naturally deployed on such platforms. We demonstrate that the acceleration of machine learning inference as a web service represents a heterogeneous computing solution for particle physics experiments that requires minimal modification to the current computing model. As examples, we retrain the ResNet-50 convolutional neural network to demonstrate state-of-the-art performance for top quark jet tagging at the LHC, and apply a ResNet-50 model with transfer learning for neutrino event classification. Using Project Brainwave b y Microsoft to accelerate the ResNet-50 image classification model, we achieve average inference times of 60 (10) milliseconds with our experimental physics software framework using Brainwave as a cloud (edge or on-premises) service, representing an improvement by a factor of approximately 30 (175) in model inference latency over traditional CPU inference in current experimental hardware. A single FPGA service accessed by many CPUs achieves a throughput of 600--700 inferences per second using an image batch of one, comparable to large batch-size GPU throughput and significantly better than small batch-size GPU throughput. Deployed as an edge or cloud service for the particle physics computing model, coprocessor accelerators can have a higher duty cycle and are potentially much more cost-effective.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Benchmarking the performance of uncertainty quantification methods for neural network-based interatomic potentials

Machine-learned interatomic potentials (ML-IAPs) continue to gain popularity as accurate, computationally efficient replacements for traditional, physics-based interatomic potentials and expensive ab initio methods. Uncertainty quantification (UQ) of ML-IAPs is a growing area of research as UQ is critical in many applications of IAPs, such as developing curated datasets, active learning-based data augmentation, self-improving models, and estimating the uncertainty of molecular dynamics simulations. In this paper, we construct and benchmark a series of different neural network potentials (NNPs) with varying network architectures to determine the performance of these models with respect to both the mean and uncertainty calibration error. Each NNP method is specifically designed to predict either epistemic or aleatoric uncertainty with particular focus on the differences in behavior between the epistemic and aleatoric uncertainty estimates. We benchmark these methods using multiple datasets common in the ML-IAP literature. The results show that the aleatoric uncertainty from single-shot model architectures is a competitive alternative to ensemble-based epistemic uncertainty predictions in regions of sufficient data-density. However, in regions where the representative data is sparse, aleatoric uncertainty models tend to overpredict and epistemic methods tend to underpredict the actual model error. We conclude that the type of UQ is crucial when discussing performance of probabilistic model results as different methods have different performance characteristics depending on the regime in which they are evaluated. Therefore, the type of UQ method should be carefully evaluated against both the data characteristics and requirements for the intended application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Embedding hard physical constraints in neural network coarse-graining of three-dimensional turbulence

In recent years, deep learning approaches have shown much promise in modeling complex systems in the physical sciences. A major challenge in deep learning of partial differential equations is enforcing physical constraints and boundary conditions. In this work, we propose a general framework to directly embed the notion of an incompressible fluid into convolutional neural networks, and apply this to coarse-graining of turbulent flow. These physics-embedded neural networks leverage interpretable strategies from numerical methods and computational fluid dynamics to enforce physical laws and boundary conditions by taking advantage the mathematical properties of the underlying equations. Here, we demonstrate results on three-dimensional fully developed turbulence, showing that this technique drastically improves local conservation of mass, without sacrificing performance according to several other metrics characterizing the fluid flow.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Complexity and near extremal charged black branes

Highlights: • Trying to explore a remedy to overcome the puzzle in holographic complexity by assuming a cutoff behind the horizon and the corresponding boundary term. • Holographic complexity growth obtained by the WDW patch on shell action is insensitive to the UV cutoff at the late time. Therefore one may conclude that either on shell action does not compute complexity, or the late time is not given by the physical charges, or in our computations we have missed something! • We find that one needs to carefully compute on shell action taking into account the behind the horizon and the corresponding boundary term. Doing so, one arrives at a consistent picture. • We check this consistency by evaluating the late time complexity growth for near horizon limit of the near extremal black hole using two different methods. We would have obtained non-consistent picture, if we had not considered the behind the horizon cutoff as well as the corresponding boundary term. We compute holographic complexity of charged black brane solutions in arbitrary dimensions for the near horizon limit of near extremal case using two different methods. The corresponding complexity may be obtained either by taking the limit from the complexity of the charged black brane, or by computing the complexity for near horizon limit of near extremal solution. One observes that these results coincide if one assumes to have a cutoff behind horizon whose value is fixed by UV cutoff and also taking into account a proper counterterm evaluated on this cutoff. We also consider the situation for Vaidya charged black branes too.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Proton Isovector Helicity Distribution on the Lattice at Physical Pion Mass

We present a state-of-the-art calculation of the isovector quark helicity Bjorken-x distribution in the proton using lattice-QCD ensembles at the physical pion mass. We compute quasi-distributions at proton momenta P z ϵ {2.2; 2.6; 3.0} GeV on the lattice, and match them systematically to the physical parton distribution using large-momentum effective theory (LaMET).We reach an unprecedented precision through high statistics in simulations, large-momentum proton matrix elements, and control of excited-state contamination. The resulting distribution with combined statistical and systematic errors is in agreement with the latest phenomenological analysis of the spin-dependent experimental data; in particular, Δ$\bar{u}$(x) > Δ$\bar{d}$(x).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗