Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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 361 records · Page 20

Design of Robust Adaptive Unbalance Response Controllers for Rotors with Magnetic Bearings

Experimental results have recently demonstrated that an adaptive open loop control strategy can be highly effective in the suppression of unbalance induced vibration on rotors supported in active magnetic bearings. This algorithm, however, relies upon a predetermined gain matrix. Typically, this matrix is determined by an optimal control formulation resulting in the choice of the pseudo-inverse of the nominal influence coefficient matrix as the gain matrix. This solution may result in problems with stability and performance robustness since the estimated influence coefficient matrix is not equal to the actual influence coefficient matrix. Recently, analysis tools have been developed to examine the robustness of this control algorithm with respect to structured uncertainty. Herein, these tools are extended to produce a design procedure for determining the adaptive law's gain matrix. The resulting control algorithm has a guaranteed convergence rate and steady state performance in spite of the uncertainty in the rotor system. Several examples are presented which demonstrate the effectiveness of this approach and its advantages over the standard optimal control formulation.

Knospe, Carl R.↗

Planning Assembly Of Large Truss Structures In Outer Space

Report dicusses developmental algorithm used in systematic planning of sequences of operations in which large truss structures assembled in outer space. Assembly sequence represented by directed graph called "assembly graph", in which each arc represents joining of two parts or subassemblies. Algorithm generates assembly graph, working backward from state of complete assembly to initial state, in which all parts disassembled. Working backward more efficient than working forward because it avoids intermediate dead ends.

De Mello, Luiz S. Homem↗

A third order Runge-Kutta algorithm on a manifold

A third order Runge-Kutta type algorithm is described with the property that it preserves certain geometric structures. In particular, if the algorithm is initialized on a Lie group, then the resulting iterates remain on the Lie group.

Crouch, P. E.↗

Dual methods and approximation concepts in structural synthesis

Approximation concepts and dual method algorithms are combined to create a method for minimum weight design of structural systems. Approximation concepts convert the basic mathematical programming statement of the structural synthesis problem into a sequence of explicit primal problems of separable form. These problems are solved by constructing explicit dual functions, which are maximized subject to nonnegativity constraints on the dual variables. It is shown that the joining together of approximation concepts and dual methods can be viewed as a generalized optimality criteria approach. The dual method is successfully extended to deal with pure discrete and mixed continuous-discrete design variable problems. The power of the method presented is illustrated with numerical results for example problems, including a metallic swept wing and a thin delta wing with fiber composite skins.

Fleury, C.↗

Concurrent processing in nonlinear structural stability

A concurrent processing algorithm is developed for materially nonlinear stability analysis of imperfect columns with biaxial partial rotational end restraints. The algorithm for solving the governing nonlinear ordinary differential equations is implemented on a multiprocessor computer called the 'Finite Element Machine', developed at the NASA Langley Research Center. Numerical results are obtained on up to nine concurrent processors. A substantial computational gain is achieved in using the parallel processing approach.

Darbhamulla, S. P.↗

Finite Element model refinement with actual forced responses of structures

The formulation and computer algorithm for Finite Element model refinement based on correlation with frequency response test results have been developed. The proposed approach is derived from the direct frequency response formulation of dynamic systems. The computer algorithm has been effectively implemented in MSC/NASTRAN's DMAP language. Numerical examples are given to show the effectiveness of the method. Also, numerical difficulties and their possible solutions are discussed.

Ting, T.↗

Linear static structural and vibration analysis on high-performance computers

Parallel computers offer the oppurtunity to significantly reduce the computation time necessary to analyze large-scale aerospace structures. This paper presents algorithms developed for and implemented on massively-parallel computers hereafter referred to as Scalable High-Performance Computers (SHPC), for the most computationally intensive tasks involved in structural analysis, namely, generation and assembly of system matrices, solution of systems of equations and calculation of the eigenvalues and eigenvectors. Results on SHPC are presented for large-scale structural problems (i.e. models for High-Speed Civil Transport). The goal of this research is to develop a new, efficient technique which extends structural analysis to SHPC and makes large-scale structural analyses tractable.

Baddourah, M. A.↗

Linear Static Structural and Vibration Analysis on High-Performance Computers

Parallel computers offer the opportunity to significantly reduce the computation time necessary to analyze large-scale aerospace structures. This paper presents algorithms developed for and implemented on a massively-parallel computers hereafter referred to as Scalable High Performance Computers (SHPC) for the most computationally intensive tasks involved in structural analysis, namely, generation and assembly of system matrices, solution of systems of equations and calculation of the eigenvalues and eigenvectors. Results on SHPC are presented for large-scale structural problems (i.e. Models of high speed civil transport). The goal of this research is to develop new efficient technique which extend structural analysis to SHPC and make large-scale structural analyses tractable.

Baddourah, Majdi↗

MODIS Snow Cover Mapping Decision Tree Technique: Snow and Cloud Discrimination

Accurate mapping of snow cover continues to challenge cryospheric scientists and modelers. The Moderate-Resolution Imaging Spectroradiometer (MODIS) snow data products have been used since 2000 by many investigators to map and monitor snow cover extent for various applications. Users have reported on the utility of the products and also on problems encountered. Three problems or hindrances in the use of the MODIS snow data products that have been reported in the literature are: cloud obscuration, snow/cloud confusion, and snow omission errors in thin or sparse snow cover conditions. Implementation of the MODIS snow algorithm in a decision tree technique using surface reflectance input to mitigate those problems is being investigated. The objective of this work is to use a decision tree structure for the snow algorithm. This should alleviate snow/cloud confusion and omission errors and provide a snow map with classes that convey information on how snow was detected, e.g. snow under clear sky, snow tinder cloud, to enable users' flexibility in interpreting and deriving a snow map. Results of a snow cover decision tree algorithm are compared to the standard MODIS snow map and found to exhibit improved ability to alleviate snow/cloud confusion in some situations allowing up to about 5% increase in mapped snow cover extent, thus accuracy, in some scenes.

Riggs, George A.↗

Next-Generation Aura/OMI NO2 and SO2 Products

The measurement of both SO2 and NO2 gases are recognized as an essential component of atmospheric composition missions. We describe current capabilities and limitations of the operational Aura/OMI NO2 and SO2 data that have been used by a large number of researchers. Analyses of the data and validation studies have brought to light a number of areas in which these products can be expanded and improved. Major improvements for new NASA standard (SP) NO2 product include more accurate tropospheric and stratospheric column amounts, along with much improved error estimates and diagnostics. Our approach uses a monthly NO2 climatology based on the NASA Global Modeling Initiative (GMI) chemistry-transport model and takes advantage of OMI data from cloudy scenes to find clean areas where the contribution from the trap NO2 column is relatively small. We then use a new filtering, interpolation and smoothing techniques for separating the stratospheric and tropospheric components of NO2, minimizing the influence of a priori information. The new algorithm greatly improves the structure of stratospheric features relative to the original SP. For the next-generation OMI SO2 product we plan to implement operationally the offline iterative spectral fitting (ISF) algorithm and re-process the OMI Level-2 SO2 dataset using a priori SO2 and aerosol profiles, clouds, and surface reflectivity appropriate for observation conditions. This will improve the ability to detect and quantify weak tropospheric SO2 loadings. The new algorithm is validated using aircraft in-situ data during field campaigns in China (2005 and 2008) and in Maryland (Frostburg, 2010 and DISCOVER-AQ in July 2011). The height of the SO2 plumes will also be estimated for high SO2 loading cases (e.g., volcanic eruptions). The same SO2 algorithm will be applied to the data from OMPS sensor to be launched on NPP satellite later this year. The next-generation NO2 and SO2 products will provide critical information (e.g., averaging kernels) for evaluation of chemistry-transport models, for data assimilation, and to impose top-down constraints on the SO2 and NO2 emission sources.

Krotkov, Nickolay↗

Current capabilities for simulating the extreme distortion of thin structures subjected to severe impacts

The explicit transient dynamics technology in use today for simulating the impact and subsequent transient dynamic response of a structure has its origins in the 'hydrocodes' dating back to the late 1940's. The growth in capability in explicit transient dynamics technology parallels the growth in speed and size of digital computers. Computer software for simulating the explicit transient dynamic response of a structure is characterized by algorithms that use a large number of small steps. In explicit transient dynamics software there is a significant emphasis on speed and simplicity. The finite element technology used to generate the spatial discretization of a structure is based on a compromise between completeness of the representation for the physical processes modelled and speed in execution. That is, since it is expected in every calculation that the deformation will be finite and the material will be strained beyond the elastic range, the geometry and the associated gradient operators must be reconstructed, as well as complex stress-strain models evaluated at every time step. As a result, finite elements derived for explicit transient dynamics software use the simplest and barest constructions possible for computational efficiency while retaining an essential representation of the physical behavior. The best example of this technology is the four-node bending quadrilateral derived by Belytschko, Lin and Tsay. Today, the speed, memory capacity and availability of computer hardware allows a number of the previously used algorithms to be 'improved.' That is, it is possible with today's computing hardware to modify many of the standard algorithms to improve their representation of the physical process at the expense of added complexity and computational effort. The purpose is to review a number of these algorithms and identify the improvements possible. In many instances, both the older, faster version of the algorithm and the improved and somewhat slower version of the algorithm are found implemented together in software. Specifically, the following seven algorithmic items are examined: the invariant time derivatives of stress used in material models expressed in rate form; incremental objectivity and strain used in the numerical integration of the material models; the use of one-point element integration versus mean quadrature; shell elements used to represent the behavior of thin structural components; beam elements based on stress-resultant plasticity versus cross-section integration; the fidelity of elastic-plastic material models in their representation of ductile metals; and the use of Courant subcycling to reduce computational effort.

Key, Samuel W.↗

A fuzzy measure approach to motion frame analysis for scene detection

This paper addresses a solution to the problem of scene estimation of motion video data in the fuzzy set theoretic framework. Using fuzzy image feature extractors, a new algorithm is developed to compute the change of information in each of two successive frames to classify scenes. This classification process of raw input visual data can be used to establish structure for correlation. The algorithm attempts to fulfill the need for nonlinear, frame-accurate access to video data for applications such as video editing and visual document archival/retrieval systems in multimedia environments.

Leigh, Albert B.↗

An inverse problem approach for structural damage detection - Finite element model refinement

In this work, a methodology for incorporating measured modal data into an existing refined finite element model is examined with the objective of detecting and locating structural damage. This same algorithm is also useful in terms of finite element model refinement. The algorithm is based on the partial inverse problem, in that only partial spectral information is required. The technique utilizes a symmetric eigenstructure assignment algorithm to perform the partial spectral assignment. Algorithms to enhance mode shape assignability and to preserve sparsity in the updated model are developed. The sparsity preservation is of particular importance when considering damage detection in truss-like structures. Several examples are presented which highlight the key points made within the paper.

Zimmerman, D. C.↗

Automated digital motion-video abstraction - A fuzzy measure approach

This paper addresses a solution to the problem of scene estimation of motion video data in the fuzzy set theoretic framework. Using fuzzy image feature extractors, a new algorithm is developed to compute the change of information in each of two successive frames to classify scenes. This classification process of raw input visual data can be used to establish structure for correlation. The algorithm attempts to fulfill the need for non-linear, frame-accurate access to video data for applications such as video editing and visual document archival/retrieval systems in multimedia environments.

Leigh, Albert B.↗

Knowledge acquisition from natural language for expert systems based on classification problem-solving methods

It is shown how certain kinds of domain independent expert systems based on classification problem-solving methods can be constructed directly from natural language descriptions by a human expert. The expert knowledge is not translated into production rules. Rather, it is mapped into conceptual structures which are integrated into long-term memory (LTM). The resulting system is one in which problem-solving, retrieval and memory organization are integrated processes. In other words, the same algorithm and knowledge representation structures are shared by these processes. As a result of this, the system can answer questions, solve problems or reorganize LTM.

Gomez, Fernando↗

Data reduction using cubic rational B-splines

A geometric method is proposed for fitting rational cubic B-spline curves to data that represent smooth curves including intersection or silhouette lines. The algorithm is based on the convex hull and the variation diminishing properties of Bezier/B-spline curves. The algorithm has the following structure: it tries to fit one Bezier segment to the entire data set and if it is impossible it subdivides the data set and reconsiders the subset. After accepting the subset the algorithm tries to find the longest run of points within a tolerance and then approximates this set with a Bezier cubic segment. The algorithm uses this procedure repeatedly to the rest of the data points until all points are fitted. It is concluded that the algorithm delivers fitting curves which approximate the data with high accuracy even in cases with large tolerances.

Chou, Jin J.↗

The Calipso Version 4.5 Stratospheric Aerosol Subtyping Algorithm

The accurate classification of aerosol types injected into the stratosphere is important to properly characterize their chemical and radiative impacts within the Earth climate system. The updated stratospheric aerosol subtyping algorithm used in the version 4.5 (V4.5) release of the Cloud Aerosol Lidar with Orthogonal Polarization (CALIOP) level 2 data products now delivers more comprehensive and accurate classifications than its predecessor. The original algorithm identified four aerosol subtypes for layers detected above the tropopause: volcanic ash, smoke, sulfate/other, and polar stratospheric aerosol (PSA). In the revised algorithm, sulfates are separately identified as a distinct, homogeneous subtype, and the diffuse, weakly scattering layers previously assigned to the sulfate/other class are recategorized as a fifth “unclassified” subtype. By making two structural changes to the algorithm and revising two thresholds, the V4.5 algorithm improves the ability to discriminate between volcanic ash and smoke from pyrocumulonimbus injections, improves the fidelity of the sulfate subtype, and more accurately reflects the uncertainties inherent in the classification process. The 532 nm lidar ratio for volcanic ash was also revised to a value more consistent with the current state of knowledge. This paper briefly reviews the previous version of the algorithm (V4.1 and V4.2) then fully details the rationale and impact of the V4.5 changes on subtype classification frequency for specific events where the dominant aerosol type is known based on the literature. Classification accuracy is best for volcanic ash due to its characteristically high depolarization ratio. Smoke layers in the stratosphere are also classified with reasonable accuracy, though during the daytime a substantial fraction are misclassified as ash. It is also possible for mixtures of ash and sulfate to be misclassified as smoke. The V4.5 sulfate subtype accuracy is less than that for ash or smoke, with sulfates being misclassified as smoke about one-third of the time. However, because exceptionally tenuous layers are now assigned to the unclassified subtype and the revised algorithm levies more stringent criteria for identifying an aerosol as sulfate, it is more likely that layers labeled as this subtype are in fact sulfate compared to those assigned the sulfate/other classification in the previous data release.

Jason L Tackett↗