Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

At least 163 records · Page 9

Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation

Quantum metrology allows for measuring properties of a quantum system at the optimal Heisenberg limit. However, when the relevant quantum states are prepared using digital Hamiltonian simulation, the accrued algorithmic errors will cause deviations from this fundamental limit. In this work, we show how algorithmic errors due to Trotterized time evolution can be mitigated through the use of standard polynomial interpolation techniques. Our approach is to extrapolate to zero Trotter step size, akin to zero-noise extrapolation techniques for mitigating hardware errors. We perform a rigorous error analysis of the interpolation approach for estimating eigenvalues and time-evolved expectation values, and show that the Heisenberg limit is achieved up to polylogarithmic factors in the error. Our work suggests that accuracies approaching those of state-of-the-art simulation algorithms may be achieved using Trotter and classical resources alone for a number of relevant algorithmic tasks.

Rendon, Gumaro↗

Not-quite-transcendental Functions for Logarithmic Interpolation of Tabulated Data

From tabulated nuclear and degenerate equations of state to photon and neutrino opacities and nuclear reaction rates, tabulated data is ubiquitous in computational astrophysics. The dynamic range that must be covered by these tables typically spans many orders of magnitude. Here we present a novel strategy for accurately and performantly interpolating tabulated data that spans these large dynamic ranges. We demonstrate the efficacy of this strategy in tabulated lookups for nuclear and terrestrial equations of state. We show that this strategy is a faster drop-in replacement for linear interpolation of logarithmic grids.

79 ASTRONOMY AND ASTROPHYSICS↗

Islet: interpolation semi-Lagrangian element-based transport

Abstract. Advection of trace species, or tracers, also called tracer transport, in models of the atmosphere and other physical domains is an important and potentially computationally expensive part of a model's dynamical core. Semi-Lagrangian (SL) advection methods are efficient because they permit a time step much larger than the advective stability limit for explicit Eulerian methods without requiring the solution of a globally coupled system of equations as implicit Eulerian methods do. Thus, to reduce the computational expense of tracer transport, dynamical cores often use SL methods to advect tracers. The class of interpolation semi-Lagrangian (ISL) methods contains potentially extremely efficient SL methods. We describe a finite-element ISL transport method that we call the interpolation semi-Lagrangian element-based transport (Islet) method, such as for use with atmosphere models discretized using the spectral element method. The Islet method uses three grids that share an element grid: a dynamics grid supporting, for example, the Gauss–Legendre–Lobatto basis of degree three; a physics parameterizations grid with a configurable number of finite-volume subcells per element; and a tracer grid supporting use of Islet bases with particular basis again configurable. This method provides extremely accurate tracer transport and excellent diagnostic values in a number of verification problems.

58 GEOSCIENCES↗

The effects of spline interpolation on power spectral density

This paper discusses the power spectral effects of spline interpolators. A general technique is given for finding the steady-state spectral effects of splines of all orders, when applied following uniform sampling of the input function. The following observations are made: (1) the even order splines that were examined (second and fourth order) possessed divergent steady-state frequency transfer functions, (2) the degree of preservation of the power spectral density of the input process increased with the order of the (odd order) spline used for interpolation, and (3) the reconstruction of a stationary random process over a finite record length will, on the average, have less power than indicated by the steady-state transfer function.

Horowitz, L. L.↗

Interpolation of ERTS-1 multispectral scanner data

Three interpolation procedures, based on computing values between original sample points, for enlarging a picture are examined. An ERTS frame of Washington, D.C. was used to illustrate the results. Mathematical bases of the interpolation are given.

Mcgillem, C. D.↗

C super 1: Compatible interpolation over a triangle

An elementary derivation and a complete description is given of an algorithm for interpolation over a plane triangle when function values and first partial derivatives are given at the vertices. The method gives C1 continuity with neighboring triangles. The interpolation method is mathematically equivalent to one that has been discussed previously in the literature; however, the algorithmic form given here is more efficient than has previously been described.

Lawson, C. L.↗

Higher-order numerical methods derived from three-point polynomial interpolation

Higher-order collocation procedures resulting in tridiagonal matrix systems are derived from polynomial spline interpolation and Hermitian finite-difference discretization. The equations generally apply for both uniform and variable meshes. Hybrid schemes resulting from different polynomial approximations for first and second derivatives lead to the nonuniform mesh extension of the so-called compact or Pade difference techniques. A variety of fourth-order methods are described and this concept is extended to sixth-order. Solutions with these procedures are presented for the similar and non-similar boundary layer equations with and without mass transfer, the Burgers equation, and the incompressible viscous flow in a driven cavity. Finally, the interpolation procedure is used to derive higher-order temporal integration schemes and results are shown for the diffusion equation.

Rubin, S. G.↗

Polynomial interpolation methods for viscous flow calculations

Higher-order collocation procedures which result in block-tridiagonal matrix systems are derived from (1) Taylor series expansions and from (2) polynomial interpolation, and the relationships between the two formulations, called respectively Hermite and spline collocation, are investigated. A Hermite block-tridiagonal system for a nonuniform mesh is derived, and the Hermite approach is extended in order to develop a variable-mesh sixth-order block-tridiagonal procedure. It is shown that all results obtained by Hermite development can be recovered by appropriate spline polynomial interpolation. The additional boundary conditions required for these higher-order procedures are also given. Comparative solutions using second-order accurate finite difference and spline and Hermite formulations are presented for the boundary layer on a flat plate, boundary layers with uniform and variable mass transfer, and the viscous incompressible Navier-Stokes equations describing flow in a driven cavity.

Rubin, S. G.↗

Interpolation algorithms and image data artifacts

Interpolation, or resampling coefficients, which are generated from low pass filter Fourier transforms yield more accurate resampled values than those obtained using cubic spline techniques. This is due to the utilization of six data points rather than four as currently used in cubic spline analysis. After resampling functions are applied to image data, artifacts which are similar to ringing may become pronounced. These effects are often present in the original data and the interpolation merely enhances them.

Forman, M. L.↗

Differences between measured and linearly interpolated synoptic variables over a 12-h period during AVE 4

Results of analyses revealed that nonlinear changes or differences formed centers or systems, that were mesosynoptic in nature. These systems correlated well in space with upper level short waves, frontal zones, and radar observed convection, and were very systematic in time and space. Many of the centers of differences were well established in the vertical, extending up to the tropopause. Statistical analysis showed that on the average nonlinear changes were larger in convective areas than nonconvective regions. Errors often exceeding 100 percent were made by assuming variables to change linearly through a 12-h period in areas of thunderstorms, indicating that these nonlinear changes are important in the development of severe weather. Linear changes, however, accounted for more and more of an observed change as the time interval (within the 12-h interpolation period) increased, implying that the accuracy of linear interpolation increased over larger time intervals.

Dupuis, L. R.↗

Finite difference grid generation by multivariate blending function interpolation

The General Interpolants Method (GIM) code which solves the multidimensional Navier-Stokes equations for arbitrary geometric domains is described. The geometry module in the GIM code generates two and three dimensional grids over specified flow regimes, establishes boundary condition information and computes finite difference analogs for use in the GIM code numerical solution module. The technique can be classified as an algebraic equation approach. The geometry package uses multivariate blending function interpolation of vector-values functions which define the shapes of the edges and surfaces bounding the flow domain. By employing blending functions which conform to the cardinality conditions the flow domain may be mapped onto a unit square (2-D) or unit cube (3-D), thus producing an intrinsic coordinate system for the region of interest. The intrinsic coordinate system facilitates grid spacing control to allow for optimum distribution of nodes in the flow domain.

Anderson, P. G.↗

C-1 surface interpolation for scattered data on a sphere

An algorithm is described for constructing a smooth computable function, f, defined over the surface of a sphere and interpolating a set of n data values, u sub i, associated with n locations, P sub i, on the surface of the sphere. The interpolation function, f, will be continuous and have continuous first partial derivatives. The locations, p sub i, are not required to lie on any type of regular grid.

Lawson, C. L.↗

BSPLASH: A three-stage surface interpolant to scattered data

Given N distinct points (X sub i, Y sub i) and N real numbers Z sub i, BSPLASH constructs a function G (x, y) that satisfies G (x sub i, y sub i) = Z sub i for i = 1,..., N. This C(2) interpolant consists of a bicubic spline approximation and Shepard's bivariate interpolant.

Foley, T. A.↗

Optimal interpolation and the Kalman filter

The estimation theory of stochastic-dynamic systems is described and used in a numerical study of optimal interpolation. The general form of data assimilation methods is reviewed. The Kalman-Bucy, KB filter, and optimal interpolation (OI) filters are examined for effectiveness in performance as gain matrices using a one-dimensional form of the shallow-water equations. Control runs in the numerical analyses were performed for a ten-day forecast in concert with the OI method. The effects of optimality, initialization, and assimilation were studied. It was found that correct initialization is necessary in order to localize errors, especially near boundary points. Also, the use of small forecast error growth rates over data-sparse areas was determined to offset inaccurate modeling of correlation functions near boundaries.

Cohn, S.↗

Shape Preserving Spline Interpolation

A rational spline solution to the problem of shape preserving interpolation is discussed. The rational spline is represented in terms of first derivative values at the knots and provides an alternative to the spline-under-tension. The idea of making the shape control parameters dependent on the first derivative unknowns is then explored. The monotonic or convex shape of the interpolation data can then be preserved automatically through the solution of the resulting non-linear consistency equations of the spline.

Gregory, J. A.↗

Interpolation problems in meteor radar analysis, part 7.6A

Meteor echoes come from random points in the observation volume, and are irregularly spaced in time. This precludes the use of fast fourier transformations (FFT) techniques on the raw data to give the spectrum of waves that are present. One way around this obstacle is to restrict our interest to a particular class of waves, and fit a corresponding model to the raw data. It is assumed that there is no horizontal variation across the observation volume for tides, but in the vertical this is certainly not the case. If, in addition, we are interested in other types of waves which may be present and whose periods are unknown, then examining the raw line-of-sight velocities does not tell us how to modify the model, since the line-of-sight direction is not fixed. This is the motivation for interpolation. Interpolation takes a temporal series of line-of-sight velocities, and transforms it to a temporal series of wind velocities for each orthogonal direction. The velocities along a given direction can then be examined readily for any waves in addition to tides.

Tetenbaum, D.↗

An optimized cubic interpolator for image resampling

It is noted that the cubic resampling function is only one member of a family of functions, defined by the single parameter of the slope of the cubic function at its first zero crossing, whose other members are in some cases superior to the standard cubic. This superiority is especially noteworthy with respect to the extent of gray level overshoot induced by the resampling process at high contrast edges. It is shown that there is an optimum member of this 'parametric cubic convolution' family which minimizes the mean-squared radiometric error arising from interpolation. This interpolator requires no additional computation time over the conventional cubic one. These conclusions are supported and illustrated by resampling simulations with both a high resolution digitized aerial image and a Landsat Multispectral Scanner image.

Schowengerdt, R. A.↗