Simplification of second order systems of ordinary differential equations with a turning point.
Second order systems of linear differential equations eliminating all nonessential difficulties associated with initial value problem
SEARCH · Engineering Papers
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.
Second order systems of linear differential equations eliminating all nonessential difficulties associated with initial value problem
Method involves relationships between errors introduced by using finite sampling rates and parameters describing specific numerical method used. Procedurre is used in design and analysi of digital filters and simulators.
A number of hybrid methods for solving Cauchy problems are described on the basis of an evaluation of advantages of single and multiple-point numerical integration methods. The selection criterion is the principle of minimizing computer time. The methods discussed include the Nordsieck method, the Bulirsch-Stoer extrapolation method, and the method of recursive Taylor-Steffensen power series.
A program is described which extends the differential equation solving capability of MACSYMA to power series solutions and is available via the SHARE library. The program is directed toward those classes of equations with variable coefficients (in particular, those with singularities) and uses the method of Frobenius. Probably the most important distinction between this package and others currently available or being developed is that, wherever possible, this program will attempt to provide a complete solution to the equation rather than an approximation, i.e., a finite number of terms. This solution will take the form of a sum of infinite series.
An important characterization of a numerical method for first order ODE's is the region of absolute stability. If all eigenvalues of the linear problem dy/dt = Ay are inside this region, the numerical method is stable. If the second order system d/dt(dy/dt) = 2Ady/dt - By is solved as a first order system, the same result applies to the eigenvalues of the generalized eigenvalue problem (lambda-squared)I 2(lambda)A + B. No such region exists for general methods for second order equations, but in some cases a region of absolute stability can be defined for methods for the single second order equation d/dt(dy/dt) = 2ady/dt - by. The absence of a region of absolute stability can occur when different members of a system of first order equations are solved by different methods.
The paper deals with methods of obtaining approximate solutions to linear retarded functional differential equations (hereditary systems). The basic notion is to project the infinite dimensional space of initial functions for the hereditary system onto a finite dimensional subspace. Within this framework, two particular schemes are discussed. The first uses well-known piecewise constant approximations, while the second is a new method based on piecewise linear approximating functions. Numerical results are given.
An outline and a brief introduction to some of the concepts and implications of Lyapunov stability theory are presented. Various aspects of the theory are illustrated by the inclusion of eight examples, including the Cartesian coordinate equations of the two-body problem, linear and nonlinear (Van der Pol's equation) oscillatory systems, and the linearized Kustaanheimo-Stiefel element equations for the unperturbed two-body problem.
One-leg and multistep discretizations of variable-coefficient linear systems of ODEs having both slow and fast time scales are investigated analytically. The stability properties of these discretizations are obtained independent of ODE stiffness and compared. The results of numerical computations are presented in tables, and it is shown that for large step sizes the stability of one-leg methods is better than that of the corresponding linear multistep methods.
This paper discusses the application of ATOMFT, an integration package based on Taylor series solution with a sophisticated user interface. ATOMFT has the capabilities to allow the implementation of user defined functions and the solution of stiff and algebraic equations. Detailed examples, including the solutions to several astrodynamics problems, are presented. Comparisons with its predecessor ATOMCC and other modern integrators indicate that ATOMFT is a fast, accurate, and easy method to use to solve many differential equation problems.
The present numerical method for accurate and efficient solution of systems of linear equations proceeds by numerically developing a set of basis solutions characterized by slowly varying dependent variables. The solutions thus obtained are shown to have a computational overhead largely independent of the small size of the scale length which characterizes the solutions; in many cases, the technique obviates series solutions near singular points, and its known sources of error can be easily controlled without a substantial increase in computational time.
A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.
This note is concerned with the explicit symbolic computation of expressions involving differential operators and their actions on functions. The derivation of specialized numerical algorithms, the explicit symbolic computation of integrals of motion, and the explicit computation of normal forms for nonlinear systems all require such computations. More precisely, if R = k(x(sub 1),...,x(sub N)), where k = R or C, F denotes a differential operator with coefficients from R, and g member of R, we describe data structures and algorithms for efficiently computing g. The basic idea is to impose a multiplicative structure on the vector space with basis the set of finite rooted trees and whose nodes are labeled with the coefficients of the differential operators. Cancellations of two trees with r + 1 nodes translates into cancellation of O(N(exp r)) expressions involving the coefficient functions and their derivatives.
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.
Examples and a criterion for stability of integration methods is provided. The criterion is applied to well-known integration formulas.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
The reduction of the O(cu epsilon) integro differential equations to ordinary differential equations using a set of orthogonal functions is described. Attention was focused on the hover flight condition. The set of Galerkin integrals that appear in the reduced equations was evaluated by making use of nonrotating beam modes. Although a large amount of computer time was needed to accomplish this task, the Galerkin integrals so evaluated were stored on tape on a permanent basis. Several of the coefficients were also obtained in closed form in order to check the accuracy of the numerical computations. The equilibrium solution to the set of 3n equations obtained was determined as the solution to a minimization problem.
One of the problems for the hypersonic flights is the lack of accurate methods for predicting the boundary layer parameters at high Mach numbers and temperatures. At high Mach numbers and temperatures, the real gas effects should be included in calculations of the compressible laminar and turbulent boundary layers. By introducing the Mangler-Levy-Lees transformation, the compressible laminar boundary layer equations were transformed into two ordinary differential equations. To solve these ordinary differential equations for the flow over a flat plate, the Runge-Kutta method of order 5 and 6 was used with a secant method of solving the simultaneous nonlinear equations for the boundary layer conditions. Instead of using the perfect gas assumptions, the properties of air in the temperature range of 100 to 2500 K at M(e) = 8 were used for the calculations. The calculations were carried out for free flight conditions. The real gas effects were significant for the conditions of high freestream Mach numbers, and the boundary layer parameters from the real gas solutions were quite different from the existing formulas and solutions.