Engineering Papers⌕ Search

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

A Survey of Logic Formalisms to Support Mishap Analysis

Mishap investigations provide important information about adverse events and near miss incidents. They are intended to help avoid any recurrence of previous failures. Over time, they can also yield statistical information about incident frequencies that helps to detect patterns of failure and can validate risk assessments. However, the increasing complexity of many safety critical systems is posing new challenges for mishap analysis. Similarly, the recognition that many failures have complex, systemic causes has helped to widen the scope of many mishap investigations. These two factors have combined to pose new challenges for the analysis of adverse events. A new generation of formal and semi-formal techniques have been proposed to help investigators address these problems. We introduce the term mishap logics to collectively describe these notations that might be applied to support the analysis of mishaps. The proponents of these notations have argued that they can be used to formally prove that certain events created the necessary and sufficient causes for a mishap to occur. These proofs can be used to reduce the bias that is often perceived to effect the interpretation of adverse events. Others have argued that one cannot use logic formalisms to prove causes in the same way that one might prove propositions or theorems. Such mechanisms cannot accurately capture the wealth of inductive, deductive and statistical forms of inference that investigators must use in their analysis of adverse events. This paper provides an overview of these mishap logics. It also identifies several additional classes of logic that might also be used to support mishap analysis.

Johnson, Chris↗
NASA NTRS1989

A torus bifurcation theorem with symmetry

Hopf bifurcation in the presence of symmetry, in situations where the normal form equations decouple into phase/amplitude equations is described. A theorem showing that in general such degeneracies are expected to lead to secondary torus bifurcations is proved. By applying this theorem to the case of degenerate Hopf bifurcation with triangular symmetry it is proved that in codimension two there exist regions of parameter space where two branches of asymptotically stable two-tori coexist but where no stable periodic solutions are present. Although a theory was not derived for degenerate Hopf bifurcations in the presence of symmetry, examples are presented that would have to be accounted for by any such general theory.

Vangils, S. A.↗
NASA NTRS1989

Absolute Stability And Hyperstability In Hilbert Space

Theorems on stabilities of feedback control systems proved. Paper presents recent developments regarding theorems of absolute stability and hyperstability of feedforward-and-feedback control system. Theorems applied in analysis of nonlinear, adaptive, and robust control. Extended to provide sufficient conditions for stability in system including nonlinear feedback subsystem and linear time-invariant (LTI) feedforward subsystem, state space of which is Hilbert space, and input and output spaces having finite numbers of dimensions. (In case of absolute stability, feedback subsystem memoryless and possibly time varying. For hyperstability, feedback system dynamical system.)

Wen, John Ting-Yung↗
NASA NTRS1989

Extension of Euler's theorem to n-dimensional spaces

Euler's theorem states that any sequence of finite rotations of a rigid body can be described as a single rotation of the body about a fixed axis in three-dimensional Euclidean space. The usual statement of the theorem in the literature cannot be extended to Euclidean spaces of other dimensions. Equivalent formulations of the theorem are given and proved in a way which does not limit them to the three-dimensional Euclidean space. Thus, the equivalent theorems hold in other dimensions. The proof of one formulation presents an algorithm which shows how to compute an angular-difference matrix that represents a single rotation which is equivalent to the sequence of rotations that have generated the final n-D orientation. This algorithm results also in a constant angular velocity which, when applied to the initial orientation, eventually yields the final orientation regardless of what angular velocity generated the latter. The extension of the theorem is demonstrated in a four-dimensional numerical example.

Bar-Itzhack, Itzhack Y.↗
NASA NTRS1992

A Benes-like theorem for the shuffle-exchange graph

One of the first theorems on permutation routing, proved by V. E. Beness (1965), shows that given a set of source-destination pairs in an N-node butterfly network with at most a constant number of sources or destinations in each column of the butterfly, there exists a set of paths of lengths O(log N) connecting each pair such that the total congestion is constant. An analogous theorem yielding constant-congestion paths for off-line routing in the shuffle-exchange graph is proved here. The necklaces of the shuffle-exchange graph play the same structural role as the columns of the butterfly in Beness' theorem.

Schwabe, Eric J.↗
NASA NTRS1970

On a theorem of K T Chen

Proving normal form of mappings of real line into itself by contracting mapping principle

Braun, M.↗
NASA NTRS1979

A stability theorem for energy-balance climate models

The paper treats the stability of steady-state solutions of some simple, latitude-dependent, energy-balance climate models. For north-south symmetric solutions of models with an ice-cap-type albedo feedback, and for the sum of horizontal transport and infrared radiation given by a linear operator, it is possible to prove a 'slope stability' theorem, i.e., if the local slope of the steady-state iceline latitude versus solar constant curve is positive (negative) the steady-state solution is stable (unstable). Certain rather weak restrictions on the albedo function and on the heat transport are required for the proof, and their physical basis is discussed.

Cahalan, R. F.↗
NASA NTRS2010

A Prototype Embedding of Bluespec System Verilog in the PVS Theorem Prover

Bluespec SystemVerilog (BSV) is a Hardware Description Language based on the guarded action model of concurrency. It has an elegant semantics, which makes it well suited for formal reasoning. To date, a number of BSV designs have been verified with hand proofs, but little work has been conducted on the application of automated reasoning. We present a prototype shallow embedding of BSV in the PVS theorem prover. Our embedding is compatible with the PVS model checker, which can automatically prove an important class of theorems, and can also be used in conjunction with the powerful proof strategies of PVS to verify a broader class of properties than can be achieved with model checking alone.

Richards, Dominic↗
NASA NTRS1971

A contracting-interval program for the Danilewski method

The concept of contracting-interval programs is applied to finding the eigenvalues of a matrix. The development is a three-step process in which (1) a program is developed for the reduction of a matrix to Hessenberg form, (2) a program is developed for the reduction of a Hessenberg matrix to colleague form, and (3) the characteristic polynomial with interval coefficients is readily obtained from the interval of colleague matrices. This interval polynomial is then factored into quadratic factors so that the eigenvalues may be obtained. To develop a contracting-interval program for factoring this polynomial with interval coefficients it is necessary to have an iteration method which converges even in the presence of controlled rounding errors. A theorem is stated giving sufficient conditions for the convergence of Newton's method when both the function and its Jacobian cannot be evaluated exactly but errors can be made proportional to the square of the norm of the difference between the previous two iterates. This theorem is applied to prove the convergence of the generalization of the Newton-Bairstow method that is used to obtain quadratic factors of the characteristic polynomial.

Harris, J. D.↗
NASA NTRS1973

Fixed point theorems and dissipative processes.

Operators of the type considered by Hale et al. (1972) are used to show that under certain conditions there is a fixed point in a dissipative map within a Banach space. The conditions required for the existence of this fixed point are discussed in detail. Several fixed point theorems are formulated and proved.

Hale, J. K.↗
NASA NTRS1988

On the Wiener-Masani algorithm for finding the generating function of multivariate stochastic processes

The algorithms developed by Wiener and Masani (1957 and 1958) and Masani (1960) for the characterization of a class of multivariate stationary stochastic processes are investigated analytically. The algorithms permit the determination of (1) the generating function, (2) the prediction-error matrix, and (3) an autoregressive representation of the linear least-squares predictor. A number of theorems and lemmas are proved, and it is shown that the range of validity of the algorithms can be extended significantly beyond that given by Wiener and Masani.

Miamee, A. G.↗
NASA NTRS1989

Simple proof of the concavity of the entropy power with respect to Gaussian noise

A very simple proof of M. H. Costa's result that the entropy power of Xt = X + N (O, tI) is concave in t, is derived as an immediate consequence of an inequality concerning Fisher information. This relationship between Fisher information and entropy is found to be useful for proving the central limit theorem. Thus, one who seeks new entropy inequalities should try first to find new inequalities about Fisher information, or at least to exploit the existing ones in new ways.

Dembo, Amir↗
NASA NTRS1992

Rational approximations from power series of vector-valued meromorphic functions

Let F(z) be a vector-valued function, F: C yields C(sup N), which is analytic at z = 0 and meromorphic in a neighborhood of z = 0, and let its Maclaurin series be given. In this work we developed vector-valued rational approximation procedures for F(z) by applying vector extrapolation methods to the sequence of partial sums of its Maclaurin series. We analyzed some of the algebraic and analytic properties of the rational approximations thus obtained, and showed that they were akin to Pade approximations. In particular, we proved a Koenig type theorem concerning their poles and a de Montessus type theorem concerning their uniform convergence. We showed how optical approximations to multiple poles and to Laurent expansions about these poles can be constructed. Extensions of the procedures above and the accompanying theoretical results to functions defined in arbitrary linear spaces was also considered. One of the most interesting and immediate applications of the results of this work is to the matrix eigenvalue problem. In a forthcoming paper we exploited the developments of the present work to devise bona fide generalizations of the classical power method that are especially suitable for very large and sparse matrices. These generalizations can be used to approximate simultaneously several of the largest distinct eigenvalues and corresponding eigenvectors and invariant subspaces of arbitrary matrices which may or may not be diagonalizable, and are very closely related with known Krylov subspace methods.

Sidi, Avram↗
NASA NTRS1999

Improving the Accuracy of Quadrature Method Solutions of Fredholm Integral Equations That Arise from Nonlinear Two-Point Boundary Value Problems

In this paper we are concerned with high-accuracy quadrature method solutions of nonlinear Fredholm integral equations of the form y(x) = r(x) + definite integral of g(x, t)F(t,y(t))dt with limits between 0 and 1,0 less than or equal to x les than or equal to 1, where the kernel function g(x,t) is continuous, but its partial derivatives have finite jump discontinuities across x = t. Such integral equations arise, e.g., when one applied Green's function techniques to nonlinear two-point boundary value problems of the form y "(x) =f(x,y(x)), 0 less than or equal to x less than or equal to 1, with y(0) = y(sub 0) and y(l) = y(sub l), or other linear boundary conditions. A quadrature method that is especially suitable and that has been employed for such equations is one based on the trepezoidal rule that has a low accuracy. By analyzing the corresponding Euler-Maclaurin expansion, we derive suitable correction terms that we add to the trapezoidal rule, thus obtaining new numerical quadrature formulas of arbitrarily high accuracy that we also use in defining quadrature methods for the integral equations above. We prove an existence and uniqueness theorem for the quadrature method solutions, and show that their accuracy is the same as that of the underlying quadrature formula. The solution of the nonlinear systems resulting from the quadrature methods is achieved through successive approximations whose convergence is also proved. The results are demonstrated with numerical examples.

Sidi, Avram↗
NASA NTRS1999

Improving the Accuracy of Quadrature Method Solutions of Fredholm Integral Equations that Arise from Nonlinear Two-Point Boundary Value Problems

In this paper we are concerned with high-accuracy quadrature method solutions of nonlinear Fredholm integral equations of the form y(x) = r(x) + integral(0 to 1) g(x,t) F(t, y(t)) dt, 0 less than or equal to x less than or equal to 1, where the kernel function g(x,t) is continuous, but its partial derivatives have finite jump discontinuities across x = t. Such integrals equations arise, e.g., when one applies Green's function techniques to nonlinear two-point boundary value problems of the form U''(x) = f(x,y(x)), 0 less than or equal to x less than or equal to 1, with y(0) = y(sub 0) and g(l) = y(sub 1), or other linear boundary conditions. A quadrature method that is especially suitable and that has been employed for such equations is one based on the trapezoidal rule that has a low accuracy. By analyzing the corresponding Euler-Maclaurin expansion, we derive suitable correction terms that we add to the trapezoidal thus obtaining new numerical quadrature formulas of arbitrarily high accuracy that we also use in defining quadrature methods for the integral equations above. We prove an existence and uniqueness theorem for the quadrature method solutions, and show that their accuracy is the same as that of the underlying quadrature formula. The solution of the nonlinear systems resulting from the quadrature methods is achieved through successive approximations whose convergence is also proved. The results are demonstrated with numerical examples.

Sidi, Avram↗