Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “POLYNOMIAL”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

High-Order Polynomial Expansions (HOPE) for flux-vector splitting

The Van Leer flux splitting is known to produce excessive numerical dissipation for Navier-Stokes calculations. Researchers attempt to remedy this deficiency by introducing a higher order polynomial expansion (HOPE) for the mass flux. In addition to Van Leer's splitting, a term is introduced so that the mass diffusion error vanishes at M equals 0. Several splittings for pressure are proposed and examined. The effectiveness of the HOPE scheme is illustrated for 1-D hypersonic conical viscous flow and 2-D supersonic shock-wave boundary layer interactions. Also, the authors give the weakness of the scheme and suggest areas for further investigation.

Liou, Meng-Sing↗
NASA NTRS1990

New Bernstein type inequalities for polynomials on ellipses

New and sharp estimates are derived for the growth in the complex plane of polynomials known to have a curved majorant on a given ellipse. These so-called Bernstein type inequalities are closely connected with certain constrained Chebyshev approximation problems on ellipses. Also presented are some new results for approximation problems of this type.

Freund, Roland↗
NASA NTRS1991

Comparison of polynomial approximations and artificial neural nets for response surfaces in engineering optimization

Engineering optimization problems involve minimizing some function subject to constraints. In areas such as aircraft optimization, the constraint equations may be from numerous disciplines such as transfer of information between these disciplines and the optimization algorithm. They are also suited to problems which may require numerous re-optimizations such as in multi-objective function optimization or to problems where the design space contains numerous local minima, thus requiring repeated optimizations from different initial designs. Their use has been limited, however, by the fact that development of response surfaces randomly selected or preselected points in the design space. Thus, they have been thought to be inefficient compared to algorithms to the optimum solution. A development has taken place in the last several years which may effect the desirability of using response surfaces. It may be possible that artificial neural nets are more efficient in developing response surfaces than polynomial approximations which have been used in the past. This development is the concern of the work.

Carpenter, William C.↗
NASA NTRS1991

High-Order Polynomial Expansions (HOPE) for flux-vector splitting

The Van Leer flux splitting is known to produce excessive numerical dissipation for Navier-Stokes calculations. Researchers attempt to remedy this deficiency by introducing a higher order polynomial expansion (HOPE) for the mass flux. In addition to Van Leer's splitting, a term is introduced so that the mass diffusion error vanishes at M = 0. Several splittings for pressure are proposed and examined. The effectiveness of the HOPE scheme is illustrated for 1-D hypersonic conical viscous flow and 2-D supersonic shock-wave boundary layer interactions.

Liou, Meng-Sing↗
NASA NTRS1992

A comparison of polynomial approximations and artificial neural nets as response surfaces

Artificial neural nets and polynomial approximations were used to develop response surfaces for several test problems. Based on the number of functional evaluations required to build the approximations and the number of undetermined parameters associated with the approximations, the performance of the two types of approximations was found to be comparable. A rule of thumb is developed for determining the number of nodes to be used on a hidden layer of an artificial neural net, and the number of designs needed to train an approximation is discussed.

Carpenter, William C.↗
NASA NTRS1992

Polynomial coefficients for calculating O2 Schumann-Runge cross sections at 0.5/cm resolution

O2 cross sections from 49,000 to 57,000/cm have been fitted with temperature dependent polynomial expressions, providing an accurate and efficient means of determining Schumann-Runge band cross sections for temperatures between 130 and 500 K. The least squares fits were carried out on a 0.5/cm spectral grid, using cross sections obtained from a Schumann-Runge line-by-line model that incorporates the most recent spectroscopic data. The O2 cross sections do not include the underlying Herzberg continuum, but they do contain contributions from the temperature dependent Schumann-Runge continuum. The cross sections are suitable for use in UV transmission calculations at high spectral resolution. They should also prove useful for updating existing parameterizations of ultraviolet transmission and O2 photolysis.

Minschwaner, K.↗
NASA NTRS1993

Efficient Minimum-Polynomial And Reduced-Rank Extrapolation

MPERRE computer program accelerates convergence of sequence of vectors by use of minimum-polynomial extrapolation (MPE) and reduced-rank extrapolation (RRE). Effective in accelerating convergences of such sequences of vectors as those obtained from iterative solution of systems of linear and nonlinear equations. In conjunction with various iterative techniques, successfully employed in finite-difference solution of large-scale elliptic boundary-value problems and problems in computational-fluid-dynamics. Only input required is sequence of vectors, convergence of which is accelerated. Program economical and easy to use. Written in FORTRAN 77.

Sidi, Avram↗
NASA NTRS1992

Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems

Systems of linear equations with Toeplitz coefficient matrices arise in many important applications. The classical Levinson algorithm computes solutions of Toeplitz systems with only O(n(sub 2)) arithmetic operations, as compared to O(n(sub 3)) operations that are needed for solving general linear systems. However, the Levinson algorithm in its original form requires that all leading principal submatrices are nonsingular. An extension of the Levinson algorithm to general Toeplitz systems is presented. The algorithm uses look-ahead to skip over exactly singular, as well as ill-conditioned leading submatrices, and, at the same time, it still fully exploits the Toeplitz structure. In our derivation of this algorithm, we make use of the intimate connection of Toeplitz matrices with formally biorthogonal polynomials.

Freund, Roland W.↗
NASA NTRS1995

Fibonacci chain polynomials: Identities from self-similarity

Fibonacci chains are special diatomic, harmonic chains with uniform nearest neighbor interaction and two kinds of atoms (mass-ratio r) arranged according to the self-similar binary Fibonacci sequence ABAABABA..., which is obtained by repeated substitution of A yields AB and B yields A. The implications of the self-similarity of this sequence for the associated orthogonal polynomial systems which govern these Fibonacci chains with fixed mass-ratio r are studied.

Lang, Wolfdieter↗
NASA NTRS1995

A Ramanujan-type measure for the Askey-Wilson polynomials

A Ramanujan-type representation for the Askey-Wilson q-beta integral, admitting the transformation q to q(exp -1), is obtained. Orthogonality of the Askey-Wilson polynomials with respect to a measure, entering into this representation, is proved. A simple way of evaluating the Askey-Wilson q-beta integral is also given.

Atakishiyev, Natig M.↗
NASA NTRS1993

A UGO/EUTD Solution for the Scattering and Diffraction from Cubic Polynomial Strips

A uniform geometrical optics (UGO) and an extended uniform geometrical theory of diffraction (EUTD) solution is developed for the scattering and diffraction from perfectly conducting cubic polynomial strips. The new solution overcomes the difficulties of the classic GO/UTD solution near caustics and composite shadow boundaries. The approach for constructing the UGO/EUTD solution is based on a spatial domain physical optics (PO) radiation integral representation for the scattered field which is then reduced using a uniform asymptotic procedure. New uniform reflection, zero-curvature diffraction, and edge diffraction coefficients are derived and involve the ordinary and incomplete Airy integrals as canonical functions. Higher order effects such as double edge diffraction, edge-excited creeping waves, and whispering gallery modes are not examined in this work. The UGO/EUTD solution is very efficient and provides useful physical insight into the various scattering and diffraction processes. It is also universal in nature and can be used to effectively describe the scattered fields from flat, strictly concave or convex, and concave-convex boundaries containing edges. Its accuracy is confirmed via comparison with some reference moment method (MM) results.

Constantinides, Evagoras D.↗
NASA NTRS1998

A Polynomial Time, Numerically Stable Integer Relation Algorithm

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

Ferguson, Helaman R. P.↗
NASA NTRS2011

Least-Squares Adaptive Control Using Chebyshev Orthogonal Polynomials

This paper presents a new adaptive control approach using Chebyshev orthogonal polynomials as basis functions in a least-squares functional approximation. The use of orthogonal basis functions improves the function approximation significantly and enables better convergence of parameter estimates. Flight control simulations demonstrate the effectiveness of the proposed adaptive control approach.

Nguyen, Nhan T.↗
NASA NTRS2011

Uncertainty Analysis via Failure Domain Characterization: Polynomial Requirement Functions

This paper proposes an uncertainty analysis framework based on the characterization of the uncertain parameter space. This characterization enables the identification of worst-case uncertainty combinations and the approximation of the failure and safe domains with a high level of accuracy. Because these approximations are comprised of subsets of readily computable probability, they enable the calculation of arbitrarily tight upper and lower bounds to the failure probability. A Bernstein expansion approach is used to size hyper-rectangular subsets while a sum of squares programming approach is used to size quasi-ellipsoidal subsets. These methods are applicable to requirement functions whose functional dependency on the uncertainty is a known polynomial. Some of the most prominent features of the methodology are the substantial desensitization of the calculations from the uncertainty model assumed (i.e., the probability distribution describing the uncertainty) as well as the accommodation for changes in such a model with a practically insignificant amount of computational effort.

Crespo, Luis G.↗
NASA NTRS2017

Multifidelity, Multidisciplinary Design Under Uncertainty with Non-Intrusive Polynomial Chaos

The primary objective of this work is to develop an approach for multifidelity uncertainty quantification and to lay the framework for future design under uncertainty efforts. In this study, multifidelity is used to describe both the fidelity of the modeling of the physical systems, as well as the difference in the uncertainty in each of the models. For computational efficiency, a multifidelity surrogate modeling approach based on non-intrusive polynomial chaos using the point-collocation technique is developed for the treatment of both multifidelity modeling and multifidelity uncertainty modeling. Two stochastic model problems are used to demonstrate the developed methodologies: a transonic airfoil model and multidisciplinary aircraft analysis model. The results of both showed the multifidelity modeling approach was able to predict the output uncertainty predicted by the high-fidelity model as a significant reduction in computational cost.

West, Thomas K., IV↗
NASA NTRS2017

Autonomous Guidance Navigation and Control for Agile Quadrotors Using Polynomial Trajectory Planning and L1 Adaptive Control

We address the challenge to allow efficient autonomous flight in real world environments, both indoor and outdoor. We use a straight-line SE-SCP (Spherical Expansion and Sequential Convex Programming) [algorithm] to find an initial route through the environment and minimum snap trajectory generation using piecewise polynomials. Then, we implement an adaptive robust control able to address some robustness issues for quadrotors in outdoor flight, such as mass variation and wind disturbances. Coupling these techniques we allow high-speed and aggressive autonomous flight through obstacle-dense indoor environments, as well as address outdoor disturbances.

Landolfi, Mattia↗
NASA NTRS2020

Mid Lift-to-Drag Ratio Rigid Vehicle 6-DoF Performance for Human Mars Entry, Descent, and Landing: A Fractional Polynomial Powered Descent Guidance Approach

Defining a feasible vehicle design and mission architecture capable of reliably delivering apayload of 20 metric tons (mt) or more is a great challenge for landing humans on Mars. TheMid Lift-to-Drag Rigid Vehicle (MRV), a rigid decelerator studied in NASA’s Entry, Descent,and Landing Architecture Study (EDLAS), has shown to be a viable vehicle candidate forfuture human Mars missions. As the vehicle concept matures, models of increasing fidelity areadded to the six-degree-of-freedom (6DoF) EDL simulation. This paper presents 6DoFsimulation results using model updates for vehicle mass properties, fineness ratio, andaerodynamic-propulsive interactions. Additionally, an assessment of the Fractional-Polynomial Powered Descent Guidance (FP2DG) performance is presented, and the vehicleperformance is compared with the Tunable Apollo Powered Descent Guidance (TAPDG).Finally, Monte Carlo results of the vehicle design trades are presented.

Johnson, Breanna J.↗