Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adaptive compression”

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 55 records · Page 3

Transforming Energy through Computational Excellence. Exascale Computing: Combustion; Simulating Effects of Fuel Injection Location in Supersonic Jet Engines

Computational tractable simulations using an adaptive-mesh-refinement solverfor compressible reacting flows help researchers understand how variations in fuel injection location within the supersonic flow cavity impacts combustion efficiency. By identifying the important physical determinants of the combustion processes, this study shows a promising pathway to improving flame stability and combustion efficiency, as well as reducing emissions.

adaptive mesh refinement↗

An Incremental Tensor Train Decomposition Algorithm

We present a new algorithm for incrementally updating the tensor train decomposition of a stream of tensor data. This new algorithm, called the tensor train incremental core expansion (TT-ICE) improves upon the current state-of-the-art algorithms for compressing in tensor train format by developing a new adaptive approach that incurs significantly slower rank growth and guarantees compression accuracy. This capability is achieved by limiting the number of new vectors appended to the TT-cores of an existing accumulation tensor after each data increment. These vectors represent directions orthogonal to the span of existing cores and are limited to those needed to represent a newly arrived tensor to a target accuracy. We provide two versions of the algorithm: TT-ICE and TT-ICE accelerated with heuristics (TT-ICE*). Here, we provide a proof of correctness for TT-ICE and empirically demonstrate the performance of the algorithms in compressing large-scale video and scientific simulation datasets. Compared to existing approaches that also use rank adaptation, TT-ICE* achieves 57× higher compression and up to 95% reduction in computational time.

97 MATHEMATICS AND COMPUTING↗

Digital Modeling on Large Kernel Metamaterial Neural Network

Deep neural networks (DNNs) utilized recently are physically deployed with computational units (e.g., CPUs and GPUs). Such a design might lead to a heavy computational burden, significant latency, and intensive power consumption, which are critical limitations in applications such as Internet of Things (IoT), edge computing, and usage of drones. Recent advances in optical computational units (e.g., metamaterial) have shed light on energy-free and light-speed neural networks. However, the digital design of the metamaterial neural network (MNN) is fundamentally limited by its physical limitations, such as precision, noise, and bandwidth during fabrication. Moreover, the unique advantages of MNN’s (e.g., light-speed computation) are not fully explored via standard 3×3 convolution kernels. In this paper, we propose a novel large kernel metamaterial neural network (LMNN) that maximizes the digital capacity of the state-of-the-art (SOTA) MNN with model re-parametrization and network compression, while also considering the optical limitation explicitly. The new digital learning scheme can maximize the learning capacity of MNN while modeling the physical restrictions of meta-optics. With the proposed LMNN, the computation cost of the convolutional front-end can be offloaded to fabricated optical hardware. The experimental results on two publicly available datasets demonstrate that the optimized hybrid design improved classification accuracy while reducing computational latency. In conclusion, the development of the proposed LMNN is a promising step towards the ultimate goal of energy-free and light-speed AI.

97 MATHEMATICS AND COMPUTING↗

A limit to strong shock behavior in the dynamic response of matter at pressure

Solids under high pressures experience a series of regimes, where their microstructure adapts to the applied compression and these key transitions are discussed in this paper. As strain increases, new forces emerge at extreme pressures. A previous study introduced the concept of the weak shock limit (WSL), at which the ambient theoretical shear strength is overcome. Above the WSL, further deformation under strong shock conditions results in electrons occupying higher energy levels as strain increases. As pressure rises further, shock melting occurs in the material and at around three times this melting pressure, the strong shock limit is reached where the driving physics under pressure switches, with electrons forced into higher energy states. This leads to significant reduction in their compressibility due to changes in electronic structure and developing electron degeneracy pressures. A derivation for conditions at this state is presented, which indicates that a dependence of the threshold pressure on the free electron number density defines the limit observed. This correlation suggests that ambient material moduli govern material compression up to nearly 50% strain. These observations show that models should account for different behaviors as dominant physics changes in each regime accessed as shock pressure increases.

36 MATERIALS SCIENCE↗

Numerical Study on the Effect of Methane Doping in Hydrogen-Air Rotating Detonation Engines for Various Temperatures and Pressures

Rotating detonation engines (RDEs) have gained attention as a promising technology for future aviation engines. However, the numerical studies of these systems pose severe challenges due to the broad range of spatial and temporal scales. In this study, we use an adaptive mesh refinement based compressible, reactive solver PeleC to resolve the broad range of scales and accurately capture shock and detonation waves using high-resolution numerical schemes. Multi- species transport along with compressible Navier-Stokes equations are solved in the model along with a finite-rate based chemistry model. Embedded boundary method is used to model the complex geometry consisting of discrete fuel nozzles and the combustion chamber. The fuel consisting predominantly of hydrogen is doped with varying levels of methane while air is used as the oxidizer. For a specified total pressure and temperature, the number of stable detonation waves is found to decrease with increasing methane concentration in the fuel mixture. Additionally, no stable detonation solutions are observed for methane composition higher than 20% by volume for the range of operating conditions studied (300-900K, 10 Atm). The increased presence of high temperature zones is also indicative of higher thermal NOx emissions at low methane concentrations. The effect of fuel-air mixture composition and temperature on the detonability, detonation wave structure, mode transitions and their stability are analyzed in this study in addition to their implication on NOx emission.

automatic mesh refinement↗

A block-spectral adaptive H-/$p$-refinement strategy for shock-dominated problems

An adaptive H-/p-refinement strategy using a novel sensor is devised and tested in a block-spectral compressible Euler code equipped with adaptive-mesh refinement (AMR) and high-order flux-reconstruction numerics. At each Gauss quadrature point (or solution point) within each spectral block (or mesh element) the discrete velocity jump ΔU = ∂U/∂y 1 Δy 1 + ∂V/∂y 2 Δy 2 + ∂W/∂y 3 Δy 3 is calculated and normalized by the local speed of sound, a. Here, the grid spacing, Δx i , is calculated in each direction as the distance between auxiliary Gauss-Lobatto points, staggered relative to the solution points. The polynomial order is increased from p = 0 to p = p max in regions of weak compression, (ΔU/a) crit < ΔU/a < 0 and kept at p = p max in regions of flow expansion ΔU/a ≥ 0, while staying at the H = 0 base mesh level. Regions experiencing strong compressions, i.e. ΔU/a < (ΔU/a) crit , are H-refined up to H = H max where H max is applied at the location of maximum compression, ΔU/a = min(ΔU/a) in the domain, while keeping p = 0 to guarantee robustness and monotonicity of the solution in the H refined region. The critical value of (ΔU/a) crit = -0.06 is found to effectively separate smooth and non-smooth solution regions, supported by a 1D detonation initiation test case in ideal gas and a shock-to-detonation transition in high explosives. Using this value, the Sod shock tube, Shu-Osher problem, double Mach reflection and a 2D detonation in a high-explosive are simulated with the proposed adaptive H-/p-refinement. In the Sod shock tube case, p-refinement resolves the (weak) contact discontinuity while H-refinement enhances the grid resolution in the shock exploiting the monotonicity of the p = 0 reconstruction. For the Shu-Osher problem, p-refinement captures the small-scale oscillations trailing the shock that would be otherwise attenuated, while H-refinement triggered by the ΔU-sensor appropriately tracks the shock. In the double Mach reflection problem, H-refinement confines the numerical diffusion around the reflected shock while p-refinement recaptures many physical features trailing the shock. Finally, in the 2D high-explosive detonation case, H-refinement follows the leading shock and resolves the curvature of the detonation wave, while p-refinement adds resolution to the trailing reaction zone. Finally, the proposed methodology is tested in a detonation-wave propagation test case in high-explosives with numerical predictions comparing favorably against experiments.

97 MATHEMATICS AND COMPUTING↗

Volumetric Rendering on Wavelet-Based Adaptive Grid

Numerical modeling of physical phenomena frequently involves processes across a wide range of spatial and temporal scales. In the last two decades, the advancements in wavelet-based numerical methodologies to solve partial differential equations, combined with the unique properties of wavelet analysis to resolve localized structures of the solution on dynamically adaptive computational meshes, make it feasible to perform large-scale numerical simulations of a variety of physical systems on a dynamically adaptive computational mesh that changes both in space and time. Volumetric visualization of the solution is an essential part of scientific computing, yet the existing volumetric visualization techniques do not take full advantage of multi-resolution wavelet analysis and are not fully tailored for visualization of a compressed solution on the wavelet-based adaptive computational mesh. Our objective is to explore the alternatives for the visualization of time-dependent data on space-time varying adaptive mesh using volume rendering while capitalizing on the available sparse data representation. Two alternative formulations are explored. The first one is based on volumetric ray casting of multi-scale datasets in wavelet space. Rather than working with the wavelets at the finest possible resolution, a partial inverse wavelet transform is performed as a preprocessing step to obtain scaling functions on a uniform grid at a user-prescribed resolution. As a result, a solution in physical space is represented by a superposition of scaling functions on a coarse regular grid and wavelets on an adaptive mesh. An efficient and accurate ray casting algorithm is based just on these coarse scaling functions. Additional details are added during the ray tracing by taking an appropriate number of wavelets into account based on support overlap with the interpolation point, wavelet coefficient magnitude, and other characteristics, such as opacity accumulation (front to back ordering) and deviation from frontal viewing direction. The second approach is based on complementing of wavelet-based adaptive mesh to the traditional Adaptive Mesh Refinement (AMR) mesh. Both algorithms are illustrated and compared to the existing volume visualization software for Rayleigh-Benard thermal convection and electron density data sets in terms of rendering time and visual quality for different data compression of both wavelet-based and AMR adaptive meshes.

Vezolainen, Alexei V.↗

Influence of Real Gas Effects on Chemical Kinetics in Oxycombustion in Supercritical Carbon Dioxide

Oxycombustion in supercritical carbon dioxide is an integral part of the Allam Cycle, a technology that enables carbon-neutral use of fossil-fuels and carbon-negative use of biofuels. We simulate oxycombustion in a realistic combustor geometry for two sets of fuel conditions: pure methane, and a 40 percent methane/60 percent carbon dioxide blend, both at 343.15 K. The fuel jet mixes with a preheated swirler of 20 percent oxygen and 80 percent carbon dioxide at 1005.35 K, with a 100 percent carbon dioxide coflow at 783.15 K. The entire system operates at a pressure of 300 bar, putting the entire system above the critical temperature and pressure of carbon dioxide. Simulations are performed using PeleC, a compressible block-structured adaptive-mesh refinement (AMR) reacting flow code. Direct comparison of results using thermodynamically self-consistent implementations of the ideal gas equation of state and the Soave-Redlich-Kwong (SRK) equation of state allow quantification of the real gas impacts on combustion kinetics, flow temperatures, and pollutant formation.

carbon dioxide↗

A GPU-based compressible combustion solver for applications exhibiting disparate space and time scales

High-speed chemically active flows pose significant computational challenges due to their disparate space and time scales, with stiff chemistry often dominating simulation time. While modern scientific computing programs achieve exascale performance by leveraging graphics processing units (GPUs), existing GPU-based compressible combustion solvers face critical limitations in memory management, load balancing, and handling the highly localized nature of chemical reactions. To this end, we present a high-performance compressible reacting flow solver built on the AMReX framework and optimized for multi-GPU settings. Here, our approach addresses three GPU performance bottlenecks: memory access patterns through column-major storage optimization, computational workload variability via a bulk-sparse integration strategy for chemical kinetics, and multi-GPU load distribution for adaptive mesh refinement applications. The solver adapts existing matrix-based chemical kinetics formulations to multi-grid contexts. Using representative combustion applications, including 2D and 3D detonations and a 3D jet-in-crossflow configuration, we demonstrate 1.4–5× performance improvements over initial implementations on an in-house cluster of NVIDIA H100 GPUs, and near-ideal weak scaling on the Frontier supercomputer (Oak Ridge Leadership Computing Facility) with up to 1024 AMD Instinct MI250X GPUs. Roofline analysis reveals substantial improvements in arithmetic intensity for both convection (∼ 10 ×) and chemistry (∼ 4 ×) routines, confirming efficient utilization of GPU memory bandwidth and computational resources.

42 ENGINEERING↗

Nyx: A Massively Parallel AMR Code for Computational Cosmology

Nyx is a highly parallel, adaptive mesh, finite-volume N-body compressible hydrodynamics solver for cosmological simulations. It has been used to simulate different cosmological scenarios with a recent focus on the intergalactic medium and Lyman alpha forest. Together, Nyx, the compressible astrophysical simulation code, Castro, and the low Mach number code MAESTROeX, make up the AMReX-Astrophysics Suite of open-source, adaptive mesh, performance-portable astrophysical simulation codes. Other examples of cosmological simulation research codes include Enzo, Enzo-P/Cello, RAMSES, ART, FLASH, Cholla, as well as Gadget, Gasoline, Arepo, Gizmo, and SWIFT.

79 ASTRONOMY AND ASTROPHYSICS↗

Shifting Between Compute and Memory Bounds: A Compression-Enabled Roofline Model

In the evolving landscape of high-performance computing, especially to fight the end of Moore’s Law and Dennard’s Scaling, the ability to shift between compute-bound and memory-bound states is critical for enhancing adaptability and flexibility to diverse system and domain-specific architectures. Such capability is vital for optimizing performance across distinguished hardware configurations, such as accelerators, memory hierarchies, and cache systems. Despite that ad hoc optimization techniques, such as compressed/approximate computation, have been enabled for compute-/data-intensive computing for improved performance in distinct hardware settings, there lacks an understanding of 1) the rational behind performance improvement; 2) capability of different optimizations; 3) what optimization to respond to specific computational and memory demands. This work proposes a compression-enabled roofline model to facilitate this adaptability with data compression techniques to balance and transform between computational and memory demands. This model enables applications to adjust in response to the specific strengths and limitations of the underlying hardware and system to optimize resource utilization. The effectiveness of this approach is demonstrated with matrix multiplication kernels on different input sizes, with turning on/off various compression techniques, including 1) low-precision floating point; 2) sparse matrix formulation; and 3) compressed arrays with ZFP. By reducing memory transfer volumes and cache misses and increasing data locality and computational intensity through compression, the specific roofline model can transform between compute and memory bounds to align more efficiently with system capabilities. This advancement not only improves overall performance but also maximizes adaptability in diverse computing environments.

Naraparaju, Ramasoumya [University of Washington]↗

Lyapunov controlled counterdiabatic quantum optimization

We introduce a quantum algorithm that integrates counterdiabatic (CD) protocols with quantum Lyapunov control (QLC) to address combinatorial optimization problems. This approach offers versatility, allowing implementation as either a digital-analog or purely digital algorithm based on selected control strategies. By examining spin-glass Hamiltonians, we illustrate how the algorithm can explore alternative paths to enhance solution outcomes compared to conventional CD techniques. This method reduces dependence on extensive higher-order CD terms and on classical optimization techniques, making it more suitable for existing quantum computing platforms. The combination of digital compression via CD protocols and the adaptable nature of QLC methods positions this approach as a promising candidate for near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Internal energy balance and aerodynamic heating predictions for hypersonic turbulent boundary layers

The elemental equation governing heat transfer in aerodynamic flows is the internal energy equation. For a boundary layer flow, a double integration of the Reynolds-averaged form of this equation provides an expression of the wall heat flux in terms of the integrated effects, over the boundary layer, of various physical processes: turbulent dissipation, mean dissipation, turbulent heat flux, etc. Recently available direct numerical simulation data for a Mach 11 cold-wall turbulent boundary layer allows a comparison of the exact contributions of these terms in the energy equation to the wall heat flux with their counterparts modeled in the Reynolds-averaged Navier-Stokes (RANS) framework. Various approximations involved in RANS, both closure models as well as approximations involved in adapting incompressible RANS models to a compressible form, are assessed through examination of the internal energy balance. There are a number of potentially problematic assumptions and terms identified through this analysis. Here, the effect of compressibility corrections of the dilatational dissipation type is explored, as is the role of the modeled turbulent dissipation, in the context of wall heat flux predictions. The results indicate several potential avenues for RANS model improvement for hypersonic cold-wall boundary-layer flows.

42 ENGINEERING↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗

Compressed Gas Energy Storage Integrated with Combined Heat and Power Plant

A new energy storage technology, Comrpessed Gas Energy Storage (CGES), seeks to achieve low-cost, long-duration eenrgy storage by combining mature commercially-available technology (compressors, high-pressure gas storage, expander generators) and utilizing existing infrastructure for transportation and distribution of industrial gases. CGES utilizes existing compressors to transform electricity into potential energy (pressure), existing pipelines or underground storage to store said potential energy, and adds new expander generators at pressure reduction points in the networkm to recover part of the energy used in compression and transform it into electricity. By adapting itself to widely available existing infrastructure, CGES recovers energy that is otherwise wasted in the gas value chain, reduces the cost of new facilities, and avoids many of the development huddles typically associated with other long-duration energy storage technologies (e.g., Compressed Air Energy Storage, CAES). This paper discusses the performance and economics associated with CGES as a standalone project and in combination with a thermal power plant, based on a concept for integration of the technology over an existing lateral pipeline transporting natural gas to an 85 MW combined heat and power plant that feeds power to a grid with increasing share of renewable power generation.

03 NATURAL GAS↗

Efficient DNA sequence compression with neural networks

Abstract Background The increasing production of genomic data has led to an intensified need for models that can cope efficiently with the lossless compression of DNA sequences. Important applications include long-term storage and compression-based data analysis. In the literature, only a few recent articles propose the use of neural networks for DNA sequence compression. However, they fall short when compared with specific DNA compression tools, such as GeCo2. This limitation is due to the absence of models specifically designed for DNA sequences. In this work, we combine the power of neural networks with specific DNA models. For this purpose, we created GeCo3, a new genomic sequence compressor that uses neural networks for mixing multiple context and substitution-tolerant context models. Findings We benchmark GeCo3 as a reference-free DNA compressor in 5 datasets, including a balanced and comprehensive dataset of DNA sequences, the Y-chromosome and human mitogenome, 2 compilations of archaeal and virus genomes, 4 whole genomes, and 2 collections of FASTQ data of a human virome and ancient DNA. GeCo3 achieves a solid improvement in compression over the previous version (GeCo2) of $2.4\%$, $7.1\%$, $6.1\%$, $5.8\%$, and $6.0\%$, respectively. To test its performance as a reference-based DNA compressor, we benchmark GeCo3 in 4 datasets constituted by the pairwise compression of the chromosomes of the genomes of several primates. GeCo3 improves the compression in $12.4\%$, $11.7\%$, $10.8\%$, and $10.1\%$ over the state of the art. The cost of this compression improvement is some additional computational time (1.7–3 times slower than GeCo2). The RAM use is constant, and the tool scales efficiently, independently of the sequence size. Overall, these values outperform the state of the art. Conclusions GeCo3 is a genomic sequence compressor with a neural network mixing approach that provides additional gains over top specific genomic compressors. The proposed mixing method is portable, requiring only the probabilities of the models as inputs, providing easy adaptation to other data compressors or compression-based data analysis tools. GeCo3 is released under GPLv3 and is available for free download at https://github.com/cobilab/geco3.

Silva, Milton↗

A new re-redistribution scheme for weighted state redistribution with adaptive mesh refinement

State redistribution (SRD) is a recently developed technique for stabilizing cut cells that result from finite-volume embedded boundary methods. SRD has been successfully applied to a variety of compressible and incompressible flow problems. When used in conjunction with adaptive mesh refinement (AMR), additional steps are needed to preserve the accuracy and conservation properties of the solution if the embedded boundary is not restricted to a single level of the mesh hierarchy. In this work, we extend the weighted state redistribution algorithm to cases where cut cells live at or near a coarse-fine interface within the domain. Here, we present numerical results that demonstrate that the algorithm is conservative when the coarse-fine interface intersects the embedded boundary. Additionally we compare the numerical solution of the Sod shock tube problem in an inclined cylinder with the analytic solution, and we compare the simulation of a shock hitting a cylindrical obstacle with experimental data. Finally we demonstrate the methodology for simulation of the multicomponent compressible Navier-Stokes equations in a piston-bowl geometry, and discuss the computational efficiency gained by not requiring the entire embedded boundary to be defined at the finest level.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Physicochemical and Performance Characterization of Six Commercial Organic Solvent Nanofiltration Membranes

This work introduces a novel, gradient-free metamaterial design method based on Gaussian process regression to represent the density field of a unit cell. The dimension of the design space is determined by the covariance matrix dimension in the Gaussian process regression. We propose compressing this matrix using an autoencoder, enabling the decoder to generate the density field and effectively reduce the originally large design space to a lower-dimensional subspace. In this compressed space, we employ an active learning method, Bayesian Adaptive Direct Search (BADS), for efficient exploration of the design space. We demonstrate that for simple 2D designs aimed at maximizing unit cell stiffness, our method yields results comparable to those of standard topology optimization. Furthermore, we extend our approach to various mechanical problems, from linear elasticity to hyperelastic large deformation and elasto-plasticity under finite deformation, to 3D metamaterial design. This illustrates the method’s versatility and effectiveness across a range of applications.

Wu, Haoran↗