Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

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,333 records · Page 74
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

RAVEN User Manual

RAVEN is a generic software framework to perform parametric and probabilistic analysis based on the response of complex system codes. The initial development was aimed to provide dynamic risk analysis capabilities to the Thermo-Hydraulic code RELAP-7, currently under development at the Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose probabilistic and uncertainty quantification platform, capable to agnostically communicate with any system code. This agnosticism includes providing Application Programming Interfaces (APIs). These APIs are used to allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by inputs files or via python interfaces. RAVEN is capable of investigating the system response, and investigating the input space using Monte Carlo, Grid, or Latin Hyper Cube sampling schemes, but its strength is focused to- ward system feature discovery, such as limit surfaces, separating regions of the input space leading to system failure, using dynamic supervised learning techniques. The development of RAVEN has started in 2012, when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework became stronger. RAVEN principal assignment is to provide the necessary software and algorithms in order to employ the concept developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just the individuation of the frequency of an event potentially leading to a system failure, but the closeness (or not) to key safety-related events. Hence, the approach is interested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. for an important process such as peak pressure in a pipe) is exceeded under certain conditions. The initial development of RAVEN has been focused on providing dynamic risk assessment capability to RELAP-7, currently under development at the INL and, likely, future replacement of the RELAP5-3D code. Most the capabilities that have been implemented having RELAP-7 as principal focus are easily deployable for other system codes. For this reason, several side activates are currently ongoing for coupling RAVEN with soft- ware such as RELAP5-3D, etc. The aim of this document is the explanation of the input requirements, focalizing on the input structure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Proposed Algorithm for Placement and Sizing of Generation and Storage Stations in Urban Environments

The placement of generation and storage stations (GSSs) in distribution grids has been extensively investigated. Most traditional methods are applicable to rural or homogeneous environments and do not account for external restrictions on generation placement in urban or semi-urban environments. In this article, we propose a method for generation placement considering externality constraints. New utility-scale generation in distribution grids potentially occupies footprint and interferes in areas with existing infrastructure with architectural, historical, or touristic value. Urban environments are often regulated by municipal legislation. The placement of utility-scale generation in urban landscapes is economically and physically restricted by such externalities, and existing methods for generation placement in distribution grids based on technical optimization fail to account for this important nuance. The proposed algorithm flexibly adapts to changes in government energy policies and priorities. The selection of the type of generation suitable for the power grid is left to the preference of external high-level stakeholders, such as urban planners, industry development leaders, and energy policymakers. The proposed algorithm is a unique tool for determining the placement and sizing of generation in realistic conditions in distribution grids; it is adaptable to urban externalities and sensitive to stakeholder preferences.

generation and storage station placement↗
DOE OSTI2022

An unconditionally stable, time-implicit algorithm for solving the one-dimensional Vlasov–Poisson system

The development of an implicit, unconditionally stable, numerical method for solving the Vlasov–Poisson system in one dimension using a phase-space grid is presented. The algorithm uses the Crank–Nicolson discretization scheme and operator splitting allowing for direct solution of the finite difference equations. This method exactly conserves particle number, enstrophy and momentum. A variant of the algorithm which does not use splitting also exactly conserves energy but requires the use of iterative solvers. This algorithm has no dissipation and thus fine-scale variations can lead to oscillations and the production of negative values of the distribution function. We find that overall, the effects of negative values of the distribution function are relatively benign. We consider a variety of test cases that have been used extensively in the literature where numerical results can be compared with analytical solutions or growth rates. We examine higher-order differencing and construct higher-order temporal updates using standard composition methods.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Developments in Performance and Portability of BlockGen

For more than a decade Monte Carlo event generators with the current matrix element algorithms have been used for generating hard scattering events on CPU platforms, with excellent flexibility and good efficiency. While the HL-LHC is approaching and precision requirements are becoming more demanding, many studies have been made to solve the bottleneck in the current Monte Carlo event generator tool chains. The novel BlockGen family of fast matrix element algorithms shown in this report, is one of the new developments that are more suitable for GPU acceleration. We report the development experience of porting BlockGen using Kokkos. Moreover, we discuss the performance of the Kokkos version in comparison with the dedicated GPU version in CUDA.

Bothmann, E. [Gottingen U.]↗
DOE OSTI2022

Performance of New Near-Real-Time PERSIANN Product (PDIR-Now) for Atmospheric River Events over the Russian River Basin, California

Most heavy precipitation events and extreme flooding over the U.S. Pacific coast can be linked to prevalent atmospheric river (AR) conditions. Thus, reliable quantitative precipitation estimation with a rich spatiotemporal resolution is vital for water management and early warning systems of flooding and landslides over these regions. At the same time, high-quality near-real-time measurements of AR precipitation remain challenging due to the complex topographic features of land surface and meteorological conditions of the region: specifically, orographic features occlude radar measurements while infrared-based algorithms face challenges, differentiating between both cold brightband (BB) precipitation and the warmer nonbrightband (NBB) precipitation. It should be noted that the latter precipitation is characterized by greater orographic enhancement. In this study, we evaluate the performance of a recently developed near-real-time satellite precipitation algorithm: Precipitation Estimation from Remotely Sensed Information Using Artificial Neural Networks (PERSIANN) Dynamic Infrared–Rain Rate-Now (PDIR-Now). This model is primarily dependent on infrared information from geostationary satellites as input; consequently, PDIR-Now has the advantage of short data latency, 15–60-min delay between observation to precipitation product delivery. The performance of PDIR-Now is analyzed with a focus on AR-related events for cases dominated by NBB and BB precipitation over the Russian River basin. In our investigations, we utilize S-band (3-GHz) precipitation profilers with Joss/Parsivel disdrometer measurements at the Middletown and Santa Rosa stations to classify BB and NBB precipitation events. In general, our analysis shows that PDIR-Now is more skillful in retrieving precipitation rates over both BB and NBB events across the topologically complex study area as compared to PERSIANN-Cloud Classification System (CCS). Also, we discuss the performance of well-known operational near-real-time precipitation products from 2017 to 2019. Conventional categorical and volumetric categorical indices, as well as continuous statistical metrics, are used to show the differences between various high-resolution precipitation products such as Multi-Radar Multi-Sensor (MRMS).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Fermionic Isometric Tensor Network States in Two Dimensions

We generalize isometric tensor network states to fermionic systems, paving the way for efficient adaptations of 1D tensor network algorithms to 2D fermionic systems. As the first application of this formalism, we developed and benchmarked a time-evolving block-decimation (TEBD) algorithm for real-time and imaginary-time evolution. The imaginary-time evolution produces ground-state energies for gapped systems, systems with a Dirac point, and systems with gapless edge modes to good accuracy. Here, the real-time TEBD captures the scattering of two fermions and the chiral edge dynamics on the boundary of a Chern insulator.

2-dimensional systems↗
DOE OSTI2021

Evolutionary NAS in Light of Model Stability for Accurate Continual Learning

Continual learning, the capability to learn new knowledge from streaming data without forgetting the previous knowledge, is a critical requirement for dynamic learning systems, especially for emerging edge devices such as self-driving cars and drones. However, continual learning is still facing the catastrophic forgetting problem. Previous work illustrate that model performance on continual learning is not only related to the learning algorithms but also strongly dependent on the inherited model, i.e., the model where continual learning starts. The better stability of the inherited model, the less catastrophic forgetting and thus, the inherited model should be elaborately selected. Inspired by this finding, we develop an evolutionary neural architecture search (ENAS) algorithm that emphasizes the Stability of the inherited model, namely ENAS-S. ENAS-S aims to find optimal architectures for accurate continual learning on edge devices. On CIFAR-10 and CIFAR-100, we present that ENAS-S achieves competitive architectures with lower catastrophic forgetting and smaller model size when learning from a data stream, as compared with handcrafted DNNs.

Du, Xiaocong↗
DOE OSTI2021

Towards Predictive Plasma Science and Engineering through Revolutionary Multi-Scale Algorithms and Models (Final Report)

This report describes the high-level accomplishments from the Plasma Science and Engineering Grand Challenge LDRD at Sandia National Laboratories. The Laboratory has a need to demonstrate predictive capabilities to model plasma phenomena in order to rapidly accelerate engineering development in several mission areas. The purpose of this Grand Challenge LDRD was to advance the fundamental models, methods, and algorithms along with supporting electrode science foundation to enable a revolutionary shift towards predictive plasma engineering design principles. This project integrated the SNL knowledge base in computer science, plasma physics, materials science, applied mathematics, and relevant application engineering to establish new cross-laboratory collaborations on these topics. As an initial exemplar, this project focused efforts on improving multi-scale modeling capabilities that are utilized to predict the electrical power delivery on large-scale pulsed power accelerators. Specifically, this LDRD was structured into three primary research thrusts that, when integrated, enable complex simulations of these devices: (1) the exploration of multi-scale models describing the desorption of contaminants from pulsed power electrodes, (2) the development of improved algorithms and code technologies to treat the multi-physics phenomena required to predict device performance, and (3) the creation of a rigorous verification and validation infrastructure to evaluate the codes and models across a range of challenge problems. These components were integrated into initial demonstrations of the largest simulations of multi-level vacuum power flow completed to-date, executed on the leading HPC computing machines available in the NNSA complex today. These preliminary studies indicate relevant pulsed power engineering design simulations can now be completed in (of order) several days, a significant improvement over pre-LDRD levels of performance.

42 ENGINEERING↗
DOE OSTI2021

A stochastic biomass blending problem in decentralized supply chains

Blending biomass materials of different physical or chemical properties provides an opportunity to adjust the quality of the feedstock to meet the specifications of the conversion platform. We propose a model which identifies the right mix of biomass to optimize the performance of the thermochemical conversion process at the mini-mum cost. This is a chance-constraint programming (CCP) model which takes into account the stochastic nature of biomass quality. The proposed CCP model ensures that process requirements, which are impacted by physical and chemical properties of biomass, are met most of the time. We consider two problem settings, a centralized and a decentralized supply chain. We propose a mixed-integer linear program to model the blending problem in the centralized setting and a bilevel program to model the blending problem in the decentralized setting. We use the sample average approximation method to approximate the chance constraints, and propose solution algorithms to solve this approximation. We develop a case study for South Carolina using data provided by the Billion Ton Study. Based on our results, the blends identified consist mainly of pine and softwood residues. The blends identified and the suppliers selected by both models are different. The cost of the centralized supply chain is 2%–6% lower. The implications of these results are twofold. First, these results could lead to improved collaborations in the supply chain. Second, these results provide an estimate of the approximation error from assuming centralized decision making in the supply chain.

09 BIOMASS FUELS↗
DOE OSTI2021

Phoenix: A Scalable Streaming Hypergraph Analysis Framework

We present Phoenix, a scalable hypergraph analytics framework for data analytics and knowledge discovery that was implemented on the leadership class computing platforms at Oak Ridge National Laboratory (ORNL). Our software framework comprises a distributed implementation of a streaming server architecture which acts as a gateway for various hypergraph generators/external sources to connect. Phoenix has the capability to utilize diverse hypergraph generators, including HyGen, a very large-scale hypergraph generator developed by ORNL. Phoenix incorporates specific algorithms for efficient data representation by exploiting hidden structures of the hypergraphs. Our experimental results demonstrate Phoenix’s scalable and stable performance on massively parallel computing platforms. Phoenix’s superior performance is due to the merging of high-performance computing with data analytic.

Kurte, Kuldeep↗
DOE OSTI2023

Improved coarse-graining methods for two dimensional tensor networks including fermions

We show how to apply renormalization group algorithms incorporating entanglement filtering methods and a loop optimization to a tensor network which includes Grassmann variables which represent fermions in an underlying lattice field theory. As a numerical test a variety of quantities are calculated for two dimensional Wilson-Majorana fermions and for the two flavor Gross-Neveu model. The improved algorithms show much better accuracy for quantities such as the free energy and the determination of Fisher’s zeros.

Phase transitions↗
DOE OSTI2023

Three-body resonances in the φ 4 theory

We study the properties of three-body resonances using a lattice complex scalar φ4 theory with two scalars, with parameters chosen such that one heavy particle can decay into three light ones. We determine the two- and three-body spectra for several lattice volumes using variational techniques, and then analyze them with two versions of the three-particle finite-volume formalism: the Relativistic Field Theory approach and the Finite-Volume Unitarity approach. We find that both methods provide an equivalent description of the energy levels, and we are able to fit the spectra using simple parametrizations of the scattering quantities. By solving the integral equations of the corresponding three-particle formalisms, we determine the pole position of the resonance in the complex energy plane and thereby its mass and width. We find very good agreement between the two methods at different values of the coupling of the theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Tensor network representation of non-abelian gauge theory coupled to reduced staggered fermions

We show how to construct a tensor network representation of the path integral for reduced staggered fermions coupled to a non-abelian gauge field in two dimensions. The resulting formulation is both memory and computation efficient because reduced staggered fermions can be represented in terms of a minimal number of tensor indices while the gauge sector can be approximated using Gaussian quadrature with a truncation. Numerical results obtained using the Grassmann TRG algorithm are shown for the case of SU(2) lattice gauge theory and compared to Monte Carlo results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Properties of the contraction map for holographic entanglement entropy inequalities

We present a deterministic way of finding contraction maps for candidate holographic entanglement entropy inequalities modulo choices due to actual degeneracy. We characterize its complexity and give an argument for the completeness of the contraction map proof method as a necessary and sufficient condition for the validity of an entropy inequality for holographic entanglement.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Three relativistic neutrons in a finite volume

We generalize the relativistic field-theoretic (RFT) three-particle finite-volume formalism to systems of three identical, massive, spin-1/2 fermions, such as three neutrons. This allows, in principle, for the determination of the three-neutron interaction from the finite-volume spectrum of three-neutron states, which can be obtained from lattice QCD calculations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Entanglement Renormalization for Quantum Field Theories with Discrete Wavelet Transforms

We propose an adaptation of Entanglement Renormalization for quantum field theories that, through the use of discrete wavelet transforms, strongly parallels the tensor network architecture of the Multiscale Entanglement Renormalization Ansatz (a.k.a. MERA). Our approach, called wMERA, has several advantages of over previous attempts to adapt MERA to continuum systems. In particular, (i) wMERA is formulated directly in position space, hence preserving the quasi-locality and sparsity of entanglers; and (ii) it enables a built-in RG flow in the implementation of real-time evolution and in computations of correlation functions, which is key for efficient numerical implementations. As examples, we describe in detail two concrete implementations of our wMERA algorithm for free scalar and fermionic theories in (1+1) spacetime dimensions. Possible avenues for constructing wMERAs for interacting field theories are also discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Holography from lattice $\mathcal{N}$ = 4 super Yang-Mills

In this paper we use lattice simulation to study four dimensional $\mathcal{N}$ = 4 super Yang-Mills (SYM) theory. We have focused on the three color theory on lattices of size 12 4 and for ’t Hooft couplings up to λ = 40.0. Our lattice action is based on a discretization of the Marcus or GL twist of $\mathcal{N}$ = 4 SYM and retains one exact supersymmetry for non-zero lattice spacing. We show that lattice theory exists in a single non-Abelian Coulomb phase for all ’t Hooft couplings. Furthermore the static potential we obtain from correlators of Polyakov lines is in good agreement with that obtained from holography — specifically the potential has a Coulombic form with a coefficent that varies as the square root of the ’t Hooft coupling.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Efficient use of quantum computers for collider physics

Most observables at particle colliders involve physics at a wide variety of distance scales. Due to asymptotic freedom of the strong interaction, the physics at short distances can be calculated reliably using perturbative techniques, while long distance physics is non-perturbative in nature. Factorization theorems separate the contributions from different scales, allowing to identify the pieces that can be determined perturbatively from those that require non-perturbative information, and if the non-perturbative pieces can be reliably determined, one can use experimental measurements to extract the short distance effects, sensitive to possible new physics. Without the ability to compute the non-perturbative ingredients from first principles one typically identifies observables for which the non-perturbative information is universal in the sense that it can be extracted from some experimental observables and then used to predict other observables. In this paper we argue that the future ability to use quantum computers to calculate non-perturbative matrix elements from first principles will allow to make predictions for observables with non-universal non-perturbative long-distance physics.

Algorithms and Theoretical Developments↗