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 73 records · Page 4

A Polymer-Assisted Spinodal Decomposition Strategy toward Interconnected Porous Sodium Super Ionic Conductor-Structured Polyanion-Type Materials and Their Application as a High-Power Sodium-Ion Battery Cathode

A general polymer-assisted spinodal decomposition strategy is used to prepare hierarchically porous sodium super ionic conductor (NASICON)-structured polyanion-type materials (e.g., Na 3 V 2 (PO 4 ) 3 , Li 3 V 2 (PO 4 ) 3 , K 3 V 2 (PO 4 ) 3 , Na 4 MnV(PO 4 ) 3 , and Na 2 TiV(PO 4 ) 3 ) in a tetrahydrofuran/ethanol/H 2 O synthesis system. Depending on the boiling point of solvents, the selective evaporation of the solvents induces both macrophase separation via spinodal decomposition and mesophase separation via self-assembly of inorganic precursors and amphiphilic block copolymers, leading to the formation of hierarchically porous structures. We find that the resulting hierarchically porous Na 3 V 2 (PO 4 ) 3 possessing large specific surface area (≈77 m 2 g -1 ) and pore volume (≈0.272 cm 3 g -1 ) shows a high specific capacity of 117.6 mAh g -1 at 0.1 C achieving the theoretical value and a long cycling life with 77% capacity retention over 1000 cycles at 5 C. This method presented here can open a facile avenue to synthesize other hierarchically porous polyanion-type materials.

36 MATERIALS SCIENCE↗

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↗

Wood Decomposition: Understanding Processes Regulating Carbon Transfer to Soil Carbon Pools Using FACE Wood at Multiple Scales

Dead wood comprises approximately 20% of forest biomass. While it is widely recognized for its role in ecosystem functions relative to habitat and nutrient cycling, there are considerable uncertainties associated with its role in the forest carbon (C) cycle. The principal uncertainty is whether dead wood contributes to the soil C pool. With little supporting evidence, the presumption is that C in wood is respired back to the atmosphere through decomposition processes. The inability to attribute forest soil C to its source components has been a barrier to addressing this important forest carbon cycle question. The U.S. Dept. of Energy’s Free Air CO 2 Enrichment (FACE) experiment produced wood that has a distinct δ 13 C signature that can be used to trace its fate through organic matter decomposition processes. Using two hardwood species (aspen, birch) from the Rhinelander FACE site and pine from the Duke FACE site, the FACE Wood Decomposition Experiment (FWDE) was established in 2011 to provide the foundation for addressing wood decomposition and its associated processes at the continental scale. Plots were installed on nine experimental forests representing a range in bioclimatic forest conditions within the continental U.S. Each identical plot has logs of the three species incubating on the soil surface and pine logs suspended in the air, representing standing dead wood. Abiotic conditions are monitored continuously, and soil and forest conditions characterized. Logs on the sites have been measured every two years to assess decay. This project was initiated in 2016 with specific objectives to: (a) determine whether dead wood C contributes to the soil C pool, (b) assess the fungal community composition mediating the decay, (c) assess the interactions of termites with microbial decay, and (d) develop a mechanistic model to simulate wood decomposition. The principal field sampling was conducted in 2017; correspondingly, the results reported here represent six years of decomposition. Wood decomposition varied from 13 to 75 % loss across the bioclimatic gradient. Sites in the southeastern U.S. coastal plain and piedmont had fastest decomposition rates for each of the species. In contrast sites in the Rocky Mountains had the slowest decay rates, which were associated with cold temperatures. Standing deadwood decomposes at a much slower rate than logs on the soil surface; a response due to differences in wood moisture content. Wood carbon was measured in the mineral soil across each of the sites; accordingly, this is the first study to affirm that a portion of the wood C does become part of the soil C pool. Averaged across the FWDE sites, approximately 1.4% of the soil C in the upper 10 cm of the mineral soil directly beneath the log was derived from the deadwood; within 50 cm of the log, wood C accounted for an average of 2.1%. These results demonstrate that the contribution of deadwood to the soil C pool is a soil volume surrounding the log; and it’s likely a larger volume than what we sampled. We also hypothesized that there would be more wood C in the mineral soil when termites were present. However, that hypothesis wasn’t supported by measurements on the Santee Experimental Forest termite exclusion (SEF-TX) plots under FACE logs that incubated for 6 years. Across all the sites, the majority of the wood C was transferred to the atmosphere. Approximately 7,000 fungal species were sequenced. The fungal communities were different among each of the sites suggesting local colonization; interestingly, within sites the three species also exhibited differences in fungal community composition. White rot was the dominant fungal form in pine and hardwood, which yields less lignin in the wood residue. Brown rot occurred in approximately 20% of the pine and aspen logs, and it did not occur in birch logs. The occurrence of brown rot was only weakly correlated to site factors. We conducted two additional experiments to assess the effects of termites on wood decomposition and the associated interactions with the fungal community. Pine and birch logs were incubated on the Santee Experimental Forest termite exclusion plots in upland and riparian settings. There was no difference in decay between areas where termites were able colonize and plots where they had been excluded. Highly variable foraging by termites was a primary contributor the result. Correspondingly, fungal communities did not vary on logs incubated among the two treatments, but they did reflect site and species differences. The second experiment was conducted on each of the nine FWDE sites where pine and birch wood blocks were incubated for two years with and without a wrapping designed to exclude termites and other arthropods. The effects of termites on wood decomposition could be confirmed on two of the four sites known to have subterranean termites. On the two southeastern sites, termites contributed approximately 8% to mass loss in pine blocks over two years. A major factor clouding the role of termites in wood decomposition is the inability to assess the time, duration, and intensity of the foraging with the logs. Another uncertainty is related to whether a piece of wood will be foraged. A process-based wood decomposition model was developed representing biological processes mediated by fungi, bacteria, termites, beetles, as well as physical and chemical processes. The Coarse Wood Decomposition Model (CWDM) was parameterized based on a thorough review of the literature and it was validated using data from the FWDE. In the initial setup, the model considers softwoods and hardwoods groups, as opposed to individual species. Sensitivity analyses incorporating climate data from 89 locations in North America demonstrated that CWDM was stable from the tropics to the boreal zone. Model calibration and validation showed it to perform very well. The CWDM is poised for additional testing with subsequent FWDE data as well as other data sets, and it is available for incorporation into forest biogeochemical models or DOEs Earth System Modeling framework.

54 ENVIRONMENTAL SCIENCES↗

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↗

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

Build Optimization Software Tools (BOOST) v2.0.0

Build Optimization Software Tools (BOOST) accelerate the design of DNA, RNA and protein sequences for their synthesis and assembly in an automated and scalable fashion. The BOOST Juggler automates the following two design tasks: - Reverse-Translation of protein sequences into DNA sequences - Codon Juggling of DNA sequences The BOOST Polisher provides the following design tasks: - The Verification of DNA sequences against DNA synthesis constraints - The Modification of DNA sequences in case they violate any DNA synthesis constraint In addition, the BOOST Polisher can be instructed to verify and modify DNA sequences against sequence patterns, such as restriction sites. The BOOST Partitioner supports both Gibson/chewback and Yeast assembly (also known as Transformation-Associated Recombination, or TAR) methods when performing the decomposition of large sequences that exceed the maximum length of DNA synthesis into synthesizable building blocks. The Partitioner can be instructed to find building blocks with appropriate overlap sequences, making their assembly into the complete construct more efficient. BOOST Workflows enable, in a customized fashion, the execution of the Juggler, Polisher, and Partitioner tools on a batch of sequences.

Sharkey, Michael↗

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

Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.

97 MATHEMATICS AND COMPUTING↗

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↗