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.

SourceResearch connectionFrom yearThrough year

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

At least 1,207 records · Page 67

All sources NASA NTRS DOE OSTI

NASA NTRS2019

Performance Optimization of Plate Airfoils for Martian Rotor Applications Using a Genetic Algorithm

The Mars Helicopter Technology Demonstrator will be flying on the NASA Mars 2020 rover mission scheduled to launch in July of 2020. The goal is to demonstrate the viability and potential of heavier-than-air vehicles in the Martian atmosphere. Research is performed at the Jet Propulsion Laboratory and NASA Ames Research Center to extend these capabilities and develop the Mars Science Helicopter as the next possible step for Martian rotorcraft. The Mars Science Helicopter mass is scaled up to the 5 to 20 kg range, allowing a greater payload (approximately 0.5 to 2.0 kg), and greater range (approximately 3 km). Key to achieving these targets is careful aerodynamic rotor design. The Martian atmosphere’s low density and the small helicopter rotors result in very low chord-based Reynolds number flows, which reduces rotor performance. A continuous genetic algorithm is developed to optimize airfoil shapes at representative conditions for the Martian atmosphere. Previous research indicates that sharp leading edges and plate-like airfoils can out-perform conventional airfoil shapes. The present optimization allows for camber and thickness variation of curved and polygonal thin airfoils with sharp leading edges. The airfoil performance is evaluated at the highest attainable liftto- drag ratio near a moderate lift coefficient at compressible Mach numbers, as expected for Martian rotor application. Increases between 16% and 29% in airfoil lift-to-drag ratio at fixed lift coefficients are observed when compared with the Mars Helicopter Technology Demonstrator airfoils. Improvements in hover figure of merit are estimated to be between 4% and 10%, when applied to the Mars Helicopter Technology Demonstrator.

Koning, Witold J. F.↗

DOE OSTI2023

A Conservative Finite-Volume Based Interface-Tracking Algorithm Using the Signed Distance Function

Methods for tracking an interface between two fluid phases are developed to ensure desired fluid properties, conservation, and stability are preserved in a finitevolume (FV) discretization. Here, the interface is tracked using a level set method where the signed distance function implicitly defines the interface. Marching methods are used to evaluate the value of the signed distance function, including a novel initialization method to initialize any implicit function to the signed distance function around sharp corners in the level set. Global conservation and consistency with a set of governing equations is enforced by a compression coefficient that measures the volumetric compression or expansion due to inaccuracies in the level set evaluation. A redistribution method is integrated into the volume correction to eliminate the small-cell instability while maintaining global conservation. This suite of methods is implemented and tested using static uniform velocity, and potential flow cases with multiple interface geometries. Results show these methods achieve up to second order accuracy, and are conservative. The application for these methods is intended to track the interface of a 3D printing filament in a finite-volume discretization of the all-speed Navier-Stokes equations.

42 ENGINEERING↗

NASA NTRS1992

Advanced Cardiac Life Support (ACLS) utilizing Man-Tended Capability (MTC) hardware onboard Space Station Freedom

Because of the time and distance involved in returning a patient from space to a definitive medical care facility, the capability for Advanced Cardiac Life Support (ACLS) exists onboard Space Station Freedom. Methods: In order to evaluate the effectiveness of terrestrial ACLS protocols in microgravity, a medical team conducted simulations during parabolic flights onboard the KC-135 aircraft. The hardware planned for use during the MTC phase of the space station was utilized to increase the fidelity of the scenario and to evaluate the prototype equipment. Based on initial KC-135 testing of CPR and ACLS, changes were made to the ventricular fibrillation algorithm in order to accommodate the space environment. Other constraints to delivery of ACLS onboard the space station include crew size, minimum training, crew deconditioning, and limited supplies and equipment. Results: The delivery of ACLS in microgravity is hindered by the environment, but should be adequate. Factors specific to microgravity were identified for inclusion in the protocol including immediate restraint of the patient and early intubation to insure airway. External cardiac compressions of adequate force and frequency were administered using various methods. The more significant limiting factors appear to be crew training, crew size, and limited supplies. Conclusions: Although ACLS is possible in the microgravity environment, future evaluations are necessary to further refine the protocols. Proper patient and medical officer restraint is crucial prior to advanced procedures. Also emphasis should be placed on early intubation for airway management and drug administration. Preliminary results and further testing will be utilized in the design of medical hardware, determination of crew training, and medical operations for space station and beyond.

Smith, M.↗

DOE OSTI2025

FedEFsz: Fair Cross-Silo Federated Learning System With Error-Bounded Lossy Compression

Cross-Silo federated learning systems have been identified as an efficient approach to scaling DNN training across geographically-distributed data silos to preserve the privacy of the training data. Communication efficiency and fairness are two major issues that need to be both satisfied when federated learning systems are deployed in practice. Simultaneously guaranteeing both of them, however, is exceptionally difficult because simply combining communication reduction and fairness optimization approaches often causes non-converged training or drastic accuracy degradation. Here, to bridge this gap, we propose FedEFsz. On the one hand, it integrates the state-of-the-art error-bounded lossy compressor SZ3 into cross-silo federated learning systems to significantly reduce communication traffic during the training. On the other hand, it achieves a high fairness (i.e., rather consistent model accuracy and performance across different clients) through a carefully designed heuristic algorithm that can tune the error-bound of SZ3 for different clients during the training. Extensive experimental results based on a GPU cluster with 65 GPU cards show that FedEFsz improves the fairness across different benchmarks by up to 60.88% and meanwhile reduces the communication traffic by up to 315×.

Cross-Silo Federated Learning Systems↗

NASA NTRS1976

On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane

Recognition of underlying straight lines and quadratic arcs in line drawings, and approximation of very noisy data by such line/curve segments, is addressed as a subproblem of the more general problem of optimum recognition of complicated line/curve drawings. Some specific algorithms are presented with extensions and interpretations for more complicated applications, and a data generation model is developed for the problem. Data are generated as a perturbation of a single underlying straight line or an elliptic or hyperbolic arc. Recursive estimation techniques, minimization of central processing unit time, decision making with controlled error probabilities, and modeling and recognition of pictures consisting of noisy curves are dealt with. Applications envisaged include: picture data compression, contour line representation in maps, intelligent data searches, and ballistic missile decoy tracking.

Cooper, D. B.↗

NASA NTRS1998

Comments on the Diffusive Behavior of Two Upwind Schemes

The diffusive characteristics of two upwind schemes, multi-dimensional fluctuation splitting and locally one-dimensional finite volume, are compared for scalar advection-diffusion problems. Algorithms for the two schemes are developed for node-based data representation on median-dual meshes associated with unstructured triangulations in two spatial dimensions. Four model equations are considered: linear advection, non-linear advection, diffusion, and advection-diffusion. Modular coding is employed to isolate the effects of the two approaches for upwind flux evaluation, allowing for head-to-head accuracy and efficiency comparisons. Both the stability of compressive limiters and the amount of artificial diffusion generated by the schemes is found to be grid-orientation dependent, with the fluctuation splitting scheme producing less artificial diffusion than the finite volume scheme. Convergence rates are compared for the combined advection-diffusion problem, with a speedup of 2.5 seen for fluctuation splitting versus finite volume when solved on the same mesh. However, accurate solutions to problems with small diffusion coefficients can be achieved on coarser meshes using fluctuation splitting rather than finite volume, so that when comparing convergence rates to reach a given accuracy, fluctuation splitting shows a speedup of 29 over finite volume.

Wood, William A.↗

NASA NTRS1998

Diffusion Characteristics of Upwind Schemes on Unstructured Triangulations

The diffusive characteristics of two upwind schemes, multi-dimensional fluctuation splitting and dimensionally-split finite volume, are compared for scalar advection-diffusion problems. Algorithms for the two schemes are developed for node-based data representation on median-dual meshes associated with unstructured triangulations in two spatial dimensions. Four model equations are considered: linear advection, non-linear advection, diffusion, and advection-diffusion. Modular coding is employed to isolate the effects of the two approaches for upwind flux evaluation, allowing for head-to-head accuracy and efficiency comparisons. Both the stability of compressive limiters and the amount of artificial diffusion generated by the schemes is found to be grid-orientation dependent, with the fluctuation splitting scheme producing less artificial diffusion than the dimensionally-split finite volume scheme. Convergence rates are compared for the combined advection-diffusion problem, with a speedup of 2-3 seen for fluctuation splitting versus finite volume when solved on the same mesh. However, accurate solutions to problems with small diffusion coefficients can be achieved on coarser meshes using fluctuation splitting rather than finite volume, so that when comparing convergence rates to reach a given accuracy, fluctuation splitting shows a 20-25 speedup over finite volume.

Wood, William A.↗

NASA NTRS2004

Finite Element Modeling Used to Study Stress Distribution on the Foot

A method to study the stress distribution inside the forefoot during walking was developed at the Cleveland Clinic Foundation by a researcher from the NASA Glenn Research Center. In this method, a semiautomated process was outlined to create a three-dimensional, patient-specific, finite element model (FEM) of the forefoot using magnetic resonance images (MRI). The images were processed in Matlab using the k-nearest neighbor (k-NN) classification algorithm and Sobel edge detection to separate the different tissue types: bone, skin, fat, and muscle. This information was used to create curves and surfaces that were exported to an FEM preprocessor known as Truegrid. In Truegrid, eight-noded or brick elements were created by using surface mapping. The FEM was processed and postprocessed in Abaqus. Material properties of the models were obtained from past experiments such as fat pad confined compression, skin axial and biaxial tests, muscle in vivo compressive tests, and reference literature (bone properties). Nonlinear (hyperelastic) material models were used for the skin (epidermis and dermis), fat, and muscles; and a linear elastic model was used for the bones. Muscle activation during walking yielded uncertainties in the muscle material model since contracted muscles are stiffer than relaxed muscles. These uncertainties were resolved by performing a sensitivity analysis of the muscle material properties. The original properties were multiplied by arbitrary factors of 2, 3, 0.5, and 0.33. The strain and stress distributions, as well as the locations of peak values, were similar in all cases. The peak contact pressure P obtained for each case varied with respect to the applied factor f as follows:

Morales, Nelson↗

NASA NTRS2013

A Systems-Level Perspective on Engine Ice Accretion

The accretion of ice in the compression system of commercial gas turbine engines operating in high ice water content conditions is a safety issue being studied by the aviation sector. While most of the research focuses on the underlying physics of ice accretion and the meteorological conditions in which accretion can occur, a systems-level perspective on the topic lends itself to potential near-term operational improvements. This work focuses on developing an accurate and reliable algorithm for detecting the accretion of ice in the low pressure compressor of a generic 40,000 lbf thrust class engine. The algorithm uses only the two shaft speed sensors and works regardless of engine age, operating condition, and power level. In a 10,000-case Monte Carlo simulation, the detection approach was found to have excellent capability at determining ice accretion from sensor noise with detection occurring when ice blocks an average of 6.8% of the low pressure compressor area. Finally, an initial study highlights a potential mitigation strategy that uses the existing engine actuators to raise the temperature in the low pressure compressor in an effort to reduce the rate at which ice accretes.

May, Ryan D.↗

NASA NTRS2013

An Approach to Detect and Mitigate Ice Particle Accretion in Aircraft Engine Compression Systems

The accretion of ice in the compression system of commercial gas turbine engines operating in high ice water content conditions is a safety issue being studied by the aviation sector. While most of the research focuses on the underlying physics of ice accretion and the meteorological conditions in which accretion can occur, a systems-level perspective on the topic lends itself to potential near-term operational improvements. This work focuses on developing an accurate and reliable algorithm for detecting the accretion of ice in the low pressure compressor of a generic 40,000 lbf thrust class engine. The algorithm uses only the two shaft speed sensors and works regardless of engine age, operating condition, and power level. In a 10,000-case Monte Carlo simulation, the detection approach was found to have excellent capability at determining ice accretion from sensor noise with detection occurring when ice blocks an average of 6.8 percent of the low pressure compressor area. Finally, an initial study highlights a potential mitigation strategy that uses the existing engine actuators to raise the temperature in the low pressure compressor in an effort to reduce the rate at which ice accretes.

May, Ryan D.↗

NASA NTRS2013

An Approach to Detect and Mitigate Ice Particle Accretion in Aircraft Engine Compression Systems

May, Ryan D.↗

NASA NTRS1990

Applications of an adaptive unstructured solution algorithm to the analysis of high speed flows

An upwind cell-centered scheme for the solution of steady laminar viscous high-speed flows is implemented on unstructured two-dimensional meshes. The first-order implementation employs Roe's (1981) approximate Riemann solver, and a higher-order extension is produced by using linear reconstruction with limiting. The procedure is applied to the solution of inviscid subsonic flow over an airfoil, inviscid supersonic flow past a cylinder, and viscous hypersonic flow past a double ellipse. A detailed study is then made of a hypersonic laminar viscous flow on a 24-deg compression corner. It is shown that good agreement is achieved with previous predictions using finite-difference and finite-volume schemes. However, these predictions do not agree with experimental observations. With refinement of the structured grid at the leading edge, good agreement with experimental observations for the distributions of wall pressure, heating rate and skin friction is obtained.

Thareja, R. R.↗

DOE OSTI2018

Stochastic reconstruction and microstructure modeling of SMC chopped fiber composites

Here, to establish an integrated Processing-Microstructure-Property workflow for the prediction of material behaviors, this paper presents a new stochastic pseudo-3D microstructure reconstruction method for Sheet Molding Compounds (SMC) chopped fiber composites. The proposed method captures the bi-level microstructural features of SMC composites. At the higher level, a Voronoi diagram-based algorithm is developed to reconstruct the unique substructure features of SMC fiber tows. The geometry of Voronoi cells is adjusted by a Simulated Annealing (SA) algorithm to match the geometrical statistics of the real fiber tows. At the lower level, the algorithm assigns fiber orientation to each Voronoi cell (which represents a fiber tow). The fiber orientation angles are recovered from a statistical fiber orientation tensor. The proposed method is employed to establish a multi-layer pseudo-3D SMC Representative Volume Element (RVE) model for Finite Element Analysis (FEA) of SMC microstructure. This model enables the prediction of mechanical properties based on the material processing information (e.g. fiber orientation tensor obtained from compression molding simulation), and the microstructure information obtained from microscopic imaging for an SMC composite. Lastly, the predicted properties are successfully validated by experimental tensile tests.

36 MATERIALS SCIENCE↗

NASA NTRS1993

Unstructured multigrid through agglomeration

In this work the compressible Euler equations are solved using finite volume techniques on unstructured grids. The spatial discretization employs a central difference approximation augmented by dissipative terms. Temporal discretization is done using a multistage Runge-Kutta scheme. A multigrid technique is used to accelerate convergence to steady state. The coarse grids are derived directly from the given fine grid through agglomeration of the control volumes. This agglomeration is accomplished by using a greedy-type algorithm and is done in such a way that the load, which is proportional to the number of edges, goes down by nearly a factor of 4 when moving from a fine to a coarse grid. The agglomeration algorithm has been implemented and the grids have been tested in a multigrid code. An area-weighted restriction is applied when moving from fine to coarse grids while a trivial injection is used for prolongation. Across a range of geometries and flows, it is shown that the agglomeration multigrid scheme compares very favorably with an unstructured multigrid algorithm that makes use of independent coarse meshes, both in terms of convergence and elapsed times.

Venkatakrishnan, V.↗

NASA NTRS1988

Data compression using adaptive transform coding. Appendix 1: Item 1

Adaptive low-rate source coders are described in this dissertation. These coders adapt by adjusting the complexity of the coder to match the local coding difficulty of the image. This is accomplished by using a threshold driven maximum distortion criterion to select the specific coder used. The different coders are built using variable blocksized transform techniques, and the threshold criterion selects small transform blocks to code the more difficult regions and larger blocks to code the less complex regions. A theoretical framework is constructed from which the study of these coders can be explored. An algorithm for selecting the optimal bit allocation for the quantization of transform coefficients is developed. The bit allocation algorithm is more fully developed, and can be used to achieve more accurate bit assignments than the algorithms currently used in the literature. Some upper and lower bounds for the bit-allocation distortion-rate function are developed. An obtainable distortion-rate function is developed for a particular scalar quantizer mixing method that can be used to code transform coefficients at any rate.

Rost, Martin Christopher↗

DOE OSTI2017

A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations

As on-node parallelism increases and the performance gap between the processor and the memory system widens, achieving high performance in large-scale scientific applications requires an architecture-aware design of algorithms and solvers. We focus on the eigenvalue problem arising in nuclear Configuration Interaction (CI) calculations, where a few extreme eigenpairs of a sparse symmetric matrix are needed. Here, we consider a block iterative eigensolver whose main computational kernels are the multiplication of a sparse matrix with multiple vectors (SpMM), and tall-skinny matrix operations. We then present techniques to significantly improve the SpMM and the transpose operation SpMM T by using the compressed sparse blocks (CSB) format. We achieve 3-4× speedup on the requisite operations over good implementations with the commonly used compressed sparse row (CSR) format. We develop a performance model that allows us to correctly estimate the performance of our SpMM kernel implementations, and we identify cache bandwidth as a potential performance bottleneck beyond DRAM. We also analyze and optimize the performance of LOBPCG kernels (inner product and linear combinations on multiple vectors) and show up to 15× speedup over using high performance BLAS libraries for these operations. The resulting high performance LOBPCG solver achieves 1.4× to 1.8× speedup over the existing Lanczos solver on a series of CI computations on high-end multicore architectures (Intel Xeons). We also analyze the performance of our techniques on an Intel Xeon Phi Knights Corner (KNC) processor.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Engine Combustion System Optimization Using Computational Fluid Dynamics and Machine Learning: A Methodological Approach

Gasoline compression ignition (GCI) engines are considered an attractive alternative to traditional spark-ignition and diesel engines. Here, a Machine Learning-Grid Gradient Ascent (ML-GGA) approach was developed to optimize the performance of internal combustion engines. 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 variable limit 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 with 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 with traditional approaches.

33 ADVANCED PROPULSION SYSTEMS↗

NASA NTRS1978

Numerical solution of a class of integral equations arising in two-dimensional aerodynamics

We consider the numerical solution of a class of integral equations arising in the determination of the compressible flow about a thin airfoil in a ventilated wind tunnel. The integral equations are of the first kind with kernels having a Cauchy singularity. Using appropriately chosen Hilbert spaces, it is shown that the kernel gives rise to a mapping which is the sum of a unitary operator and a compact operator. This allows the problem to be studied in terms of an equivalent integral equation of the second kind. A convergent numerical algorithm for its solution is derived by using Galerkin's method. It is shown that this algorithm is numerically equivalent to Bland's collocation method, which is then used as the method of computation. Extensive numerical calculations are presented establishing the validity of the theory.

Fromme, J.↗