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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2025

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2004

Making Carbon-Nanotube Arrays Using Block Copolymers: Part 2

Some changes have been incorporated into a proposed method of manufacturing regular arrays of precisely sized, shaped, positioned, and oriented carbon nanotubes. Such arrays could be useful as mechanical resonators for signal filters and oscillators, and as electrophoretic filters for use in biochemical assays. A prior version of the method was described in Block Copolymers as Templates for Arrays of Carbon Nanotubes, (NPO-30240), NASA Tech Briefs, Vol. 27, No. 4 (April 2003), page 56. To recapitulate from that article: As in other previously reported methods, carbon nanotubes would be formed by decomposition of carbon-containing gases over nanometer-sized catalytic metal particles that had been deposited on suitable substrates. Unlike in other previously reported methods, the catalytic metal particles would not be so randomly and densely distributed as to give rise to thick, irregular mats of nanotubes with a variety of lengths, diameters, and orientations. Instead, in order to obtain regular arrays of spaced-apart carbon nanotubes as nearly identical as possible, the catalytic metal particles would be formed in predetermined regular patterns with precise spacings. The regularity of the arrays would be ensured by the use of nanostructured templates made of block copolymers.

Bronikowski, Michael↗
NASA NTRS2021

Fast Near-Optimal Heterogeneous Task Allocation via Flow Decomposition

Multi-robot systems are uniquely well-suited to perform complex tasks such as patrolling and tracking, infor- mation gathering, and pick-up and delivery problems, offering significantly higher performance than single-robot systems. A fundamental building block in most multi-robot systems is dynamic task allocation: assigning robots to tasks (e.g., patrolling an area, or servicing a transportation request) as they appear based on the robots’ states to maximize reward. In many practical situations, the allocation must account for potentially heteroge- neous capabilities (e.g., availability of appropriate sensors or actuators) to ensure the feasibility of execution, and exploit predictive information concerning the likelihood of future tasks to promote a higher reward over a long time horizon. To this end, we present an efficient algorithm for predictive heterogeneous task- allocation achieving an approximation factor of at least 1/2 of the optimal reward. Our approach demonstrates that the problem can be decomposed into several homogeneous subproblems that can be solved efficiently using min-cost flow. Through simulation experiments, we show that our algorithm is faster by several orders of magnitude than a MILP-based approach.

Pavone, Marco↗
DOE OSTI2025

Classical Non-Markovian Noise in Symmetry-Preserving Quantum Dynamics

In quantum dynamics, symmetries are vital for identifying and assessing conserved quantities that govern the evolution of a quantum system. When promoted to the open quantum system setting, dynamical symmetries can be negatively altered by system-environment interactions, thus, complicating their analysis. Previous work on noisy symmetric quantum dynamics has focused on the Markovian setting, despite the ubiquity of non-Markovian noise in a number of widely used quantum technologies. Here, in this Letter, we develop a framework for quantifying the impact of non-Markovian noise on symmetric quantum evolution via root space decompositions and the filter function formalism. We demonstrate analytically that symmetry-preserving noise maintains the symmetric subspace, while nonsymmetric noise leads to highly specific leakage errors that are block diagonal in the symmetry representation. We support our findings with numerical studies of a transverse-field Ising model and a quantum error detecting code subject to spatiotemporally correlated multiaxis noise. Our results are broadly applicable, providing new analytic insights into the control and characterization of open quantum system dynamics.

decoherence↗
NASA NTRS1975

Hypermatrix scheme for finite element systems on CDC STAR-100 computer

A study is made of the adaptation of the hypermatrix (block matrix) scheme for solving large systems of finite element equations to the CDC STAR-100 computer. Discussion is focused on the organization of the hypermatrix computation using Cholesky decomposition and the mode of storage of the different submatrices to take advantage of the STAR pipeline (streaming) capability. Consideration is also given to the associated data handling problems and the means of balancing the I/Q and cpu times in the solution process. Numerical examples are presented showing anticipated gain in cpu speed over the CDC 6600 to be obtained by using the proposed algorithms on the STAR computer.

Noor, A. K.↗
NASA NTRS1984

Hydrolytic properties of phenylalanyl- and N-acetylphenylalanyl adenylate anhydrides

The hydrolysis of phenylalynyl- and N-acetylephenylalanyl adenylate anhydrides (AcPhe-AMP) is studied experimentally using a new spectrophotometric method. The hydrolysis process was analyzed at low concentrations (0.0001 M), constant temperature of 25 C, constant buffer concentration (0.05 M), and as a function of pH. It is found that while Phe-AMP is susceptible to attack by OH(-), AcPhe-AMP is susceptible to acid decomposition as well. At a pH of 4 to 8, Phe-AMP hydolyzes faster than AcPhe-AMP, but at pH less than four or greater than eight, the blocked form hydrolyzes faster. Both forms are attacked by H2O at the same rate. The rate laws for the various hydrolytic mechanisms and the activation energies for the hydrolyses at pH 7.1 are given in a table, and the possible relevance of the findings to the origin and evolution of the process of protein synthesis is discussed.

Lacey, J. C., Jr.↗
DOE OSTI2024

Progressive Hedging Decomposition for Solutions of Large-Scale Process Family Design Problems

Rapid, wide-scale deployment of green process systems, such as carbon capture or water desalination systems, is essential for combatting climate change. Methods relying on traditional design or modularity fail to capture the benefits of both economies of numbers and economies of scale. We have proposed process family design, which designs a family of processes simultaneously exploiting opportunities for common elements. In previous work, we explored different optimization formulations to solve this problem. In this work, we develop a decomposition approach to tackle larger problems efficiently. We solve a water desalination case study, which is too large to solve within a reasonable timeframe with the discretization formulation. We exploit the block angular structure of the discretization problem to decompose and solve using Progressive Hedging (PH). We use the open-source Python package mpi-sppy to execute PH which allows us to leverage parallelization and a HPC cluster to further improve solution time.

Stinchfield, Georgia↗
DOE OSTI2020

A domain decomposition preconditioning for an inverse volume scattering problem

In this work, we propose domain decomposition preconditioners for the solution of an integral equation formulation of the acoustic forward and inverse scattering problems. We study both forward and inverse volume problems and propose preconditioning techniques to accelerate the iterative solvers. For the forward scattering problem, we extend the domain decomposition based preconditioning techniques presented for partial differential equations in Cai and Sarkis (1999 SIAM J. Sci. Comput. 21 792–797), to integral equations. We combine this domain decomposition preconditioner with a low-rank correction, which is easy to construct, forming a new preconditioner. For the inverse scattering problem, we use the forward problem preconditioner as a building block for constructing a preconditioner for the Gauss–Newton Hessian. We present numerical results that demonstrate the performance of both preconditioning strategies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data

In this paper, we propose a personalized Tucker decomposition (perTucker) to address the limitations of traditional tensor decomposition methods in capturing heterogeneity across different datasets. perTucker decomposes tensor data into shared global components and personalized local components. We introduce an order orthogonality assumption and develop a proximal gradient regularized block coordinate descent algorithm guaranteed to converge to a stationary point. The unique and common representations learned by perTucker reveal intrinsic statistical patterns in data and provide valuable information for a wide range of downstream analytics, including anomaly detection, source classification, and clustering. We demonstrate perTucker’s effectiveness through a simulation study and two case studies on solar flare detection and tonnage signal classification.

14 SOLAR ENERGY↗
DOE OSTI2022

Feynman rules for scalar conformal blocks

We complete the proof of “Feynman rules” for constructing M-point conformal blocks with external and internal scalars in any topology for arbitrary M in any spacetime dimension by combining the rules for the blocks (based on their Witten diagram interpretation) with the rules for the construction of conformal cross ratios (based on the OPE and “flow diagrams”). The full set of Feynman rules leads to blocks as power series of the hypergeometric type in the conformal cross ratios. We then provide a proof by recursion of the Feynman rules which relies heavily on the first Barnes lemma and the decomposition of the topology of interest in comb structures. Finally, we provide a nine-point example to illustrate the rules.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1993

Canonical forms of multidimensional steady inviscid flows

Canonical forms and canonical variables for inviscid flow problems are derived. In these forms the components of the system governed by different types of operators (elliptic and hyperbolic) are separated. Both the incompressible and compressible cases are analyzed, and their similarities and differences are discussed. The canonical forms obtained are block upper triangular operator form in which the elliptic and non-elliptic parts reside in different blocks. The full nonlinear equations are treated without using any linearization process. This form enables a better analysis of the equations as well as better numerical treatment. These forms are the analog of the decomposition of the one dimensional Euler equations into characteristic directions and Riemann invariants.

Taasan, Shlomo↗
NASA NTRS1990

Counterrotating prop-fan simulations which feature a relative-motion multiblock grid decomposition enabling arbitrary time-steps

Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.

Janus, J. Mark↗
DOE OSTI2023

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Permutation-adapted complete and independent basis for atomic cluster expansion descriptors

Atomic cluster expansion (ACE) methods provide a systematic way to describe particle local environments of arbitrary body order. For practical applications it is often required that the basis of cluster functions be symmetrized with respect to rotations and permutations. Existing methodologies yield sets of symmetrized functions that are over-complete. These methodologies thus require an additional numerical procedure, such as singular value decomposition (SVD), to eliminate redundant functions. In this work, it is shown that analytical linear relationships for subsets of cluster functions may be derived using recursion and permutation properties of generalized Wigner symbols. From these relationships, subsets (blocks) of cluster functions can be selected such that, within each block, functions are guaranteed to be linearly independent. It is conjectured that this block-wise independent set of permutation-adapted rotation and permutation invariant (PA-RPI) functions forms a complete, independent basis for ACE. Along with the first analytical proofs of block-wise linear dependence of ACE cluster functions and other theoretical arguments, numerical results are offered to demonstrate this. The utility of the method is demonstrated in the development of an ACE interatomic potential for tantalum. Using the new basis functions in combination with Bayesian compressive sensing sparse regression, some high degree descriptors are observed to persist and help achieve high-accuracy models.

Angular momentum↗
DOE OSTI2021

Low Temperature Water-Gas Shift: Enhancing Stability through Optimizing Rb Loading on Pt/ZrO 2

Recent studies have shown that appropriate levels of alkali promotion can significantly improve the rate of low-temperature water gas shift (LT-WGS) on a range of catalysts. At sufficient loadings, the alkali metal can weaken the formate C–H bond and promote formate dehydrogenation, which is the proposed rate determining step in the formate associative mechanism. In a continuation of these studies, the effect of Rb promotion on Pt/ZrO 2 is examined herein. Pt/ZrO 2 catalysts were prepared with several different Rb loadings and characterized using temperature programmed reduction mass spectrometry (TPR-MS), temperature programmed desorption (TPD), diffuse reflectance infrared Fourier transform spectroscopy (DRIFTS), an X-ray absorption near edge spectroscopy (XANES) difference procedure, extended X-ray absorption fine structure spectroscopy (EXAFS) fitting, TPR-EXAFS/XANES, and reactor testing. At loadings of 2.79% Rb or higher, a significant shift was seen in the formate ν(CH) band. The results showed that a Rb loading of 4.65%, significantly improves the rate of formate decomposition in the presence of steam via weakening the formate C–H bond. However, excessive rubidium loading led to the increase in stability of a second intermediate, carbonate and inhibited hydrogen transfer reactions on Pt through surface blocking and accelerated agglomeration during catalyst activation. Optimal catalytic performance was achieved with loadings in the range of 0.55–0.93% Rb, where the catalyst maintained high activity and exhibited higher stability in comparison with the unpromoted catalyst.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1995

Energy transfer in compressible turbulence

This letter investigates the compressible energy transfer process. We extend a methodology developed originally for incompressible turbulence and use databases from numerical simulations of a weak compressible turbulence based on Eddy-Damped-Quasi-Normal-Markovian (EDQNM) closure. In order to analyze the compressible mode directly, the well known Helmholtz decomposition is used. While the compressible component has very little influence on the solenoidal part, we found that almost all of the compressible turbulence energy is received from its solenoidal counterpart. We focus on the most fundamental building block of the energy transfer process, the triadic interactions. This analysis leads us to conclude that, at low turbulent Mach number, the compressible energy transfer process is dominated by a local radiative transfer (absorption) in both inertial and energy containing ranges.

Bataille, Francoise↗
NASA NTRS1999

Mathematical Innovation

Through Small Business Innovation Research funds from the Stennis Space Center, MathSoft, Inc., developed a system that can provide the building blocks for signal analysis and rapid prototyping. The product is the result of work to help NASA develop a complete understanding propulsion test data by using time frequency displays, automatic estimation and denoising, and data analysis plots for wavelet decomposition.

Source record↗