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 883 records · Page 49

Development of in-use engine speed/torque heat maps across multiple heavy-duty commercial vehicle vocations

The U.S. Department of Energy (DOE) established the SuperTruck program with the goal of achieving brake thermal efficiency (BTE) greater than or equal to 55% as demonstrated in an operational heavy-duty (HD) diesel engine at a 65-miles-per-hour (mph) cruise point. Beyond the line-haul application, HD engines operate in a wide range of speed and torque conditions that are unlikely to yield the same efficiency under real-world operation. Thereby, the in-use engine heat maps described in this paper are a valuable tool to illustrate whether the engine-efficiency “sweet spot” matches the most frequent operating conditions. In this study, NREL developed engine heat maps to quantify the important operating points for various vocations using our Fleet DNA database of commercial fleet vehicle operations data. These heat maps clearly show that high-frequency operating points vary significantly according to vehicle vocation, while only a few of them match the sweet spot. Beyond the illustration, engine in-use heat maps can also be leveraged to build up reduced-order engine-efficiency models, needed by many rapid powertrain simulations. As case studies, nine reduced-order models – including line-haul truck, transfer truck, transit bus, transit bus with compressed natural gas (CNG) engine, drayage, refuse pickup, local delivery, utility truck, and school bus with CNG engine – using a trust-region reflective algorithm to fit the on-road data extracted based on the engine in-use heat maps.

33 ADVANCED PROPULSION SYSTEMS↗

A finite difference solution for the propagation of sound in near sonic flows

An explicit time/space finite difference procedure is used to model the propagation of sound in a quasi one-dimensional duct containing high Mach number subsonic flow. Nonlinear acoustic equations are derived by perturbing the time-dependent Euler equations about a steady, compressible mean flow. The governing difference relations are based on a fourth-order, two-step (predictor-corrector) MacCormack scheme. The solution algorithm functions by switching on a time harmonic source and allowing the difference equations to iterate to a steady state. The principal effect of the non-linearities was to shift acoustical energy to higher harmonics. With increased source strengths, wave steepening was observed. This phenomenon suggests that the acoustical response may approach a shock behavior at at higher sound pressure level as the throat Mach number aproaches unity. On a peak level basis, good agreement between the nonlinear finite difference and linear finite element solutions was observed, even through a peak sound pressure level of about 150 dB occurred in the throat region. Nonlinear steady state waveform solutions are shown to be in excellent agreement with a nonlinear asymptotic theory.

Hariharan, S. I.↗

A finite difference solution for the propagation of sound in near sonic flows

An explicit time/space finite difference procedure is used to model the propagation of sound in a quasi one-dimensional duct containing high Mach number subsonic flow. Nonlinear acoustic equations are derived by perturbing the time-dependent Euler equations about a steady, compressible mean flow. The governing difference relations are based on a fourth-order, two-step (predictor-corrector) MacCormack scheme. The solution algorithm functions by switching on a time harmonic source and allowing the difference equations to iterate to a steady state. The principal effect of the non-linearities was to shift aocustical energy to higher harmonics. With increased source strength, wave steepening was observed. This phenomenon suggests that the acoustical response may approach a shock behavior at higher sound pressure level as the throat Mach number approaches unity. On a peak level basis, good agreement between the nonlinear finite difference and linear finite element solutions was observed, even through a peak sound pressure level of about 150 dB occurred in the throat region. Nonlinear steady state waveform solutions are shown to be in excellent agreement with a nonlinear asymptotic theory. Previously announced in STAR as N83-30167

Hariharan, S. I.↗

Preconditioned conjugate gradient methods for the compressible Navier-Stokes equations

The compressible Navier-Stokes equations are solved for a variety of two-dimensional inviscid and viscous problems by preconditioned conjugate gradient-like algorithms. Roe's flux difference splitting technique is used to discretize the inviscid fluxes. The viscous terms are discretized by using central differences. An algebraic turbulence model is also incorporated. The system of linear equations which arises out of the linearization of a fully implicit scheme is solved iteratively by the well known methods of GMRES (Generalized Minimum Residual technique) and Chebyschev iteration. Incomplete LU factorization and block diagonal factorization are used as preconditioners. The resulting algorithm is competitive with the best current schemes, but has wide applications in parallel computing and unstructured mesh computations.

Venkatakrishnan, V.↗

Faster Algorithm For Computation Of Incompressible Flow

Improved algorithm yields faster numerical solutions of Navier-Stokes equations of steady or unsteady three-dimensional flow of incompressible fluid. In artificial-compressibility method, unsteady flow treated as incompressible in advancing from one time step to next, but at each time step (or in steady state), fluid treated as having variable compressibility enabling propagation of flow field, and subiterations performed in increments of pseudotime until effects of compressibility subside. Directly couples pressure and velocity fields at same time step and converts elliptic incompressible Navier-Stokes equations to hyperbolic form more amenable to numerical integration.

Rogers, S. E.↗

Algorithm For Integer Cosine Transforms

Algorithm computes coefficients of integer cosine transforms, containing only integer coefficients approximately proportional to floating-point coefficients of discrete cosine transforms. Used in compression of image data in blocks of N x N pixels, discrete cosine transforms involve large amounts of computation, typically amounting to 80 percent of computational load in data-compression scheme. In constructing integer approximations, competing requirements are to obtain data-compression and data-decompression performances comparable to those of corresponding descrete cosine transforms while taking advantage of simplicity afforded by integer arithmetic to reduce complexity and amount of computation.

Pollara, Fabrizio↗

Development of numerical methods for overset grids with applications for the integrated Space Shuttle vehicle

Algorithms and computer code developments were performed for the overset grid approach to solving computational fluid dynamics problems. The techniques developed are applicable to compressible Navier-Stokes flow for any general complex configurations. The computer codes developed were tested on different complex configurations with the Space Shuttle launch vehicle configuration as the primary test bed. General, efficient and user-friendly codes were produced for grid generation, flow solution and force and moment computation.

Chan, William M.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

During the past two decades, there has been significant progress in the field of numerical simulation of unsteady compressible viscous flows. At present, a variety of solution techniques exist such as the transonic small disturbance analyses (TSD), transonic full potential equation-based methods, unsteady Euler solvers, and unsteady Navier-Stokes solvers. These advances have been made possible by developments in three areas: (1) improved numerical algorithms; (2) automation of body-fitted grid generation schemes; and (3) advanced computer architectures with vector processing and massively parallel processing features. In this work, the GMRES scheme has been considered as a candidate for acceleration of a Newton iteration time marching scheme for unsteady 2-D and 3-D compressible viscous flow calculation; from preliminary calculations, this will provide up to a 65 percent reduction in the computer time requirements over the existing class of explicit and implicit time marching schemes. The proposed method has ben tested on structured grids, but is flexible enough for extension to unstructured grids. The described scheme has been tested only on the current generation of vector processor architecture of the Cray Y/MP class, but should be suitable for adaptation to massively parallel machines.

Hixon, Duane↗

Fast Parallel Tensor Times Same Vector for Hypergraphs

Hypergraphs are a popular paradigm to rep- resent complex real-world networks exhibiting multi-way relationships of varying sizes. Mining centrality in hyper- graphs via symmetric adjacency tensors has only recently become computationally feasible for large and complex datasets. To enable scalable computation of these and related hypergraph analytics, here we focus on the Sparse Symmetric Tensor Times Same Vector (S3TTVC) oper- ation. We introduce the Compound Compressed Sparse Symmetric (CCSS) format, an extension of the compact CSS format for hypergraphs of varying hyperedge sizes and present a shared-memory parallel algorithm to compute S3TTVC. We experimentally show S3TTVC computation using the CCSS format achieves better performance than the naive baseline, and is subsequently more performant for hypergraph H-eigenvector centrality.

Shivakumar, Shruti↗

A computer program for the calculation of the flow field including boundary layer effects for mixed-compression inlets at angle of attack

A computer program was developed which is capable of calculating the flow field in the supersonic portion of a mixed compression aircraft inlet operating at angle of attack. The supersonic core flow is computed using a second-order three dimensional method-of-characteristics algorithm. The bow shock and the internal shock train are treated discretely using a three dimensional shock fitting procedure. The boundary layer flows are computed using a second-order implicit finite difference method. The shock wave-boundary layer interaction is computed using an integral formulation. The general structure of the computer program is discussed, and a brief description of each subroutine is given. All program input parameters are defined, and a brief discussion on interpretation of the output is provided. A number of sample cases, complete with data listings, are provided.

Vadyak, J.↗

Real-time simulation of supersonic inlets

A previously published real-time simulation algorithm, the matrix stability region placement (MSRP) method, is used to simulate a small perturbation model of the NASA Lewis Mach 2.5 40-60 mixed compression inlet. The model is representative of high-speed internal flow propulsion systems which can be approximated as quasi-one-dimensional flows. The resulting system of equations, which is stiff, is also simulated by the second-order Adam-Bashforth method. It is shown that the MSRP method can be used to simulate small perturbation models of high-speed internal flow propulsion systems in real time.

Mossayebi, F.↗

Development of a CFD code for internal flows in liquid fueled engines

To support the design efforts of engines in which liquid propellants are used, one is often required to analyze incompressible, two-dimensional or axisymmetric flows within ducts and cavities with rotating walls and complicated geometries. The steady-state solution is of interest in most cases. This code is intended to provide a tool for efficient computational fluid dynamics (CFD) analysis of such flow problems, taking advantage of the artificial compressibility concept and the Beam-Warming numerical scheme modified for second order accurate, implicit boundary conditions. These concepts ensure a stable, robust, and accurate algorithm due to the reduced speed of sound and the accuracy of the boundary conditions. The code is dedicated only to two-dimensional or axisymmetric flows with or without swirl. Three-dimensional computation is excluded to increase efficiency and speed. This paper briefly presents the theory of the code, as well as several benchmark applications with comparison to well known analytical solutions. In all these test cases, the code produced accurate results.

Dakhoul, Youssef↗

Ambiguities in the retrieval of rain rates from radar returns at attenuating wavelengths

It is well-known that there are significant deterministic ambiguities inherent in trying to determine the particular rain rate profile which produced some given sequence of air- or space-borne radar echo powers at a single attenuating frequency. We quantify these ambiguities mathematically, and examine their effect on various proposed rain-rate profile retrieval algorithms. When the given data consist of a single radiometer measurement together with a single-look-angle single-frequency set of range-compressed echo powers, we show that several substantially different rain profiles can realistically be considered solutions. On the other hand, if the data consist of a single-look-angle two-frequency set of echo powers, the inversion problem generically has a unique solution. We note that traditional 'back-of-the-envelope' arguments can be quite misleading in assessing the extent of the ambiguity, even in the simplest cases.

Haddad, Z. S.↗

Fast Quasi-Static Time-Series (QSTS) for yearlong PV impact studies using vector quantization

The rapidly growing penetration levels of distributed photovoltaic (PV) systems requires more comprehensive studies to understand their impact on distribution feeders. IEEE P.1547 highlights the need for Quasi-Static Time Series (QSTS) simulation in conducting distribution impact studies for distributed resource interconnection. Unlike conventional scenario-based simulation, the time series simulation can realistically assess time-dependent impacts such as the operation of various controllable elements (e.g. voltage regulating tap changers) or impacts of power fluctuations. However, QSTS simulations are still not widely used in the industry because of the computational burden associated with running yearlong simulations at a 1-s granularity, which is needed to capture device controller effects responding to PV variability. This study presents a novel algorithm that reduces the number of times that the non-linear 3-phase unbalanced AC power flow must be solved by storing and reassigning power flow solutions as it progresses through the simulation. Each unique power flow solution is defined by a set of factors affecting the solution that can easily be queried. We demonstrate a computational time reduction of 98.9% for a yearlong simulation at 1-s resolution with minimal errors for metrics including: number of tap changes, capacitor actions, highest and lowest voltage on the feeder, line losses, and ANSI voltage violations. Finally, the key contribution of this work is the formulation of an algorithm capable of: (i) drastically reducing the computational time of QSTS simulations, (ii) accurately modeling distribution system voltage-control elements with hysteresis, and (iii) efficiently compressing result time series data for post-simulation analysis.

14 SOLAR ENERGY↗

ENGINE COMBUSTION SYSTEM OPTIMIZATION USING CFD AND MACHINE LEARNING: A METHODOLOGICAL APPROACH

Gasoline compression ignition (GCI) engines are considered an attractive alternative to traditional spark-ignition and diesel engines. In this work, a Machine Learning-Grid Gradient Algorithm (ML-GGA) approach was developed to optimize the performance of internal combustion engines. Machine learning (ML) offers a pathway to transform complex physical processes that occur in a combustion engine into compact informational processes. The developed ML-GGA model was compared with a recently developed Machine learning Genetic Algorithm (ML-GA). Detailed investigations of optimization solver parameters and variables limits extension were performed in the present ML-GGA model to improve the accuracy and robustness of the optimization process. Detailed descriptions of the different procedures, optimization tools and criteria that must be followed for a successful output are provided here. The developed ML-GGA approach was used to optimize the operating conditions (case 1) and the piston bowl design (case 2) of a heavy-duty diesel engine running on a gasoline fuel with a Research Octane Number (RON) of 80. The ML-GGA approach yielded > 2% improvements in the merit function, compared to the optimum obtained from a thorough computational fluid dynamics (CFD) guided system optimization. The predictions from the ML-GGA approach were validated with engine CFD simulations. This study demonstrates the potential of ML-GGA to significantly reduce the time needed for optimization problems, without loss in accuracy compared to traditional approaches.

engine optimization↗

Initial postbuckling analysis of elastoplastic thin-shear structures

The design of thin shell structures with respect to elastoplastic buckling requires an extended analysis of the influence of initial imperfections. For conservative design, the most critical defect should be assumed with the maximum allowable magnitude. This defect is closely related to the initial postbuckling behavior. An algorithm is given for the quasi-static analysis of the postbuckling behavior of structures that exhibit multiple buckling points. the algorithm based upon an energy criterion allows the computation of the critical perturbation which will be employed for the definition of the critical defect. For computational efficiency, the algorithm uses the reduced basis technique with automatic update of the modal basis. The method is applied to the axisymmetric buckling of cylindrical shells under axial compression, and conclusions are given for future research.

E G Carnoy↗

Embedded mesh solutions of the Euler equation using a multiple-grid method

New developments make it now possible to obtain solutions to Euler equations for many problems on the basis of acceptable computing times. The possibility of an extension of these methods to more difficult flows and increasingly complex geometries can depend on obtaining suitable grid structures. Thus, an attractive approach to complex geometries involves the recasting of the problem into the framework of a multiple-grid structure. The discrete equations represented on the grid are solved as a simultaneous system. In the present investigation, this is accomplished with the aid of Ni's multiple-grid algorithm. The multiple-grid structure provided in this study represents the first step towards a completely general modular approach to the solution of the complete compressible flow problem. In the presented cases, a fine mesh resolution is obtained within the embedded mesh regions, while preserving the global coarse mesh convergence rates.

Usab, W. J., Jr.↗

Instrumentation and robotic image processing using top-down model control

A top-down image processing scheme is described. A three-dimensional model of a robotic working environment, with robot manipulators, workpieces, cameras, and on-the-scene visual enhancements is employed to control and direct the image processing, so that rapid, robust algorithms act in an efficient manner to continually update the model. Only the model parameters are communicated, so that savings in bandwidth are achieved. This image compression by modeling is especially important for control of space telerobotics. The background for this scheme lies in an hypothesis of human vision put forward by the senior author and colleagues almost 20 years ago - the Scanpath Theory. Evidence was obtained that repetitive sequences of saccadic eye movements, the scanpath, acted as the checking phase of visual pattern recognition. Further evidence was obtained that the scanpaths were apparently generated by a cognitive model and not directly by the visual image. This top-down theory of human vision was generalized in some sense to the frame in artificial intelligence. Another source of the concept arose from bioengineering instrumentation for measuring the pupil and eye movements with infrared video cameras and special-purpose hardware.

Stark, Lawrence↗