SEARCH · Search NASA

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Three dimensional unstructured multigrid for the Euler equations

The three-dimensional Euler equations are solved on unstructured tetrahedral meshes using a multigrid strategy. The driving algorithm consists of an explicit vertex-based finite-element scheme, which employs an edge-based data-structure to assemble the residuals. The multigrid approach employs a sequence of independently generated coarse and fine meshes to accelerate the convergence to steady-state of the fine grid solution. Variables, residuals and corrections are passed back and forth between the various grids of the sequence using linear interpolation. The addresses and weights for interpolation are determined in a preprocessing stage using an efficient graph traversal algorithm. The preprocessing operation is shown to require a negligible fraction of the CPU time required by the overall solution procedure, while gains in overall solution efficiencies greater than an order of magnitude are demonstrated on meshes containing up to 350,000 vertices. Solutions using globally regenerated fine meshes as well as adaptively refined meshes are given.

Mavriplis, D. J.↗

NASA NTRS1992

General-Purpose Software For Computer Graphics

NASA Device Independent Graphics Library (NASADIG) is general-purpose computer-graphics package for computer-based engineering and management applications which gives opportunity to translate data into effective graphical displays for presentation. Features include two- and three-dimensional plotting, spline and polynomial interpolation, control of blanking of areas, multiple log and/or linear axes, control of legends and text, control of thicknesses of curves, and multiple text fonts. Included are subroutines for definition of areas and axes of plots; setup and display of text; blanking of areas; setup of style, interpolation, and plotting of lines; control of patterns and of shading of colors; control of legends, blocks of text, and characters; initialization of devices; and setting of mixed alphabets. Written in FORTRAN 77.

Rogers, Joseph E.↗

NASA NTRS1989

Totally parallel multilevel algorithms for sparse elliptic systems

The fastest known algorithms for the solution of a large elliptic boundary value problem on a massively parallel hypercube all require O(log(n)) floating point operations and O(log(n)) distance-1 communications, if massively parallel is defined to mean a number of processors proportional to the size n of the problem. The Totally Parallel Multilevel Algorithm (TPMA) that has, as special cases, four of these fast algorithms is described. These four algorithms are Parallel Superconvergent Multigrid (PSMG), Robust Multigrid, the Fast Fourier Transformation (FFT) based Spectral Algorithm, and Parallel Cyclic Reduction. The algorithm TPMA, when described recursively, has four steps: (1) project to a collection of interlaced, coarser problems at the next lower level; (2) apply TPMA, recursively, to each of these lower level problems, solving directly at the lowest level; (3) interpolate these approximate solutions to the finer grid, and to verage them to form an approximate solution on this grid; and (4) refine this approximate solution with a defect-correction step, using a local approximate inverse. Choice of the projection operator (P), the interpolation operator (Q), and the smoother (S) determines the class of problems on which TPMA is most effective. There are special cases in which the first three steps produce an exact solution, and the smoother is not needed (e.g., constant coefficient operators).

Frederickson, Paul O.↗

NASA NTRS1991

On the wall-normal velocity of the compressible boundary-layer equations

Numerical methods for the compressible boundary-layer equations are facilitated by transformation from the physical (x,y) plane to a computational (xi,eta) plane in which the evolution of the flow is 'slow' in the time-like xi direction. The commonly used Levy-Lees transformation results in a computationally well-behaved problem for a wide class of non-similar boundary-layer flows, but it complicates interpretation of the solution in physical space. Specifically, the transformation is inherently nonlinear, and the physical wall-normal velocity is transformed out of the problem and is not readily recovered. In light of recent research which shows mean-flow non-parallelism to significantly influence the stability of high-speed compressible flows, the contribution of the wall-normal velocity in the analysis of stability should not be routinely neglected. Conventional methods extract the wall-normal velocity in physical space from the continuity equation, using finite-difference techniques and interpolation procedures. The present spectrally-accurate method extracts the wall-normal velocity directly from the transformation itself, without interpolation, leaving the continuity equation free as a check on the quality of the solution. The present method for recovering wall-normal velocity, when used in conjunction with a highly-accurate spectral collocation method for solving the compressible boundary-layer equations, results in a discrete solution which is extraordinarily smooth and accurate, and which satisfies the continuity equation nearly to machine precision. These qualities make the method well suited to the computation of the non-parallel mean flows needed by spatial direct numerical simulations (DNS) and parabolized stability equation (PSE) approaches to the analysis of stability.

Pruett, C. David↗

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 NTRS1990

Robust control of systems with real parameter uncertainty and unmodelled dynamics

Two significant contributions have been made during this research period in the research 'Robust Control of Systems with Real Parameter Uncertainty and Unmodelled Dynamics' under NASA Research Grant NAG-1-1102. They are: (1) a fast algorithm for computing the optimal H(sub infinity) norm for the four-block, the two block, or the one-block optimal H(sub infinity) optimization problem; and (2) a construction of an optimal H infinity controller without numerical difficulty. In using GD (Glover and Doyle) or DGKF (Doyle, Glover, Khargonekar, and Francis) approach to solve the standard H infinity norm which required bisection search. In this research period, we developed a very fast iterative algorithm for this computation. Our algorithm was developed based on hyperbolic interpolations which is much faster than any existing algorithm. The lower bound of the parameter, gamma, in the H infinity Riccati equation for solution existence is shown to be the square root of the supremum over all frequencies of the maximum eigenvalue of a given transfer matrix which can be computed easily. The lower band of gamma such that the H infinity Riccati equation has positive semidefinite solution can be also obtained by hyperbolic interpolation search. Another significant result in this research period is the elimination of the numerical difficulties arising in the construction of an optimal H infinity controller by directly applying the Glover and Doyle's state-space formulas. With the fast iterative algorithm for the computation of the optimal H infinity norm and the reliable construction of an optimal H infinity controller, we are ready to apply these tools in the design of robust controllers for the systems with unmodelled uncertainties. These tools will be also very useful when we consider systems with structured uncertainties.

Chang, Bor-Chin↗

NASA NTRS1993

Rapid exploration of curvilinear grids using direct volume rendering

Fast techniques for direct volume rendering over curvilinear grids of hexahedral cells are developed. This type of 3D grid is common in computational fluid dynamics and finite element analysis. Four new projection methods are presented and compared with each other and with previous methods for tetrahedral grids and rectilinear grids. All four methods use polygon-rendering hardware for speed. A simplified algorithm for visibility ordering, which is based on a combination of breadth-first and depth-first searches, is described. A new multi-pass blending method is described that reduces visual artifacts that are introduced by linear interpolation in hardware where exponential interpolation is needed. Multi-pass blending is of equal interest to hardware-oriented projection methods used on rectilinear grids. Visualization tools that permit rapid data banding and cycling through transfer functions, as well as region restrictions, are described.

Vangelder, Allen↗

NASA NTRS1992

Visual information processing; Proceedings of the Meeting, Orlando, FL, Apr. 20-22, 1992

Topics discussed in these proceedings include nonlinear processing and communications; feature extraction and recognition; image gathering, interpolation, and restoration; image coding; and wavelet transform. Papers are presented on noise reduction for signals from nonlinear systems; driving nonlinear systems with chaotic signals; edge detection and image segmentation of space scenes using fractal analyses; a vision system for telerobotic operation; a fidelity analysis of image gathering, interpolation, and restoration; restoration of images degraded by motion; and information, entropy, and fidelity in visual communication. Attention is also given to image coding methods and their assessment, hybrid JPEG/recursive block coding of images, modified wavelets that accommodate causality, modified wavelet transform for unbiased frequency representation, and continuous wavelet transform of one-dimensional signals by Fourier filtering.

Huck, Friedrich O.↗

NASA NTRS1993

Virtual zone Navier-Stokes computations for oscillating control surfaces

A new zoning method called 'virtual zones' has been developed for application to an unsteady finite difference Navier-Stokes code. The virtual zoning method simplifies the zoning and gridding of complex configurations for use with patched multi-zone flow codes. An existing interpolation method has been extensively modified to bring the run time for the interpolation procedure down to the same level as for the flow solver. Unsteady Navier-Stokes computations have been performed for transonic flow over a clipped delta wing with an oscillating control surface. The computed unsteady pressure and response characteristics of the control-surface motion compare well with experimental data.

Klopfer, G. H.↗

NASA NTRS1993

An assessment of spectral nonoscillatory schemes

A new spectral nonoscillatory interpolation scheme is proposed that achieves spectral accuracy in smooth regions and is nonoscillatory on piecewise discontinuous data. The essential idea behind the scheme is to increase the order of an ENO scheme in proportion to the number of points, wherever possible. Numerical experiments with the new scheme on interpolation, 1D advection, and 1D gas dynamics confirm the high resolution features of the scheme. Comparisons with the results of earlier spectral nonoscillatory schemes show that the new scheme is competitive both in efficiency and accuracy.

Suresh, Ambady↗

NASA NTRS1993

Large time-step stability of explicit one-dimensional advection schemes

There is a wide-spread belief that most explicit one-dimensional advection schemes need to satisfy the so-called 'CFL condition' - that the Courant number, c = udelta(t)/delta(x), must be less than or equal to one, for stability in the von Neumann sense. This puts severe limitations on the time-step in high-speed, fine-grid calculations and is an impetus for the development of implicit schemes, which often require less restrictive time-step conditions for stability, but are more expensive per time-step. However, it turns out that, at least in one dimension, if explicit schemes are formulated in a consistent flux-based conservative finite-volume form, von Neumann stability analysis does not place any restriction on the allowable Courant number. Any explicit scheme that is stable for c is less than 1, with a complex amplitude ratio, G(c), can be easily extended to arbitrarily large c. The complex amplitude ratio is then given by exp(- (Iota)(Nu)(Theta)) G(delta(c)), where N is the integer part of c, and delta(c) = c - N (less than 1); this is clearly stable. The CFL condition is, in fact, not a stability condition at all, but, rather, a 'range restriction' on the 'pieces' in a piece-wise polynomial interpolation. When a global view is taken of the interpolation, the need for a CFL condition evaporates. A number of well-known explicit advection schemes are considered and thus extended to large delta(t). The analysis also includes a simple interpretation of (large delta(t)) total-variation-diminishing (TVD) constraints.

Leonard, B. P.↗

NASA NTRS1994

Neural networks applications to control and computations

Several interrelated problems in the area of neural network computations are described. First an interpolation problem is considered, then a control problem is reduced to a problem of interpolation by a neural network via Lyapunov function approach, and finally a new, faster method of learning as compared with the gradient descent method, was introduced.

Luxemburg, Leon A.↗

NASA NTRS1994

On-line, adaptive state estimator for active noise control

Dynamic characteristics of airframe structures are expected to vary as aircraft flight conditions change. Accurate knowledge of the changing dynamic characteristics is crucial to enhancing the performance of the active noise control system using feedback control. This research investigates the development of an adaptive, on-line state estimator using a neural network concept to conduct active noise control. In this research, an algorithm has been developed that can be used to estimate displacement and velocity responses at any locations on the structure from a limited number of acceleration measurements and input force information. The algorithm employs band-pass filters to extract from the measurement signal the frequency contents corresponding to a desired mode. The filtered signal is then used to train a neural network which consists of a linear neuron with three weights. The structure of the neural network is designed as simple as possible to increase the sampling frequency as much as possible. The weights obtained through neural network training are then used to construct the transfer function of a mode in z-domain and to identify modal properties of each mode. By using the identified transfer function and interpolating the mode shape obtained at sensor locations, the displacement and velocity responses are estimated with reasonable accuracy at any locations on the structure. The accuracy of the response estimates depends on the number of modes incorporated in the estimates and the number of sensors employed to conduct mode shape interpolation. Computer simulation demonstrates that the algorithm is capable of adapting to the varying dynamic characteristics of structural properties. Experimental implementation of the algorithm on a DSP (digital signal processing) board for a plate structure is underway. The algorithm is expected to reach the sampling frequency range of about 10 kHz to 20 kHz which needs to be maintained for a typical active noise control application.

Lim, Tae W.↗

NASA NTRS1995

On the Conservative Interface Treatment for Multi-Block Viscous Flow Computations

A pressure-based multi-block computational method is developed for solving the incompressible Navier-Stokes equations in general curvilinear grid systems. The scheme is based on the semi-implicit type flow solver with the staggered grid. Issues concerning the mass and momentum flux treatments at the discontinuous grid interface are addressed. Systematic numerical experiments for different interface treatments involving (1) straightforward interpolation, (2) globally conservative scheme, and (3) locally conservative scheme have been conducted. It is demonstrated that mass conservation has to be maintained locally, at the grid interface, with accuracy compatible with that of the scheme used in interior domain. Direct interpolation or globally conservative interface treatment of mass flux can not yield solutions with desirable accuracy.

Liu, J.↗

NASA NTRS1995

Technical report series on global modeling and data assimilation. Volume 4: Documentation of the Goddard Earth Observing System (GEOS) data assimilation system, version 1

This report describes the analysis component of the Goddard Earth Observing System, Data Assimilation System, Version 1 (GEOS-1 DAS). The general features of the data assimilation system are outlined, followed by a thorough description of the statistical interpolation algorithm, including specification of error covariances and quality control of observations. We conclude with a discussion of the current status of development of the GEOS data assimilation system. The main components of GEOS-1 DAS are an atmospheric general circulation model and an Optimal Interpolation algorithm. The system is cycled using the Incremental Analysis Update (IAU) technique in which analysis increments are introduced as time independent forcing terms in a forecast model integration. The system is capable of producing dynamically balanced states without the explicit use of initialization, as well as a time-continuous representation of non- observables such as precipitation and radiational fluxes. This version of the data assimilation system was used in the five-year reanalysis project completed in April 1994 by Goddard's Data Assimilation Office (DAO) Data from this reanalysis are available from the Goddard Distributed Active Center (DAAC), which is part of NASA's Earth Observing System Data and Information System (EOSDIS). For information on how to obtain these data sets, contact the Goddard DAAC at (301) 286-3209, EMAIL daac@gsfc.nasa.gov.

Suarez, Max J.↗

NASA NTRS1995

Optimal guidance law development for an advanced launch system

The objective of this research effort was to develop a real-time guidance approach for launch vehicles ascent to orbit injection. Various analytical approaches combined with a variety of model order and model complexity reduction have been investigated. Singular perturbation methods were first attempted and found to be unsatisfactory. The second approach based on regular perturbation analysis was subsequently investigated. It also fails because the aerodynamic effects (ignored in the zero order solution) are too large to be treated as perturbations. Therefore, the study demonstrates that perturbation methods alone (both regular and singular perturbations) are inadequate for use in developing a guidance algorithm for the atmospheric flight phase of a launch vehicle. During a second phase of the research effort, a hybrid analytic/numerical approach was developed and evaluated. The approach combines the numerical methods of collocation and the analytical method of regular perturbations. The concept of choosing intelligent interpolating functions is also introduced. Regular perturbation analysis allows the use of a crude representation for the collocation solution, and intelligent interpolating functions further reduce the number of elements without sacrificing the approximation accuracy. As a result, the combined method forms a powerful tool for solving real-time optimal control problems. Details of the approach are illustrated in a fourth order nonlinear example. The hybrid approach is then applied to the launch vehicle problem. The collocation solution is derived from a bilinear tangent steering law, and results in a guidance solution for the entire flight regime that includes both atmospheric and exoatmospheric flight phases.

Calise, Anthony J.↗

NASA NTRS1995

Elliptic surface grid generation on minimal and parmetrized surfaces

An elliptic grid generation method is presented which generates excellent boundary conforming grids in domains in 2D physical space. The method is based on the composition of an algebraic and elliptic transformation. The composite mapping obeys the familiar Poisson grid generation system with control functions specified by the algebraic transformation. New expressions are given for the control functions. Grid orthogonality at the boundary is achieved by modification of the algebraic transformation. It is shown that grid generation on a minimal surface in 3D physical space is in fact equivalent to grid generation in a domain in 2D physical space. A second elliptic grid generation method is presented which generates excellent boundary conforming grids on smooth surfaces. It is assumed that the surfaces are parametrized and that the grid only depends on the shape of the surface and is independent of the parametrization. Concerning surface modeling, it is shown that bicubic Hermite interpolation is an excellent method to generate a smooth surface which is passing through a given discrete set of control points. In contrast to bicubic spline interpolation, there is extra freedom to model the tangent and twist vectors such that spurious oscillations are prevented.

Spekreijse, S. P.↗

NASA NTRS1995

Multilevel elliptic smoothing of large three-dimensional grids

Elliptic grid generation methods have been used for many years to smooth and improve grids generated by algebraic interpolation schemes. However, the elliptic system that must be solved is nonlinear and convergence is generally very slow for large grids. In an attempt to make elliptic methods practical for large three-dimensional grids, a two-stage implementation is developed where the overall grid point locations are set using a coarse grid generated by the elliptic system. The coarse grid is then interpolated to generate a finer grid which is smoothed using only a few iterations of the elliptic system.

Mastin, C. Wayne↗