Engineering PapersSearch

SEARCH · Engineering Papers

Results for “Theorem Proving”

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.

At least 109 records · Page 6

Liapunov's second method

Stability theorem based on Liapunov function, and using invariance property of limit sets of solutions to differential equations

THEOREM PROVING

Nth-order flat approximation of the signum function by a polynomial

In the interval studied, the signum function, sgn x, was demonstrated to be uniquely approximated by an odd polynomial f sub n (x) of order 2n-1, for which the approximation is nth order flat with respect to the points (1,1) and (-1,-1). A theorem was proved which states that for even integers n or = 2, the approximating polynomial has a pair of nonzero real roots + or - x sub n such that the x sub n form a monotonically decreasing sequence which converges to the root of 2 as n approaches infinity. For odd n i, f sub n (x) represents a strictly increasing monotonic function for all real x. As n tends to infinity, f sub n (x) converges to sgn x uniformly in two interval ranges.

Hosenthien, H. H.

On pursuit with curvature constraints.

A theorem is proved extending results of Cockayne on pursuit with curvature constraints. Let two points (pursuer and evader) move in Euclidean 3-space with constant speeds. Provided the pursuer has greater speed and greater normal acceleration, it is shown that pursuit is always successful. The methods used are similar to Cockayne's. The pursuer, by some preliminary maneuvers, sets up a condition where he is leaving the line of sight in the same direction and with the same speed as the evader. It is shown that from this instant, the pursuer can, without violating constraints, keep the line of sight parallel to the original and ultimately collide with the evader.

Rublein, G. T.

Applications of partial orderings to the study of positive definiteness, monotonicity, and convergence of iterative methods for linear systems.

Most of the known results concerning convergence of iterative methods for solving linear systems involve either positive definiteness or monotonicity. In this paper a new concept, called K-semipositivity, is introduced, which provides a link between convergence theory, monotonicity, and positive definiteness. By using this concept, together with partial orderings in Euclidean n-space, several new convergence theorems are proved. Application to Jacobi's methods and the theory of regular splittings shows the usefulness of these new results.

Vandergraft, J. S.

A result on differential inequalities and its application to higher order trajectory derivatives

A result on differential inequalities is obtained by considering the adjoint differential equation of the variational equation of the right side of the inequality. The main theorem is proved using basic results on differentiability of solutions with respect to initial conditions. The result is then applied to the problem of determining solution behavior using comparison techniques.

Gunderson, R. W.

Behavior near constant solutions of functional differential equations

Techniques have been developed to determine in a systematic way the local behavior near constant solutions. Local integral manifolds play a very important role in this development, as they have also for ordinary differential equations. An attempt is made to indicate a few more applications of these methods to some problems in bifurcation in the spirit of Sotomayor (to appear) and to a growth model of Cooke and Yorke (to appear). It is also shown how to prove a theorem on stability under constantly acting disturbances using these methods.

Hale, J. K.