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,153 records · Page 64

An improved analysis/synthesis capability based on dual methods - ACCESS 3

Approximation concepts and dual method algorithms are combined to create a new 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. 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 thin delta wing with fiber composite skins.

Schmit, L. A.↗

Automated design using numerical optimization

Numerical optimization concepts are described with limited technical detail. The purpose is to provide the nonspecialist with sufficient information to judge the applicability of these methods to his particular design problem. The concepts are first described in physical terms to give a basic understanding of the iterative procedure employed by these methods. Next, the typical engineering task is presented and converted to a form ammenable to solution by numerical optimization. Basic algorithms for solving this problem are identified. Numerous applications are referenced, emphasizing the structural design discipline. The state of the art allows for the routine solution of nonlinear design problems of approximately 20 independent variables subject to 100 or more constraints. In many applications, much larger design problems may be solved. Selected references are provided which describe the methods and applications in more detail.

Vanderplaats, G. N.↗

Parameter estimation in truss beams using Timoshenko beam model with damping

Truss beams with members having viscous damping are modeled with a Timoshenko beam. Procedures for deriving the equivalent bending rigidity, transverse shear rigidity, and damping are presented. Explicit expressions for these equivalent beam properties are obtained for a specific truss beam. The beam model thus established is then used to investigate the effect of damping in free vibration. Finally, the beam is employed in the estimation of structural parameters in a simply-supported truss beam using a random search algorithm.

Sun, C. T.↗

Close-mode identification performance of the ITD algorithm

Results of Monte Carlo numerical simulations conducted to study the close-mode performance of the Ibrahim Time-Domain (ITD) modal identification algorithm are presented. The ITD technique is a matrix eigensolution method for obtaining structural modal parameters directly from free-response test data without using the FFT. Thus, the well-known resolution and leakage limitations of the FFT procedure, that are particularly significant with short records, are avoided. As an example, one of several experimental data analyses where close modes have been accurately identified using very short records is shown. Although the identification scatter is found to increase as the square of reductions in frequency separation at small separations, the ability to differentiate modes spaced at fractions of the FFT resolution is substantiated.

Pappa, R. S.↗

Combined use of remote sensing and seismic observations to infer geologically recent crustal deformation, active faulting, and stress fields

Characteristic traits for earthquakes associated with strike-slip motion in Central California and the Salton Sea area, as revealed in ground based studies and LANDSAT imagery, were compared. The mapped lineaments are found to be oriented in several dominant directions. One direction is the same as the trend of the San Andreas fault. The other directions differ from area to area and may reflect the stresses of earlier geologic processes. The pattern of lineament orientations is significantly LANDSAT MSS data, SEASAT synthetic aperture radar data, and magnetic field data from the South Mountain area west of Gettysburg, Pennsylvania were registered to match each other in spatial position and merged. Pattern recognition techniques were applied to the composite data set to determine its utility in recognizing different rock types and structures in vegetated terrain around South Mountain. With the use of a texture algorithm to enhance geologic features, a classification of the entire area was made. A test of the correlation between SAR tone and texture, LANDSAT tone and texture, and magnetic field data revealed no tone or texture measures linking any two of the original data sets.

Alexander, S. S.↗

Microwave radiances from precipitating clouds containing aspherical ice, combined phase, and liquid hydrometeors

A numerical algorithm based on Eddington's second approximation to the equation of radiative transfer has been developed in order to compute the radiances with horizontal and vertical polarization that emerge from precipitating clouds. This algorithm yields a rapid solution to problems pertaining to clouds with vertically inhomogeneous structure. Precipitating clouds containing liquid, mixtures of phases, and ice hydrometeors are modelled. It is shown that the lower-frequency radiances are sensitive to liquid precipitation at low altitudes while the higher-frequency radiances are more sensitive to the ice hydrometeors at the cloud tops. The extinction coefficients of aspherical hydrometeors are presented as a function of rainfall rates. The fact that vertically polarized radiances are warmer than horizontally polarized ones at high rainfall rates, with the difference diminishing at lower frequencies, is due to aspherical ice hydrometeors in the upper regions of precipitating clouds.

Wu, R.↗

Shape Determination for Large Static Structures

Parameter and shape estimates updated from new measurements. Involves statistical structural analysis, statistical electromagneticfield analysis, filtering, measurement modeling, and iterative prediction/correction procedures. Estimating algorithms result from generalizations of Kalman statistical-filter theory.

Rodriguez, G.↗

Factorization and reduction methods for optimal control of distributed parameter systems

A Chandrasekhar-type factorization method is applied to the linear-quadratic optimal control problem for distributed parameter systems. An aeroelastic control problem is used as a model example to demonstrate that if computationally efficient algorithms, such as those of Chandrasekhar-type, are combined with the special structure often available to a particular problem, then an abstract approximation theory developed for distributed parameter control theory becomes a viable method of solution. A numerical scheme based on averaging approximations is applied to hereditary control problems. Numerical examples are given.

Burns, J. A.↗

User's guide to the Fault Inferring Nonlinear Detection System (FINDS) computer program

Described are the operation and internal structure of the computer program FINDS (Fault Inferring Nonlinear Detection System). The FINDS algorithm is designed to provide reliable estimates for aircraft position, velocity, attitude, and horizontal winds to be used for guidance and control laws in the presence of possible failures in the avionics sensors. The FINDS algorithm was developed with the use of a digital simulation of a commercial transport aircraft and tested with flight recorded data. The algorithm was then modified to meet the size constraints and real-time execution requirements on a flight computer. For the real-time operation, a multi-rate implementation of the FINDS algorithm has been partitioned to execute on a dual parallel processor configuration: one based on the translational dynamics and the other on the rotational kinematics. The report presents an overview of the FINDS algorithm, the implemented equations, the flow charts for the key subprograms, the input and output files, program variable indexing convention, subprogram descriptions, and the common block descriptions used in the program.

Caglayan, A. K.↗

A concatenated coded modulation scheme for error control (addition 2)

A concatenated coded modulation scheme for error control in data communications is described. The scheme is achieved by concatenating a Reed-Solomon outer code and a bandwidth efficient block inner code for M-ary PSK modulation. Error performance of the scheme is analyzed for an AWGN channel. It is shown that extremely high reliability can be attained by using a simple M-ary PSK modulation inner code and a relatively powerful Reed-Solomon outer code. Furthermore, if an inner code of high effective rate is used, the bandwidth expansion required by the scheme due to coding will be greatly reduced. The proposed scheme is particularly effective for high-speed satellite communications for large file transfer where high reliability is required. This paper also presents a simple method for constructing block codes for M-ary PSK modulation. Some short M-ary PSK codes with good minimum squared Euclidean distance are constructed. These codes have trellis structure and hence can be decoded with a soft-decision Viterbi decoding algorithm. Furthermore, some of these codes are phase invariant under multiples of 45 deg rotation.

Lin, Shu↗

The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem

The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code.

Jones, Mark T.↗

A survey on the structured singular value

The structured singular value, U, is an important linear algebra tool to study a class of matrix perturbation problems. It is useful for analyzing the robustness of stability and performance of uncertain, (nominally) linear systems. Computation of (M) is difficult, and usually, upper and lower bounds are all that can be reliably computed. Upper bounds give conservative estimates of the sizes of allowable perturbations. The maximum singular value of a matrix M is an upper bound for (M). As an upper bound, it can be improved by finding a transformations to the data (i.e. M) which do not change the structured singular value, but do reduce the maximum singular value. Typically, upper bound algorithms involve searches over sets of transformations to yield the tightest bound. Lower bound algorithms are intelligent searches for minimum-norm solutions to multivariable polynomial equations, and are based on various optimality conditions that hold at the global (and, unfortunately, some local) minima. The current methods to compute both of these types of bounds are reviewed. Theoretical justification and extensive numerical experience with the various algorithms are covered.

Packard, Andy↗

Planned ER-2 Doppler radar (EDOP) for studying convective storms and mesoscale phenomena

A radar development is presently funded by the NASA Mesoscale Atmospheric Research Program to build an X-band Doppler radar (EDOP) for the ER-2 aircraft for measuring the structure of updrafts and downdrafts in deep convective systems. In this paper, the radar's scientific objectives and characteristics are briefly reviewed. These objectives include documentation of deep isolated thunderstorms, examination of cloud top and anvil structure, structure of microscale convective systems, cloud microphysics, and testing of satellite precipitation estimation algorithms. System specifications for the radar are given.

Heymsfield, Gerald M.↗

A computational study of the impingement region of an unsteady subsonic jet

Vertical/Short Take-Off and Landing (V/STOL) aircraft may encounter operating difficulties while hovering near the ground. Lift loss, hot gas and debris ingestion, and landing surface damage are some of the potential problems which can result from the interaction of the propulsive jets with the airframe and ground. The purpose of the present work is to develop a detailed understanding of a flowfield, a jet exiting from a flat plate impacting a ground plane, that contains much of the essential physics of the complex flows encountered by V/STOL aircraft in hover. To achieve this, a high-resolution time-accurate numerical simulation of the impinging jet flow was performed. The numerical simulation is based on the solution of the laminar compressible Navier-Stokes equations using the Beam-Warming algorithm. Complex start-up and periodic jet and jet-induced vortex structures were captured, including the formation of primary and secondary jet-induced vortices and wall-jet separation. The formation and development of these phenomena are supported by experimental measurements and smoke visualization. Results are compared with appropriate experiments.

Jalamani, Zakaria A.↗

A concatenated coded modulation scheme for error control

A concatenated coded modulation scheme for error control in data communications is presented. The scheme is achieved by concatenating a Reed-Solomon outer code and a bandwidth efficient block inner code for M-ary PSK modulation. Error performance of the scheme is analyzed for an AWGN channel. It is shown that extremely high reliability can be attained by using a simple M-ary PSK modulation inner code and relatively powerful Reed-Solomon outer code. Furthermore, if an inner code of high effective rate is used, the bandwidth expansion required by the scheme due to coding will be greatly reduced. The proposed scheme is particularly effective for high speed satellite communications for large file transfer where high reliability is required. Also presented is a simple method for constructing block codes for M-ary PSK modulation. Some short M-ary PSK codes with good minimum squared Euclidean distance are constructed. These codes have trellis structure and hence can be decoded with a soft-decision Viterbi decoding algorithm.

Kasami, Tadao↗

Understanding transition and turbulence through direct simulations

Direct simulations consist in solving the full Navier-Stokes equations, without any turbulence model, and describing all the detailed features of the flow. Usually the flows are three-dimensional and time-dependent and contain both coarse and fine structures, which makes the numerical task very challenging in terms of both the algorithm and the computational effort. Most of the work until now has involved spectral methods, which are highly accurate but not very flexible in terms of geometry or complex equations. For that reason, future work will also rely on high-order finite-difference or other methods. Direct simulations complement experimental work, and both contribute to the theory and the empirical knowledge of turbulence. Once such a simulation has been shown to be accurate, the flow field is completely known in three dimensions and time, including the pressure, the vorticity and any other quantity. On the other hand, most simulations to date solved the incompressible equations in rather simple geometries, and direct simulations will always be limited to moderate Reynolds numbers. Extensive simulations have been conducted in homogeneous turbulence, channel flows, boundary layers, and mixing layers. Much effort is devoted to addressing flows with compressibility and chemical reactions, and to new geometries such as a backward-facing step.

Spalart, P. R.↗

A 3-D upwind Euler solver for unstructured meshes

A three-dimensional finite-volume upwind Euler solver is developed for unstructured meshes. The finite-volume scheme solves for solution variables at vertices of the mesh and satisfies the integral conservation law on nonoverlapping polyhedral control volumes surrounding vertices of the mesh. The schene achieves improved solution accuracy by assuming a piecewise linear variation of the solution in each control volume. This improved spatial accuracy hinges heavily upon the calculation of the solution gradient in each control volume given pointwise values of the solution at vertices of the mesh. Several algorithms are discussed for obtaining these gradients. Details concerning implementation procedures and data structures are discussed. Sample calculations for inviscid Euler flow about isolated aircraft wings at subsonic and transonic speeds are compared with established Euler solvers as well as experiment.

Barth, Timothy J.↗

A Large-Grain Mapping Approach for Multiprocessor Systems Through Data Flow Model Ph.D. Thesis

A large-grain level mapping method is presented of numerical oriented applications onto multiprocessor systems. The method is based on the large-grain data flow representation of the input application and it assumes a general interconnection topology of the multiprocessor system. The large-grain data flow model was used because such representation best exhibits inherited parallelism in many important applications, e.g., CFD models based on partial differential equations can be presented in large-grain data flow format, very effectively. A generalized interconnection topology of the multiprocessor architecture is considered, including such architectural issues as interprocessor communication cost, with the aim to identify the 'best matching' between the application and the multiprocessor structure. The objective is to minimize the total execution time of the input algorithm running on the target system. The mapping strategy consists of the following: (1) large-grain data flow graph generation from the input application using compilation techniques; (2) data flow graph partitioning into basic computation blocks; and (3) physical mapping onto the target multiprocessor using a priority allocation scheme for the computation blocks.

Kim, Hwa-Soo↗