Search NASASearch

SEARCH · Search NASA

Results for “Structural 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 37 records · Page 2

Neural network based decomposition in optimal structural synthesis

The present paper describes potential applications of neural networks in the multilevel decomposition based optimal design of structural systems. The generic structural optimization problem of interest, if handled as a single problem, results in a large dimensionality problem. Decomposition strategies allow for this problem to be represented by a set of smaller, decoupled problems, for which solutions may either be obtained with greater ease or may be obtained in parallel. Neural network models derived through supervised training, are used in two distinct modes in this work. The first uses neural networks to make available efficient analysis models for use in repetitive function evaluations as required by the optimization algorithm. In the second mode, neural networks are used to represent the coupling that exists between the decomposed subproblems. The approach is illustrated by application to the multilevel decomposition-based synthesis of representative truss and frame structures.

Hajela, P.

Ada style guide (version 1.1)

Ada is a programming language of considerable expressive power. The Ada Language Reference Manual provides a thorough definition of the language. However, it does not offer sufficient guidance on the appropriate use of Ada's powerful features. For this reason, the Goddard Space Flight Center Ada User's Group has produced this style guide which addresses such program style issues. The guide covers three areas of Ada program style: the structural decomposition of a program; the coding and the use of specific Ada features; and the textural formatting of a program.

Seidewitz, Edwin V.

Structural analysis and design of multivariable control systems: An algebraic approach

The application of algebraic system theory to the design of controllers for multivariable (MV) systems is explored analytically using an approach based on state-space representations and matrix-fraction descriptions. Chapters are devoted to characteristic lambda matrices and canonical descriptions of MIMO systems; spectral analysis, divisors, and spectral factors of nonsingular lambda matrices; feedback control of MV systems; and structural decomposition theories and their application to MV control systems.

Tsay, Yih Tsong

Method and apparatus for filtering visual documents

A method and apparatus for producing an abstract or condensed version of a visual document is presented. The frames comprising the visual document are first sampled to reduce the number of frames required for processing. The frames are then subjected to a structural decomposition process that reduces all information in each frame to a set of values. These values are in turn normalized and further combined to produce only one information content value per frame. The information content values of these frames are then compared to a selected distribution cutoff point. This effectively selects those values at the tails of a normal distribution, thus filtering key frames from their surrounding frames. The value for each frame is then compared with the value from the previous frame, and the respective frame is finally stored only if the values are significantly different. The method filters or compresses a visual document with a reduction in digital storage on the ratio of up to 700 to 1 or more, depending on the content of the visual document being filtered.

Rorvig, Mark E.

ICER-3D: A Progressive Wavelet-Based Compressor for Hyperspectral Images

ICER-3D is a progressive, wavelet-based compressor for hyperspectral images. ICER-3D is derived from the ICER image compressor. ICER-3D can provide lossless and lossy compression, and incorporates an error-containment scheme to limit the effects of data loss during transmission. The three-dimensional wavelet decomposition structure used by ICER-3D exploits correlations in all three dimensions of hyperspectral data sets, while facilitating elimination of spectral ringing artifacts. Correlation is further exploited by a context modeler that effectively exploits spectral dependencies in the wavelet-transformed hyperspectral data. Performance results illustrating the benefits of these features are presented.

Kiely, A.

ICER-3D Hyperspectral Image Compression Software

Software has been developed to implement the ICER-3D algorithm. ICER-3D effects progressive, three-dimensional (3D), wavelet-based compression of hyperspectral images. If a compressed data stream is truncated, the progressive nature of the algorithm enables reconstruction of hyperspectral data at fidelity commensurate with the given data volume. The ICER-3D software is capable of providing either lossless or lossy compression, and incorporates an error-containment scheme to limit the effects of data loss during transmission. The compression algorithm, which was derived from the ICER image compression algorithm, includes wavelet-transform, context-modeling, and entropy coding subalgorithms. The 3D wavelet decomposition structure used by ICER-3D exploits correlations in all three dimensions of sets of hyperspectral image data, while facilitating elimination of spectral ringing artifacts, using a technique summarized in "Improving 3D Wavelet-Based Compression of Spectral Images" (NPO-41381), NASA Tech Briefs, Vol. 33, No. 3 (March 2009), page 7a. Correlation is further exploited by a context-modeling subalgorithm, which exploits spectral dependencies in the wavelet-transformed hyperspectral data, using an algorithm that is summarized in "Context Modeler for Wavelet Compression of Hyperspectral Images" (NPO-43239), which follows this article. An important feature of ICER-3D is a scheme for limiting the adverse effects of loss of data during transmission. In this scheme, as in the similar scheme used by ICER, the spatial-frequency domain is partitioned into rectangular error-containment regions. In ICER-3D, the partitions extend through all the wavelength bands. The data in each partition are compressed independently of those in the other partitions, so that loss or corruption of data from any partition does not affect the other partitions. Furthermore, because compression is progressive within each partition, when data are lost, any data from that partition received prior to the loss can be used to reconstruct that partition at lower fidelity. By virtue of the compression improvement it achieves relative to previous means of onboard data compression, this software enables (1) increased return of hyperspectral scientific data in the presence of limits on the rates of transmission of data from spacecraft to Earth via radio communication links and/or (2) reduction in spacecraft radio-communication power and/or cost through reduction in the amounts of data required to be downlinked and stored onboard prior to downlink. The software is also suitable for compressing hyperspectral images for ground storage or archival purposes.

Xie, Hua

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms

Data Structure and Parallel Decomposition Considerations on a Fibonacci Grid

The Fibonacci grid, proposed by Swinbank and Purser (see companion abstract), provides attractive properties for global numerical atmospheric prediction by offering an optimally homogeneous, geometrically regular, and approximately isotropic discretization, with only the polar regions requiring special numerical treatment. It is a mathematical idealization, applied to the sphere, of the multi-spiral patterns often found in botanical structures, such as in pine cones and sunflower heads. Computationally, it is natural to organize the domain, into zones, in each of which the same pair, or triple, of "Fibonacci spirals" dominate. But the further subdivision of such zones into "tiles" of a shape and size suitable for distribution to the processors of a massively parallel computer requires very careful consideration if the subsequent spatial computations along the respective spirals, especially those computations (such as compact differencing schemes) that involve recursion, can be implemented in an efficient "load-balanced "manner without requiring excessive amounts of inter-processor communications. In this paper we show how certain "number theoretic" properties of the Fibonacci sequence (whose numbers prescribe the multiplicity of successive spirals) may be exploited in the decomposition of grid zones into tidy arrangements of triangular grid tiles, each tile possessing one side approximately parallel to the constant-latitude zone boundary. We also describe how the spatially recursive processes may be decomposed across such a tiling, and the directionality of the recursions reversed on alternate grid lines, to ensure a very high degree of load balancing throughout the execution of the computations required for one time step of a global model.

Michalakes, John

Stationary Oxygen Vacancy Construction toward a Superior-Performance Ultrahigh Nickel Single-Crystal Cathode

Oxygen vacancies exert a complex and profound influence on the layered cathodes, especially those with ultrahigh nickel content. They can facilitate lithium-ion transport and enhance electronic conductivity, while aggressive oxygen vacancy formation causes structural degradation and electrolyte decomposition. Herein, taking ultrahigh nickel single-crystal LiNi 0.92 Co 0.06 Mn 0.02 O 2 (SC-Ni92) as a model material, we propose a pinning strategy to harness the benefits of oxygen vacancies while mitigating their detrimental effects. Through a carefully controlled thermal process, both oxygen vacancies and pinning atoms are successfully introduced into the surface region. The resulting anchored oxygen vacancies, capitalizing on their inherent advantages, improve conductivity and lithium-ion diffusion. Simultaneously, the neighboring pinning atoms effectively increase the migration barrier and suppress the adverse effects of these vacancies, including electrolyte decomposition and structural degradation during long-term electrochemical cycling. Consequently, oxygen vacancy-anchored single-crystal LiNi 0.92 Co 0.06 Mn 0.02 O 2 (SC-Ni92-OV) demonstrates significantly improved high-voltage electrochemical performance, with 86.16% capacity retention after 200 cycles at 4.6 V and 1 C in a half-cell and 90.71% after 300 cycles at 4.5 V and 1 C in a full cell. Furthermore, this study not only provides valuable insights into the chemistry of oxygen vacancy but also introduces a viable strategy for leveraging oxygen vacancies to achieve stable high-voltage performance in ultrahigh nickel single-crystal cathodes.

defects in solids

Hierarchical Gaussian Random Field Sampling for Multilevel Markov Chain Monte Carlo: Coupling Stochastic Partial Differential Equation and the Karhunen–Loève Decomposition

This work introduces structure preserving hierarchical decompositions for sampling Gaussian random fields (GRFs) within the context of multilevel Bayesian inference in high-dimensional space. Existing scalable hierarchical sampling methods, such as those based on stochastic partial differential equations (SPDEs), often reduce the dimensionality of the sample space at the cost of accuracy of inference. Other approaches, such that those based on Karhunen-Loève (KL) expansions, offer sample space dimensionality reduction but sacrifice GRF representation accuracy and ergodicity of the Markov chain Monte Carlo (MCMC) sampler and are computationally expensive for high-dimensional problems. The proposed method integrates the dimensionality reduction capabilities of KL expansions with the scalability of SPDE-based sampling, thereby providing a robust, unified framework for high-dimensional uncertainty quantification (UQ) that is scalable and accurate, preserves ergodicity, and offers dimensionality reduction of the sample space. The hierarchy in our multilevel algorithm is derived from the geometric multigrid hierarchy. By constructing a hierarchical decomposition that maintains the covariance structure across the levels in the hierarchy, the approach enables efficient coarse-to-fine sampling while ensuring that all samples are drawn from the desired distribution. The effectiveness of the proposed method is demonstrated on a benchmark subsurface flow problem, demonstrating its effectiveness in improving computational efficiency and statistical accuracy. Furthermore, our proposed technique is more efficient and accurate and displays better convergence properties than existing methods for high-dimensional Bayesian inference problems.

Gaussian random fields

Structural optimization by multilevel decomposition

The application of formal optimization techniques to the design of large engineering structures such as aircraft is presently hindered in connection with the large number of design variables involved. According to an approach which attempts to overcome the difficulties, the problem is broken up into several smaller subproblems. This approach has, however, weaknesses which may prevent a determination of the minimum structural weight. Schmit and Ramanathan (1973) have developed a method, which is designed to incorporate control of the material distribution among the finite elements of an assembled structure for a two-level optimization. However, the optimization schemes considered would not be suitable to optimization schemes considered would not be suitable to multidisciplinary optimization of large engineering systems. Sobieszczanski-Sobieski (1982) proposed a method for decomposing a large multidisciplinary optimization problem into a number of small subproblems. The present investigation is concerned with the implementation of this method.

Sobieszczanski-Sobieski, J.

QuadSync: Quadrifocal tensor synchronization via Tucker decomposition

In structure from motion, quadrifocal tensors capture more information than their pairwise counterparts (essential matrices), yet they have often been thought of as impractical and only of theoretical interest. In this work, we challenge such beliefs by providing a new framework to recover n cameras from the corresponding collection of quadrifocal tensors. We form the block quadrifocal tensor and show that it admits a Tucker decomposition whose factor matrices are the stacked camera matrices, and which thus has a multilinear rank of (4,4,4,4) independent of n. We develop the first synchronization algorithm for quadrifocal tensors, using Tucker decomposition, alternating direction method of multipliers, and iteratively reweighted least squares. We further establish relationships between the block quadrifocal, trifocal, and bifocal tensors, and introduce an algorithm that jointly synchronizes these three entities. Numerical experiments demonstrate the effectiveness of our methods on modern datasets, indicating the potential and importance of using higher-order information in synchronization.

Miao, Daniel [University of Minnesota]

Noise transmission into enclosures

This paper describes analytical and experimental studies of noise transmission into rectangular and cylindrical enclosures. The solutions of the governing acoustic-structural equations are developed by modal decomposition of structural vibrations and the interior acoustic field. Particular attention is directed toward the low frequencies, that is, frequencies up through the first few structural and cavity resonant modes. The structural vibrations are driven by the external acoustic and/or mechanical point loads which are taken to be Gaussian stationary random processes. The structural models include rectangular panels and cylindrical shells.

Vaicaitis, R.

Structural optimization by multilevel decomposition

A method is described for decomposing an optimization problem into a set of subproblems and a coordination problem which preserves coupling between the subproblems. The method is introduced as a special case of multilevel, multidisciplinary system optimization and its algorithm is fully described for two level optimization for structures assembled of finite elements of arbitrary type. Numerical results are given for an example of a framework to show that the decomposition method converges and yields results comparable to those obtained without decomposition. It is pointed out that optimization by decomposition should reduce the design time by allowing groups of engineers, using different computers to work concurrently on the same large problem.

Sobieszczanski-Sobieski, J.

Multilevel optimization using a continuum model for structures

The new concept of using a continuum model in the multilevel decomposition of structural optimization problems is presented. The practicality of this concept is demonstrated by application in a scheme for the optimization of beam-like space structures. This scheme is tested against traditional optimization procedures for savings in computational cost. Results from both optimization methods are presented for comparison.

Yates, K.

Structural optimization by generalized, multilevel decomposition

The developments toward a general multilevel optimization capability and results for a three-level structural optimization are described. The method partitions a structure into a number of substructuring levels where each substructure corresponds to a subsystem in the general case of an engineering system. The method is illustrated by a portal framework that decomposes into individual beams. Each beam is a box that can be further decomposed into stiffened plates. Substructuring for this example spans three different levels: (1) the bottom level of finite elements representing the plates; (2) an intermediate level of beams treated as substructures; and (3) the top level for the assembled structure. The three-level case is now considered to be qualitatively complete.

Sobieszczanski-Sobieski, J.

Studies in turbulence

Various papers on turbulence are presented. Individual topics addressed include: modeling the dissipation rate in rotating turbulent flows, mapping closures for turbulent mixing and reaction, understanding turbulence in vortex dynamics, models for the structure and dynamics of near-wall turbulence, complexity of turbulence near a wall, proper orthogonal decomposition, propagating structures in wall-bounded turbulence flows. Also discussed are: constitutive relation in compressible turbulence, compressible turbulence and shock waves, direct simulation of compressible turbulence in a shear flow, structural genesis in wall-bounded turbulence flows, vortex lattice structure of turbulent shear slows, etiology of shear layer vortices, trilinear coordinates in fluid mechanics.

Gatski, Thomas B.