Modal interpolation program, L215 (INTERP). Volume 1: Engineering and usage

The usage of the Modal Interpolation Program L215 (INTERP) is described. The program uses modal data to form sets of arrays containing interpolation coefficients. The interpolation arrays can then be used to determine displacements at various aerodynamic surface and surface slopes that are parallel and perpendicular to the freestream direction. Five different interpolation methods are available. A description of the data manipulation and the interpolation methods is presented

INPUTB: A thermal/structural data interface program for 2-dimensional and 3-dimensional interpolation

A computer program (INPUTB) for interpolation in both space and time, and based on a linear interpolation scheme using simplex spatial regions is described. The program was developed to provide data interfacing between the output from thermal analyzers and the input to the BOPACE 3-D program. The INPUTB interpolator is of a general nature and could be used for other tasks. The INPUTB program utilizes temperature values which are given at some sequence of time for a list of strategically located thermal nodes. It operates on these values by performing a double interpolation to provide temperature values at another desired sequence of times for a list of structural nodes

A computer program for grain-size data

The computer program presented here seeks to improve estimation of statistical parameters for grain-size data by use of interpolated values. Interpolation is made by fitting a series of overlapping parabolas to the data, and follows the method of Snyder (1961). The values are used in moment formulas to compute standard statistical measures. Skewness and kurtosis are reduced by the interpolation data, and extreme positive values of kurtosis tend to be greatly reduced. The program also picks major modes, the median, and sediment type .The United States Geological Survey under Contract USGS-14-08-0001-835

Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation

We apply multivariate Lagrange interpolation to synthesize polynomial quantitative loop invariants for probabilistic programs. We reduce the computation of an quantitative loop invariant to solving constraints over program variables and unknown coefficients. Lagrange interpolation allows us to find constraints with less unknown coefficients. Counterexample-guided refinement furthermore generates linear constraints that pinpoint the desired quantitative invariants. We evaluate our technique by several case studies with polynomial quantitative loop invariants in the experiments

Nonanalytic function generation routines for 16-bit microprocessors

Interpolation techniques for three types (univariate, bivariate, and map) of nonanalytic functions are described. These interpolation techniques are then implemented in scaled fraction arithmetic on a representative 16 bit microprocessor. A FORTRAN program is described that facilitates the scaling, documentation, and organization of data for use by these routines. Listings of all these programs are included in an appendix

Imputation and Price Indexes: Theory and Evidence from the International Price Program

The goal of this paper is to theoretically and empirically demonstrate the consequences of different imputation methods, using recent data from the International Price Program. We suppose that prices are missing due to random or erratic reporting. We consider three different imputation methods: carry-forward, which just assumes that the missing price is the same as in the previous period; cell-mean, which imputes the missing price using either the short-term or long-term index for related commodities; and linear interpolation, which uses the last and next observations for the item to linearly interpolate. Certain hybrid techniques, combining either carry-forward or cell-mean with linear interpolation, are also considered. Our conclusions are: (1) Some imputation is better than no imputation; (2) the short term cell-mean introduces some â??noiseâ?? into the price index: (3) linear interpolation results in less fluctuation of prices than the true series: (4) combining either carry-forward or cell-mean with linear interpolation gives similar results.imputation, price index, interpolation

GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 2: User's manual and program listing

An efficient computer program, called GRID2D/3D, was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no modifications are needed in the grid generation part of the program. The theory and method used in GRID2D/3D is described

GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 1: Theory and method

An efficient computer program, called GRID2D/3D was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no modifications are needed in the grid generation part of the program. This technical memorandum describes the theory and method used in GRID2D/3D

Algebraic surface grid generation in three-dimensional space

An interactive program for algebraic generation of structured surface grids in three dimensional space was developed on the IRIS4D series workstations. Interactive tools are available to ease construction of edge curves and surfaces in 3-D space. Addition, removal, or redistribution of points at arbitrary locations on a general 3-D surface or curve is possible. Also, redistribution of surface grid points may be accomplished through use of conventional surface splines or a method called 'surface constrained transfinite interpolation'. This method allows the user to redistribute the grid points on the edges of a surface patch; the effect of the redistribution is then propagated to the remainder of the surface through a transfinite interpolation procedure where the grid points will be constrained to lie on the surface. The program was written to be highly functional and easy to use. A host of utilities are available to ease the grid generation process. Generality of the program allows the creation of single and multizonal surface grids according to the user requirements. The program communicates with the user through popup menus, windows, and the mouse