SEARCH · Search NASA
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 method using finite-difference recurrence relations is presented for direct extrapolation of families of curves. The method is illustrated by applications to creep-rupture data for several materials and it is shown that good results can be obtained without the necessity for any of the usual parameter concepts.
Modified divided differences (MDD) provide a good way of representing a polynomial passing through points with unequally spaced abcissas. Recurrence relations for computing coefficients in either the monomial or Chebyshev basis from the MDD coefficients, and for computing the MDD coefficients for either the differentiated or the integrated polynomial are given. The latter operation is likely to be useful if MDD are used in a method for solving stiff differential equations.
Modified divided differences (MDD) provide a good way of representing a polynomial passing through points with unequally spaced abscissas. This note gives recurrence relations for computing coefficients in either the monomial or Chebyshev basis from the MDD coefficients, and for computing the MDD coefficients for either the differentiated or the integrated polynomial. The latter operation is likely to be useful if MDD are used in a method for solving stiff differential equations.
A new parallel algorithm for the solution of a general linear recurrence is described. Its relation to the work of Kogge and Stone is discussed.
A set of MACSYMA programs are described for finding closed form solutions to linear recurrence relations in equations having either constant or variable coefficients. In the homogenous case, a polymonial equation is obtained and the solution to the recurrence relation can be written as a linear combination of the roots of the polynomial. Exponential generating functions are used to solve variable coefficient relations. Taking successive derivatives and using the recurrence relation, an ordinary differential equation is obtained. Expanding the solution to the differential equation in a Taylor series, shows that the nth term of the series is the solution to the recurrence relation. For second order recurrences, a check is made for those that can be solved in terms of Bessel functions.
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.
Tridiagonal linear systems of equations can be 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 computation 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.
General formulas for Hansen's coefficients in satellite theory are derived along with expressions for the eccentricity functions G and H. Recurrence relations for the eccentricity functions and their derivatives are obtained which are valid for all values of the parameter p. It is noted that the recurrence relations obtained by Challe and Laclaverie (1969) as well as by Balmino (1973) do not satisfy certain parity conditions and therefore involve coefficients outside the range of usage.
The disturbing functions due to the geopotential and Luni-solar attractions are linear and bilinear forms in spherical harmonics. Making use of recurrence relations for the solid spherical harmonics and their derivatives, recurrence formulas are obtained for high degree terms as function of lower degree for any term of those disturbing functions and their derivative with respect to any element. The equations obtained are effective when a numerical integration of the equations of motion is appropriate. In analytical theories, they provide a fast way of obtaining high degree terms starting from initial very simple functions.
We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These families obey a simple three-term recurrence relation for differentiation, which implies that on an appropriately restricted domain the differentiation operator has a unique banded inverse. The inverse is an integration operator for the family, and it is simply the tridiagonal coefficient matrix for the recurrence. Since in these families convolution operators (i.e. matrix representations of multiplication by a function) are banded for polynomials, we are able to obtain a banded representation for linear differential operators with rational coefficients. This leads to a method of solution of initial or boundary value problems that, besides having an operation count that scales linearly with the order of truncation N, is computationally well conditioned. Among the applications considered is the use of rational maps for the resolution of sharp interior layers.
The spectrum of the object suggested as a possible optical counterpart of GX 2+5, was studied, using the image tube scanner attached to the 3-m telescope of Lick Observatory. An improved X-ray error box obtained with Copernicus strongly supports this proposed identification. The candidate displays all the characteristics of the symbiotic stars and the related recurrent novae. The spectrum reveals the presence of an M star together with a blue component and a large number of emission lines displaying a wide range of ionization. There is evidence of variability of both the continuum and the line intensities. This object provides strong support for the often proposed association of some X-ray sources with nova-like systems.
A set of spherical sampling functions is defined such that they are related to spherical-harmonic functions in the same way that the sampling functions of information theory are related to sine and cosine functions. An orderly distribution of (N + 1) squared sampling points on a sphere is given, for which the (N + 1) squared spherical sampling functions span the same linear manifold as do the spherical-harmonic functions through degree N. The transformations between the spherical sampling functions and the spherical-harmonic functions are given by recurrence relations. The spherical sampling functions of two arguments are extended to three arguments and to nonspherical reference surfaces. Typical applications of this formalism to geophysical topics are sketched.
A variable-order, variable-step Taylor series integration algorithm was implemented in NASA Glenn's SNAP (Spacecraft N-body Analysis Program) code. SNAP is a high-fidelity trajectory propagation program that can propagate the trajectory of a spacecraft about virtually any body in the solar system. The Taylor series algorithm's very high order accuracy and excellent stability properties lead to large reductions in computer time relative to the code's existing 8th order Runge-Kutta scheme. Head-to-head comparison on near-Earth, lunar, Mars, and Europa missions showed that Taylor series integration is 15.8 times faster than Runge- Kutta on average, and is more accurate. These speedups were obtained for calculations involving central body, other body, thrust, and drag forces. Similar speedups have been obtained for calculations that include J2 spherical harmonic for central body gravitation. The algorithm includes a step size selection method that directly calculates the step size and never requires a repeat step. High-order Taylor series integration algorithms have been shown to provide major reductions in computer time over conventional integration methods in numerous scientific applications. The objective here was to directly implement Taylor series integration in an existing trajectory analysis code and demonstrate that large reductions in computer time (order of magnitude) could be achieved while simultaneously maintaining high accuracy. This software greatly accelerates the calculation of spacecraft trajectories. At each time level, the spacecraft position, velocity, and mass are expanded in a high-order Taylor series whose coefficients are obtained through efficient differentiation arithmetic. This makes it possible to take very large time steps at minimal cost, resulting in large savings in computer time. The Taylor series algorithm is implemented primarily through three subroutines: (1) a driver routine that automatically introduces auxiliary variables and sets up initial conditions and integrates; (2) a routine that calculates system reduced derivatives using recurrence relations for quotients and products; and (3) a routine that determines the step size and sums the series. The order of accuracy used in a trajectory calculation is arbitrary and can be set by the user. The algorithm directly calculates the motion of other planetary bodies and does not require ephemeris files (except to start the calculation). The code also runs with Taylor series and Runge-Kutta used interchangeably for different phases of a mission.
Enumeration of special class class of permutations - generating function expression and asymtotic expansion for recurrence relation - combinatorial communications
Discrete time optimal control problems solved by second order variational algorithm, developing recurrence relations for perturbation equations
A program to integrate the equations of motion by series in powers of the time step can be easily modified to furnish the elements of the matrizant in power series of the time step. In particular, if the series representing the motion are obtained recursively, differentiation of the recurrence relations will provide immediately a recursive scheme for computing the coefficient in the power series for the elements of the matrizant.
Equations are derived for the general terms of the series obtained when certain operations are carried out on one or several given series. Explicit and recurrence relations are given for the literal groups which are common to the given series. A general method is shown to obtain the multipliers which depend on the operation being performed, and the method is illustrated for several examples.
An engineering interpretation of and some minor corrections to previously completed work on a uniform representation of the gravitational potential and its derivatives (with emphasis on avoiding the usual singularity at the pole) were presented. The physical meaning of the variables was explained, the derivation of results was separated into smaller parts for easier reading, some additional recurrence relations for the derived Legendre polynomials were included and compared, and a computer program implementing this formulation was presented. Numerical experiments have shown that the use of this representation, besides removing the singularity, substantially increases the speed of the computation.