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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A New Vehicle-to-Vehicle Communication System: Visual-Enhanced Cooperative Traffic Operations

The advent of Connected and Autonomous Vehicles (CAVs) has highlighted the necessity for robust communication systems between vehicles and their environment. This study introduces a novel vehicle-to-vehicle (V2V) communication system, termed the Visual-Enhanced Cooperative Traffic Operations (VECTOR) system. The VECTOR system addresses the need for robust communication by converting dynamic data (including velocity and yaw angle data) into binary code, which is displayed on an LED panel mounted on the top of the vehicle. Following vehicles detect this panel and decode the information using a camera, implementing a visual-based communication method. VECTOR system employs a comprehensive five-module process. Initially, polynomial fitting techniques are applied to velocity data over fixed time intervals using third-degree polynomials, with validation via R² and MSE metrics. The second module converts velocity and yaw angle data into binary form, thereby enhancing detection and processing efficiency. The third module focuses on improving detection stability across various environmental conditions to enhance traffic safety. The fourth module decodes the binary data back into trajectory information, ensuring the fidelity of velocity and yaw angles. The final module integrates eco-control through the VECTOR system, employing advanced control algorithms to minimize energy consumption in CAVs. Experimental evaluations conducted using a modified CAV test platform based on the Lincoln MKZ demonstrate the feasibility and efficiency of the VECTOR system, achieving a 75% R-squared accuracy rate in replicating original velocity data. This methodology not only highlights potential applications but also underscores significant implications for advancing CAV technology.

Ma, Ke↗
NASA NTRS1973

Geometric aspects in digital analysis of Multi-Spectral Scanner (MSS) data

Present automated systems of interpretation which apply pattern recognition techniques on MSS data do not fully consider the geometry of the acquisition system. In an effort to improve the usefulness of the MSS data when digitally treated, geometric aspects are analyzed and discussed. Attempts to correct for scanner instabilities in position and orientation by affine and polynomial transformations, as well as by modified collinearity equations are described. Methods of accounting for panoramic and relief effects are also discussed. It is anticipated that reliable area as well as position determinations can be accomplished during the process of automatic interpretation. A concept for a unified approach to the treatment of remote sensing data, both metric and nonmetric is presented.

Mikhail, E. M.↗
NASA NTRS1976

A method for the selection of a functional form for a thermodynamic equation of state using weighted linear least squares stepwise regression

A method was developed for establishing a rational choice of the terms to be included in an equation of state with a large number of adjustable coefficients. The methods presented were developed for use in the determination of an equation of state for oxygen and nitrogen. However, a general application of the methods is possible in studies involving the determination of an optimum polynomial equation for fitting a large number of data points. The data considered in the least squares problem are experimental thermodynamic pressure-density-temperature data. Attention is given to a description of stepwise multiple regression and the use of stepwise regression in the determination of an equation of state for oxygen and nitrogen.

Jacobsen, R. T.↗
NASA NTRS1983

Convergence and stability properties of minimal polynomial and reduced rank extrapolation algorithms

The minimal polynomial and reduced rank extrapolation algorithms are two acceleration of convergence methods for sequences of vectors. In a recent survey these methods were tested and compared with the scalar, vector, topological epsilon algorithms, and were observed to be more efficient than the latter. It was also observed that the two methods have similar convergence properties. The convergence and stability properties of these methods are analyzed and the performance of the acceleration methods when applied to a class of vector sequences that includes those sequences obtained from systems of linear equations by using matrix iterative methods is discussed.

Sidi, A.↗
NASA NTRS1982

On the geodetic applications of simultaneous range-differencing to LAGEOS

The possibility of improving the accuracy of geodetic results by use of simultaneously observed ranges to Lageos, in a differencing mode, from pairs of stations was studied. Simulation tests show that model errors can be effectively minimized by simultaneous range differencing (SRD) for a rather broad class of network satellite pass configurations. The methods of least squares approximation are compared with monomials and Chebyshev polynomials and the cubic spline interpolation. Analysis of three types of orbital biases (radial, along- and across track) shows that radial biases are the ones most efficiently minimized in the SRC mode. The degree to which the other two can be minimized depends on the type of parameters under estimation and the geometry of the problem. Sensitivity analyses of the SRD observation show that for baseline length estimations the most useful data are those collected in a direction parallel to the baseline and at a low elevation. Estimating individual baseline lengths with respect to an assumed but fixed orbit not only decreases the cost, but it further reduces the effects of model biases on the results as opposed to a network solution. Analogous results and conclusions are obtained for the estimates of the coordinates of the pole.

Pablis, E. C.↗
NASA NTRS1983

On the three-dimensional vibrations of the cantilevered rectangular parallelepiped

A solution is presented for the three-dimensional problem of determining the free vibration frequencies and mode shapes for a rectangular parallelepiped which is completely fixed on one face and free on the other five faces. This problem apparently is previously unsolved in the published literature. The Ritz method is used, with displacements assumed in the form of algebraic polynomials. Convergence is studied. Numerical results are given for the first five frequencies of each of the four symmetry classes of vibration, for five thick parallelepiped configurations, including the cube. Contour plots are exhibited for the modal displacements of the cube. The effects of varying Poisson's ratio are also observed.

Leissa, A.↗
NASA NTRS1990

Interpolation schemes in the control of systems with unknown dynamics

Time-delay control for systems with unknown dynamics involves estimations. In its present form, these estimations include not only the interpolation of a time-varying function but also its derivative between data points. Presently, the control law is reformulated, taking into account the computation delay. A window-shifting scheme is then devised to view n data points as they are sampled in order to perform the function estimation. At each new sampling time, the window shifts to include the new data point as well as the last n-1 points. Several interpolation methods are considered. These methods use data points from a sampled function to construct a polynomial estimate of the function. The control system performance was experimentally tested using a servosystem. The results show that a Newtonian interpolation provided best results when the computation time was 0.4 times the sampling period.

Youcef-Toumi, K.↗
NASA NTRS1995

Improved L-C resonant decay technique for Q measurement of quasilinear power inductors: New results for MPP and ferrite powdered cores

The L-C resonant decay technique for measuring circuit Q or losses is improved by eliminating the switch from the inductor-capacitor loop. A MOSFET switch is used instead to momentarily connect the resonant circuit to an existing voltage source, which itself is gated off during the decay transient. Very reproducible, low duty cycle data could be taken this way over a dynamic voltage range of at least 10:1. Circuit Q is computed from a polynomial fit to the sequence of the decaying voltage maxima. This method was applied to measure the losses at 60 kHz in inductors having loose powder cores of moly permalloy and an Mn-Zn power ferrite. After the copper and capacitor losses are separated out, the resulting specific core loss is shown to be roughly as expected for the MPP powder, but anomalously high for the ferrite powder. Possible causes are mentioned.

Niedra, Janis M.↗
NASA NTRS1995

Three-dimensional aerodynamic shape optimization using discrete sensitivity analysis

An aerodynamic shape optimization procedure based on discrete sensitivity analysis is extended to treat three-dimensional geometries. The function of sensitivity analysis is to directly couple computational fluid dynamics (CFD) with numerical optimization techniques, which facilitates the construction of efficient direct-design methods. The development of a practical three-dimensional design procedures entails many challenges, such as: (1) the demand for significant efficiency improvements over current design methods; (2) a general and flexible three-dimensional surface representation; and (3) the efficient solution of very large systems of linear algebraic equations. It is demonstrated that each of these challenges is overcome by: (1) employing fully implicit (Newton) methods for the CFD analyses; (2) adopting a Bezier-Bernstein polynomial parameterization of two- and three-dimensional surfaces; and (3) using preconditioned conjugate gradient-like linear system solvers. Whereas each of these extensions independently yields an improvement in computational efficiency, the combined effect of implementing all the extensions simultaneously results in a significant factor of 50 decrease in computational time and a factor of eight reduction in memory over the most efficient design strategies in current use. The new aerodynamic shape optimization procedure is demonstrated in the design of both two- and three-dimensional inviscid aerodynamic problems including a two-dimensional supersonic internal/external nozzle, two-dimensional transonic airfoils (resulting in supercritical shapes), three-dimensional transport wings, and three-dimensional supersonic delta wings. Each design application results in realistic and useful optimized shapes.

Burgreen, Gregory W.↗
NASA NTRS2019

Sizing and Topology Design of an Aeroelastic Wingbox Under Uncertainty

The goals of this work are to use a nested optimizer to conduct simultaneous sizing (inner level) and topology (outer level) design of a wingbox, considering uncertainties in the safety factors used to define the aeroelastic constraints. These uncertainties, propagated via sampling-driven polynomial chaos, are explicitly introduced at the inner level of the method, during gradient-based sizing optimization, resulting in a stochastic optimal sizing distribution. Measures of robustness in the total structural mass are then passed to the outer level, where a global optimizer evolves the topology parameters. The results demonstrate design choices needed to improve robustness in the face of uncertain safety factors, and the various physical mechanisms driving this process.

Stanford, Bret K.↗
NASA NTRS1986

Performance tradeoffs in static and dynamic load balancing strategies

The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but sub-optimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the other three strategies.

Iqbal, M. A.↗
NASA NTRS1983

Elasticity solutions for a class of composite laminate problems with stress singularities

A study on the fundamental mechanics of fiber-reinforced composite laminates with stress singularities is presented. Based on the theory of anisotropic elasticity and Lekhnitskii's complex-variable stress potentials, a system of coupled governing partial differential equations are established. An eigenfunction expansion method is introduced to determine the orders of stress singularities in composite laminates with various geometric configurations and material systems. Complete elasticity solutions are obtained for this class of singular composite laminate mechanics problems. Homogeneous solutions in eigenfunction series and particular solutions in polynomials are presented for several cases of interest. Three examples are given to illustrate the method of approach and the basic nature of the singular laminate elasticity solutions. The first problem is the well-known laminate free-edge stress problem, which has a rather weak stress singularity. The second problem is the important composite delamination problem, which has a strong crack-tip stress singularity. The third problem is the commonly encountered bonded composite joints, which has a complex solution structure with moderate orders of stress singularities.

Wang, S. S.↗
NASA NTRSDate not supplied

Field Reconstruction from PIV Measurements Employing Bernstein Polynomial Derived Operators

A fluid-dynamic reconstruction algorithm is presented that generates a least-squares best-fit, two-dimensional density field from a prespecified two-dimensional velocity field. This method recasts the mass-conservation equation as a modified Sylvester equation employing high-order operators derived from modified Bernstein polynomial expansions. To demonstrate its practical utility, this analytic methodology is applied to two canonical cases and a Particle Image Velocimetry dataset obtained from a Mach-2, mechanically back-pressured, isolator experiment. This methodology is envisioned to be used in conjunction with hypersonic-diagnostic techniques to aid in the quantification of isolator flow fields. However, also note that this reconstruction technique is well suited to other applications relevant to fluid dynamics, such as obtaining three-dimensional flow field reconstructions.

Bernstein Polynomials↗
NASA NTRS1984

Non-nulling seven-hole probes for high angle flow measurement

This paper illustrates a method for calibrating seven-hole probes to measure local total and static pressures and relative flow angles of up to 70 degrees in subsonic compressible flows. The method of Latin Squares was used to statistically sample a large and otherwise unmanageable data set, thereby reducing to a minimum the number of data points required to construct a polynomial curve fit to the data. Calibration produces three-variable third order polynomials which permit all of the desired flow properties to be found explicitly from probe measured pressures. This method determines the flow angles to within 2 degrees and Mach number to within 0.04 with 95 percent certainty.

Gerner, A. A.↗
NASA NTRS1994

An Efficient Spectral Method for Ordinary Differential Equations with Rational Function Coefficients

We present some relations that allow the efficient approximate inversion of linear differential operators with rational function coefficients. We employ expansions in terms of a large class of orthogonal polynomial families, including all the classical orthogonal polynomials. These families obey a simple three-term recurrence relation for differentiation, which implies that on an appropriately restricted domain the differentiation operator has a unique banded inverse. The inverse is an integration operator for the family, and it is simply the tridiagonal coefficient matrix for the recurrence. Since in these families convolution operators (i.e. matrix representations of multiplication by a function) are banded for polynomials, we are able to obtain a banded representation for linear differential operators with rational coefficients. This leads to a method of solution of initial or boundary value problems that, besides having an operation count that scales linearly with the order of truncation N, is computationally well conditioned. Among the applications considered is the use of rational maps for the resolution of sharp interior layers.

Coutsias, Evangelos A.↗
NASA NTRS1985

Curved Finite Elements and Curve Approximation

The approximation of parameterized curves by segments of parabolas that pass through the endpoints of each curve segment arises naturally in all quadratic isoparametric transformations. While not as popular as cubics in curve design problems, the use of parabolas allows the introduction of a geometric measure of the discrepancy between given and approximating curves. The free parameters of the parabola may be used to optimize the fit, and constraints that prevent overspill and curve degeneracy are introduced. This leads to a constrained optimization problem in two varibles that can be solved quickly and reliably by a simple method that takes advantage of the special structure of the problem. For applications in the field of computer-aided design, the given curves are often cubic polynomials, and the coefficient may be calculated in closed form in terms of polynomial coefficients by using a symbolic machine language so that families of curves can be approximated with no further integration. For general curves, numerical quadrature may be used, as in the implementation where the Romberg quadrature is applied. The coefficient functions C sub 1 (gamma) and C sub 2 (gamma) are expanded as polynomials in gamma, so that for given A(s) and B(s) the integrations need only be done once. The method was used to find optimal constrained parabolic approximation to a wide variety of given curves.

Baart, M. L.↗