Search NASA⌕ Search

SEARCH · Search NASA

Results for “Decomposition algorithm”

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 865 records · Page 48

Deep data analysis via physically constrained linear unmixing: universal framework, domain examples, and a community-wide platform

Abstract Many spectral responses in materials science, physics, and chemistry experiments can be characterized as resulting from the superposition of a number of more basic individual spectra. In this context, unmixing is defined as the problem of determining the individual spectra, given measurements of multiple spectra that are spatially resolved across samples, as well as the determination of the corresponding abundance maps indicating the local weighting of each individual spectrum. Matrix factorization is a popular linear unmixing technique that considers that the mixture model between the individual spectra and the spatial maps is linear. Here, we present a tutorial paper targeted at domain scientists to introduce linear unmixing techniques, to facilitate greater understanding of spectroscopic imaging data. We detail a matrix factorization framework that can incorporate different domain information through various parameters of the matrix factorization method. We demonstrate many domain-specific examples to explain the expressivity of the matrix factorization framework and show how the appropriate use of domain-specific constraints such as non-negativity and sum-to-one abundance result in physically meaningful spectral decompositions that are more readily interpretable. Our aim is not only to explain the off-the-shelf available tools, but to add additional constraints when ready-made algorithms are unavailable for the task. All examples use the scalable open source implementation from https://github.com/ramkikannan/nmflibrary that can run from small laptops to supercomputers, creating a user-wide platform for rapid dissemination and adoption across scientific disciplines.

47 OTHER INSTRUMENTATION↗

Assessing the quality of curvilinear coordinate meshes by decomposing the Jacobian matrix

An algebraic decomposition of the Jacobian matrix which relates physical and computational variables is presented. This invertible decomposition parameterizes the mesh by the physically intuitive qualities of cell orientation, cell orthogonality, cell volume, and cell aspect ratio. The decomposition can be used to analyze numerically generated curvilinear coordinate meshes and to assess the contribution of the mesh to the truncation error for any specific differential operator and algorithm. This is worked out in detail for Laplace's equation in nonconservative and conservative forms. The analysis is applied to the solution of the full potential code TAIR, showing grid plots, carpet plots, and truncation error for a NACA 0012 airfoil.

Kerlick, G. D.↗

Surface infrastructure functions, requirements and subsystems for a manned Mars mission

Planning and development for a permanently manned scientific outpost on Mars requires an in-depth understanding and analysis of the functions the outpost is expected to perform. The optimum configuration that accomplishes these functions then arises during the trade studies process. In a project this complex, it becomes necessary to use a formal methodology to document the design and planning process. The method chosen for this study is called top-down functional decomposition. This method is used to determine the functions that are needed to accomplish the overall mission, then determine what requirements and systems are needed to do each of the functions. This method facilitates automation of the trades and options process. In the example, this was done with an off-the shelf software package called TK! olver. The basic functions that a permanently manned outpost on Mars must accomplish are: (1) Establish the Life Critical Systems; (2) Support Planetary Sciences and Exploration; and (3) Develop and Maintain Long-term Support Functions, including those systems needed towards self-sufficiency. The top-down functional decomposition methology, combined with standard spread sheet software, offers a powerful tool to quickly assess various design trades and analyze options. As the specific subsystems, and the relational rule algorithms are further refined, it will be possible to very accurately determine the implications of continually evolving mission requirements.

Kyle Fairchild↗

An asymptotic induced numerical method for the convection-diffusion-reaction equation

A parallel algorithm for the efficient solution of a time dependent reaction convection diffusion equation with small parameter on the diffusion term is presented. The method is based on a domain decomposition that is dictated by singular perturbation analysis. The analysis is used to determine regions where certain reduced equations may be solved in place of the full equation. Parallelism is evident at two levels. Domain decomposition provides parallelism at the highest level, and within each domain there is ample opportunity to exploit parallelism. Run time results demonstrate the viability of the method.

Scroggs, Jeffrey S.↗

Solving periodic block tridiagonal systems using the Sherman-Morrison-Woodbury formula

Many algorithms for solving the Navier-Stokes equations require the solution of periodic block tridiagonal systems of equations. By applying a splitting to the matrix representing this system of equations, it may first be reduced to a block tridiagonal matrix plus an outer product of two block vectors. The Sherman-Morrison-Woodbury formula is then applied. The algorithm thus reduces a periodic banded system to a non-periodic banded system with additional right-hand sides and is of higher efficiency than standard Thomas algorithm/LU decompositions.

Yarrow, Maurice↗

Expert systems for assembly sequence evaluation

The objective is to identify delivered orbital subassemblies derived from a phase A conceptual space vehicle design while minimizing on-orbit assembly complexity. The topics covered are presented in viewgraph form and include the following: an orbital assembly scenario; subassemblies; subassembly identification and simulation model; estimating subassembly interfaces by engineering functional allocation using MBR; representative data base of interface connections; vehicle decomposition model; connection interface estimation model results; knowledge-source 1 and 2 results; knowledge-source 3 -- connection-index results (Boeing NTR-2016 CI-profile); KS3 algorithm, and KS3 flight manifest results.

Jolly, Steve↗

Using Strassen's algorithm to accelerate the solution of linear systems

Strassen's algorithm for fast matrix-matrix multiplication has been implemented for matrices of arbitrary shapes on the CRAY-2 and CRAY Y-MP supercomputers. Several techniques have been used to reduce the scratch space requirement for this algorithm while simultaneously preserving a high level of performance. When the resulting Strassen-based matrix multiply routine is combined with some routines from the new LAPACK library, LU decomposition can be performed with rates significantly higher than those achieved by conventional means. We succeeded in factoring a 2048 x 2048 matrix on the CRAY Y-MP at a rate equivalent to 325 MFLOPS.

Bailey, David H.↗

A Domain-Decomposed Multilevel Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

Preliminary verification and validation of an efficient Euler solver for adaptively refined Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The coarse mesh generation algorithm produces grids which completely cover the computational domain at every level in the mesh hierarchy. A series of examples on realistically complex three-dimensional configurations demonstrate that this new coarsening algorithm reliably achieves mesh coarsening ratios in excess of 7 on adaptively refined meshes. Numerical investigations of the scheme's local truncation error demonstrate an achieved order of accuracy between 1.82 and 1.88. Convergence results for the multigrid scheme are presented for both subsonic and transonic test cases and demonstrate W-cycle multigrid convergence rates between 0.84 and 0.94. Preliminary parallel scalability tests on both simple wing and complex complete aircraft geometries shows a computational speedup of 52 on 64 processors using the run-time mesh partitioner.

Aftosmis, M. J.↗

On Soil Moisture Retrieval and Target Decomposition

In an earlier study, an empirical model was developed to infer soil moisture and surface roughness from radar data. The inversion technique was extensively tested over bare surfaces by comparing the estimated soil moisture to in situ measurements. The overall RMS error in the soil moisture estimate was found to be 3.5% and the RMS error in the RMS height estimate was less than 0.35 cm absolute for bare or slightly vegetated surfaces. However, inversion results indicate that significant amounts of vegetation cause the algorithm to underestimate soil moisture and overestimate RMS height. Among the areas over which the inversion cannot be applied, the areas with intermediate vegetation cover are of particular interest as both the vegetation and the underlying bare surface affect the backscatter. This paper concentrates mostly on these areas. Using the full polarimetric information and the Cloude target decomposition approach. Three different components of the target backscattering can be isolated. One of these three components can be identified as the surface component in the case of intermediate vegetation cover. Once the surface component of the scattering is isolated, the bare surface inversion can then be applied.

Dubois, Pascale C.↗

Robot Acting on Moving Bodies (RAMBO): Interaction with tumbling objects

Interaction with tumbling objects will become more common as human activities in space expand. Attempting to interact with a large complex object translating and rotating in space, a human operator using only his visual and mental capacities may not be able to estimate the object motion, plan actions or control those actions. A robot system (RAMBO) equipped with a camera, which, given a sequence of simple tasks, can perform these tasks on a tumbling object, is being developed. RAMBO is given a complete geometric model of the object. A low level vision module extracts and groups characteristic features in images of the object. The positions of the object are determined in a sequence of images, and a motion estimate of the object is obtained. This motion estimate is used to plan trajectories of the robot tool to relative locations rearby the object sufficient for achieving the tasks. More specifically, low level vision uses parallel algorithms for image enhancement by symmetric nearest neighbor filtering, edge detection by local gradient operators, and corner extraction by sector filtering. The object pose estimation is a Hough transform method accumulating position hypotheses obtained by matching triples of image features (corners) to triples of model features. To maximize computing speed, the estimate of the position in space of a triple of features is obtained by decomposing its perspective view into a product of rotations and a scaled orthographic projection. This allows use of 2-D lookup tables at each stage of the decomposition. The position hypotheses for each possible match of model feature triples and image feature triples are calculated in parallel. Trajectory planning combines heuristic and dynamic programming techniques. Then trajectories are created using dynamic interpolations between initial and goal trajectories. All the parallel algorithms run on a Connection Machine CM-2 with 16K processors.

Davis, Larry S.↗

On Soil Moisture Retrieval and Target Decomposition

In an earlier study, an empirical model was developed to infer soil moisture and surface roughness from radar data. The inversion technique was extensively tested over bare surfaces by comparing the estimated soil moisture to in situ measurements. The overall root mean square (RMS) error in the soil moisture estimate was found to be about 3.5% and the RMS error in the RMS height estimate was less than 0.35 cm absolute for bare or slightly vegetated surfaces. However, inversion results indicate that significant amounts of vegetation cause the algorithm to underestimate soil moisture and overestimate RMS height. Among the areas over which the inversion cannot be applied, the areas with intermediate vegetation cover are of particular interest as both the vegetation and the underlying bare surface affect the backscatter. This paper concentrates mostly on these areas. Using the full polarimetric information and the Cloude target decomposition approach, three different components of the target backscattering can be isolated. One of these three components can be identified as the surface component in the case of intermediate vegetation cover. Once the surface component of the scattering is isolated, the bare surface inversion can then be applied.

Dubois, Pascale C.↗

Robot acting on moving bodies (RAMBO): Preliminary results

A robot system called RAMBO is being developed. It is equipped with a camera, which, given a sequence of simple tasks, can perform these tasks on a moving object. RAMBO is given a complete geometric model of the object. A low level vision module extracts and groups characteristic features in images of the object. The positions of the object are determined in a sequence of images, and a motion estimate of the object is obtained. This motion estimate is used to plan trajectories of the robot tool to relative locations nearby the object sufficient for achieving the tasks. More specifically, low level vision uses parallel algorithms for image enchancement by symmetric nearest neighbor filtering, edge detection by local gradient operators, and corner extraction by sector filtering. The object pose estimation is a Hough transform method accumulating position hypotheses obtained by matching triples of image features (corners) to triples of model features. To maximize computing speed, the estimate of the position in space of a triple of features is obtained by decomposing its perspective view into a product of rotations and a scaled orthographic projection. This allows the use of 2-D lookup tables at each stage of the decomposition. The position hypotheses for each possible match of model feature triples and image feature triples are calculated in parallel. Trajectory planning combines heuristic and dynamic programming techniques. Then trajectories are created using parametric cubic splines between initial and goal trajectories. All the parallel algorithms run on a Connection Machine CM-2 with 16K processors.

Davis, Larry S.↗

Direct simulation of compressible turbulence

Several direct simulations of 3-D homogeneous, compressible turbulence are presented with emphasis on the differences with incompressible turbulent simulations. A fully spectral collocation algorithm, periodic in all directions coupled with a 3rd order Runge-Kutta time discretization scheme is sufficient to produce well-resolved flows at Taylor Reynolds numbers below 40 on grids of 128x128x128. A Helmholtz decomposition of velocity is useful to differentiate between the purely compressible effects and those effects solely due to vorticity production. In the context of homogeneous flows, this decomposition in unique. Time-dependent energy and dissipation spectra of the compressible and solenoidal velocity components indicate the presence of localized small scale structures. These structures are strongly a function of the initial conditions. Researchers concentrate on a regime characterized by very small fluctuating Mach numbers Ma (on the order of 0.03) and density and temperature fluctuations much greater than sq Ma. This leads to a state in which more than 70 percent of the kinetic energy is contained in the so-called compressible component of the velocity. Furthermore, these conditions lead to the formation of curved weak shocks (or shocklets) which travel at approximately the sound speed across the physical domain. Various terms in the vorticity and divergence of velocity production equations are plotted versus time to gain some understanding of how small scales are actually formed. Possible links with Burger turbulence are examined. To visualize better the dynamics of the flow, new graphic visualization techniques have been developed. The 3-D structure of the shocks are visualized with the help of volume rendering algorithms developed in-house. A combination of stereographic projection and animation greatly increase the number of visual cues necessary to properly interpret the complex flow.

Zang, T. A.↗

Data-Driven Analysis of Multipactor Dynamics via Dynamic Mode Decomposition

Multipactor effect is a performance-limiting kinetic plasma effect that can occur in high-power microwave and radio frequency (RF) devices. Multipactor effect is of special concern in vacuum or near-vacuum conditions such as those in particle accelerators and spaceborne devices. In this work, we present a data-driven reduced-order model (ROM) based on dynamic mode decomposition (DMD) for modeling of multipactor effects. We study multipactor effects and the resulting nonlinear harmonic generation by processing high-fidelity data generated from electromagnetic particle-in-cell (EMPIC) simulations using the DMD algorithm. We also investigate time-delay embedding extensions of DMD with improved generalizability and accuracy for modeling the electron plasma current density behavior. Here, the results show that DMD provides valuable insights into multipactor phenomena by extracting relevant modal spatiotemporal patterns and frequencies. In addition, DMD offers the potential to time extrapolate EMPIC simulations at a minimal cost, thereby reducing overall simulation time.

43 PARTICLE ACCELERATORS↗

Cryogenic energy storage: Standalone design, rigorous optimization and techno-economic analysis

Energy storage allows flexible use and management of excess electricity and intermittently available renewable energy. Cryogenic energy storage (CES) is a promising storage alternative with a high technology readiness level and maturity, but the round-trip efficiency is often moderate and the Levelized Cost of Storage (LCOS) remains high. The complex flowsheets with intricate thermodynamics at cryogenic temperatures as well as the presence of multiple loops and refrigeration cycles pose considerable challenges for rigorous model-based design and optimization of CES systems. We present an optimization strategy that couples rigorous process simulation and Bayesian optimization with flowsheet decomposition and identification of hidden coupling constraints to optimally design standalone CES systems. Further refinement is done via a local search using the limited-memory Broyden–Fletcher–Goldfarb–Shanno algorithm. Here our results indicate that it is possible to achieve more than 52% round-trip efficiency and an LCOS of $153/MWh for a standalone 100 MW/400 MWh CES system limited to short-term storage with daily charging–discharging. However, a detailed techno-economic assessment reveals that the LCOS considering total capital investment may exceed $267/MWh when all direct and indirect costs of installation and operation are considered.

25 ENERGY STORAGE↗

buhito

buhito is a Python library for graph analysis and machine learning. Graphs can represent networks with objects as nodes and their relationships as edges. buhito focuses on graphlet methods that study graphs through enumerating their component subgraphs to enable interpretable and fast models of complex systems. The package provides tools for different algorithmic designs for computing, analyzing, and applying graphlets to research problems such as machine learning, data compression, and anomaly detection in graph-structured data. A central feature is performing decomposition data analysis on graphs for machine learning models. Implemented in Python and built upon open-source scientific libraries such as NetworkX, NumPy, and SciPy, buhito provides high-performance methods for researchers exploring the mathematical and computational foundations of graphlet analysis applicable to systems of different sizes.

Pimonova, Yulia↗

Tensor renormalization group study of 3D principal chiral model

We study the three-dimensional SU(2) principal chiral model using different tensor renormalization group methods based on the triad and anisotropic decomposition of the tensor. The tensor network representation is formulated based on the character expansion of the Boltzmann weight. We compare the average action obtained using these two tensor network algorithms and confirm that the resulting critical coupling and exponent are comparable with the recent estimations from the Monte Carlo methods.

Unmuth-Yockey, Judah↗

Finite Element Methods for real-time Haptic Feedback of Soft-Tissue Models in Virtual Reality Simulators

We have applied the linear elastic finite element method to compute haptic force feedback and domain deformations of soft tissue models for use in virtual reality simulators. Our results show that, for virtual object models of high-resolution 3D data (>10,000 nodes), haptic real time computations (>500 Hz) are not currently possible using traditional methods. Current research efforts are focused in the following areas: 1) efficient implementation of fully adaptive multi-resolution methods and 2) multi-resolution methods with specialized basis functions to capture the singularity at the haptic interface (point loading). To achieve real time computations, we propose parallel processing of a Jacobi preconditioned conjugate gradient method applied to a reduced system of equations resulting from surface domain decomposition. This can effectively be achieved using reconfigurable computing systems such as field programmable gate arrays (FPGA), thereby providing a flexible solution that allows for new FPGA implementations as improved algorithms become available. The resulting soft tissue simulation system would meet NASA Virtual Glovebox requirements and, at the same time, provide a generalized simulation engine for any immersive environment application, such as biomedical/surgical procedures or interactive scientific applications.

Frank, Andreas O.↗