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 73 records · Page 4

A spectral collocation method for compressible, non-similar boundary layers

An efficient and highly accurate algorithm based on a spectral collocation method is developed for numerical solution of the compressible, two-dimensional and axisymmetric boundary layer equations. The numerical method incorporates a fifth-order, fully implicit marching scheme in the streamwise (timelike) dimension and a spectral collocation method based on Chebyshev polynomial expansions in the wall-normal (spacelike) dimension. The spectral collocation algorithm is used to derive the nonsimilar mean velocity and temperature profiles in the boundary layer of a 'fuselage' (cylinder) in a high-speed (Mach 5) flow parallel to its axis. The stability of the flow is shown to be sensitive to the gradual streamwise evolution of the mean flow and it is concluded that the effects of transverse curvature on stability should not be ignored routinely.

Pruett, C. D.↗

Finite element methods for compressible flows

The problems of mesh generation and developing effective algorithms for the solution of the equations of compressible flow on unstructured meshes are discussed. Adaptive mesh refinement methods can be implemented in a straightforward manner. Possible adaptive strategies are examined. A finite element method adapted to problems involving high speed compressible flow is described. The adaptive mesh regeneration procedure appears to offer the possibility of large computational savings in three dimensional flow computation.

Morgan, K.↗

Optimal Compression of Floating-Point Astronomical Images Without Significant Loss of Information

We describe a compression method for floating-point astronomical images that gives compression ratios of 6 - 10 while still preserving the scientifically important information in the image. The pixel values are first preprocessed by quantizing them into scaled integer intensity levels, which removes some of the uncompressible noise in the image. The integers are then losslessly compressed using the fast and efficient Rice algorithm and stored in a portable FITS format file. Quantizing an image more coarsely gives greater image compression, but it also increases the noise and degrades the precision of the photometric and astrometric measurements in the quantized image. Dithering the pixel values during the quantization process greatly improves the precision of measurements in the more coarsely quantized images. We perform a series of experiments on both synthetic and real astronomical CCD images to quantitatively demonstrate that the magnitudes and positions of stars in the quantized images can be measured with the predicted amount of precision. In order to encourage wider use of these image compression methods, we have made available a pair of general-purpose image compression programs, called fpack and funpack, which can be used to compress any FITS format image.

Pence, William D.↗

An h-p Taylor-Galerkin finite element method for compressible Euler equations

An extension of the familiar Taylor-Galerkin method to arbitrary h-p spatial approximations is proposed. Boundary conditions are analyzed, and a linear stability result for arbitrary meshes is given, showing the unconditional stability for the parameter of implicitness alpha not less than 0.5. The wedge and blunt body problems are solved with both linear, quadratic, and cubic elements and h-adaptivity, showing the feasibility of higher orders of approximation for problems with shocks.

Demkowicz, L.↗

A numerical investigation of the finite element method in compressible primitive variable Navier-Stokes flow

The results of a comprehensive numerical investigation of the basic capabilities of the finite element method (FEM) for numerical solution of compressible flow problems governed by the two-dimensional and axis-symmetric Navier-Stokes equations in primitive variables are presented. The strong and weak points of the method as a tool for computational fluid dynamics are considered. The relation of the linear element finite element method to finite difference methods (FDM) is explored. The calculation of free shear layer and separated flows over aircraft boattail afterbodies with plume simulators indicate the strongest assets of the method are its capabilities for reliable and accurate calculation employing variable grids which readily approximate complex geometry and capably adapt to the presence of diverse regions of large solution gradients without the necessity of domain transformation.

Cook, C. H.↗

Spectral methods for compressible flow problems

Recent results concerning numerical simulation of shock waves using spectral methods are reviewed. Shock fitting techniques were discussed as well as shock capturing techniques with finite difference artificial viscosity. Also the notion of the information contained in the numerical results obtained by spectral methods and show how this information is recovered was discussed.

Gottlieb, D.↗

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↗

Calculation methods for compressible turbulent boundary layers

Calculation procedures for non-reacting compressible two- and three-dimensional turbulent boundary layers were reviewed. Integral, transformation and correlation methods, as well as finite difference solutions of the complete boundary layer equations summarized. Alternative numerical solution procedures were examined, and both mean field and mean turbulence field closure models were considered. Physics and related calculation problems peculiar to compressible turbulent boundary layers are described. A catalog of available solution procedures of the finite difference, finite element, and method of weighted residuals genre is included. Influence of compressibility, low Reynolds number, wall blowing, and pressure gradient upon mean field closure constants are reported.

Bushnell, D. M.↗

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↗

Embedded function methods for compressible high speed turbulent flow

Fundamental issues relating to compressible turbulent flow are addressed. The focus has been on developing methods and testing concepts for attached flows rather than trying to force a conventional law of the wall into a zone of backflow. Although the dynamics of the near-wall flow in an attached turbulent boundary layer are relatively well documented, the dynamical features of a zone of reversed turbulent flow are not, nor are they well understood. Incompressibility introduces effects and issues that have been dealt with only marginally in the literature, therefore, the present work has been focussed on attached high-speed flows. The wall function method has been extended up through the supersonic to hypersonic speeds. Algorithms have been successfully introduced into the code that calculates the flow all the way to the wall, and testing is being carried out for progressively more complex flow situations.

Walker, J. D. A.↗

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↗

The Pack Method for Compressive Tests of Thin Specimens of Materials Used in Thin-Wall Structures

The strength of modern lightweight thin-wall structures is generally limited by the strength of the compression members. An adequate design of these members requires a knowledge of the compressive stress-strain graph of the thin-wall material. The "pack" method was developed at the National Bureau of Standards with the support of the National Advisory Committee for Aeronautics to make possible a determination of compressive stress-strain graphs for such material. In the pack test an odd number of specimens are assembled into a relatively stable pack, like a "pack of cards." Additional lateral stability is obtained from lateral supports between the external sheet faces of the pack and outside reactions. The tests seems adequate for many problems in structural research.

Aitchison, C S↗

Study by the Prandtl-Glauert method of compressibility effects and critical Mach number for ellipsoids of various aspect ratios and thickness ratios

By using the Prandtl-Glauert method that is valid for three-dimensional flow problems, the value of the maximum incremental velocity for compressible flow about thin ellipsoids at zero angle of attack is calculated as a function of the Mach number for various aspect ratios and thickness ratios. The critical Mach numbers of the various ellipsoids are also determined. The results indicate an increase in critical Mach number with decrease in aspect ratio which is large enough to explain experimental results on low-aspect-ratio wings at zero lift.

Hess, Robert V↗

Sandwich beam compressive test method

Tests presented show that the sandwich beam in four-point bending could be used to obtain reliable compressive elastic constants for graphite/polyimide laminates although some difficulties were encountered measuring composite compressive strengths. Data were obtained for ultimate stress, ultimate strain, Young's modulus, and Poisson's ratio values in 117K, room temperature, and 589K test environments for the HTS1/PMR-15 material system. A total of 36 compressive tests on various laminates were performed. Also, 24 tensile tests on the same laminate orientations were performed to obtain input to the analytical portion of this program. A portion of the beam test section was analyzed using a linear elastic finite element computer program to predict the stress state in the graphite/polyimide composite. The influence of the honeycomb core of this stress state was analytically determined.

Shuart, M. J.↗

Science-based Region-of-Interest Image Compression

As the number of currently active space missions increases, so does competition for Deep Space Network (DSN) resources. Even given unbounded DSN time, power and weight constraints onboard the spacecraft limit the maximum possible data transmission rate. These factors highlight a critical need for very effective data compression schemes. Images tend to be the most bandwidth-intensive data, so image compression methods are particularly valuable. In this paper, we describe a method for prioritizing regions in an image based on their scientific value. Using a wavelet compression method that can incorporate priority information, we ensure that the highest priority regions are transmitted with the highest fidelity.

Wagstaff, K. L.↗

Transform coding for space applications

Data compression coding requirements for aerospace applications differ somewhat from the compression requirements for entertainment systems. On the one hand, entertainment applications are bit rate driven with the goal of getting the best quality possible with a given bandwidth. Science applications are quality driven with the goal of getting the lowest bit rate for a given level of reconstruction quality. In the past, the required quality level has been nothing less than perfect allowing only the use of lossless compression methods (if that). With the advent of better, faster, cheaper missions, an opportunity has arisen for lossy data compression methods to find a use in science applications as requirements for perfect quality reconstruction runs into cost constraints. This paper presents a review of the data compression problem from the space application perspective. Transform coding techniques are described and some simple, integer transforms are presented. The application of these transforms to space-based data compression problems is discussed. Integer transforms have an advantage over conventional transforms in computational complexity. Space applications are different from broadcast or entertainment in that it is desirable to have a simple encoder (in space) and tolerate a more complicated decoder (on the ground) rather than vice versa. Energy compaction with new transforms are compared with the Walsh-Hadamard (WHT), Discrete Cosine (DCT), and Integer Cosine (ICT) transforms.

Glover, Daniel↗