Search NASA⌕ Search

SEARCH · Search NASA

Results for “polynomial method”

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 505 records · Page 28

Computer programs for smoothing and scaling airfoil coordinates

Detailed descriptions are given of the theoretical methods and associated computer codes of a program to smooth and a program to scale arbitrary airfoil coordinates. The smoothing program utilizes both least-squares polynomial and least-squares cubic spline techniques to smooth interatively the second derivatives of the y-axis airfoil coordinates with respect to a transformed x-axis system which unwraps the airfoil and stretches the nose and trailing-edge regions. The corresponding smooth airfoil coordinates are then determined by solving a tridiagonal matrix of simultaneous cubic-spline equations relating the y-axis coordinates and their corresponding second derivatives. A technique for computing the camber and thickness distribution of the smoothed airfoil is also discussed. The scaling program can then be used to scale the thickness distribution generated by the smoothing program to a specific maximum thickness which is then combined with the camber distribution to obtain the final scaled airfoil contour. Computer listings of the smoothing and scaling programs are included.

Morgan, H. L., Jr.↗

A numerical study of viscous vortex rings using a spectral method

Viscous, axisymmetric vortex rings are investigated numerically by solving the incompressible Navier-Stokes equations using a spectral method designed for this type of flow. The results presented are axisymmetric, but the method is developed to be naturally extended to three dimensions. The spectral method relies on divergence-free basis functions. The basis functions are formed in spherical coordinates using Vector Spherical Harmonics in the angular directions, and Jacobi polynomials together with a mapping in the radial direction. Simulations are performed of a single ring over a wide range of Reynolds numbers (Re approximately equal gamma/nu), 0.001 less than or equal to 1000, and of two interacting rings. At large times, regardless of the early history of the vortex ring, it is observed that the flow approaches a Stokes solution that depends only on the total hydrodynamic impulse, which is conserved for all time. At small times, from an infinitely thin ring, the propagation speeds of vortex rings of varying Re are computed and comparisons are made with the asymptotic theory by Saffman. The results are in agreement with the theory; furthermore, the error is found to be smaller than Saffman's own estimate by a factor square root ((nu x t)/R squared) (at least for Re=0). The error also decreases with increasing Re at fixed core-to-ring radius ratio, and appears to be independent of Re as Re approaches infinity). Following a single ring, with Re=500, the vorticity contours indicate shedding of vorticity into the wake and a settling of an initially circular core to a more elliptical shape, similar to Norbury's steady inviscid vortices. Finally, we consider the case of leapfrogging vortex rings with Re=1000. The results show severe straining of the inner vortex core in the first pass and merging of the two cores during the second pass.

Stanaway, S. K.↗

Computational tools for multi-linked flexible structures

A software module which designs and tests controllers and filters in Kalman Estimator form, based on a polynomial state-space model is discussed. The user-friendly program employs an interactive graphics approach to simplify the design process. A variety of input methods are provided to test the effectiveness of the estimator. Utilities are provided which address important issues in filter design such as graphical analysis, statistical analysis, and calculation time. The program also provides the user with the ability to save filter parameters, inputs, and outputs for future use.

Lee, Gordon K. F.↗

On the Daubechies-based wavelet differentiation matrix

The differentiation matrix for a Daubechies-based wavelet basis is constructed and superconvergence is proven. That is, it will be proven that under the assumption of periodic boundary conditions that the differentiation matrix is accurate of order 2M, even though the approximation subspace can represent exactly only polynomials up to degree M-1, where M is the number of vanishing moments of the associated wavelet. It is illustrated that Daubechies-based wavelet methods are equivalent to finite difference methods with grid refinement in regions of the domain where small-scale structure is present.

Jameson, Leland↗

A numerical method for integrating the kinetic equations of droplet spectra evolution by condensation/evaporation and by coalescence/breakup processes

An extension of the method of moments is developed for the numerical integration of the kinetic equations of droplet spectra evolution by condensation/evaporation and by coalescence/breakup processes. The number density function n sub k (x,t) in each separate droplet packet between droplet mass grid points (x sub k, x sub k+1) is represented by an expansion in orthogonal polynomials with a given weighting function. In this way droplet number concentrations, liquid water contents and other moments in each droplet packet are conserved and the problem of solving the kinetic equations is replaced by one of solving a set of coupled differential equations for the number density function moments. The method is tested against analytic solutions of the corresponding kinetic equations. Numerical results are obtained for different coalescence/breakup and condensation/evaporation kernels and for different initial droplet spectra. Also droplet mass grid intervals, weighting functions, and time steps are varied.

Emukashvily, I. M.↗

On the design of recursive digital filters

A change of variables is described which transforms the problem of designing a recursive digital filter to that of approximation by a ratio of polynomials on a finite interval. Some analytic techniques for the design of low-pass filters are presented, illustrating the use of the transformation. Also considered are methods for the design of phase equalizers.

Shenoi, K.↗

Improving the efficiency of aerodynamic shape optimization procedures

The computational efficiency of an aerodynamic shape optimization procedure which is based on discrete sensitivity analysis is increased through the implementation of two improvements. The first improvement involves replacing a grid point-based approach for surface representation with a Bezier-Bernstein polynomial parameterization of the surface. Explicit analytical expressions for the grid sensitivity terms are developed for both approaches. The second improvement proposes the use of Newton's method in lieu of an alternating direction implicit (ADI) methodology to calculate the highly converged flow solutions which are required to compute the sensitivity coefficients. The modified design procedure is demonstrated by optimizing the shape of an internal-external nozzle configuration. A substantial factor of 8 decrease in computational time for the optimization process was achieved by implementing both of the design improvements.

Burgreen, Greg W.↗

Generalized indical forces on deforming rectangular wings in supersonic flight

A method is presented for determining the time-dependent flow over a rectangular wing moving with a supersonic forward speed and undergoing small vertical distortions expressible as polynomials involving spanwise and chordwise distances. The solution for the velocity potential is presented in a form analogous to that for steady supersonic flow having the familiar "reflected area" concept discovered by Evvard. Particular attention is paid to indicial-type motions and results are expressed in terms of generalized indicial forces. Numerical results for Mach numbers equal to 1.1 and 1.2 are given for polynomials of the first and fifth degree in the chordwise and spanwise directions, respectively, on a wing having an aspect ratio of 4.

Lomax, Harvard↗

Improving the efficiency of aerodynamic shape optimization

The computational efficiency of an aerodynamic shape optimization procedure that is based on discrete sensitivity analysis is increased through the implementation of two improvements. The first improvement involves replacing a grid-point-based approach for surface representation with a Bezier-Bernstein polynomial parameterization of the surface. Explicit analytical expressions for the grid sensitivity terms are developed for both approaches. The second improvement proposes the use of Newton's method in lieu of an alternating direction implicit methodology to calculate the highly converged flow solutions that are required to compute the sensitivity coefficients. The modified design procedure is demonstrated by optimizing the shape of an internal-external nozzle configuration. Practically identical optimization results are obtained that are independent of the method used to represent the surface. A substantial factor of 8 decrease in computational time for the optimization process is achieved by implementing both of the design procedure improvements.

Burgreen, Greg W.↗

Uniformly high order accurate essentially non-oscillatory schemes 3

In this paper (a third in a series) the construction and the analysis of essentially non-oscillatory shock capturing methods for the approximation of hyperbolic conservation laws are presented. Also presented is a hierarchy of high order accurate schemes which generalizes Godunov's scheme and its second order accurate MUSCL extension to arbitrary order of accuracy. The design involves an essentially non-oscillatory piecewise polynomial reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is derived from a new interpolation technique that when applied to piecewise smooth data gives high-order accuracy whenever the function is smooth but avoids a Gibbs phenomenon at discontinuities. Unlike standard finite difference methods this procedure uses an adaptive stencil of grid points and consequently the resulting schemes are highly nonlinear.

Harten, A.↗

Numerical advection by conservation of second-order moments

A new, accurate, and nondiffusive method for three-dimensional advection of trace species is presented. The method preserves tracer structures by conserving the second-order moments of the spatial distribution of tracer during advection. Upstream transport and second-order tracer distribution are described, and the moments of the tracer distribution about the center of a grid box are formally defined and related to the polynomial distribution. Formulas are presented which describe how the moments of a grid box are decomposed into a unique set of moments centered about each subbox and how they are reassembled into new grid boxes. A one-dimensional example if tracer transport is given, and limits necessary to maintain positive tracer concentrations are derived. The accuracy and stability of this method are analytically examined, and numerical experiments testing the effective resolution are presented. The method is compared with other methods for numerical advection of tracers.

Prather, M. J.↗

A simple method for obtaining a three-dimensional proton distribution function from Voyager plasma data

The main sensor of the Vogager plasma experiment consists of a cluster of three, modulated-grid Faraday cups whose normals are arranged symmetrically about the symmetry axis of the cluster at an angle of 20 degrees to that axis. In interplanetary space, each cup explores the positive ion distribution by accepting particles from contiguous slices in velocity space. The slices are narrow in the direction of the normal to the modulating grid but are broad in planes parallel to that grid. The resulting three sets of measurements can be combined to yield the three-dimensional distribution function in the following way: the distribution function is assumed to be gyrotropic. For each value of speed in a frame of reference moving with the bulk velocity of the solar wind, the variation of the distribution function with angle from the field direction is represented by a series of Legendre polynomials. Effects such as double-streaming and heat flow can be well represented by using only the first three terms of the series which are fully specified by the measurements. Examples of the use of this method in the analysis of Voyager data are shown.

Olbert, S.↗

Matrix-Free High-Performance Saddle-Point Solvers for High-Order Problems in \(\boldsymbol{H}(\operatorname{\textbf{div}})\)

Here, this work describes the development of matrix-free GPU-accelerated solvers for high-order finite element problems in H(div). The solvers are applicable to grad-div and Darcy problems in saddle-point formulation, and have applications in radiation diffusion and porous media flow problems, among others. Using the interpolation–histopolation basis, efficient matrix-free preconditioners can be constructed for the (1, 1)-block and Schur complement of the block system. With these approximations, block-preconditioned MINRES converges in a number of iterations that is independent of the mesh size and polynomial degree. The approximate Schur complement takes the form of an M-matrix graph Laplacian and therefore can be well-preconditioned by highly scalable algebraic multigrid methods. High-performance GPU-accelerated algorithms for all components of the solution algorithm are developed, discussed, and benchmarked. Numerical results are presented on a number of challenging test cases, including the “crooked pipe” grad-div problem, the SPE10 reservoir modeling benchmark problem, and a nonlinear radiation diffusion test case.

97 MATHEMATICS AND COMPUTING↗

The use of series-solutions for batch and sequential estimation

Iterative methods for the approximate solution of the nonlinear state estimation problem are investigated in which the solution is retained in the form of a finite series of Chebyshev polynomials. Algorithms are presented which allow the state to be estimated from observational data in either the batch or the sequential form. The advantages of these techniques are discussed.

Feagin, T.↗

A sequential method for spline approximation with variable knots

In this paper we describe a method for approximating a waveform by a spline. The method is quite efficient, as the data are processed sequentially. The basis of the approach is to view the approximation problem as a question of estimation of a polynomial in noise, with the possibility of abrupt changes in the highest derivative. This allows us to bring several powerful statistical signal processing tools into play. We also present some initial results on the application of our technique to the processing of electrocardiograms, where the knot locations themselves may be some of the most important pieces of diagnostic information.

Mier Muth, A. M.↗

Closed form evaluation of symmetric two-sided complex integrals

Evaluation of two-sided complex integrals is often required when analyzing linear systems to determine signal variances resulting from stochastic inputs and system noise bandwidths. Algebraic solutions of integrals in a closed matrix equation form, using coefficients of the numerator and denominator polynomials, are presented. The closed forms provide the possibility of obtaining some insight into parameter sensitivity in addition to greatly reducing the computational complexity required by the normal method of evaluation by residues.

Winkelstein, R.↗

Quadrature imposition of compatibility conditions in Chebyshev methods

Often, in solving an elliptic equation with Neumann boundary conditions, a compatibility condition has to be imposed for well-posedness. This condition involves integrals of the forcing function. When pseudospectral Chebyshev methods are used to discretize the partial differential equation, these integrals have to be approximated by an appropriate quadrature formula. The Gauss-Chebyshev (or any variant of it, like the Gauss-Lobatto) formula can not be used here since the integrals under consideration do not include the weight function. A natural candidate to be used in approximating the integrals is the Clenshaw-Curtis formula, however it is shown that this is the wrong choice and it may lead to divergence if time dependent methods are used to march the solution to steady state. The correct quadrature formula is developed for these problems. This formula takes into account the degree of the polynomials involved. It is shown that this formula leads to a well conditioned Chebyshev approximation to the differential equations and that the compatibility condition is automatically satisfied.

Gottlieb, D.↗

A numerical method for parameterization of atmospheric chemistry - Computation of tropospheric OH

An efficient and stable computational scheme for parameterization of atmospheric chemistry is described. The 24-hour-average concentration of OH is represented as a set of high-order polynomials in variables such as temperature, densities of H2O, CO, O3, and NO(t) (defined as NO + NO2 + NO3 + 2N2O5 + HNO2 + HNO4) as well as variables determining solar irradiance: cloud cover, density of the overhead ozone column, surface albedo, latitude, and solar declination. This parameterization of OH chemistry was used in the three-dimensional study of global distribution of CH3CCl3. The proposed computational scheme can be used for parameterization of rates of chemical production and loss or of any other output of a full chemical model.

Spivakovsky, C. M.↗