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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Numerical study of laminar and turbulent flows inside a turnaround duct with and without guide vanes

The purpose of this study is to examine in detail incompressible laminar and turbulent flows inside a turnaround duct with and without guide vanes and to investigate the effects of vanes on the flow characteristics. To perform this study, an implicit finite difference code cast in general curvilinear coordinates is further developed. The code is based on the method of pseudo-compressibility and utilize ADI or implicit approximate factorization algorithm to achieve computational efficiency. Method of segmental sweeping is developed to overcome the multiple-zone problem due to imposition of guide vanes. In the present study, several test cases have been computed. These test cases include laminar and turbulent flows inside a turnaround duct without and with two or three guide vanes. The study reveals that: (1) there exists large recirculation zones inside the duct if no vanes are present; (2) properly shaped and positional guide vanes are effective in eliminating flow separation; and (3) laminar and turbulent flows have similar flow features. But turbulent flow has less total pressure drop.

Lin, S.-J.↗
NASA NTRS1987

A Navier-Stokes flow simulation of the Space Shuttle Main Engine Hot Gas Manifold

Incompressible viscous flow inside the turnaround duct, the fuel bowl, the transfer duct and the racetrack of the Space Shuttle Main Engine (SSME) Hot Gas Manifold (HGM) has been computed using the method of pseudo-compressibility together with an implicit, approximate-factorization algorithm. A multiple-zone method is used to make solution of flows in complex geometries easy. A model which predicts the pressure loading for the shield and the injector post arrangement without solving the complex flow field in the main injector region is proposed. The computed results show good qualitative agreement with experimental data.

Yang, Ruey-Jen↗
NASA NTRS1987

Numerical simulation of flow path in the oxidizer side hot gas manifold of the Space Shuttle main engine

The purpose of this study is to examine in detail incompressible laminar and turbulent flows inside the oxidizer side Hot Gas Manifold of the Space Shuttle Main Engine. To perform this study, an implicit finite difference code cast in general curvilinear coordinates is further developed. The code is based on the method of pseudo-compressibility and utilize ADI or implicit approximate factorization algorithm to achieve computational efficiency. A multiple-zone method is developed to overcome the complexity of the geometry. In the present study, the laminar and turbulent flows in the oxidizer side Hot Gas Manifold have been computed. The study reveals that: (1) there exists large recirculation zones inside the bowl if no vanes are present; (2) strong secondary flows are observed in the transfer tube; and (3) properly shaped and positioned guide vanes are effective in eliminating flow separation.

Lin, S. J.↗
NASA NTRS1991

Steady and unsteady solutions of the incompressible Navier-Stokes equations

An algorithm for the solution of the incompressible Navier-Stokes equations in three-dimensional generalized curvilinear coordinates is presented. The algorithm can be used to compute both steady-state and time-dependent flow problems. The algorithm is based on the method of artificial compressibility and uses a third-order flux-difference splitting technique for the convective terms and the second-order central difference for the viscous terms. The accuracy is obtained in the numerical solutions by subiterating the equations in pseudotime for each physical time step. The equations are solved with a line-relaxation scheme that allows the use of very large pseudotime steps leading to fast convergence for steady-state problems as well as for the subiterations of time-dependent problems. The steady-state solution of flow through a square duct with a 90-deg bend is computed, and the results are compared with experimental data. Good agreement is observed. Computations of unsteady flow over a circular cylinder are presented and compared to other experimental and computational results. Finally, the flow through an artificial heart configuration with moving boundaries is calculated and presented.

Rogers, Stuart E.↗
NASA NTRS1993

Implicit multigrid Euler solutions with symmetric Total-Variation-Diminishing dissipation

A symmetric Total-Variation-Diminishing (TVD) formulation of the numerical dissipation terms has been incorporated into a diagonalized alternating direction implicit multigrid algorithm to solve the Euler equations of inviscid compressible flow. The new treatment of the dissipation makes is possible to capture both very strong and very weak shocks, virtually without oscillation for the steady flows of interest here. In addition, the TVD constraint fixes one of the two previously arbitrary constants in the formulation of the dissipation, and results in both converged solutions and convergence rates which are relatively insensitive to the choice of the remaining dissipation parameter.

Caughey, David A.↗
NASA NTRS1991

Methods for direct simulation of transition in hypersonic boundary layers

An implicit numerical algorithm for the time accurate solution of the compressible Navier-Stokes equations is described. Results for steady flow past a finite flat plate are presented, together with preliminary results for the temporal simulation of second mode instability in a flat plate boundary layer at Mach 4.5.

Vandervegt, J. J. W.↗
NASA NTRS2004

Evaluation of High-Resolution Ocean Surface Vector Winds Measured by QuikSCAT Scatterometer in Coastal Regions

The SeaWinds scatterometer onboard QuikSCAT covers approximately 90% of the global ocean under clear and cloudy condition in 24 h, and the standard data product has 25-km spatial resolution. Such spatial resolution is not sufficient to resolve small-scale processes, especially in coastal oceans. Based on range-compressed normalized backscatter and a modified wind retrieval algorithm, a coastal wind dataset at 12.5-km resolution was produced. Even with larger error, the high-resolution winds, in medium to high strength, would still be useful over coastal ocean. Using measurements from moored buoys from the National Buoy Data Center, the high-resolution QuikSCAT wind data are found to have similar accuracy as standard data in the open ocean. The accuracy of both high- and standard-resolution winds, particularly in wind directions, is found to degrade near shore. The increase in error is likely caused by the inadequacy of the geophysical model function/ambiguity removal scheme in addressing coastal conditions and light winds situations. The modified algorithm helps to bring the directional accuracy of the high-resolution winds to the accuracy of the standard-resolution winds in near-shore regions, particularly in the nadir and far zones across the satellite track.

scatterometer↗
NASA NTRS1996

Development of a Vorticity-Velocity Navier-Stokes Formulation for the Study of Compressibility Effects on Dynamic Stall

The first major area of this study was to develop a vorticity-velocity formulation and numerical solution algorithms suitable for the analyses of incompressible as well as low-to- moderate-speed compressible flows. Research performed towards contributing to the determination of the appropriate vorticity and dilation creation boundary conditions suggested to temporarily set aside this approach and use a primitive-variable approach other than the pseudo-compressibility approach used. The second major area of study was initiated to comprehensively examine the INS-2D and INS-3D programs from the point of view of boundary conditions. The research carried out was documented in the form of two technical papers which are included in Appendices A and B; the boundary-condition related issues for INS-3D are briefly mentioned.

Ghia, K. N.↗
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↗
NASA NTRS2001

Band-Moment Compression of AVIRIS Hyperspectral Data and its Use in the Detection of Vegetation Stress

A remote sensing campaign was conducted over a U.S. Department of Agriculture test farm at Shelton, Nebraska. An experimental field was set off in plots that were differentially treated with anhydrous ammonia. Four replicates of 0-kg/ha to 200-kg/ha plots, in 50-kg/ha increments, were set out in a random block design. Low-altitude (GSD of 3 m) Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) hyperspectral data were collected over the site in 224 bands. Simultaneously, ground data were collected to support the airborne imagery. In an effort to reduce data load while maintaining or enhancing algorithm performance for vegetation stress detection, band-moment compression and analysis was applied to the AVIRIS image cube. The results indicated that band-moment techniques compress the AVIRIS dataset significantly while retaining the capability of detecting environmentally induced vegetation stress.

Estep, L.↗
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↗
NASA NTRS1997

The Galileo Spacecraft: A Communications Legacy for Future Space Flight

The Galileo mission to Jupiter has implemented a wide range of telecommunication improvements in response to the loss of it's high gain antenna. Among the communications enhancements that have been made are the use of advanced compression techniques, packetized telemetry, new error correcting codes and algorithms, more efficient modulation, variable transmission data rates, routine ground antenna arraying (even between continents,) extremely sensitive ground receivers, and non-real-time automated data reconstruction. This telecommunications legacy of Galileo will aid in our abillity to conduct a meaningful exploration of the solar system, and beyond, at a reasonable cost.

Galileo↗
NASA NTRS1993

Image and Video Compression with VLSI Neural Networks

An advanced motion-compensated predictive video compression system based on artificial neural networks has been developed to effectively eliminate the temporal and spatial redundancy of video image sequences and thus reduce the bandwidth and storage required for the transmission and recording of the video signal. The VLSI neuroprocessor for high-speed high-ratio image compression based upon a self-organization network and the conventional algorithm for vector quantization are compared. The proposed method is quite efficient and can achieve near-optimal results.

compression artificial neural networks VLSI↗
NASA NTRS1984

High speed inviscid compressible flow by the finite element method

The finite element method and an explicit time stepping algorithm which is based on Taylor-Galerkin schemes with an appropriate artificial viscosity is combined with an automatic mesh refinement process which is designed to produce accurate steady state solutions to problems of inviscid compressible flow in two dimensions. The results of two test problems are included which demonstrate the excellent performance characteristics of the proposed procedures.

Zienkiewicz, O. C.↗
NASA NTRS1985

Upwind relaxation algorithms for the Navier Stokes equations

The development of upwind relaxation algorithms for obtaining efficient steady-state solutions to the compressible Navier-Stokes equations is described. The method is second-order accurate spatially and naturally disipative, using third-order flux splitting of the pressure and convective terms and second-order central differencing for shear and heat flux terms. A line Gauss-Seidel relaxation approach, shown to be unconditionally stable for model convection and diffusion equations, is used. The algorithm is demonstrated for several flows using the thin-layer form of the equations, including the problem of shock-induced separation over a flat plate.

Thomas, J. L.↗
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↗