SEARCH · Search NASA

Results for “interface algorithm”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Generating An Advanced Cross-section Library For HTGR Pebble Bed Depletion Calculations Using Reduced-Order Model Generation Techniques

For code development, Advanced Reactor Technologies - Gas Cooled Reactors Program (ART-GCR) rely on a collaboration with the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, but the cross sections generation and the methodology definition is part of this program area goals. Based on previous studies in FY23, the size of microscopic cross section libraries increases rapidly with the number of tabulations, requiring significant amount of memory and drastically slowing down the Griffin calculations when evaluating cross sections via the multivariate linear interpolation approach. Rising to these challenges, this work investigates constructing Reduced-order Models (ROMs) for the multi-group microscopic cross sections to accelerate the cross section evaluation in Griffin. A database of multigroup cross sections is first collected considering all possible parameters that a designer could change for optimization. Down-selection of the ROM techniques afterward shows Deep Neural Network (DNN) as the best candidate when jointly consider memory efficiency, predictive accuracy, computational cost, scalability, flexibility and ease of implementation of the algorithms in comparison to the multidimensional interpolation. This work develops a specific interface that enables the cross section predictions using pre-trained DNN models into Griffin leveraging the existing ROM capabilities. DNNs have been trained for all isotopes for use in Griffin. Preliminary Griffin testing shows that DNNs exhibit exceptional predictive accuracy and the use of DNNs provides orders of magnitude improvement in memory efficiency compared to conventional interpolation techniques. With such ROM techniques, it holds great promise to further increase the fidelity of the Pebble Bed Reactor (PBR) simulation by increasing the number of tabulations/state variables during cross section evaluation, while maintaining the computational cost affordable in Griffin.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2023

Distributed Energy Management for Networked Microgrids with Hardware-in-the-Loop Validation

For the cooperative operation of networked microgrids, a distributed energy management considering network operational objectives and constraints is proposed in this work. Considering various ownership and privacy requirements of microgrids, utility directly interfaced distributed energy resources (DERs) and demand response, a distributed optimization is proposed for obtaining optimal network operational objectives with constraints satisfied through iteratively updated price signals. The alternating direction method of multipliers (ADMM) algorithm is utilized to solve the formulated distributed optimization. The proposed distributed energy management provides microgrids, utility-directly interfaced DERs and responsive demands the opportunity of contributing to better network operational objectives while preserving their privacy and autonomy. Results of numerical simulation using a networked microgrids system consisting of several microgrids, utility directly interfaced DERs and responsive demands validate the soundness and accuracy of the proposed distributed energy management. The proposed method is further tested on a practical two-microgrid system located in Adjuntas, Puerto Rico, and the applicability of the proposed strategy is validated through hardware-in-the-loop (HIL) testing.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2020

PySpawn: Software for Nonadiabatic Quantum Molecular Dynamics

The ab initio multiple spawning (AIMS) method enables nonadiabatic quantum molecular dynamics simulations in an arbitrary number of dimensions, with potential energy surfaces provided by electronic structure calculations performed on-the-fly. However, the intricacy of the AIMS algorithm complicates software development, deployment on modern shared computer resources, and post-simulation data analysis. PySpawn is a nonadiabatic molecular dynamics software package that addresses these issues. Here, the program is designed to be easily interfaced with electronic structure software, and an interface to the TeraChem software package is described here. PySpawn introduces a task-based reorganization of the AIMS algorithm, allowing fine-grained restart capability and setting the stage for efficient parallelization in a future release. PySpawn includes a user-friendly and interactive Python analysis module that will enable novice users to painlessly adopt AIMS. As a demonstration of PySpawn’s simulation capability and analysis module, we report complete active space self-consistent field–based AIMS simulations of the 1,2- dithienyl-1,2-dicyanoethene molecule, a promising molecular photoswitch.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗

DOE OSTI2020

ELSI — An open infrastructure for electronic structure solvers

Routine applications of electronic structure theory to molecules and periodic systems need to compute the electron density from given Hamiltonian and, in case of non-orthogonal basis sets, overlap matrices. System sizes can range from few to thousands or, in some examples, millions of atoms. Different discretization schemes (basis sets) and different system geometries (finite non-periodic vs. infinite periodic boundary conditions) yield matrices with different structures. The ELectronic Structure Infrastructure (ELSI) project provides an open-source software interface to facilitate the implementation and optimal use of high-performance solver libraries covering cubic scaling eigensolvers, linear scaling density-matrix-based algorithms, and other reduced scaling methods in between. In this paper, we present recent improvements and developments inside ELSI, mainly covering (1) new solvers connected to the interface, (2) matrix layout and communication adapted for parallel calculations of periodic and/or spin-polarized systems, (3) routines for density matrix extrapolation in geometry optimization and molecular dynamics calculations, and (4) general utilities such as parallel matrix I/O and JSON output. The ELSI interface has been integrated into four electronic structure code projects (DFTB+, DGDFT, FHI-aims, SIESTA), allowing us to rigorously benchmark the performance of the solvers on an equal footing. Based on results of a systematic set of large-scale benchmarks performed with Kohn–Sham density-functional theory and density-functional tight-binding theory, we identify factors that strongly affect the efficiency of the solvers, and propose a decision layer that assists with the solver selection process. As a result, we describe a reverse communication interface encoding matrix-free iterative solver strategies that are amenable, e.g., for use with planewave basis sets.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Heterostructural interface engineering for ultrawide-gap nitrides from first principles: Ta C / Al N and Ta C / Ga N rocksalt-wurtzite interfaces

Epitaxial lattice matching is an important condition for the formation of coherent interfaces with low defect densities. However, lattice-matched substrates with the same crystal structure as the active layer are often not available, suggesting opportunities for utilizing heterostructural interfaces. For example, at high Al contents that are interesting for ultrawide-gap applications in power electronics, Al x ⁢Ga 1-x ⁢N semiconductor alloys in the (0001) orientation of the wurtzite (wz) structure become lattice-matched to (111)-oriented rocksalt (rs) Ta⁢C substrates. To predict the expected interface atomic structures under different synthesis conditions, we perform high-throughput density-functional-theory calculations, using an algorithm for systematic sampling of the possible stacking sequences of the atomic layers on the in-plane hexagonal lattice. The approach considers octahedral, tetrahedral, and prismatic coordination motifs, and is generally applicable for the modeling of commensurate rs/wz heterostructural interfaces. Our results provide guidance for synthesis control of substrate-film bonding and the polarity of ultrawide-gap Al x⁢ Ga 1-x⁢ N alloys on Ta⁢C substrates.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Phase Field Modeling of Near-Wellbore Hydraulic Fracture Nucleation and Propagation

The goal of Task 2 of the project titled "Closing the loop between in situ stress complexity and EGS fracture complexity" is to model fracture nucleation and propagation in the near wellbore region and, in combination with the experimental study conducted as part of Task 4, investigate the relationship between the in situ stress and the near-wellbore fracture patterns. To this end, We have identified phase field as a promising modeling approach to model the nucleation and propagation process in the near wellbore region. In phase field, fractures are represented by a diffuse variable, i.e the damage. Compared to approaches that model fractures as sharp interfaces, phase field does not require any re-meshing or element insertion algorithm, which makes the treatment of complex fracture geometries straightforward, even with simple meshes.

15 GEOTHERMAL ENERGY↗

DOE OSTI2019

A Tutorial on the Synthesis and Validation of a Closed-Loop Wind Farm Controller Using a Steady-State Surrogate Model

In wind farms, wake interaction leads to losses in power capture and accelerated structural degradation when compared to freestanding turbines. One method to reduce wake losses is by misaligning the rotor with the incoming flow using its yaw actuator, thereby laterally deflecting the wake away from downstream turbines. However, this demands an accurate and computationally tractable model of the wind farm dynamics. This problem calls for a closed-loop solution. This tutorial paper fills the scientific gap by demonstrating the full closed-loop controller synthesis cycle using a steady-state surrogate model. Furthermore, a novel, computationally efficient and modular communication interface is presented that enables researchers to straight-forwardly test their control algorithms in large-eddy simulations. High-fidelity simulations of a 9-turbine farm show a power production increase of up to 11% using the proposed closed-loop controller compared to traditional, greedy wind farm operation.

17 WIND ENERGY↗

DOE OSTI2024

Integration of scanning probe microscope with high-performance computing: Fixed-policy and reward-driven workflows implementation

The rapid development of computation power and machine learning algorithms has paved the way for automating scientific discovery with a scanning probe microscope (SPM). The key elements toward operationalization of the automated SPM are the interface to enable SPM control from Python codes, availability of high computing power, and development of workflows for scientific discovery. Here, we build a Python interface library that enables controlling an SPM from either a local computer or a remote high-performance computer, which satisfies the high computation power need of machine learning algorithms in autonomous workflows. We further introduce a general platform to abstract the operations of SPM in scientific discovery into fixed-policy or reward-driven workflows. Furthermore, our work provides a full infrastructure to build automated SPM workflows for both routine operations and autonomous scientific discovery with machine learning.

47 OTHER INSTRUMENTATION↗

DOE OSTI2021

Resiliency in numerical algorithm design for extreme scale simulations

Here this work is based on the seminar titled ‘Resiliency in Numerical Algorithm Design for Extreme Scale Simulations’ held March 1–6, 2020, at Schloss Dagstuhl, that was attended by all the authors. Advanced supercomputing is characterized by very high computation speeds at the cost of involving an enormous amount of resources and costs. A typical large-scale computation running for 48 h on a system consuming 20 MW, as predicted for exascale systems, would consume a million kWh, corresponding to about 100k Euro in energy cost for executing 10 23 floating-point operations. It is clearly unacceptable to lose the whole computation if any of the several million parallel processes fails during the execution. Moreover, if a single operation suffers from a bit-flip error, should the whole computation be declared invalid? What about the notion of reproducibility itself: should this core paradigm of science be revised and refined for results that are obtained by large-scale simulation? Naive versions of conventional resilience techniques will not scale to the exascale regime: with a main memory footprint of tens of Petabytes, synchronously writing checkpoint data all the way to background storage at frequent intervals will create intolerable overheads in runtime and energy consumption. Forecasts show that the mean time between failures could be lower than the time to recover from such a checkpoint, so that large calculations at scale might not make any progress if robust alternatives are not investigated. More advanced resilience techniques must be devised. The key may lie in exploiting both advanced system features as well as specific application knowledge. Research will face two essential questions: (1) what are the reliability requirements for a particular computation and (2) how do we best design the algorithms and software to meet these requirements? While the analysis of use cases can help understand the particular reliability requirements, the construction of remedies is currently wide open. One avenue would be to refine and improve on system- or application-level checkpointing and rollback strategies in the case an error is detected. Developers might use fault notification interfaces and flexible runtime systems to respond to node failures in an application-dependent fashion. Novel numerical algorithms or more stochastic computational approaches may be required to meet accuracy requirements in the face of undetectable soft errors. These ideas constituted an essential topic of the seminar. The goal of this Dagstuhl Seminar was to bring together a diverse group of scientists with expertise in exascale computing to discuss novel ways to make applications resilient against detected and undetected faults. In particular, participants explored the role that algorithms and applications play in the holistic approach needed to tackle this challenge. This article gathers a broad range of perspectives on the role of algorithms, applications and systems in achieving resilience for extreme scale simulations. The ultimate goal is to spark novel ideas and encourage the development of concrete solutions for achieving such resilience holistically.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Addressing qubits with a software-defined radio FPGA (Full Technical Final Report)

Superconducting transmons can be configured as qubits and can also be used for weak signal axion searches. During a prior LDRD (17-ERD-006), a robust capability for system simulation and analysis, algorithm development, algorithm to FPGA workflow and experimental measurements was developed. During that project it was determined that a new software-defined radio FPGA would be a significant improvement in cost, simplicity, and software maintainability over the X6-1000M FPGA plus RF front-end system that had been used. In this Feasibility Study, we successfully developed the interface to the new NI USRP-2954R SDR platform, generated and optimized the VHDL of the existing algorithms, and experimentally tested the new FPGA system on real qubit in the laboratory. These tests showed it had the same SNR on weak measurements as the prior FPGA.

42 ENGINEERING↗

DOE OSTI2022

Efficient reconstruction and validation of heterogeneous microstructures for energy applications

The digital reconstruction of microstructures is necessary for simulations in fields ranging from geology to electrochemistry, but the state-of-the-art digital reconstruction techniques often compromise between resolution and field of view. It is challenging to retain detailed microstructure information in large-scale reconstructions. Here, this study investigates different aspects of the Yeong-Torquato algorithm based on correlation functions to make it more efficient. We achieve this goal by reducing the computational complexity of the chord-length distribution function and the two-point correlation function, applying the random sphere-packing method as the initial condition, and restricting potential voxel swaps to interfaces. In addition, a novel superposition parallel scheme is introduced to aid in searching for potential voxel swaps. The algorithm proposed is validated by comparing the pore-size distributions of reconstructed 3D custom battery electrodes from a sample dataset obtained from transmission X-ray microscopy. From a sample image with 200 x 200 pixels, the code can reconstruct a 300 x 300 x 300 structure in under 22 h and reconstruct a 400 x 400 x 400 structure in 43 h with eight cores.

42 ENGINEERING↗

DOE OSTI2024

Plasma Surface Interactions: Predicting the Performance and Impact of Dynamic PFC Surfaces

The objective of this project is to develop, and integrate, high-performance simulation tools capable of predicting plasma-facing component (PFC) operating lifetime and the impact of the evolving surface morphology of tungsten-based PFCs on plasma contamination, including the dynamic recycling of fuel species and tritium retention, in future magnetic fusion devices. Establishing a fundamental physical understanding and developing predictive capabilities of plasma-surface interactions (PSI) requires simultaneously addressing complex and diverse physics occurring over a wide range of length (Angstroms to meters) and time (femtoseconds to years) scales, as well as integrating extensive physical processes across the plasma–surface interface. This requires development of not only detailed physics models and computational strategies at each scale, but also algorithms and methods to couple them effectively in a way that can be robustly validated. Deploying these tools requires the continued development and coupling of leadership-scale computational codes to describe the boundary plasma and the evolving PFC surface, as well as a host of simulations that bridge disparate scales to address complex physical and computational issues at the plasma–surface interface in multi-component materials systems for magnetic fusion energy development beyond ITER.

36 MATERIALS SCIENCE↗

DOE OSTI2019

Distinct driven steady states emerge from diverse initial textures in rolled nanocomposites

Severe plastic deformation is a known method of making high-performance metallic materials. Single-phase polycrystalline metals undergoing severe plastic deformation develop steady-state textures that are characteristic of the mode of deformation. By contrast, we show that two-phase, Cu-Nb nano-laminate composites reach a variety of different steady-state textures under a single mode of deformation. Using molecular statics simulations and a novel algorithm for crystal rotation analysis, we observe that the final, steady state texture and interface character in these materials depends on the initial texture of the composite. This result suggests that the range of bulk Cu-Nb nano-composite textures that may be made by severe plastic deformation is larger than previously demonstrated, with multiple plastically-driven steady states accessible, depending on initial texture. We propose a modification of accumulative roll bonding with highly textured seed layers as a means of accessing different driven steady states in layered composites.

36 MATERIALS SCIENCE↗

DOE OSTI2023

Two-fluid physical modeling of superconducting resonators in the ARTEMIS framework

In this work, we implement a new London equation module for superconductivity in the GPU-enabled ARTEMIS framework, and couple it to a finite-difference time-domain solver for Maxwell's equations. We apply this two-fluid approach to model a superconducting coplanar waveguide (CPW) resonator. We validate our implementation by verifying that the theoretical skin depth and reflection coefficients can be obtained for several superconductive materials, with different London penetration depths, over a range of frequencies. Our convergence studies show that the algorithm is second-order accurate in both space and time, except at superconducting interfaces where the approach is spatially first-order. In our CPW simulations, we leverage the GPU scalability of our code to compare the two-fluid model to more traditional approaches that approximate superconducting behavior and demonstrate that superconducting physics can show comparable performance to the assumption of quasi-infinite conductivity as measured by the Q-factor.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2024

Sensitive and error-tolerant annotation of protein-coding DNA with BATH

We present BATH, a tool for highly sensitive annotation of protein-coding DNA based on direct alignment of that DNA to a database of protein sequences or profile hidden Markov models (pHMMs). BATH is built on top of the HMMER3 code base, and simplifies the annotation workflow for pHMM-based translated sequence annotation by providing a straightforward input interface and easy-to-interpret output. BATH also introduces novel frameshift-aware algorithms to detect frameshift-inducing nucleotide insertions and deletions (indels). BATH matches the accuracy of HMMER3 for annotation of sequences containing no errors, and produces superior accuracy to all tested tools for annotation of sequences containing nucleotide indels. These results suggest that BATH should be used when high annotation sensitivity is required, particularly when frameshift errors are expected to interrupt protein-coding regions, as is true with long-read sequencing data and in the context of pseudogenes.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2022

Performance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws

Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physics applications, requires the satisfaction of the so-called Courant-Friedrichs-Lewy condition. By allowing regions of the mesh to advance with different timesteps that locally satisfy this stability constraint, significant work reduction can be attained when compared to a time integration scheme using a single timestep size. However, parallelizing this algorithm presents considerable difficulty. Since the stability condition depends on the state of the system, dependencies become dynamic and potentially non-local. In this article, we present an adaptive local timestepping algorithm using an optimistic (Timewarp-based) parallel discrete event simulation. We introduce waiting heuristics to limit misspeculation and a semi-static load balancing scheme to eliminate load imbalance as parts of the mesh require finer or coarser timesteps. Last, we outline an interface for separating the physics of the specific conservation law from the temporal integration allowing for productive adoption of our proposed algorithm. We present a misspeculation study for three conservation laws, demonstrating both the productivity of the local timestepping API, for which 74% of the lines of code are reused across different conservation laws, and the robustness of the waiting heuristics—at most 1.5% of element updates are rolled back. Our performance studies demonstrate up to a 2.8× speedup versus a baseline unoptimized local timestepping approach, a 4x improvement in per-node throughput compared to an MPI parallelization of synchronous timestepping, and scalability up to 3,072 cores on NERSC’s Cori Haswell partition.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Practical jet flavour through NNLO

Abstract An infrared and collinear (IRC) safe definition of the partonic flavour of a jet is vital for precision predictions of quantum chromodynamics at colliders. Jet flavour definitions have been presented in the literature, but they are typically defined through modification of the jet algorithm to be sensitive to partonic flavour at every stage of the clustering. While this does ensure that the sum of flavours in a jet is IRC safe, a flavour-sensitive clustering procedure is difficult to apply to realistic data. We introduce a distinct and novel approach to jet flavour that can be applied to a collection of partons defined by any algorithm. Our definition of jet flavour is the sum of flavours of all partons that remain after Soft Drop grooming, reclustered with the "Image missing" <#comment/> algorithm. We prove that this prescription is IRC safe through next-to-next-to-leading order (NNLO), and so can interface with the most precise fixed-order calculations for jets available at present. We validate the IRC safety of this definition with numeric fixed-order codes and further show that jet flavour with Soft Drop reclustered with a generalised $$k_T$$ k T algorithm fails to be IRC safe at NNLO.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗