Search NASASearch

Engineering topics

Leathrum, James F., Jr.

Publications and source records attributed to Leathrum, James F., Jr..

Fundamental Hardware Design in PVS

The development of Programmable Logic Devices (PLDs) has introduced programming as a primary tool in the development of digital circuits. This work attempts to create a generic verification environment in which designs can be specified and verified using the Prototype Verification System (PVS). This is accomplished by providing library support for general hardware constructs. The environment is intended for use with any PLD and any PLD programming language. The goal of the environment is to allow the easy translation of digital designs to PVS and provide sufficient support to make verification possible without a great deal of effort.

Leathrum, James F., Jr.

Verification of IEEE Compliant Subtractive Division Algorithms

A parameterized definition of subtractive floating point division algorithms is presented and verified using PVS. The general algorithm is proven to satisfy a formal definition of an IEEE standard for floating point arithmetic. The utility of the general specification is illustrated using a number of different instances of the general algorithm.

Miner, Paul S.

Sensitivity analysis in multipole-accelerated panel methods for potential flow

In the design of an airframe, the effect of changing the geometry on resulting computations is necessary for design optimization. The geometry is defined in terms of a series of design variables, including design variables to define the wing planform, tail, canard, pylon, and nacelle. Design optimization in this research is based on how these design variable affect the potential flow. The potential flow is computed as a function of the geometry and location of a series of panels describing the airframe, which are in turn a function of the design variables. Multipole accelerated panel methods improve the computational complexity of the problem and thus are an attractive approach. To utilize the methods in design optimization, it was necessary to define the appropriate sensitivity derivatives. The overhead incurred from finding the sensitivity derivatives in conjunction with the original computation should be small. This research developed the background for multipole-accelerated panel methods and the framework for finding sensitivity derivatives in the methods. Potential flow panel codes are commonly used for powered-lift aerodynamic predictions for three dimensional geometries. Given an airframe which has been discretized into a series of panels to define the airframe geometry, potential is computed as a function of the influence of all panels on all other panels. This is a computationally intensive problem for which efficient solutions are desired to improve the computational time and to allow greater resolution by use of more panels. One such solution is the use of hierarchical multipole methods which entail approximations of the effects of far-field terms. Hierarchical multipole methods have become prevalent in molecular dynamics and gravitational physics, and have been introduced into the fields of capacitance calculations, computational fluid dynamics, and electromagnetics. The methods utilize multipole expansions to describe the effect of bodies (i.e. particles, astrophysical bodies, panels, etc.) within a sphere on points distant from the sphere, where the influence diminishes as a function of distance. The expansions are exact with infinite series, however, for practical computations, the series are truncated and accuracy is selected based on the number of terms retained in the expansions. A hierarchical tree structure groups bodies together based on proximity to allow definition of multipole expansions for each group. The multipole expansions are then used to compute the effect of the bodies in a group on distant bodies.

Leathrum, James F., Jr.

Accelerated panel methods using the fast multipole method

Panel methods are commonly used in computational fluid dynamics for the solution of potential flow problems. The methods are a numerical technique based on the surface distribution of singularity elements. The solution is the process of finding the strength of the singularity elements distributed over the body's surface. This process involves the solution of the matrix problem Pq = p' for a set of unknowns q. The Fast Multipole Method is used to directly compute q without using matrix solvers. The algorithm works in O(N) time for N points, a great improvement over standard matrix solvers. In panel methods, the surface of a body is divided into a series of quadrilateral panels. The methods involve the computation of the influence of all other panels on each individual panel. The influence is based on the surface distribution, though this can be approximated by the area for distant panels. An alternative approximation, though with arbitrary accuracy, is to develop a multipole expansion about the center of the panel to describe the effect of a given panel on distant points in space. The expansion is based on the moments of the panel, thus allow the use of various surface distributions without changing the basic algorithm, just the computation of the various moments. The expansions are then manipulated in a tree walk to develop Taylor series expansions about a point in space which describe the effect of all distant panels on any point within a volume of convergence. The effect of near panels then needs to be computed directly, but the effect of all distant panels can be computed by simply evaluating the resulting expansion. The Fast Multipole Method has been applied to panel methods for the solution of source and doublet distributions. A major feature of the algorithm is that the algorithm does not change to derive the potential and velocity for sources and doublets. The same expansions can be used for both sources and doublets. Since the velocity is related to the potential, and the doublet potential is related to the z-component of the source velocity, all values can be derived from the same expansion by taking a series of partial derivatives. This requires more expansion terms to be kept since terms are lost in the process of taking partial derivatives. Thus to maintain accuracy for the doublet computation, more terms are required than if just evaluating for sources. The resulting Fast Multipole code should then parallelize better than classical panel methods due to the locality of data dependencies found in the Fast Multipole Method. Theoretically the parallelized code should execute in O(log N) time with O(N) processors, though this is not practical. Ongoing work includes implementing the parallel accelerated panel method, including methods to improve the load balancing of the problem by taking advantage of the known geometry of panels, and to encorporate sensitivity analysis into the algorithm.

Leathrum, James F., Jr.