Search NASA⌕ Search

Engineering topics

Feagin, T.

Publications and source records attributed to Feagin, T..

Multistep methods of numerical integration using back-corrections

A class of linear multistep methods is proposed for the solution of the equations of motion of certain dynamical systems encountered in celestial mechanics and astrodynamics. These methods are distinguished from the classical predictor-corrector methods in that they permit 'back-corrections' of the solution to be made. As the integration advances in time, the numerical solution is corrected or improved at certain points in the past. The enhanced numerical stability of these methods allows the meaningful application of high-order algorithms. Consequently, step sizes larger than those attainable with the classical methods may be adopted, and greater overall efficiency may be realized. These methods are applied to the problem of determining the orbit of an artificial satellite, and the results are compared with those obtained using classical methods.

Feagin, T.↗

The use of back corrections in multistep methods of numerical integration

Generalized multistep methods for the numerical solution of nonlinear systems of ordinary differential equations are introduced which allow the correction of previously computed values of the solution at internal points of the grid. These methods are shown to possess enhanced numerical stability. Preliminary numerical results indicate that for some satellite orbit problems these methods also possess greater overall efficiency. A uniformly converging theory of error propagation is presented which is valid for nonasymptotic values of the step size. Experimental results are seen to conform with theory.

Beaudet, P.↗

The determination of orbits using Picard iteration

The determination of orbits by using Picard iteration is reported. This is a direct extension of the classical method of Picard that has been used in finding approximate solutions of nonlinear differential equations for a variety of problems. The application of the Picard method of successive approximations to the initial value and the two point boundary value problems is given.

Mikkilineni, R. P.↗

Special Perturbations Using Back-Correction Methods of Numerical Integration

A new class of linear multistep methods for numerical integration of differential equations is reported that permits satellite computation solutions to be corrected at certain points in the past as the integration advances in time. Algorithms have been developed for the solution of both first- and second-order differential equations. The back correction method appears to be more efficient than classical methods when dominant and perturbing forces can be separated.

Feagin, T.↗

The use of series-solutions for batch and sequential estimation

Iterative methods for the approximate solution of the nonlinear state estimation problem are investigated in which the solution is retained in the form of a finite series of Chebyshev polynomials. Algorithms are presented which allow the state to be estimated from observational data in either the batch or the sequential form. The advantages of these techniques are discussed.

Feagin, T.↗

The development of accurate and efficient methods of numerical quadrature

Some new methods for performing numerical quadrature of an integrable function over a finite interval are described. Each method provides a sequence of approximations of increasing order to the value of the integral. Each approximation makes use of all previously computed values of the integrand. The points at which new values of the integrand are computed are selected in such a way that the order of the approximation is maximized. The methods are compared with the quadrature methods of Clenshaw and Curtis, Gauss, Patterson, and Romberg using several examples.

Feagin, T.↗