Search NASASearch

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.

At least 37 records · Page 2

Interpolation schemes for orbit determination with the global positioning system

This paper demonstrates that the Global Positioning System (GPS) and simple interpolation schemes can be utilized to satisfy typical orbit determination demands of applications satellites. The complete GPS consists of 24 satellites and permits a position fix of a user satellite at any arbitrary instant. The interpolation formulae used in this report fit generalized Keplerian orbits through a number of position fixes. For a given accuracy level the telemetry requirements as measured by the time intervals between position fixes and the computational load of an interpolation as measured by the number of points through which a generalized Keplerian orbit is fitted vary inversely. A set of possible compromises between these two factors is presented. The Phase I GPS consists of 6 satellites and permits a position fix of a user satellite just 36% of the time. It is shown that with this system more sophisticated interpolation schemes which model atmospheric drag and higher degree terms of the earth's gravity field must be employed to obtain accurate orbits.

Argentiero, P.

Modal Interpolation Program, L 215 (INTERP): Supplemental System Design and Maintenance Document - Volume 2

The design, structure, and usage of the modal interpolation program L215 are presented. The program uses modal data sets of arrays containing interpolation coefficients. The interpolation arrays are used to determine displacements at various aerodynamic control points. The displacements consist of translations normal to the aerodynamic surface and surface slopes that are parallel and perpendicular to the free stream direction. Five different interpolation methods are available.

Hirayama, M. Y.

Quantitative analysis of the reconstruction performance of interpolants

The analysis presented provides a quantitative measure of the reconstruction or interpolation performance of linear, shift-invariant interpolants. The performance criterion is the mean square error of the difference between the sampled and reconstructed functions. The analysis is applicable to reconstruction algorithms used in image processing and to many types of splines used in numerical analysis and computer graphics. When formulated in the frequency domain, the mean square error clearly separates the contribution of the interpolation method from the contribution of the sampled data. The equations provide a rational basis for selecting an optimal interpolant; that is, one which minimizes the mean square error. The analysis has been applied to a selection of frequently used data splines and reconstruction algorithms: parametric cubic and quintic Hermite splines, exponential and nu splines (including the special case of the cubic spline), parametric cubic convolution, Keys' fourth-order cubic, and a cubic with a discontinuous first derivative. The emphasis in this paper is on the image-dependent case in which no a priori knowledge of the frequency spectrum of the sampled function is assumed.

Lansing, Donald L.

High degree interpolation polynomial in Newton form

Polynomial interpolation is an essential subject in numerical analysis. Dealing with a real interval, it is well known that even if f(x) is an analytic function, interpolating at equally spaced points can diverge. On the other hand, interpolating at the zeroes of the corresponding Chebyshev polynomial will converge. Using the Newton formula, this result of convergence is true only on the theoretical level. It is shown that the algorithm which computes the divided differences is numerically stable only if: (1) the interpolating points are arranged in a different order, and (2) the size of the interval is 4.

Tal-Ezer, Hillel

Interpolation methods for shaped reflector analysis

The diffraction analysis of reflector surfaces which are described only at a discrete set of locations usually leads to the requirement of an interpolation to determine the surface characteristics over a continuum of locations. Two methods of interpolation, the global and the local methods, are presented. The global interpolation representation is a closed-form or series expression valid over the entire surface. The coefficients of a series expression are found by an integration of all of the raw data. Since the number of coefficients used to describe the surface is much smaller than the number of raw data points, the integration effectively provides a smoothing of the raw data. The local interpolation provides a closed-form expression for only a small area of the reflector surface. The subreflector is divided into sectors each of which has constant discretized data. Each area segment is then locally described by a two-dimensional quadratic surface. The second derivative data give the desired smoothed values.

Galindo-Israel, Victor

The Grand Tour via Geodesic Interpolation of 2-frames

Grand tours are a class of methods for visualizing multivariate data, or any finite set of points in n-space. The idea is to create an animation of data projections by moving a 2-dimensional projection plane through n-space. The path of planes used in the animation is chosen so that it becomes dense, that is, it comes arbitrarily close to any plane. One of the original inspirations for the grand tour was the experience of trying to comprehend an abstract sculpture in a museum. One tends to walk around the sculpture, viewing it from many different angles. A useful class of grand tours is based on the idea of continuously interpolating an infinite sequence of randomly chosen planes. Visiting randomly (more precisely: uniformly) distributed planes guarantees denseness of the interpolating path. In computer implementations, 2-dimensional orthogonal projections are specified by two 1-dimensional projections which map to the horizontal and vertical screen dimensions, respectively. Hence, a grand tour is specified by a path of pairs of orthonormal projection vectors. This paper describes an interpolation scheme for smoothly connecting two pairs of orthonormal vectors, and thus for constructing interpolating grand tours. The scheme is optimal in the sense that connecting paths are geodesics in a natural Riemannian geometry.

Asimov, Daniel

Smooth Phase Interpolated Keying

Smooth phase interpolated keying (SPIK) is an improved method of computing smooth phase-modulation waveforms for radio communication systems that convey digital information. SPIK is applicable to a variety of phase-shift-keying (PSK) modulation schemes, including quaternary PSK (QPSK), octonary PSK (8PSK), and 16PSK. In comparison with a related prior method, SPIK offers advantages of better performance and less complexity of implementation. In a PSK scheme, the underlying information waveform that one seeks to convey consists of discrete rectangular steps, but the spectral width of such a waveform is excessive for practical radio communication. Therefore, the problem is to smooth the step phase waveform in such a manner as to maintain power and bandwidth efficiency without incurring an unacceptably large error rate and without introducing undesired variations in the amplitude of the affected radio signal. Although the ideal constellation of PSK phasor points does not cause amplitude variations, filtering of the modulation waveform (in which, typically, a rectangular pulse is converted to a square-root raised cosine pulse) causes amplitude fluctuations. If a power-efficient nonlinear amplifier is used in the radio communication system, the fluctuating-amplitude signal can undergo significant spectral regrowth, thus compromising the bandwidth efficiency of the system. In the related prior method, one seeks to solve the problem in a procedure that comprises two major steps: phase-value generation and phase interpolation. SPIK follows the two-step approach of the related prior method, but the details of the steps are different. In the phase-value-generation step, the phase values of symbols in the PSK constellation are determined by a phase function that is said to be maximally smooth and that is chosen to minimize the spectral spread of the modulated signal. In this step, the constellation is divided into two groups by assigning, to information symbols, phase values that result in equal numbers of clockwise and counter-clockwise phase rotations for equally likely symbols. The purpose served by assigning phase values in this way is to prevent unnecessary generation of spectral lines and prevent net shifts of the carrier signal. In the phase-interpolation step, the smooth phase values are interpolated over a number, n, of consecutive symbols (including the present symbol) by means of an unconventional spline curve fit.

Borah, Deva K.

Interlaminar Stresses by Refined Beam Theories and the Sinc Method Based on Interpolation of Highest Derivative

Computation of interlaminar stresses from the higher-order shear and normal deformable beam theory and the refined zigzag theory was performed using the Sinc method based on Interpolation of Highest Derivative. The Sinc method based on Interpolation of Highest Derivative was proposed as an efficient method for determining through-the-thickness variations of interlaminar stresses from one- and two-dimensional analysis by integration of the equilibrium equations of three-dimensional elasticity. However, the use of traditional equivalent single layer theories often results in inaccuracies near the boundaries and when the lamina have extremely large differences in material properties. Interlaminar stresses in symmetric cross-ply laminated beams were obtained by solving the higher-order shear and normal deformable beam theory and the refined zigzag theory with the Sinc method based on Interpolation of Highest Derivative. Interlaminar stresses and bending stresses from the present approach were compared with a detailed finite element solution obtained by ABAQUS/Standard. The results illustrate the ease with which the Sinc method based on Interpolation of Highest Derivative can be used to obtain the through-the-thickness distributions of interlaminar stresses from the beam theories. Moreover, the results indicate that the refined zigzag theory is a substantial improvement over the Timoshenko beam theory due to the piecewise continuous displacement field which more accurately represents interlaminar discontinuities in the strain field. The higher-order shear and normal deformable beam theory more accurately captures the interlaminar stresses at the ends of the beam because it allows transverse normal strain. However, the continuous nature of the displacement field requires a large number of monomial terms before the interlaminar stresses are computed as accurately as the refined zigzag theory.

Slemp, Wesley C. H.

A Zero-order Hold Approach for Fractional-delay Interpolation in Auralization

During the signal processing chain of an auralization simulating the propagation of a sound from a moving source to a stationary receiver, it is often necessary to interpolate between the samples of the source signal in order to arrive at uniformly-spaced samples at the receiver. In some cases, this interpolation is done in the receiver time frame – where the “input” samples of the source have become irregularly spaced due to time dilation effects. Canonical band-limited interpolation methods (i.e., sinc and sinc-derived approaches) cannot be applied in this case as they rely on having a uniformly-spaced input. The use of geometric interpolation methods that can handle irregularly-spaced input may not be grounded in signal processing principles and may produce unwanted artifacts and noise. This presentation outlines the possibility of embedding an irregularly-spaced zero-order hold signal within a highly over-sampled uniformly-spaced signal, and then processing down to the desired sampling rate through successive decimations. Initial distortion and noise characteristics of the approach are shown for some basic propagation geometries. The possible benefits of using such an approach in an auralization scheme with a time-varying Doppler shift are discussed including: the prevention of aliasing, processing time advantages, and the possibility for asynchronous processing.

Auralization

Characterizing Spatiotemporal Uncertainty in Interpolated Meteorological Data

Interpolated meteorological data invariably contain errors. These errors have structure in time and space, particularly autocorrelation, which can cause the effects of errors to compound when model outputs are aggregated temporally or spatially. One way to account for this uncertainty is with a probabilistic model from which samples can be drawn that are coherent with respect to underlying spatial and temporal covariance structure. This work describes a probabilistic method for spatial interpolation of point-wise meteorological time series. Observational data from weather stations are generally sparse in space and dense in time (but sometimes missing). The method works by projecting time series onto orthogonal basis vectors and spatially interpolating each resulting component independently. Under suitable assumptions, and data transformations to better satisfy those assumptions, Gaussian process regression provides a complete description of the joint predictive distribution over a Gaussian random field. Spatiotemporally coherent realizations are generated as the sum of conditional (spatial) simulations of each orthogonal (temporal) component. Data-derived and generic orthogonal bases are considered. In addition to spatial interpolation, imputation of missing observational data is examined. The method is applied using near-surface air temperature over the Western United States and validated by comparing theoretical versus actual coverage of predictive distributions and analyzing the degree to which spatial and temporal covariance structure is reproduced. Computational considerations, relating to conditional simulation of random fields, are also addressed.

Conor T Doherty

High order interpolation of magnetic fields with vector potential reconstruction for particle simulations

We propose a method for interpolating divergence-free continuous magnetic fields via vector potential reconstruction using Hermite interpolation, which ensures high-order continuity for applications requiring adaptive, high-order ordinary differential equation (ODE) integrators, such as the Dormand-Prince method. The method provides C(m) continuity and achieves high-order accuracy, making it particularly suited for particle trajectory integration and Poincaré section analysis under optimal integration order and timestep adjustments. Through numerical experiments, we demonstrate that the Hermite interpolation method preserves volume and continuity, which are critical for conserving toroidal canonical momentum and magnetic moment in guiding center simulations, especially over long-term trajectory integration. Furthermore, we analyze the impact of insufficient derivative continuity on Runge-Kutta schemes and show how it degrades accuracy at low error tolerances, introducing discontinuity-induced truncation errors. Lastly, we demonstrate performant Poincaré section analysis in two relevant settings of field data collocated from finite element meshes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY

Improved method for temporally interpolating radiosonde profiles in the convective boundary layer

A significantly improved technique for temporally interpolating radiosonde (RS) profiles of potential temperature and water vapor mixing ratio in the planetary boundary layer during daytime is introduced. The key innovation of this technique is its operation on a height grid normalized with the planetary boundary layer height. This study utilized a three-month dataset of three-hourly soundings from the Atmospheric Radiation Measurement Facility's Southern Great Plains site. The technique was evaluated for convective boundary layer cases, with the necessary boundary layer height data obtained from a ground-based infrared spectrometer. A total of 79 comparisons were conducted between reference soundings and interpolated profiles that did and did not employ height normalization. The results demonstrated a substantial improvement in the representation of interpolated profiles using the new technique, characterized by enhanced correlation, improved amplitude representation, and reduced bias for potential temperature, as well as improved correlation and reduced bias for water vapor mixing ratio.

convective boundary layer

Optical Flow for Intermediate Frame Interpolation of Multispectral Geostationary Satellite Data

Applications in areas such as weather tracking and modeling, ecosystem monitoring, wildfire detection, and land-cover change are heavily dependent on spatial and temporal resolutions of satellite observations. However, there are typically trade-offs between spatial and temporal resolutions in dataset selection. For instance, geostationary weather tracking satellites are designed to take snapshots many times throughout the day but sensor hardware limits data collection. In this work we tackle this limitation, developing a method for temporal upsampling of multi-spectral satellite imagery using optical flow video interpolation deep convolutional neural networks. The presented model, extends Super SloMo (SSM) from single optical flow estimates to multichannel where flows are computed per band. We apply this technique on 8 multi-spectral bands of NOAA/NASA's GOES-16 mesoscale dataset to temporally enhance full disk hemispheric snapshots from 15 minutes to 1 minute. Through extensive experimentation, we show SSM vastly outperforms the linear interpolation baseline and that multichannel optical flows improves performance on GOES-16. A visual analysis of optical flow vectors clearly identifies hurricanes and large-scale atmospheric dynamics. Furthermore, we discuss challenges and open questions related to optical flow and temporal interpolation of multispectral geostationary satellite imagery.

Optical Flow

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

97 MATHEMATICS AND COMPUTING

Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms

One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by the under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. We propose a new way to update the quadratic model by minimizing the $H^{2}$ norm of the difference between neighboring quadratic models. The motivation for applying the $H^{2}$ norm is given. The theoretical properties of our new updating technique are also presented. We propose the projection in the sense of $H^{2}$ norm and the interpolation error analysis of our model function. We obtain the coefficients of the quadratic model function using the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show the advantages of our model on the test set considered, and the derivative-free algorithms based on our least $H^{2}$ norm updating quadratic model functions can solve test problems with fewer function evaluations than the algorithm based on the least Frobenius norm updating model and the other compared methods.

derivative-free optimization

Curvilinear bicubic spline fit interpolation scheme

Modification of the rectangular bicubic spline fit interpolation scheme so as to make it suitable for use with a polar grid pattern. In the proposed modified scheme the interpolation function is expressed in terms of the radial length and the arc length, and the shape of the patch, which is a wedge or a truncated wedge, is taken into account implicitly. Examples are presented in which the proposed interpolation scheme was used to reproduce the equations of a hemisphere.

Chi, C.

Error in interpolation and choice of the range of discreteness in measurements in a hydrophysical field

Errors in interpolation and the choosing of the range of discreteness when making measurements in a hydrophysical field are discussed. Equations for optimum interpolating based on the theory of linear interpolation of stationary random sequences are presented; analogous equations are derived for the case of data collected at stations located at the apices of a right triangle.

Zudin, O. F.

Spectral interpolation - Zero fill or convolution

Zero fill, or augmentation by zeros, is a method used in conjunction with fast Fourier transforms to obtain spectral spacing at intervals closer than obtainable from the original input data set. In the present paper, an interpolation technique (interpolation by repetitive convolution) is proposed which yields values accurate enough for plotting purposes and which lie within the limits of calibration accuracies. The technique is shown to operate faster than zero fill, since fewer operations are required. The major advantages of interpolation by repetitive convolution are that efficient use of memory is possible (thus avoiding the difficulties encountered in decimation in time FFTs) and that is is easy to implement.

Forman, M. L.