Search NASA⌕ Search

SEARCH · Search NASA

Results for “Compression methods”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Comparison of Artificial Compressibility Methods for Coupled Laminar Fluid Flow and Heat Transfer

Artificial compressibility (AC) methods for incompressible flows perturb the mass continuity equation by the time derivative of the pressure field to achieve direct coupling between pressure and velocity without the need for a projection method. Several variations of the original AC method have been proposed (e.g., the entropically damped artificial compressibility [EDAC] method) that can, in some scenarios, improve on the original model. In this paper, we methodically compare the results of the original AC model and the EDAC model for both steady-state and transient problems with coupling between the momentum and energy equations. We demonstrate that the EDAC model and the AC model yield similar numerical results, and the EDAC model is 10%-20% faster than the AC model for a given problem.

Oz, Furkan [ORNL] (ORCID:0000000265831724)↗
DOE OSTI2023

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Full Modeling and parameter compression methods in configuration space for DESI 2024 and beyond

In the contemporary era of high-precision spectroscopic surveys, led by projects like DESI, there is an increasing demand for optimizing the extraction of cosmological information from clustering data. This work conducts a thorough comparison of various methodologies for modeling the full shape of the two-point statistics in configuration space. We investigate the performance of both direct fits (Full Modeling) and the parameter compression approaches (ShapeFit and Standard). We utilize the ABACUS-SUMMIT simulations, tailored to exceed DESI's precision requirements. Particularly, we fit the two-point statistics of three distinct tracers (LRG, ELG, and QSO), by employing a Gaussian Streaming Model in tandem with Convolution Lagrangian Perturbation Theory and Effective Field Theory. We explore methodological setup variations, including the range of scales, the set of galaxy bias parameters, the inclusion of the hexadecapole, as well as model extensions encompassing varying ns and allowing for w 0 w a CDM dark energy model. Throughout these varied explorations, while precision levels fluctuate and certain configurations exhibit tighter parameter constraints, our pipeline consistently recovers the parameter values of the mocks within 1σ in all cases for a 1-year DESI volume. Additionally, we compare the performance of configuration space analysis with its Fourier space counterpart using three models: PyBird, FOLPS and velocileptors, presented in companion papers. We find good agreement with the results from all these models.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Real-time and post-hoc compression for data from Distributed Acoustic Sensing

Distributed Acoustic Sensing (DAS) is an emerging sensing technology that records the strain-rate along fiber optic cables at high spatial and temporal resolution. This technique is becoming a popular tool in seismology, hydrology, and other subsurface monitoring applications. However, due to the large coverage (10’s of km) and high density of measurements (1m spacing at 100’s of Hz), a DAS installation could produce terabytes of data records per day. Because many DAS instruments are deployed in remote locations, this large data size poses significant challenges to its transfer and storage. In this paper, we explore lossless compression methods to reduce the storage requirement in both real-time and post-hoc scenarios. Here we propose a two-stage compression method to improve the compression ratio and compression speed. This two-stage compression method could reduce the storage requirement by 40%, which is 20% more than other lossless methods, such as ZSTD. We demonstrate that the compression method could complete its operation well before the DAS instrument needs to output the next file, making it suitable for real-time DAS acquisition. We also implement a parallel compression method for a post-hoc scenario and demonstrate that our method could effectively utilize a parallel computer. With 256 CPU cores, our parallel compression method achieves the speed of 26GB/second.

58 GEOSCIENCES↗
DOE OSTI2025

Compressed sensing methods with applications to advanced air sampling

Environmental sampling methods developed by the Savannah River National Laboratory (SRNL) employ collectors with sorbent media tubes set at various locations to collect airborne emissions. Laboratory analyses of these tubes results in one-dimensional signals regarding what chemicals are being released and transported within the atmosphere. The analysis process is time consuming especially when analyzing a full year’s worth of tubes (hourly sample collection results in nearly 9,000 tubes per year). Using a signal processing method such as compressed sensing allows for recreation of the full signal while greatly reducing the number of analyzed samples required. Due to the sparsity of data retrieved from the air tubes, it is possible to use measurements a fraction of the size of the original data to gain much of the same information. This would improve the overall time and cost of analysis when modeling one-dimensional sampling signals.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Compressed Sensing Methods with Applications to Advanced Air Sampling [Poster]

Environmental sampling methods developed by the Savannah River National Laboratory (SRNL) employ collectors with sorbent media tubes set at various locations to collect airborne emissions. Laboratory analyses of these tubes results in one-dimensional signals regarding what chemicals are being released and transported within the atmosphere. The analysis process is time consuming especially when analyzing a full year’s worth of tubes (hourly sample collection results in nearly 9,000 tubes per year). Using a signal processing method such as compressed sensing allows for recreation of the full signal while greatly reducing the number of analyzed samples required. Due to the sparsity of data retrieved from the air tubes, it is possible to use measurements a fraction of the size of the original data to gain much of the same information. This would improve the overall time and cost of analysis when modeling one-dimensional sampling signals.

Campbell, Cassidy [Savannah River National Laborat↗
DOE OSTI2022

Electronic device and method for compressing video data

A computer-implemented method for compressing video data comprises receiving a sequence of video data values, each video data value being a digital value from a successive one of a plurality of pixels that form a video sensor, the sequence of video data values resulting from successive frames of video captured by the video sensor; extracting the video data values for each pixel in turn to create a plurality of pixel data streams, each pixel data stream including the video data value for each frame of captured video for the pixel; and applying data compression to each pixel data stream to create compressed data for each pixel data stream.

Tohlen, Michael Aaron↗
DOE OSTI2023

Electronic device and method for compressing video data

A computer-implemented method for compressing video data comprises receiving a sequence of video data values, each video data value being a digital value from a successive one of a plurality of pixels that form a video sensor, the sequence of video data values resulting from successive frames of video captured by the video sensor; extracting the video data values for each pixel in turn to create a plurality of pixel data streams, each pixel data stream including the video data value for each frame of captured video for the pixel; and applying data compression to each pixel data stream to create compressed data for each pixel data stream.

Tohlen, Michael Aaron↗
DOE OSTI2020

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

A discontinuous Galerkin spectral element method for compressible reacting flows

High-order methods have recently been shown to be an effective tool for high-fidelity flow computations like direct numerical simulations and large-eddy simulations because of their strong balance between accuracy and computational cost. In this work, a high-order discontinuous Galerkin spectral element method (DGSEM) is developed to solve the chemically reacting Navier-Stokes equations. To handle the disparate length and time scales associated with these equations, we develop a novel method which combines the spectral accuracy of the SEM with the flexibility of the DG approach. The framework, implemented in the spectral element code Nek5000, is well suited to capture turbulence in smooth regions of the flow, while maintaining numerical stability in the presence of shocks. An entropy-residual based artificial viscosity is added to smooth shocked regions of flow, and a positivity-preserving limiter is implemented to suppress non-physical oscillations. These enhancements support the numerical stability of the hydrodynamic sub-step, which is decoupled from the chemistry integration through a second-order operator splitting method. Here, a series of smooth and discontinuous validation cases are presented in increasing physical and computational complexity for both inviscid and viscous flows. In particular, simulations of canonical one-dimensional and two-dimensional detonations are performed, and the high-order numerical results are validated against available literature data. Additional validation studies are carried out for classical three-dimensional numerical simulations of incompressible and compressible turbulent flows.

Compressible reacting flows↗
DOE OSTI2025

A High-Order Discontinuous Galerkin Spectral Element Method for Compressible Reacting Flows

High-order methods have recently been shown to be an effective tool for high-fidelity flow computations like direct numerical simulations and large eddy simulations due to their strong balance between accuracy and computational cost. In this work, a high-order discontinuous Galerkin spectral element method (DGSEM) is developed to solve the chemically reactive Euler equations encountered in high-speed combustion. To handle the disparate length and time scales associated with these equations, we develop a novel method which combines the spectral accuracy of the SEM with the flexibility of DG approach. Thus, the framework is well suited to capture turbulence in smooth regions of the flow, while maintaining numerical stability in the presence of shocks. The numerical method is implemented within the spectral element solver Nek5000. Validation cases are conducted for both non-reactive and reactive discontinuous flows to demonstrate the solver capability. In particular, canonical one-dimensional and two-dimensional detonation simulations are performed and the high-order numerical results are validated against available literature data.

computational fluid dynamics (CFD)↗
DOE OSTI2022

An Efficient B-Spline Lagrangian/Eulerian Method for Compressible Flow, Shock Waves, and Fracturing Solids

This study presents a new method for modeling the interaction between compressible flow, shock waves, and deformable structures, emphasizing destructive dynamics. Extending advances in time-splitting compressible flow and the Material Point Methods (MPM), we develop a hybrid Eulerian and Lagrangian/Eulerian scheme for monolithic flow-structure interactions. We adopt the second-order WENO scheme to advance the continuity equation. To stably resolve deforming boundaries with sub-cell particles, we propose a blending treatment of reflective and passable boundary conditions inspired by the theory of porous media. The strongly coupled velocity-pressure system is discretized with a new mixed-order finite element formulation employing B-spline shape functions. Shock wave propagation, temperature/density-induced buoyancy effects, and topology changes in solids are unitedly captured.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A constrained-transport embedded boundary method for compressible resistive magnetohydrodynamics

Motivated by the increased interest in pulsed-power magneto-inertial fusion devices in recent years, we present a method for implementing an arbitrarily shaped embedded boundary on a Cartesian mesh while solving the equations of compressible resistive magnetohydrodynamics. The method is built around a finite volume formulation of the equations in which a Riemann solver is used to compute fluxes on the faces between grid cells, and a face-centered constrained transport formulation of the induction equation. The small time step problem associated with the cut cells is avoided by always computing fluxes on the faces and edges of the Cartesian mesh. We extend the method to model a moving interface between two materials with different properties using a ghost-fluid approach, and show some preliminary results including shock-wave-driven and magnetically-driven dynamical compressions of magnetohydrostatic equilibria. In conclusion, we present a thorough verification of the method and show that it converges at second order in the absence of discontinuities, and at first order with a discontinuity in material properties.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Assessment of diffuse-interface methods for compressible multiphase fluid flows and elastic-plastic deformation in solids

This work describes three diffuse-interface methods for the simulation of immiscible, compressible multiphase fluid flows and elastic-plastic deformation in solids. The first method is the localized-artificial-diffusivity approach of Cook, Subramaniam et al., and Adler and Lele, in which artificial diffusion terms are added to the individual phase mass fraction transport equations and are coupled with the other conservation equations. The second method is the gradient-form approach that is based on the quasi-conservative method of Shukla et al., in which the diffusion and sharpening terms (together called regularization terms) are added to the individual phase volume fraction transport equations and are coupled with the other conservation equations. The third approach is the divergence-form approach that is based on the fully conservative method of Jain et al., in which the regularization terms are added to the individual phase volume fraction transport equations and are coupled with the other conservation equations. In the present study, all three diffuse-interface methods are used in conjunction with a four-equation, multicomponent mixture model, in which pressure and temperature equilibria are assumed among the various phases. The primary objective of this work is to compare these three methods in terms of their ability to: maintain constant interface thickness throughout the simulation; conserve mass, momentum, and energy; and maintain accurate interface shape for long-time integration. The second objective of this work is to consistently extend these methods to model interfaces between solid materials with strength. To assess and compare the methods, they are used to simulate a wide variety of problems, including (1) advection of an air bubble in water, (2) shock interaction with a helium bubble in air, (3) shock interaction and the collapse of an air bubble in water, and (4) Richtmyer–Meshkov instability of a copper–aluminum interface. The current work focuses on comparing these methods in the limit of relatively coarse grid resolution, which illustrates the true performance of these methods. In conclusion, this is because it is rarely practical to use hundreds of grid points to resolve a single bubble or drop in large-scale simulations of engineering interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

StOKeDMD: Streaming Occupation kernel dynamic mode decomposition

Dynamic mode decomposition (DMD) has become a common technique for constructing surrogate models for dynamical systems from observed system states. The Occupation Kernel DMD (OKDMD) method proposed in (Rosenfeld et al., 2022) and (Rosenfeld et al., 2024) is a Liouville operator based method that builds surrogate models from system state trajectories. Here, this paper proposes an extension of OKDMD to the case when the system states are observed in a streaming fashion, i.e., only a small fraction of the state trajectory is available at a given time. The developed method, Streaming Occupation Kernel DMD (StOKeDMD), accommodates the streaming data input by leveraging properties of specific choices of kernel functions and occupation kernels. We apply the StoKeDMD method as a compression method for streaming data, analyze the memory complexity, and demonstrate the performance of StoKeDMD in the compression of streaming data generated from a Lorenz system and a fluid flow simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A reconstructed discontinuous Galerkin method for compressible flows in Lagrangian formulation

In this work, a high-order accurate reconstructed discontinuous Galerkin (rDG) method is developed for solving two-dimensional hydrodynamic problems in cell-centered updated Lagrangian formulation. This method is the Lagrangian limit of the unsplit rDG-ALE formulation, and is obtained by assuming the equality of the grid velocity to the fluid velocity only at cell boundaries. The conservative variables and the Taylor basis defined on the time-dependent moving mesh, provide the piece-wise polynomial expansion in the updated Lagrangian formulation. A multi-directional nodal Riemann solver is implemented for computing the grid velocity at the vertices and the numerical flux at the cell boundaries. A characteristic limiting procedure is extended from the primitive variable version to the conservative variable version, and its performance is compared with the limiter on physical variables. A number of benchmark test cases are conducted to assess the accuracy, robustness, and non-oscillatory property of the DG(P0), DG(P1) and rDG(P1P2) methods. The numerical experiments demonstrate that the developed rDG method is able to attain the designed order of accuracy and the characteristic limiting procedure outperforms the limiter on physical variables in terms of the monotonicity and symmetry preservation for shock problems.

42 ENGINEERING↗