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 793 records · Page 44

Optimal design of imperfect, anisotropic, ring-stiffened cylinders under combined loads

Development of an algorithm to perform the optimal sizing of buckling resistant, imperfect, anisotropic ring-stiffened cylinders subjected to axial compression, torsion, and internal pressure is presented. The enforcement of stability constraints is treated in a way that does not require any eigenvalue analysis. Assumption of criticality of these stability constraints during the optimal sizing of the cylinders produced designs that nevertheless satisfied all of the stress constraints as well as the stability constraints. Case studies performed using a combination of penalty function and feasible direction optimization methods indicate that the presence of the axisymmetric initial imperfection in the cylinder wall can significantly affect the optimal designs. Weight savings associated with the addition of two rings to the unstiffened cylinder and/or the addition of internal pressure is substantial when torsion makes up a significant fraction of the combined load state.

Ley, Robert P.↗

Entropy Stable Nonconforming Discretizations with the Summation-By-Parts Property for Curvilinear Coordinates

The entropy conservative/stable algorithm of Friedrichet al.(2018) for hyperbolic conservation laws on nonconforming p-refined/coarsened Cartesian grids, is extended to curvilinear grids for the compressible Euler equations. The primary focus is on constructing appropriate coupling procedures across the curvilinear nonconforming interfaces. A simple and flexible approach is proposed that uses interpolation operators from one element to the other. On the element faces,the analytic metrics are used to construct coupling terms, while metric terms in the volume are approximated to satisfy a discretization of the geometric conservation laws. The resulting scheme is entropy conservative/stable, elementwise conservative, and freestream preserving. The accuracy and stability properties of the resulting numerical algorithm are shown to be comparable to those ofthe original conforming scheme (∼p+ 1 convergence) in the context of the isentropic Euler vortex and the inviscid Taylor–Green vortex problems on manufactured high order grids.

David Del Rey Fernandez↗

Concentration fluctuations and flammability of cryo-compressed hydrogen and methane jets

Compressed hydrogen stored at cryogenic temperatures has a much higher density than room-temperature storage, which enables large-scale hydrogen storage and transport. An understanding of the release of cryogenic hydrogen from pressurized vessels is needed to evaluate the risk and safety concerns with the use of this fuel. Here, the present work extends the analysis of previous experimental studies that measured the gas concentrations of cryo-compressed hydrogen jets and methane jets using a laser Raman scattering diagnostic system. Since the Raman signals are very small, a denoising algorithm was applied to significantly reduce the noise to enable statistical analysis of the data. The transient features of the turbulent jets were characterized by their concentration intermittencies and probability density functions (PDFs). A two-part PDF was developed to predict the bimodal features of the jet concentration distributions. Then, the flammability factors of the cryogenic jets were calculated based on the intermittency and the PDF.

33 ADVANCED PROPULSION SYSTEMS↗

Relevant biochar characteristics influencing compressive strength of biochar-cement mortars

To counteract the contribution of CO 2 emissions by cement production and utilization, biochar is being harnessed as a carbon-negative additive in concrete. Increasing the cement replacement and biochar dosage will increase the carbon offset, but there is large variability in methods being used and many researchers report strength decreases at cement replacements beyond 5%. This work presents a reliable method to replace 10% of the cement mass with a vast selection of biochars without decreasing ultimate compressive strength, and in many cases significantly improving it. By carefully quantifying the physical and chemical properties of each biochar used, machine learning algorithms were used to elucidate the three most influential biochar characteristics that control mortar strength: initial saturation percentage, oxygen-to-carbon ratio, and soluble silicon. These results provide additional research avenues for utilizing several potential biomass waste streams to increase the biochar dosage in cement mixes without decreasing mechanical properties.

97 MATHEMATICS AND COMPUTING↗

A randomized sketching trust-region secant method for low-memory dynamic optimization

The numerical solution of dynamic optimization problems is often limited by the memory required to store the state trajectory, which is used to evaluate the objective function and its derivatives. Recently, [R. Muthukumar et al., SIAM Journal on Optimization 31(2), pp. 1242–1275 (2021)] introduced a trust-region method for dynamic optimization that employs randomized sketching to compress the state trajectory, resulting in inexact derivative computations. By adaptively learning the sketch rank, the trust-region algorithm achieves rigorous convergence guarantees. Here, we extend this approach to use secant Hessian approximations. Due to the randomness introduced by the sketch, the traditional secant update formulae can produce poor Hessian approximations. In particular, the difference of two gradients, computed from two different sketches, may be inconsistent. To overcome this, we employ a sketched approximation of the Hessian application, in lieu of computing the gradient difference. We numerically demonstrate the improved stability of this approach on an example from PDE-constrained optimization.

dynamic optimization↗

Linear complexity

We present factorization and solution phases for a new linear complexity direct solver designed for concurrent batch operations on fine-grained parallel architectures, for matrices amenable to hierarchical representation. We focus on the strong-admissibility-based $\mathscr{H}^{2}$ format, where strong recursive skeletonization factorization compresses remote interactions. We build upon previous implementations of $\mathscr{H}^{2}$ matrix construction for efficient factorization and solution algorithm design, which are illustrated graphically in stepwise detail. The algorithms are ‘blackbox’ in the sense that the only inputs are the matrix and right-hand side, without analytical or geometrical information about the origin of the system. We demonstrate linear complexity scaling in both time and memory on four representative families of dense matrices up to one million in size. Parallel scaling up to 16 threads is enabled by a multi-level matrix graph coloring and avoidance of dynamic memory allocations thanks to prefix-sum memory management. An experimental backward error analysis is included. We break down the timings of different phases, identify phases that are memory-bandwidth limited, and discuss alternatives for phases that may be sensitive to the trend to employ lower precisions for performance.

Boukaram, Wajih↗

Enhancements to the Munson-Dawson Model for Rock Salt

The Munson-Dawson (MD) constitutive model was originally developed in the 1980's to predict the thermomechanical behavior of rock salt. Since then, it has been used to simulate the evolution of the underground in nuclear waste repositories, mines, and storage caverns for gases and liquids. This report covers three enhancements to the MD model. (1) New transient and steady-state rate terms were added to capture salt's creep behavior at low equivalent stresses (below about 8 MPa). These new terms were calibrated against a series of triaxial compression creep experiments on salt from the Waste Isolation Pilot Plant. (2) The equivalent stress measure was changed from the Tresca stress to the Hosford stress. By varying a single exponent, the Hosford stress can reduce to the Tresca stress, the von Mises stress, or a range of behaviors in-between. This exponent was calibrated against true triaxial compression experiments on salt hollow cylinders. (3) The MD model's numerical implementation was overhauled, adding a line search algorithm to the implicit solution scheme. The new implementation was verified against analytical solutions, and benchmarked against a pre-existing implementation on a room closure simulation. The new implementation pre- dicted virtually identical room closure, yet sped up the simulation by 16x . (The source code of the new implementation is included in an appendix of this report.)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

An implicit finite-difference code for a two-equation turbulence model for three-dimensional flows

An implicit finite difference code was developed which solves the transport equations for the turbulence kinetic energy and its dissipation rate in generalized coordinates in three dimensions. The finite difference equations are solved using the Beam-Warming algorithm. The kinetic energy-dissipation code, KEM, provides the closure; i.e., the turbulent viscosity for calculation of either compressible or incompressible flows. Turbulent internal flow over a backward-facing step has been calculated using the present code in conjunction with the Incompressible Navier-Stokes Code, INS3D. The results are in good agreement with experiments and two dimensional computations of other researchers.

Kaul, U. K.↗

Impact and cratering processes on asteroids, satellites, and planets

A new model for scaling the outcome of catastrophic collisions from laboratory scale experiments was developed and applied to large bodies where gravitational binding is dominant. This algorithm includes a pressure dependent impact strength which predicts that large asteroids behave as intrinsically strong objects due to compressive loading of overburden throughout their interiors. For small bodies, where the gravitational loading is negligible, this model assumes that the impact strength is independent of size. There was considerable discussion of scaling laws for disruption when these results were presented to one authors colleagues. The pressure strengthening impact strength model was viewed as physically quite plausible; however, it was argued that the impact strength should decrease with increasing size in the size range where gravitational compression is negligible.

Chapman, Clark R.↗

Modeling of transitional flows

An effort directed at developing improved transitional models was initiated. The focus of this work was concentrated on the critical assessment of a popular existing transitional model developed by McDonald and Fish in 1972. The objective of this effort was to identify the shortcomings of the McDonald-Fish model and to use the insights gained to suggest modifications or alterations of the basic model. In order to evaluate the transitional model, a compressible boundary layer code was required. Accordingly, a two-dimensional compressible boundary layer code was developed. The program was based on a three-point fully implicit finite difference algorithm where the equations were solved in an uncoupled manner with second order extrapolation used to evaluate the non-linear coefficients. Iteration was offered as an option if the extrapolation error could not be tolerated. The differencing scheme was arranged to be second order in both spatial directions on an arbitrarily stretched mesh. A variety of boundary condition options were implemented including specification of an external pressure gradient, specification of a wall temperature distribution, and specification of an external temperature distribution. Overall the results of the initial phase of this work indicate that the McDonald-Fish model does a poor job at predicting the details of the turbulent flow structure during the transition region.

Lund, Thomas S.↗

Non-linear evolution of a second mode wave in supersonic boundary layers

The nonlinear time evolution of a second mode instability in a Mach 4.5 wall-bounded flow is computed by solving the full compressible, time-dependent Navier-Stokes equations. High accuracy is achieved by using a Fourier-Chebyshev collocation algorithm. Primarily inviscid in nature, second modes are characterized by high frequency and high growth rates compared to first modes. Time evolution of growth rate as a function of distance from the plate suggests this problem is amenable to the Stuart-Watson perturbation theory as generalized by Herbert.

Erlebacher, Gordon↗

Video data compression using artificial neural network differential vector quantization

An artificial neural network vector quantizer is developed for use in data compression applications such as Digital Video. Differential Vector Quantization is used to preserve edge features, and a new adaptive algorithm, known as Frequency-Sensitive Competitive Learning, is used to develop the vector quantizer codebook. To develop real time performance, a custom Very Large Scale Integration Application Specific Integrated Circuit (VLSI ASIC) is being developed to realize the associative memory functions needed in the vector quantization algorithm. By using vector quantization, the need for Huffman coding can be eliminated, resulting in superior performance against channel bit errors than methods that use variable length codes.

Krishnamurthy, Ashok K.↗

Advanced adaptive computational methods for Navier-Stokes simulations in rotorcraft aerodynamics

A phase 2 research and development effort was conducted in area transonic, compressible, inviscid flows with an ultimate goal of numerically modeling complex flows inherent in advanced helicopter blade designs. The algorithms and methodologies therefore are classified as adaptive methods, which are error estimation techniques for approximating the local numerical error, and automatically refine or unrefine the mesh so as to deliver a given level of accuracy. The result is a scheme which attempts to produce the best possible results with the least number of grid points, degrees of freedom, and operations. These types of schemes automatically locate and resolve shocks, shear layers, and other flow details to an accuracy level specified by the user of the code. The phase 1 work involved a feasibility study of h-adaptive methods for steady viscous flows, with emphasis on accurate simulation of vortex initiation, migration, and interaction. Phase 2 effort focused on extending these algorithms and methodologies to a three-dimensional topology.

Stowers, S. T.↗

High-performance compression of astronomical images

Astronomical images have some rather unusual characteristics that make many existing image compression techniques either ineffective or inapplicable. A typical image consists of a nearly flat background sprinkled with point sources and occasional extended sources. The images are often noisy, so that lossless compression does not work very well; furthermore, the images are usually subjected to stringent quantitative analysis, so any lossy compression method must be proven not to discard useful information, but must instead discard only the noise. Finally, the images can be extremely large. For example, the Space Telescope Science Institute has digitized photographic plates covering the entire sky, generating 1500 images each having 14000 x 14000 16-bit pixels. Several astronomical groups are now constructing cameras with mosaics of large CCD's (each 2048 x 2048 or larger); these instruments will be used in projects that generate data at a rate exceeding 100 MBytes every 5 minutes for many years. An effective technique for image compression may be based on the H-transform (Fritze et al. 1977). The method that we have developed can be used for either lossless or lossy compression. The digitized sky survey images can be compressed by at least a factor of 10 with no noticeable losses in the astrometric and photometric properties of the compressed images. The method has been designed to be computationally efficient: compression or decompression of a 512 x 512 image requires only 4 seconds on a Sun SPARCstation 1. The algorithm uses only integer arithmetic, so it is completely reversible in its lossless mode, and it could easily be implemented in hardware for space applications.

White, Richard L.↗

Scalability of a Low-Cost Multi-Teraflop Linux Cluster for High-End Classical Atomistic and Quantum Mechanical Simulations

Scalability of a low-cost, Intel Xeon-based, multi-Teraflop Linux cluster is tested for two high-end scientific applications: Classical atomistic simulation based on the molecular dynamics method and quantum mechanical calculation based on the density functional theory. These scalable parallel applications use space-time multiresolution algorithms and feature computational-space decomposition, wavelet-based adaptive load balancing, and spacefilling-curve-based data compression for scalable I/O. Comparative performance tests are performed on a 1,024-processor Linux cluster and a conventional higher-end parallel supercomputer, 1,184-processor IBM SP4. The results show that the performance of the Linux cluster is comparable to that of the SP4. We also study various effects, such as the sharing of memory and L2 cache among processors, on the performance.

Kikuchi, Hideaki↗

Solver and Turbulence Model Upgrades to OVERFLOW 2 for Unsteady and High-Speed Applications

An implicit unfactored SSOR algorithm has been added to the overset Navier-Stokes CFD code OVERFLOW 2 for unsteady and moving body applications. The HLLEM and HLLC third-order spatial upwind convective flux models have been added for high-speed flow applications. A generalized upwind transport equation has been added for solution of the two-equation turbulence models and the species equations. The generalized transport equation is solved using an unfactored SSOR implicit algorithm. Three hybrid RANS/DES turbulence models have been added for unsteady flow applications. Wall function boundary conditions that include compressibility and heat transfer effects have been also been added to OVERFLOW 2.

Nichols, Robert H.↗

DNTTD (Distributed Non-Negative Tensor Train Decomposition)

The era of exascale computing opens new venues for innovations and discoveries in many scientific, engineering, and commercial fields. However, with the exa flops also come the extra-large high-dimensional data generated by high performance computing. High-dimensional data is presented as multidimensional arrays, aka tensors. The presence of latent (not directly observable) structures in the tensor allows a unique representation and compression of the data by classical tensor factorization techniques. However, the classical tensor methods are not always stable or they can be exponential in their memory requirements, which makes them not suitable for high-dimensional tensors. Tensor train (TT) is a state-of-the-art tensor network introduced for factorization of high-dimensional tensors. TT transforms the initial high-dimensional tensor in a network of three-dimensional tensors that requires only a linear storage. Many real-world data, such as, density, temperature, population, probability, etc., are non-negative and for an easy interpretation, the algorithms preserving non-negativity are preferred. Here, we introduce a distributed non-negative tensor-train and demonstrate its scalability and the compression on synthetic and real world big datasets.

Bhattarai, Manish↗