Search NASASearch

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

A linear decomposition method for large optimization problems. Blueprint for development

A method is proposed for decomposing large optimization problems encountered in the design of engineering systems such as an aircraft into a number of smaller subproblems. The decomposition is achieved by organizing the problem and the subordinated subproblems in a tree hierarchy and optimizing each subsystem separately. Coupling of the subproblems is accounted for by subsequent optimization of the entire system based on sensitivities of the suboptimization problem solutions at each level of the tree to variables of the next higher level. A formalization of the procedure suitable for computer implementation is developed and the state of readiness of the implementation building blocks is reviewed showing that the ingredients for the development are on the shelf. The decomposition method is also shown to be compatible with the natural human organization of the design process of engineering systems. The method is also examined with respect to the trends in computer hardware and software progress to point out that its efficiency can be amplified by network computing using parallel processors.

Sobieszczanski-Sobieski, J.

Dynamic Mode Decomposition of Unsteady Pressure-Sensitive Paint Measurements for the NASA Unitary Plan Wind Tunnel Tests

This paper describes the Dynamic Mode Decomposition (DMD) of the pressures on the scale model of the Space Launch System (SLS) Block 1 cargo vehicle with the Unsteady Pressure-Sensitive Paint (uPSP) measurements, which were collected in the Ascent Transient Aerodynamics Tests with the Unitary Plan Wind Tunnel 11-by-11-foot Transonic Wind Tunnel in September 2019 at NASA Ames Research Center. The work described in this paper is a part of NASA’s development of a new state-of-the-art uPSP capability in production wind tunnels. The conventional DMD algorithm is based on the Singular Value Decomposition (SVD) of the data matrix. For the matrix of the uPSP measurements of the SLS ATAT, the number of rows is equal to the number of nodes in the grid of the scale model, and the number of columns is equal to the number of frames in the videos taken with 4 Phantom high-speed cameras. In this paper, it is verified that, for the time series with zero mean value, the DMD is equivalent to the decomposition with the Discrete Fourier Transform (DFT). Considering the uPSP is mainly used in the assessment of the unsteady, aerodynamic phenomena, the DMD of the uPSP measurements can be implemented in two steps: (1) subtract the mean value from the uPSP measurement on each of the grid nodes; (2) apply the Fast Fourier Transform (FFT) on the resulting zero-mean time series. The DMD of the uPSP measurements with FFT has two advantages: (1) the computational complexity of FFT is O(N*logN), where N is the length of the time series; (2) compared to the SVD-based DMD algorithm, the DMD with FFT can be easily implemented in parallel processing. A sample matrix of uPSP measurements, at the size of 341 grid nodes and 128 frames, is generated. Figures 1 and 2 show the eigenvalues and the ratios of the eigenvectors, respectively, of the sample matrix, without and with the mean value removed on each of the grid nodes, computed with the SVD-based DMD and the FFT. The figures demonstrate the equivalence of the SVD-based DMD and the decomposition with DFT/FFT for the time series with zero mean value. The results of DMD of the uPSP measurements of the SLS ATAT in September 2019 are presented in the paper. The DMD modes at different frequencies are shown, the aerodynamic phenomena (e.g. shockwave and vortex shedding) are demonstrated and the correlation of the DMD modes with the test configuration parameter (e.g., the Mach Number) is discussed. Figure 3 shows a software tool to visualize the DMD modes. The code to implement the algorithm described in this paper was written in C, with libraries of FFTW for FFT and MPI/OpenMP for parallel processing, and executed on the NASA Pleiades supercomputer. Funding for this research was provided by the NASA Aerosciences Evaluation and Test Capabilities Project.

Pressure-Sensitive Paint

Qudit Gate Decomposition Dependence for Lattice Gauge Theories

In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP & Displacement gates, ECD & single-qubit rotations $R(\theta,\phi)$, and optimal pulse control. For all three decompositions, implementing the necessary sequence of rotations concurrently rather then sequentially can reduce the primitive gate run time. The number of blocks required for the faster ECD &$R_p(\theta)$ is found to scale $\mathcal{O}(d^2)$, while slower SNAP & Displacement set scales at worst $\mathcal{O}(d)$. For qudits with $d<10$, the resulting gate times for the decompositions is similar, but strongly-dependent on experimental design choices. Optimal control can outperforms both decompositions for small $d$ by a factor of 2-12 at the cost of higher classical resources. Lastly, we find that SNAP & Displacement are slightly more robust to a simplified noise model.

Kürkçüoglu, Doga Murat

Bounds on Block Error Probability for Multilevel Concatenated Codes

Maximum likelihood decoding of long block codes is not feasable due to large complexity. Some classes of codes are shown to be decomposable into multilevel concatenated codes (MLCC). For these codes, multistage decoding provides good trade-off between performance and complexity. In this paper, we derive an upper bound on the probability of block error for MLCC. We use this bound to evaluate difference in performance for different decompositions of some codes. Examples given show that a significant reduction in complexity can be achieved when increasing number of stages of decoding. Resulting performance degradation varies for different decompositions. A guideline is given for finding good m-level decompositions.

Lin, Shu

A Framework for Parallel Unstructured Grid Generation for Complex Aerodynamic Simulations

A framework for parallel unstructured grid generation targeting both shared memory multi-processors and distributed memory architectures is presented. The two fundamental building-blocks of the framework consist of: (1) the Advancing-Partition (AP) method used for domain decomposition and (2) the Advancing Front (AF) method used for mesh generation. Starting from the surface mesh of the computational domain, the AP method is applied recursively to generate a set of sub-domains. Next, the sub-domains are meshed in parallel using the AF method. The recursive nature of domain decomposition naturally maps to a divide-and-conquer algorithm which exhibits inherent parallelism. For the parallel implementation, the Master/Worker pattern is employed to dynamically balance the varying workloads of each task on the set of available CPUs. Performance results by this approach are presented and discussed in detail as well as future work and improvements.

Zagaris, George

Decomposition Algorithm for Global Reachability on a Time-Varying Graph

A decomposition algorithm has been developed for global reachability analysis on a space-time grid. By exploiting the upper block-triangular structure, the planning problem is decomposed into smaller subproblems, which is much more scalable than the original approach. Recent studies have proposed the use of a hot-air (Montgolfier) balloon for possible exploration of Titan and Venus because these bodies have thick haze or cloud layers that limit the science return from an orbiter, and the atmospheres would provide enough buoyancy for balloons. One of the important questions that needs to be addressed is what surface locations the balloon can reach from an initial location, and how long it would take. This is referred to as the global reachability problem, where the paths from starting locations to all possible target locations must be computed. The balloon could be driven with its own actuation, but its actuation capability is fairly limited. It would be more efficient to take advantage of the wind field and ride the wind that is much stronger than what the actuator could produce. It is possible to pose the path planning problem as a graph search problem on a directed graph by discretizing the spacetime world and the vehicle actuation. The decomposition algorithm provides reachability analysis of a time-varying graph. Because the balloon only moves in the positive direction in time, the adjacency matrix of the graph can be represented with an upper block-triangular matrix, and this upper block-triangular structure can be exploited to decompose a large graph search problem. The new approach consumes a much smaller amount of memory, which also helps speed up the overall computation when the computing resource has a limited physical memory compared to the problem size.

Kuwata, Yoshiaki

Bio‐Inspired In Situ Tuning of the Hydrophobic Environment Around Catalytically Active Organic Ligand‐Stabilized Ruthenium Nanoparticles

Abstract The organic ligand environment surrounding enzymatic and homogeneous catalytic active sites often determines catalytic activity. Ruthenium nanoparticles, ≤1 nm in diameter, are synthesized using monodentate thiol, monodentate phosphine, and bidentate bisphosphine ligands. Even though some of the ruthenium surface is blocked by the ligands, catalytic activity is still observed for CO oxidation and H 2 O 2 decomposition. All three ligand‐stabilized ruthenium nanoparticles have similar CO oxidation rates; however, the bisphosphine‐stabilized Ru nanoparticles are approximately 2.5 times less active than the monothiol‐stabilized and monophosphine‐stabilized ruthenium nanoparticles for H 2 O 2 decomposition. It is observed that the organic ligand environment is modulated in situ during nanoparticle synthesis via partial oxidation of the bisphosphine as confirmed by 31 P NMR measurements. We hypothesize that bisphosphine‐bound Ru nanoparticles consist of a Ru core with some of the ligands bound in a monodentate manner where the other P atom is oxidized and not bound to the Ru surface leading to a thicker hydrophobic layer around the Ru nanoparticles. The increase in hydrophobicity is confirmed via contact angle and zeta potential measurements. H 2 O 2 decomposition rates are known to decrease with increasing hydrophobicity, and this work illustrates a pathway for increasing hydrophobicity in situ using ligand‐bound metallic nanoparticles.

Sufyan, Sayed Abu [Department of Chemical Engineer

A two-dimensional Euler solution for an unbladed jet engine configuration

A two dimensional, nonaxisymmetric Euler solution in a geometry representative of a jet engine configuration without blades is presented. The domain, including internal and external flow, is covered with a multiblock grid. In order to construct this grid, a domain decomposition technique is used to subdivide the domain, and smooth grids are dimensioned and placed in each block. The Euler solution is verified by examining five theoretical properties. The result demonstrates techniques for performing numerical solutions in complex geometries and provides a foundation for complete engine throughflow calculations.

Stewart, Mark E. M.

A two-dimensional Euler solution for an unbladed jet engine configuration

A two dimensional nonaxisymmetric Euler solution in a geometric representation of a jet engine configuration without blades is presented. The domain, including internal and external flow, is covered with a multiblock grid. To construct the grid, a domain decomposition technique is used to subdivide the domain and smooth grids are dimensioned and placed in each block. The grid contains 44 blocks which cover the external field, the inlet, bypass duct, core duct and nozzle of the nonaxisymmetric engine configuration. The geometry is symmetric about the meanline of the hub, but the grid is not since there is no symmetry condition applied to the grid between the two halves. With a symmetric grid at zero angle of attack, the measures of the solution would cancel exactly. With an asymmetric grid, the solution will not necessarily be symmetric and the lift coefficient will not necessarily be zero. Thus, grid asymmetry can be exploited to verify the resolution of the solution. The solution may be verified on the basis of five theoretical quantities: conservation of mass and energy, deviation of the lift coefficient from zero, deviation of the drag coefficient from zero, deviations from constant entropy, and deviations in the pressure distributions over the symmetric surfaces of the components. This technique is suitable for obtaining numerical solutions in complex geometries and provides a foundation for complete engine throughflow calculations.

Stewart, Mark E. M.

Subband/Transform MATLAB Functions For Processing Images

SUBTRANS software is package of routines implementing image-data-processing functions for use with MATLAB*(TM) software. Provides capability to transform image data with block transforms and to produce spatial-frequency subbands of transformed data. Functions cascaded to provide further decomposition into more subbands. Also used in image-data-compression systems. For example, transforms used to prepare data for lossy compression. Written for use in MATLAB mathematical-analysis environment.

Glover, D.

Unsteady flowfield simulation of ducted prop-fan configurations

A technique for the simulation of unsteady flows in and around complex rotating machinery is presented. Additional domain decomposition mechanisms are introduced which extend the range of applicability of software developed for the time-accurate simulation of rotating machinery flowfields. The flow models uses the unsteady 3D Euler equations, discretized as a finite-volume method, utilizing a high-resolution approximate Riemann solver for cell interface flux definitions. Multiblock domain decomposition is used to partition the field radially, axially, as well as circumferentially into an ordered arrangement of blocks which exhibit varying degrees of similarity. A general high-order numerical scheme is applied to satisfy the geometric conservation law. Two configurations are presented - ducted single rotation prop-fan and a rotor-deswirl vane combination which form a single stage fan. Comparisons are made to other numerical solutions for these geometries and to available experimental data.

Janus, J. M.

Algorithms for parallel flow solvers on message passing architectures

The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those immediately adjacent to them, then the first processor in the pipeline will receive a computational load that is less than that of subsequent processors, magnifying the pipeline slowdown effect. Extra compensation is needed for grid boundary effects, even if all grid blocks are equally sized.

Vanderwijngaart, Rob F.

Dynamic Mode Decomposition of Unsteady Pressure-Sensitive Paint Measurements for the NASA Unitary Plan Wind Tunnel Tests

This paper discusses the Dynamic Mode Decomposition (DMD) of the Unsteady Pressure-Sensitive Paint (uPSP) measurements, which were collected with four Phantom high-speed cameras at a constant sample frequency in the Ascent Transient Aerodynamics Test (ATAT) of the Space Launch System (SLS) Block 1 cargo vehicle with the Unitary Plan Wind Tunnel (UPWT) 11-by-11-foot Transonic Wind Tunnel in September 2019 at NASA Ames Research Center. The conventional DMD algorithm is based on the Singular Value Decomposition (SVD). For the data with zero mean, the DMD is equivalent to the Discrete Fourier Transform (DFT). Since the uPSP is mainly used to determine the unsteady property of the aerodynamic flow, the DMD of the uPSP measurements is implemented in two steps: (1) subtract the mean value from the uPSP measurement; (2) apply the Fast Fourier Transform (FFT) on the resulting data with zero mean. The DMD of the uPSP measurements with FFT has two advantages: (1) the FFT algorithm is well known for its computational efficiency, therefore, compared to the SVD-based DMD algorithm, the DMD with FFT reduces the computation time; (2) the DMD with FFT can be easily implemented in parallel processing. The DMD outputs were generated with the execution in parallel of a code in C, with libraries of FFTW for FFT and MPI/OpenMP for parallel processing, on the NASA Pleiades supercomputer. In this paper, the results of DMD of the uPSP measurements in the tests of Mach sweep runs of the SLS ATAT are presented, and the effectiveness of the DMD of the uPSP measurements in the diagnosis of the unsteady, aerodynamic phenomena is demonstrated. The work described in this paper is a part of NASA’s development of a new state-of-the-art uPSP capability in production wind tunnels. Funding for this research was provided by the NASA Aeroscience Evaluation and Test Capabilities Project.

Pressure-Sensitive Paint

Effects of Bifurcations on Aft-Fan Engine Nacelle Noise

Aft-fan engine nacelle noise is a significant factor in the increasingly important issue of aircraft community noise. The ability to predict such noise within complex duct geometries is a valuable tool in studying possible noise attenuation methods. A recent example of code development for such predictions is the ducted fan noise propagation and radiation code CDUCT-LaRC. This work focuses on predicting the effects of geometry changes (i.e. bifurcations, pylons) on aft fan noise propagation. Beginning with simplified geometries, calculations show that bifurcations lead to scattering of acoustic energy into higher order modes. In addition, when circumferential mode number and the number of bifurcations are properly commensurate, bifurcations increase the relative importance of the plane wave mode near the exhaust plane of the bypass duct. This is particularly evident when the bypass duct surfaces include acoustic treatment. Calculations involving more complex geometries further illustrate that bifurcations and pylons clearly affect modal content, in both propagation and radiation calculations. Additionally, results show that consideration of acoustic radiation results may provide further insight into acoustic treatment effectiveness for situations in which modal decomposition may not be straightforward. The ability of CDUCT-LaRC to handle complex (non-axisymmetric) multi-block geometries, as well as axially and circumferentially segmented liners, allows investigation into the effects of geometric elements (bifurcations, pylons).

Nark, Douglas M.

Tungsten and Barium Transport in the Internal Plasma of Hollow Cathodes

The effect of tungsten erosion, transport and redeposition on the operation of dispenser hollow cathodes was investigated in detailed examinations of the discharge cathode inserts from an 8200 hour and a 30,352 hour ion engine wear test. Erosion and subsequent re-deposition of tungsten in the electron emission zone at the downstream end of the insert reduces the porosity of the tungsten matrix, preventing the flow of barium from the interior. This inhibits the interfacial reactions of the barium-calcium-aluminate impregnant with the tungsten in the pores. A numerical model of barium transport in the internal xenon discharge plasma shows that the barium required to reduce the work function in the emission zone can be supplied from upstream through the gas phase. Barium that flows out of the pores of the tungsten insert is rapidly ionized in the xenon discharge and pushedback to the emitter surface by the electric field and drag from the xenon ion flow. Thisbarium ion flux is sufficient to maintain a barium surface coverage at the downstream endgreater than 0.6, even if local barium production at that point is inhibited by tungsten deposits. The model also shows that the neutral barium pressure exceeds the equilibrium vapor pressure of the impregnant decomposition reaction over much of the insert length,so the reactions are suppressed. Only a small region upstream of the zone blocked by tungsten deposits is active and supplies the required barium. These results indicate that hollowcathode failure models based on barium depletion rates in vacuum dispenser cathodes are very conservative.

Hollow cathodes

Barium Depletion in Hollow Cathode Emitters

The effect of tungsten erosion, transport and redeposition on the operation of dispenser hollow cathodes was investigated in detailed examinations of the discharge cathode inserts from an 8200 hour and a 30,352 hour ion engine wear test. Erosion and subsequent re-deposition of tungsten in the electron emission zone at the downstream end of the insert reduces the porosity of the tungsten matrix, preventing the ow of barium from the interior. This inhibits the interfacial reactions of the barium-calcium-aluminate impregnant with the tungsten in the pores. A numerical model of barium transport in the internal xenon discharge plasma shows that the barium required to reduce the work function in the emission zone can be supplied from upstream through the gas phase. Barium that flows out of the pores of the tungsten insert is rapidly ionized in the xenon discharge and pushed back to the emitter surface by the electric field and drag from the xenon ion flow. This barium ion flux is sufficient to maintain a barium surface coverage at the downstream end greater than 0.6, even if local barium production at that point is inhibited by tungsten deposits. The model also shows that the neutral barium pressure exceeds the equilibrium vapor pressure of the impregnant decomposition reaction over much of the insert length, so the reactions are suppressed. Only a small region upstream of the zone blocked by tungsten deposits is active and supplies the required barium. These results indicate that hollow cathode failure models based on barium depletion rates in vacuum dispenser cathodes are very conservative.

plasma discharges

A Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains

This paper considers an algebraic preconditioning algorithm for hyperbolic-elliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of triangulation vertices which separates subdomain and interface solution unknowns. The reordering induces a natural 2 x 2 block partitioning of the discretization matrix. Exact LU factorization of this block system yields a Schur complement matrix which couples subdomains and the interface together. The remaining sections of this paper present a family of approximate techniques for both constructing and applying the Schur complement as a domain-decomposition preconditioner. The approximate Schur complement serves as an algebraic coarse space operator, thus avoiding the known difficulties associated with the direct formation of a coarse space discretization. In developing Schur complement approximations, particular attention has been given to improving sequential and parallel efficiency of implementations without significantly degrading the quality of the preconditioner. A computer code based on these developments has been tested on the IBM SP2 using MPI message passing protocol. A number of 2-D calculations are presented for both scalar advection-diffusion equations as well as the Euler equations governing compressible fluid flow to demonstrate performance of the preconditioning algorithm.

Barth, Timothy J.

Non-oscillatory central differencing for hyperbolic conservation laws

Many of the recently developed high resolution schemes for hyperbolic conservation laws are based on upwind differencing. The building block for these schemes is the averaging of an appropriate Godunov solver; its time consuming part involves the field-by-field decomposition which is required in order to identify the direction of the wind. Instead, the use of the more robust Lax-Friedrichs (LxF) solver is proposed. The main advantage is simplicity: no Riemann problems are solved and hence field-by-field decompositions are avoided. The main disadvantage is the excessive numerical viscosity typical to the LxF solver. This is compensated for by using high-resolution MUSCL-type interpolants. Numerical experiments show that the quality of results obtained by such convenient central differencing is comparable with those of the upwind schemes.

Nessyahu, Haim