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 37 records · Page 2

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.↗

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↗

An Immersed Boundary method with divergence-free velocity interpolation and force spreading

The Immersed Boundary (IB) method is a mathematical framework for constructing robust numerical methods to study fluid–structure interaction in problems involving an elastic structure immersed in a viscous fluid. The IB formulation uses an Eulerian representation of the fluid and a Lagrangian representation of the structure. The Lagrangian and Eulerian frames are coupled by integral transforms with delta function kernels. The discretized IB equations use approximations to these transforms with regularized delta function kernels to interpolate the fluid velocity to the structure, and to spread structural forces to the fluid. It is well-known that the conventional IB method can suffer from poor volume conservation since the interpolated Lagrangian velocity field is not generally divergence-free, and so this can cause spurious volume changes. In practice, the lack of volume conservation is especially pronounced for cases where there are large pressure differences across thin structural boundaries. The aim of this paper is to greatly reduce the volume error of the IB method by introducing velocity-interpolation and force-spreading schemes with the properties that the interpolated velocity field in which the structure moves is at least $\mathscr{C}$ 1 and satisfies a continuous divergence-free condition, and that the force-spreading operator is the adjoint of the velocity-interpolation operator. We confirm through numerical experiments in two and three spatial dimensions that this new IB method is able to achieve substantial improvement in volume conservation compared to other existing IB methods, at the expense of a modest increase in the computational cost. Further, the new method provides smoother Lagrangian forces (tractions) than traditional IB methods. Finally, the method presented here is restricted to periodic computational domains. Its generalization to non-periodic domains is important future work.

97 MATHEMATICS AND COMPUTING↗

DRIPS: A framework for dimension reduction and interpolation in parameter space

Reduced-order models are often used to describe the behavior of complex systems, whose simulation with a full model is too expensive, or to extract salient features from the full model’s output. We introduce a new model-reduction framework DRIPS (dimension reduction and interpolation in parameter space) that combines the offline local model reduction with the online parameter interpolation of reduced-order bases (ROBs). The offline step of this framework relies on dynamic mode decomposition (DMD) to build a low-rank linear surrogate model, equipped with a local ROB, for quantities of interest derived from the training data generated by repeatedly solving the (nonlinear) high-fidelity model for multiple parameter points. The online step consists of the construction of a parametric reduced-order model for each target/test point in the parameter space, with the interpolation of ROBs done on a Grassman manifold and the interpolation of reduced-order operators done on a matrix manifold. The DMD component enables DRIPS to model (typically low-dimensional) quantities of interest directly, without having to access the (typically high-dimensional and possibly nonlinear) operators in a high-fidelity model that governs the dynamics of the underlying high-dimensional state variables, as required in projection-based reduced-order modeling. A series of numerical experiments suggests that DRIPS yields a model reduction, which is computationally more efficient than the commonly used projection-based proper orthogonal decomposition; it does so without requiring a prior knowledge of the governing equation for quantities of interest. Furthermore, for the nonlinear systems considered, DRIPS is more accurate than Gaussian-process interpolation (Kriging).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analytic error analysis of cross section interpolation methods in nodal diffusion codes - I : Theory

This paper discusses two cross section interpolation methods commonly found in popular nodal codes; the partial derivatives and multiple tables models. The motivation for choosing a model, and thus a case matrix structure, is a trade off between accuracy and computational cost. Due to decades of experience, there are default structures that are sufficient for current light water reactor analysis. However, this is not necessarily the case for advanced reactor designs. Therefore, it is advantageous to understand the sources of error in cross section interpolation models so that the quality of a case matrix may be improved. A mathematical framework for these models is presented in this work that provides a more rigorous connection between the nuclear engineering field's cross section interpolation methods and the broader mathematical field of function approximation. The two cross section models examined in this paper were found to utilize Lagrange interpolation and are a subset of Lagrange tensor products. Classical results of Lagrange polynomial error analysis were then applied to the partial derivative and multiple tables models to derive expressions for the total point-wise error. The analytical results classify the total error into two parts: the model form error and interpolation error. Finally, based on our observations, a better foundation for improving the quality of a case matrix is proposed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Geostatistical interpolation of streambed hydrologic attributes with addition of left censored data and anisotropy

Spatial geostatistical interpolation of point measurements of streambed attributes in the hyporheic zone may be constrained by the streambed anisotropy, and data density and spatial distribution may significantly impact the results. Spatial clustering and low spatial data density can be caused by bedrock outcropping at the streambed limiting installation of in-stream piezometers. This study examines parameter error variability of the geostatistical interpolation using anisotropic interpolation methods and increasing the data density by adding left censored values (i.e., data below measurement limit) to locations where measurements were limited by exposed bedrock lining the streambed. The reduction in relative standard error of the interpolation was determined for the spatial distributions of streambed attributes including hydraulic conductivity, seepage flux, and mercury solute flux measured in two different years along a study reach in East Fork Poplar Creek, Tennessee, USA. Here, two methods to impute the left censored values were compared including the conventional half the detection limit substitution method, and the Stochastic Approximation of Expectation-Maximization (SAEM) algorithm, which both had comparable results. Imputing left censored data increased the data density to recommended ranges, reduced data clustering, increased the spatial dependence for some attributes, and reduced the standard error for each of the three attributes. For the reach considered herein, addition of the left censored values resulted in a larger error reduction than the consideration of anisotropy within the interpolation, which confirms the benefit of data addition to increase data density within data-limited river corridors.

58 GEOSCIENCES↗

Evaluation of Accuracy and Performance of a Bilinear Interpolator with Dense EOS Tables in xRage

This study investigates the performance and accuracy of simulations using air and deuterium equation-of-state (EOS) tables that have been densified coupled with linear interpolation, as opposed to the default rational interpolation used in EOSPAC. EOS tables that are densified by adding in more temperature and density points that have been calculated by the rational function interpolator are able to improve the accuracy of the linear interpolator by over 50%. There was no change in runtime performance for a simulation using a dense EOS table with linear interpolation. In a memory limited case, dense EOS tables had no apparent effect on the simulation runtime or memory usage.

97 MATHEMATICS AND COMPUTING↗

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.↗

Areal interpolation of population projections consistent with different SSPs from 1-km resolution to block level based on USA Structures dataset

Population data are normally collected at various census administrative levels, and areal interpolation of population is often required to transform population to the desired spatial resolution. Building footprint datasets, such as Microsoft building footprints, have proven to be useful in estimating population distribution and can therefore be used for areal interpolation of population. In addition to Microsoft building footprints, the recently released USA Structures dataset provides additional information such as building type and building height for some regions, which may provide valuable information for a better depiction of population distribution and improved population areal interpolation accuracy. In this study, we have conducted areal interpolation of population projections consistent with three different Shared Socioeconomic Pathways (SSP2, SSP3, and SSP5) from 1-km grid cells to block level in Washington state for every ten years from 2020 to 2040 based on USA Structures. We assessed USA Structures-based population downscaling accuracy using U.S. decennial survey data in 2020 under three different downscaling schemes, including population downscaling from census tracts to block groups, from census tracts to blocks, and from block groups to blocks. The resulting accuracies were compared with those based on Microsoft building footprints. The comparison showed that USA Structures achieved higher accuracies across different population density regions and areas with different urbanization extent within our study area.

99 GENERAL AND MISCELLANEOUS↗