Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Coded computing”

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,117 records · Page 62
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

High- and Mid-Fidelity Modeling Comparison for a Floating Marine Turbine System

There is a lack of suitable numerical tools, particularly open-source tools, that can be used for designing and optimizing marine turbine systems. The National Renewable Energy Laboratory has added features to their widely used mid-fidelity wind turbine modeling code, OpenFAST, to enable modeling of axial-flow marine turbines. This necessitated the addition of several physical effects relevant to marine turbines that are neglected for wind turbines. These include buoyancy, added mass and inertial loads, wave-current superposition, and changes to the coordinate systems. This updated version of OpenFAST allows for the modeling of both fixed and floating marine turbines at a speed comparable to real time. While efficient for large sets of load cases and design studies, mid-fidelity codes make simplifying assumptions that may impact their accuracy. High-fidelity computational fluid dynamics (CFD) simulations can capture more flow effects with fewer assumptions and provide detailed body pressure mapping and flow-field information. It is important to compare predictions between mid-fidelity and high-fidelity codes, both to verify the models and to understand the limitations. A floating marine turbine system was modeled both with OpenFAST and with the commercial CFD code STAR-CCM+. The CFD model used a three-dimensional unsteady Reynolds-averaged Navier-Stokes solver for a volume-of-fluid numerical wave and current tank. The blade-resolved simulations used the sliding-interface technique for the spinning rotor and an overset grid to accommodate the rigid-body motion of the floating system. The mooring system was modeled with a custom coupling of the CFD solver with the open-source code MoorDyn. This improves upon the existing quasi-static catenary solver in STAR-CCM+, which lacks seabed contact or line-to-line connections. Simulation results for a floating marine turbine are compared between OpenFAST and CFD, highlighting the capabilities of the mid-fidelity code and identifying the areas where a high-fidelity approach is needed.

CFD↗
DOE OSTI2022

ANTARES: a new IRSN computational chain for safety analysis

Since some years, the IRSN has developed a new project to simulate accurately the interaction between neutronic and thermal hydraulic phenomena. This project called ANTARES (Advanced Neutronics and Thermal-hydraulic for the Analysis of Reactor Safety) couples the thermal hydraulic code CATHARE-3 with the 3D neutronic nodal code PARCS. The purpose of this project is to take the advantage of the complementary of these 2 codes, by the knowledge of the 3D core power distribution in CATHARE-3 (computed by PARCS) and improving the thermal hydraulic boundaries conditions in PARCS. In this way, the IRSN diversifies and enlarges its available tools to perform safety analysis with improved accuracy. The current technique usually adopted in France for the safety demonstrations for Reactivity Insertion Accident (RIA) is the so-called 'conservative' approach, which consists of reducing all the feedback (Doppler and moderator effects) and in modifying some physical quantities in such a way to increase a power peak. For this reason, these facilities ('penalties') have been implemented in ANTARES. In this paper we will give two examples of accidental transients that can be simulated with ANTARES: a Main Steam Line Break (MSLB) and an inadvertent boron dilution event. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Constrained Bayesian optimization of criticality experiments

The design of criticality experiments is typically an iterative process that employs a Monte Carlo transport code. The goal is to find a design that optimizes some variable, like the sensitivity of a response to a cross section, while simultaneously ensuring criticality. The high fidelity of the Monte Carlo code is a great asset, but it makes exploring the design space computationally expensive. Herein, we present how a constrained Bayesian optimization algorithm can be used to efficiently design a criticality experiment. It uses Gaussian processes as a surrogate model to probe the design space and to reduce the number of code executions that are needed to find the optimum. Furthermore, we demonstrate constrained Bayesian optimization with a Pu-239/polyethylene solution system and a TEX experiment that is designed for criticality safety validation of a nuclear waste model at the Hanford Site. For both systems, a global optimum was found within 75 Monte Carlo simulations.

42 ENGINEERING↗
DOE OSTI2020

Constrained Bayesian Optimization of Criticality Experiments [Slides]

The design of criticality experiments is typically an iterative process that employs a Monte Carlo transport code. The goal is to find a design that optimizes some variable, like the sensitivity of a response to a cross section, while simultaneously ensuring criticality. The high fidelity of the Monte Carlo code is a great asset, but it makes exploring the design space computationally expensive. Herein, we present how a constrained Bayesian optimization algorithm can be used to efficiently design a criticality experiment. It uses Gaussian processes as a surrogate model to probe the design space and to reduce the number of code executions that are needed to find the optimum. We demonstrate constrained Bayesian optimization with a Pu-239/polyethylene solution system and a TEX experiment that is designed for criticality safety validation of a nuclear waste model at the Hanford Site. For both systems, a global optimum was found within 75 Monte Carlo simulations.

42 ENGINEERING↗
DOE OSTI2020

Constrained Bayesian Optimization of Criticality Experiments at LLNL [Slides]

The design of criticality experiments is typically an iterative process that employs a Monte Carlo transport code. The goal is to find a design that optimizes some variable, like the sensitivity of a response to a cross section, while simultaneously ensuring criticality. The high fidelity of the Monte Carlo code is a great asset, but it makes exploring the design space computationally expensive. Herein, we present how a constrained Bayesian optimization algorithm can be used to efficiently design a criticality experiment. It uses Gaussian processes as a surrogate model to probe the design space and to reduce the number of code executions that are needed to find the optimum. We demonstrate constrained Bayesian optimization with a Pu-239/polyethylene solution system and a TEX experiment that is designed for critical ity safety validation of a nuclear waste model at the Hanford Site. For both systems, a global optimum was found within 75 Monte Carlo simulations.

42 ENGINEERING↗
DOE OSTI2023

pnnl/projection_ntk

This is a repository for work conducted in our research paper we would like to make open source. The main features are that we forked another open source library and added functionality that enabled us to compute neural-kernel objects using random vector projection software for both computer vision and large language text models. The new features are specifically code that enables the calculation of objects we define and refer to as the projection pseudo neural tangent kernel and the projection trace neural tangent kernel; both of which are approximations of the empirical neural tangent kernel. The software that computes the projections themselves are not part of the invention, but are necessarily tied to our software and licensed via MIT license, and BSD 2 license.

Georgiev, Kristian↗
DOE OSTI2020

Dynamic load balancing with enhanced shared-memory parallelism for particle-in-cell codes

Furthering our understanding of many of today’s interesting problems in plasma physics – including plasma based acceleration and magnetic reconnection with pair production due to quantum electrodynamic effects – requires large-scale kinetic simulations using particle-in-cell (PIC) codes. However, these simulations are extremely demanding, requiring that contemporary PIC codes be designed to efficiently use a new fleet of exascale computing architectures. To this end, the key issue of parallel load balance across computational nodes must be addressed. We discuss the implementation of dynamic load balancing by dividing the simulation space into many small, self-contained regions or ‘‘tiles,’’ along with shared-memory (e.g., OpenMP) parallelism both over many tiles and within single tiles. The load balancing algorithm can be used with three different topologies, including two space-filling curves. Here, we tested this implementation in the code Osiris and show low overhead and improved scalability with OpenMP thread number on simulations with both uniform load and severe load imbalance. Compared to other load-balancing techniques, our algorithm gives order-of-magnitude improvement in parallel scalability for simulations with severe load imbalance issues.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Characterization of the Finite Element Computational Fluid Dynamics Capabilities in the Multiphysics Object Oriented Simulation Environment

We report the multiphysics object-oriented simulation environment (moose) is a code package that couples a variety of physics modules, allowing for highly accessible multiphysics simulations. The physics modules include a finite element Navier–Stokes (N–S) module that is designed to solve laminar fluid dynamics problems. The usage of this module in multiple recent studies coupled with the growing interest in moose for usage in nonlight water reactor safety studies by the Nuclear Regulatory Commission (NRC) prompted the authors to investigate the computational fluid dynamics capabilities of moose. A two-dimensional laminar flow past a circular cylinder scenario is simulated in the moose framework to investigate the effectiveness of the N–S module. Simulations assumed an unsteady laminar flow with a Reynolds number of 200. To verify the results from moose, similar simulations were conducted using the well-utilized simulation of turbulent flow in arbitrary regions—computational continuum mechanics C++ (star-ccm + ) finite volume code. Results from both codes are also compared to some results from literature. Velocity and pressure profiles of both transient simulations were compared. The numerical and input errors in moose are also visualized with contour plots to qualitatively understand the evolution of the errors across time and space. The comparisons between moose and star-ccm + showed nearly perfect agreement between the codes for velocity and pressure, especially after the development of the vortex street in later time-steps. The force coefficients showed excellent agreement after the development of the vortex street, but demonstrated notable discrepancies prior to the vortex street development, which is likely due to how each code simulated the approach to the vortex street in earlier time-steps.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Accelerating high-order continuum kinetic plasma simulations using multiple GPUs

Kinetic plasma simulations solve the Vlasov-Poisson or Vlasov-Maxwell equations to evolve scalar-variable distribution functions in position-velocity phase space and vector-variable electromagnetic fields in configuration space. The immense computational cost of evolving high-dimensional variables, and their large number of degrees of freedom, often limits the utility of continuum kinetic simulations and presents a challenge when it comes to accurately simulating real-world physical phenomena. To address this challenge, we present techniques that accelerate and minimize the computational work required for a scalable Vlasov-Poisson solver. We show theoretical hardware compute and communication bounds for solving a fourth-order finite-volume Vlasov-Poisson system. These bounds are then used to inform and evaluate the design of performance portable algorithms for a multiple graphics processing unit (GPU) accelerated version of the Vlasov-Poisson solver VCK-CPU [1]. We demonstrate that the multi-GPU Vlasov solver implementation, VCK-GPU, simultaneously minimizes required inter-process data transfer while also being bounded by the machine network performance limits. This results in an overall strong scaling speedup per timestep of up to 40x in three-dimensional phase space (one position, two velocity coordinates) and 54x in four dimensional phase space (two position, two velocity coordinates) and a 341x increase in simulation throughput of the GPU accelerated code over the existing CPU code. The GPU code is also able to weak scale up to 256 compute nodes and 1024 GPUs. In conclusion, we demonstrate that the improved compute performance enables exploring configurations which were previously computationally infeasible, including resolving fine-scale distribution function filamentation and multi-species dynamics with realistic electron-proton mass ratios.

Continuum kinetics↗
DOE OSTI2022

Multiview Incomplete Knowledge Graph Integration with application to cross-institutional EHR data harmonization

Objective: The growing availability of electronic health records (EHR) data opens opportunities for integrative analysis of multi-institutional EHR to produce generalizable knowledge. A key barrier to such integrative analyses is the lack of semantic interoperability across different institutions due to coding differences. We propose a Multiview Incomplete Knowledge Graph Integration (MIKGI) algorithm to integrate information from multiple sources with partially overlapping EHR concept codes to enable translations between healthcare systems. Methods: The MIKGI algorithm combines knowledge graph information from (i) embeddings trained from the co-occurrence patterns of medical codes within each EHR system and (ii) semantic embeddings of the textual strings of all medical codes obtained from the Self-Aligning Pretrained BERT (SAPBERT) algorithm. Due to the heterogeneity in the coding across healthcare systems, each EHR source provides partial coverage of the available codes. MIKGI synthesizes the incomplete knowledge graphs derived from these multi-source embeddings by minimizing a spherical loss function that combines the pairwise directional similarities of embeddings computed from all available sources. MIKGI outputs harmonized semantic embedding vectors for all EHR codes, which improves the quality of the embeddings and enables direct assessment of both similarity and relatedness between any pair of codes from multiple healthcare systems. Results: With EHR co-occurrence data from Veteran Affairs (VA) healthcare and Mass General Brigham (MGB), MIKGI algorithm produces high quality embeddings for a variety of downstream tasks including detecting known similar or related entity pairs and mapping VA local codes to the relevant EHR codes used at MGB. Based on the cosine similarity of the MIKGI trained embeddings, the AUC was 0.918 for detecting similar entity pairs and 0.809 for detecting related pairs. For cross-institutional medical code mapping, the top 1 and top 5 accuracy were 91.0% and 97.5% when mapping medication codes at VA to RxNorm medication codes at MGB; 59.1% and 75.8% when mapping VA local laboratory codes to LOINC hierarchy. When trained with 500 labels, the lab code mapping attained top 1 and 5 accuracy at 77.7% and 87.9%. MIKGI also attained best performance in selecting VA local lab codes for desired laboratory tests and COVID-19 related features for COVID EHR studies. Compared to existing methods, MIKGI attained the most robust performance with accuracy the highest or near the highest across all tasks. Conclusions: The proposed MIKGI algorithm can effectively integrate incomplete summary data from biomedical text and EHR data to generate harmonized embeddings for EHR codes for knowledge graph modeling and cross-institutional translation of EHR codes.

Zhou, Doudou↗
DOE OSTI2021

A machine learning approach to galaxy properties: joint redshift–stellar mass probability distributions with Random Forest

We demonstrate that highly accurate joint redshift–stellar mass probability distribution functions (PDFs) can be obtained using the Random Forest (RF) machine learning (ML) algorithm, even with few photometric bands available. As an example, we use the Dark Energy Survey (DES), combined with the COSMOS2015 catalogue for redshifts and stellar masses. We build two ML models: one containing deep photometry in the griz bands, and the second reflecting the photometric scatter present in the main DES survey, with carefully constructed representative training data in each case. We validate our joint PDFs for 10 699 test galaxies by utilizing the copula probability integral transform and the Kendall distribution function, and their univariate counterparts to validate the marginals. Benchmarked against a basic set-up of the template-fitting code bagpipes, our ML-based method outperforms template fitting on all of our predefined performance metrics. In addition to accuracy, the RF is extremely fast, able to compute joint PDFs for a million galaxies in just under 6 min with consumer computer hardware. Such speed enables PDFs to be derived in real time within analysis codes, solving potential storage issues. As part of this work we have developed galpro 1, a highly intuitive and efficient python package to rapidly generate multivariate PDFs on-the-fly. galpro is documented and available for researchers to use in their cosmology and galaxy evolution studies.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Hybrid Particle Method for Computational Shock Physics

A long-standing area of research for Eulerian shock wave physics codes has been the treatment of strength and damage for materials. Here we present a method that will aid in the analysis of strength and failure in shock physics applications where excessive diffusion of critical variables can occur and control the solution outcome. Eulerian methods excel for large deformation simulations in general but are inaccurate in capturing structural behavior. Lagrangian methods provide better structural response, but finite element meshes can become tangled. Therefore, a technique for merging Lagrangian and Eulerian treatments of material response, within a single numerical framework, was implemented in the Multiple Component computational shock physics hydrocode. The capability is a Lagrangian/Eulerian Particle Method (LEPM) that uses particles to interface a Lagrangian treatment of material strength with a more traditional Eulerian treatment of the Equation of State (EOS). Lagrangian numerical methods avoid the advection diffusion found in Eulerian methods, which typically strongly affects strength constitutive law internal variables, such as equivalent plastic strain, porosity and/or damage. The Lagrangian capability enhances existing capabilities and permits accurate predictions of high rate, large deformation and/or shock of mechanical structures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Electron–phonon physics from first principles using the EPW code

EPW is an open-source software for ab initio calculations of electron–phonon interactions and related materials properties. The code combines density functional perturbation theory and maximally localized Wannier functions to efficiently compute electron–phonon coupling matrix elements, and to perform predictive calculations of temperature-dependent properties and phonon-assisted quantum processes in bulk solids and low-dimensional materials. Here, we report on significant developments in the code since 2016, namely: a transport module for the calculation of charge carrier mobility under electric and magnetic fields using the Boltzmann transport equation; a superconductivity module for calculations of phonon-mediated superconductors using the anisotropic multi-band Eliashberg theory; an optics module for calculations of phonon-assisted indirect transitions; a module for the calculation of small and large polarons without supercells; and a module for calculating band structure renormalization and temperature-dependent optical spectra using the special displacement method. For each capability, we outline the methodology and implementation and provide example calculations.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Investigating Fission Reaction Rate Ratio Sensitivities [Slides]

One EUCLID project goal is to create a NEW capability in the MCNP6 code. This is being tested on reaction rate sensitivities and compared with SENSMG results. Reaction rate ratio sensitivities were added to EUCLID sensitivity library and investigated to determine value toward designing optimized experiments aimed at reducing compensating errors in nuclear data. The use of adjustment using multiple responses (and underlying/required capabilities) may benefit many applications. These include a tool for adjustment using multiple integral responses (ND adjustment and validation community); sensitivities of additional responses (ND adjustment and validation community); sensitivity capabilities (users in many application areas including safeguards/nonproliferation, criticality safety, etc.); and experiment optimization capability (applications which can benefit from integral experiments). Team is working to build and test future tools and to understand compensating errors

235U↗
DOE OSTI2026

Speedup of UEDGE Parameter Scans Using Machine-Learning Optimized OpenMP Parallelization and a Continuation Solver

This article presents the OpenMP parallelization of the preconditioning Jacobian assembly and right‐hand side residual evaluation in UEDGE. A continuation algorithm, utilizing the internal NKSOL implicit Jacobian‐Free Newton‐Krylov solver to efficiently scan physical parameters, is also presented. The implemented parallelization reduces the computational time for a benchmark scan run on 32 threads by compared to the serial version when using trained random forest regression models to identify the optimal decomposition of the system of equations. Random forest regression models applied to the UEDGE time‐dependent and continuation solver algorithms did not yield meaningful improvement in computational performance. A benchmark DIII‐D gas injection rate scan in the 0.35–0.75 kA interval, performed on a test cluster using the parallelized code and continuation solver, produced 1066 steady‐state solutions with a 22 s average wall‐clock computational time per steady‐state solution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Effect of convective transport in edge and scrape-off-layer plasmas of ADITYA-U tokamak

The 2-D edge plasma fluid transport code, UEDGE has been used to simulate the edge and scrape-off layer regions of circular limiter plasmas of ADITYA-U. The computational mesh defining the limiter geometry of ADITYA-U has been introduced in the UEDGE code through an in-house developed routine. It has successfully been integrated with the UEDGE code and the measured radial profile of electron density (n e ) in the edge region is modelled using the simulations. The plasma discharge for the present study has plasma current I P ~ 130 kA, duration ~ 150 ms, chord-averaged electron density ~ 1.3 x 10 19 m -3 , and central electron temperature ~ 270 eV has been observed. The maximum toroidal magnetic field is ~ 1.2 T. It has been found that an inward convective velocity, v conv ~ 1.5 m/s is required in addition to the constant perpendicular diffusion coefficient, D ⟂ ~ 0.2 m 2 /s to adequately match the measured n e profile in typical discharges of ADITYA-U. The value of D ⟂ ~ 0.2 m 2 /s is found to lie between the estimated neoclassical diffusivity and Bohm diffusivity.

Physics - Plasma physics↗