Search NASA⌕ Search

SEARCH · Search NASA

Results for “interpolating methods”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

Quadrature, Interpolation and Observability

Methods of interpolation and quadrature have been used for over 300 years. Improvements in the techniques have been made by many, most notably by Gauss, whose technique applied to polynomials is referred to as Gaussian Quadrature. Stieltjes extended Gauss's method to certain non-polynomial functions as early as 1884. Conditions that guarantee the existence of quadrature formulas for certain collections of functions were studied by Tchebycheff, and his work was extended by others. Today, a class of functions which satisfies these conditions is called a Tchebycheff System. This thesis contains the definition of a Tchebycheff System, along with the theorems, proofs, and definitions necessary to guarantee the existence of quadrature formulas for such systems. Solutions of discretely observable linear control systems are of particular interest, and observability with respect to a given output function is defined. The output function is written as a linear combination of a collection of orthonormal functions. Orthonormal functions are defined, and their properties are discussed. The technique for evaluating the coefficients in the output function involves evaluating the definite integral of functions which can be shown to form a Tchebycheff system. Therefore, quadrature formulas for these integrals exist, and in many cases are known. The technique given is useful in cases where the method of direct calculation is unstable. The condition number of a matrix is defined and shown to be an indication of the the degree to which perturbations in data affect the accuracy of the solution. In special cases, the number of data points required for direct calculation is the same as the number required by the method presented in this thesis. But the method is shown to require more data points in other cases. A lower bound for the number of data points required is given.

Hodges, Lucille McDaniel↗
NASA NTRS1972

Data smoothing and error detection based on linear interpolation

A method is presented, based on linear interpolation, for detecting and correcting bad data points in a set of data without contaminating the good data points. The method used is not concerned with the small random errors usually attributed to a noisy system. It assumes that the data points which are in error are relatively isolated from each other and that the number of such points is small compared to the total number of data points.

Guerra, V. M.↗
NASA NTRS1988

A velocity-pressure integrated, mixed interpolation, Galerkin finite element method for high Reynolds number laminar flows

A velocity-pressure integrated, mixed interpolation, Galerkin finite element method for the Navier-Stokes equations is presented. In the method, the velocity variables were interpolated using complete quadratic shape functions and the pressure was interpolated using linear shape functions. For the two dimensional case, the pressure is defined on a triangular element which is contained inside the complete biquadratic element for velocity variables; and for the three dimensional case, the pressure is defined on a tetrahedral element which is again contained inside the complete tri-quadratic element. Thus the pressure is discontinuous across the element boundaries. Example problems considered include: a cavity flow for Reynolds number of 400 through 10,000; a laminar backward facing step flow; and a laminar flow in a square duct of strong curvature. The computational results compared favorable with those of the finite difference methods as well as experimental data available. A finite elememt computer program for incompressible, laminar flows is presented.

Kim, Sang-Wook↗
NASA NTRS1992

A method of smooth bivariate interpolation for data given on a generalized curvilinear grid

A method of locally bicubic interpolation is presented for data given at the nodes of a two-dimensional generalized curvilinear grid. The physical domain is transformed to a computational domain in which the grid is uniform and rectangular by a generalized curvilinear coordinate transformation. The metrics of the transformation are obtained by finite differences in the computational domain. Metric derivatives are determined by repeated application of the chain rule for partial differentiation. Given the metrics and the metric derivatives, the partial derivatives required to determine a locally bicubic interpolant can be estimated at each data point using finite differences in the computational domain. A bilinear transformation is used to analytically transform the individual quadrilateral cells in the physical domain into unit squares, thus allowing the use of simple formulas for bicubic interpolation.

Zingg, David W.↗
NASA NTRS1975

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

Improved first order interpolator

Data compression method enables first order interpolator to operate at higher speeds. Method requires same number of additions and subtractions but fewer multiplications than the conventional method.

Andrews, C. A.↗
NASA NTRS1994

Adaptive model reduction for continuous systems via recursive rational interpolation

A method for adaptive identification of reduced-order models for continuous stable SISO and MIMO plants is presented. The method recursively finds a model whose transfer function (matrix) matches that of the plant on a set of frequencies chosen by the designer. The algorithm utilizes the Moving Discrete Fourier Transform (MDFT) to continuously monitor the frequency-domain profile of the system input and output signals. The MDFT is an efficient method of monitoring discrete points in the frequency domain of an evolving function of time. The model parameters are estimated from MDFT data using standard recursive parameter estimation techniques. The algorithm has been shown in simulations to be quite robust to additive noise in the inputs and outputs. A significant advantage of the method is that it enables a type of on-line model validation. This is accomplished by simultaneously identifying a number of models and comparing each with the plant in the frequency domain. Simulations of the method applied to an 8th-order SISO plant and a 10-state 2-input 2-output plant are presented. An example of on-line model validation applied to the SISO plant is also presented.

Lilly, John H.↗
NASA NTRS1982

Algebraic grid generation

The numerical solution of partial differential equations about irregular geometries and with varying characteristic scales has created the need for coordinate systems and associated transformations which reflect both geometric and physical requirements. The process of finding coordinate transformations in discrete representations is called 'grid generation'. The present investigation is concerned with three algebraic grid generation methods. The methods include transfinite interpolation, the multisurface method, and the two-boundary technique. Interpolation formulas, in terms of homotopic mappings and constraints in terms of point positions and/or derivatives are the essential elements of the techniques. The methods are relatively simple to understand, they are explicit and do not require extensive computational effort, and they have a high degree of generality.

Smith, R. E.↗
NASA NTRS1992

Algebraic surface grid generation in three-dimensional space

An interactive program for algebraic generation of structured surface grids in three dimensional space was developed on the IRIS4D series workstations. Interactive tools are available to ease construction of edge curves and surfaces in 3-D space. Addition, removal, or redistribution of points at arbitrary locations on a general 3-D surface or curve is possible. Also, redistribution of surface grid points may be accomplished through use of conventional surface splines or a method called 'surface constrained transfinite interpolation'. This method allows the user to redistribute the grid points on the edges of a surface patch; the effect of the redistribution is then propagated to the remainder of the surface through a transfinite interpolation procedure where the grid points will be constrained to lie on the surface. The program was written to be highly functional and easy to use. A host of utilities are available to ease the grid generation process. Generality of the program allows the creation of single and multizonal surface grids according to the user requirements. The program communicates with the user through popup menus, windows, and the mouse.

Warsi, Saif↗
NASA NTRS2013

3D Hail Size Distribution Interpolation/Extrapolation Algorithm

Radar data can usually detect hail; however, it is difficult for present day radar to accurately discriminate between hail and rain. Local ground-based hail sensors are much better at detecting hail against a rain background, and when incorporated with radar data, provide a much better local picture of a severe rain or hail event. The previous disdrometer interpolation/ extrapolation algorithm described a method to interpolate horizontally between multiple ground sensors (a minimum of three) and extrapolate vertically. This work is a modification to that approach that generates a purely extrapolated 3D spatial distribution when using a single sensor.

Lane, John↗
NASA NTRS1974

Data compression

An approach to data compression is discussed in which the effect achieved by compression is evaluated by the closeness of the approach to the minimum possible volume. An attempt is made to systematize the known results on data compression. The review contains: description of methods of data compression based on statistical coding and information theory; application of methods of interpolation and extrapolation; a specific compression method (related to description of the histogram of a sample); some criteria of effectiveness and methods of service information representation; and discussion of models suggested for theoretical analysis.

Babkin, V. F.↗
NASA NTRS1989

Conservative treatment of boundary interfaces for overlaid grids and multi-level grid adaptations

Conservative algorithms for boundary interfaces of overlaid grids are presented. The basic method is zeroth order, and is extended to a higher order method using interpolation and subcell decomposition. The present method, strictly based on a conservative constraint, is tested with overlaid grids for various applications of unsteady and steady supersonic inviscid flows with strong shock waves. The algorithm is also applied to a multi-level grid adaptation in which the next level finer grid is overlaid on the coarse base grid with an arbitrary orientation.

Moon, Young J.↗
NASA NTRS1989

Conservative treatment of boundary interfaces for overlaid grids and multi-level grid adaptations

Conservative algorithms for boundaray interfaces of overlaid grids are presented. The basic method is zeroth order, and is extended to a higher order method using interpolation and subcell decomposition. The present method, strictly based on a conservative constraint, is tested with overlaid grids for various applications of unsteady and steady supersonic inviscid flows with strong shock waves. The algorithm is also applied to a multi-level grid adaptation in which the next level finer grid is overlaid on the coarse base grid with an arbitrary orientation.

Moon, Young J.↗
NASA NTRS2008

Spline-Based Smoothing of Airfoil Curvatures

Constrained fitting for airfoil curvature smoothing (CFACS) is a splinebased method of interpolating airfoil surface coordinates (and, concomitantly, airfoil thicknesses) between specified discrete design points so as to obtain smoothing of surface-curvature profiles in addition to basic smoothing of surfaces. CFACS was developed in recognition of the fact that the performance of a transonic airfoil is directly related to both the curvature profile and the smoothness of the airfoil surface. Older methods of interpolation of airfoil surfaces involve various compromises between smoothing of surfaces and exact fitting of surfaces to specified discrete design points. While some of the older methods take curvature profiles into account, they nevertheless sometimes yield unfavorable results, including curvature oscillations near end points and substantial deviations from desired leading-edge shapes. In CFACS as in most of the older methods, one seeks a compromise between smoothing and exact fitting. Unlike in the older methods, the airfoil surface is modified as little as possible from its original specified form and, instead, is smoothed in such a way that the curvature profile becomes a smooth fit of the curvature profile of the original airfoil specification. CFACS involves a combination of rigorous mathematical modeling and knowledge-based heuristics. Rigorous mathematical formulation provides assurance of removal of undesirable curvature oscillations with minimum modification of the airfoil geometry. Knowledge-based heuristics bridge the gap between theory and designers best practices. In CFACS, one of the measures of the deviation of an airfoil surface from smoothness is the sum of squares of the jumps in the third derivatives of a cubicspline interpolation of the airfoil data. This measure is incorporated into a formulation for minimizing an overall deviation- from-smoothness measure of the airfoil data within a specified fitting error tolerance. CFACS has been extensively tested on a number of supercritical airfoil data sets generated by inverse design and optimization computer programs. All of the smoothing results show that CFACS is able to generate unbiased smooth fits of curvature profiles, trading small modifications of geometry for increasing curvature smoothness by eliminating curvature oscillations and bumps (see figure).

Li, W.↗
NASA NTRS1982

Variational methods in simultaneous optimum interpolation and initialization

The duality between optimum interpolation and variational objective analysis, is reviewed. This duality is used to set up a variational approach to objective analysis which uses prior information concerning the atmospheric spectral energy distribution, in the variational problem. In the wind analysis example, the wind field is partitioned into divergent and nondivergent parts, and a control parameter governing the relative energy in the two parts is estimated from the observational data being analyzed by generalized cross validation, along with a bandwidth parameter. A variational approach to combining objective analysis and initialization in a single step is proposed. In a simple example of this approach, data, forecast, and prior information concerning atmospheric energy distribution is combined into a single variational problem. This problem has (at least) one bandwidth parameter, one partitioning parameter governing the relative energy in fast slow modes, and one parameter governing the relative weight to be given to observational and forecast data.

Wahba, G.↗
NASA NTRS1989

A least-squares finite element method for incompressible Navier-Stokes problems

A least-squares finite element method, based on the velocity-pressure-vorticity formulation, is developed for solving steady incompressible Navier-Stokes problems. This method leads to a minimization problem rather than to a saddle-point problem by the classic mixed method, and can thus accommodate equal-order interpolations. This method has no parameter to tune. The associated algebraic system is symmetric, and positive definite. Numerical results for the cavity flow at Reynolds number up to 10,000 and the backward-facing step flow at Reynolds number up to 900 are presented.

Jiang, Bo-Nan↗
NASA NTRS1992

A least-squares finite element method for incompressible Navier-Stokes problems

A least-squares finite element method, based on the velocity-pressure-vorticity formulation, is developed for solving steady incompressible Navier-Stokes problems. This method leads to a minimization problem rather than to a saddle-point problem by the classic mixed method and can thus accommodate equal-order interpolations. This method has no parameter to tune. The associated algebraic system is symmetric, and positive definite. Numerical results for the cavity flow at Reynolds number up to 10,000 and the backward-facing step flow at Reynolds number up to 900 are presented.

Jiang, Bo-Nan↗