Search NASA⌕ Search

SEARCH · Search NASA

Results for “compression algorithm”

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 937 records · Page 52
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

Three-dimensional flow calculations including boundary layer effects for supersonic inlets at angle of attack

An analysis is presented for calculating the steady three-dimensional flow field in supersonic mixed-compression inlets at incidence. A zonal modeling approach is employed to obtain the solution. The supersonic core flow is computed using a second-order pentahedral bicharacteristic algorithm. The bow shock wave and the reflected internal shock train are determined using a three-dimensional discrete shock fitting procedure. The boundary layer flow adjacent to both the centerbody and the cowl is computed using a second-order implicit finite difference method. The flow in a shock wave-boundary layer interaction region is computed using an integral formulation. The culmination of the present research effort is the development of a production-type computer program capable of analyzing flow in a variety of mixed-compression aircraft inlets. Numerical results and experimental correlations are presented to illustrate application of the analysis.

Vadyak, J.↗
DOE OSTI2020

Multilevel Techniques for Compression and Reduction of Scientific Data---The Unstructured Case

Previous work on multilevel techniques for compression and reduction of scientific data is extended to the case of data given on unstructured meshes in two and three dimensions. The centerpiece of the work is a decomposition algorithm which is shown to be optimal, in terms of both storage and operational complexity, applicable to unstructured grids in both two and three dimensions, and which implicitly gives a Riesz basis that can be exploited to reduce the data while maintaining rigorous bounds on the loss incurred. The flexibility of the approach is illustrated by applications to potential flow around an airfoil and the effect of compression on quantities of interest relevant to airfoil design; compression of computational simulation of a nonlinear reaction-diffusion system with special attention given to the problem of time series reduction; and, data from a simulation of magnetically confined plasma in a fusion reactor reduced so as to preserve the electric field computed from the data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Resilience and fault tolerance in high-performance computing for numerical weather and climate prediction

Progress in numerical weather and climate prediction accuracy greatly depends on the growth of the available computing power. As the number of cores in top computing facilities pushes into the millions, increased average frequency of hardware and software failures forces users to review their algorithms and systems in order to protect simulations from breakdown. This report surveys hardware, application-level and algorithm-level resilience approaches of particular relevance to time-critical numerical weather and climate prediction systems. A selection of applicable existing strategies is analysed, featuring interpolation-restart and compressed checkpointing for the numerical schemes, in-memory checkpointing, user-level failure mitigation and backup-based methods for the systems. Numerical examples showcase the performance of the techniques in addressing faults, with particular emphasis on iterative solvers for linear systems, a staple of atmospheric fluid flow solvers. The potential impact of these strategies is discussed in relation to current development of numerical weather prediction algorithms and systems towards the exascale. Trade-offs between performance, efficiency and effectiveness of resiliency strategies are analysed and some recommendations outlined for future developments.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1990

Adaptive quadrilateral and triangular finite-element scheme for compressible flows

The development of an adaptive mesh refinement procedure for analyzing high-speed compressible flows using the finite-element method is described. This new adaptation procedure, which uses both quadrilateral and triangular elements, was implemented with two explicit finite-element algorithms - the two-step Taylor-Galerkin and the multistep Galerkin-Runge-Kutta schemes. A von Neumann stability analysis and a rotating 'cosine hill'problem demonstrate the instability of the Taylor-Galerkin scheme when coupled with the adaptation procedure. For the same adaptive refinement scheme, the Galerkin-Runge-Kutta procedure yields stable solutions within its explicit stability limit. The utility of this new adaptation procedure for the prediction of compressible flow features is illustrated for inviscid problems involving strong shock interactions at hypersonic speeds.

Ramakrishnan, R.↗
DOE OSTI2026

BLING

The Bounded Linearized Iteration for Natural Gas (BLING) algorithm solves an optimization problem for gas pipeline flow scheduling that maximizes economic surplus and minimizes the energy used for gas compression subject to pressure, flow, and engineering constraints.

Zlotnik, Anatoly↗
DOE OSTI2023

PeleLMeX: an AMR Low Mach Number Reactive Flow Simulation Code without level sub-cycling

PeleLMeX simulates chemically reacting low Mach number flows with block-structured adaptive mesh refinement (AMR). The code is built upon the AMReX library, which provides the underlying data structures and tools to manage and operate on them across massively parallel computing architectures. PeleLMeX algorithmic features are inherited from its predecessor PeleLM but key improvements allow representation of more complex physical processes. Together with its compressible flow counterpart PeleC, the thermo-chemistry library PelePhysics and the multi-physics library PeleMP, it forms the Pele suite of open-source reactive flow simulation codes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Improved Understanding of Coupled Water and Carbon Cycle Processes through Machine Learning Approaches

Focal Area(s): This white paper addresses how explainable machine learning (ML) algorithms can improve insights gained from complex data (Focal Area 3). We will also address how ML approaches related to sensor compression and low energy AI hardware can be used for efficient data acquisition (Focal Area 1). Science Challenge: We will focus on the coupled water cycle and carbon cycle processes in terrestrial ecosystems and terrestrial-aquatic interfaces. Thus, our approaches will be centered around several data-model integration challenges indicated in EESD strategic plans for two science focus areas: Terrestrial Ecosystem Science and Hydrobiogeochemistry. We can use AI to correct systematic model errors due to biases in either data or model structure/processes. Error patterns in model predictions usually vary by region, model, season etc. But there are systematic patterns in them. e.g., soil moisture tends to be overestimated in the arid western continental United States underestimated in wetter eastern USA; some land surface models tend to underestimate moisture in wet seasons and overestimate in dry seasons. Moreover, the consequences of extreme events (e.g., drought, extreme flooding, storm surges associated with tropical storms, hurricanes) on carbon cycle processes are not well represented in ecosystem and Earth system models. Redox-sensitive processes (e.g., rapid oxidation/reduction of iron and other redox-sensitive elements in soil microsites subjected to fluctuated hydrology) in terrestrial-aquatic interfaces further challenge model predictions of hot-spots (and hot-moments) due to poor understanding of underlying mechanisms. Thus, AI/ML approaches can be used to learn patterns in the data and model errors and use them to build model equations and correct process-based model errors.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1981

User's manual for SYNC: A FORTRAN program for merging and time-synchronizing data

The FORTRAN 77 computer program SYNC for merging and time synchronizing data is described. The program SYNC reads one or more input files which contain either synchronous data frames or time-tagged data points, which can be compressed. The program decompresses and time synchronizes the data, correcting for any channel time skews. Interpolation and hold last value synchronization algorithms are available. The output from SYNC is a file of time synchronized data frames at any requested sample rate.

Maine, R. E.↗
NASA NTRS1985

Information for space radar designers: Required dynamic range vs resolution and antenna calibration using the Amazon rain forest

Calibration of the vertical pattern of the antennas for the SEASAT scatterometer was accomplished using the nearly-uniform radar return from the Amazon rain forest. A similar calibration will be attempted for the SIR-B antenna. Thick calibration is important to establish the radiometric calibration across the swath of the SIR-B, and the developed methodology will provide an important tool in the evaluation of future spaceborne imaging radars. This calibration was made by the very-wide-beam SEASAT scatterometer antennas because at 14.65 GHz the scattering coefficient of the rain forest is almost independent of angle of incidence. It is expected that the variation in scattering coefficient for the rain forest across the relatively narrow vertical beam of the SIR-B will be very small; even at L band the forest should be essentially impenetrable for radar signals, the volume scatter from the treetops will predominate as at higher frequencies. The basic research elements include: (1) examination of SIR-B images over the rain forest to establish the variability of the scattering coefficient at finer resolutions than that of the SEASAT scatterometer; (2) analysis of the variability of SIR-B data detected prior to processing for either azimuth compression or; possibly, range compression so that averages over relatively large footprints can be used; (3) processing of data of the form of (2) using algorithms that can recover the vertical pattern of the antenna.

Moore, R. K.↗
NASA NTRS1987

Numerical simulation of excited jet mixing layers

A numerical simulation of unsteady flow in jet mixing layers, both with and without external excitation, has been performed by solving the time-dependent compressible Navier-Stokes equations. Computations were performed on a CRAY X-MP computer using MacCormick's explicit finite difference algorithm. Different excitation methods were investigated and were shown to be very effective in controlling the well organized periodic production, shedding and pairing of large scale vortex structures. It is found that pressure excitation was generally more effective than temperature excitation, and that grid refinement results in substantial improvement in the resolution of unsteady features. The location and orientation, in addition to the frequency, of the excitation source are shown to have a significant influence on the production and interaction of large scale vortex structures in the jet mixing layer.

Scott, J. N.↗
NASA NTRS1988

Image management research

Two types of research issues are involved in image management systems with space station applications: image processing research and image perception research. The image processing issues are the traditional ones of digitizing, coding, compressing, storing, analyzing, and displaying, but with a new emphasis on the constraints imposed by the human perceiver. Two image coding algorithms have been developed that may increase the efficiency of image management systems (IMS). Image perception research involves a study of the theoretical and practical aspects of visual perception of electronically displayed images. Issues include how rapidly a user can search through a library of images, how to make this search more efficient, and how to present images in terms of resolution and split screens. Other issues include optimal interface to an IMS and how to code images in a way that is optimal for the human perceiver. A test-bed within which such issues can be addressed has been designed.

Watson, Andrew B.↗
NASA NTRS1989

Solution of the incompressible Navier-Stokes equations using artificial compressibility methods

A modified artificial compressibility formulation is derived from a preconditioned low Mach number compressible formulation, and these two methods are compared on a two-dimensional laminar leading edge flow using a LBI/ADI solution algorithm. The two methods are essentially equivalent with appropriate preconditioning parameters and have the same convergence rates and efficiency, giving 4 orders of residual reduction in about 75 iterations with a vectorized CRAY-XMP run time of 20 seconds for 3000 grid points.

Briley, W. R.↗
DOE OSTI2023

Efficient generalized boundary detection

Fast, efficient, and robust compression-based methods for detecting boundaries in arbitrary datasets, including sequences (1D datasets), are desired. The methods, each employing three simple algorithms, approximate the information distance between two adjacent sliding windows within a dataset. One of the algorithms calculates an initial ordered list of subsequences; while a second algorithm updates the ordered list of subsequences by dropping a first entry and appending a last entry rather than calculating completely new ordered lists with each iteration. Large values in the distance metric are indicative of boundary locations. A smoothed z-score or a wavelet-based algorithm may then be used to locate peaks in the distance metric, thereby identifying boundary locations. An adaptive version of the method employs a collection of window sizes and corresponding weighting functions, making it more amenable to real datasets with unknown, complex, and changing structures.

Ting, Christina↗
NASA NTRS1993

A fixed/variable bit-rate data compression architecture

A VLSI architecture for an adaptive data compression encoder capable of sustaining fixed or variable bit-rate output has been developed. There are three modes of operation: lossless with variable bit-rate, lossy with fixed bit-rate and lossy with variable bit-rate. For lossless encoding, the implementation is identical to the USES chip designed for Landsat 7. Obtaining a fixed bit-rate is achieved with a lossy DPCM algorithm using adaptive, nonuniform scalar quantization. In lossy mode, variable bit-rate coding uses the lossless sections of the encoder for post-DPCM entropy coding. The encoder shows excellent compression performance in comparison to other current data compression techniques. No external tables or memory are required for operation.

Zweigle, Gregary C.↗
DOE OSTI2024

R-Adaptivity to Enable Compression of Elementary Computations in Extreme-Scale Finite Element Simulators

Modern computing systems are capable of exascale calculations, which are revolutionizing the development and application of high-fidelity numerical models in computational science and engineering. While these systems continue to grow in processing power, the available system memory has not increased commensurately, and electrical power consumption continues to grow. A predominant approach to limit the memory usage in large-scale applications is to exploit the abundant processing power and continually recompute many low-level simulation quantities, rather than storing them. However, this approach can adversely impact the throughput of the simulation and diminish the benefits of modern computing architectures. We present three novel contributions to reduce the memory burden while maintaining, and sometimes improving, performance in simulations based on finite element discretizations. The first contribution develops dictionary-based data compression schemes that detect and exploit the structure of the discretization, due to redundancies across the finite element mesh. While these schemes are shown to reduce memory requirements by more than 99% on meshes with large numbers of identical mesh cells, there are applications where this structure does not exist. The second contribution leverages a recently developed augmented Lagrangian optimization algorithm to enable r-adaptivity for meshes with the goal of enhancing the redundancies in the mesh. The third contribution extends these methods to patch-based linear solvers and preconditioners by compressing local matrices. Numerical results demonstrate the effectiveness of the proposed methods to detect, enhance and exploit mesh structure on a suite of examples inspired by large-scale applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Longitudinal, intermodality registration of quantitative breast PET and MRI data acquired before and during neoadjuvant chemotherapy: Preliminary results

Purpose: The authors propose a method whereby serially acquired DCE-MRI, DW-MRI, and FDG-PET breast data sets can be spatially and temporally coregistered to enable the comparison of changes in parameter maps at the voxel level. Methods: First, the authors aligned the PET and MR images at each time point rigidly and nonrigidly. To register the MR images longitudinally, the authors extended a nonrigid registration algorithm by including a tumor volume-preserving constraint in the cost function. After the PET images were aligned to the MR images at each time point, the authors then used the transformation obtained from the longitudinal registration of the MRI volumes to register the PET images longitudinally. The authors tested this approach on ten breast cancer patients by calculating a modified Dice similarity of tumor size between the PET and MR images as well as the bending energy and changes in the tumor volume after the application of the registration algorithm. Results: The median of the modified Dice in the registered PET and DCE-MRI data was 0.92. For the longitudinal registration, the median tumor volume change was −0.03% for the constrained algorithm, compared to −32.16% for the unconstrained registration algorithms (p = 8 × 10{sup −6}). The medians of the bending energy were 0.0092 and 0.0001 for the unconstrained and constrained algorithms, respectively (p = 2.84 × 10{sup −7}). Conclusions: The results indicate that the proposed method can accurately spatially align DCE-MRI, DW-MRI, and FDG-PET breast images acquired at different time points during therapy while preventing the tumor from being substantially distorted or compressed.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2017

Improved ALE mesh velocities for complex flows

A key choice in the development of arbitrary Lagrangian-Eulerian solution algorithms is how to move the computational mesh. The most common approaches are smoothing and relaxation techniques, or to compute a mesh velocity field that produces smooth mesh displacements. We present a method in which the mesh velocity is specified by the irrotational component of the fluid velocity as computed from a Helmholtz decomposition, and excess compression of mesh cells is treated through a noniterative, local spring-force model. This approach allows distinct and separate control over rotational and translational modes. In conclusion, the utility of the new mesh motion algorithm is demonstrated on a number of 3D test problems, including problems that involve both shocks and significant amounts of vorticity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1984

Video compression using conditional replenishment and motion prediction

A study of a low-rate monochrome video compression system is presentd in this paper. This system is a conditional-replenishment coder that uses two-dimensional Walsh-transform coding within each video frame. The conditional-replenishment algorithm works by transmitting only the portions of an image that are changing in time. This system is augmented with a motn-prediction algorithm that measures spatial dispalcement parameters from frame to frame, and codes the data using these parameters. A comparison is made between the conditional-replenishment system with, and without, the motion-predictinalgorthm. Subsampling in time is ued to maintain the data rate rate at a fixed value. Average bit rates of 1 bit/picture element (pel) to 1/16 bit/pel are considered. The resultant performance of the compression simulations is presented in terms of the average frame rates produced.

Hein, D. N.↗