Search NASA⌕ Search

SEARCH · Search NASA

Results for “compression algorithms”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

ConnectIt: a framework for static and incremental parallel graph connectivity algorithms

Connected components is a fundamental kernel in graph applications. The fastest existing multicore algorithms for solving graph connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design choices have been left unexplored. In this paper, we design the ConnectIt framework, which provides different sampling strategies as well as various tree linking and compression schemes. ConnectIt enables us to obtain several hundred new variants of connectivity algorithms, most of which extend to computing spanning forest. In addition to static graphs, we also extend ConnectIt to support mixes of insertions and connectivity queries in the concurrent setting. We present an experimental evaluation of ConnectIt on a 72-core machine, which we believe is the most comprehensive evaluation of parallel connectivity algorithms to date. Compared to a collection of state-of-the-art static multicore algorithms, we obtain an average speedup of 12.4x (2.36x average speedup over the fastest existing implementation for each graph). Using ConnectIt, we are able to compute connectivity on the largest publicly-available graph (with over 3.5 billion vertices and 128 billion edges) in under 10 seconds using a 72-core machine, providing a 3.1x speedup over the fastest existing connectivity result for this graph, in any computational setting. For our incremental algorithms, we show that our algorithms can ingest graph updates at up to several billion edges per second. To guide the user in selecting the best variants in ConnectIt for different situations, we provide a detailed analysis of the different strategies. Finally, we show how the techniques in ConnectIt can be used to speed up two important graph applications: approximate minimum spanning forest and SCAN clustering.

Computer Science↗
DOE OSTI2021

Geometry and dynamics of passive scalar structures in compressible turbulent mixing

We present a structure-based numerical analysis of passive scalar mixing in decaying homogeneous isotropic turbulence (DHIT) and shock-turbulence interaction canonical configurations. The analysis focuses on the temporal evolution of ensembles of passive scalar structures, initialized as spheres of different sizes relative to the Taylor microscale. An algorithm is introduced to track the evolution of each individual structure and the interactions with other structures in the ensemble, relating changes in the surface geometry and the underlying physical processes (turbulent transport, scalar dissipation, and shock compression). The tracking algorithm is applied to datasets from shock-capturing direct numerical simulations of DHIT, with Taylor microscale Reynolds number Re λ =40 and turbulence Mach number M t =0.2 ⁠, and STI cases in which the turbulence is processed by a shock wave at Mach numbers M = 1.5 and 3.0. Temporal surface convolution increases for initially larger structures, resulting in a higher probability of locally hyperbolic geometries where breakup into smaller structures occurs. Shock-induced deformation of the structures amplifies breakup processes, enhancing mixing, particularly for larger structures. Mixing enhancement by the shock is manifested as an amplification of the surface-averaged scalar gradient, which increases for initially larger structures. The alignment between the scalar gradient and the most extensional strain-rate eigendirection on the scalar isosurfaces also increases across the shock. Larger magnitudes of the scalar gradient and its alignment with the most compressive strain-rate eigendirection correlate with flatter surface regions. Shock-induced structure compression increases the area coverage of flat regions, where the amplification of scalar gradient is localized.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Optimization of Error-Bounded Lossy Compression for Hard-to-Compress HPC Data

Since today’s scientific applications are producing vast amounts of data, compressing them before storage/transmission is critical. Results of existing compressors show two types of HPC data sets: highly compressible and hard to compress. In this work, we carefully design and optimize the error-bounded lossy compression for hard-tocompress scientific data. We propose an optimized algorithm that can adaptively partition the HPC data into best-fit consecutive segments each having mutually close data values, such that the compression condition can be optimized. Another significant contribution is the optimization of shifting offset such that the XOR-leading-zero length between two consecutive unpredictable data points can be maximized. We finally devise an adaptive method to select the best-fit compressor at runtime for maximizing the compression factor. We evaluate our solution using 13 benchmarks based on real-world scientific problems, and we compare it with 9 other state-of-the-art compressors. Experiments show that our compressor can always guarantee the compression errors within the user-specified error bounds. Most importantly, our optimization can improve the compression factor effectively, by up to 49% for hard-tocompress data sets with similar compression/decompression time cost.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Demonstration of a quantum-classical coprocessing protocol for simulating nuclear reactions

Quantum computers hold great promise for exact simulations of nuclear dynamical processes (e.g., scattering and reactions), which are paramount to the study of nuclear matter at the limit of stability and in the formation of chemical elements in stars. However, quantum simulations of the unitary (real) time dynamics of fermionic many-body systems require a currently prohibitive number of reliable and long-lived qubits. Here we propose a co-processing algorithm for the simulation of real-time dynamics in which the time evolution of the spatial coordinates is carried out on a classical processor, while the evolution of the spin degrees of freedom is carried out on quantum hardware. We demonstrate this hybrid scheme with the simulation of two neutrons scattering at the Lawrence Berkeley National Laboratory's Advanced Quantum Testbed. After implementing error mitigation strategies to improve the accuracy of the algorithm in addition to a combination of circuit compression techniques and tomography as methods to elucidate the onset of decoherence, our results validate the principle of the proposed co-processing scheme. A generalization of this present scheme will open the way for (real-time) path integral simulations of nuclear scattering.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers

The accurate first-principles description of strongly correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians that maintain the essential physics of strongly correlated materials. The solution of these material-specific models is still exponentially difficult to generate on classical computers, but quantum algorithms allow for a significant speed-up in obtaining the ground states of these compressed Hamiltonians. Here, we demonstrate that using quantum algorithms to obtain the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions. By combining ab initio downfolding and variational quantum eigensolvers, we correctly predict the antiferromagnetic state of one-dimensional cuprate Ca 2 Cu O 3 , the excitonic ground state of monolayer W Te 2 , and the charge-ordered state of correlated metal Sr VO 3 . Numerical simulations using a classical tensor network implementation of variational quantum eigensolvers allow us to simulate large models with up to 54 qubits and encompassing up to four bands in the correlated subspace, which is indicative of the complexity that our framework can address. Through these methods we demonstrate the potential of classical preoptimization and downfolding techniques for enabling efficient materials simulation using quantum algorithms.

Alvertis, Antonios M. [NASA, Ames; LBNL, Berkeley]↗
DOE OSTI2019

DORI Reveals the Influence of Noncovalent Interactions on Covalent Bonding Patterns in Molecular Crystals Under Pressure

The study of organic molecular crystals under high pressure provides fundamental insight into crystal packing distortions and reveals mechanisms of phase transitions and the crystallization of polymorphs. These solid-state transformations can be monitored directly by analyzing electron charge densities that are experimentally obtained at high pressure. However, restricting the analysis to the featureless electron density does not reveal the chemical bonding nature and the existence of intermolecular interactions. This shortcoming can be resolved by the use of the DORI (density overlap region indicator) descriptor, which is capable of simultaneously detecting both covalent patterns and noncovalent interactions from electron density and its derivatives. Using the biscarbonyl[14]annulene crystal under pressure as an example, we demonstrate how DORI can be exploited on experimental electron densities to reveal and monitor changes in electronic structure patterns resulting from molecular compression. A novel approach based on a flood-fill-type algorithm is proposed for analyzing the topology of the DORI isosurface. This approach avoids the arbitrary selection of DORI isovalues and provides an intuitive way to assess how compression packing affects covalent bonding in organic solids.

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

TensorID v1.0

This Python software package includes new and efficient algorithms for satellite and core interpolative decomposition of tensor data. In general, these algorithms target high-dimensional data reduction and compression. The software is purely numerical and can be applied by others to many important sources of tensor data generated by computation or experiment.

Zhang, Yifan [Lawrence Berkeley National Laborator↗
DOE OSTI2018

Multilevel techniques for compression and reduction of scientific data—the univariate case

We present a multilevel technique for the compression and reduction of univariate data and give an optimal complexity algorithm for its implementation. A hierarchical scheme offers the flexibility to produce multiple levels of partial decompression of the data so that each user can work with a reduced representation that requires minimal storage whilst achieving the required level of tolerance. The algorithm is applied to the case of turbulence modelling in which the datasets are traditionally not only extremely large but inherently non-smooth and, as such, rather resistant to compression. Here, we decompress the data for a range of relative errors, carry out the usual analysis procedures for turbulent data, and compare the results of the analysis on the reduced datasets to the results that would be obtained on the full dataset. The results obtained demonstrate the promise of multilevel compression techniques for the reduction of data arising from large scale simulations of complex phenomena such as turbulence modelling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l-∝ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. Additionally, we further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Digital encoding algorithm for pixelated detectors

A detector for imaging and efficiently digitizing a spatial distribution of photon flux includes pixel circuits that compressively encode pixel values generated by integrated analog to digital converters (ADCs). On-pixel digital compression circuits (DCCs) implement compression to increase continuous frame rate by reducing the number of bits per pixel while keeping quantization error below Poisson noise. Several mapping algorithms for photon-counting and charge-integrating detectors and compact digital logic implementations are presented.

Hammer, Michael P.↗
DOE OSTI2018

Design Principles for Sparse Matrix Multiplication on the GPU

We implement two novel algorithms for sparse-matrix dense-matrix multiplication (SpMM) on the GPU. Our algorithms expect the sparse input in the popular compressed-sparse-row (CSR) format and thus do not require expensive format conversion. While previous SpMM work concentrates on thread-level parallelism, we additionally focus on latency hiding with instruction-level parallelism and load-balancing. We show, both theoretically and experimentally, that the proposed SpMM is a better fit for the GPU than previous approaches. We identify a key memory access pattern that allows efficient access into both input and output matrices that is crucial to getting excellent performance on SpMM. By combining these two ingredients---(i) merge-based load-balancing and (ii) row-major coalesced memory access---we demonstrate a 4.1x peak speedup and a 31.7% geomean speedup over state-of-the-art SpMM implementations on real-world datasets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

REYNO: A Reactive Hydrodynamics Modeling Suite

REYNO is a Python library that is primarily designed as a platform for the agile development and testing of novel reactive flow models. Equations of state and multi-step rate laws can be implemented using the provided class hierarchy with different thermodynamic closure conditions. The library includes a one-dimensional Lagrangian hydrodynamic solver to simulate multi-material reactive or inert problems in planar, cylindrical, or spherical coordinates. Custom time-dependent boundary conditions are also available for problems such as ramp compression. This document describes the different numerical methods and algorithms that are included in REYNO.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Large Scale Tensor Factorization via Parallel Sketches

Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.

block term decomposition↗
DOE OSTI2023

Computational diagnostics for flame acceleration and transition to detonation in a hydrogen/air mixture

A new computational diagnostic method for pressure-induced compressibility is proposed by projecting its local contribution to the chemical explosive mode (CEM) in the chemical explosive mode analysis (CEMA) framework. The new method is validated for the study of detonation development during the deflagration-to-detonation transition (DDT) process. The flame characteristics are identified through the quantification of individual CEM contributions of chemical reaction, diffusion, and pressure-induced compressibility. Numerical simulations are performed to investigate the DDT processes in a stoichiometric hydrogen-air mixture. A Godunov algorithm, fifth-order in space, and third-order in time are used to solve the fully compressible Navier-Stokes equations on a dynamically adapting mesh. A single-step, calibrated chemical diffusive model (CDM) described by Arrhenius kinetics is used for energy release and conservation between the fuel and the product. The new diagnostic method is first applied to onedimensional (1D) canonical flame configurations followed by two-dimensional (2D) simulations of DDT in an obstructed channel where different detonation initiation scenarios are examined using the new CEMA projection formulation. Detailed examinations of the idealized configuration of detonation initiation through shock focusing mechanism at a flame front are also studied using the new formulation. A comparison of the currently proposed CEMA projection and the original formulation by the authors suggests that including the pressure-induced compressibility is essential for the use of CEMA in DDT process. The results also show that the new formulation of CEMA projection can successively capture the detonation initiation through either a gradient mechanism or a direct initiation mechanism, and therefore can be used as an effective local analytical tool for the computational diagnostics of detonation initiation in a DDT process. It was found that detonation development is characterized by a strong contribution of chemistry role to the CEM which is pivotal to the initiation of detonation. The role of compressibility is found enhanced at the edge of the detonation front where diffusion was found to have minimal effects on detonation development.

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

Model predictive combustion control of a Gasoline Compression Ignition engine

Gasoline Compression Ignition is a novel combustion concept that derives its superiority from the high compression ratio of a compression ignition engine as well as the properties of gasoline fuel, such as longer ignition delay and higher volatility compared to diesel. Here, this combustion concept was experimentally tested on a 12.4L Class 8 truck engine. Based on these experimental data, prior efforts by the authors focused on the development of an engine model for a heavy-duty engine operating on a low-reactivity fuel. This engine model was leveraged within this study to investigate a combustion control strategy at different engine conditions and injection methods and was augmented to incorporate cycle-to-cycle combustion variations. State estimation is performed by means of a Kalman filter which feeds into a model predictive controller. The model predictive controller chooses control actions based on a predefined cost function under consideration of bounds reflecting physical constraints. The engine model was utilized to establish a state-space model that serves the Kalman filter and model predictive controller for estimation and prediction. A comparative study investigating control actions and engine behavior was performed with and without limiting in-cylinder peak pressure as well as combustion noise, which is of particular interest for early pilot injection strategies. In addition, the proposed control architecture was investigated at two different levels of cycle-to-cycle variations and compared to the performance of a control structure with input disturbance rejection. For increased cycle-to-cycle variations, disturbance estimation reduces state fluctuations and control effort. In general, this investigation highlights control aspects specific to a compression-ignited combustion regime with low-reactivity fuel. The control algorithm is able to maintain the desired references for brake mean effective pressure and combustion phasing while controlling peak in-cylinder pressure and combustion noise.

42 ENGINEERING↗
DOE OSTI2020

An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations

Here, we propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification, and low-rank compression. After eliminating all interiors at a given level of the elimination tree, the algorithm sparsifies all separators corresponding to the interiors. This operation reduces the size of the separators by eliminating some degrees of freedom but without introducing any fill-in. This is done at the expense of a small and controllable approximation error. The result is an approximate factorization that can be used as an efficient preconditioner. We then perform several numerical experiments to evaluate this algorithm. We demonstrate that a version using orthogonal factorization and block-diagonal scaling takes fewer CG iterations to converge than previous similar algorithms on various kinds of problems. Furthermore, this algorithm is provably guaranteed to never break down and the matrix stays symmetric positive-definite throughout the process. We evaluate the algorithm on some large problems show it exhibits near-linear scaling. The factorization time is roughly $\mathcal{O}$(N), and the number of iterations grows slowly with N.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Analyzing acoustic emission data to identify cracking modes in cement paste using an artificial neural network

This research is focused on the identification of cracking mechanisms for cement paste using acoustic emission data, recorded from compression and notched four-point bending tests. A procedure is developed for analyzing the data by employing an agglomerative hierarchical clustering method, an artificial neural network, and a ray-tracing source location algorithm. An agglomerative hierarchical clustering method is utilized to cluster the AE data from a compression test using frequency-dependent features. A neural network is trained using the compression test data and applied to the AE data emitted during the four-point bending test. The clustered data from the four-point bending test is localized using a ray-tracing algorithm. Based on the occurrence and locations of the clustered events and signal feature analyses, potential cracking mechanisms are identified and assigned.

36 MATERIALS SCIENCE↗
DOE OSTI2018

A high-order adaptive algorithm for multispecies gaseous flows on mapped domains

We report a fourth-order accurate finite-volume method is developed and verified for solving strongly nonlinear, time-dependent, compressible, thermally perfect, and multispecies gaseous flows on mapped grids that are adaptively refined in space and time. The algorithm introduces a new scheme for numerical flux calculations in order to cope with the nonlinear, spatially and temporally varying thermodynamic and transport properties of the gaseous mixture. The fourth-order numerical error convergence and solution accuracy are verified using Couette flow, species mass diffusion bubble, and vortex convection and diffusion problem. The thermally perfect, multispecies functionality is validated using a one-dimensional shock tube and two-dimensional shock box problem. Results are obtained for the Mach reflection problem where a strong shock propagates in the multispecies gaseous flow along a ramp and are compared to the solution of the shock propagation in a single species, calorically perfect, gaseous flow over the same ramp. The validated algorithm is then applied to simulate a relatively complex flow configuration to examine the secondary flow mixing due to the double air jets along with the main inlet where a premixed fuel mixture flows in. Future investigations will focus on three-dimensional configurations.

42 ENGINEERING↗