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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
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.↗
NASA NTRS1984

A Very Efficient Transfer Function Bounding Technique on Bit Error Rate for Viterbi Decoded, Rate 1/N Convolutional Codes

For rate 1/N convolutional codes, a recursive algorithm for finding the transfer function bound on bit error rate (BER) at the output of a Viterbi decoder is described. This technique is very fast and requires very little storage since all the unnecessary operations are eliminated. Using this technique, we find and plot bounds on the BER performance of known codes of rate 1/2 with K 18, rate 1/3 with K 14. When more than one reported code with the same parameter is known, we select the code that minimizes the required signal to noise ratio for a desired bit error rate of 0.000001. This criterion of determining goodness of a code had previously been found to be more useful than the maximum free distance criterion and was used in the code search procedures of very short constraint length codes. This very efficient technique can also be used for searches of longer constraint length codes.

Lee, P. J.↗
NASA NTRS1985

Accelerated viscoelastic characterization of T300-5208 graphite-epoxy laminates

A viscoelastic response scheme for the accelerated characterization of polymer-based composite laminates in applied to T300/5208 graphite/epoxy. The response of uni-directional specimens is modeled. The transient component of the viscoelastic creep compliance is assumed to follow a power law approximation. A recursive relationship is developed, based upon the Schapery single-integral equation, which allows approximation of a continuous time-varying uniaxial load using discrete steps in stress. The viscoelastic response of T300/5208 to transverse normal and shear stresses is determined unsing 90 deg and 10 deg off-axis tensile specimens. In each case the seven viscoelastic material parameters required in the analysis are determined experimentally using short-term creep and creep recovery tests. It is shown that an accurate measure of the power law exponent is crucial for accurate long-term prediction. A short term test cycle selection procedure is proposed, which should provide useful guidelines for the evaluation of other viscoelastic materials.

Tuttle, M. E.↗
NASA NTRS1985

Convex-profile Inversion of 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 obtained 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

Kalman filter modeling

The formulation of appropriate state-space models for Kalman filtering applications is studied. The so-called model is completely specified by four matrix parameters and the initial conditions of the recursive equations. Once these are determined, the die is cast, and the way in which the measurements are weighted is determined foreverafter. Thus, finding a model that fits the physical situation at hand is all important. Also, it is often the most difficult aspect of designing a Kalman filter. Formulation of discrete state models from the spectral density and ARMA random process descriptions is discussed. Finally, it is pointed out that many common processes encountered in applied work (such as band-limited white noise) simply do not lend themselves very well to Kalman filter modeling.

Brown, R. G.↗
NASA NTRS1985

Optimization of Controlled Structures

A formulation is presented for the coupled optimal design of a structural system and its control by defining a composite objective function as a linear combination of two components: a structural objective and a control objective. For the case when the structural objective is a function of the structural design variables only, and when the control objective is represented by the quadratic functional of the response and control energy, one can analytically express the optimal control in terms of any set of admissible structural design variables. The expression for the optimal control is used recursively in an iterative Newton-Raphson search scheme, the goal of which is to determine a corresponding optimal set of structural design variables that minimize the composite objective function. A numerical example is given to illustrate the computational procedure.

Salama, M.↗
NASA NTRS1985

Method of and apparatus for generating an interstitial point in a data stream having an even number of data points

Apparatus for doubling the data density rate of an analog to digital converter or doubling the data density storage capacity of a memory deviced is discussed. An interstitial data point midway between adjacent data points in a data stream having an even number of equal interval data points is generated by applying a set of predetermined one-dimensional convolute integer coefficients which can include a set of multiplier coefficients and a normalizer coefficient. Interpolator means apply the coefficients to the data points by weighting equally on each side of the center of the even number of equal interval data points to obtain an interstital point value at the center of the data points. A one-dimensional output data set, which is twice as dense as a one-dimensional equal interval input data set, can be generated where the output data set includes interstitial points interdigitated between adjacent data points in the input data set. The method for generating the set of interstital points is a weighted, nearest-neighbor, non-recursive, moving, smoothing averaging technique, equivalent to applying a polynomial regression calculation to the data set.

Edwards, T. R.↗
NASA NTRS1984

A fundamental model and efficient inference for SAR ocean imagery

Employing a synthetic aperture radar (SAR) imaging model based on fundamental models of nonlinear hydrodynamics, electromagnetic scattering from a two-scale surface, and SAR imaging of a time-variant scene, the optimal (minimum mean-square error) estimates of the parameters of a sinusoidal, long gravity wave, and the short gravity wave ensemble are found in an efficient recursive form and their performance evaluated, generally by numerical simulation, in a one-dimensional stationary version. An application is made to Seasat-SAR complex imagery.

Harger, R. O.↗
NASA NTRS1983

A function space approach to state and model error estimation for elliptic systems

An approach is advanced for the concurrent estimation of the state and of the model errors of a system described by elliptic equations. The estimates are obtained by a deterministic least-squares approach that seeks to minimize a quadratic functional of the model errors, or equivalently, to find the vector of smallest norm subject to linear constraints in a suitably defined function space. The minimum norm solution can be obtained by solving either a Fredholm integral equation of the second kind for the case with continuously distributed data or a related matrix equation for the problem with discretely located measurements. Solution of either one of these equations is obtained in a batch-processing mode in which all of the data is processed simultaneously or, in certain restricted geometries, in a spatially scanning mode in which the data is processed recursively. After the methods for computation of the optimal esimates are developed, an analysis of the second-order statistics of the estimates and of the corresponding estimation error is conducted. Based on this analysis, explicit expressions for the mean-square estimation error associated with both the state and model error estimates are then developed. While this paper focuses on theoretical developments, applications arising in the area of large structure static shape determination are contained in a closely related paper (Rodriguez and Scheid, 1982).

Rodriguez, G.↗
NASA NTRS1983

Closed-form solutions for a class of optimal quadratic tracking problems

Closed-form solutions are derived for a class of tracking problems including a linear optimal regulator and a prefilter for a time-invariant plant. The solutions for the prefilter equation and state trajectory coupled by the Riccati equation are exponentially related to the stability matrix of the plant. A computational procedure is presented in recursive form when the desired output state dynamics is assumed linear and time-invariant. Several examples are given for illustration.

Turner, J. D.↗
NASA NTRS1985

Progress in adaptive control of flexible spacecraft using lattice filters

This paper reviews the use of the least square lattice filter in adaptive control systems. Lattice filters have been used primarily in speech and signal processing, but they have utility in adaptive control because of their order-recursive nature. They are especially useful in dealing with structural dynamics systems wherein the order of a controller required to damp a vibration is variable depending on the number of modes significantly excited. Applications are presented for adaptive control of a flexible beam. Also, difficulties in the practical implementation of the lattice filter in adaptive control are discussed.

Sundararajan, N.↗