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 109 records · Page 6

A wavelet-optimized, very high order adaptive grid and order numerical method

Differencing operators of arbitrarily high order can be constructed by interpolating a polynomial through a set of data followed by differentiation of this polynomial and finally evaluation of the polynomial at the point where a derivative approximation is desired. Furthermore, the interpolating polynomial can be constructed from algebraic, trigonometric, or, perhaps exponential polynomials. This paper begins with a comparison of such differencing operator construction. Next, the issue of proper grids for high order polynomials is addressed. Finally, an adaptive numerical method is introduced which adapts the numerical grid and the order of the differencing operator depending on the data. The numerical grid adaptation is performed on a Chebyshev grid. That is, at each level of refinement the grid is a Chebvshev grid and this grid is refined locally based on wavelet analysis.

Jameson, Leland↗

Polynominal Interpolation Methods for Viscous Flow Calculations

Higher-order collocation procedures resulting in tridiagonal matrix systems are derived from polynomial spline interpolation and by Hermitian (Taylor series) finite-difference discretization. The similarities and special features of these different developments are discussed. The governing systems apply for both uniform and variable meshes. Hybrid schemes resulting from two different polynomial approximations for the first and second derivatives lead to a nonuniform mesh extension of the so-called compact or Pad? difference technique (Hermite 4). A variety of fourth-order methods are described and the Hermitian approach is extended to sixth-order (Hermite 6). The appropriate spline boundary conditions are derived for all procedures. For central finite differences, this leads to a two-point, second-order accurate generalization of the commonly used three-point end-difference formula. Solutions with several spline and Hermite procedures are presented for the boundary layer equations, with and without mass transfer, and for the incompressible viscous flow in a driven cavity. Divergence and nondivergence equations are considered for the cavity. Among the fourth-order techniques, it is shown that spline 4 has the smallest truncation error. The spline 4 procedure generally requires one-quarter the number of mesh points in a given coordinate direction as a central finite-difference calculation of equal accuracy. The Hermite 6 procedure leads to remarkably accurate boundary layer solutions.

Rubin, S. G.↗

Time-step dependent force interpolation scheme for suppressing numerical Cherenkov instability in relativistic particle-in-cell simulations

The WT scheme, a piecewise polynomial force interpolation scheme with time-step dependency, is proposed in this paper for relativistic particle-in-cell (PIC) simulations. The WT scheme removes the lowest order numerical Cherenkov instability (NCI) growth rate for arbitrary time steps allowed by the Courant condition. While NCI from higher order resonances is still present, the numerical tests show that for smaller time steps, the numerical instability grows much slower than using the optimal time step found in previous studies. The WT scheme is efficient for improving the quality and flexibility of relativistic PIC simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Polynomial Similarity Transformation Theory: A smooth interpolation between coupled cluster doubles and projected BCS applied to the reduced BCS Hamiltonian

We present a similarity transformation theory based on a polynomial form of a particle-hole pair excitation operator. In the weakly correlated limit, this polynomial becomes an exponential, leading to coupled cluster doubles. In the opposite strongly correlated limit, the polynomial becomes an extended Bessel expansion and yields the projected BCS wavefunction. In between, we interpolate using a single parameter. The e ective Hamiltonian is non-hermitian and this Polynomial Similarity Transformation Theory follows the philosophy of traditional coupled cluster, left projecting the transformed Hamiltonian onto subspaces of the Hilbert space in which the wave function variance is forced to be zero. Similarly, the interpolation parameter is obtained through minimizing the next residual in the projective hierarchy. We rationalize and demonstrate how and why coupled cluster doubles is ill suited to the strongly correlated limit whereas the Bessel expansion remains well behaved. The model provides accurate wave functions with energy errors that in its best variant are smaller than 1% across all interaction stengths. The numerical cost is polynomial in system size and the theory can be straightforwardly applied to any realistic Hamiltonian.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimization of the determinant of the Vandermonde matrix and related matrices

Various techniques for interpolation of data, moment matching in stochastic applications and various methods in numerical analysis can be described using Vandermonde matrices. For this reason the properties of the determinant of the Vandermonde matrix and related matrices are interesting. Here the extreme points of the Vandermonde determinant, and related determinants, on some simple surfaces such as the unit sphere are analyzed, both numerically and analytically. Some results are also visualized in various dimensions. The extreme points of the Vandermonde determinant are also related to the roots of certain orthogonal polynomials such as the Hermite polynomials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic graphs, community detection, and Riemannian geometry

A community is a subset of a wider network where the members of that subset are more strongly connected to each other than they are to the rest of the network. In this paper, we consider the problem of identifying and tracking communities in graphs that change over time {dynamic community detection} and present a framework based on Riemannian geometry to aid in this task. Our framework currently supports several important operations such as interpolating between and averaging over graph snapshots. We compare these Riemannian methods with entry-wise linear interpolation and that the Riemannian methods are generally better suited to dynamic community detection. Next steps with the Riemannian framework include developing higher-order interpolation methods (e.g. the analogues of polynomial and spline interpolation) and a Riemannian least-squares regression method for working with noisy data.

dynamic community detection↗

Managing uncertainty in data-driven simulation-based optimization

Optimization using data from complex simulations has become an attractive decision-making option, due to ability to embed high-fidelity, non-linear understanding of processes within the search for optimal values. Due to lack of tractable algebraic equations, the link between simulations and optimization is oftentimes a surrogate metamodel. However, several forms of uncertainty exist within the cycle that links simulation data, to metamodels, to optimization. Uncertainty may originate from parameters of the simulation, or the form and fitted parameters of the metamodel. This paper reviews different literatures that are relevant to surrogate-based optimization and proposes different strategies for handling uncertainty, by combining machine learning with stochastic programming, robust optimization, and discrepancy modeling. We show that incorporating uncertainty management within simulation-based optimization leads to more robust solutions, which protect the decision-maker from infeasible solutions. Here, we present the results of our proposed approaches through a case study for direct-air capture through temperature swing adsorption.

42 ENGINEERING↗

Electromagnetic wave propagation based upon spectral-element methodology in dispersive and attenuating media

SUMMARY We build on mathematical equivalences between Maxwell’s wave equations for an electromagnetic medium and elastic seismic wave equations. This allows us to readily model Maxwell’s wave propagation in the spectral-element codes SPECFEM2D and SPECFEM3D, written for acoustic, viscoelastic and poroelastic seismic wave propagation, providing the ability to handle complex geometries, inherent to finite-element methods and retaining the strength of exponential convergence and accuracy due to the use of high-degree polynomials to interpolate field functions on the elements, characteristic to spectral-element methods (SEMs). Attenuation and dispersion processes related to the frequency dependence of dielectric permittivity and conductivity are also included using a Zener model, similar to shear attenuation in viscoelastic media or viscous diffusion in poroelastic media, and a Kelvin–Voigt model, respectively. Ability to account for anisotropic media is also discussed. Here, we limit ourselves to certain dielectric permittivity tensor geometries, in order to conserve a diagonal mass matrix after discretization of the system of equations. Doing so, simulation of Maxwell’s wave equations in the radar frequency range based on SEM can be solved using explicit time integration schemes well suited for parallel computation. We validate our formulation with analytical solutions. In 2-D, our implementation allows for the modelling of both a transverse magnetic (TM) mode, suitable for surface based reflection ground penetration radar type of applications, and a transverse electric (TE) mode more suitable for crosshole and vertical radar profiling setups. Two 2-D examples are designed to demonstrated the use of the TM and TE modes. A 3-D example is also presented, which allows for the full TEM solution, different antenna orientations, and out-of-plane variations in material properties.

58 GEOSCIENCES↗

Error detection and data smoothing based on local procedures

An algorithm is presented which is able to locate isolated bad points and correct them without contaminating the rest of the good data. This work has been greatly influenced and motivated by what is currently done in the manual loft. It is not within the scope of this work to handle small random errors characteristic of a noisy system, and it is therefore assumed that the bad points are isolated and relatively few when compared with the total number of points. Motivated by the desire to imitate the loftsman a visual experiment was conducted to determine what is considered smooth data. This criterion is used to determine how much the data should be smoothed and to prove that this method produces such data. The method utimately converges to a set of points that lies on the polynomial that interpolates the first and last points; however convergence to such a set is definitely not the purpose of our algorithm. The proof of convergence is necessary to demonstrate that oscillation does not take place and that in a finite number of steps the method produces a set as smooth as desired.

Guerra, V. M.↗

Separating and turbulent boundary layer calculations using polynomial interpretation

Higher order numerical methods derived from polynomial spline interpolation or Hermitian differencing are applied to a separating laminar boundary layer, i.e., the Howarth problem, and the turbulent flat plate boundary layer flow. Preliminary results are presented. It is found that accuracy equal to that of conventional second order accurate finite difference methods is achieved with many fewer mesh points and with reduced computer storage and time requirements.

Rubin, S. G.↗

AKPLOT: A plotter routine for IBM PC, XT and AT

The AKPLOT software for the IBM PC, XT, and AT is an efficient and versatile tool that allows X-Y plotting of quantitative information. Features include IBM four-color graphics, which combined with 10 different symbols allows 40 different curves on the same grid, shrink or expansion of the graph size, any combination of log and linear X and Y axes, selective plotting from multiple curves of a previous run, interpolation and polynomial least-squares fit with any degree polynomial, and a 90-degree tilt of the entire graph. These options are independent, and can be invoked individually.

Kantak, Anil↗

Higher-Order Finite Elements for Computing Thermal Radiation

Two variants of the finite-element method have been developed for use in computational simulations of radiative transfers of heat among diffuse gray surfaces. Both variants involve the use of higher-order finite elements, across which temperatures and radiative quantities are assumed to vary according to certain approximations. In this and other applications, higher-order finite elements are used to increase (relative to classical finite elements, which are assumed to be isothermal) the accuracies of final numerical results without having to refine computational meshes excessively and thereby incur excessive computation times. One of the variants is termed the radiation sub-element (RSE) method, which, itself, is subject to a number of variations. This is the simplest and most straightforward approach to representation of spatially variable surface radiation. Any computer code that, heretofore, could model surface-to-surface radiation can incorporate the RSE method without major modifications. In the basic form of the RSE method, each finite element selected for use in computing radiative heat transfer is considered to be a parent element and is divided into sub-elements for the purpose of solving the surface-to-surface radiation-exchange problem. The sub-elements are then treated as classical finite elements; that is, they are assumed to be isothermal, and their view factors and absorbed heat fluxes are calculated accordingly. The heat fluxes absorbed by the sub-elements are then transferred back to the parent element to obtain a radiative heat flux that varies spatially across the parent element. Variants of the RSE method involve the use of polynomials to interpolate and/or extrapolate to approximate spatial variations of physical quantities. The other variant of the finite-element method is termed the integration method (IM). Unlike in the RSE methods, the parent finite elements are not subdivided into smaller elements, and neither isothermality nor other unrealistic physical conditions are assumed. Instead, the equations of radiative heat transfer are integrated numerically over the parent finite elements by use of a computationally efficient Gaussian integration scheme.

Gould, Dana C.↗

Exponential-fitted methods for integrating stiff systems of ordinary differential equations: Applications to homogeneous gas-phase chemical kinetics

Conventional algorithms for the numerical integration of ordinary differential equations (ODEs) are based on the use of polynomial functions as interpolants. However, the exact solutions of stiff ODEs behave like decaying exponential functions, which are poorly approximated by polynomials. An obvious choice of interpolant are the exponential functions themselves, or their low-order diagonal Pade (rational function) approximants. A number of explicit, A-stable, integration algorithms were derived from the use of a three-parameter exponential function as interpolant, and their relationship to low-order, polynomial-based and rational-function-based implicit and explicit methods were shown by examining their low-order diagonal Pade approximants. A robust implicit formula was derived by exponential fitting the trapezoidal rule. Application of these algorithms to integration of the ODEs governing homogenous, gas-phase chemical kinetics was demonstrated in a developmental code CREK1D, which compares favorably with the Gear-Hindmarsh code LSODE in spite of the use of a primitive stepsize control strategy.

Pratt, D. T.↗

Rounded Approximate Step Functions For Interpolation

Rounded approximate step functions of form x(Sup m)/(x(Sup n) + 1) and 1/(x(Sup n) + 1) useful in interpolating between local steep slopes or abrupt changes in tabulated data varying more smoothly elsewhere. Used instead of polynomial curve fits. Interpolation formulas based on these functions implemented quickly and easily on computers. Used in real-time control computations to interpolate between tabulated data governing control responses.

Nunes, Arthur C., Jr.↗

Turbine adapted maps for turbocharger engine matching

This paper presents a new representation of the turbine performance maps oriented for turbocharger characterization. The aim of this plot is to provide a more compact and suited form to implement in engine simulation models and to interpolate data from turbocharger test bench. The new map is based on the use of conservative parameters as turbocharger power and turbine mass flow to describe the turbine performance in all VGT positions. The curves obtained are accurately fitted with quadratic polynomials and simple interpolation techniques give reliable results. Two turbochargers characterized in an steady flow rig were used for illustrating the representation. After being implemented in a turbocharger submodel, the results obtained with the model have been compared with success against turbine performance evaluated in engine tests cells. A practical application in turbocharger matching is also provided to show how this new map can be directly employed in engine design. (author)

33 ADVANCED PROPULSION SYSTEMS↗

Development of Finite Elements for Two-Dimensional Structural Analysis Using the Integrated Force Method

The Integrated Force Method has been developed in recent years for the analysis of structural mechanics problems. This method treats all independent internal forces as unknown variables that can be calculated by simultaneously imposing equations of equilibrium and compatibility conditions. In this paper a finite element library for analyzing two-dimensional problems by the Integrated Force Method is presented. Triangular- and quadrilateral-shaped elements capable of modeling arbitrary domain configurations are presented. The element equilibrium and flexibility matrices are derived by discretizing the expressions for potential and complementary energies, respectively. The displacement and stress fields within the finite elements are independently approximated. The displacement field is interpolated as it is in the standard displacement method, and the stress field is approximated by using complete polynomials of the correct order. A procedure that uses the definitions of stress components in terms of an Airy stress function is developed to derive the stress interpolation polynomials. Such derived stress fields identically satisfy the equations of equilibrium. Moreover, the resulting element matrices are insensitive to the orientation of local coordinate systems. A method is devised to calculate the number of rigid body modes, and the present elements are shown to be free of spurious zero-energy modes. A number of example problems are solved by using the present library, and the results are compared with corresponding analytical solutions and with results from the standard displacement finite element method. The Integrated Force Method not only gives results that agree well with analytical and displacement method results but also outperforms the displacement method in stress calculations.

Kaljevic, Igor↗