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.↗
Bias Characterization, Vertical Interpolation, and Horizontal Interpolation for Distributed Wind Siting Using Mesoscale Wind Resource Estimates
Much like their counterparts in utility-scale wind energy, developers of industrial, small-scale and distributed wind turbine deployments need to understand and accurately characterize the wind resource to properly assess the power generation and financial ramifications during siting and planning. National Renewable Energy Laboratory’s WIND (Wind Integration National Dataset) Toolkit (WTK) provides a best-in-class wind resource dataset generated using the Weather Research and Forecasting (WRF) model. This dataset includes parameters such as the wind speed, wind direction, and temperature at various heights, plus atmospheric stability near the surface. This data is available at 2-km spatial resolution and five-minute temporal resolution across 7 years, from 2007 to 2013 through a publicly accessible API interface. The Tools Assessing Performance (TAP) project seeks to extend this dataset to allow long term resource estimates and leverage it to better equip distributed wind equipment manufacturers, owner-operators, and installation professionals with better tools for practical siting applications. In this report, we present the results from our investigation within the TAP project focused on characterization of bias in WTK-based wind speed estimates and evaluation of vertical and horizontal interpolation techniques. We discuss the tradeoffs between different techniques and their combinations, as well as describe the lower bounds we determine for the studied validation errors. While the specific estimates we present are specific to WTK and the validation dataset we have chosen for this investigation (NREL's Wind Resource Meteorological Database), the overall analysis and the studied techniques are general enough to be applied to a broader set of wind datasets, both simulation-based and observational.
17 WIND ENERGY↗
Clock model interpolation and symmetry breaking in O(2) models
The $q$-state clock model is a classical spin model that corresponds to the Ising model when $q=2$ and to the $XY$ model when $q\to\infty$. The integer-$q$ clock model has been studied extensively and has been shown to have a single phase transition when $q=2$,$3$,$4$ and two phase transitions when $q>4$.We define an extended $q$-state clock model that reduces to the ordinary $q$-state clock model when $q$ is an integer and otherwise is a continuous interpolation of the clock model to noninteger $q$. We investigate this class of clock models in 2D using Monte Carlo (MC) and tensor renormalization group (TRG) methods, and we find that the model with noninteger $q$ has a crossover and a second-order phase transition. We also define an extended-$O(2)$ model (with a parameter $\gamma$) that reduces to the $XY$ model when $\gamma=0$ and to the extended $q$-state clock model when $\gamma\to\infty$, and we begin to outline the phase diagram of this model. These models with noninteger $q$ serve as a testbed to study symmetry breaking in situations corresponding to quantum simulators where experimental parameters can be tuned continuously.
Hostetler, Leon↗
Discrete Empirical Interpolation Method Based Dynamic Load Model Reduction
Dynamic load models add significant complexity to bulk power system time-domain simulations. The complexity is due to the large number of ordinary differential equations (ODEs) introduced by the dynamic load components such as induction motors. It is challenging to derive reduced-order models (ROMs) for dynamic loads due to the nonlinear functions in their governing equations. This paper applies the discrete empirical interpolation method enhanced proper orthogonal decomposition (DEIM-POD) to approximate the full dynamic load model with the ROM that minimizes the projection error of the nonlinear functions in dynamic load ODEs onto their dominant modes. This approach only requires evaluation of nonlinear functions at selected observation points. The observation points selected by DEIM also provide information for screening critical load buses where dynamic load model parameters contribute the most to the accuracy of ROM across multiple contingencies. The proposed approach is validated on IEEE 9-bus, WECC 179-bus and 2384-bus Polish systems.
bulk power system↗
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.↗
A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions
We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.
97 MATHEMATICS AND COMPUTING↗
A Method of Moments Wide Band Adaptive Rational Interpolation Method for High-Quality Factor Resonant Cavities
A new adaptive rational interpolation method is proposed to obtain the wideband frequency response of a resonant cavity simulated with the method of moments (MoM). This interpolation method uses both the Loewner matrix to construct a rational expression for the solution vector of MoM’s matrix system and an error estimator generated by the solution vectors and their derivatives. This error estimator is implemented in the adaptive procedure to gain a minimum set of frequencies and solution vectors required in the interpolation. The resulting set of frequencies and solution vectors is applied to interpolate other system variables, such as shielding effectiveness and input impedance. Here numerical results of a slotted cylindrical cavity supporting high-quality factor resonances are presented, showing that the new rational interpolation method is accurate and efficient in interpolating the complicated resonant response of the solution vector functions.
42 ENGINEERING↗
Coordinate-Based Seismic Interpolation in Irregular Land Survey: A Deep Internal Learning Approach
Physical and budget constraints often result in irregular sampling, which complicates accurate subsurface imaging. Preprocessing approaches, such as missing trace or shot interpolation, are typically employed to enhance seismic data in such cases. Recently, deep learning has been used to address the trace interpolation problem at the expense of large amounts of training data to adequately represent typical seismic events. Nonetheless, most research in this area has focused on trace reconstruction, with little attention having been devoted to shot interpolation. Furthermore, existing methods assume regularly spaced receivers/sources failing in approximating seismic data from real (irregular) surveys. This work presents a novel shot gather interpolation approach which uses a continuous coordinate-based representation of the acquired seismic wavefield parameterized by a neural network. The proposed unsupervised approach, which we call coordinate-based seismic interpolation (CoBSI), enables the prediction of specific seismic characteristics in irregular land surveys without using external data during neural network training. Importantly, experimental results on real and synthetic 3-D data validate the ability of the proposed method to estimate continuous smooth seismic events in the time-space and frequency-wavenumber domains, improving sparsity or low-rank-based interpolation methods.
58 GEOSCIENCES↗
Logarithm-Based Methods for Interpolating Quaternion Time Series
In this paper, we discuss a modified quaternion interpolation method based on interpolations performed on the logarithmic form. This builds on prior work that demonstrated this approach maintains C 2 continuity for prescriptive rotation. However, we develop and extend this method to descriptive interpolation, i.e., interpolating an arbitrary quaternion time series. To accomplish this, we provide a robust method of taking the logarithm of a quaternion time series such that the variables $\theta$ and $\hat{n}$ have a consistent and continuous axis-angle representation. We then demonstrate how logarithmic quaternion interpolation out-performs Renormalized Quaternion Bezier interpolation by orders of magnitude.
97 MATHEMATICS AND COMPUTING↗
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.↗