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 1,081 records · Page 60
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

Numerical solution of the Navier-Stokes equations for a family of three-dimensional corner geometries

Three-dimensional corners occur in many aerodynamic engineering situations. Supersonic flow about such geometries is characterized by strong inviscid-viscid interactions which are analyzed adequately only through the solution of the Navier-Stokes equations. In this paper numerical solution for the laminar compressible Navier-Stokes equations are presented for a family of three-dimensional corners consisting of wedge-plate and wedge-cylinder intersecting boundaries. The equations of motion are transformed to a uniform rectangular computational domain. The computational technique is the MacCormack time-split algorithm vectorized and programmed to run on the CDD CYBER 203 computer. The metric data for the transformation is obtained from the 'two-boundary technique.'

Smith, R. E.↗
NASA NTRS1990

Implicit solution of three-dimensional internal turbulent flows

The scalar form of the approximate factorization method was used to develop a new code for the solution of three-dimensional internal laminar and turbulent compressible flows. The Navier-Stokes equations in their Reynolds-averaged form are iterated in time until a steady solution is reached. Evidence is given to the implicit and explicit artificial damping schemes that proved to be particularly efficient in speeding up convergence and enhancing the algorithm robustness. A conservative treatment of these terms at domain boundaries is proposed in order to avoid undesired mass and/or momentum artificial fluxes. Turbulence effects are accounted for by the zero-equation Baldwin-Lomax turbulence model and the q-omega two-equation model. For the first, an investigation on the model behavior in case of multiple boundaries is performed. The flow in a developing S-duct is then solved in the laminar regime at Reynolds number (Re) 790 and in the turbulent regime at Re=40,000 using the Baldwin-Lomax model . The Stanitz elbow is then solved using an inviscid version of the same code at M(sub inlet)=0.4. Grid dependence and convergence rate are investigated showing that for this solver the implicit damping scheme may play a critical role for convergence characteristics. The same flow at Re=2.5x10(exp 6) is solved with the Baldwin-Lomax and the q-omega models. Both approaches showed satisfactory agreement with experiments, although the q-omega model is slightly more accurate.

Michelassi, V.↗
NASA NTRS1991

Implicit solution of three-dimensional internal turbulent flows

The scalar form of the approximate factorization method was used to develop a new code for the solution of three dimensional internal laminar and turbulent compressible flows. The Navier-Stokes equations in their Reynolds-averaged form were iterated in time until a steady solution was reached. Evidence was given to the implicit and explicit artificial damping schemes that proved to be particularly efficient in speeding up convergence and enhancing the algorithm robustness. A conservative treatment of these terms at the domain boundaries was proposed in order to avoid undesired mass and/or momentum artificial fluxes. Turbulence effects were accounted for by the zero-equation Baldwin-Lomax turbulence model and the q-omega two-equation model. The flow in a developing S-duct was then solved in the laminar regime in a Reynolds number (Re) of 790 and in the turbulent regime at Re equals 40,000 by using the Baldwin-Lomax model. The Stanitz elbow was then solved by using an invicid version of the same code at M sub inlet equals 0.4. Grid dependence and convergence rate were investigated, showing that for this solver the implicit damping scheme may play a critical role for convergence characteristics. The same flow at Re equals 2.5 times 10(exp 6) was solved with the Baldwin-Lomax and the q-omega models. Both approaches show satisfactory agreement with experiments, although the q-omega model was slightly more accurate.

Michelassi, V.↗
NASA NTRS1995

Floating shock fitting via Lagrangian adaptive meshes

In recent work we have formulated a new approach to compressible flow simulation, combining the advantages of shock-fitting and shock-capturing. Using a cell-centered on Roe scheme discretization on unstructured meshes, we warp the mesh while marching to steady state, so that mesh edges align with shocks and other discontinuities. This new algorithm, the Shock-fitting Lagrangian Adaptive Method (SLAM), is, in effect, a reliable shock-capturing algorithm which yields shock-fitted accuracy at convergence.

Vanrosendale, John↗
NASA NTRS1996

Characterization of SiGe/Ge heterostructures and graded layers using variable angle spectroscopic ellipsometry

Variable angle spectroscopic ellipsometry (VASE) has been used to characterize Si(x)Ge(1-x)/Ge superlattices (SLs) grown on Ge substrates and thick Si(x)Ge(1-x)/Ge heterostructures grown on Si substrates. Our VASE analysis yielded the thicknesses and alloy compositions of all layers within the optical penetration depth of the surface. In addition, strain effects were observed in the VASE results for layers under both compressive and tensile strain. Results for the SL structures were found to be in close agreement with high resolution x-ray diffraction measurements made on the same samples. The VASE analysis has been upgraded to characterize linearly graded Si(x)Ge(1-x) buffer layers. The algorithm has been used to determine the total thickness of the buffer layer along with the start and end alloy composition by breaking the total thickness into many (typically more than 20) equal layers. Our ellipsometric results for 1 (mu)m buffer layers graded in the ranges 0.7 less than or = x less than or = 1.0, and 0.5 less than or = x less than or = 1.0 are presented, and compare favorably with the nominal values.

Croke, E. T.↗
NASA NTRS2004

Co-axial Joint Technology Applied to Antenna Backup Structures

The increasing demand to improve focusing accuracy and to accommodate higher frequencies in space communications and radio astronomy has created significant challenges for improving the capability of the constituent systems in radio antennas and telescopes. One important system is the radio antenna/telescope backup structure connections. The backup structure is a key element in providing a stable, precise and rigid support for the reflective surface. The ideal connection for these types of structures is rigid and concentric resulting in minimal deformation with stress/strain curves that are linear, repeatable and exhibiting no hysteresis over the entire service load range. Conceivably such a connection could be designed so that the stress/strain curve mimics the stress/strain characteristics of the connecting member in both tension and compression. When this is achieved then such joints can be said to be 'invisible' in the global behavior of the backup structure. At that point, overall reflector deflection becomes more linear and highly predictable. In conjunction with this advantage, optimized backup structure geometries, adaptive reflectors and compensating algorithms can best be applied in producing an instrument of unparalleled performance. This paper introduces Co-Axial Joint (CAJ) technology as the practical and economical means to produce an invisible connection.

trusses↗
NASA NTRS2008

2007 Research and Engineering Annual Report

Selected research and technology activities at NASA Dryden Flight Research Center are summarized. These following activities exemplify the Center's varied and productive research efforts: Developing a Requirements Development Guide for an Automatic Ground Collision Avoidance System; Digital Terrain Data Compression and Rendering for Automatic Ground Collision Avoidance Systems; Nonlinear Flutter/Limit Cycle Oscillations Prediction Tool; Nonlinear System Identification Using Orthonormal Bases: Application to Aeroelastic/Aeroservoelastic Systems; Critical Aerodynamic Flow Feature Indicators: Towards Application with the Aerostructures Test Wing; Multidisciplinary Design, Analysis, and Optimization Tool Development Using a Genetic Algorithm; Structural Model Tuning Capability in an Object-Oriented Multidisciplinary Design, Analysis, and Optimization Tool; Extension of Ko Straight-Beam Displacement Theory to the Deformed Shape Predictions of Curved Structures; F-15B with Phoenix Missile and Pylon Assembly--Drag Force Estimation; Mass Property Testing of Phoenix Missile Hypersonic Testbed Hardware; ARMD Hypersonics Project Materials and Structures: Testing of Scramjet Thermal Protection System Concepts; High-Temperature Modal Survey of the Ruddervator Subcomponent Test Article; ARMD Hypersonics Project Materials and Structures: C/SiC Ruddervator Subcomponent Test and Analysis Task; Ground Vibration Testing and Model Correlation of the Phoenix Missile Hypersonic Testbed; Phoenix Missile Hypersonic Testbed: Performance Design and Analysis; Crew Exploration Vehicle Launch Abort System-Pad Abort-1 (PA-1) Flight Test; Testing the Orion (Crew Exploration Vehicle) Launch Abort System-Ascent Abort-1 (AA-1) Flight Test; SOFIA Flight-Test Flutter Prediction Methodology; SOFIA Closed-Door Aerodynamic Analyses; SOFIA Handling Qualities Evaluation for Closed-Door Operations; C-17 Support of IRAC Engine Model Development; Current Capabilities and Future Upgrade Plans of the C-17 Data Rack; Intelligent Data Mining Capabilities as Applied to Integrated Vehicle Health Management; STARS Flight Demonstration No. 2 IP Data Formatter; Space-Based Telemetry and Range Safety (STARS) Flight Demonstration No. 2 Range User Flight Test Results; Aerodynamic Effects of the Quiet Spike(tm) on an F-15B Aircraft; F-15 Intelligent Flight Controls-Increased Destabilization Failure; F-15 Integrated Resilient Aircraft Control (IRAC) Improved Adaptive Controller; Aeroelastic Analysis of the Ikhana/Fire Pod System; Ikhana: Western States Fire Missions Utilizing the Ames Research Center Fire Sensor; Ikhana: Fiber-Optic Wing Shape Sensors; Ikhana: ARTS III; SOFIA Closed-Door Flutter Envelope Flight Testing; F-15B Quiet Spike(TM) Aeroservoelastic Flight Test Data Analysis; and UAVSAR Platform Precision Autopilot Flight Results.

Stoliker, Patrick↗
NASA NTRS2011

Technique for Solving Electrically Small to Large Structures for Broadband Applications

Fast iterative algorithms are often used for solving Method of Moments (MoM) systems, having a large number of unknowns, to determine current distribution and other parameters. The most commonly used fast methods include the fast multipole method (FMM), the precorrected fast Fourier transform (PFFT), and low-rank QR compression methods. These methods reduce the O(N) memory and time requirements to O(N log N) by compressing the dense MoM system so as to exploit the physics of Green s Function interactions. FFT-based techniques for solving such problems are efficient for spacefilling and uniform structures, but their performance substantially degrades for non-uniformly distributed structures due to the inherent need to employ a uniform global grid. FMM or QR techniques are better suited than FFT techniques; however, neither the FMM nor the QR technique can be used at all frequencies. This method has been developed to efficiently solve for a desired parameter of a system or device that can include both electrically large FMM elements, and electrically small QR elements. The system or device is set up as an oct-tree structure that can include regions of both the FMM type and the QR type. The system is enclosed with a cube at a 0- th level, splitting the cube at the 0-th level into eight child cubes. This forms cubes at a 1st level, recursively repeating the splitting process for cubes at successive levels until a desired number of levels is created. For each cube that is thus formed, neighbor lists and interaction lists are maintained. An iterative solver is then used to determine a first matrix vector product for any electrically large elements as well as a second matrix vector product for any electrically small elements that are included in the structure. These matrix vector products for the electrically large and small elements are combined, and a net delta for a combination of the matrix vector products is determined. The iteration continues until a net delta is obtained that is within the predefined limits. The matrix vector products that were last obtained are used to solve for the desired parameter. The solution for the desired parameter is then presented to a user in a tangible form; for example, on a display.

Jandhyala, Vikram↗
DOE OSTI2018

Validating quantum-classical programming models with tensor network simulations

The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, thus enabling single-node simulations of larger qubit registers, as compared to brute-force statevector simulators. Our simulator is designed to be extensible in both the tensor network form and the classical hardware used to run the simulation (multicore, GPU, distributed). The extensibility of the TNQVM simulator with respect to the simulation hardware type is achieved via a pluggable interface for different numerical backends (e.g., ITensor and ExaTENSOR numerical libraries). We demonstrate the utility of our TNQVM quantum circuit simulator through the verification of randomized quantum circuits and the variational quantum eigensolver algorithm, both expressed within the eXtreme-scale ACCelerator (XACC) programming model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Boundary-consistent B-spline filtering schemes and application to high-fidelity simulations of turbulence

A filtering operation, based on B-spline discretizations, is introduced to target weakly growing mesh-scale oscillations that can arise in high-fidelity turbulence simulations. This is a spectral regularization that can be described using the singular values of a banded matrix operator, with the filtering strength set by a scalar- or vector-valued penalty parameter. The penalty parameter can be specified though it can also be advantageously selected to minimize the generalized cross validation (GCV) measure of distance between the pre- and post-filtered solutions. Efficient algorithms are developed to compute both the scalar and vector penalty parameters. The B-spline filter has a sharper localization to high-wavenumber than compact or explicit filters of the same stencil width and is demonstrated for solutions of the Burgers' equation, decaying Burgers' turbulence, and compressible Navier–Stokes turbulent channel flow. Furthermore, these simulations confirm the scheme's numerical stability and ability to narrowly target the high wavenumber components of numerical solutions. An advantage over finite-difference filters is that these B-spline filters are stable on bounded domains and even preserve formal order of accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1979

Simulation of three-dimensional compressible viscous flow on the Illiac IV computer

Complicated three-dimensional viscous transonic flows about bodies at high angles of attack are solved on the Illiac IV computer. It is shown that certain approximate forms of the compressible Reynolds-averaged Navier-Stokes equations can be computed about realistic three-dimensional geometries with relative ease on the Illiac IV. The ease and efficiency with which this can be done depend on the approximations made in the basic equations, the choice of the numerical algorithm used for the solution, and the data-base system that controls the data management and identifies and manipulates the vectors. A pencil data-base system is found to be particularly suitable for the approximations and numerical method chosen to produce the results presented. In addition, some comparisons are made of computer predictions with experimental results for various lows about hemisphere-cylinders in both subsonic and supersonic free streams. The same viscous model and numerical model are used, showing good qualitative agreement in the location of separation lines and pressure distributions.

Pulliam, T. H.↗
NASA NTRS1982

A variational principle for compressible fluid mechanics. Discussion of the one-dimensional theory

The second law of thermodynamics is used as a variational statement to derive a numerical procedure to satisfy the governing equations of motion. The procedure, based on numerical experimentation, appears to be stable provided the CFL condition is satisfied. This stability is manifested no matter how severe the gradients (compression or expansion) are in the flow field. For reasons of simplicity only one dimensional inviscid compressible unsteady flow is discussed here; however, the concepts and techniques are not restricted to one dimension nor are they restricted to inviscid non-reacting flow. The solution here is explicit in time. Further study is required to determine the impact of the variational principle on implicit algorithms.

Prozan, R. J.↗
NASA NTRS1988

Vortex methods for separated flows

The numerical solution of the Euler or Navier-Stokes equations by Lagrangian vortex methods is discussed. The mathematical background is presented and includes the relationship with traditional point-vortex studies, convergence to smooth solutions of the Euler equations, and the essential differences between two and three-dimensional cases. The difficulties in extending the method to viscous or compressible flows are explained. Two-dimensional flows around bluff bodies are emphasized. Robustness of the method and the assessment of accuracy, vortex-core profiles, time-marching schemes, numerical dissipation, and efficient programming are treated. Operation counts for unbounded and periodic flows are given, and two algorithms designed to speed up the calculations are described.

Spalart, Philippe R.↗
NASA NTRS1991

Image gathering and digital restoration for fidelity and visual quality

The fidelity and resolution of the traditional Wiener restorations given in the prevalent digital processing literature can be significantly improved when the transformations between the continuous and discrete representations in image gathering and display are accounted for. However, the visual quality of these improved restorations also is more sensitive to the defects caused by aliasing artifacts, colored noise, and ringing near sharp edges. In this paper, these visual defects are characterized, and methods for suppressing them are presented. It is demonstrated how the visual quality of fidelity-maximized images can be improved when (1) the image-gathering system is specifically designed to enhance the performance of the image-restoration algorithm, and (2) the Wiener filter is combined with interactive Gaussian smoothing, synthetic high edge enhancement, and nonlinear tone-scale transformation. The nonlinear transformation is used primarily to enhance the spatial details that are often obscurred when the normally wide dynamic range of natural radiance fields is compressed into the relatively narrow dynamic range of film and other displays.

Huck, Friedrich O.↗
DOE OSTI2022

Learning high-dimensional parametric maps via reduced basis adaptive residual networks

We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error estimates. A scalable neural network learning framework is thus to learn the nonlinear compressed reduced basis mapping. Unlike the reduced basis construction, however, neural network constructions are not guaranteed to reduce errors by adding representation power, making it difficult to achieve good practical performance. Inspired by recent approximation theory that connects ResNets to sequential minimizing flows, we present an adaptive ResNet construction algorithm. This algorithm allows for depth-wise enrichment of the neural network approximation, in a manner that can achieve good practical performance by first training a shallow network and then adapting. We prove universal approximation of the associated neural network class for $L^2_v$ functions on compact sets. Our overall framework allows for constructive means to detect appropriate breadth and depth, and related compact parametrizations of neural networks, significantly reducing the need for architectural hyperparameter tuning. Numerical experiments for parametric PDE problems and a 3D CFD wing design optimization parametric map demonstrate that the proposed methodology can achieve remarkably high accuracy for limited training data, and outperformed other neural network strategies we compared against.

42 ENGINEERING↗
NASA NTRS2010

Dynamic Analysis of Sounding Rocket Pneumatic System Revision

The recent fusion of decades of advancements in mathematical models, numerical algorithms and curve fitting techniques marked the beginning of a new era in the science of simulation. It is becoming indispensable to the study of rockets and aerospace analysis. In pneumatic system, which is the main focus of this paper, particular emphasis will be placed on the efforts of compressible flow in Attitude Control System of sounding rocket.

Armen, Jerald↗
NASA NTRS2000

Multiresolution With Super-Compact Wavelets

The solution data computed from large scale simulations are sometimes too big for main memory, for local disks, and possibly even for a remote storage disk, creating tremendous processing time as well as technical difficulties in analyzing the data. The excessive storage demands a corresponding huge penalty in I/O time, rendering time and transmission time between different computer systems. In this paper, a multiresolution scheme is proposed to compress field simulation or experimental data without much loss of important information in the representation. Originally, the wavelet based multiresolution scheme was introduced in image processing, for the purposes of data compression and feature extraction. Unlike photographic image data which has rather simple settings, computational field simulation data needs more careful treatment in applying the multiresolution technique. While the image data sits on a regular spaced grid, the simulation data usually resides on a structured curvilinear grid or unstructured grid. In addition to the irregularity in grid spacing, the other difficulty is that the solutions consist of vectors instead of scalar values. The data characteristics demand more restrictive conditions. In general, the photographic images have very little inherent smoothness with discontinuities almost everywhere. On the other hand, the numerical solutions have smoothness almost everywhere and discontinuities in local areas (shock, vortices, and shear layers). The wavelet bases should be amenable to the solution of the problem at hand and applicable to constraints such as numerical accuracy and boundary conditions. In choosing a suitable wavelet basis for simulation data among a variety of wavelet families, the supercompact wavelets designed by Beam and Warming provide one of the most effective multiresolution schemes. Supercompact multi-wavelets retain the compactness of Haar wavelets, are piecewise polynomial and orthogonal, and can have arbitrary order of approximation. The advantages of the multiresolution algorithm are that no special treatment is required at the boundaries of the interval, and that the application to functions which are only piecewise continuous (internal boundaries) can be efficiently implemented. In this presentation, Beam's supercompact wavelets are generalized to higher dimensions using multidimensional scaling and wavelet functions rather than alternating the directions as in the 1D version. As a demonstration of actual 3D data compression, supercompact wavelet transforms are applied to a 3D data set for wing tip vortex flow solutions (2.5 million grid points). It is shown that high data compression ratio can be achieved (around 50:1 ratio) in both vector and scalar data set.

Lee, Dohyung↗
DOE OSTI2019

Real-time data processing in the ALICE High Level Trigger at the LHC

At the Large Hadron Collider at CERN in Geneva, Switzerland, atomic nuclei are collided at ultra-relativistic energies. Many final-state particles are produced in each collision and their properties are measured by the ALICE detector. The detector signals induced by the produced particles are digitized leading to data rates that are in excess of 48 GB/s. The ALICE High Level Trigger (HLT) system pioneered the use of FPGA- and GPU-based algorithms to reconstruct charged-particle trajectories and reduce the data size in real time. The results of the reconstruction of the collision events, available online, are used for high level data quality and detector-performance monitoring and real-time time-dependent detector calibration. The online data compression techniques developed and used in the ALICE HLT have more than quadrupled the amount of data that can be stored for offline event processing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗