Automatic selection of interpolation segments for a machine tool with linear interpolator
Automatic selection of interpolation segments for machine tool with linear interpolator
MACHINE TOOL↗
SEARCH · Search NASA
Results for “INTERPOLATION”
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.
Nearest neighbor, bilinear interpolation and bicubic interpolation geographic correction effects on LANDSAT imagery
Geographical correction effects on LANDSAT image data are identified, using the nearest neighbor, bilinear interpolation and bicubic interpolation techniques. Potential impacts of registration on image compression and classification are explored.
Jayroe, R. R., Jr.↗
ninterp: N-dimensional interpolation Rust crate [SWR-25-25]
The ninterp crate provides multivariate interpolation over a regular, sorted, nonrepeating grid of any dimensionality. A variety of interpolation strategies are implemented, however more are likely to be added. Extrapolation beyond the range of the supplied coordinates is supported for 1-D linear interpolators, using the slope of the nearby points. There are hard-coded interpolators for lower dimensionalities (up to N = 3) for better runtime performance. All interpolation is handled through instances of the Interpolator enum, with the selected tuple variant containing relevant data. Interpolation is executed by calling Interpolator::interpolate.
Carow, Kyle↗
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
Scattered data interpolation is a problem of interest in numerous areas such as electronic imaging, smooth surface modeling, and computational geometry. Our motivation arises from applications in geology and mining, which often involve large scattered data sets and a demand for high accuracy. The method of choice is ordinary kriging. This is because it is a best unbiased estimator. Unfortunately, this interpolant is computationally very expensive to compute exactly. For n scattered data points, computing the value of a single interpolant involves solving a dense linear system of size roughly n x n. This is infeasible for large n. In practice, kriging is solved approximately by local approaches that are based on considering only a relatively small'number of points that lie close to the query point. There are many problems with this local approach, however. The first is that determining the proper neighborhood size is tricky, and is usually solved by ad hoc methods such as selecting a fixed number of nearest neighbors or all the points lying within a fixed radius. Such fixed neighborhood sizes may not work well for all query points, depending on local density of the point distribution. Local methods also suffer from the problem that the resulting interpolant is not continuous. Meyer showed that while kriging produces smooth continues surfaces, it has zero order continuity along its borders. Thus, at interface boundaries where the neighborhood changes, the interpolant behaves discontinuously. Therefore, it is important to consider and solve the global system for each interpolant. However, solving such large dense systems for each query point is impractical. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. The problems arise from the fact that the covariance functions that are used in kriging have global support. Our implementations combine, utilize, and enhance a number of different approaches that have been introduced in literature for solving large linear systems for interpolation of scattered data points. For very large systems, exact methods such as Gaussian elimination are impractical since they require 0(n(exp 3)) time and 0(n(exp 2)) storage. As Billings et al. suggested, we use an iterative approach. In particular, we use the SYMMLQ method, for solving the large but sparse ordinary kriging systems that result from tapering. The main technical issue that need to be overcome in our algorithmic solution is that the points' covariance matrix for kriging should be symmetric positive definite. The goal of tapering is to obtain a sparse approximate representation of the covariance matrix while maintaining its positive definiteness. Furrer et al. used tapering to obtain a sparse linear system of the form Ax = b, where A is the tapered symmetric positive definite covariance matrix. Thus, Cholesky factorization could be used to solve their linear systems. They implemented an efficient sparse Cholesky decomposition method. They also showed if these tapers are used for a limited class of covariance models, the solution of the system converges to the solution of the original system. Matrix A in the ordinary kriging system, while symmetric, is not positive definite. Thus, their approach is not applicable to the ordinary kriging system. Therefore, we use tapering only to obtain a sparse linear system. Then, we use SYMMLQ to solve the ordinary kriging system. We show that solving large kriging systems becomes practical via tapering and iterative methods, and results in lower estimation errors compared to traditional local approaches, and significant memory savings compared to the original global system. We also developed a more efficient variant of the sparse SYMMLQ method for large ordinary kriging systems. This approach adaptively finds the correct local neighborhood for each query point in the interpolation process.
Memarsadeghi, Nargess↗
Interpolation of compound semiconductor alloy parameters from those of their constituents
Several methods have been proposed for interpolation of the value of physical parameters of quaternary alloys from those of their constituent ternary and binary sub-alloys. These expressions agree when non-linear bowing terms are not required; they differ in how the bowing terms of the bounding ternaries should be utilized. Common interpolation expressions for quaternaries can be generalized into two groups: (1) those that use a linear interpolation of the nearest ternary parameter values and (2) those that interpolate over binary values with a bowing term derived from the bounding ternaries. The second group of methods is equivalent to a polynomial expansion over the alloy’s interpolation space. For compound semiconductor alloys, the geometry of the composition space is the direct sum of the group-III and group-V mixture sub-spaces. The mixture sub-spaces are best described using barycentric coordinates on a regular simplex. A general polynomial expansion of the value of an alloy parameter using barycentric coordinates for the group-III and group-V simplex spaces is described along with an algorithm to generate interpolation expressions for alloys with arbitrary numbers of elements, including quinary and senary alloys. It is shown that a polynomial expansion produces values in closer agreement with the direct gap of quaternaries lattice-matched to common substrates than do approaches using an interpolation of the ternary values, despite a prominent recommendation to the contrary. Finally, a quaternary correction term is described that improves the predicted direct bandgap energies of GaInAsSb for compositions near those lattice matched to InP, InAs, and GaSb.
Olesberg, Jonathon T. [Sandia National Laboratorie↗
Implementation of High Temperature and Pressure fluid property interpolation tables
This document describes the use of module property_interpolate by John Doherty (Doherty,2006). The document “Fast Lookup of CO 2 Properties” describes the numerical details associated with lookup table. Rajeh Pawar modified property_interpolate for easier implementation in the FEHM code. George Zyvoloski modified the package to produce tables for water and air at very high temperatures and pressures. He also modified the auxiliary codes(drivers) to use newer datasets from the National Institute of Standards and Technology. We note here that within the files associated with FEHM there three property_interpolate modules. They are interpolate_2a.f90 (water), interpolate_2b.f90 (air) , and interpolate_2c.f90(CO 2 ). The interpolate_2c module is different than the earlier module produced by Rajeh Pawar in that it includes high temperature and pressure data. While FEHM has a number of fluid physics modules, this document will describe only the software and algorithms associated with water, water vapor, and heat (WH).
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Minimal norm constrained interpolation
In computational fluid dynamics and in CAD/CAM, a physical boundary is usually known only discreetly and most often must be approximated. An acceptable approximation preserves the salient features of the data such as convexity and concavity. In this dissertation, a smooth interpolant which is locally concave where the data are concave and is locally convex where the data are convex is described. The interpolant is found by posing and solving a minimization problem whose solution is a piecewise cubic polynomial. The problem is solved indirectly by using the Peano Kernal theorem to recast it into an equivalent minimization problem having the second derivative of the interpolant as the solution. This approach leads to the solution of a nonlinear system of equations. It is shown that Newton's method is an exceptionally attractive and efficient method for solving the nonlinear system of equations. Examples of shape-preserving interpolants, as well as convergence results obtained by using Newton's method are also shown. A FORTRAN program to compute these interpolants is listed. The problem of computing the interpolant of minimal norm from a convex cone in a normal dual space is also discussed. An extension of de Boor's work on minimal norm unconstrained interpolation is presented.
Irvine, L. D.↗
Filtering Interpolators for Image Comparison Algorithms
Comparing two or more images, either by differencing or ratioing, is important to many remote sensing problems. Because the pixel sample points for the images are (almost) always separated by some nonzero shift, a resampling, or interpolation, process must be performed if one image is to be accurately compared to another. Considered in Fourier space, an interpolator acts as a filter that attenuates some frequencies (usually high) of the image. Thus, when the shifted and unshifted images are compared, the former has been filtered, while the latter has not; the effect of this difference is called interpolation error. The key idea of this paper is to apply a filter to the unshifted image that matches the filtering effect of applying the interpolator to the shifted image, thereby drastically reducing interpolation error. The resulting interpolators, called filtering interpolators, are derived and discussed in detail elsewhere. Basic results will be given in this presentation.
Lucke, R. L.↗
Effective Interpolation of Incomplete Satellite-Derived Leaf-Area Index Time Series for the Continental United States
Many earth science modeling applications employ continuous input data fields derived from satellite data. Environmental factors, sensor limitations and algorithmic constraints lead to data products of inherently variable quality. This necessitates interpolation of one form or another in order to produce high quality input fields free of missing data. The present research tests several interpolation techniques as applied to satellite-derived leaf area index, an important quantity in many global climate and ecological models. The study evaluates and applies a variety of interpolation techniques for the Moderate Resolution Imaging Spectroradiometer (MODIS) Leaf-Area Index Product over the time period 2001-2006 for a region containing the conterminous United States. Results indicate that the accuracy of an individual interpolation technique depends upon the underlying land cover. Spatial interpolation provides better results in forested areas, while temporal interpolation performs more effectively over non-forest cover types. Combination of spatial and temporal approaches offers superior interpolative capabilities to any single method, and in fact, generation of continuous data fields requires a hybrid approach such as this.
Jasinski, Michael F.↗
Estimation and Visualization of Isosurface Uncertainty from Linear and High-Order Interpolation Methods
Isosurface visualization is fundamental for exploring and analyzing 3D volumetric data. Marching cubes (MC) algorithms with linear interpolation are commonly used for isosurface extraction and visualization. Although linear interpolation is easy to implement, it has limitations when the underlying data is complex and high-order, which is the case for most real-world data. Linear interpolation can output vertices at the wrong location. Its inability to deal with sharp features and features smaller than grid cells can lead to an incorrect isosurface with holes and broken pieces. Despite these limitations, isosurface visualizations typically do not include insight into the spatial location and the magnitude of these errors. We utilize high-order interpolation methods with MC algorithms and interactive visualization to highlight these uncertainties. Our visualization tool helps identify the regions of high interpolation errors. It also allows users to query local areas for details and compare the differences between isosurfaces from different interpolation methods. In addition, we employ high-order methods to identify and reconstruct possible features that linear methods cannot detect. We showcase how our visualization tool helps explore and understand the extracted isosurface errors through synthetic and real-world data.
Ouermi, Timbwaoga↗
Supersonic inlet contour interpolation
A method for designing supersonic inlet contours is described which consists in the interpolation of the contours of two known inlets designed for different Mach numbers, thereby determining the contours for a third inlet at an intermediate design Mach number. Several similar axisymmetric inlet contours were interpolated from known inlets with design Mach numbers ranging from 2.16 to 4.0 and with design Mach numbers differing by as much as 1.0. The flowfields were calculated according to Sorensen's (1965) computer program. Shockwave structure and pressure distribution characteristics are shown for the interpolated inlets. The validity of the interpolation is demonstrated by comparing the plots of the flowfield properties across the throat station of the interpolated inlet with the known inlets which were designed iteratively. It seems possible to write a computer program so that a matrix of known inlet contours can be interpolated.
Sorensen, N. E.↗
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
Interpolating scattered data points is a problem of wide ranging interest. A number of approaches for interpolation have been proposed both from theoretical domains such as computational geometry and in applications' fields such as geostatistics. Our motivation arises from geological and mining applications. In many instances data can be costly to compute and are available only at nonuniformly scattered positions. Because of the high cost of collecting measurements, high accuracy is required in the interpolants. One of the most popular interpolation methods in this field is called ordinary kriging. It is popular because it is a best linear unbiased estimator. The price for its statistical optimality is that the estimator is computationally very expensive. This is because the value of each interpolant is given by the solution of a large dense linear system. In practice, kriging problems have been solved approximately by restricting the domain to a small local neighborhood of points that lie near the query point. Determining the proper size for this neighborhood is a solved by ad hoc methods, and it has been shown that this approach leads to undesirable discontinuities in the interpolant. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. This process achieves its efficiency by replacing the large dense kriging system with a much sparser linear system. This technique has been applied to a restriction of our problem, called simple kriging, which is not unbiased for general data sets. In this paper we generalize these results by showing how to apply covariance tapering to the more general problem of ordinary kriging. Through experimentation we demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods for solving large sparse systems. We demonstrate our approach on large data sizes arising both from synthetic sources and from real applications.
Memarsadeghi, Nargess↗
Interpolating the ‘t Hooft model between Instant and Light-Front dynamics in the Coulomb Gauge
The 1+1D model of quantum chromodynamics (QCD) in the infinite number of colors, or 't Hooft model, can be interpolated between the instant form dynamics (IFD) and the light-front dynamics (LFD) using an interpolation parameter 0 (IFD) ≤ δ ≤ π/4 (LFD). This was realized in the interpolating axial gauge which links the axial gauge (A 1 = 0) in IFD and the light-front gauge (A + = 0) [1]. In this presentation, we discuss the corresponding realization in the interpolating Coulomb gauge which links the temporal gauge (A 0 = 0) in IFD and the light-front gauge (A + = 0) and its benefit of resolving the issue associated with the absence of the conjugate field to the gauge field A 0 in the axial gauge. In both gauges, all degrees of freedom are physical making these gauge choices ideal for finding the bound-state equations and for renormalizability. Although the gauge independence of the physical observables such as the meson mass spectra following Regge trajectories may be guaranteed due to the gauge symmetry of QCD, the realization and interpretation of the identical physical results may depend on the gauge choices. Here, we discuss such difference in the realization of the confinement phenomena ala linear potential in the two different gauges, Coulomb vs. Axial, and highlight the gauge independent physical results expected. We also comment on the utility of the interpolation which leads to an alternative quasi-PDF that can be implemented in the lattice QCD without suffering from the large momentum boost.
Duggin, Hunter↗
Interpolation of a surface from sets of discrete height data of different statistical characteristics
This paper presents and analyzes a method for the interpolation of a unique surface from two sets of independent digital height data of differing statistical characteristics. This method is based on linear prediction and thus relies on the concepts of auto- and cross-covariance functions. The linear prediction algorithm for two sets of digital height measurements is first derived and then evaluated using the method of moving averages and bilinear interpolation for comparison. It is found that the overall root mean square interpolation errors of linear prediction are similar to those from moving averages and bilinear interpolation. This accuracy performance, together with the well known potential for controlled filtering of measuring errors and good-behavior in areas of poor control, makes linear prediction a versatile and general method for interpolating a unique surface from two sets of digital height data, with applications in photogrammetric mapping, remote sensing, and other fields.
Leberl, F.↗
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.
Kroll, R. I.↗
Use of shape-preserving interpolation methods in surface modeling
In many large-scale scientific computations, it is necessary to use surface models based on information provided at only a finite number of points (rather than determined everywhere via an analytic formula). As an example, an equation of state (EOS) table may provide values of pressure as a function of temperature and density for a particular material. These values, while known quite accurately, are typically known only on a rectangular (but generally quite nonuniform) mesh in (T,d)-space. Thus interpolation methods are necessary to completely determine the EOS surface. The most primitive EOS interpolation scheme is bilinear interpolation. This has the advantages of depending only on local information, so that changes in data remote from a mesh element have no effect on the surface over the element, and of preserving shape information, such as monotonicity. Most scientific calculations, however, require greater smoothness. Standard higher-order interpolation schemes, such as Coons patches or bicubic splines, while providing the requisite smoothness, tend to produce surfaces that are not physically reasonable. This means that the interpolant may have bumps or wiggles that are not supported by the data. The mathematical quantification of ideas such as physically reasonable and visually pleasing is examined.
Ftitsch, F. N.↗
Spectral analysis of linear, shift-invariant interpolants
The use of a spectral analysis technique to evaluate the reconstruction/interpolation performance of linear, shift-invariant interpolants is examined. The technique was utilized to measure the performance of cubic hermite, quintic hermite, exponential, cubic, spline, Nu, PCC, Keys cubic, and BAWA cubic interpolants. The performance criterion is based upon the mean square error of the difference between the sampled and reconstructed functions. The reconstruction properties, interpolation functions, and reconstruction filters for the interpolants are studied and compared. It is noted that the spectral analysis technique is applicable to reconstruction algorithms used in signal and image processes, and interpolants used in numerical analysis, computer-aided design, and computer graphics.
Lansing, Donald L.↗
Transition elements based on transfinite interpolation
In this study the transfinite interpolation methodology, a 'blending-function' method in particular, is utilized for the formulation of transition elements. The method offers a formal way of meeting continuity requirements in a transition element. Element shape functions are derived by blending the continuity requirements of individual boundary segments. The blending directions are naturally orthogonal in rectangular domains therefore interpolation of the boundaries over rectangular 2D and 3D elements can be performed with minimal effort. In triangular domains, however, the choice of blending directions and interpolants is not straightforward. For that reason, two interpolation techniques are proposed for blending of the boundaries of triangular domains. A series of transition elements of various classes compatible with elements of different orders and dimensions is developed and the full potential of the transfinite interpolation, as it applies to element formulation, is explored.
Odabas, Onur R.↗