A new algorithm for the Lie transformation
Recursive triangular algorithm for Lie transformation from introduction of small parameter into generating function and Hamiltonian
Mersman, W. A.↗
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.
A power series inverse in time of the universal Kepler equation
Series inverse in powers of time and radius of convergence for universal form of Kepler equation, discussing recursion formulas for coefficients
Estes, R. H.↗
Toward automatic program synthesis
Automatic computer program synthesis based on theorem proving approach for construction of recursive and iterative programs operating on natural numbers, lists and trees
Manna, Z.↗
The calculation of the eigenvalues and eigenfunctions of Mathieu's equation
The eigenfunctions of Mathieu's equation are expanded in trigonometric series, and the resulting eigenvalue problem is cast in matrix form. This matrix is found to be a symmetric, triagonal matrix, and the eigenvalues are computed using the bisection method. The eigenfunction expansion coefficients are obtained by the standard recursion method. This computational technique for the eigenvalues and eigenfunctions of Mathieu's equation is both rapid and accurate.
Hodge, D. B.↗
An efficient parallel algorithm for the solution of a tridiagonal linear system of equations
Tridiagonal linear systems of equations are solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computations on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log sub 2 N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.
Stone, H. S.↗
State estimation with small nonlinearities
A variety of techniques is available for estimating the states of nonlinear dynamic systems from noisy data. The differences among several of these procedures in the presence of small dynamic and observational nonlinearities are investigated. Four discrete estimation algorithms are analyzed. The first is a strictly least square estimator, while the others are recursive algorithms similar to the Kalman filter used for estimating the states of linear systems. A group of analytic expressions is developed for the mean and covariance of the error in each of these estimators so that they may be compared without lengthy Monte Carlo simulations. The covariance expressions show that, to first order, all the estimators have the same covariance. Expressions for the means show that each estimator has a different bias. Several examples are carried out demonstrating that the relative magnitudes of the bias errors in the various estimators can be a strong function of such parameters as initial covariances and number of data points. Under some circumstances, more complicated algorithms can have larger biases than smaller ones.
Conrad, B.↗
The selection of approximating functions for tabulated numerical data
A computer program was developed that selects, from a list of candidate functions, the approximating functions and associated coefficients which result in the best curve fit of a given set of numerical data. The advantages of the approach used here are: (1) Multivariable approximations can be performed. (2) Flexibility with respect to the type of approximations used is available. (3) The program is designed to choose the best terms to be used in the approximation from an arbitrary list of possible terms so that little knowledge of the proper approximating form is required. (4) Recursion relations are used in determining the coefficients of the approximating functions, which reduces the computer execution time of the program.
Ingram, H. L.↗
Viscel: A general purpose computer program for analysis of linear viscoelastic structures, volume 2
The VISCEL program is a general purpose computer program developed for equilibrium analysis of linear viscoelastic structures. The program is written in FORTRAN 5 language to operate on the Univac 1108 computer under the EXEC 8 operating system. The program, an extension of the linear equilibrium problem solver ELAS, is an updated and extended version of its earlier form written for the IBM 7094 computer. Finite element matrix displacement approach coupled with the synchronized material property concept, utilizing incremental time steps, was adopted for the solution presented. The step-by-step procedure involves solution of recursive equations in the time domain, which takes into account the memory of material properties. Incremental and accumulative displacements and stresses are obtained at the end of each time step. In order to minimize the extent of computations resulting from accumulative effects of material memory, the program provides an option which enables the employment of constant time steps in the logarithmic scale. Program documentation is presented.
Gupta, K. K.↗
Meteorological and ecological monitoring of the stratosphere and mesosphere
A concept for determining the constituent densities of ozone, atomic oxygen, aerosols, and neutral density in the 20 to 1000 km region of the atmosphere from a satellite was developed. The concept includes the daytime measurement of solar scattering at the earth's limb in selected narrow spectral bands of the ultraviolet and visible regions, and the measurement of selected (dayglow) emissions. Nighttime measurements of the atmospheric extinction of stellar energy in selected bands are also considered as are simultaneous measurements of the 5577 airglow and molecular oxygen emission in the Herzberg band. Radiative-transfer models and recursive inversion algorithms are developed for the measurements, and the accuracy of the concept is assessed.
Newell, R. E.↗
Control of linear uncertain systems utilizing mismatched state observers
The control of linear continuous dynamical systems is investigated as a problem of limited state feedback control. The equations which describe the structure of an observer are developed constrained to time-invarient systems. The optimal control problem is formulated, accounting for the uncertainty in the design parameters. Expressions for bounds on closed loop stability are also developed. The results indicate that very little uncertainty may be tolerated before divergence occurs in the recursive computation algorithms, and the derived stability bound yields extremely conservative estimates of regions of allowable parameter variations.
Goldstein, B.↗
Sequential error detection for nonlinear estimators.
A method is presented for sequentially testing the consistency of actual and calculated error covariances in recursive nonlinear estimators, such as the extended Kalman filter. An equivalent simplified test is described briefly. The method is useful for linear filters as well, where inconsistencies may be caused by modeling inaccuracies.
Nahi, N. E.↗
Approximate estimation for systems with quantized data.
Estimation of the state of a nonlinear discrete-time system using quantized data is considered. An exact solution for the maximum likelihood estimate is expressed as the solution of a nonlinear two-point boundary-value problem. Approximate recursive solutions for both the maximum likelihood and the conditional-mean estimates are obtained. The results of Monte-Carlo simulations are presented in which the performance of these two algorithms is compared with that of a Kalman filter in which the quantization error is approximated by white noise.-
Clements, K. A.↗
A biased filter for linear discrete dynamic systems.
A recursive estimator, the ridge filter, was developed for the linear discrete dynamic estimation problem. Theorems were established to show that the ridge filter can be, on the average, closer to the expected value of the system state than the Kalman filter. On the other hand, Kalman filter, on the average, is closer to the instantaneous system state than the ridge filter. The ridge filter has been formulated in such a way that the computational features of the Kalman filter are preserved.
Chang, J. W.↗
Fixed interval smoothing with discrete measurements.
Smoothing equations for a linear continuous dynamic system with linear discrete measurements, derived from the discrete results of Rauch, Tung, and Striebel (1965), (R-T-S), are used to extend, through recursive updating, the previously published results of Bryson and Frazier (1963), (B-F), and yield a modified Bryson and Frazier, (M-B-F), algorithm. A comparison of the (M-B-F) and (R-T-S) algorithms leads to the conclusion that the former is to be preferred because it entails less computation, less storage, and less instability. It is felt that the presented (M-B-F) smoothing algorithm is a practical mechanization and should be of value in smoothing discretely observed dynamic linear systems.
Bierman, G. J.↗
A comparison of the effects of small nonlinearities on several estimation schemes.
A variety of techniques are available for estimating the states of nonlinear dynamic systems from noisy data. These procedures are generally equivalent when applied to linear systems. This paper investigates the difference between several of these procedures in the presence of small dynamic and observational nonlinearities. In particular, it examines one least square batch processing algorithm, and three recursive algorithms similar to the Kalman filter. To first order, all the estimators have the same covariance. Expressions for the means, however, show that each estimator has a different bias. The examples presented show that the biases can be a strong function of such parameters as initial covariances and number of data points being considered.
Conrad, B.↗
Star scanner attitude determination for the OSO-7 spacecraft.
Calculation of the inertial orientation of the OSO-7 spacecraft from the times at which known stars or planets transit planes fixed in the spacecraft. Both the reference planes and the timing information are provided by the star scanner instrument aboard the spacecraft, while the star identification and the statistical estimation of a set of parameters describing the spacecraft attitude are accomplished in a ground station computer facility. A recursive least-squares determination is made of a vector of first-order differential corrections to the attitude state vector. Preliminary analysis indicates the system accuracy to be 3 arc min in each attitude Euler angle.
Mackison, D. L.↗
N-burn optimal analytic trajectories.
Derivation of N-burn analytic solutions for propellant-optimal transfer trajectories of a vehicle in a vacuum between arbitrary boundary conditions. Variational changes in the desired boundary conditions are expressed, in general, in terms of variational changes in the control vector and in the initial state vector. All coefficient matrices are computed recursively in terms of the analytic matrices established from the subarcs of the N-burn solution. The solution is applicable to shuttle ascent (exoatmospheric), rendezvous, and deorbit problems. Consideration is also given to state-variable and control-variable inequality constraints.
Jezewski, D. J.↗
Decision surface estimate of nonlinear system stability domain by Lie series method.
The Lie series recursive algorithm for Zubov's partial differential equation is used to generate two sets of points, where one represents the exact asymptotic stability boundary of an equilibrium state of the nonlinear system under consideration and the other is interior to it. Based on these two sets of data as training samples of two classes, a decision hypersurface can be determined such that it is a close approximation of the asymptotic stability boundary.
Kormanik, J.↗