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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

Thermal/Pyrolysis Gas Flow Analysis of Carbon Phenolic Material

Provided in this study are predicted in-depth temperature and pyrolysis gas pressure distributions for carbon phenolic materials that are externally heated with a laser source. Governing equations, numerical techniques and comparisons to measured temperature data are also presented. Surface thermochemical conditions were determined using the Aerotherm Chemical Equilibrium (ACE) program. Surface heating simulation used facility calibrated radiative and convective flux levels. Temperatures and pyrolysis gas pressures are predicted using an upgraded form of the SINDA/CMA program that was developed by NASA during the Solid Propulsion Integrity Program (SPIP). Multispecie mass balance, tracking of condensable vapors, high heat rate kinetics, real gas compressibility and reduced mixture viscosity's have been added to the algorithm. In general, surface and in-depth temperature comparisons are very good. Specie partial pressures calculations show that a saturated water-vapor mixture is the main contributor to peak in-depth total pressure. Further, for most of the cases studied, the water-vapor mixture is driven near the critical point and is believed to significantly increase the local heat capacity of the composite material. This phenomenon if not accounted for in analysis models may lead to an over prediction in temperature response in charring regions of the material.

Clayton, J. Louie↗
NASA NTRSDate not supplied

Reduced Dimensionality Analysis of TEMPO Ozone Profile Retrievals Using the Compact Phase Space (CPSR) Algorithm

TEMPO ozone (O 3 ) profile retrievals are expected to have fidelity in the troposphere due the sensitivities of the associated averaging kernels. However, those averaging kernels are severely rank deficiency meaning that a visual inspection of the vertical structure of the averaging kernel profile sensitivities is misleading due linear dependencies in the profile. The Compact Phase Space Retrieval (CPSR) algorithm use singular value decompositions of the averaging kernels and the ‘compressed’ retrieval solution error covariance to project the transformed averaging kernels into a space that removes the linear dependencies and accounts for the solution error uncertainties. In this oral presentation and poster, we apply the CPSR dimensional reduction analysis to TEMPO and TROPOMI O 3 profile retrievals for 13:45 UTC March 29, 2024 to study the phase space characteristics of the transformed averaging kernels as a function of latitude for North America. Our results show that TEMPO generally has more phase space vertical structure in the troposphere than TROPOMI. TEMPO has four to five dominant modes, and TROPOMI has five to six dominant modes. That means that dimensional reduction can reduce the TEMPO resource requirements by ~77% and the TROPOMI requirements by ~81%. Finally, we found that after removing linear dependences and after accounting for solution uncertainties TEMPO still has sensitivities throughout the troposphere.

TEMPO↗
NASA NTRS1997

Improvements for Image Compression Using Adaptive Principal Component Extraction (APEX)

The issues of image compression and pattern classification have been a primary focus of researchers among a variety of fields including signal and image processing, pattern recognition, data classification, etc. These issues depend on finding an efficient representation of the source data. In this paper we collate our earlier results where we introduced the application of the. Hilbe.rt scan to a principal component algorithm (PCA) with Adaptive Principal Component Extraction (APEX) neural network model. We apply these technique to medical imaging, particularly image representation and compression. We apply the Hilbert scan to the APEX algorithm to improve results

Ziyad, Nigel A.↗
NASA NTRS1992

A compressible Navier-Stokes solver with two-equation and Reynolds stress turbulence closure models

This report outlines the development of a general purpose aerodynamic solver for compressible turbulent flows. Turbulent closure is achieved using either two equation or Reynolds stress transportation equations. The applicable equation set consists of Favre-averaged conservation equations for the mass, momentum and total energy, and transport equations for the turbulent stresses and turbulent dissipation rate. In order to develop a scheme with good shock capturing capabilities, good accuracy and general geometric capabilities, a multi-block cell centered finite volume approach is used. Viscous fluxes are discretized using a finite volume representation of a central difference operator and the source terms are treated as an integral over the control volume. The methodology is validated by testing the algorithm on both two and three dimensional flows. Both the two equation and Reynolds stress models are used on a two dimensional 10 degree compression ramp at Mach 3, and the two equation model is used on the three dimensional flow over a cone at angle of attack at Mach 3.5. With the development of this algorithm, it is now possible to compute complex, compressible high speed flow fields using both two equation and Reynolds stress turbulent closure models, with the capability of eventually evaluating their predictive performance.

Navier-Stoke solver↗
NASA NTRS2024

The Emerging Issue-3 Revision of the Ccsds-123.0-B Low-Complexity Lossless and Near-Lossless Multispectral and Hyperspectral Image Compression Standard

The CCSDS-123.0-B Low-Complexity Lossless and Near-Lossless Multispectral & Hyperspectral Image Compression standard provides state-of-the-art compression for imaging spectrometer data. Issue 1 of this standard, published in 2012, provides only lossless compression capability. In 2019, Issue 2 was published, adding new features and in particular augmenting the compressor to provide also near-lossless compression, i.e., compression with a user-specified error limit in each spectral band. This presentation will describe the Issue 3 revision currently under development by the CCSDS Data Compression working group. This revision will provide region-of-interest compression capability. That is, a user-provided spatial classification map can be used to specify different data fidelity parameters in different image regions. This would, for example, allow an onboard classification algorithm to identify the most important regions of an image, or regions obscured by clouds, and adjust compression fidelity accordingly in each region to maximize value of imaging spectrometer data returned over constrained space communication links. The revision also aims to add an option that is unrelated to region-of-interest compression but can improve compression effectiveness in some cases.

CCSDS Hyperspectral↗
NASA NTRS1992

Computation of unsteady flows over airfoils

Two methods are described for calculating unsteady flows over rapidly pitching airfoils. The first method is based on an interactive scheme in which the inviscid flow is obtained by a panel method. The boundary layer flow is computed by an interactive method that makes use of the Hilbert integral to couple the solutions of the inviscid and viscous flow equations. The second method is based on the solution of the compressible Navier-Stokes equations. The solution of these equations is obtained with an approximately factorized numerical algorithm, and with single block or multiple grids which enable grid embedding to enhance the resolution at isolated flow regions. In addition, the attached flow region can be computed by the numerical solution of compressible boundary layer equations. Unsteady pressure distributions obtained with both methods are compared with available experimental data.

Ekaterinaris, J. A.↗
DOE OSTI2021

Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors

Tensor based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making it an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S3TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. In this work, we present a novel compressed storage format CSS for sparse symmetric tensors, along with an efficient parallel algorithm for the S3TTMc operation. We theoretically establish that S3TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations. We demonstrate experimental findings that confirm these results and achieve up to 2.9× speedup on synthetic and real datasets.

Shivakumar, Shruti↗
NASA NTRS1974

A priori estimate of the quality of a data compression system based on statistical characteristics of the sensors used

Knowledge of the composition and certain statistical characteristics of the output signals of the scientific instruments on board a space vehicle allows determination of possible signal processing algorithms in the system and to evaluate the prospects for utilization of data reduction. A method is presented to estimate the compression factor of an on-board data collection and processing system with known mean activities of the sensors used and unknown mutual correlation of their output signals.

Khodarev, Y. K.↗
NASA NTRS1977

Status report: Data management program algorithm evaluation activity at Marshall Space Flight Center

An algorithm evaluation activity was initiated to study the problems associated with image processing by assessing the independent and interdependent effects of registration, compression, and classification techniques on LANDSAT data for several discipline applications. The objective of the activity was to make recommendations on selected applicable image processing algorithms in terms of accuracy, cost, and timeliness or to propose alternative ways of processing the data. As a means of accomplishing this objective, an Image Coding Panel was established. The conduct of the algorithm evaluation is described.

Jayroe, R. R., Jr.↗
NASA NTRS1983

Semidirect computations for transonic flow

A semidirect method, driven by a Poisson solver, was developed for inviscid transonic flow computations. It is an extension of a recently introduced algorithm for solving subsonic rotational flows. Shocks are captured by implementing a form of artificial compressibility. Nonisentropic cases are computed using a shock tracking procedure coupled with the Rankine-Hugoniot relationships. Results are presented for both subsonic and transonic flows. For the test geometry, an unstaggered cascade of 20 percent thick circular arc airfoils at zero angle of attack, shocks are crisply resolved in supercritical situations and the algorithm converges rapidly. In addition, the convergence rate appears to be nearly independent of the entropy and vorticity production at the shock.

Swisshelm, J. M.↗
DOE OSTI2021

An automated procedure built on MTEX for reconstructing deformation twin hierarchies from electron backscattered diffraction datasets of heavily twinned microstructures

Here we present a set of algorithms built on the MTEX and MATLAB graph toolboxes for automatic reconstruction of deformation twin hierarchies from Electron Backscatter Diffraction (EBSD) datasets with a focus on developing methods for heavily twinned microstructures (twin fractions >0.5). The algorithms address key issues arising at large strains, mainly: missing twin relationships, grouping of heavily deformed grain fragments into families of similar orientation originating from a single initial grain, identification of parent fragments for large twin volume fractions, and classification of families having twin relationships with multiple families. To facilitate the development of these algorithms, large-grained ultra-high purity α-Ti deformed in compression along two directions is investigated. Graphs are utilized to handle non-local geometric merging and to represent relationships throughout the reconstruction process. When determining if a grain fragment is from the undeformed microstructure, the combined metrics of the fragment's orientation volume fraction in the initial texture and the directed graph centrality measure of out-closeness (the number of nodes reached in a graph from a given node) are essential. To address automation in reconstructing the sequence of twinning and relating fragments originating from a single grain in the initial microstructure, the twin family tree is formulated as a minimum spanning tree emanating from the initial grain family. A scheme constructing the distances associated with twin relationship comprising the spanning tree is developed, and a novel quasi-directional Prim spanning tree algorithm is used to determine the twin family tree. The procedure is demonstrated to significantly improve the level of automation in reconstructing twin hierarchies in heavily twinned microstructure compared to other methodologies in literature. The procedure can readily be applied to analyses of twinning in metals, as well as provide an approach for routinely extracting twin statistics at larger deformation levels than previously possible. Significantly, the procedure is demonstrated to be capable of identifying third generation twinning in α-Ti microstructures.

36 MATERIALS SCIENCE↗
NASA NTRS1992

Parallel computing strategies for block multigrid implicit solution of the Euler equations

A multigrid diagonal implicit algorithm has been developed to solve the three-dimensional Euler equations of inviscid compressible flow on block-structured grids. An improved method of advancing the multigrid cycle has been examined with respect to convergence rates, accuracy, and efficiency. In this method, the multigrid cycle is advanced independently in each of the blocks, and the information exchange between the blocks is done using buffer arrays, allowing for the asynchronous updating of interface boundary conditions. This updating scheme is used to eliminate the convergence problems found in a previous implementation of the algorithm while retaining its potential for efficient parallel execution. Results are computed for transonic flows past wings and include pressure distributions to verify the accuracy of the scheme and convergence histories to demonstrate the efficiency of the method. Efficiencies that were obtained using a modest number of processors in parallel are also presented and discussed.

Yadlin, Yoram↗
NASA NTRS1981

Optimal time splitting for two- and three-dimensional Navier-Stokes equations with mixed derivatives

A new explicit, time splitting algorithm has been developed for finite difference modelling of the full two and three-dimensional time-dependent, compressible, viscous Navier-Stokes equations of fluid mechanics. The scheme is optimal in the sense that the split operators achieve their maximum allowable time step, i.e., the corresponding Courant number. The algorithm allows a conservation-form formulation. Stability is proven analytically and verified numerically. In proving stability it was shown that all nine matrix coefficients of the Navier-Stokes equations are simultaneously symmetrizable by a similarity transformation. Two such transformations and their resulting symmetric matrix coefficients are presented explicitly.

Abarbanel, S.↗
DOE OSTI2022

Thermodynamics of correlated electrons in a magnetic field

The Hofstadter–Hubbard model captures the physics of strongly correlated electrons in an applied magnetic field, which is relevant to many recent experiments on Moiré materials. Few large-scale, numerically exact simulations exists for this model. In this work, we simulate the Hubbard–Hofstadter model using the determinant quantum Monte Carlo (DQMC) algorithm. We report the field and Hubbard interaction strength dependence of charge compressibility, fermion sign, local moment, magnetic structure factor, and specific heat. The gross structure of magnetic Bloch bands and band gaps determined by the non-interacting Hofstadter spectrum is preserved in the presence of U. Incompressible regions of the phase diagram have improved fermion sign. At half filling and intermediate and larger couplings, a strong orbital magnetic field delocalizes electrons and reduces the effect of Hubbard U on thermodynamic properties of the system.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1993

General-Purpose Time-Accurate Adaptive-Grid Method

Adaptive-grid method provides for generation of time-accurate grids used to solve wide variety of problems numerically. Intended use in computation of compressible flows. Part of solution method including algebraic grid-movement scheme; algorithm solving, by use of explicit numerical-integration scheme, Euler equations of unsteady flow; and temporal coupling routine utilizing grid-prediction/correction method to link dynamic grid with Euler-equation-solving algorithm. Improves ability to adapt grid to multiple features of solution and involves use of coarse grid in prediction stage of temporal coupling reducing central-processing-unit cost of obtaining new grid.

Bockelie, Michael J.↗
NASA NTRS1995

A Hybrid Parallel Preconditioning Algorithm For CFD

A new hybrid preconditioning algorithm will be presented which combines the favorable attributes of incomplete lower-upper (ILU) factorization with the favorable attributes of the approximate inverse method recently advocated by numerous researchers. The quality of the preconditioner is adjustable and can be increased at the cost of additional computation while at the same time the storage required is roughly constant and approximately equal to the storage required for the original matrix. In addition, the preconditioning algorithm suggests an efficient and natural parallel implementation with reduced communication. Sample calculations will be presented for the numerical solution of multi-dimensional advection-diffusion equations. The matrix solver has also been embedded into a Newton algorithm for solving the nonlinear Euler and Navier-Stokes equations governing compressible flow. The full paper will show numerous examples in CFD to demonstrate the efficiency and robustness of the method.

Barth,Timothy J.↗