Search NASA⌕ Search

SEARCH · Search NASA

Results for “Recursion”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Hybrid state-space self-tuning control of uncertain linear systems

The paper presents a hybrid state-space self-tuner using a new dual-rate sampling scheme for digital adaptive control of continuous-time uncertain linear systems. A state-space-based recursive least-squares algorithm, together with a variable forgetting factor, is used for direct estimations of both the equivalent discrete-time uncertain linear system parameters and the associated discrete-time state of a continuous-time uncertain linear system from the sampled input and output data. An analogue optimal regional pole-placement design method is used for designing an optimal observer-based analogue controller. A suboptimal observer-based digital controller is then designed from the designed analogue controller using digital redesign technique. To enhance the robustness of parameter identification and state estimation algorithms, a dynamic bound for a class of uncertain bilinear parameters and a fast-rate digital controller are developed at each fast-sampling period. Also, to accommodate computation loads and computation delay for developing the advanced hybrid self-tuner, the designed analogue controller and observer gains are both updated at each slow-sampling period. This control technique has been successfully applied to benchmark control problems.

Shieh, L. S.↗
NASA NTRS1991

A potential method for the estimation of drop size distribution from a dual-wavelength airborne radar

In order to investigate the role of the drop size distribution (DSD) from a dual-wavelength airborne radar and to recover profiled rain rates, a procedure is described for the purpose of estimating the DSD. The method differs from previous approaches in that it provides 2n + 1 parameters of the profiled DSD (where n is the number of range gates) and it uses a recursive procedure beginning at the range gate near the surface progressing backwards toward the storm top. The method is argued to be useful both as a diagnostic tool and as a means by which more detailed information on the vertical structure of the precipitation can be obtained.

Meneghini, R.↗
NASA NTRS1993

Linearization of manipulator dynamics using spatial operators

Linearized dynamics models for manipulators are useful in robot analysis, motion planning, and control applications. Techniques from the spatial operator algebra are used to obtain closed form operator expressions for two types of linearized dynamics models, the linearized inverse and forward dynamics models. Spatially recursive algorithms of O(n) and O(n-squared) complexity for the computation of the perturbation vector and coefficient matrices for the linearized inverse dynamics model are developed first. Subsequently, operator factorization and inversion identities are used to develop corresponding closed-form expressions for the linearized forward dynamics model (LFDM). Once again, these are used to develop algorithms of O(n) and O(n-squared) complexity for the computation of the perturbation vector and the coefficient matrices. The algorithms for the LFDM do not require the explicit computation of the mass matrix nor its numerical inversion and are also of lower complexity than the conventional O(n-cubed) algorithms.

Jain, A.↗
NASA NTRS1989

The application of the reduced order model Kalman filter to motion estimation of degraded image sequences

Motion estimation is a field of great interest because of its many applications in areas such as robotics and image coding. The optic flow method is one such scheme which, although fairly accurate, is prone to error in the presence of noise. This thesis describes the use of the reduced order model Kalman filter (ROMKF) in reducing errors in displacement estimation due to degradation of the sequence. The implementation of filtering and motion estimation algorithms on the SUN workstation is also discussed. Results from preliminary testing were used to determine the degrees of freedom available for the ROMKF in the SUN software. The tests indicated that increasing the state to the left leads to slight improvement over the minimum state case. Therefore, the software uses the minimum model, with the option of adding states to the left only. The ROMKF was then used in conjunction with a hierarchical pel recursive motion estimation algorithm. Applying the ROMKF to the degraded displacements themselves generally yielded slight improvements in cases with noise degradation and noise plus blur. Filtering the images of the degraded sequence prior to motion estimation was less effective in these cases. Both methods performed badly in the case of blur alone, resulting in increased displacement errors. This is thought to be due in part to filter artifacts. Some improvements were obtained by varying the filter parameters when filtering the displacements directly. This result suggests that further study in varying filter parameters may lead to better results. The results of this thesis indicate that the ROMKF can play a part in reducing motion estimation errors from degraded sequences. However, more work needs to be done before the use of the ROMKF can be a practical solution.

Simpson, Elizabeth C.↗
NASA NTRS1988

Optimal experiment design for on-orbit identification

An optimal on-orbit experiment is designed to extract the most information from an on-orbit test, subject to the constraints of the testing environment. However, simply jumping in and optimizing standard measures of information with respect to the experiment design can cause severe problems if attention is not paid to the specific needs and properties of the problem at hand. The actual criteria to be optimized depends on (among other things) the particular ID algorithm and parametrization being used. Two parametric techniques are the focus of this presentation: recursive prediction error method (RPEM) and maximum likelihood estimation (MLE).

Bayard, David S.↗
NASA NTRS1953

On transonic flow past a wave-shaped wall

This report is an extension of a previous investigation (described in NACA rep. 1069) concerned with the solution of the nonlinear differential equation for transonic flow past a wavy wall. In the present work several new notions are introduced which permit the solution of the recursion formulas arising from the method of integration in series. In addition, a novel numerical tests of convergence, applied to the power series (in transonic similarity parameter) representing the local Mach number distribution at the boundary, indicates that smooth symmetrical potential flow past the wavy wall is no longer possible once the critical value of the stream Mach number has been exceeded.

Kaplan, Carl↗
NASA NTRS1990

Approximate minimum-time trajectories for two-link flexible manipulators

The method of recursive quadratic programming was used to generate approximate minimum-time tip trajectories for two-link semi-rigid and flexible manipulator movements in the horizontal plane. The manipulator is modeled with an efficient finite-element scheme for an n-link, m-joint system with bending only in the horizontal plane. Constraints on the trajectory include boundary conditions on position and energy for a rest-to-rest maneuver, straight-line tracking between boundary positions, and motor torque limits. Trajectory comparisons utilize a change in the link stiffness to compare a semi-rigid configuration to a flexible one. The level of bending flexibility necessary to excite significant modal behavior is demonstrated. Applied torques for minimum-time maneuvers are shown to be very similar between configurations and retain much of the qualitative character of rigid-body slewing motion.

Eisler, G. R.↗
NASA NTRS1992

Efficient dynamic optimization of logic programs

A summary is given of the dynamic optimization approach to speed up learning for logic programs. The problem is to restructure a recursive program into an equivalent program whose expected performance is optimal for an unknown but fixed population of problem instances. We define the term 'optimal' relative to the source of input instances and sketch an algorithm that can come within a logarithmic factor of optimal with high probability. Finally, we show that finding high-utility unfolding operations (such as EBG) can be reduced to clause reordering.

Laird, Phil↗
NASA NTRS1992

Spatially-varying IIR filter banks for image coding

This paper reports on the application of spatially variant infinite impulse response (IIR) filter banks to subband image coding. The new filter bank is based on computationally efficient recursive polyphase decompositions that dynamically change in response to the input signal. In the absence of quantization, reconstruction can be made exact. However, by proper choice of an adaptation scheme, we show that subband image coding based on time varying filter banks can yield improvement over the use of conventional filter banks.

Chung, Wilson C.↗
NASA NTRS1993

Spatial operator algebra for flexible multibody dynamics

This paper presents an approach to modeling the dynamics of flexible multibody systems such as flexible spacecraft and limber space robotic systems. A large number of degrees of freedom and complex dynamic interactions are typical in these systems. This paper uses spatial operators to develop efficient recursive algorithms for the dynamics of these systems. This approach very efficiently manages complexity by means of a hierarchy of mathematical operations.

Jain, A.↗
NASA NTRS1993

Computational strategies in the dynamic simulation of constrained flexible MBS

This research focuses on the computational dynamics of flexible constrained multibody systems. At first a recursive mapping formulation of the kinematical expressions in a minimum dimension as well as the matrix representation of the equations of motion are presented. The method employs Kane's equation, FEM, and concepts of continuum mechanics. The generalized active forces are extended to include the effects of high temperature conditions, such as creep, thermal stress, and elastic-plastic deformation. The time variant constraint relations for rolling/contact conditions between two flexible bodies are also studied. The constraints for validation of MBS simulation of gear meshing contact using a modified Timoshenko beam theory are also presented. The last part deals with minimization of vibration/deformation of the elastic beam in multibody systems making use of time variant boundary conditions. The above methodologies and computational procedures developed are being implemented in a program called DYAMUS.

Amirouche, F. M. L.↗
NASA NTRS1993

Parallel O(log n) algorithms for open- and closed-chain rigid multibody systems based on a new mass matrix factorization technique

In this paper, parallel O(log n) algorithms for computation of rigid multibody dynamics are developed. These parallel algorithms are derived by parallelization of new O(n) algorithms for the problem. The underlying feature of these O(n) algorithms is a drastically different strategy for decomposition of interbody force which leads to a new factorization of the mass matrix (M). Specifically, it is shown that a factorization of the inverse of the mass matrix in the form of the Schur Complement is derived as M(exp -1) = C - B(exp *)A(exp -1)B, wherein matrices C, A, and B are block tridiagonal matrices. The new O(n) algorithm is then derived as a recursive implementation of this factorization of M(exp -1). For the closed-chain systems, similar factorizations and O(n) algorithms for computation of Operational Space Mass Matrix lambda and its inverse lambda(exp -1) are also derived. It is shown that these O(n) algorithms are strictly parallel, that is, they are less efficient than other algorithms for serial computation of the problem. But, to our knowledge, they are the only known algorithms that can be parallelized and that lead to both time- and processor-optimal parallel algorithms for the problem, i.e., parallel O(log n) algorithms with O(n) processors. The developed parallel algorithms, in addition to their theoretical significance, are also practical from an implementation point of view due to their simple architectural requirements.

Fijany, Amir↗
NASA NTRS1993

A multi-level solution algorithm for steady-state Markov chains

A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss-Seidel and optimal SOR algorithms for a variety of test problems. The multi-level method is compared and contrasted with the iterative aggregation-disaggregation algorithm of Takahashi.

Horton, Graham↗
NASA NTRS1992

A mean field neural network for hierarchical module placement

This paper proposes a mean field neural network for the two-dimensional module placement problem. An efficient coding scheme with only O(N log N) neurons is employed where N is the number of modules. The neurons are evolved in groups of N in log N iteration steps such that the circuit is recursively partitioned in alternating vertical and horizontal directions. In our simulations, the network was able to find optimal solutions to all test problems with up to 128 modules.

Unaltuna, M. Kemal↗
NASA NTRS1992

Some practicable applications of quadtree data structures/representation in astronomy

Development of quadtree as hierarchical data structuring technique for representing spatial data (like points, regions, surfaces, lines, curves, volumes, etc.) has been motivated to a large extent by storage requirements of images, maps, and other multidimensional (spatially structured) data. For many spatial algorithms, time-efficiency of quadtrees in terms of execution may be as important as their space-efficiency concerning storage conditions. Briefly, the quadtree is a class of hierarchical data structures which is based on the recursive partition of a square region into quadrants and sub-quadrants until a predefined limit. Beyond the wide applicability of quadtrees in image processing, spatial information analysis, and building digital databases (processes becoming ordinary for the astronomical community), there may be numerous further applications in astronomy. Some of these practicable applications based on quadtree representation of astronomical data are presented and suggested for further considerations. Examples are shown for use of point as well as region quadtrees. Statistics of different leaf and non-leaf nodes (homogeneous and heterogeneous sub-quadrants respectively) at different levels may provide useful information on spatial structure of astronomical data in question. By altering the principle guiding the decomposition process, different types of spatial data may be focused on. Finally, a sampling method based on quadtree representation of an image is proposed which may prove to be efficient in the elaboration of sampling strategy in a region where observations were carried out previously either with different resolution or/and in different bands.

Pasztor, L.↗
NASA NTRS1993

The Adam language: Ada extended with support for multiway activities

The Adam language is an extension of Ada that supports multiway activities, which are cooperative activities involving two or more processes. This support is provided by three new constructs: diva procedures, meet statements, and multiway accept statements. Diva procedures are recursive generic procedures having a particular restrictive syntax that facilitates translation for parallel computers. Meet statements and multiway accept statements provide two ways to express a multiway rendezvous, which is an n-way rendezvous generalizing Ada's 2-way rendezvous. While meet statements tend to have simpler rules than multiway accept statements, the latter approach is a more straightforward extension of Ada. The only nonnull statements permitted within meet statements and multiway accept statements are calls on instantiated diva procedures. A call on an instantiated diva procedure is also permitted outside a multiway rendezvous; thus sequential Adam programs using diva procedures can be written. Adam programs are translated into Ada programs appropriate for use on parallel computers.

Charlesworth, Arthur↗
NASA NTRS1993

A constrained joint source/channel coder design and vector quantization of nonstationary sources

The emergence of broadband ISDN as the network for the future brings with it the promise of integration of all proposed services in a flexible environment. In order to achieve this flexibility, asynchronous transfer mode (ATM) has been proposed as the transfer technique. During this period a study was conducted on the bridging of network transmission performance and video coding. The successful transmission of variable bit rate video over ATM networks relies on the interaction between the video coding algorithm and the ATM networks. Two aspects of networks that determine the efficiency of video transmission are the resource allocation algorithm and the congestion control algorithm. These are explained in this report. Vector quantization (VQ) is one of the more popular compression techniques to appear in the last twenty years. Numerous compression techniques, which incorporate VQ, have been proposed. While the LBG VQ provides excellent compression, there are also several drawbacks to the use of the LBG quantizers including search complexity and memory requirements, and a mismatch between the codebook and the inputs. The latter mainly stems from the fact that the VQ is generally designed for a specific rate and a specific class of inputs. In this work, an adaptive technique is proposed for vector quantization of images and video sequences. This technique is an extension of the recursively indexed scalar quantization (RISQ) algorithm.

Sayood, Khalid↗
NASA NTRS1993

A multimedia adult literacy program: Combining NASA technology, instructional design theory, and authentic literacy concepts

For a number of years, the Software Technology Branch of the Information Systems Directorate has been involved in the application of cutting edge hardware and software technologies to instructional tasks related to NASA projects. The branch has developed intelligent computer aided training shells, instructional applications of virtual reality and multimedia, and computer-based instructional packages that use fuzzy logic for both instructional and diagnostic decision making. One outcome of the work on space-related technology-supported instruction has been the creation of a significant pool of human talent in the branch with current expertise on the cutting edges of instructional technologies. When the human talent is combined with advanced technologies for graphics, sound, video, CD-ROM, and high speed computing, the result is a powerful research and development group that both contributes to the applied foundations of instructional technology and creates effective instructional packages that take advantage of a range of advanced technologies. Several branch projects are currently underway that combine NASA-developed expertise to significant instructional problems in public education. The branch, for example, has developed intelligent computer aided software to help high school students learn physics and staff are currently working on a project to produce educational software for young children with language deficits. This report deals with another project, the adult literacy tutor. Unfortunately, while there are a number of computer-based instructional packages available for adult literacy instruction, most of them are based on the same instructional models that failed these students when they were in school. The teacher-centered, discrete skill and drill-oriented, instructional strategies, even when they are supported by color computer graphics and animation, that form the foundation for most of the computer-based literacy packages currently on the market may not be the most effective or most desirable way to use computer technology in literacy programs. This project is developing a series of instructional packages that are based on a different instructional model - authentic instruction. The instructional development model used to create these packages is also different. Instead of using the traditional five stage linear, sequential model based on behavioral learning theory, the project uses the recursive, reflective design and development model (R2D2) that is based on cognitive learning theory, particularly the social constructivism of Vygotsky, and an epistemology based on critical theory. Using alternative instructional and instructional development theories, the result of the summer faculty fellowship is LiteraCity, a multimedia adult literacy instructional package that is a simulation of finding and applying for a job. The program, which is about 120 megabytes, is distributed on CD-ROM.

Willis, Jerry W.↗