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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 451 records · Page 25

All sources NASA NTRS DOE OSTI

NASA NTRS1983

Experiments using least square lattice filters for the identification of structural dynamics

An approach for identifying the dynamics of large space structures is applied to a free-free beam. In this approach the system's order is determined on-line, along with mode shapes, using recursive lattice filters which provide a least square estimate of the measurement data. The mode shapes determined are orthonormal in the space of the measurements and, hence, are not the natural modes of the structure. To determine the natural modes of the structure, a method based on the fast Fourier transform is used on the outputs of the lattice filter. These natural modes are used to obtain the modal amplitude time series which provides the input data for an output error parameter identification scheme that identifies the ARMA parameters of the difference equation model of the modes. the approach is applied to both simulated and experimental data.

Sundararajan, N.↗

NASA NTRS1983

Identification of helicopter rotor dynamic models

A recursive, extended Kalman-filter approach is applied to the identifiction of rotor damping levels of representative helicopter dynamic systems. The general formulation of the approach is presented in the context of a typically posed stochastic estimation problem, and the method is analytically applied to determining the damping levels of a coupled rotor-body system. The identified damping covergence characteristics are studied for sensitivity to both constant-coefficient and periodic-coefficient measurement models, process-noise covariance levels, and specified initial estimates of the rotor-system damping. A second application of the method to identifying the plant model for a highly damped, isolated flapping blade with a constant-coefficient state model (hover) and a periodic-coefficient state model (forward flight) is also investigated. The parameter-identification capability is evaluated for the effect of periodicity on the plant model coefficients and the influence of different measurement noise levels.

Molusis, J. A.↗

NASA NTRS1983

New syndrome decoder for (n, 1) convolutional codes

The letter presents a new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck. The new technique uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). A recursive, Viterbi-like, algorithm is developed to find the minimum weight error vector E(D). An example is given for the binary nonsystematic (2, 1) CC.

Reed, I. S.↗

NASA NTRS1983

Parameter testing for lattice filter based adaptive modal control systems

For Large Space Structures (LSS), an adaptive control system is highly desirable. The present investigation is concerned with an 'indirect' adaptive control scheme wherein the system order, mode shapes, and modal amplitudes are estimated on-line using an identification scheme based on recursive, least-squares, lattice filters. Using the identified model parameters, a modal control law based on a pole-placement scheme with the objective of vibration suppression is employed. A method is presented for closed loop adaptive control of a flexible free-free beam. The adaptive control scheme consists of a two stage identification scheme working in series and a modal pole placement control scheme. The main conclusion from the current study is that the identified parameters cannot be directly used for controller design purposes.

Sundararajan, N.↗

NASA NTRS1983

Adaptive control of a flexible beam using least square lattice filters

This paper presents an indirect adaptive control scheme for the control of flexible structures using recursive least square lattice filters. The identification scheme uses lattice filters which provide an on-line estimate of the number of modes, mode shapes and modal amplitudes. These modes are coupled and a transformation to decouple them in order to obtain the natural modes is presented. The decoupled modal amplitude time series are then used in an equation error identification scheme to identify the model parameters in an autoregressive moving average (ARMA) form. The control is based on modal pole placement scheme with the objective of vibration suppression. The control gains are calculated based on the identified ARMA parameters. Before using the identified parameters for control, detailed testing and validation procedures are carried out on the identified parameters. The full adaptive control scheme is demonstrated using the simulation for the 12 foot free-free beam apparatus at NASA Langley Research Center.

Sundararajan, N.↗

NASA NTRS1983

An improved finite-difference analysis of uncoupled vibrations of tapered cantilever beams

An improved finite difference procedure for determining the natural frequencies and mode shapes of tapered cantilever beams undergoing uncoupled vibrations is presented. Boundary conditions are derived in the form of simple recursive relations involving the second order central differences. Results obtained by using the conventional first order central differences and the present second order central differences are compared, and it is observed that the present second order scheme is more efficient than the conventional approach. An important advantage offered by the present approach is that the results converge to exact values rapidly, and thus the extrapolation of the results is not necessary. Consequently, the basic handicap with the classical finite difference method of solution that requires the Richardson's extrapolation procedure is eliminated. Furthermore, for the cases considered herein, the present approach produces consistent lower bound solutions.

Subrahmanyam, K. B.↗

NASA NTRS1984

Improved finite-difference vibration analysis of pretwisted, tapered beams

An improved finite difference procedure based upon second order central differences is developed. Several difficulties encountered in earlier works with fictitious stations that arise in using second order central differences, are eliminated by developing certain recursive relations. The need for forward or backward differences at the beam boundaries or other similar procedures is eliminated in the present theory. By using this improved theory, the vibration characteristics of pretwisted and tapered blades are calculated. Results of the second order theory are compared with published theoretical and experimental results and are found to be in good agreement. The present method generally produces close lower bound solutions and shows fast convergence. Thus, extrapolation procedures that are customary with first order finite-difference methods are unnecessary. Furthermore, the computational time and effort needed for this improved method are almost the same as required for the conventional first order finite-difference approach.

Subrahmanyam, K. B.↗

NASA NTRS1984

An on-line equivalent system identification scheme for adaptive control

A prime obstacle to the widespread use of adaptive control is the degradation of performance and possible instability resulting from the presence of unmodeled dynamics. The approach taken is to explicitly include the unstructured model uncertainty in the output error identification algorithm. The order of the compensator is successively increased by including identified modes. During this model building stage, heuristic rules are used to test for convergence prior to designing compensators. Additionally, the recursive identification algorithm as extended to multi-input, multi-output systems. Enhancements were also made to reduce the computational burden of an algorithm for obtaining minimal state space realizations from the inexact, multivariate transfer functions which result from the identification process. A number of potential adaptive control applications for this approach are illustrated using computer simulations. Results indicated that when speed of adaptation and plant stability are not critical, the proposed schemes converge to enhance system performance.

Sliwa, S. M.↗

NASA NTRS1984

A Simple Algorithm for the Metric Traveling Salesman Problem

An algorithm was designed for a wire list net sort problem. A branch and bound algorithm for the metric traveling salesman problem is presented for this. The algorithm is a best bound first recursive descent where the bound is based on the triangle inequality. The bounded subsets are defined by the relative order of the first K of the N cities (i.e., a K city subtour). When K equals N, the bound is the length of the tour. The algorithm is implemented as a one page subroutine written in the C programming language for the VAX 11/750. Average execution times for randomly selected planar points using the Euclidean metric are 0.01, 0.05, 0.42, and 3.13 seconds for ten, fifteen, twenty, and twenty-five cities, respectively. Maximum execution times for a hundred cases are less than eleven times the averages. The speed of the algorithms is due to an initial ordering algorithm that is a N squared operation. The algorithm also solves the related problem where the tour does not return to the starting city and the starting and/or ending cities may be specified. It is possible to extend the algorithm to solve a nonsymmetric problem satisfying the triangle inequality.

Grimm, M. J.↗

NASA NTRS1982

Interactive digital signal processor

The Interactive Digital Signal Processor (IDSP) is examined. It consists of a set of time series analysis Operators each of which operates on an input file to produce an output file. The operators can be executed in any order that makes sense and recursively, if desired. The operators are the various algorithms used in digital time series analysis work. User written operators can be easily interfaced to the sysatem. The system can be operated both interactively and in batch mode. In IDSP a file can consist of up to n (currently n=8) simultaneous time series. IDSP currently includes over thirty standard operators that range from Fourier transform operations, design and application of digital filters, eigenvalue analysis, to operators that provide graphical output, allow batch operation, editing and display information.

Mish, W. H.↗

NASA NTRS1983

Identification of multivariable high performance turbofan engine dynamics from closed loop data

The multivariable instrumental variable/approximate maximum likelihood (IV/AML) method of recursive time-series analysis is used to identify the multivariable (four inputs-three outputs) dynamics of the Pratt and Whitney F100 engine. A detailed nonlinear engine simulation is used to determine linear engine model structures and parameters at an operating point using open loop data. Also, the IV/AML method is used in a direct identification made to identify models from actual closed loop engine test data. Models identified from simulated and test data are compared to determine a final model structure and parameterization that can predict engine response for a wide class of inputs. The ability of the IV/AML algorithm to identify useful dynamic models from engine test data is assessed. Previously announced in STAR as N82-20339

Merrill, W.↗

NASA NTRS1982

On-line methods for rotorcraft aeroelastic mode identification

The requirements for the on-line identification of rotorcraft aeroelastic blade modes from random response test data are presented. A recursive maximum likelihood (RML) technique is used in conjunction with a bandpass filter to identify isolated blade mode damping and frequency. The RML technique is demonstrated to have excellent convergence characteristics in random measurement noise and random process noise excitation. The RML identification technique uses an ARMA representation for the aeroelastic stochastic system and requires virtually no user interaction while providing accurate confidence bands on the parameter estimates. Comparisons are made with an off-line Newton type maximum likelihood algorithm which uses a state variable model representation. Results are presented from simulation random response data which quantify the identifed parameter convergence behavior for various levels of random excitation which is typical of wind tunnel turbulence levels. The RML technique is applied to hingless rotor test data from the NASA Langley Research Center Helicopter Hover Facility.

Molusis, J. A.↗

NASA NTRS1984

Photon escape probabilities in a semi-infinite plane-parallel medium

It is shown in this work how to obtain the probabilities of photons escaping from a cold electron plasma environment after having undergone an arbitrary number of scatterings. This is done by retaining the exact differential cross section for Thomson scattering as opposed to using its polarization and angle averaged form. The results are given in the form of recursion relations. The geometry used is the semi-infinite plane-parallel geometry witlh a photon source located on a plane at an arbitrary optical depth below the surface. Analytical expressions are given for the probabilities which are accurate over a wide range of initial optical depth. These results can be used to model compact X-ray galactic sources which are surrounded by an electron-rich plasma.

Williams, A. C.↗

NASA NTRS1984

Convex profiles from asteroid lightcurves

A lightcurve inversion method that yields a two-dimensional convex profile is introduced. The number of parameters that characterize the profile is limited only by the number of Fourier harmonics used to represent the parent lightcurve. The implementation of the method is outlined by a recursive quadratic programming algorithm, and its application to photoelectric lightcurves and radar measurements is discussed. Special properties of the lightcurves of geometrically scattering ellipsoids are pointed out, and those properties are used to test the inversion method and obtain a criterion for judging whether any lightcurve could actually be due to such an object. Convex profiles for several asteroids are shown, and the method's validity is discussed from a physical as well as purely statistical point of view.

Ostro, S. J.↗

NASA NTRS1984

New syndrome decoding techniques for the (n, k) convolutional codes

This paper presents a new syndrome decoding algorithm for the (n, k) convolutional codes (CC) which differs completely from an earlier syndrome decoding algorithm of Schalkwijk and Vinck. The new algorithm is based on the general solution of the syndrome equation, a linear Diophantine equation for the error polynomial vector E(D). The set of Diophantine solutions is a coset of the CC. In this error coset a recursive, Viterbi-like algorithm is developed to find the minimum weight error vector (circumflex)E(D). An example, illustrating the new decoding algorithm, is given for the binary nonsystemmatic (3, 1)CC. Previously announced in STAR as N83-34964

Reed, I. S.↗

NASA NTRS1984

Long-term orbit prediction for the Venus Radar Mapper Mission using an averaging method

A set of singly averaged equations of motion are presented and applied to long-term orbit prediction of an orbiting spacecraft around a slowly rotating planet, using the Venus Radar Mapper Mission as an example. The equations of motion used are valid for all eccentricities less than one. The disturbing potentials used include nonsphericity of the Venus gravity field and third-body effects due to the sun. Recursive relationships are used in the expansion and evaluation of these potentials and their respective partial derivatives. Special care is taken to optimize computational efficiency. The averaging method is compared with high precision Cowell's method using a desktop microcomputer and shows computational saving of about two orders of magnitude.

Kwok, J. H.↗

NASA NTRS1984

Wave scheduling - Decentralized scheduling of task forces in multicomputers

Decentralized operating systems that control large multicomputers need techniques to schedule competing parallel programs called task forces. Wave scheduling is a probabilistic technique that uses a hierarchical distributed virtual machine to schedule task forces by recursively subdividing and issuing wavefront-like commands to processing elements capable of executing individual tasks. Wave scheduling is highly resistant to processing element failures because it uses many distributed schedulers that dynamically assign scheduling responsibilities among themselves. The scheduling technique is trivially extensible as more processing elements join the host multicomputer. A simple model of scheduling cost is used by every scheduler node to distribute scheduling activity and minimize wasted processing capacity by using perceived workload to vary decentralized scheduling rules. At low to moderate levels of network activity, wave scheduling is only slightly less efficient than a central scheduler in its ability to direct processing elements to accomplish useful work.

Van Tilborg, A. M.↗

NASA NTRS1986

Modular VLSI Reed-Solomon Decoder

Proposed Reed-Solomon (RS) decoder assembled from very-large-scale integrated-circuit (VLSI) building blocks. Decoder exploits recursive forms in RS decoding algorithms. RS codes capable of correcting random or burst errors in telemetry and other data-communication signals. Because of small size and low power consumption, advantageous to employ several such decoders in parallel-processing scheme to increase decoding speed.

Liu, K. Y.↗