Search NASA⌕ Search

SEARCH · Search NASA

Results for “Polynomial 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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

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↗
NASA NTRS1977

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

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

A digital-to-analog conversion circuit using third-order polynomial interpolation

Zero- and third-order digital-to-analog conversion techniques are described, and the theoretical error performances are compared. The design equations and procedures for constructing a third-order digital-to-analog converter by using analog design elements are presented. Both a zero- and a third-order digital-to-analog converter were built, and the performances are compared with various signal inputs.

Dotson, W. P., Jr.↗
NASA NTRS1995

The construction of high-accuracy schemes for acoustic equations

An accuracy analysis of various high order schemes is performed from an interpolation point of view. The analysis indicates that classical high order finite difference schemes, which use polynomial interpolation, hold high accuracy only at nodes and are therefore not suitable for time-dependent problems. Thus, some schemes improve their numerical accuracy within grid cells by the near-minimax approximation method, but their practical significance is degraded by maintaining the same stencil as classical schemes. One-step methods in space discretization, which use piecewise polynomial interpolation and involve data at only two points, can generate a uniform accuracy over the whole grid cell and avoid spurious roots. As a result, they are more accurate and efficient than multistep methods. In particular, the Cubic-Interpolated Psuedoparticle (CIP) scheme is recommended for computational acoustics.

Tang, Lei↗
NASA NTRS1993

Sensitivity Analysis of the Static Aeroelastic Response of a Wing

A technique to obtain the sensitivity of the static aeroelastic response of a three dimensional wing model is designed and implemented. The formulation is quite general and accepts any aerodynamic and structural analysis capability. A program to combine the discipline level, or local, sensitivities into global sensitivity derivatives is developed. A variety of representations of the wing pressure field are developed and tested to determine the most accurate and efficient scheme for representing the field outside of the aerodynamic code. Chebyshev polynomials are used to globally fit the pressure field. This approach had some difficulties in representing local variations in the field, so a variety of local interpolation polynomial pressure representations are also implemented. These panel based representations use a constant pressure value, a bilinearly interpolated value. or a biquadraticallv interpolated value. The interpolation polynomial approaches do an excellent job of reducing the numerical problems of the global approach for comparable computational effort. Regardless of the pressure representation used. sensitivity and response results with excellent accuracy have been produced for large integrated quantities such as wing tip deflection and trim angle of attack. The sensitivities of such things as individual generalized displacements have been found with fair accuracy. In general, accuracy is found to be proportional to the relative size of the derivatives to the quantity itself.

Eldred, Lloyd B.↗
NASA NTRS1998

A Comparison of Approximation Modeling Techniques: Polynomial Versus Interpolating Models

Two methods of creating approximation models are compared through the calculation of the modeling accuracy on test problems involving one, five, and ten independent variables. Here, the test problems are representative of the modeling challenges typically encountered in realistic engineering optimization problems. The first approximation model is a quadratic polynomial created using the method of least squares. This type of polynomial model has seen considerable use in recent engineering optimization studies due to its computational simplicity and ease of use. However, quadratic polynomial models may be of limited accuracy when the response data to be modeled have multiple local extrema. The second approximation model employs an interpolation scheme known as kriging developed in the fields of spatial statistics and geostatistics. This class of interpolating model has the flexibility to model response data with multiple local extrema. However, this flexibility is obtained at an increase in computational expense and a decrease in ease of use. The intent of this study is to provide an initial exploration of the accuracy and modeling capabilities of these two approximation methods.

Giunta, Anthony A.↗
NASA NTRS2010

A Final Approach Trajectory Model for Current Operations

Predicting accurate trajectories with limited intent information is a challenge faced by air traffic management decision support tools in operation today. One such tool is the FAA's Terminal Proximity Alert system which is intended to assist controllers in maintaining safe separation of arrival aircraft during final approach. In an effort to improve the performance of such tools, two final approach trajectory models are proposed; one based on polynomial interpolation, the other on the Fourier transform. These models were tested against actual traffic data and used to study effects of the key final approach trajectory modeling parameters of wind, aircraft type, and weight class, on trajectory prediction accuracy. Using only the limited intent data available to today's ATM system, both the polynomial interpolation and Fourier transform models showed improved trajectory prediction accuracy over a baseline dead reckoning model. Analysis of actual arrival traffic showed that this improved trajectory prediction accuracy leads to improved inter-arrival separation prediction accuracy for longer look ahead times. The difference in mean inter-arrival separation prediction error between the Fourier transform and dead reckoning models was 0.2 nmi for a look ahead time of 120 sec, a 33 percent improvement, with a corresponding 32 percent improvement in standard deviation.

Gong, Chester↗
DOE OSTI2024

An Envelope Time Synchronous Averaging for Wind Turbine Gearbox Fault Diagnosis

Vibration-based condition monitoring techniques are widely used for diagnosing faults in rotating machines. These techniques are implemented in the time domain, the frequency domain, or both. However, the composite and noisy nature of the raw data collected requires a preprocessing stage such as filtering and decomposition using in-depth processing techniques. Moreover, these methods require good frequency resolution and involve examining a broad frequency range to discern both healthy and faulty cases. In this work, we introduce a simple and fast diagnostic scheme for wind turbine gear teeth wear based on time domain analysis. The proposed method is based on the local minima interpolation of a filtered version of the vibration signal following time synchronous averaging (TSA) technique. Given tachometer signal, the TSA of the vibration data is performed using MTALAB software. Then, local minima of the filtered signal are interpolated using the Piecewise Cubic Hermite Interpolating Polynomial (PCHIP) function. The variance of the interpolated curve built a gear fault index. The derived fault index resulting of the proposed technique allows a substantial distinction between the healthy and faulty cases. Its efficiency is validated using 10 real-world datasets of vibration stemmed from a wind turbine planetary gearbox. The proposed method boasts a low computation time and ease of interpretation, specifically beneficial for gearbox fault diagnosis purposes.

fault diagnosis↗
DOE OSTI2020

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Curvilinear-Interpolation Program

INTERP2 is interactive program solving interpolation problems quickly and accurately. Solves for unknown based on true relationship among given values, whether linear or nonlinear. Using Lagrange interpolating polynomial, INTERP2 "draws" curve through input data points and interpolates to obtain f(x) for known x expediently. Written in BASIC.

Coppi, Michael J.↗
NASA NTRS2023

On Hermite Interpolation using Bernstein Polynomials for Trajectory Generation

This work presents a solution to the two-point Hermite interpolation problem using Bernstein polynomials. The Hermite interpolation problem is of particular interest in aerospace applications where boundary conditions for trajectories often specify derivative constraints. In the examples shown, a trajectory will be generated between an initial condition and a final condition. For example, a trajectory is generated that connects an aircraft’s current position and velocity with a point on the runway at a desired landing velocity. The numerical stability of the proposed algorithms is analyzed empirically.

Bezier curves↗
NASA NTRS1992

Design of an essentially non-oscillatory reconstruction procedure in finite-element type meshes

An essentially non oscillatory reconstruction for functions defined on finite element type meshes is designed. Two related problems are studied: the interpolation of possibly unsmooth multivariate functions on arbitary meshes and the reconstruction of a function from its averages in the control volumes surrounding the nodes of the mesh. Concerning the first problem, the behavior of the highest coefficients of two polynomial interpolations of a function that may admit discontinuities of locally regular curves is studied: the Lagrange interpolation and an approximation such that the mean of the polynomial on any control volume is equal to that of the function to be approximated. This enables the best stencil for the approximation to be chosen. The choice of the smallest possible number of stencils is addressed. Concerning the reconstruction problem, two methods were studied: one based on an adaptation of the so called reconstruction via deconvolution method to irregular meshes and one that lies on the approximation on the mean as defined above. The first method is conservative up to a quadrature formula and the second one is exactly conservative. The two methods have the expected order of accuracy, but the second one is much less expensive than the first one. Some numerical examples are given which demonstrate the efficiency of the reconstruction.

Abgrall, Remi↗
NASA NTRS1994

The Flux-integral Method for Multidimensional Convection and Diffusion

The flux-integral method is a procedure for constructing an explicit, single-step, forward-in-time, conservative, control volume update of the unsteady, multidimensional convection-diffusion equation. The convective plus diffusive flux at each face of a control-volume cell is estimated by integrating the transported variable and its face-normal derivative over the volume swept out by the convecting velocity field. This yields a unique description of the fluxes, whereas other conservative methods rely on nonunique, arbitrary pseudoflux-difference splitting procedures. The accuracy of the resulting scheme depends on the form of the subcell interpolation assumed, given cell-average data. Cellwise constant behavior results in a (very artificially diffusive) first-order convection scheme. Second-order convection-diffusion schemes correspond to cellwise linear (or bilinear) subcell interpolation. Cellwise quadratic subcell interpolants generate a highly accurate convection-diffusion scheme with excellent phase accuracy. Under constant-coefficient conditions, this is a uniformly third-order polynomial interpolation algorithm (UTOPIA).

Leonard, B. P.↗
DOE OSTI2023

Computer-controlled finishing via dynamically constraint position-velocity-time scheduler

In a Computer Numerical Controlled (CNC) finishing process, the target material removal from an optical surface is guided by the convolution between the influence function of a machine tool and its dwell time at certain points over the surface. To reduce dynamics stressing and increase machining efficiency, the dwell time must be converted to varying velocities, which are the actual inputs to the machine tool controller. Conventionally, the conversion assumed constant acceleration and relied on linear motion interpolation, which caused discontinuities in velocities. This unsmooth motion affects the material removal distribution, and, thus, the accuracy of the finished surface shape. Many modern CNC machines support the smoother, cubic-polynomial interpolated Position-Velocity-Time (PVT) motion mode; however, the conventional scheduler may fail to provide suitable velocities for the PVT. Here in this study answers this challenge by proposing a novel PVT-based velocity scheduler that achieves smooth motion while considering CNC dynamic limits. Firstly, the principle of the PVT is explained, and the PVT-based velocity scheduler is formulated. Secondly, a quadratic programming is used to optimize the velocities by imposing the CNC dynamic constraints and the C 1 continuities (zeroth and first derivatives are continuous) simultaneously. Thirdly, the smoothness and accuracy of the scheduled velocities are studied on different kinds of tool paths via simulation. Finally, a sub-0.3 nm level surface finishing experiment using ion beam figuring is demonstrated to verify the feasibility of the proposed method. The PVT-based scheduler and simulator code is open-sourced.

36 MATERIALS SCIENCE↗
DOE OSTI2024

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↗