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 NTRS1976

Cubic spline function interpolation in atmosphere models for the software development laboratory: Formulation and data

A tabulation of selected altitude-correlated values of pressure, density, speed of sound, and coefficient of viscosity for each of six models of the atmosphere is presented in block data format. Interpolation for the desired atmospheric parameters is performed by using cubic spline functions. The recursive relations necessary to compute the cubic spline function coefficients are derived and implemented in subroutine form. Three companion subprograms, which form the preprocessor and processor, are also presented. These subprograms, together with the data element, compose the spline fit atmosphere package. Detailed FLOWGM flow charts and FORTRAN listings of the atmosphere package are presented in the appendix.

Kirkpatrick, J. C.↗

NASA NTRS1975

On the time-weighted quadratic sum of linear discrete systems

A method is proposed for obtaining the time-weighted quadratic sum for linear discrete systems. The formula of the weighted quadratic sum is obtained from matrix z-transform formulation. In addition, it is shown that this quadratic sum can be derived in a recursive form for several useful weighted functions. The discussion presented parallels that of MacFarlane (1963) for weighted quadratic integral for linear continuous systems.

Jury, E. I.↗

NASA NTRS1976

Optimization of multi-constrained structures based on optimality criteria

A weight-reduction algorithm is developed for the optimal design of structures subject to several multibehavioral inequality constraints. The structural weight is considered to depend linearly on the design variables. The algorithm incorporates a simple recursion formula derived from the Kuhn-Tucker necessary conditions for optimality, associated with a procedure to delete nonactive constraints based on the Gauss-Seidel iterative method for linear systems. A number of example problems is studied, including typical truss structures and simplified wings subject to static loads and with constraints imposed on stresses and displacements. For one of the latter structures, constraints on the fundamental natural frequency and flutter speed are also imposed. The results obtained show that the method is fast, efficient, and general when compared to other competing techniques. Extensions to the generality of the method to include equality constraints and nonlinear merit functions is discussed.

Rizzi, P.↗

NASA NTRS1976

DHARMA - Discriminant hyperplane abstracting residuals minimization algorithm for separating clusters with fuzzy boundaries

Learning of discriminant hyperplanes in imperfectly supervised or unsupervised training sample sets with unreliably labeled samples along the fuzzy joint boundaries between sample clusters is discussed, with the discriminant hyperplane designed to be a least-squares fit to the unreliably labeled data points. (Samples along the fuzzy boundary jump back and forth from one cluster to the other in recursive cluster stabilization and are considered unreliably labeled.) Minimization of the distances of these unreliably labeled samples from the hyperplanes does not sacrifice the ability to discriminate between classes represented by reliably labeled subsets of samples. An equivalent unconstrained linear inequality problem is formulated and algorithms for its solution are indicated. Landsat earth sensing data were used in confirming the validity and computational feasibility of the approach, which should be useful in deriving discriminant hyperplanes separating clusters with fuzzy boundaries, given supervised training sample sets with unreliably labeled boundary samples.

Dasarathy, B. V.↗

NASA NTRS1976

A finite difference method of solving anisotropic scattering problems

A new method of solving radiative transfer problems is described including a comparison of its speed with that of the doubling method, and a discussion of its accuracy and suitability for computations involving variable optical properties. The method uses a discretization in angle to produce a coupled set of first-order differential equations which are integrated between discrete depth points to produce a set of recursion relations for symmetric and anti-symmetric angular sums of the radiation field at alternate depth points. The formulation given here includes depth-dependent anisotropic scattering, absorption, and internal sources, and allows arbitrary combinations of specular and non-Lambertian diffuse reflection at either or both boundaries. Numerical tests of the method show that it can return accurate emergent intensities even for large optical depths. The method is also shown to conserve flux to machine accuracy in conservative atmospheres

Barkstrom, B. R.↗

NASA NTRS1976

Expansion of the gravitational potential with computerized Poisson series

The paper describes a recursive formulation for the expansion of the gravitational potential valid for both the tesseral and zonal harmonics. The expansion is primarily in rectangular coordinates, but the classical orbit elements or equinoctial orbit elements can be easily substituted. The equations of motion for the zonal harmonics in both classical and equinoctial orbital elements are described in a form which will result in closed-form expressions for the first-order perturbations. In order to achieve this result, the true longitude or true anomaly have to be used as independent variables.

Broucke, R.↗

NASA NTRS1975

Some estimation formulae for continuous time-invariant linear systems

In this brief paper we examine a Riccati equation decomposition due to Reid and Lainiotis and apply the result to the continuous time-invariant linear filtering problem. Exploitation of the time-invariant structure leads to integration-free covariance recursions which are of use in covariance analyses and in filter implementations. A super-linearly convergent iterative solution to the algebraic Riccati equation (ARE) is developed. The resulting algorithm, arranged in a square-root form, is thought to be numerically stable and competitive with other ARE solution methods. Certain covariance relations that are relevant to the fixed-point and fixed-lag smoothing problems are also discussed.

Bierman, G. J.↗

NASA NTRS1976

Triangular covariance factorizations for

An improved computational form of the discrete Kalman filter is derived using an upper triangular factorization of the error covariance matrix. The covariance P is factored such that P = UDUT where U is unit upper triangular and D is diagonal. Recursions are developed for propagating the U-D covariance factors together with the corresponding state estimate. The resulting algorithm, referred to as the U-D filter, combines the superior numerical precision of square root filtering techniques with an efficiency comparable to that of Kalman's original formula. Moreover, this method is easily implemented and involves no more computer storage than the Kalman algorithm. These characteristics make the U-D method an attractive realtime filtering technique. A new covariance error analysis technique is obtained from an extension of the U-D filter equations. This evaluation method is flexible and efficient and may provide significantly improved numerical results. Cost comparisons show that for a large class of problems the U-D evaluation algorithm is noticeably less expensive than conventional error analysis methods.

Thornton, C. L.↗

NASA NTRS1976

CCD filter and transform techniques for interference excision

The theoretical and some experimental results of a study aimed at applying CCD filter and transform techniques to the problem of interference excision within communications channels were presented. Adaptive noise (interference) suppression was achieved by the modification of received signals such that they were orthogonal to the recently measured noise field. CCD techniques were examined to develop real-time noise excision processing. They were recursive filters, circulating filter banks, transversal filter banks, an optical implementation of the chirp Z transform, and a CCD analog FFT.

Borsuk, G. M.↗

NASA NTRS1977

Optimal estimation for discrete time jump processes

Optimum estimates of nonobservable random variables or random processes which influence the rate functions of a discrete time jump process (DTJP) are obtained. The approach is based on the a posteriori probability of a nonobservable event expressed in terms of the a priori probability of that event and of the sample function probability of the DTJP. A general representation for optimum estimates and recursive equations for minimum mean squared error (MMSE) estimates are obtained. MMSE estimates are nonlinear functions of the observations. The problem of estimating the rate of a DTJP when the rate is a random variable with a probability density function of the form cx super K (l-x) super m and show that the MMSE estimates are linear in this case. This class of density functions explains why there are insignificant differences between optimum unconstrained and linear MMSE estimates in a variety of problems.

Vaca, M. V.↗

NASA NTRS1977

Concatenated shift registers generating maximally spaced phase shifts of PN-sequences

A large class of linearly concatenated shift registers is shown to generate approximately maximally spaced phase shifts of pn-sequences, for use in pseudorandom number generation. A constructive method is presented for finding members of this class, for almost all degrees for which primitive trinomials exist. The sequences which result are not normally characterized by trinomial recursions, which is desirable since trinomial sequences can have some undesirable randomness properties.

Hurd, W. J.↗

NASA NTRS1975

Measurement updating using the U-D factorization

A new mechanization of the Kalman updating algorithm based on a U-D factorization of the estimate error covariance is introduced. Efficient and stable updating recursions are developed for the unit upper triangular factor U and the diagonal factor D, treating only the parameter estimation problem. Properties of the factorization update performed here include efficient one point at a time processing that requires little more computation than the optimal but numerically unstable conventional Kalman measurement update algorithm, and stability that compares with the square root filter.

Bierman, G. J.↗

NASA NTRS1975

Parameter adaptive estimation of random processes

This paper is concerned with the parameter adaptive least squares estimation of random processes. The main result is a general representation theorem for the conditional expectation of a random variable on a product probability space. Using this theorem along with the general likelihood ratio expression, the least squares estimate of the process is found in terms of the parameter conditioned estimates. The stochastic differential for the a posteriori probability and the stochastic differential equation for the a posteriori density are found by using simple stochastic calculus on the representations obtained. The results are specialized to the case when the parameter has a discrete distribution. The results can be used to construct an implementable recursive estimator for certain types of nonlinear filtering problems. This is illustrated by some simple examples.

Caglayan, A. K.↗

NASA NTRS1976

On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane

Recognition of underlying straight lines and quadratic arcs in line drawings, and approximation of very noisy data by such line/curve segments, is addressed as a subproblem of the more general problem of optimum recognition of complicated line/curve drawings. Some specific algorithms are presented with extensions and interpretations for more complicated applications, and a data generation model is developed for the problem. Data are generated as a perturbation of a single underlying straight line or an elliptic or hyperbolic arc. Recursive estimation techniques, minimization of central processing unit time, decision making with controlled error probabilities, and modeling and recognition of pictures consisting of noisy curves are dealt with. Applications envisaged include: picture data compression, contour line representation in maps, intelligent data searches, and ballistic missile decoy tracking.

Cooper, D. B.↗

NASA NTRS1977

A technique for simulating turbulence for aerospace vehicle flight simulation studies

An atmospheric turbulence model which accommodates variability of turbulence properties along an aerospace vehicle trajectory was developed. The technique involves the use of Dryden spectral forms in which the defining parameters are the standard deviations (sigma) and integral scales (L) of turbulence. These spectra are expressed as nondimensional functions of the nondimensional frequency Omega = omega L/V where omega is dimensional radian frequency and V is the true air speed of the aerospace vehicle. The nondimensional spectra are factored by standard techniques to obtain nondimensional linear recursive filters in the time domain whereby band-limited white-like noise can be operated upon to obtain nondimensional longitudinal, lateral, and vertical turbulence velocities, as functions of nondimensional time, tV/L, where t is time. Application of the technique to the simulation of the space shuttle orbiter entry flight phase is discussed.

Fichtl, G. H.↗

NASA NTRS1976

Digital image correlation techniques applied to LANDSAT multispectral imagery

The author has identified the following significant results. Automatic image registration and resampling techniques applied to LANDSAT data achieved accuracies, resulting in mean radial displacement errors of less than 0.2 pixel. The process method utilized recursive computational techniques and line-by-line updating on the basis of feedback error signals. Goodness of local feature matching was evaluated through the implementation of a correlation algorithm. An automatic restart allowed the system to derive control point coordinates over a portion of the image and to restart the process, utilizing this new control point information as initial estimates.

Bonrud, L. O.↗

NASA NTRS1977

Assessing the future of air freight

The role of air cargo in the current transportation system in the United States is explored. Methods for assessing the future role of this mode of transportation include the use of continuous-time recursive systems modeling for the simulation of different components of the air freight system, as well as for the development of alternative future scenarios which may result from different policy actions. A basic conceptual framework for conducting such a dynamic simulation is presented within the context of the air freight industry. Some research needs are identified and recommended for further research. The benefits, limitations, pitfalls, and problems usually associated with large scale systems models are examined.

Dajani, J. S.↗

NASA NTRS1977

Methodology of modeling and measuring computer architectures for plasma simulations

A brief introduction to plasma simulation using computers and the difficulties on currently available computers is given. Through the use of an analyzing and measuring methodology - SARA, the control flow and data flow of a particle simulation model REM2-1/2D are exemplified. After recursive refinements the total execution time may be greatly shortened and a fully parallel data flow can be obtained. From this data flow, a matched computer architecture or organization could be configured to achieve the computation bound of an application problem. A sequential type simulation model, an array/pipeline type simulation model, and a fully parallel simulation model of a code REM2-1/2D are proposed and analyzed. This methodology can be applied to other application problems which have implicitly parallel nature.

Wang, L. P. T.↗