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 1,423 records · Page 79

Retrievals of Cloud Droplet Size from the Research Scanning Polarimeter Data: Validation Using In Situ Measurements

We present comparisons of cloud droplet size distributions (DSDs) retrieved from the research scanning polarimeter (RSP) data with correlative in situ measurements made during the North Atlantic Aerosols and Marine Ecosystems Study (NAAMES). The airborne portion of this field experiment was based out of St. John's airport, Newfoundland, Canada with the focus of this paper being on the deployment in May - June 2016. RSP was onboard the NASA C-130 aircraft together with an array of in situ and other remote sensing instrumentation. The RSP is an along-track scanner measuring the polarized and total reflectance in 9 spectral channels. Its uniquely high angular resolution allows for characterization of liquid water droplet sizes using the rainbow structure observed in the polarized reflectance over the scattering angle range from 135 to 165.degrees The rainbow is dominated by single scattering of light by cloud droplets, so its structure is characteristic specifically of the droplet sizes at cloud top (within unit optical depth into the cloud, equivalent to approximately 50m). A parametric fitting algorithm applied to the polarized reflectance provides retrievals of the droplet effective radius and variance assuming a prescribed size distribution shape (gamma distribution). In addition to this, we use a non-parametric method, the Rainbow Fourier Transform (RFT), which allows us to retrieve the droplet size distribution itself. The latter is important in the case of clouds with complex microphysical structure, or multiple layers of cloud, which result in multi-modal DSDs. During NAAMES the aircraft performed a number of flight patterns specifically designed for comparisons between remote sensing retrievals and in situ measurements. These patterns consisted of two flight segments above the same straight ground track. One of these segments was flown above clouds allowing for remote sensing measurements, while the other was near the cloud top where cloud droplets were sampled. We compare the DSDs retrieved from the RSP data with in situ measurements made by the Cloud Droplet Probe (CDP). The comparisons generally show good agreement (better than 1 micron for effective radius and in most cases better than 0.02 for effective variance) with deviations explainable by the position of the aircraft within the cloud, or by the presence of additional cloud layers between the cloud being sampled by the in situ instrumentation and the altitude of the remote sensing segment. In the latter case, the multi-modal DSDs retrieved from the RSP data were consistent with the multi-layer cloud structures observed in the correlative High Spectral Resolution Lidar (HSRL) profiles. The results of these comparisons provide a rare validation of polarimetric droplet size retrieval techniques, demonstrating their accuracy and robustness and the potential of satellite data of this kind on a global scale.

Remote Sensing↗

A method for high order linear system reduction and nonlinear system simplification

Least-squares-type algorithms for reducing the order of linear systems in the frequency domain and simplifying nonlinear systems in time domain are developed and demonstrated. The possible model structures are represented as nodes in a tree, and costs along the branches are assigned using the repeated-Gram-Schmidt orthogonalization procedure of Desrochers and Saridis (1980), permitting identification of the optimal n-term model by searching the tree to depth n, with no need for parameter identification. The efficiency and flexibility of the algorithms is shown in applications to the eighth-order linear system studied by Hsia (1972), a three-state eight-nonlinear-term aircraft-dynamics problem, and the related linear-controller problem (Garrard and Jordan, 1977).

Desrochers, A. A.↗

The role of under-determined approximations in engineering and science application

There is currently a great deal of interest in using response surfaces in the optimization of aircraft performance. The objective function and/or constraint equations involved in these optimization problems may come from numerous disciplines such as structures, aerodynamics, environmental engineering, etc. In each of these disciplines, the mathematical complexity of the governing equations usually dictates that numerical results be obtained from large computer programs such as a finite element method program. Thus, when performing optimization studies, response surfaces are a convenient way of transferring information from the various disciplines to the optimization algorithm as opposed to bringing all the sundry computer programs together in a massive computer code. Response surfaces offer another advantage in the optimization of aircraft structures. A characteristic of these types of optimization problems is that evaluation of the objective function and response equations (referred to as a functional evaluation) can be very expensive in a computational sense. Because of the computational expense in obtaining functional evaluations, the present study was undertaken to investigate under-determinined approximations. An under-determined approximation is one in which there are fewer training pairs (pieces of information about a function) than there are undetermined parameters (coefficients or weights) associated with the approximation. Both polynomial approximations and neural net approximations were examined. Three main example problems were investigated: (1) a function of one design variable was considered; (2) a function of two design variables was considered; and (3) a 35 bar truss with 4 design variables was considered.

Carpenter, William C.↗

Accuracy of a class of concurrent algorithms for transient finite element analysis

The accuracy of a new class of concurrent procedures for transient finite element analysis is examined. A phase error analysis is carried out which shows that wave retardation leading to unacceptable loss of accuracy may occur if a Courant condition based on the dimensions of the subdomains is violated. Numerical tests suggest that this Courant condition is conservative for typical structural applications and may lead to a marked increase in accuracy as the number of subdomains is increased. Theoretical speed-up ratios are derived which suggest that the algorithms under consideration can be expected to exhibit a performance superior to that of globally implicit methods when implemented on parallel machines.

Ortiz, Michael↗

Controlling Tensegrity Robots Through Evolution

Tensegrity structures (built from interconnected rods and cables) have the potential to offer a revolutionary new robotic design that is light-weight, energy-efficient, robust to failures, capable of unique modes of locomotion, impact tolerant, and compliant (reducing damage between the robot and its environment). Unfortunately robots built from tensegrity structures are difficult to control with traditional methods due to their oscillatory nature, nonlinear coupling between components and overall complexity. Fortunately this formidable control challenge can be overcome through the use of evolutionary algorithms. In this paper we show that evolutionary algorithms can be used to efficiently control a ball-shaped tensegrity robot. Experimental results performed with a variety of evolutionary algorithms in a detailed soft-body physics simulator show that a centralized evolutionary algorithm performs 400 percent better than a hand-coded solution, while the multi-agent evolution performs 800 percent better. In addition, evolution is able to discover diverse control solutions (both crawling and rolling) that are robust against structural failures and can be adapted to a wide range of energy and actuation constraints. These successful controls will form the basis for building high-performance tensegrity robots in the near future.

Robot↗

An Efficient Scheme for Updating Sparse Cholesky Factors

Raghavan had earlier developed the software package DCSPACK which can be used for solving sparse linear systems where the coefficient matrix is symmetric and positive definite (this project was not funded by NASA but by agencies such as NSF). DSCPACK-S is the serial code and DSCPACK-P is a parallel implementation suitable for multiprocessors or networks-of-workstations with message passing using MCI. The main algorithm used is the Cholesky factorization of a sparse symmetric positive positive definite matrix A = LL(T). The code can also compute the factorization A = LDL(T). The complexity of the software arises from several factors relating to the sparsity of the matrix A. A sparse N x N matrix A has typically less that cN nonzeroes where c is a small constant. If the matrix were dense, it would have O(N2) nonzeroes. The most complicated part of such sparse Cholesky factorization relates to fill-in, i.e., zeroes in the original matrix that become nonzeroes in the factor L. An efficient implementation depends to a large extent on complex data structures and on techniques from graph theory to reduce, identify, and manage fill. DSCPACK is based on an efficient multifrontal implementation with fill-managing algorithms and implementation arising from earlier research by Raghavan and others. Sparse Cholesky factorization is typically a four step process: (1) ordering to compute a fill-reducing numbering, (2) symbolic factorization to determine the nonzero structure of L, (3) numeric factorization to compute L, and, (4) triangular solution to solve L(T)x = y and Ly = b. The first two steps are symbolic and are performed using the graph of the matrix. The numeric factorization step is of dominant cost and there are several schemes for improving performance by exploiting the nested and dense structure of groups of columns in the factor. The latter are aimed at better utilization of the cache-memory hierarchy on modem processors to prevent cache-misses and provide execution rates (operations/second) that are close to the peak rates for dense matrix computations. Currently, EPISCOPACY is being used in an application at NASA directed by J. Newman and M. James. We propose the implementation of efficient schemes for updating the LL(T) or LDL(T) factors computed in DSCPACK-S to meet the computational requirements of their project. A brief description is provided in the next section.

Raghavan, Padma↗

Real-time dynamics and control strategies for space operations of flexible structures

This project (NAG9-574) was meant to be a three-year research project. However, due to NASA's reorganizations during 1992, the project was funded only for one year. Accordingly, every effort was made to make the present final report as if the project was meant to be for one-year duration. Originally, during the first year we were planning to accomplish the following: we were to start with a three dimensional flexible manipulator beam with articulated joints and with a linear control-based controller applied at the joints; using this simple example, we were to design the software systems requirements for real-time processing, introduce the streamlining of various computational algorithms, perform the necessary reorganization of the partitioned simulation procedures, and assess the potential speed-up realization of the solution process by parallel computations. The three reports included as part of the final report address: the streamlining of various computational algorithms; the necessary reorganization of the partitioned simulation procedures, in particular the observer models; and an initial attempt of reconfiguring the flexible space structures.

Park, K. C.↗

Design of FIR digital filters for pulse shaping and channel equalization using time-domain optimization

Three algorithms are developed for designing finite impulse response digital filters to be used for pulse shaping and channel equalization. The first is the Minimax algorithm which uses linear programming to design a frequency-sampling filter with a pulse shape that approximates the specification in a minimax sense. Design examples are included which accurately approximate a specified impulse response with a maximum error of 0.03 using only six resonators. The second algorithm is an extension of the Minimax algorithm to design preset equalizers for channels with known impulse responses. Both transversal and frequency-sampling equalizer structures are designed to produce a minimax approximation of a specified channel output waveform. Examples of these designs are compared as to the accuracy of the approximation, the resultant intersymbol interference (ISI), and the required transmitted energy. While the transversal designs are slightly more accurate, the frequency-sampling designs using six resonators have smaller ISI and energy values.

Houts, R. C.↗

Transfer-function-parameter estimation from frequency response data: A FORTRAN program

A FORTRAN computer program designed to fit a linear transfer function model to given frequency response magnitude and phase data is presented. A conjugate gradient search is used that minimizes the integral of the absolute value of the error squared between the model and the data. The search is constrained to insure model stability. A scaling of the model parameters by their own magnitude aids search convergence. Efficient computer algorithms result in a small and fast program suitable for a minicomputer. A sample problem with different model structures and parameter estimates is reported.

Seidel, R. C.↗

Some statistical performance characteristics of the 'ITD' modal identification algorithm

Performance characteristics of the Ibrahim time-domain algorithms are examined on a statistical basis. The method uses multiple free-response measurements from a test structure directly in the time domain, and displays varying accuracy, with the strongly excited modes identified most accurately and the weakly excited modes least accurately. Sets of computer-generated free-response functions for a simple 1-mode model are used to study the identification performance for several basic changes in the modal characteristics of the data, the user-selectable analysis constants, and the level of superimposed noise. Results indicate the existence of a direct and often linear effect of noise on the scatter of identified parameters, and good identification is maintained at the 1% noise level down to the point in frequency when only 1/4-cycle of data is analyzed.

Pappa, R. S.↗

Least-squares sequential parameter and state estimation for large space structures

This paper presents the formulation of simultaneous state and parameter estimation problems for flexible structures in terms of least-squares minimization problems. The approach combines an on-line order determination algorithm, with least-squares algorithms for finding estimates of modal approximation functions, modal amplitudes, and modal parameters. The approach combines previous results on separable nonlinear least squares estimation with a regression analysis formulation of the state estimation problem. The technique makes use of sequential Householder transformations. This allows for sequential accumulation of matrices required during the identification process. The technique is used to identify the modal prameters of a flexible beam.

Thau, F. E.↗

Status and prospects of computational fluid dynamics for unsteady transonic viscous flows

Applications of computational aerodynamics to aeronautical research, design, and analysis have increased rapidly over the past decade, and these applications offer significant benefits to aeroelasticians. The past developments are traced by means of a number of specific examples, and the trends are projected over the next several years. The crucial factors that limit the present capabilities for unsteady analyses are identified; they include computer speed and memory, algorithm and solution methods, grid generation, turbulence modeling, vortex modeling, data processing, and coupling of the aerodynamic and structural dynamic analyses. The prospects for overcoming these limitations are presented, and many improvements appear to be readily attainable. If so, a complete and reliable numerical simulation of the unsteady, transonic viscous flow around a realistic fighter aircraft configuration could become possible within the next decade. The possibilities of using artificial intelligence concepts to hasten the achievement of this goal are also discussed.

Mccroskey, W. J.↗

Status and prospects of computational fluid dynamics for unsteady transonic flow

Applications of computational aerodynamics to aeronautical research, design, and analysis have increased rapidly over the past decade, and these applications offer significant benefits to aeroelasticians. The past developments are traced by means of a number of specific examples, and the trends are projected over the next several years. The crucial factors that limit the present capabilities for unsteady analyses are identified; they include computer speed and memory, algorithm and solution methods, grid generation, turbulence modeling, vortex modeling, data processing, and coupling of the aerodynamic and structural dynamic analyses. The prospects for overcoming these limitations are presented, and many improvements appear to be readily attainable. If so, a complete and reliable numerical simulation of the unsteady, transonic viscous flow around a realistic fighter aircraft configuration could become possible within the next decade. The possibilities of using artificial intelligence concepts to hasten the achievement of this goal are also discussed.

Mccroskey, W. J.↗

Characterization of coherent structures in a turbulent mixing layer by digital image analysis

Digital image analysis has been applied to a shadowgraph motion picture of a helium nitrogen mixing layer in order to characterize the coherent vortex structures in the flow. Both the primary spanwise coherent vortices and secondary streamwise vortices are considered. Pattern recognition algorithms were designed to take advantage of the more pronounced features of the vortices and of their temporal coherence to isolate them and to measure their characteristics. The resulting data base permits a deterministic description of the evolution of primary and seconary vortices.

Bernal, L. P.↗

System technology analysis of aeroassisted orbital transfer vehicles: Moderate lift/drag (0.75-1.5). Volume 3: Cost estimates and work breakdown structure/dictionary, phase 1 and 2

Technology payoffs of representative ground based (Phase 1) and space based (Phase 2) mid lift/drag ratio aeroassisted orbit transfer vehicles (AOTV) were assessed and prioritized. A narrative summary of the cost estimates and work breakdown structure/dictionary for both study phases is presented. Costs were estimated using the Grumman Space Programs Algorithm for Cost Estimating (SPACE) computer program and results are given for four AOTV configurations. The work breakdown structure follows the standard of the joint government/industry Space Systems Cost Analysis Group (SSCAG). A table is provided which shows cost estimates for each work breakdown structure element.

Source record↗

Diagnosis and sensor validation through knowledge of structure and function

The liquid oxygen expert system 'LES' is proposed as the first capable of diagnostic reasoning from sensor data, using model-based knowledge of structure and function to find the expected state of all system objects, including sensors. The approach is generally algorithmic rather than heuristic, and represents uncertainties as sets of possibilities. Functional relationships are inverted to determine hypothetical values for potentially faulty objects, and may include conditional functions not normally considered to have inverses.

Scarl, Ethan A.↗

Methods and strategies of object localization

An important property of an intelligent robot is to be able to determine the location of an object in 3-D space. A general object localization system structure is proposed, some important issues on localization discussed, and an overview given for current available object localization algorithms and systems. The algorithms reviewed are characterized by their feature extracting and matching strategies; the range finding methods; the types of locatable objects; and the mathematical formulating methods.

Shao, Lejun↗

Structure/control synthesis with nonnegligible actuator mass

The simultaneous design of a structure/active control system is addressed in which the mass of the actuators required to implement the active control is considered. An algorithm for estimating the required actuator mass given the control law and the desired maneuver is presented. A nonlinear optimization algorithm is used to direct the design process. Results are given for the design of a L shaped structure where it is desired to minimize the line of sight pointing error after a worst case slew maneuver.

Zimmerman, David C.↗