Fast carry accumulator design

Simple iterative accumulator combined with gated-carry, carry-completion detection, and skip-carry circuits produces three accumulators with decreased carry propagation times. Devices are used in machine control, measurement equipment, and computer applications to increase speed of binary addition. NAND gates are used in combining network

Application of three-dimensional Bezier patches in grid generation

Bezier and B-spline patches are popular tools in surface modeling. With these methods, a surface is represented by the tensor product of univariate approximations. The extension of this concept to three dimensions is obvious and can be applied to the problem of grid generation. This report will demonstrate how three dimensional patches can be used in solid modeling and in the generation of grids. Examples will be given demonstrating the ability to generate three dimensional grids directly from a wire frame without having to first set up the boundary surfaces. Many geometric grid properties can be imposed by the proper choice of the control net

Parameterization in Grid Generation

The distribution of grid points for calculating the solution of partial differential equations is chosen so as to include consideration of truncation error, stability, and the resolution of the solution near boundary layers and shocks. It is important to specify the distribution of points along a grid line. The problem of distributing points along a curve is considered. It is assumed that the curve is defined parametrically. The objective is to select a set of parameter values so that the corresponding points on the curves are properly distributed. The distribution is based on some intrinsic property of the curve such as arc length or curvature

Knot Probabilities in Random Diagrams

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 10 and fewer crossings are unknots (about 78% of the roughly 1.6 billion 10 crossing diagrams). For these crossing numbers, the unknot fraction is mostly explained by the prevalence of tree-like diagrams which are unknots for any assignment of over/under information at crossings. The data shows a roughly linear relationship between the log of knot type probability and the log of the frequency rank of the knot type, analogous to Zipf's law for word frequency. All knot frequencies are available as ancillary data.Comment: 33 page

Elliptic systems and numerical transformations

Properties of a transformation method, which was developed for solving fluid dynamic problems on general two dimensional regions, are discussed. These include construction error of the transformation and applications to mesh generation. An error and stability analysis for the numerical solution of a model parabolic problem is also presented

Transformation of two and three-dimensional regions by elliptic systems

The research during this period continued to expand the class of numerical algorithms that can be accurately and efficiently implemented on overlapping grids. Whereas previous calculations have been used to solve elliptic equations and to find the steady-state solution of parabolic equations, the present work is aimed towards developing time-accurate solution techniques for parabolic and hyperbolic equations. The primary difficulty here is in the correct treatment of the interior boundary nodes that must be updated at each iteration. The implementation of explicit methods is straightforward. However, the common practice of lagging these values when using an implicit methods leads to inconsistencies in the difference equation. One way to avoid this problem is to alternately calculate with an implicit and an explicit method on each subgrid. With this procedure, the explicit method generates boundary values at the next time level which are then used by the implicit step. It can be shown that when a backward implicit method is combined with a forward explicit method, the composite method is second order accurate and unconditionally stable for linear problems. A second area in which progress can be reported is in the distribution of grid points on curves and surfaces

A simple dead-reckoning navigational system

Simple navigation system is designed for vehicles operating in remote locations where it is not feasible to transport extensive equipment. System consists of four main components: directional gyrocompass to establish inertial direction; odometer to measure distance; signal processor to combine measured distance and direction; and sun compass to determine initial direction