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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 991 records · Page 55

All sources NASA NTRS DOE OSTI

DOE OSTI2021

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↗

NASA NTRS1983

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.↗

NASA NTRS1984

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.↗

NASA NTRS1990

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.↗

NASA NTRS1991

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.↗

NASA NTRS1994

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↗

NASA NTRS1995

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.↗

DOE OSTI2015

OpenACC acceleration of an unstructured CFD solver based on a reconstructed discontinuous Galerkin method for compressible flows

Here, an OpenACC directive-based graphics processing unit (GPU) parallel scheme is presented for solving the compressible Navier–Stokes equations on 3D hybrid unstructured grids with a third-order reconstructed discontinuous Galerkin method. The developed scheme requires the minimum code intrusion and algorithm alteration for upgrading a legacy solver with the GPU computing capability at very little extra effort in programming, which leads to a unified and portable code development strategy. A face coloring algorithm is adopted to eliminate the memory contention because of the threading of internal and boundary face integrals. A number of flow problems are presented to verify the implementation of the developed scheme. Timing measurements were obtained by running the resulting GPU code on one Nvidia Tesla K20c GPU card (Nvidia Corporation, Santa Clara, CA, USA) and compared with those obtained by running the equivalent Message Passing Interface (MPI) parallel CPU code on a compute node (consisting of two AMD Opteron 6128 eight-core CPUs (Advanced Micro Devices, Inc., Sunnyvale, CA, USA)). Speedup factors of up to 24× and 1.6× for the GPU code were achieved with respect to one and 16 CPU cores, respectively. The numerical results indicate that this OpenACC-based parallel scheme is an effective and extensible approach to port unstructured high-order CFD solvers to GPU computing.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

A Pilot Evaluation of a 4-Dimensional Cone-Beam Computed Tomographic Scheme Based on Simultaneous Motion Estimation and Image Reconstruction

Purpose: To evaluate the performance of a 4-dimensional (4-D) cone-beam computed tomographic (CBCT) reconstruction scheme based on simultaneous motion estimation and image reconstruction (SMEIR) through patient studies. Methods and Materials: The SMEIR algorithm contains 2 alternating steps: (1) motion-compensated CBCT reconstruction using projections from all phases to reconstruct a reference phase 4D-CBCT by explicitly considering the motion models between each different phase and (2) estimation of motion models directly from projections by matching the measured projections to the forward projection of the deformed reference phase 4D-CBCT. Four lung cancer patients were scanned for 4 to 6 minutes to obtain approximately 2000 projections for each patient. To evaluate the performance of the SMEIR algorithm on a conventional 1-minute CBCT scan, the number of projections at each phase was reduced by a factor of 5, 8, or 10 for each patient. Then, 4D-CBCTs were reconstructed from the down-sampled projections using Feldkamp-Davis-Kress, total variation (TV) minimization, prior image constrained compressive sensing (PICCS), and SMEIR. Using the 4D-CBCT reconstructed from the fully sampled projections as a reference, the relative error (RE) of reconstructed images, root mean square error (RMSE), and maximum error (MaxE) of estimated tumor positions were analyzed to quantify the performance of the SMEIR algorithm. Results: The SMEIR algorithm can achieve results consistent with the reference 4D-CBCT reconstructed with many more projections per phase. With an average of 30 to 40 projections per phase, the MaxE in tumor position detection is less than 1 mm in SMEIR for all 4 patients. Conclusion: The results from a limited number of patients show that SMEIR is a promising tool for high-quality 4D-CBCT reconstruction and tumor motion modeling.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

NASA NTRS1993

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↗

DOE OSTI2023

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↗

DOE OSTI2016

Cortexsys v. 3.0

This code implements a variety of "deep learning" algorithms from openly published academic journals. These deep learning algorithms allow the user to train neural networks to do various tasks. Such tasks include predicting future values in a time sequence, categorizing images or compressing information. The code is mostly written in the easy to understand Matlab / GNU Octave language, which enables rapid prototyping and understanding for research and educational purposes.

Cox, JonathanA.↗

DOE OSTI2013

Designing Experiments Through Compressed Sensing

In the following paper, we discuss how to design an ensemble of experiments through the use of compressed sensing. Specifically, we show how to conduct a small number of physical experiments and then use compressed sensing to reconstruct a larger set of data. In order to accomplish this, we organize our results into four sections. We begin by extending the theory of compressed sensing to a finite product of Hilbert spaces. Then, we show how these results apply to experiment design. Next, we develop an efficient reconstruction algorithm that allows us to reconstruct experimental data projected onto a finite element basis. Finally, we verify our approach with two computational experiments.

Young, Joseph G.↗

NASA NTRS1982

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.↗

NASA NTRS1990

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.↗

NASA NTRS1992

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↗

NASA NTRS1993

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.↗

DOE OSTI2016

Cortexsys v. 3.0

Cox, Jonathan A.↗