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.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRS2004

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.↗

NASA NTRS2008

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↗

NASA NTRS2009

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↗

DOE OSTI2023

WavPool: A New Block for Deep Neural Networks

Modern deep neural networks comprise many operational layers, such as dense or convolutional layers, which are often collected into blocks. In this work, we introduce a new, wavelet-transform-based network architecture that we call the multi-resolution perceptron: by adding a pooling layer, we create a new network block, the WavPool. The first step of the multi-resolution perceptron is transforming the data into its multi-resolution decomposition form by convolving the input data with filters of fixed coefficients but increasing size. Following image processing techniques, we are able to make scale and spatial information simultaneously accessible to the network without increasing the size of the data vector. WavPool outperforms a similar multilayer perceptron while using fewer parameters, and outperforms a comparable convolutional neural network by ~ 10% on relative accuracy on CIFAR-10.

McDermott, Samuel D.↗

NASA NTRS1998

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.↗

NASA NTRS1988

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↗

NASA NTRS1990

Non-oscillatory central differencing for hyperbolic conservation laws

Nessyahu, Haim↗

DOE OSTI2020

Low temperature water-gas shift: Optimization of K loading on Pt/m-ZrO 2 for enhancing CO conversion

Previous work showed that alkali doping of Pt/ZrO 2 significantly improved the LT-WGS rate. This improvement was caused by an acceleration in the rate of formate decomposition, the rate limiting step of an associative mechanism, through electronically weakening the CH bond. In this study, the effects that potassium loading on Pt/ZrO 2 have on the rate of LT-WGS and the strength of the CH bond in intermediate formate species are explored. Catalysts were investigated using in-situ DRIFTS, TPR-MS, TPD, EXAFS, and catalyst testing. Here, loadings of 1.7 wt.% potassium or higher shifted the formate ν(CH) band to significantly lower wavenumbers, indicating weakening of the bond. For the optimal loading, 2.6 wt.% K, the formate CH bond was significantly weakened, and the surface of Pt nanoparticles remained largely uncovered. However, loadings of 3.4 wt. % and above blocked the surface of the platinum nanoparticles. This, in addition to an increasing average Pt0 cluster size, hindered platinum from assisting in dehydrogenation of formate during steam promoted formate decomposition occurring in LT-WGS.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1986

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗

NASA NTRS1993

Efficient partitioning and assignment on programs for multiprocessor execution

The general problem studied is that of segmenting or partitioning programs for distribution across a multiprocessor system. Efficient partitioning and the assignment of program elements are of great importance since the time consumed in this overhead activity may easily dominate the computation, effectively eliminating any gains made by the use of the parallelism. In this study, the partitioning of sequentially structured programs (written in FORTRAN) is evaluated. Heuristics, developed for similar applications are examined. Finally, a model for queueing networks with finite queues is developed which may be used to analyze multiprocessor system architectures with a shared memory approach to the problem of partitioning. The properties of sequentially written programs form obstacles to large scale (at the procedure or subroutine level) parallelization. Data dependencies of even the minutest nature, reflecting the sequential development of the program, severely limit parallelism. The design of heuristic algorithms is tied to the experience gained in the parallel splitting. Parallelism obtained through the physical separation of data has seen some success, especially at the data element level. Data parallelism on a grander scale requires models that accurately reflect the effects of blocking caused by finite queues. A model for the approximation of the performance of finite queueing networks is developed. This model makes use of the decomposition approach combined with the efficiency of product form solutions.

Standley, Hilda M.↗

DOE OSTI2022

Probing surface-adsorbate interactions through active particle dynamics

Adsorbate molecules present in a reaction mixture may bind to and block catalytic sites. Measurement of the surface coverage of these molecules via adsorption isotherms is critical for modeling and design of catalytic reactions on surfaces. However, it is challenging to measure isotherms in solution in a way that is directly relevant to catalytic activity under reaction conditions, particularly since adsorbates may bind with an enormous range of surface affinity parameters. Here we used the motion of self-propelled catalytic Janus particles, which employ the decomposition of hydrogen peroxide fuel as a propulsion mechanism, to determine the effective surface coverage of thioglycerol, furfural, and ethanol on a platinum surface as a function of concentration in aqueous solution by measuring the decrease in active motion due to the blocking of active sites. For strongly adsorbing thioglycerol, this effective coverage was compared and contrasted to the total adsorbed amount measured using inductively-coupled plasma analysis. Demonstrating the broad applicability of this approach, the surface affinity of the three adsorbates spanned more than four orders of magnitude. For each species, the adsorbate-mediated attenuation of active motion occurred over a wide concentration range and was well-described by a Langmuir isotherm. The strongly interacting thioglycerol had the highest affinity towards the surface (K a = 15.5 ± 4.3 mM –1 ) and fully deactivated the active particle motion at surface saturation. Furfural had an intermediate affinity (K a = 0.42 ± 0.07 mM –1 ) but did not fully block H 2 O 2 access to the surface at apparent saturation, consistent with a maximum fractional surface coverage of θ max = 0.67. Ethanol exhibited even lower affinity (K a = 0.0025 ± 2x10 -4 mM –1 ) and its coverage saturated at only θ max = 0.38. Analysis of isotherms at elevated temperatures enabled direct extraction of the enthalpies of adsorption. The degree of surface coverage at adsorbate saturation appeared to correlate with the relative energies of adsorption for the different adsorbate species and was consistent with adsorbate saturation of one of multiple active site populations towards H 2 O 2 decomposition. Furthermore, computational investigations into solvent effects on furfural adsorption showed good quantitative agreement with the experimental results. This work leverages unique properties of active particles to explore fundamental catalysis questions and demonstrates a novel paradigm for significant and experimentally accessible multidisciplinary research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Scattering amplitudes for monopoles: pairwise little group and pairwise helicity

On-shell methods are particularly suited for exploring the scattering of electrically and magnetically charged objects, for which there is no local and Lorentz invariant Lagrangian description. In this paper we show how to construct a Lorentz-invariant S-matrix for the scattering of electrically and magnetically charged particles, without ever having to refer to a Dirac string. A key ingredient is a revision of our fundamental understanding of multi-particle representations of the Poincaré group. Surprisingly, the asymptotic states for electric-magnetic scattering transform with an additional little group phase, associated with pairs of electrically and magnetically charged particles. The corresponding “pairwise helicity” is identified with the quantized “cross product” of charges, e 1 g 2 - e 2 g 1 , for every charge-monopole pair, and represents the extra angular momentum stored in the asymptotic electromagnetic field. We define a new kind of pairwise spinor-helicity variable, which serves as an additional building block for electric-magnetic scattering amplitudes. We then construct the most general 3-point S-matrix elements, as well as the full partial wave decomposition for the 2 → 2 fermion-monopole S-matrix. In particular, we derive the famous helicity flip in the lowest partial wave as a simple consequence of a generalized spin-helicity selection rule, as well as the full angular dependence for the higher partial waves. Our construction provides a significant new achievement for the on-shell program, succeeding where the Lagrangian description has so far failed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NASA NTRS1987

Catalytic Layer Makes Aircraft Seats More Fire Retardant

Specially constructed cushion retards fires in aircraft seats through action of catalytic matrix that cracks flammable gaseous decomposition products to less flammable species. Improved cushion contributes substantially to fire safety without adding significantly to weight or to manufacturing cost. In this fire-blocking covering for an aircraft seat cushion, flammable pyrolysis products cracked to less flammable species by catalytic layer covering foam core of cushion. Aluminum foil holds in pyrolysis vapors to promote catalysis and prevent spread of fire by ignition of released vapors.

Parker, John A.↗

NASA NTRS1998

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and sectionalization of trellises. Chapter 7 discusses trellis decomposition and subtrellises for low-weight codewords. Chapter 8 first presents well known methods for constructing long powerful codes from short component codes or component codes of smaller dimensions, and then provides methods for constructing their trellises which include Shannon and Cartesian product techniques. Chapter 9 deals with convolutional codes, puncturing, zero-tail termination and tail-biting.Chapters 10 through 13 present various trellis-based decoding algorithms, old and new. Chapter 10 first discusses the application of the well known Viterbi decoding algorithm to linear block codes, optimum sectionalization of a code trellis to minimize computation complexity, and design issues for IC (integrated circuit) implementation of a Viterbi decoder. Then it presents a new decoding algorithm for convolutional codes, named Differential Trellis Decoding (DTD) algorithm. Chapter 12 presents a suboptimum reliability-based iterative decoding algorithm with a low-weight trellis search for the most likely codeword. This decoding algorithm provides a good trade-off between error performance and decoding complexity. All the decoding algorithms presented in Chapters 10 through 12 are devised to minimize word error probability. Chapter 13 presents decoding algorithms that minimize bit error probability and provide the corresponding soft (reliability) information at the output of the decoder. Decoding algorithms presented are the MAP (maximum a posteriori probability) decoding algorithm and the Soft-Output Viterbi Algorithm (SOVA) algorithm. Finally, the minimization of bit error probability in trellis-based MLD is discussed.

Lin, Shu↗

NASA NTRS1990

Reliable and Efficient Parallel Processing Algorithms and Architectures for Modern Signal Processing

Least-squares (LS) estimations and spectral decomposition algorithms constitute the heart of modern signal processing and communication problems. Implementations of recursive LS and spectral decomposition algorithms onto parallel processing architectures such as systolic arrays with efficient fault-tolerant schemes are the major concerns of this dissertation. There are four major results in this dissertation. First, we propose the systolic block Householder transformation with application to the recursive least-squares minimization. It is successfully implemented on a systolic array with a two-level pipelined implementation at the vector level as well as at the word level. Second, a real-time algorithm-based concurrent error detection scheme based on the residual method is proposed for the QRD RLS systolic array. The fault diagnosis, order degraded reconfiguration, and performance analysis are also considered. Third, the dynamic range, stability, error detection capability under finite-precision implementation, order degraded performance, and residual estimation under faulty situations for the QRD RLS systolic array are studied in details. Finally, we propose the use of multi-phase systolic algorithms for spectral decomposition based on the QR algorithm. Two systolic architectures, one based on triangular array and another based on rectangular array, are presented for the multiphase operations with fault-tolerant considerations. Eigenvectors and singular vectors can be easily obtained by using the multi-pase operations. Performance issues are also considered.

Liu, Kuojuey Ray↗

NASA NTRSDate not supplied

Aeroacoustic Analysis using Dynamic Mode Decomposition of Unsteady Pressure-Sensitive Paint Measurements

In this paper, we present a new method for the diagnosis and analysis of aeroacoustic phenomena. Taking advantage of the well-known property that the measurements of the Unsteady Pressure-Sensitive Paint (uPSP) have much higher spatial resolution compared to those of the conventional pressure transducers, the method is based on the visualization and analysis of the outputs of the Dynamic Mode Decomposition (DMD) of the uPSP measurements. The uPSP measurements were collected with four Phantom high-speed cameras in the Ascent Transient Aerodynamics Test (ATAT) of the Space Launch System (SLS) Block 1 cargo vehicle in the 11-by-11-foot transonic test section of the Unitary Plan Wind Tunnel (UPWT) at NASA Ames Research Center in September 2019. The method presented in this paper is demonstrated by investigating an interesting phenomenon observed in the SLS ATAT – the vortex shedding tone generated by the forward attachment of the Solid Rocket Booster (SRB). As examples, the DMD outputs of the uPSP measurements in a subsonic test in the SLS ATAT are presented. It is shown the information retrieved from the DMD outputs of the uPSP measurements can be effectively used in the identification and diagnosis of the aeroacoustic phenomena. 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 was provided by the NASA Aerosciences Evaluation and Test Capabilities Portfolio Office.

acoustics↗