Search NASA⌕ Search

SEARCH · Search NASA

Results for “Block decomposition”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Probing surface-adsorbate interactions through active particle dynamics

Adsorbate molecules present in a reaction mixture may bind to and block catalytic sites. Measurement of the surface coverage of these molecules via adsorption isotherms is critical for modeling and design of catalytic reactions on surfaces. However, it is challenging to measure isotherms in solution in a way that is directly relevant to catalytic activity under reaction conditions, particularly since adsorbates may bind with an enormous range of surface affinity parameters. Here we used the motion of self-propelled catalytic Janus particles, which employ the decomposition of hydrogen peroxide fuel as a propulsion mechanism, to determine the effective surface coverage of thioglycerol, furfural, and ethanol on a platinum surface as a function of concentration in aqueous solution by measuring the decrease in active motion due to the blocking of active sites. For strongly adsorbing thioglycerol, this effective coverage was compared and contrasted to the total adsorbed amount measured using inductively-coupled plasma analysis. Demonstrating the broad applicability of this approach, the surface affinity of the three adsorbates spanned more than four orders of magnitude. For each species, the adsorbate-mediated attenuation of active motion occurred over a wide concentration range and was well-described by a Langmuir isotherm. The strongly interacting thioglycerol had the highest affinity towards the surface (K a = 15.5 ± 4.3 mM –1 ) and fully deactivated the active particle motion at surface saturation. Furfural had an intermediate affinity (K a = 0.42 ± 0.07 mM –1 ) but did not fully block H 2 O 2 access to the surface at apparent saturation, consistent with a maximum fractional surface coverage of θ max = 0.67. Ethanol exhibited even lower affinity (K a = 0.0025 ± 2x10 -4 mM –1 ) and its coverage saturated at only θ max = 0.38. Analysis of isotherms at elevated temperatures enabled direct extraction of the enthalpies of adsorption. The degree of surface coverage at adsorbate saturation appeared to correlate with the relative energies of adsorption for the different adsorbate species and was consistent with adsorbate saturation of one of multiple active site populations towards H 2 O 2 decomposition. Furthermore, computational investigations into solvent effects on furfural adsorption showed good quantitative agreement with the experimental results. This work leverages unique properties of active particles to explore fundamental catalysis questions and demonstrates a novel paradigm for significant and experimentally accessible multidisciplinary research.

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

Scattering amplitudes for monopoles: pairwise little group and pairwise helicity

On-shell methods are particularly suited for exploring the scattering of electrically and magnetically charged objects, for which there is no local and Lorentz invariant Lagrangian description. In this paper we show how to construct a Lorentz-invariant S-matrix for the scattering of electrically and magnetically charged particles, without ever having to refer to a Dirac string. A key ingredient is a revision of our fundamental understanding of multi-particle representations of the Poincaré group. Surprisingly, the asymptotic states for electric-magnetic scattering transform with an additional little group phase, associated with pairs of electrically and magnetically charged particles. The corresponding “pairwise helicity” is identified with the quantized “cross product” of charges, e 1 g 2 - e 2 g 1 , for every charge-monopole pair, and represents the extra angular momentum stored in the asymptotic electromagnetic field. We define a new kind of pairwise spinor-helicity variable, which serves as an additional building block for electric-magnetic scattering amplitudes. We then construct the most general 3-point S-matrix elements, as well as the full partial wave decomposition for the 2 → 2 fermion-monopole S-matrix. In particular, we derive the famous helicity flip in the lowest partial wave as a simple consequence of a generalized spin-helicity selection rule, as well as the full angular dependence for the higher partial waves. Our construction provides a significant new achievement for the on-shell program, succeeding where the Lagrangian description has so far failed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Classical Non-Markovian Noise in Symmetry-Preserving Quantum Dynamics

In quantum dynamics, symmetries are vital for identifying and assessing conserved quantities that govern the evolution of a quantum system. When promoted to the open quantum system setting, dynamical symmetries can be negatively altered by system-environment interactions, thus, complicating their analysis. Previous work on noisy symmetric quantum dynamics has focused on the Markovian setting, despite the ubiquity of non-Markovian noise in a number of widely used quantum technologies. Here, in this Letter, we develop a framework for quantifying the impact of non-Markovian noise on symmetric quantum evolution via root space decompositions and the filter function formalism. We demonstrate analytically that symmetry-preserving noise maintains the symmetric subspace, while nonsymmetric noise leads to highly specific leakage errors that are block diagonal in the symmetry representation. We support our findings with numerical studies of a transverse-field Ising model and a quantum error detecting code subject to spatiotemporally correlated multiaxis noise. Our results are broadly applicable, providing new analytic insights into the control and characterization of open quantum system dynamics.

decoherence↗
DOE OSTI2024

Progressive Hedging Decomposition for Solutions of Large-Scale Process Family Design Problems

Rapid, wide-scale deployment of green process systems, such as carbon capture or water desalination systems, is essential for combatting climate change. Methods relying on traditional design or modularity fail to capture the benefits of both economies of numbers and economies of scale. We have proposed process family design, which designs a family of processes simultaneously exploiting opportunities for common elements. In previous work, we explored different optimization formulations to solve this problem. In this work, we develop a decomposition approach to tackle larger problems efficiently. We solve a water desalination case study, which is too large to solve within a reasonable timeframe with the discretization formulation. We exploit the block angular structure of the discretization problem to decompose and solve using Progressive Hedging (PH). We use the open-source Python package mpi-sppy to execute PH which allows us to leverage parallelization and a HPC cluster to further improve solution time.

Stinchfield, Georgia↗
DOE OSTI2020

A domain decomposition preconditioning for an inverse volume scattering problem

In this work, we propose domain decomposition preconditioners for the solution of an integral equation formulation of the acoustic forward and inverse scattering problems. We study both forward and inverse volume problems and propose preconditioning techniques to accelerate the iterative solvers. For the forward scattering problem, we extend the domain decomposition based preconditioning techniques presented for partial differential equations in Cai and Sarkis (1999 SIAM J. Sci. Comput. 21 792–797), to integral equations. We combine this domain decomposition preconditioner with a low-rank correction, which is easy to construct, forming a new preconditioner. For the inverse scattering problem, we use the forward problem preconditioner as a building block for constructing a preconditioner for the Gauss–Newton Hessian. We present numerical results that demonstrate the performance of both preconditioning strategies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data

In this paper, we propose a personalized Tucker decomposition (perTucker) to address the limitations of traditional tensor decomposition methods in capturing heterogeneity across different datasets. perTucker decomposes tensor data into shared global components and personalized local components. We introduce an order orthogonality assumption and develop a proximal gradient regularized block coordinate descent algorithm guaranteed to converge to a stationary point. The unique and common representations learned by perTucker reveal intrinsic statistical patterns in data and provide valuable information for a wide range of downstream analytics, including anomaly detection, source classification, and clustering. We demonstrate perTucker’s effectiveness through a simulation study and two case studies on solar flare detection and tonnage signal classification.

14 SOLAR ENERGY↗
DOE OSTI2022

Feynman rules for scalar conformal blocks

We complete the proof of “Feynman rules” for constructing M-point conformal blocks with external and internal scalars in any topology for arbitrary M in any spacetime dimension by combining the rules for the blocks (based on their Witten diagram interpretation) with the rules for the construction of conformal cross ratios (based on the OPE and “flow diagrams”). The full set of Feynman rules leads to blocks as power series of the hypergeometric type in the conformal cross ratios. We then provide a proof by recursion of the Feynman rules which relies heavily on the first Barnes lemma and the decomposition of the topology of interest in comb structures. Finally, we provide a nine-point example to illustrate the rules.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Permutation-adapted complete and independent basis for atomic cluster expansion descriptors

Atomic cluster expansion (ACE) methods provide a systematic way to describe particle local environments of arbitrary body order. For practical applications it is often required that the basis of cluster functions be symmetrized with respect to rotations and permutations. Existing methodologies yield sets of symmetrized functions that are over-complete. These methodologies thus require an additional numerical procedure, such as singular value decomposition (SVD), to eliminate redundant functions. In this work, it is shown that analytical linear relationships for subsets of cluster functions may be derived using recursion and permutation properties of generalized Wigner symbols. From these relationships, subsets (blocks) of cluster functions can be selected such that, within each block, functions are guaranteed to be linearly independent. It is conjectured that this block-wise independent set of permutation-adapted rotation and permutation invariant (PA-RPI) functions forms a complete, independent basis for ACE. Along with the first analytical proofs of block-wise linear dependence of ACE cluster functions and other theoretical arguments, numerical results are offered to demonstrate this. The utility of the method is demonstrated in the development of an ACE interatomic potential for tantalum. Using the new basis functions in combination with Bayesian compressive sensing sparse regression, some high degree descriptors are observed to persist and help achieve high-accuracy models.

Angular momentum↗
DOE OSTI2021

Low Temperature Water-Gas Shift: Enhancing Stability through Optimizing Rb Loading on Pt/ZrO 2

Recent studies have shown that appropriate levels of alkali promotion can significantly improve the rate of low-temperature water gas shift (LT-WGS) on a range of catalysts. At sufficient loadings, the alkali metal can weaken the formate C–H bond and promote formate dehydrogenation, which is the proposed rate determining step in the formate associative mechanism. In a continuation of these studies, the effect of Rb promotion on Pt/ZrO 2 is examined herein. Pt/ZrO 2 catalysts were prepared with several different Rb loadings and characterized using temperature programmed reduction mass spectrometry (TPR-MS), temperature programmed desorption (TPD), diffuse reflectance infrared Fourier transform spectroscopy (DRIFTS), an X-ray absorption near edge spectroscopy (XANES) difference procedure, extended X-ray absorption fine structure spectroscopy (EXAFS) fitting, TPR-EXAFS/XANES, and reactor testing. At loadings of 2.79% Rb or higher, a significant shift was seen in the formate ν(CH) band. The results showed that a Rb loading of 4.65%, significantly improves the rate of formate decomposition in the presence of steam via weakening the formate C–H bond. However, excessive rubidium loading led to the increase in stability of a second intermediate, carbonate and inhibited hydrogen transfer reactions on Pt through surface blocking and accelerated agglomeration during catalyst activation. Optimal catalytic performance was achieved with loadings in the range of 0.55–0.93% Rb, where the catalyst maintained high activity and exhibited higher stability in comparison with the unpromoted catalyst.

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

Revisiting the Bonding Model for Gold(I) Species: The Importance of Pauli Repulsion Revealed in a Gold(I)–Cyclobutadiene Complex

Understanding the bonding of gold(I) species has been central to the development of gold(I) catalysis. Herein, we present the synthesis and characterization of the first gold(I)-cyclobutadiene complex, accompanied with bonding analysis by state-of-the-art energy decomposition analysis methods. Analysis of possible coordination modes for the new species not only confirms established characteristics of gold(I) bonding, but also suggests that Pauli repulsion is a key yet hitherto overlooked element. Additionally, we obtain a new perspective on gold(I)-bonding by comparison of the gold(I)-cyclobutadiene to congeners stabilized by p-, d-, and f-block metals. Consequently, we refine the gold(I) bonding model, with a delicate interplay of Pauli repulsion and charge transfer as the key driving force for various coordination motifs. Finally, Pauli repulsion is similarly determined as a significant interaction in Au I -alkyne species, corroborating this revised understanding of Au I bonding.

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

The MP{sub N} method: a new angular discretization method based on piecewise polynomial interfaces fluxes

In transport calculations, it is well known how S{sub N} method is extremely inefficient in problems where the particle physics is dominated by streaming. The ray-effect eventually produced by the insufficient angular discretization, appears to be extremely persistent with respect to the refinement of the angular quadrature. The MP{sub N} method, that relies on continuous angular representation, offers a robust remedy to such an issue. MP{sub N} is based on the decomposition of the unit sphere into solid angles and on a piecewise continuous definition of interface fluxes, which are expanded in polynomials in each solid angle. This allows propagating more than one angular degree of freedom simultaneously while maintaining unaltered the block-diagonal pattern of the displacement plus removal operator. The method is therefore well suited for the flux resolution by means of a conventional sweep algorithm. Furthermore, unlike the S{sub N} method, MP{sub N} does not rely on discrete directions and, thus, on an angular quadrature formula, but rather constructs a set of linear equations solving for the angular moments of the flux for all discrete solid angles within the sweep. MP{sub N} shows an error convergence rate higher than S{sub N} at the expense of an increased size of the coefficient matrices, so of the computational cost. Although MP{sub N} is not free from ray-effect, the latter is effectively mitigated and less persistent with respect to the increase of the angular refinement order. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Mitigating electrochemical degradation in CsPbBr{sub 3} gamma detectors by organic and inorganic encapsulation.

CsPbBr3 perovskite semiconductors have emerged as a leading candidate for nextgeneration radiation detectors because of their exceptional charge transport properties, defect tolerance, and record-breaking sensitivity and energy resolution. Their long-term stability, however, is hindered by electrode-driven electrochemical decomposition, which is accelerated by moisture- and oxygen-assisted ion migration during operation. Here, we investigated organic and inorganic encapsulation strategies as both environmental barriers and means to suppress interfacial degradation pathways. Atomic layer deposition (ALD) of Al2O3 provided a conformal passivation layer that blocked environmental ingress, suppressed ionic diffusion, reduced leakage current, enhanced energy resolution and expanded the operational electric-field window beyond 5 kV∙cm1 . By contrast, organic encapsulants such as paraffin wax and polystyrene slowed moisture diffusion but did not suppress interfacial reactions, with wax extending stability to over 90 days. These results show that ALD-Al2O3 suppresses dominant interfacial degradation pathways, enabling stable, high-field operation and advancing the practical deployment of CsPbBr3 γ-ray detectors.

Unal, Mustafa↗
DOE OSTI2022

Nanoscale Mapping and Defect-Assisted Manipulation of Surface Plasmon Resonances in 2D Bi 2 Te 3 /Sb 2 Te 3 In-Plane Heterostructures

Here, the Bi 2 Te 3 /Sb 2 Te 3 in-plane heterostructure is reported as a low-dimensional tunable chalcogenide well suited as plasmonic building block for the visible-UV spectral range. Electron-driven plasmon excitations of low-dimensional Bi 2 Te 3 /Sb 2 Te 3 are investigated by monochromated electron energy loss spectroscopy spectrum imaging. To resolve the nanoscale spatial distribution of various local plasmonic resonances, singular value decomposition is used to disentangle the spectral data and identify the individual spectral contributions of various corner, edge, and face modes. Furthermore, defect-plasmon interactions are investigated both for nanoscale intrinsic and thermally induced extrinsic polygonal defects (in situ sublimation). Signature of defect-induced red shift ranging from a several hundreds of millielectronvolts to a few electronvolts, broadening of various plasmon response, together with selective enhancement and significant variations in their intensity are detected. This study highlights the presence of a heterointerface and identifies defects as physical tuning pathways to modulate the plasmonic response over a broad spectral range. Finally, the experimental observations are compared qualitatively and validated with numerical simulations using the electron-driven discrete dipole approximation. Low-dimensional Bi 2 Te 3 /Sb 2 Te 3 as a less explored plasmonic system holds great promises as emerging platform for integrated plasmonics. Furthermore, introducing controlled structural defects can open the door for nanoengineering of plasmonic properties in such systems.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Multi-physics Preconditioning for Thermally Activated Batteries

Thermal batteries, also known as molten-salt batteries, are single-use reserve power systems activated by pyrotechnic heat generation, which transitions the solid electrolyte into a molten state. The simulation of these batteries relies on multiphysics modeling to evaluate performance and behavior under various conditions. This paper presents advancements in scalable preconditioning strategies for the Thermally Activated Battery Simulator (TABS) tool, enabling efficient solutions to the coupled electrochemical systems that dominate computational costs in thermal battery simulations. We propose a hierarchical block Gauss-Seidel preconditioner implemented through the Teko package in Trilinos, which effectively addresses the challenges posed by tightly coupled physics, including charge transport, porous flow, and species diffusion. The preconditioner leverages scalable subblock solvers, including smoothed aggregation algebraic multigrid (SA-AMG) methods and domain-decomposition techniques, to achieve robust convergence and parallel scalability. Strong and weak scaling studies demonstrate the solver’s ability to handle problem sizes up to 51.3 million degrees of freedom on 2048 processors, achieving near sub-second setup and solve times for the end-to-end electrochemical solve. These advancements significantly improve the computational efficiency and turnaround time of thermal battery simulations, paving the way for higher-resolution models and enabling the transition from 2D axisymmetric to full 3D simulations.

25 ENERGY STORAGE↗