Search NASA⌕ Search

SEARCH · Search NASA

Results for “block decomposition”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Learning Topological Operations on Meshes with Application to Block Decomposition of Polygons

We present a learning based framework for mesh quality improvement on unstructured triangular and quadrilateral meshes. Our model learns to improve mesh quality according to a prescribed objective function purely via self-play reinforcement learning with no prior heuristics. The actions performed on the mesh are standard local and global element operations. The goal is to minimize the deviation of the node degrees from their ideal values, which in the case of interior vertices leads to a minimization of irregular nodes.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

A multiblock grid generation technique applied to a jet engine configuration

Techniques are presented for quickly finding a multiblock grid for a 2D geometrically complex domain from geometrical boundary data. An automated technique for determining a block decomposition of the domain is explained. Techniques for representing this domain decomposition and transforming it are also presented. Further, a linear optimization method may be used to solve the equations which determine grid dimensions within the block decomposition. These algorithms automate many stages in the domain decomposition and grid formation process and limit the need for human intervention and inputs. They are demonstrated for the meridional or throughflow geometry of a bladed jet engine configuration.

Stewart, Mark E. M.↗
DOE OSTI2024

Graph-Based Representations and Applications to Process Simulation

Rapid and robust convergence of a process flowsheet is critical to enable large-scale simulations that address core scientific questions related to process design, optimization, and sustainability. However, due to the highly coupled and nonlinear nature of chemical processes, efficiently solving a flowsheet remains a challenge. In this work, we show that graph representations of the underlying physical phenomena in unit operations may help identify potential avenues to systematically reformulate the network of equations and enable more robust topology-based convergence of flowsheets. To this end, we developed graph abstractions of the governing equations of vapor-liquid and liquid-liquid equilibrium separation equipment. These graph abstractions consist of a mesh of interconnected variable nodes and equation nodes that are systematically generated through PhenomeNode, a new open-source library in Python developed in this study. We show that partitioning the graph into separate mass, energy, and equilibrium subgraphs can help decouple nonlinearities and guide decomposition algorithms. By employing the graph abstraction on an industrial separation process for separating glacial acetic acid from water, we implemented a new block decomposition scheme in BioSTEAM and demonstrated that this can accelerate convergence over a traditional sequential modular approach.

Distillation↗
NASA NTRS1982

UHV studies of the interaction of CO with small supported metal particles, Pd/mica

The interaction of carbon monoxide with small palladium particles supported on UHV-cleaved and heat-treated single-crystal mica was studied. The Pd particles were characterized and tested using the techniques of flash thermal desorption, Auger electron spectroscopy, core electron energy loss spectroscopy, and transmission electron microscopy. Evidence is presented for CO decomposition on Pd particles during CO adsorption-desorption experiments. The rate of CO decomposition increased rapidly with diminishing particle size. Residual carbon from CO decomposition blocked CO adsorption and had a strong poisoning effect on the CO oxidation reaction.

Doering, D. L.↗
NASA NTRS2001

Toward an Efficient Icing CFD Process Using an Interactive Software Toolkit: Smagglce 2D

Two-dimensional CID analysis for iced airfoils can be a labor-intensive task. The software toolkit SmaggIce 2D is being developed to help streamline the CID process and provide the unique features needed for icing. When complete, it will include a combination of partially automated and fully interactive tools for all aspects of the tasks leading up to the flow analysis: geometry preparation, domain decomposition. block boundary demoralization. gridding, and linking with a flow solver. It also includes tools to perform ice shape characterization, an important aid in determining the relationship between ice characteristics and their effects on aerodynamic performance. Completed tools, work-in-progress, and planned features of the software toolkit are presented here.

Vickerman, Mary B.↗
NASA NTRS2002

Toward an Efficient Icing CFD Process Using an Interactive Software Toolkit--SmaggIce 2D

Two-dimensional CFD analysis for iced airfoils can be a labor-intensive task. The software toolkit SmaggIce 2D is being developed to help streamline the CFD process and provide the unique features needed for icing. When complete, it will include a combination of partially automated and fully interactive tools for all aspects of the tasks leading up to the flow analysis: geometry preparation, domain decomposition, block boundary discretization. gridding, and linking with a flow solver. It also includes tools to perform ice shape characterization, an important aid in determining the relationship between ice characteristics and their effects on aerodynamic performance. Completed tools, work-in-progress, and planned features of the software toolkit are presented here.

Vickerman, Mary B.↗
NASA NTRS1986

Pusher propeller noise directivity and trends

The effects of pylon wake interaction on far-field propeller noise are studied using a model scale SR-2 propeller in a low-speed anechoic wind tunnel. The variation in the pusher noise penalty with axial angle theta and circumferential angle phi is compared to that of the tractor noise penalty; and the former exhibits minima occurring in the propeller plane and maxima occurring toward the propeller axis. The magnitude of the pusher installation noise penalty decreased with in increase in shaft horsepower and tip Mach number. Directivity comparisons revealed that both a noise reduction and a directivity pattern change resulted when the pylon was moved farther from the propeller. Noise emerging from the wake interaction was distinguished from that of the propeller by means of a modal decomposition.

Block, P. J. W.↗
DOE OSTI2024

Decomposing a renewable energy design and dispatch model

We address a mixed-integer linear programming model which selects a cost-minimizing set of available technologies with which to design a renewable energy system and prescribe their associated dispatch decisions. Realistically sized instances of such models pose computational challenges. To this end, we develop a Lagrangian heuristic based on a decomposition methodology which partitions the model into blocks and optimizes these more manageable, smaller subproblems. It also provides a lower bound to assess solution quality. In conclusion, we apply this methodology to the National Renewable Energy Laboratory's Renewable Energy Integration and Optimization (REopt TM ) model to generate near-optimal solutions to realistic instances containing, on average, approximately 300,000 variables and at least as many constraints, with a mean 30% optimality gap improvement using a five-minute solution time limit, compared to directly solving the original monolith.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1981

A development of grid generation procedure for multicomponent aerodynamic configuration

Two approaches for solving the transonic flow in a multi-block grid were explored. The first approach examines a method involving "zonal decomposition" wherein block boundaries are treated as true boundary surfaces separating interfacing grids. The issues investigated involve techniques for matching solutions at a block boundary. A feasibility study was completed and the results are presented. The second approach involves overlapping grids for differencing across a block boundary near an artificially induced coordinate singularity occurring at a fictitious corner. This approach selects a set of neighboring nodes for the fictitious corner such that the resulting physical cells for a node are topologically the same as any other node on the airfoil surface.

Chen, H. C.↗
NASA NTRS1995

Emerging CFD technologies and aerospace vehicle design

With the recent focus on the needs of design and applications CFD, research groups have begun to address the traditional bottlenecks of grid generation and surface modeling. Now, a host of emerging technologies promise to shortcut or dramatically simplify the simulation process. This paper discusses the current status of these emerging technologies. It will argue that some tools are already available which can have positive impact on portions of the design cycle. However, in most cases, these tools need to be integrated into specific engineering systems and process cycles to be used effectively. The rapidly maturing status of unstructured and Cartesian approaches for inviscid simulations makes suggests the possibility of highly automated Euler-boundary layer simulations with application to loads estimation and even preliminary design. Similarly, technology is available to link block structured mesh generation algorithms with topology libraries to avoid tedious re-meshing of topologically similar configurations. Work in algorithmic based auto-blocking suggests that domain decomposition and point placement operations in multi-block mesh generation may be properly posed as problems in Computational Geometry, and following this approach may lead to robust algorithmic processes for automatic mesh generation.

Aftosmis, Michael J.↗
DOE OSTI2025

Eureka: Enabling Fine-Grained Access and Range Queries on Compressed Scientific Data via Data-Index Co-Compression

Handling large-scale scientific data in high-performance computing (HPC) environments poses significant challenges, including excessive I/O, high storage costs, and slow query performance. Traditional approaches often require full data decompression and scans, making them impractical for real-time or interactive analysis. To address these limitations, we introduce Eureka, a unified data-index co-compression framework that enables fine-grained access and efficient range queries on compressed scientific datasets. Eureka integrates spatial domain decomposition with block-wise error-bounded lossy compression to support selective decompression. It constructs a hierarchical AVL-tree index during compression to capture block-level value ranges, enabling fast pruning during query execution. To reduce metadata overhead, the index itself is also compressed while ensuring recall-preserving results. Experiments on six diverse HPC simulation datasets show that Eureka achieves up to 25x data compression and over 300x index compression, surpassing state-of-the-art compressors such as SZ3 and ZFP in rate-distortion performance. Additionally, Eureka delivers over 30x speedup for low-selectivity range queries, making it a scalable and efficient solution for modern scientific data analysis.

Yan, Ning↗
NASA NTRS1975

Finite element computation of a viscous compressible free shear flow governed by the time dependent Navier-Stokes equations

A finite element algorithm for solution of fluid flow problems characterized by the two-dimensional compressible Navier-Stokes equations was developed. The program is intended for viscous compressible high speed flow; hence, primitive variables are utilized. The physical solution was approximated by trial functions which at a fixed time are piecewise cubic on triangular elements. The Galerkin technique was employed to determine the finite-element model equations. A leapfrog time integration is used for marching asymptotically from initial to steady state, with iterated integrals evaluated by numerical quadratures. The nonsymmetric linear systems of equations governing time transition from step-to-step are solved using a rather economical block iterative triangular decomposition scheme. The concept was applied to the numerical computation of a free shear flow. Numerical results of the finite-element method are in excellent agreement with those obtained from a finite difference solution of the same problem.

Cooke, C. H.↗
NASA NTRS1988

Extensions of the CSCM methodology for nonequilibrium reacting gas flows

The paper describes the extension of the CSCM flux difference splitting to produce conservative unconditionally stable implicit upwind methods for the extended equation set. The CSCM-S single data level relaxation algorithm is argued to be particularly advantageous for efficiently solving the set of equations. Attention is given to issues of alternative state variable representations and to complementary thermodynamic relations that parameterize and need to be effectively coupled with the solution procedure for the partial differential equations. Within the framework of iteration, consideration is given to more efficient approximate solution procedures than the full block coupled LU decomposition. Results of early numerical experiments are given to illustrate the developments.

Lombard, C. K.↗
NASA NTRS1989

A block-corrected subdomain solution procedure for recirculating flow calculations

This paper describes a robust and efficient subdomain solution procedure for two-dimensional recirculating flows. The solution domain is divided into a number of overlapping subdomains, and a direct fully coupled solution is obtained for each subdomain using a sparse matrix form of LU decomposition. An effective parabolic block correction procedure, which calculates global corrections to the tentative solution by a marching technique similar to that used for boundary layer flows, is used to accelerate the convergence of the basic procedure. The use of effective block correction is found to be essential for the success of the subdomain approach on strongly recirculating flows. In a number of laminar two-dimensional flows, the new block-corrected method performed extremely well, rivaling the best direct methods in execution time, while requiring substantially less computer storage. The new method proved to be from two to ten times faster than conventional iterative methods, while requiring only a moderate increase in storage.

Braaten, M. E.↗