Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iteration method”

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,531 records · Page 85
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Computational methods for hypersonic viscous flow over finite ellipsoid-cones at incidence

A numerical method, which is simpler than others currently in use, is proposed for determining the full viscous flow over a finite body in hypersonic stream at high altitude. It treats the shock layer surrounding the blunt foebody and the near wake behind the base simultaneously by formulating the Navier-Stokes equations in conformal and azimuthal-angle coordinates. The computational domain is confined to the body wall, outflow surface and the bow shock, which is adjusted along the coordinate normal to the wall in the course of iterations. Because of the optimal grid and a well developed alternating direction implicit factorization technique for the governing equations, reasonably accurate results can be obtained on a 30 by 36 by 6 grid with 400 time-marching iterations. Results for body shapes belonging to the ellipsoid-cone family are compared with the experimental data for the Apollo command module and the Viking aeroshell. Validation of the method based on self-consistency is also discussed.

Li, C. P.↗
NASA NTRS1998

In-Flight System Identification

A method is proposed and studied whereby the system identification cycle consisting of experiment design and data analysis can be repeatedly implemented aboard a test aircraft in real time. This adaptive in-flight system identification scheme has many advantages, including increased flight test efficiency, adaptability to dynamic characteristics that are imperfectly known a priori, in-flight improvement of data quality through iterative input design, and immediate feedback of the quality of flight test results. The technique uses equation error in the frequency domain with a recursive Fourier transform for the real time data analysis, and simple design methods employing square wave input forms to design the test inputs in flight. Simulation examples are used to demonstrate that the technique produces increasingly accurate model parameter estimates resulting from sequentially designed and implemented flight test maneuvers. The method has reasonable computational requirements, and could be implemented aboard an aircraft in real time.

Morelli, Eugene A.↗
NASA NTRS1975

Creep analysis capability for stiffened panel structures

A method of analysis developed for predicting permanent cyclic creep deflections in stiffened panel structures is presented. The resulting computer program (TPSC, for Thermal Protection System Creep) applies either the time hardening or strain hardening theories of creep accumulation, using iterative techniques to determine structural rotations, creep strains, and stresses as a function of time. Deflections are determined by numerical integration of structural rotations along the panel length. The analytical approach was developed for purposes of analyzing thin gage entry vehicle metallic thermal protection system panels subjected to cyclic bending loads at high temperatures. The method is applicable to any panel subjected to bending loads. Predicted panel creep deflections are compared with results from cyclic tests of subsize and full size corrugation and rib stiffened panels. Empirical equations used in the analysis were developed for each material based on correlation with tensile cyclic creep data.

Cramer, B. A.↗
NASA NTRS1973

A numerical method for determining the temperature structure of planetary atmospheres.

A numerical method for calculating the time-average, vertical temperature structure of planetary atmospheres is presented. It is assumed that the atmospheres are in radiative-convective equilibrium, which is a good first approximation to many situations. Numerical tests of the rate of convergence and accuracy of the answer are presented. The method can readily handle molecular sources of opacity. Accurate results can be obtained with a minimum of computer time, because the number of iterations needed (about 4) is small and the number of pressure levels at which the net flux needs to be evaluated (about 10) is small. As an application of this procedure, some model atmospheres of Jupiter are calculated.

Pollack, J. B.↗
NASA NTRS1974

Effect of the cluster integrals on three particles on the calculated electron density of a hydrogen plasma

The effect of the calculation of the cluster integrals on three particles is analyzed and evaluated for a hydrogen plasma where a pairwise-additive hard sphere-Coulomb potential is assumed. The Mayer cluster integral method was used to calculate the Helmholtz free energy which was then applied to the calculation of the electron number density through an iterative technique using a corrected Saha equation. It is seen that the three particle integrals provide a substantial correction to the calculations in the low energy-high density region of the hydrogen plasma.

Mcintyre, R. G.↗
NASA NTRS1978

A decoding procedure for the Reed-Solomon codes

A decoding procedure is described for the (n,k) t-error-correcting Reed-Solomon (RS) code, and an implementation of the (31,15) RS code for the I4-TENEX central system. This code can be used for error correction in large archival memory systems. The principal features of the decoder are a Galois field arithmetic unit implemented by microprogramming a microprocessor, and syndrome calculation by using the g(x) encoding shift register. Complete decoding of the (31,15) code is expected to take less than 500 microsecs. The syndrome calculation is performed by hardware using the encoding shift register and a modified Chien search. The error location polynomial is computed by using Lin's table, which is an interpretation of Berlekamp's iterative algorithm. The error location numbers are calculated by using the Chien search. Finally, the error values are computed by using Forney's method.

Lim, R. S.↗
NASA NTRS1988

A computational strategy for making complicated structural problems simple

An effective computational strategy is presented for the analysis of large and complex structures. The strategy is based on generating the response of the complex structure using large perturbations from that of a lower-order (simpler) model associated with a simpler structure (or a simpler mathematical/discrete model of the original structure). The three key elements of the strategy are: (a) mixed (or primitive variable) formulation with the fundamental unknowns consisting of generalized displacements and stress parameters; (2) operator splitting, or a reduction method to relate the arrays and degrees of freedom of the original complex structure ot those of the simpler system; and (3) efficient iterative process for the generation of the response of the complex structure starting from that of the simpler system. The effectiveness of the proposed strategy is demonstrated by means of two numerical examples.

Noor, Ahmed K.↗
NASA NTRS1989

Radiative transfer theory for active remote sensing of a forested canopy

A canopy is modeled as a two-layer medium above a rough interface. The upper layer stands for the forest crown, with the leaves modeled as randomly oriented and distributed disks and needles and the branches modeled as randomly oriented finite dielectric cylinders. The lower layer contains the tree trunks, modeled as randomly positioned vertical cylinders above the rough soil. Radiative-transfer theory is applied to calculate EM scattering from such a canopy, is expressed in terms of the scattering-amplitude tensors (SATs). For leaves, the generalized Rayleigh-Gans approximation is applied, whereas the branch and trunk SATs are obtained by estimating the inner field by fields inside a similar cylinder of infinite length. The Kirchhoff method is used to calculate the soil SAT. For a plane wave exciting the canopy, the radiative-transfer equations are solved by iteration to the first order in albedo of the leaves and the branches. Numerical results are illustrated as a function of the incidence angle.

Karam, M. A.↗
NASA NTRS1992

Joint Japan/U.S. Conference on Adaptive Structures, 2nd, Nagoya, Japan, Nov. 12-14, 1991, Collection of Papers

The present conference discusses the development status of adaptive structures in Europe and in Japan, the 'Cosmo-Lab' structures/robotics cooperation concept, active-adhesion concepts for in-orbit structural assembly, adaptively controlled truss structures, object-oriented modeling in structural analysis, the control effectiveness and energy efficiency of an active mass damper, a space truss with experimental tendon control, and piezoelectric actuator-based space trusses. Also discussed is the control of resonant frequencies in adaptive structures through prestressing, active control of vortex-excited vibrations of flexible cylindrical structures, shape adjustment of a flexible space antenna reflector, the SDIO Adaptive Structures Program, optimal trajectories of iterative manipulation for space robots, a docking device as an adaptive structure, shape-memory polymers and their hybrid composites, and fuzzy control methods for structural dynamics.

Matsuzaki, Yuji↗
NASA NTRS1994

Optimization of Residual Stresses in MMC's Using Compensating/Compliant Interfacial Layers. Part 2: OPTCOMP User's Guide

A user's guide for the computer program OPTCOMP is presented in this report. This program provides a capability to optimize the fabrication or service-induced residual stresses in uni-directional metal matrix composites subjected to combined thermo-mechanical axisymmetric loading using compensating or compliant layers at the fiber/matrix interface. The user specifies the architecture and the initial material parameters of the interfacial region, which can be either elastic or elastoplastic, and defines the design variables, together with the objective function, the associated constraints and the loading history through a user-friendly data input interface. The optimization procedure is based on an efficient solution methodology for the elastoplastic response of an arbitrarily layered multiple concentric cylinder model that is coupled to the commercial optimization package DOT. The solution methodology for the arbitrarily layered cylinder is based on the local-global stiffness matrix formulation and Mendelson's iterative technique of successive elastic solutions developed for elastoplastic boundary-value problems. The optimization algorithm employed in DOT is based on the method of feasible directions.

Pindera, Marek-Jerzy↗
NASA NTRS1999

Tail Biting Trellis Representation of Codes: Decoding and Construction

This paper presents two new iterative algorithms for decoding linear codes based on their tail biting trellises, one is unidirectional and the other is bidirectional. Both algorithms are computationally efficient and achieves virtually optimum error performance with a small number of decoding iterations. They outperform all the previous suboptimal decoding algorithms. The bidirectional algorithm also reduces decoding delay. Also presented in the paper is a method for constructing tail biting trellises for linear block codes.

Shao. Rose Y.↗
NASA NTRS2003

A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites

Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.

Globus, Al↗
NASA NTRS2003

Mobile Agents: A Distributed Voice-Commanded Sensory and Robotic System for Surface EVA Assistance

A model-based, distributed architecture integrates diverse components in a system designed for lunar and planetary surface operations: spacesuit biosensors, cameras, GPS, and a robotic assistant. The system transmits data and assists communication between the extra-vehicular activity (EVA) astronauts, the crew in a local habitat, and a remote mission support team. Software processes ("agents"), implemented in a system called Brahms, run on multiple, mobile platforms, including the spacesuit backpacks, all-terrain vehicles, and robot. These "mobile agents" interpret and transform available data to help people and robotic systems coordinate their actions to make operations more safe and efficient. Different types of agents relate platforms to each other ("proxy agents"), devices to software ("comm agents"), and people to the system ("personal agents"). A state-of-the-art spoken dialogue interface enables people to communicate with their personal agents, supporting a speech-driven navigation and scheduling tool, field observation record, and rover command system. An important aspect of the engineering methodology involves first simulating the entire hardware and software system in Brahms, and then configuring the agents into a runtime system. Design of mobile agent functionality has been based on ethnographic observation of scientists working in Mars analog settings in the High Canadian Arctic on Devon Island and the southeast Utah desert. The Mobile Agents system is developed iteratively in the context of use, with people doing authentic work. This paper provides a brief introduction to the architecture and emphasizes the method of empirical requirements analysis, through which observation, modeling, design, and testing are integrated in simulated EVA operations.

Clancey, William J.↗
NASA NTRS2008

Shaping Diffraction-Grating Grooves to Optimize Efficiency

A method of shaping diffraction-grating grooves to optimize the spectral efficiency, spectral range, and image quality of a spectral imaging instrument is under development. The method is based on the use of an advanced design algorithm to determine the possibly complex shape of grooves needed to obtain a desired efficiency-versus-wavelength response (see figure). Then electron- beam fabrication techniques are used to realize the required groove shape. The method could be used, for example, to make the spectral efficiency of the grating in a given wavelength range proportional to the inverse of the spectral efficiency of a photodetector array so that the overall spectral efficiency of the combination of the grating and the photodetector array would be flat. The method has thus far been applied to one-dimensional gratings only, but in principle, it is also applicable to two-dimensional gratings. The algorithm involves calculations in the spatial-frequency domain. The spatial-frequency spectrum of a grating is represented as a diffraction-order spectral-peak-width function multiplied by an efficiency function for a single grating groove. This representation affords computational efficiency and accuracy by making it possible to consider only the response from one grating groove (one period of the grating), instead of from the whole grating area, in determining the response from the entire grating. This combination of efficiency and accuracy is crucial for future extensions of the algorithm to two-dimensional designs and to designs in which polarization must also be taken into account. The algorithm begins with the definition of target values of relative efficiency that represent the desired spectral response of the grating in certain spectral frequencies calculated from the diffraction order and wavelength. The grating period is divided into a number of cells - typically, 100. The phase contribution from each cell is determined from the phase of the incident electromagnetic wave and the height of the grating surface in the cell. The total contribution from all cells to each target value is then calculated. Then a method known to specialists as the optimum-rotation-angle method is used to adjust the height of each cell so that the total response from all cells is optimized. The computation is iterative and continues until the desired response is obtained. In the event that the desired response is unphysical, the algorithm nevertheless strives to generate a grating-grove profile for which the response approximates the desired one as closely as possible.

Backlund, John↗
NASA NTRS2013

Efficient Creation of Overset Grid Hole Boundaries and Effects of Their Locations on Aerodynamic Loads

Recent developments on the automation of the X-rays approach to hole-cutting in over- set grids is further improved. A fast method to compute an auxiliary wall-distance function used in providing a rst estimate of the hole boundary location is introduced. Subsequent iterations lead to automatically-created hole boundaries with a spatially-variable o set from the minimum hole. For each hole boundary location, an averaged cell attribute measure over all fringe points is used to quantify the compatibility between the fringe points and their respective donor cells. The sensitivity of aerodynamic loads to di erent hole boundary locations and cell attribute compatibilities is investigated using four test cases: an isolated re-entry capsule, a two-rocket con guration, the AIAA 4th Drag Prediction Workshop Common Research Model (CRM), and the D8 \Double Bubble" subsonic aircraft. When best practices in hole boundary treatment are followed, only small variations in integrated loads and convergence rates are observed for different hole boundary locations.

Overset↗
NASA NTRS2014

Sharepoint Team Site Configuration

The Data Mining project seeks to bring the capability of data visualization to NASA anomaly and problem reporting systems for the purpose of improving data trending, evaluations, and analyses. Currently NASA systems are tailored to meet the specific needs of its organizations. This tailoring has led to a variety of nomenclatures and levels of annotation for procedures, parts and anomalies making difficult the realization of the common causes for anomalies. Making significant observations and realizing the connection between these causes without a common way to view data is difficult to impossible. The Data Mining project is in its early stages of presenting a common visualization of normalized data through a web based portal. In this paper I detail what I have learned and what I have accomplished during my time as an intern toward the purpose of creating the project portal. I have gone through an iterative process of familiarization with the project and its goals, site design, research, modification and review on the road to creating a common method and location to view the visualized data created under this project.

iss↗
NASA NTRS1990

Efficient Implementation of Minimal Polynomial and Reduced Rank Extrapolation Methods

The minimal polynomial extrapolation (MPE) and reduced rank extrapolation (RRE) are two effective techniques that have been used in accelerating the convergence of vector sequences, such as those that are obtained from iterative solution of linear and nonlinear systems of equation. Their definitions involve some linear least squares problems, and this causes difficulties in their numerical implementation. Timewise efficient and numerically stable implementations for MPE and RRE are developed. A computer program written in FORTRAN 77 is also appended and applied to some model problems.

Sidi, Avram↗
NASA NTRS2000

Interference Lattice-based Loop Nest Tilings for Stencil Computations

A common method for improving performance of stencil operations on structured multi-dimensional discretization grids is loop tiling. Tile shapes and sizes are usually determined heuristically, based on the size of the primary data cache. We provide a lower bound on the numbers of cache misses that must be incurred by any tiling, and a close achievable bound using a particular tiling based on the grid interference lattice. The latter tiling is used to derive highly efficient loop orderings. The total number of cache misses of a code is the sum of (necessary) cold misses and misses caused by elements being dropped from the cache between successive loads (replacement misses). Maximizing temporal locality is equivalent to minimizing replacement misses. Temporal locality of loop nests implementing stencil operations is optimized by tilings that avoid data conflicts. We divide the loop nest iteration space into conflict-free tiles, derived from the cache miss equation. The tiling involves the definition of the grid interference lattice an equivalence class of grid points whose images in main memory map to the same location in the cache-and the construction of a special basis for the lattice. Conflicts only occur on the boundaries of the tiles, unless the tiles are too thin. We show that the surface area of the tiles is bounded for grids of any dimensionality, and for caches of any associativity, provided the eccentricity of the fundamental parallelepiped (the tile spanned by the basis) of the lattice is bounded. Eccentricity is determined by two factors, aspect ratio and skewness. The aspect ratio of the parallelepiped can be bounded by appropriate array padding. The skewness can be bounded by the choice of a proper basis. Combining these two strategies ensures that pathologically thin tiles are avoided. They do not, however, minimize replacement misses per se. The reason is that tile visitation order influences the number of data conflicts on the tile boundaries. If two adjacent tiles are visited successively, there will be no replacement misses on the shared boundary. The iteration space may be covered with pencils larger than the size of the cache while avoiding data conflicts if the pencils are traversed by a scanning-face method. Replacement misses are incurred only on the boundaries of the pencils, and the number of misses is minimized by maximizing the volume of the scanning face, not the volume of the tile. We present an algorithm for constructing the most efficient scanning face for a given grid and stencil operator. In two dimensions it is based on a continued fraction algorithm. In three dimensions it follows Voronoi's successive minima algorithm. We show experimental results of using the scanning face, and compare with canonical loop orderings.

VanderWijngaart, Rob F.↗