SEARCH · Search NASA

Results for “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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 199 records · Page 11

All sources NASA NTRS DOE OSTI

NASA NTRS1997

Modeling of Rolling Element Bearing Mechanics: Computer Program Updates

The Rolling Element Bearing Analysis System (REBANS) extends the capability available with traditional quasi-static bearing analysis programs by including the effects of bearing race and support flexibility. This tool was developed under contract for NASA-MSFC. The initial version delivered at the close of the contract contained several errors and exhibited numerous convergence difficulties. The program has been modified in-house at MSFC to correct the errors and greatly improve the convergence. The modifications consist of significant changes in the problem formulation and nonlinear convergence procedures. The original approach utilized sequential convergence for nested loops to achieve final convergence. This approach proved to be seriously deficient in robustness. Convergence was more the exception than the rule. The approach was changed to iterate all variables simultaneously. This approach has the advantage of using knowledge of the effect of each variable on each other variable (via the system Jacobian) when determining the incremental changes. This method has proved to be quite robust in its convergence. This technical memorandum documents the changes required for the original Theoretical Manual and User's Manual due to the new approach.

Ryan, S. G.↗

NASA NTRS1959

A Numerical Method for Obtaining Monoenergetic Neutron Flux Distributions and Transmissions in Multiple-Region Slabs

This method is investigated for semi-infinite multiple-slab configurations of arbitrary width, composition, and source distribution. Isotropic scattering in the laboratory system is assumed. Isotropic scattering implies that the fraction of neutrons scattered in the i(sup th) volume element or subregion that will make their next collision in the j(sup th) volume element or subregion is the same for all collisions. These so-called "transfer probabilities" between subregions are calculated and used to obtain successive-collision densities from which the flux and transmission probabilities directly follow. For a thick slab with little or no absorption, a successive-collisions technique proves impractical because an unreasonably large number of collisions must be followed in order to obtain the flux. Here the appropriate integral equation is converted into a set of linear simultaneous algebraic equations that are solved for the average total flux in each subregion. When ordinary diffusion theory applies with satisfactory precision in a portion of the multiple-slab configuration, the problem is solved by ordinary diffusion theory, but the flux is plotted only in the region of validity. The angular distribution of neutrons entering the remaining portion is determined from the known diffusion flux and the remaining region is solved by higher order theory. Several procedures for applying the numerical method are presented and discussed. To illustrate the calculational procedure, a symmetrical slab ia vacuum is worked by the numerical, Monte Carlo, and P(sub 3) spherical harmonics methods. In addition, an unsymmetrical double-slab problem is solved by the numerical and Monte Carlo methods. The numerical approach proved faster and more accurate in these examples. Adaptation of the method to anisotropic scattering in slabs is indicated, although no example is included in this paper.

Schneider, Harold↗

NASA NTRS1996

Dynamics and Control of Articulated Anisotropic Timoshenko Beams

The paper illustrates the use of continuum models in control design for stabilizing flexible structures. A 6-DOF anisotropic Timoshenko beam with discrete nodes where lumped masses or actuators are located provides a sufficiently rich model to be of interest for mathematical theory as well as practical application. We develop concepts and tools to help answer engineering questions without having to resort to ad hoc heuristic ("physical") arguments or faith. In this sense the paper is more mathematically oriented than engineering papers and vice versa at the same time. For instance we make precise time-domain solutions using the theory of semigroups of operators rather than formal "inverse Laplace transforms." We show that the modes arise as eigenvalues of the generator of the semigroup, which are then related to the eigenvalues of the stiffness operator. With the feedback control, the modes are no longer orthogonal and the question naturally arises as to whether there is still a modal expansion. Here we prove that the eigenfunctions yield a biorthogonal Riesz basis and indicate the corresponding expansion. We prove mathematically that the number of eigenvalues is nonfinite, based on the theory of zeros of entire functions. We make precise the notion of asymptotic modes and indicate how to calculate them. Although limited by space, we do consider the root locus problem and show for instance that the damping at first increases as the control gain increases but starts to decrease at a critical value, and goes to zero as the gain increases without bound. The undamped oscillatory modes remain oscillatory and the rigid-body modes go over into deadbeat modes. The Timoshenko model dynamics are translated into a canonical wave equation in a Hilbert space. The solution is shown to require the use of an "energy" norm which is no more than the total energy: potential plus kinetic. We show that, under an appropriate extension of the notion of controllability, rate feedback with a collocated sensor can stabilize the structure in the sense that all modes are damped and the energy decays to zero. An example, non-numeric, is worked out in some detail illustrating the concepts and theory developed.

Balakrishnan, A. V.↗

NASA NTRS1986

The Science of Computing: Expert Systems

The creative urge of human beings is coupled with tremendous reverence for logic. The idea that the ability to reason logically--to be rational--is closely tied to intelligence was clear in the writings of Plato. The search for greater understanding of human intelligence led to the development of mathematical logic, the study of methods of proving the truth of statements by manipulating the symbols in which they are written without regard to the meanings of those symbols. By the nineteenth century a search was under way for a universal system of logic, one capable of proving anything provable in any other system.

Denning, Peter J.↗

NASA NTRS1999

The Formal Semantics of PVS

A specification language is a medium for expressing what is computed rather than how it is computed. Specification languages share some features with programming languages but are also different in several important ways. For our purpose, a specification language is a logic within which the behavior of computational systems can be formalized. Although a specification can be used to simulate the behavior of such systems, we mainly use specifications to state and prove system properties with mechanical assistance. We present the formal semantics of the specification language of SRI's Prototype Verification System (PVS). This specification language is based on the simply typed lambda calculus. The novelty in PVS is that it contains very expressive language features whose static analysis (e.g., typechecking) requires the assistance of a theorem prover. The formal semantics illuminates several of the design considerations underlying PVS, the interaction between theorem proving and typechecking.

Owre, Sam↗

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↗

NASA NTRS1998

Preliminary Work for Examining the Scalability of Reinforcement Learning

Researchers began studying automated agents that learn to perform multiple-step tasks early in the history of artificial intelligence (Samuel, 1963; Samuel, 1967; Waterman, 1970; Fikes, Hart & Nilsonn, 1972). Multiple-step tasks are tasks that can only be solved via a sequence of decisions, such as control problems, robotics problems, classic problem-solving, and game-playing. The objective of agents attempting to learn such tasks is to use the resources they have available in order to become more proficient at the tasks. In particular, each agent attempts to develop a good policy, a mapping from states to actions, that allows it to select actions that optimize a measure of its performance on the task; for example, reducing the number of steps necessary to complete the task successfully. Our study focuses on reinforcement learning, a set of learning techniques where the learner performs trial-and-error experiments in the task and adapts its policy based on the outcome of those experiments. Much of the work in reinforcement learning has focused on a particular, simple representation, where every problem state is represented explicitly in a table, and associated with each state are the actions that can be chosen in that state. A major advantage of this table lookup representation is that one can prove that certain reinforcement learning techniques will develop an optimal policy for the current task. The drawback is that the representation limits the application of reinforcement learning to multiple-step tasks with relatively small state-spaces. There has been a little theoretical work that proves that convergence to optimal solutions can be obtained when using generalization structures, but the structures are quite simple. The theory says little about complex structures, such as multi-layer, feedforward artificial neural networks (Rumelhart & McClelland, 1986), but empirical results indicate that the use of reinforcement learning with such structures is promising. These empirical results make no theoretical claims, nor compare the policies produced to optimal policies. A goal of our work is to be able to make the comparison between an optimal policy and one stored in an artificial neural network. A difficulty of performing such a study is finding a multiple-step task that is small enough that one can find an optimal policy using table lookup, yet large enough that, for practical purposes, an artificial neural network is really required. We have identified a limited form of the game OTHELLO as satisfying these requirements. The work we report here is in the very preliminary stages of research, but this paper provides background for the problem being studied and a description of our initial approach to examining the problem. In the remainder of this paper, we first describe reinforcement learning in more detail. Next, we present the game OTHELLO. Finally we argue that a restricted form of the game meets the requirements of our study, and describe our preliminary approach to finding an optimal solution to the problem.

Clouse, Jeff↗

NASA NTRS1993

Radiative Cooling of Warm Molecular Gas

We consider the radiative cooling of warm (T >= 100 K), fully molecular astrophysical gas by rotational and vibrational transitions of the molecules H2O, CO, and H2. Using an escape probability method to solve for the molecular level populations, we have obtained the cooling rate for each molecule as a function of temperature, density, and an optical depth parameter. A four-parameter expression proves useful in fitting the run of cooling rate with density for any fixed values of the temperature and optical depth parameter. We identify the various cooling mechanisms which are dominant in different regions of the astrophysically relevant parameter space. Given the assumption that water is very abundant in warm regions of the interstellar medium, H2O rotational transitions are found to dominate the cooling of warm interstellar gas over a wide portion of the parameter space considered. While chemical models for the interstellar medium make the strong prediction that water will be produced copiously at temperatures above a few hundred degrees, our assumption of a high water abundance has yet to be tested observationally. The Infrared Space Observatory and the Submillimeter Wave Astronomy Satellite will prove ideal instruments for testing whether water is indeed an important coolant of interstellar and circumstellar gas.

Neufeld, David A.↗

NASA NTRS2000

Aluminum Lithium Alloy 2195 Fusion Welding Improvements with New Filler Wire

A viewgraph presentation outlines NASA Marshall Space Flight Center, Lockheed Martin Michoud Space Systems, and McCook Metals' development an aluminum-copper weld filler wire for fusion welding 2195 aluminum lithium. The aluminum-copper based weld filler wire has been identified as B218, which is the result of six years of weld filler wire development funded by NASA, Lockheed Martin, and McCook Metals. The Super Lightweight External Tank for the NASA Space Shuttle Program consists of 2195 welded with 4043 aluminum-silicon weld filler wire. The B218 filler wire chemistry was developed to produce enhanced 2195 weld and repair weld mechanical properties. An initial characterization of the B218 weld filler wire was performed consisting of initial weld and repair weld evaluation comparing B218 and 4043. The testing involved room temperature and cryogenic tensile testing along with fracture toughness testing. B218 weld filler wire proved to produce enhanced initial and repair weld tensile and fracture properties over 4043. B218 weld filler wire has proved to be a superior weld filler wire for welding 2195 and other aluminum lithium alloys over 4043.

Russell, Carolyn↗

NASA NTRS2001

Investigating the Effect of Impurities on Macromolecule Crystal Growth in Microgravity

Chicken egg-white lysozyme (CEWL) crystals were grown in microgravity and on the ground in the presence of various amounts of a naturally occurring lysozyme dimer impurity. No significant favorable differences in impurity incorporation between microgravity and ground crystal samples were observed. At low impurity concentration the microgravity crystals preferentially incorporated the dimer. The presence of the dimer in the crystallization solutions in microgravity reduced crystal size, increased mosaicity and reduced the signal to noise ratio of the X-ray data. Microgravity samples proved more sensitive to impurity. Accurate indexing of the reflections proved critical to the X-ray analysis. The largest crystals with the best X-ray diffraction properties were grown from pure solution in microgravity.

Snell, Edward H.↗

NASA NTRS2001

Circular Coinduction

Circular coinduction is a technique for behavioral reasoning that extends cobasis coinduction to specifications with circularities. Because behavioral satisfaction is not recursively enumerable, no algorithm can work for every behavioral statement. However. algorithms using circular coinduction can prove every practical behavioral result that we know. This paper proves the correctness of circular coinduction and some consequences.

Rosu, Grigore↗

NASA NTRS2001

A Scalable Analysis Toolkit

The Scalable Analysis Toolkit (SAT) project aimed to demonstrate that it is feasible and useful to statically detect software bugs in very large systems. The technical focus of the project was on a relatively new class of constraint-based techniques for analysis software, where the desired facts about programs (e.g., the presence of a particular bug) are phrased as constraint problems to be solved. At the beginning of this project, the most successful forms of formal software analysis were limited forms of automatic theorem proving (as exemplified by the analyses used in language type systems and optimizing compilers), semi-automatic theorem proving for full verification, and model checking. With a few notable exceptions these approaches had not been demonstrated to scale to software systems of even 50,000 lines of code. Realistic approaches to large-scale software analysis cannot hope to make every conceivable formal method scale. Thus, the SAT approach is to mix different methods in one application by using coarse and fast but still adequate methods at the largest scales, and reserving the use of more precise but also more expensive methods at smaller scales for critical aspects (that is, aspects critical to the analysis problem under consideration) of a software system. The principled method proposed for combining a heterogeneous collection of formal systems with different scalability characteristics is mixed constraints. This idea had been used previously in small-scale applications with encouraging results: using mostly coarse methods and narrowly targeted precise methods, useful information (meaning the discovery of bugs in real programs) was obtained with excellent scalability.

Aiken, Alexander↗

NASA NTRS1997

Direct Simulations of Transition and Turbulence Using High-Order Accurate Finite-Difference Schemes

In recent years the techniques of computational fluid dynamics (CFD) have been used to compute flows associated with geometrically complex configurations. However, success in terms of accuracy and reliability has been limited to cases where the effects of turbulence and transition could be modeled in a straightforward manner. Even in simple flows, the accurate computation of skin friction and heat transfer using existing turbulence models has proved to be a difficult task, one that has required extensive fine-tuning of the turbulence models used. In more complex flows (for example, in turbomachinery flows in which vortices and wakes impinge on airfoil surfaces causing periodic transitions from laminar to turbulent flow) the development of a model that accounts for all scales of turbulence and predicts the onset of transition may prove to be impractical. Fortunately, current trends in computing suggest that it may be possible to perform direct simulations of turbulence and transition at moderate Reynolds numbers in some complex cases in the near future. This seminar will focus on direct simulations of transition and turbulence using high-order accurate finite-difference methods. The advantage of the finite-difference approach over spectral methods is that complex geometries can be treated in a straightforward manner. Additionally, finite-difference techniques are the prevailing methods in existing application codes. In this seminar high-order-accurate finite-difference methods for the compressible and incompressible formulations of the unsteady Navier-Stokes equations and their applications to direct simulations of turbulence and transition will be presented.

Rai, Man Mohan↗

NASA NTRS1998

A Polynomial Time, Numerically Stable Integer Relation Algorithm

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

Ferguson, Helaman R. P.↗

NASA NTRS2002

"We Freeze to Please": A History of NASA's Icing Research Tunnel and the Quest for Flight Safety

The formation of ice on wings and other control surfaces of airplanes is one of the oldest and most vexing problems that aircraft engineers and scientists continue to face. While no easy, comprehensive answers exist, the staff at NASAs Icing Research Tunnel (IRT) at the Glenn Research Center in Cleveland has done pioneering work to make flight safer for experimental, commercial, and military customers. The National Advisory Committee for Aeronautics (NACA) initiated government research on aircraft icing in the 1930s at its Langley facility in Virginia. Icing research shifted to the NACA's Cleveland facility in the 1940s. Initially there was little focus on icing at either location, as these facilities were more concerned with aerodynamics and engine development. With several high-profile fatal crashes of air mail carriers, however, the NACA soon realized the need for a leading research facility devoted to icing prevention and removal. The IRT began operation in 1944 and, despite renovations and periodic attempts to shut it down, has continued to function productively for almost 60 years. In part because icing has proved so problematic over time, IRT researchers have been unusually open-minded in experimenting with a wide variety of substances, devices, and techniques. Early icing prevention experiments involved grease, pumping hot engine exhaust onto the wings, glycerin soap, mechanical and inflatable "boots," and even corn syrup. The IRT staff also looked abroad for ideas and later tried a German and Soviet technique of electromagnetism, to no avail. More recently, European polymer fluids have been more promising. The IRT even periodically had "amateur nights" in which a dentist's coating for children's teeth proved unequal to the demands of super-cooled water droplets blown at 100 miles per hour. Despite many research dead-ends, IRT researchers have achieved great success over the years. They have developed important computer models, such as the LEWICE software, and made significant contributions to prevent ice buildup on turbine-powered commercial aircraft, helicopters, and military planes.

Leary, William M.↗

NASA NTRS2002

Program Instrumentation and Trace Analysis

Several attempts have been made recently to apply techniques such as model checking and theorem proving to the analysis of programs. This shall be seen as a current trend to analyze real software systems instead of just their designs. This includes our own effort to develop a model checker for Java, the Java PathFinder 1, one of the very first of its kind in 1998. However, model checking cannot handle very large programs without some kind of abstraction of the program. This paper describes a complementary scalable technique to handle such large programs. Our interest is turned on the observation part of the equation: How much information can be extracted about a program from observing a single execution trace? It is our intention to develop a technology that can be applied automatically and to large full-size applications, with minimal modification to the code. We present a tool, Java PathExplorer (JPaX), for exploring execution traces of Java programs. The tool prioritizes scalability for completeness, and is directed towards detecting errors in programs, not to prove correctness. One core element in JPaX is an instrumentation package that allows to instrument Java byte code files to log various events when executed. The instrumentation is driven by a user provided script that specifies what information to log. Examples of instructions that such a script can contain are: 'report name and arguments of all called methods defined in class C, together with a timestamp'; 'report all updates to all variables'; and 'report all acquisitions and releases of locks'. In more complex instructions one can specify that certain expressions should be evaluated and even that certain code should be executed under various conditions. The instrumentation package can hence be seen as implementing Aspect Oriented Programming for Java in the sense that one can add functionality to a Java program without explicitly changing the code of the original program, but one rather writes an aspect and compiles it into the original program using the instrumentation. Another core element of JPaX is an observation package that supports the analysis of the generated event stream. Two kinds of analysis are currently supported. In temporal analysis the execution trace is evaluated against formulae written in temporal logic. We have implemented a temporal logic evaluator on finite traces using the Maude rewriting system from SRI International, USA. Temporal logic is defined in Maude by giving its syntax as a signature and its semantics as rewrite equations. The resulting semantics is extremely efficient and can handle event streams of hundreds of millions events in few minutes. Furthermore, the implementation is very succinct. The second form of even stream analysis supported is error pattern analysis where an execution trace is analyzed using various error detection algorithms that can identify error-prone programming practices that may potentially lead to errors in some different executions. Two such algorithms focusing on concurrency errors have been implemented in JPaX, one for deadlocks and the other for data races. It is important to note, that a deadlock or data race potential does not need to occur in order for its potential to be detected with these algorithms. This is what makes them very scalable in practice. The data race algorithm implemented is the Eraser algorithm from Compaq, however adopted to Java. The tool is currently being applied to a code base for controlling a spacecraft by the developers of that software in order to evaluate its applicability.

Havelund, Klaus↗

NASA NTRS2003

Hiproofs

We introduce a hierarchical notion of formal proof, useful in the implementation of theorem provers, which we call highproofs. Two alternative definitions are given, motivated by existing notations used in theorem proving research. We define transformations between these two forms of hiproof, develop notions of underlying proof, and give a suitable definition of refinement in order to model incremental proof development. We show that our transformations preserve both underlying proofs and refinement. The relationship of our theory to existing theorem proving systems is discussed, as is its future extension.

Denney, Ewen↗