SEARCH · Search NASA
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.
Suboptimal, easily computable substitutes for the discrete prolate-spheroidal windows used by Thomson for spectral estimation are given. Trigonometric coefficients and energy leakages of the window polynomials are tabulated.
An analytical method has been developed to ensure closure of the cubic form of the tensor polynomial strength criterion. The intrinsic complexity of the cubic function is such that special conditions must be met to close the failure surface in three-dimensional stress space. These requirements are derived in terms of non-intersecting conditions for asymptotes and an asymptotic plane. To demonstrate the validity of this approach, closed failure surfaces were derived for two graphite/epoxy material systems (3M SP288-T300 and IM7 8551-7). The agreement of test data with this model clearly shows that it is possible to use a higher order cubic failure theory with confidence.
Orthogonal sets of trigonometric polynomials used as suboptimal substitutes for discrete prolate-spheroidal "windows" of Thomson method of estimation of spectra. As used here, "windows" denotes weighting functions used in sampling time series to obtain their power spectra within specified frequency bands. Simplified windows designed to require less computation than do discrete prolate-spheroidal windows, albeit at price of some loss of accuracy.
Explicitly solvable real Chebyshev approximation problems on the unit interval are typically characterized by simple error curves. A similar principle is presented for complex approximation problems with error curves induced by sine polynomials. As an application, some new explicit formulae for complex best approximations are derived.
The minimal polynomial extrapolation (MPE) and reduced rank extrapolation (RRE) are two effective techniques that have been used in accelerating the convergence of vector sequences, such as those that are obtained from iterative solution of linear and nonlinear systems of equation. Their definitions involve some linear least squares problems, and this causes difficulties in their numerical implementation. Timewise efficient and numerically stable implementations for MPE and RRE are developed. A computer program written in FORTRAN 77 is also appended and applied to some model problems.
Consideration is given to three-dimensional homogeneous polynomial systems, and some sufficient conditions for their asymptotic stability are derived by using homogeneous feedback. The tests given are geometric in nature.
Suboptimal, easily computable substitutes for the discrete prolate-spheroidal windows used by Thomson for spectral estimation are given. Trigonometric coefficients and energy leakages of the window polynomials are tabulated.
Transformations based on polynomial matrices of finite degree developed for use in computing functions for compensation, inversion, and approximation of discrete-time, multivariable, linear systems. Method derived from z-transform transfer-function form of matrices. Applicable to cascade-compensation problems in design of control systems.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.