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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A synthetic building operation dataset

Abstract This paper presents a synthetic building operation dataset which includes HVAC, lighting, miscellaneous electric loads (MELs) system operating conditions, occupant counts, environmental parameters, end-use and whole-building energy consumptions at 10-minute intervals. The data is created with 1395 annual simulations using the U.S. DOE detailed medium-sized reference office building, and 30 years’ historical weather data in three typical climates including Miami, San Francisco, and Chicago. Three energy efficiency levels of the building and systems are considered. Assumptions regarding occupant movements, occupants’ diverse temperature preferences, lighting, and MELs are adopted to reflect realistic building operations. A semantic building metadata schema - BRICK, is used to store the building metadata. The dataset is saved in a 1.2 TB of compressed HDF5 file. This dataset can be used in various applications, including building energy and load shape benchmarking, energy model calibration, evaluation of occupant and weather variability and their influences on building performance, algorithm development and testing for thermal and energy load prediction, model predictive control, policy development for reinforcement learning based building controls.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

AlphaBuilding - Synthetic Buildings Operation Dataset

This is a synthetic building operation dataset which includes HVAC, lighting, miscellaneous electric loads (MELs) system operating conditions, occupant counts, environmental parameters, end-use and whole-building energy consumptions at 10-minute intervals. The data is created with 1395 annual simulations using the U.S. DOE detailed medium-sized reference office building, and 30 years' historical weather data in three typical climates including Miami, San Francisco, and Chicago. Three energy efficiency levels of the building and systems are considered. Assumptions regarding occupant movements, occupants' diverse temperature preferences, lighting, and MELs are adopted to reflect realistic building operations. A semantic building metadata schema - BRICK, is used to store the building metadata. The dataset is saved in a 1.2 TB of compressed HDF5 file. This dataset can be used in various applications, including building energy and load shape benchmarking, energy model calibration, evaluation of occupant and weather variability and their influences on building performance, algorithm development and testing for thermal and energy load prediction, model predictive control, policy development for reinforcement learning based building controls.

AlphaBuilding↗
NASA NTRS1992

Conservative Grid-Interface Algorithm For Computing Flows

Best features of structured- and unstructured-grid methods combined. Gaps and overlaps between zonal grids eliminated by grid-interface algorithm, which generates single interfacial grid and corrects fluxes of flow quantities accordingly. Incorporated into two three-dimensional Navier-Stokes finite-volume codes and tested in computations of incompressible and compressible flows about simple bodies. Good numerical results obtained. General enough to be incorporated into other finite-volume codes without restrictions on complexities of shapes of bodies and zonal interfaces.

Klopfer, G. H.↗
NASA NTRS1993

A numerical analysis of supersonic flow over an axisymmetric afterbody

The performance of a pressure-based algorithm and the k-epsilon type turbulence models, including the original formulation proposed by Jones and Launder (1972), model extensions for refined treatment of time scales, and model corrections developed for treating compressible flows is assessed by analyzing the near-wake region of a Mach 2.5 flow over an axisymmetric cylindrical afterbody. The mechanisms responsible for the different levels of performance of the various turbulence models for the flow are investigated. It is shown that the k-epsilon models extended to allow for better response to the mean strain rate and corrected for compressibility result in better flowfield predictions than the original k-epsilon model.

Tucker, P. K.↗
NASA NTRS2004

Estimated spectrum adaptive postfilter and the iterative prepost filtering algirighms

The invention presents The Estimated Spectrum Adaptive Postfilter (ESAP) and the Iterative Prepost Filter (IPF) algorithms. These algorithms model a number of image-adaptive post-filtering and pre-post filtering methods. They are designed to minimize Discrete Cosine Transform (DCT) blocking distortion caused when images are highly compressed with the Joint Photographic Expert Group (JPEG) standard. The ESAP and the IPF techniques of the present invention minimize the mean square error (MSE) to improve the objective and subjective quality of low-bit-rate JPEG gray-scale images while simultaneously enhancing perceptual visual quality with respect to baseline JPEG images.

Linares, Irving↗
DOE OSTI2026

Thermophysical Properties of Liquid Tritium: A Path Integral Monte Carlo Study

Here, we present worm-algorithm, path integral Monte Carlo simulations of bulk liquid tritium. The simulations are benchmarked against empirically known thermophysical properties of liquid deuterium and liquid tritium. Results for the pair correlation function, chemical potential, isothermal compressibility, isochoric heat capacity, and single-particle momentum distributions are reported. Given the benchmark comparisons, our predictions of liquid tritium properties are expected to be accurate to within a few percent. Our simulations unambiguously demonstrate the significance of nuclear quantum effects to the properties of liquid tritium. In particular, under saturated vapor pressure, the average molecular kinetic energy of the liquid is found to be more than 60% higher than the value expected from the classical equipartition theorem.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Efficient and universal characterization of atomic structures through a topological graph order parameter

Abstract A graph-based order parameter, based on the topology of the graph itself, is introduced for the characterization of atomistic structures. The order parameter is universal to any material/chemical system and is transferable to all structural geometries. Four sets of data are used to validate both the generalizability and accuracy of the algorithm: (1) liquid lithium configurations spanning up to 300 GPa, (2) condensed phases of carbon along with nanotubes and buckyballs at ambient and high temperature, (3) a diverse set of aluminum configurations including surfaces, compressed and expanded lattices, point defects, grain boundaries, liquids, nanoparticles, all at nonzero temperatures, and (4) eleven niobium oxide crystal phases generated with ab initio molecular dynamics. We compare our proposed method to existing, state-of-the-art methods for the cases of aluminum and niobium oxide. Our order parameter uniquely classifies every configuration and outperforms all studied existing methods, opening the door for its use in a multitude of complex application spaces that can require fine structure-level characterization of atomistic graphs.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU

In the graph data structure like adjacency matrix, the connectivity of two nodes can be sufficiently represented using only 1 bit, but they are generally treated as 32-bit full-precision in state-of-the-art graph frameworks to adopt common sparse format such as CSR. Meanwhile, bit-level parallelism has recently be explored to have high-performance potential and low storage requirement on GPUs with dense bit-tiles. To fill the gap, our solution is a hierarchical storage format that contains the bit-indexing base and dense bit-tile units. Inherently, the granularity of the bit-tile is an essential factor in achieving both storage compression and GPU parallelism. How to find a sweet spot that trades off between avoiding sparsity and exploiting is comprehensively researched in this work. In the experiment, we evaluate the proposed storage format and algorithms on modern generation GPUs, including Pascal and Volta, to figure out critical software co-designs in conjunction with existing hardware-specific optimization.

Chen, Jou-An↗
NASA NTRS1984

One-dimensional unsteady modeling of supersonic inlet unstart/restart

A quasi-one-dimensional unsteady inviscid analysis of mixed-compression supersonic inlet flow is presented with emphasis on modeling of inlet unstart/restart phenomena. Numerical solution of the governing equations of motion is performed using a computationally efficient shock-capturing split-characteristics algorithm. Inlet unstart is modeled using a mass balance method which relates the expelled normal shock position ahead of the inlet cowl to the amount of spilled mass flow over the inlet housing. Comparison of computed results with experimental data for an axisymmetric inlet at a free-stream Mach number of 2.50 shows quite reasonable agreement over an entire unstart/restart transient which includes centerbody translation and retraction as well as bypass mass flow variations.

Adams, J. C., Jr.↗
NASA NTRS1997

Essentially Non-Oscillatory and Weighted Essentially Non-Oscillatory Schemes for Hyperbolic Conservation Laws

In these lecture notes we describe the construction, analysis, and application of ENO (Essentially Non-Oscillatory) and WENO (Weighted Essentially Non-Oscillatory) schemes for hyperbolic conservation laws and related Hamilton- Jacobi equations. ENO and WENO schemes are high order accurate finite difference schemes designed for problems with piecewise smooth solutions containing discontinuities. The key idea lies at the approximation level, where a nonlinear adaptive procedure is used to automatically choose the locally smoothest stencil, hence avoiding crossing discontinuities in the interpolation procedure as much as possible. ENO and WENO schemes have been quite successful in applications, especially for problems containing both shocks and complicated smooth solution structures, such as compressible turbulence simulations and aeroacoustics. These lecture notes are basically self-contained. It is our hope that with these notes and with the help of the quoted references, the reader can understand the algorithms and code them up for applications.

Shu, Chi-Wang↗
NASA NTRS1999

Integration of a Decentralized Linear-Quadratic-Gaussian Control into GSFC's Universal 3-D Autonomous Formation Flying Algorithm

A decentralized control is investigated for applicability to the autonomous formation flying control algorithm developed by GSFC for the New Millenium Program Earth Observer-1 (EO-1) mission. This decentralized framework has the following characteristics: The approach is non-hierarchical, and coordination by a central supervisor is not required; Detected failures degrade the system performance gracefully; Each node in the decentralized network processes only its own measurement data, in parallel with the other nodes; Although the total computational burden over the entire network is greater than it would be for a single, centralized controller, fewer computations are required locally at each node; Requirements for data transmission between nodes are limited to only the dimension of the control vector, at the cost of maintaining a local additional data vector. The data vector compresses all past measurement history from all the nodes into a single vector of the dimension of the state; and The approach is optimal with respect to standard cost functions. The current approach is valid for linear time-invariant systems only. Similar to the GSFC formation flying algorithm, the extension to linear LQG time-varying systems requires that each node propagate its filter covariance forward (navigation) and controller Riccati matrix backward (guidance) at each time step. Extension of the GSFC algorithm to non-linear systems can also be accomplished via linearization about a reference trajectory in the standard fashion, or linearization about the current state estimate as with the extended Kalman filter. To investigate the feasibility of the decentralized integration with the GSFC algorithm, an existing centralized LQG design for a single spacecraft orbit control problem is adapted to the decentralized framework while using the GSFC algorithm's state transition matrices and framework. The existing GSFC design uses both reference trajectories of each spacecraft in formation and by appropriate choice of coordinates and simplified measurement modeling is formulated as a linear time-invariant system. Results for improvements to the GSFC algorithm and a multiple satellite formation will be addressed. The goal of this investigation is to progressively relax the assumptions that result in linear time-invariance, ultimately to the point of linearization of the non-linear dynamics about the current state estimate as in the extended Kalman filter. An assessment will then be made about the feasibility of the decentralized approach to the realistic formation flying application of the EO-1/Landsat 7 formation flying experiment.

Folta, David C.↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

On the Strong Convergence of Forward-Backward Splitting in Reconstructing Jointly Sparse Signals

We consider the problem of reconstructing an infinite set of sparse, finite-dimensional vectors, that share a common sparsity pattern, from incomplete measurements. This is in contrast to the work (Daubechies et al., Pure Appl. Math. 57(11), 1413–1457, 2004), where the single vector signal can be infinite-dimensional, and (Fornasier and Rauhut, SIAM J. Numer. Anal. 46(2), 577613, 2008), which extends the aforementioned work to the joint sparse recovery of finite number of infinite-dimensional vectors. In our case, to take account of the joint sparsity and promote the coupling of nonvanishing components, we employ a convex relaxation approach with mixed norm penalty ℓ 2,1 . This paper discusses the computation of the solutions of linear inverse problems with such relaxation by a forward-backward splitting algorithm. However, since the solution matrix possesses infinitely many columns, the arguments of Daubechies et al. (Pure Appl. Math. 57(11), 1413–1457, 2004) no longer apply. As such, we establish new strong convergence results for the algorithm, in particular when the set of jointly sparse vectors is infinite.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Advanced Shuttle Strategies for Parallel QCCD Architectures

Trapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computational tasks. The quantum charge-coupled device (QCCD) framework has emerged as a promising solution, facilitating ion mobility for universal quantum computation. Current QCCD architectures predominantly feature a linear topology, which is increasingly recognized as inefficient for complex quantum operations. Anticipating the shift toward more efficacious designs, this article introduces an innovative quantum scheduling strategy optimized for parallel QCCD topologies. Our strategy proposes a probabilistic formula for ion movement, alongside ingenious methods for local layer generation and layer compression, yielding a significant reduction in ion shuttle times. Through simulations, we demonstrate that our strategy not only substantially outstrips the linear model but also exhibits better performance over other parallel strategies that employ greedy algorithms. This is achieved through our nuanced resolution of complexities, such as traffic blocks and trap capacity limitations. The consequent reduction in shuttle operations leads to lower energy consumption and an enhancement in the quantum computer's fidelity, ultimately accelerating program execution times.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Exploitation of Defects in High Entropy Ceramic Barrier Materials

A critical mission need exists to develop new materials that can withstand extreme environments and multiple sequential threats. High entropy materials, those containing 5 or more metals, exhibit many exciting properties which would potentially be useful in such situations. However, a particularly hard challenge in developing new high entropy materials is determining a priori which compositions will form the desired single phase material. The project outlined here combined several modeling and experimental techniques to explore several structure-property-relationships of high entropy ceramics in an effort to better understand the connection between their compositional components, their observed properties, and stability. We have developed novel machine learning algorithms which rapidly predict stable high entropy ceramic compositions, identified the stability interplay between configurational entropy and cation defects, and tested the mechanical stability of high entropy oxides using the unique capabilities at the Dynamic Compression Sector facility and the Saturn accelerator.

36 MATERIALS SCIENCE↗
DOE OSTI2023

High Speed Data Acquisition for Real Time Feedback in a Light Duty Engine Combustion-Mode Switching Application

The paper describes the integration of a high-speed data acquisition and diagnostics controller used in an advanced engine platform. The controller enables ultra-low emissions and new benchmarks of engine efficiency while running a Gasoline Compression Ignition (GCI) cycle on a 2.2L, 4-cylinder engine. The system enables real-time combustion feedback and vibration analysis in engines. The paper focuses on: (1) the development of an interpolative sampling algorithm for transposition of time acquired data to the crank angle domain using a production crank sensor (60-2 tooth wheel); (2) the control unit, high-speed data acquisition, communication rates between the dedicated data acquisition and base controller to ensure cycle-to-cycle feedback; and, (3) validation exercises using cylinder pressure measurements. Here, the study shows how the algorithm resolves cylinder pressure information over an engine cycle, validating its robustness across acquisition rates of 50 and 200 kHz, with crank angle resolutions of 0.5° and 0.1°. Results show that the 50 kHz, 0.5° hardware yield combustion phasing and torque estimates within 0.1° and 1% torque of those attained with the 200 kHz, 0.1° hardware. Finally, study shows the dedicated controller and communication speeds allow for next-cycle fuel injection correction for speeds above 5000 rpm.

42 ENGINEERING↗
NASA NTRS1985

Developments in the simulation of separated flows using finite difference methods

Compressible viscous flow simulation using finite difference Navier-Stokes and viscous-inviscid interaction methods is described. Recent developments are reviewed that significantly improve the computational efficiency of approximately factored implicit Navier-Stokes algorithms. Compared to Navier-Stokes codes, modern viscous-inviscid interaction codes are more computationally efficient, but have restricted application and are more complicated to program. Therefore, less efficient but more general viscous-inviscid interaction methods are investigated that use forcing functions instead of boundary condition matching, and a simple, direct/inverse, three-dimensional, finite-difference, boundary layer code is presented.

Steger, J. L.↗
NASA NTRS1992

Three-dimensional shock-wave/boundary-layer interactions with bleed through a circular hole

Computations were performed to study three-dimensional (3-D), shock-wave/boundary-layer interactions on a flat plate in which fluid in the boundary layer was bled through a circular hole into a plenum to control shock-wave induced separation. Results are presented which show the details of the 3-D flowfield about the bleed hole and how bleed-hole placement relative to shock-wave impingement affect upstream, spanwise, and downstream influence lengths. This study revealed an underlying mechanisms by which bleed holes can affect shock-wave/boundary-layer interactions. This investigation is based on the ensemble-averaged, "full-compressible" Navier-Stokes equations closed by the Baldwin-Lomax turbulence model. Solutions to these equations were obtained by an implicit finite-volume method based on the partially-split, two-factored algorithm of Steger.

Rimlinger, M. J.↗