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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

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

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

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

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

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↗
DOE OSTI2025

Leveraging interpolation models and error bounds for verifiable scientific machine learning

Effective verification and validation techniques for modern scientific machine learning workflows are challenging to devise. Statistical methods are abundant and easily deployed, but often rely on speculative assumptions about the data and methods involved. Error bounds for classical interpolation techniques can provide mathematically rigorous estimates of accuracy, but often are difficult or impractical to determine computationally. Here, in this work, we present a best-of-both-worlds approach to verifiable scientific machine learning by demonstrating that (1) multiple standard interpolation techniques have informative error bounds that can be computed or estimated efficiently; (2) comparative performance among distinct interpolants can aid in validation goals; (3) deploying interpolation methods on latent spaces generated by deep learning techniques enables some interpretability for black-box models. We present a detailed case study of our approach for predicting lift-drag ratios from airfoil images. Code developed for this work is available in a public Github repository.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Interpolation of property-values between electron numbers is inconsistent with ensemble averaging

In this work we explore the physical foundations of models that study the variation of the ground state energy with respect to the number of electrons (E vs. N models), in terms of general grand-canonical (GC) ensemble formulations. In particular, we focus on E vs. N models that interpolate the energy between states with integer number of electrons. We show that if the interpolation of the energy corresponds to a GC ensemble, it is not differentiable. Conversely, if the interpolation is smooth, then it cannot be formulated as any GC ensemble. This proves that interpolation of electronic properties between integer electron numbers is inconsistent with any form of ensemble averaging. This emphasizes the role of derivative discontinuities and the critical role of a subsystem’s surroundings in determining its properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

A New Class of AMG Interpolation Methods Based on Matrix-Matrix Multiplications

A new class of distance-two interpolation methods for algebraic multigrid (AMG) that can be formulated in terms of sparse matrix-matrix multiplications is presented and analyzed. Compared with similar distance-two prolongation operators, the proposed algorithms exhibit improved efficiency and portability to various computing platforms, since they allow one to easily exploit existing high-performance sparse matrix kernels. The new interpolation methods have been implemented in hypre, a widely used parallel multigrid solver library. With the proposed interpolations, the overall time of hypre's BoomerAMG setup can be considerably reduced, while sustaining equivalent, sometimes improved, convergence rates. Numerical results for a variety of test problems on parallel machines are presented that support the superiority of the proposed interpolation operators over the existing ones in hypre.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Analytic error analysis of cross section interpolation methods in nodal diffusion codes - II: Numerical results

This paper is the second part of a two-part paper that documents the numerical results for the partial derivatives model presented in part I. In this paper, we derive the error bounds for the analytical point-wise error expression and verify our bounds with numerical experiments. The point-wise error expressions make available, and bound, the sources that contribute to the total error of the interpolated cross section in terms of the Lagrange interpolation errors and the model form error. MPACT is used to generate two-group homogenized cross sections for Westinghouse's AP1000 Region 4 lattice to evaluate the accuracy of the bounds. Error bounds calculated over a grid are compared to numerical data for uni-variate and multi-variate interpolation. The point-wise error bounds of a typical case matrix - two branches in each state variable - are displayed for bi-variate interpolation in the state variables: moderator density, fuel temperature, and boron concentration. The error bounds are shown to be highly accurate compared to numerical results, and in accordance with the underlying physics. We then discuss and show how the sources of error contribute to the total error, and consider the improvement of each error source. Finally, we mention future work such as propagating our cross section error bounds through a reactivity calculation. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2015

EOS Interpolation and Thermodynamic Consistency

As discussed in LA-UR-08-05451, the current interpolator used by Grizzly, OpenSesame, EOSPAC, and similar routines is the rational function interpolator from Kerley. While the rational function interpolator is well-suited for interpolation on sparse grids with logarithmic spacing and it preserves monotonicity in 1-d, it has some known problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRSDate not supplied

Interpolant Improvements and Lessons Learned

This presentation is for the OpenMDAO workshop 2022 and updates users on recent improvements to interpolant methods. Specifically, we discuss computational improvements, visualization capabilities, and suggested best practices for using interpolants. The term interpolants is used synonymously with metamodels and surrogate models. The goal of the presentation is to increase adoption of efficient interpolant methods and increase users’ awareness to built-in features within OpenMDAO.

Multidisciplinary Design Optimization↗
DOE OSTI2022

Adaptive clipping‐and‐redistribution algorithms for bounded and conservative high‐order interpolations applied to discontinuous and reactive flows

Abstract A new adaptive clipping‐and‐redistribution method is presented which provides bounds‐preservation for multidimensional interpolation in the context of high‐order finite‐volume discretizations with adaptive mesh refinement (AMR). The underlying finite‐volume method (FVM) for the computational fluid dynamics applications is fourth‐order accurate for smooth solutions and utilizes AMR for computational efficiency in solving multiscale problems involving turbulence and combustion. High‐order interpolation between different AMR levels is required. However, this operation often leads to numerical issues because combustion species must have physical bounds preserved. The present study overcomes two major challenges in the development of the high‐order interpolation method. First, the method needs to be bound‐preserving near extrema or discontinuities to prevent the emergence of unphysical oscillations while maintaining fourth‐order accuracy in smooth flows. Second, the method needs to satisfy the conservation requirement in multiple dimensions, particularly in the context of curvilinear coordinate transformations. Additionally, the method is designed to be localized and computationally inexpensive. The new interpolation scheme is demonstrated by solving reacting flows, which are extremely sensitive to unphysical overshoots in conserved quantities. The test problems are shock‐induced ‐ combustion and a ‐air flame in a practical bluff‐body combustor. Results show the method prevents new extrema near discontinuities while maintaining high‐order accuracy in smooth regions. In particular, the method is extremely beneficial for combustion with stiff chemistry. With the proposed new method, even if flame fronts cross AMR interfaces or new grids are created in the vicinity of the flame, solution stability is retained.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Nonparametric, data-based kernel interpolation for particle-tracking simulations and kernel density estimation

Traditional interpolation techniques for particle tracking include binning and convolutional formulas that use pre-determined (i.e., closed-form, parameteric) kernels. In many instances, the particles are introduced as point sources in time and space, so the cloud of particles (either in space or time) is a discrete representation of the Green’s function of an underlying PDE. As such, each particle is a sample from the Green’s function; therefore, each particle should be distributed according to the Green’s function. In short, the kernel of a convolutional interpolation of the particle sample “cloud” should be a replica of the cloud itself. This idea gives rise to an iterative method by which the form of the kernel may be discerned in the process of interpolating the Green’s function. When the Green’s function is a density, this method is broadly applicable to interpolating a kernel density estimate based on random data drawn from a single distribution. We formulate and construct the algorithm and demonstrate its ability to perform kernel density estimation of skewed and/or heavy-tailed data including breakthrough curves.

42 ENGINEERING↗
DOE OSTI2022

Augmentation of MS/MS Libraries with Spectral Interpolation for Improved Identification

Tandem mass spectrometry (MS/MS) is a primary tool for identification of small molecules and metabolites where resultant spectra are most commonly identified by matching them with spectra in MS/MS reference libraries. The high degree of variability in MS/MS spectrum acquisition techniques and parameters creates a significant challenge for building standardized reference libraries. Here we present a method to improve the usefulness of existing MS/MS libraries by augmenting available experimental spectra datasets with statistically interpolated spectra at unreported collision energies. We find that highly accurate spectral approximations can be interpolated from as few as three experimental spectra and that the interpolated spectra will be consistent with true spectra gathered from the same instrument as the experimental spectra. Supplementing existing spectral databases with interpolated spectra yields consistent improvements to identification accuracy on a range of instruments and precursor types. Applying this method yields significant improvements (~10% more spectra correctly identified) on large datasets (2,000 - 10,000 spectra), indicating this is a quick yet adept tool for improving spectral matching in situations where available reference libraries are not yet sufficient. We also find improvements of matching spectra across instrument types (between an Agilent Q-TOF and an Orbitrap Elite), at high collision energies (50 - 90 eV), and with smaller datasets available through MassBank.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Geodesic interpolation for reaction pathways

The development of high throughput reaction discovery methods such as the ab initio nanoreactor demands massive numbers of reaction rate calculations through the optimization of minimum energy reaction paths. These are often generated from interpolations between the reactant and product endpoint geometries. Unfortunately, straightforward interpolation in Cartesian coordinates often leads to poor approximations that lead to slow convergence. In this work, we reformulate the problem of interpolation between endpoint geometries as a search for the geodesic curve on a Riemannian manifold. We show that the perceived performance difference of interpolation methods in different coordinates is the result of an implicit metric change. Accounting for the metric explicitly allows us to obtain good results in Cartesian coordinates, bypassing the difficulties caused by redundant coordinates. Using only geometric information, we are able to generate paths from reactants to products which are remarkably close to the true minimum energy path. In conclusion, we show that these geodesic paths are excellent starting guesses for minimum energy path algorithms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Interpolation Methods to Enable Fast and Accurate EMT Simulation of PV Inverters

In this paper, interpolation methods to enable fast simulation of photovoltaic (PV) inverters are proposed. The interpolation methods are based on the event-driven interpolating method that can be introduced in the simulation model to run the model at a higher timestep while maintaining accuracy. The proposed methods are tested on a neutral point clamp (NPC) converter and a two-level converter (2LC) that are typically used in large-scale PV plants. The interpolation methods are integrated into the NPC and 2LC simulation models in PSCAD/Fortran and RSCAD C platforms. These models are tested at different simulation timesteps in off-line and real-time simulation platforms PSCAD and RSCAD respectively.

Marthi, Phani Ratna Vanamali↗
DOE OSTI2018

A Multi-Step Adaptive Interpolation Approach to Mitigating the Impact of Nonlinearity on Dynamic State Estimation

Accurate estimation of dynamic states (such as synchronous machine rotor angle and speed) is critical for monitoring and controlling transient stability. Extended Kalman filter (EKF)--based approaches have been developed for estimating dynamic states. In order to improve the EKF's performance in estimating dynamic states of a synchronous machine, this paper proposes a multi-step adaptive interpolation (MSAI) approach to achieve balance between estimation accuracy and computational time. This approach consists of three major steps. First, two indexes are calculated to quantify the nonlinearity of the state transition function and measurement function, respectively. Second, based on the nonlinearity indexes, the interpolation factor is determined using a finite state machine model. And finally, to mitigate the negative impact of nonlinearity on the estimation accuracy, pseudo-measurements are added between consecutive measurements through linear interpolation. A simple example is used to validate the proposed nonlinear indexes. The two-area four-machine system and 16-machine 68-bus system are used to evaluate the effectiveness of the proposed MSAI approach. It is shown through the Monte-Carlo method that the estimation accuracy can be improved through interpolation. In addition, a good trade-off between estimation accuracy and computational time can be achieved effectively through the proposed MSAI approach.

Dynamic State Estimation, extended Kalman filter (↗
DOE OSTI2022

LaplaceInterpolation.jl: A Julia package for fast interpolation on a grid

We implement a linear-time algorithm for interpolation on a regular multidimensional grid in the Julia language. The algorithm is an approximate Laplace interpolation (Press, 1992) when no parameters are given; and when parameters m ∈ Z and ϵ > 0 are set, the interpolant approximates a Matérn kernel, of which radial basis functions and polyharmonic splines are a special case. We implement, in addition, Neumann, Dirichlet (trivial), and average boundary conditions with potentially different aspect ratios in the different dimensions. The interpolant functions in arbitrary dimensions.

97 MATHEMATICS AND COMPUTING↗