Search NASA⌕ Search

SEARCH · Search NASA

Results for “blocked 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.

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

At least 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Refining HPCToolkit for application performance analysis at exascale

As part of the US Department of Energy’s Exascale Computing Project (ECP), Rice University has been refining its HPCToolkit performance tools to better support measurement and analysis of applications executing on exascale supercomputers. To efficiently collect performance measurements of GPU-accelerated applications, HPCToolkit employs novel non-blocking data structures to communicate performance measurements between tool threads and application threads. To attribute performance information in detail to source lines, loop nests, and inlined call chains, HPCToolkit performs parallel analysis of large CPU and GPU binaries involved in the execution of an exascale application to rapidly recover mappings between machine instructions and source code. To analyze terabytes of performance measurements gathered during executions at exascale, HPCToolkit employs distributed-memory parallelism, multithreading, sparse data structures, and out-of-core streaming analysis algorithms. To support interactive exploration of profiles up to terabytes in size, HPCToolkit’s hpcviewer graphical user interface uses out-of-core methods to visualize performance data. The result of these efforts is that HPCToolkit now supports collection, analysis, and presentation of profiles and traces of GPU-accelerated applications at exascale. These improvements have enabled HPCToolkit to efficiently measure, analyze and explore terabytes of performance data for executions using as many as 64K MPI ranks and 64K GPU tiles on ORNL’s Frontier supercomputer. HPCToolkit’s support for measurement and analysis of GPU-accelerated applications has been employed to study a collection of open-science applications developed as part of ECP. This paper reports on these experiences, which provided insight into opportunities for tuning applications, strengths and weaknesses of HPCToolkit itself, as well as unexpected behaviors in executions at exascale.

Adhianto, Laksono↗
DOE OSTI2023

Demonstration of Pronghorn’s Subchannel Code Modeling of Liquid-Metal Reactors and Validation in Normal Operation Conditions and Blockage Scenarios

Pronghorn-SC is a subchannel code within the Multiphysics Object-Oriented Simulation Environment (MOOSE). Initially designed to simulate flows in water-cooled, square lattice, subchannel assemblies, Pronghorn-SC has been expanded to simulate liquid-metal-cooled flows in triangular lattices, hexagonal subchannel assemblies. For this purpose, the algorithm of Pronghorn-SC was adapted to solve the subchannel equations as they are applicable to a hexagonal wire-wrapped sodium-cooled fast reactor. Cheng–Todreas models for pressure drop and cross-flow models were adopted and a coolant heat conduction term was added. To solve these equations, an improved implicit algorithm was developed robust enough to deal with the numerical issues, associated with low flow and recirculation phenomena. To confirm the prediction capability of Pronghorn-SC, calculations and comparisons with available experimental data of 19- and 37-pin assemblies were performed, as well as other subchannel codes. Finally, a flow blockage modeling feature was added. This capability was validated for both water-cooled square sub-assemblies and sodium-cooled hexagonal sub-assemblies, using experimental data of partially and fully blocked cases.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Increased accuracy of multiphysics simulations through flexible execution, transient algorithms, and modular physics

The MOOSE framework is a foundational capability used by the NEAMS program to create over 15 different simulation tools for advanced nuclear reactors. Due to MOOSE’s broad use, improvements to the framework in support of modeling and simulation goals are critical to the program. Such improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work described in this report was conducted in direct support of the simulation tools and has already been deployed. The capabilities were implemented in the same order as they are covered in this report: multiple time integrators in the same input file, initial design of framework Components, an input file Application block, extension of NetGen to 3D geometries in MOOSE, and deployment of executors in the multi-system paradigm. These five additions are fundamental capabilities that will be leveraged by many NEAMS applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Tailoring Molecular Space to Navigate Phase Complexity in Cs-Based Quasi-2D Perovskites via Gated-Gaussian-Driven High-Throughput Discovery

Cesium-based quasi-2D halide perovskites (HPs) offer promising functionalities and low-temperature manufacturability, suited to stable tandem photovoltaics. However, the chemical interplays between the molecular spacers and the inorganic building blocks during crystallization cause substantial phase complexities in the resulting matrices. To successfully optimize and implement the quasi-2D HP functionalities, a systematic understanding of spacer chemistry, along with the seamless navigation of the inherently discrete molecular space, is necessary. Herein, by utilizing high-throughput automated experimentation, the phase complexities in the molecular space of quasi-2D HPs are explored, thus identifying the chemical roles of the spacer cations on the synthesis and functionalities of the complex materials. Furthermore, a novel active machine learning algorithm leveraging a two-stage decision-making process, called gated Gaussian process Bayesian optimization is introduced, to navigate the discrete ternary chemical space defined with two distinctive spacer molecules. Through simultaneous optimization of photoluminescence intensity and stability that “tailors” the chemistry in the molecular space, a ternary-compositional quasi-2D HP film realizing excellent optoelectronic functionalities is demonstrated. Finally, this work not only provides a pathway for the rational and bespoke design of complex HP materials but also sets the stage for accelerated materials discovery in other multifunctional systems.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Robust Learning with Implicit Residual Networks

In this effort, we propose a new deep architecture utilizing residual blocks inspired by implicit discretization schemes. As opposed to the standard feed-forward networks, the outputs of the proposed implicit residual blocks are defined as the fixed points of the appropriately chosen nonlinear transformations. We show that this choice leads to the improved stability of both forward and backward propagations, has a favorable impact on the generalization power, and allows for control the robustness of the network with only a few hyperparameters. In addition, the proposed reformulation of ResNet does not introduce new parameters and can potentially lead to a reduction in the number of required layers due to improved forward stability. Finally, we derive the memory-efficient training algorithm, propose a stochastic regularization technique, and provide numerical results in support of our findings.

Reshniak, Viktor↗
DOE OSTI2021

A coupled discontinuous Galerkin-Finite Volume framework for solving gas dynamics over embedded geometries

Herein, we present a computational framework for solving the equations of inviscid gas dynamics using structured grids with embedded geometries. The novelty of the proposed approach is the use of high-order discontinuous Galerkin (dG) schemes and a shock-capturing Finite Volume (FV) scheme coupled via an hp adaptive mesh refinement (hp-AMR) strategy that offers high-order accurate resolution of the embedded geometries. The hp-AMR strategy is based on a multi-level block-structured domain partition in which each level is represented by block-structured Cartesian grids and the embedded geometry is represented implicitly by a level set function. The intersection of the embedded geometry with the grids produces the implicitly-defined mesh that consists of a collection of regular rectangular cells plus a relatively small number of irregular curved elements in the vicinity of the embedded boundaries. High-order quadrature rules for implicitly-defined domains enable high-order accuracy resolution of the curved elements with a cell-merging strategy to address the small-cell problem. The hp-AMR algorithm treats the system with a second-order finite volume scheme at the finest level to dynamically track the evolution of solution discontinuities while using dG schemes at coarser levels to provide high-order accuracy in smooth regions of the flow. On the dG levels, the methodology supports different orders of basis functions on different levels. The space-discretized governing equations are then advanced explicitly in time using high-order Runge-Kutta algorithms. Numerical tests are presented for two-dimensional and three-dimensional problems involving an ideal gas. The results are compared with both analytical solutions and experimental observations and demonstrate that the framework provides high-order accuracy for smooth flows and accurately captures solution discontinuities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Practical Introduction to Benchmarking and Characterization of Quantum Computers

Rapid progress in quantum technology has transformed quantum computing and quantum information science from theoretical possibilities into tangible engineering challenges. Breakthroughs in quantum algorithms, quantum simulations, and quantum error correction are bringing useful quantum computation closer to fruition. These remarkable achievements have been facilitated by advances in quantum characterization, verification, and validation (QCVV). QCVV methods and protocols enable scientists and engineers to scrutinize, understand, and enhance the performance of quantum information-processing devices. In this tutorial, we review the fundamental principles underpinning QCVV, and introduce a diverse array of QCVV tools used by quantum researchers. We define and explain QCVV’s core models and concepts—quantum states, measurements, and processes—and illustrate how these building blocks are leveraged to examine a target system or operation. We survey and introduce protocols ranging from simple qubit characterization to advanced benchmarking methods. Along the way, we provide illustrated examples and detailed descriptions of the protocols, highlight the advantages and disadvantages of each, and discuss their potential scalability to future large-scale quantum computers. This tutorial serves as a guidebook for researchers unfamiliar with the benchmarking and characterization of quantum computers, and also as a detailed reference for experienced practitioners.

open quantum systems & decoherence↗
DOE OSTI2026

Using Filter Methods to Guide Convergence for ADMM, with Applications to Nonnegative Matrix Factorization Problems

Nonconvex, nonlinear optimization problems arise naturally in parameter fitting and machine learning. While augmented Lagrangian methods have demonstrated robust convergence for classes of these problems, their convergence for block updates has been relatively unexplored outside of the context of the alternating direction method of multipliers (ADMM). ADMM has seen extensive use in these applications, but may exhibit uncertain convergence behavior in many practical nonconvex settings, and struggles with general nonlinear constraints. In contrast, filter methods have proved effective in enforcing convergence for sequential quadratic programming methods and interior point methods with feasibility criteria. We develop an ADMM-filter method for highly nonlinear and nonconvex problems. Here, we show convergence under mild assumptions for several types of coordinate descent schemes, and demonstrate our algorithm on nonnegative matrix factorization and completion problems in imaging and chemical spectrum analysis.

Nonconvex optimization↗
DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗
DOE OSTI2020

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

AMReX: Block-structured adaptive mesh refinement for multiphysics applications

Block-structured adaptive mesh refinement (AMR) provides the basis for the temporal and spatial discretization strategy for a number of Exascale Computing Project applications in the areas of accelerator design, additive manufacturing, astrophysics, combustion, cosmology, multiphase flow, and wind plant modeling. AMReX is a software framework that provides a unified infrastructure with the functionality needed for these and other AMR applications to be able to effectively and efficiently utilize machines from laptops to exascale architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving accurate descriptions of different physical processes in complex multiphysics algorithms. AMReX supports algorithms that solve systems of partial differential equations in simple or complex geometries and those that use particles and/or particle–mesh operations to represent component physical processes. In this article, we will discuss the core elements of the AMReX framework such as data containers and iterators as well as several specialized operations to meet the needs of the application projects. In addition, we will highlight the strategy that the AMReX team is pursuing to achieve highly performant code across a range of accelerator-based architectures for a variety of different applications.

Zhang, Weiqun↗
DOE OSTI2022

Front-End Design for SiPM-Based Monolithic Neutron Double Scatter Imagers

Neutron double scatter imaging exploits the kinematics of neutron elastic scattering to enable emission imaging of neutron sources. Due to the relatively low coincidence detection efficiency of fast neutrons in organic scintillator arrays, imaging efficiency for double scatter cameras can also be low. One method to realize significant gains in neutron coincidence detection efficiency is to develop neutron double scatter detectors which employ monolithic blocks of organic scintillator, instrumented with photosensor arrays on multiple faces to enable 3D position and multi-interaction time pickoff. Silicon photomultipliers (SiPMs) have several advantageous characteristics for this approach, including high photon detection efficiency (PDE), good single photon time resolution (SPTR), high gain that translates to single photon counting capabilities, and ability to be tiled into large arrays with high packing fraction and photosensitive area fill factor. However, they also have a tradeoff in high uncorrelated and correlated noise rates (dark counts from thermionic emissions and optical photon crosstalk generated during avalanche) which may complicate event positioning algorithms. We have evaluated the noise characteristics and SPTR of Hamamatsu S13360-6075 SiPMs with low noise, fast electronic readout for integration into a monolithic neutron scatter camera prototype. The sensors and electronic readout were implemented in a small-scale prototype detector in order to estimate expected noise performance for a monolithic neutron scatter camera and perform proof-of-concept measurements for scintillation photon counting and three-dimensional event positioning.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Randomized Algorithms for Linear Solvers

Recently, randomized algorithms in numerical linear algebra, specifically those centered around random sketching, have gained traction in primarily theoretical research due to their potential to significantly reduce problem dimensionality at the cost of an O(1) multiplicative distortion factor. It has been assumed that this sketching can be done efficiently, but thorough investigation into how precisely to do it has been neglected. Moreover, the theory-based community has argued for sketching’s ability to reduce computational cost via complexity analysis, but has not researched how it affects the stability of the algorithms. At Sandia, efficient linear solvers that scale well on modern HPC architectures while maintaining stability are imperative for practical applications. In this LDRD, we developed a random sketching strategy that is substantially faster than existing ones, and demonstrate its superior performance in practice on a NVIDIA H100 GPU. Moreover, we show how this can be used to significantly outperform existing linear least squares solvers while improving the solver’s stability as well. Additionally, we demonstrate how this sketching strategy can be used to make a fast, stable QR factorization that can subsequently be used in s-step and block Krylov solvers. Finally, we incorporate a sketching-based block orthogonalization scheme into s-step GMRES, which is stable and faster than existing approaches on the Perlmutter supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Data Fusion for the Development of a Multimodal Freight Transload Facilities Dataset in the U.S.

To withstand the growing demand of commodity volume and its strain on the transportation infrastructure, it is necessary to identify the flow of commodities by route and mode. However, a national multimodal freight routing model does not exist for the U.S. The development of such model requires multiple building blocks, such as virtual representations of roadway, railway, and waterway networks, transload facilities (TFs), and access/egress links. Most of these blocks have a robust database in the U.S., except for the TFs. Here, this paper presents the fusion of dispersed and heterogeneous representations of multimodal TFs into a single, comprehensive, geospatial freight TF dataset. The TF dataset is derived from several sources, including the U.S. Army Corps of Engineers Master Docks Plus, the National Transportation Atlas Database, the Intermodal Association of North America, industry publications, and other public information. First, individual datasets were queried and reconciled. A geocoding/reverse geocoding process was applied to get the best street address and latitude/longitude location for each terminal. Then, duplicate terminals were identified by a fuzzy match algorithm based on terminal name and location, and removed. Validation was performed by visual inspection of random facilities. The main contributions of this work are: a publicly available version of the TF dataset, including facility location and multimodal transfer capability of 9,003 facilities, and an enterprise-version with the same facilities but including commodity handling capabilities. The main purpose of developing the TF dataset is to inform multimodal routing algorithms. The proposed TF dataset allows for credibly modeling the multimodal transfer of commodities within shipment routes.

Commodity Routing↗
DOE OSTI2025

Efficient analysis of small-angle scattering curves for large biomolecular assemblies using Monte Carlo methods

Structure elucidation from small-angle scattering curves of large biomolecular assemblies is notoriously challenging. This is because the simulation of high-resolution features in the structure of large macromolecular assemblies, such as de novo protein assemblies, is computationally demanding when it needs to cover a broad range of length scales. Conventional methods, such as the numerical approximation to the Debye equation or the use of spherical harmonics, do not scale well as the size of the assembly increases, which limits their application to small structures (e.g. individual proteins). This work explores the effectiveness of a Monte Carlo method to simulate and fit scattering curves for large biomolecular assemblies spanning over ranges covering atomic and molecular detail (e.g. spacing and orientation of proteins in an assembly) as well as large-scale (hundreds of nanometres) features. Owing to its speed and scalability, it can be combined with a fitting algorithm to extract structural features from experimental small-angle scattering curves in biomolecular assemblies that are otherwise intractable for interpretation. This work first demonstrates the effectiveness of the tool using experimental small-angle X-ray scattering (SAXS) data from tile-like proteins that assemble into 1D tube-like macromolecular structures. Here, the diameter distribution of tubes is extracted from SAXS fits, and this is quantitatively compared with distributions from electron microscopy. SAXS data are also obtained from 2D sheet-like protein assemblies, and the proposed method is used to quantify structural features such as the separation distance between protein building blocks and the flexing of the sheet. An open-source implementation of the methodology is provided for use in a broad range of biological systems involving multi-scale scattering analysis.

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

Simulating Catalysis with Realistic Pellet Geometries Using Mesoflow: A Case Study of Catalytic Propane Dehydrogenation

We present a case study of catalytic propane dehydrogenation with our open-source multiphysics solver, Mesoflow. The solver was developed to simulate reactive flow coupled to heterogeneous catalytic reactions and deactivation in the context of complex, mesoscale geometry. The method leverages cartesian block-structured adaptive mesh refinement to capture realistic catalyst microstructural features acquired directly from X-ray computed tomography data. A kinetic model for propane dehydrogenation and catalyst deactivation was developed based on temporal analysis of products (TAP) reactor experiments. The TAP reactor experiments allow for precise characterization of intrinsic kinetic reaction steps which are implemented into Mesoflow simulations to model the spatial and temporal evolution of reactants, products, and catalyst active sites. The short-term and long-term deactivation behavior is studied by using XCT data collected from fresh and aged catalyst pellets, which exhibit different microstructural features. This study employs time-splitting algorithms to connect disparate reaction and flow timescales, enabling the simulations to achieve realistic deactivation timescales on the order of minutes while the flow time-scales for small particles (100 microns) are several milliseconds. We also introduce a flexible automated python script that writes the necessary files to construct a Mesoflow simulation from user-created chemical mechanisms. We will also introduce a few new features that are added to Mesoflow such as higher order schemes, implicit chemistry integrators and the ability to run on AMD and NVIDIA graphics-processing-units.

AMReX↗
DOE OSTI2020

TensorFlow Quantum: A Software Framework for Quantum Machine Learning

We introduce TensorFlow Quantum (TFQ), an open source library for the rapid prototyping of hybrid quantum-classical models for classical or quantum data. This framework offers high-level abstractions for the design and training of both discriminative and generative quantum models under TensorFlow and supports high-performance quantum circuit simulators. We provide an overview of the software architecture and building blocks through several examples and review the theory of hybrid quantum-classical neural networks. We illustrate TFQ functionalities via several basic applications including supervised learning for quantum classification, quantum control, simulating noisy quantum circuits, and quantum approximate optimization. Moreover, we demonstrate how one can apply TFQ to tackle advanced quantum learning tasks including meta-learning, layerwise learning, Hamiltonian learning, sampling thermal states, variational quantum eigensolvers, classification of quantum phase transitions, generative adversarial networks, and reinforcement learning. We hope this framework provides the necessary tools for the quantum computing and machine learning research communities to explore models of both natural and artificial quantum systems, and ultimately discover new quantum algorithms which could potentially yield a quantum advantage.

Broughton, Michael↗
DOE OSTI2020

Joint Channel Equalization and Symbol Detection for IoT Devices in Severe Multipath Channels

Internet of Things (IoT) devices often transmit very short message blocks without strong error correction coding or pilots for channel equalization. When the transmitted signals encounter a severe multipath channel, the receiver is often unable to equalize the resulting inter-symbol interference (ISI) via traditional methods, leading to a high retransmission rate. This paper proposes a joint channel equalization and symbol detection scheme for this scenario by utilizing the preamble sequence as a training pilot for equalization and the relatively weak cyclic redundancy check (CRC) 8-Dallas code for error correction. By assuming a sparse channel impulse response, the proposed joint channel equalization and symbol detection scheme formulates an l1 norm constrained optimization problem and solves it by a saddle-point algorithm. The proposed algorithm is applied to a set of real-world underwater animal tracking IoT data, and the results show improvement of correct message detection rate from 21:5% to 41:6%.

Jing, Shusen↗