SEARCH · Search NASA

Results for “polynomials”

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 469 records · Page 26

All sources NASA NTRS DOE OSTI

NASA NTRS1990

Convergence acceleration for vector sequences and applications to computational fluid dynamics

Some recent developments in acceleration of convergence methods for vector sequences are reviewed. The methods considered are the minimal polynomial extrapolation, the reduced rank extrapolation, and the modified minimal polynomial extrapolation. The vector sequences to be accelerated are those that are obtained from the iterative solution of linear or nonlinear systems of equations. The convergence and stability properties of these methods as well as different ways of numerical implementation are discussed in detail. Based on the convergence and stability results, strategies that are useful in practical applications are suggested. Two applications to computational fluid mechanics involving the three dimensional Euler equations for ducted and external flows are considered. The numerical results demonstrate the usefulness of the methods in accelerating the convergence of the time marching techniques in the solution of steady state problems.

Sidi, Avram↗

NASA NTRS1989

Image defects from surface and alignment errors in grazing incidence telescopes

The rigid body motions and low frequency surface errors of grazing incidence Wolter telescopes are studied. The analysis is based on surface error descriptors proposed by Paul Glenn. In his analysis, the alignment and surface errors are expressed in terms of Legendre-Fourier polynomials. Individual terms in the expression correspond to rigid body motions (decenter and tilt) and low spatial frequency surface errors of mirrors. With the help of the Legendre-Fourier polynomials and the geometry of grazing incidence telescopes, exact and approximated first order equations are derived in this paper for the components of the ray intercepts at the image plane. These equations are then used to calculate the sensitivities of Wolter type I and II telescopes for the rigid body motions and surface deformations. The rms spot diameters calculated from this theory and OSAC ray tracing code agree very well. This theory also provides a tool to predict how rigid body motions and surface errors of the mirrors compensate each other.

Saha, Timo T.↗

NASA NTRS1990

On complexity of trellis structure of linear block codes

The trellis structure of linear block codes (LBCs) is discussed. The state and branch complexities of a trellis diagram (TD) for a LBC is investigated. The TD with the minimum number of states is said to be minimal. The branch complexity of a minimal TD for a LBC is expressed in terms of the dimensions of specific subcodes of the given code. Then upper and lower bounds are derived on the number of states of a minimal TD for a LBC, and it is shown that a cyclic (or shortened cyclic) code is the worst in terms of the state complexity among the LBCs of the same length and dimension. Furthermore, it is shown that the structural complexity of a minimal TD for a LBC depends on the order of its bit positions. This fact suggests that an appropriate permutation of the bit positions of a code may result in an equivalent code with a much simpler minimal TD. Boolean polynomial representation of codewords of a LBC is also considered. This representation helps in study of the trellis structure of the code. Boolean polynomial representation of a code is applied to construct its minimal TD. Particularly, the construction of minimal trellises for Reed-Muller codes and the extended and permuted binary primitive BCH codes which contain Reed-Muller as subcodes is emphasized. Finally, the structural complexity of minimal trellises for the extended and permuted, and double-error-correcting BCH codes is analyzed and presented. It is shown that these codes have relatively simple trellis structure and hence can be decoded with the Viterbi decoding algorithm.

Lin, Shu↗

NASA NTRS1991

Planetary ephemerides approximation for radar astronomy

The planetary ephemerides approximation for radar astronomy is discussed, and, in particular, the effect of this approximation on the performance of the programmable local oscillator (PLO) used in Goldstone Solar System Radar is presented. Four different approaches are considered and it is shown that the Gram polynomials outperform the commonly used technique based on Chebyshev polynomials. These methods are used to analyze the mean square, the phase error, and the frequency tracking error in the presence of the worst case Doppler shift that one may encounter within the solar system. It is shown that in the worst case the phase error is under one degree and the frequency tracking error less than one hertz when the frequency to the PLO is updated every millisecond.

Sadr, R.↗

NASA NTRS1990

Analysis of spectral projectors in one-dimensional domains

A class of projection operators with values in a subspace of polynomials is analyzed. These projection operators are related to the Hilbert spaces involved in the numerical analysis of spectral methods. They are, in the first part of the paper, the standard Sobolev spaces and, in the second part, some weighted Sobolev spaces, the weight of which is related to the orthoronality relation satisfied by the Chebyshev polynomials. These results are used to study the approximation of a model fourth-order problem.

Maday, Y.↗

NASA NTRS1991

l1-optimal control of multivariable systems with output norm constraints

This paper considers the l1-optimal control problem for general rational plants. It is shown that, for plants with no poles or zeros on the unit circle, an optimal compensator exists and that the resulting closed loop transfer function is polynomial whenever there are at least as many controls as regulated outputs and at least as many measurements as exogeneous inputs. Exactly or approximately, optimal rational compensators can be obtained by solving a sequence of finite linear programs for the coefficients of a polynomial closed-loop transfer function. No assumptions on plant poles or zeros are required to obtain at least approximately optimal compensators. It is shown that constrained problems in which a set of outputs is regulated subject to l(infinity)-norm constraints on another set of outputs can be solved using a slight modification of the same algorithm.

Mcdonald, J. S.↗

NASA NTRS1991

How to observe the gyre to global-scale variability in satellite altimetry - Signal attenuation by orbit error removal

Formulas analogous to the frequency response functions for commonly used filters in orbit error removal are analytically derived to devise observational strategies for the large-scale oceanic variability and to decipher the signal contents of previous results. These include the polynomial orbit error approximations, i.e., the linear, bias-only and quadratic corrections, and the sinusoidal orbit error approximations (the purely sinusoidal correction, and the sinusoid-and-bias correction). It is shown that the frequency response function for a polynomial correction is a function of the ratio of wavelength/track length and to retain 90 percent or more of the signal at a certain wavelength, the ratio must be less than 0.65 (for the quadratic case), 0.90 (linear), and 1.54 (bias-only).

Tai, Chang-Kou↗

NASA NTRS1992

Fast Transform Decoding Of Nonsystematic Reed-Solomon Codes

Fast, efficient Fermat number transform used to compute F'(x) analogous to computation of syndrome in conventional decoding scheme. Eliminates polynomial multiplications and reduces number of multiplications in reconstruction of F'(x) to n log (n). Euclidean algorithm used to evaluate F(x) directly, without going through intermediate steps of solving error-locator and error-evaluator polynomials. Algorithm suitable for implementation in very-large-scale integrated circuits.

Truong, Trieu-Kie↗

NASA NTRS1991

Control algorithms for aerobraking in the Martian atmosphere

The Analytic Predictor Corrector (APC) and Energy Controller (EC) atmospheric guidance concepts were adapted to control an interplanetary vehicle aerobraking in the Martian atmosphere. Changes are made to the APC to improve its robustness to density variations. These changes include adaptation of a new exit phase algorithm, an adaptive transition velocity to initiate the exit phase, refinement of the reference dynamic pressure calculation and two improved density estimation techniques. The modified controller with the hybrid density estimation technique is called the Mars Hybrid Predictor Corrector (MHPC), while the modified controller with a polynomial density estimator is called the Mars Predictor Corrector (MPC). A Lyapunov Steepest Descent Controller (LSDC) is adapted to control the vehicle. The LSDC lacked robustness, so a Lyapunov tracking exit phase algorithm is developed to guide the vehicle along a reference trajectory. This algorithm, when using the hybrid density estimation technique to define the reference path, is called the Lyapunov Hybrid Tracking Controller (LHTC). With the polynomial density estimator used to define the reference trajectory, the algorithm is called the Lyapunov Tracking Controller (LTC). These four new controllers are tested using a six degree of freedom computer simulation to evaluate their robustness. The MHPC, MPC, LHTC, and LTC show dramatic improvements in robustness over the APC and EC.

Ward, Donald T.↗

NASA NTRS1991

Robust control of systems with real parameter uncertainty and unmodelled dynamics

During this research period we have made significant progress in the four proposed areas: (1) design of robust controllers via H infinity optimization; (2) design of robust controllers via mixed H2/H infinity optimization; (3) M-delta structure and robust stability analysis for structured uncertainties; and (4) a study on controllability and observability of perturbed plant. It is well known now that the two-Riccati-equation solution to the H infinity control problem can be used to characterize all possible stabilizing optimal or suboptimal H infinity controllers if the optimal H infinity norm or gamma, an upper bound of a suboptimal H infinity norm, is given. In this research, we discovered some useful properties of these H infinity Riccati solutions. Among them, the most prominent one is that the spectral radius of the product of these two Riccati solutions is a continuous, nonincreasing, convex function of gamma in the domain of interest. Based on these properties, quadratically convergent algorithms are developed to compute the optimal H infinity norm. We also set up a detailed procedure for applying the H infinity theory to robust control systems design. The desire to design controllers with H infinity robustness but H(exp 2) performance has recently resulted in mixed H(exp 2) and H infinity control problem formulation. The mixed H(exp 2)/H infinity problem have drawn the attention of many investigators. However, solution is only available for special cases of this problem. We formulated a relatively realistic control problem with H(exp 2) performance index and H infinity robustness constraint into a more general mixed H(exp 2)/H infinity problem. No optimal solution yet is available for this more general mixed H(exp 2)/H infinity problem. Although the optimal solution for this mixed H(exp 2)/H infinity control has not yet been found, we proposed a design approach which can be used through proper choice of the available design parameters to influence both robustness and performance. For a large class of linear time-invariant systems with real parametric perturbations, the coefficient vector of the characteristic polynomial is a multilinear function of the real parameter vector. Based on this multilinear mapping relationship together with the recent developments for polytopic polynomials and parameter domain partition technique, we proposed an iterative algorithm for coupling the real structured singular value.

Chang, Bor-Chin↗

NASA NTRS1992

Upper bounds for convergence rates of vector extrapolation methods on linear systems with initial iterations

The application of the minimal polynomial extrapolation (MPE) and the reduced rank extrapolation (RRE) to a vector sequence obtained by the linear iterative technique x(sub j) + 1 = Ax(sub j) = b,j = 1,2,..., is considered. Both methods produce a two dimensional array of approximations s(sub n,k) to the solution of the system (I - A)x = b. Here, s(sub n,k) is obtained from the vectors x(sub j), n is less than or equal to j is less than or equal to n + k + 1. It was observed in an earlier publication by the first author that the sequence s(sub n,k), k = 1,2,..., for n greater than 0, but fixed, possesses better convergence properties than the sequence s(sub 0,k), k = 1,2,.... A detailed theoretical explanation for this phenomenon is provided in the present work. This explanation is heavily based on approximations by incomplete polynomials. It is demonstrated by numerical examples when the matrix A is sparse that cycling with s(sub n,k) for n greater than 0, but fixed, produces better convergence rates and costs less computationally than cycling with s(sub 0,k). It is also illustrated numerically with a convection-diffusion problem that the former may produce excellent results where the latter may fail completely. As has been shown in an earlier publication, the results produced by s(sub 0,k) are identical to the corresponding results obtained by applying the Arnoldi method or generalized minimal residual scheme (GMRES) to the system (I - A)x = b.

Sidi, Avram↗

NASA NTRS1991

A Lagrange multiplier based divide and conquer finite element algorithm

A novel domain decomposition method based on a hybrid variational principle is presented. Prior to any computation, a given finite element mesh is torn into a set of totally disconnected submeshes. First, an incomplete solution is computed in each subdomain. Next, the compatibility of the displacement field at the interface nodes is enforced via discrete, polynomial and/or piecewise polynomial Lagrange multipliers. In the static case, each floating subdomain induces a local singularity that is resolved very efficiently. The interface problem associated with this domain decomposition method is, in general, indefinite and of variable size. A dedicated conjugate projected gradient algorithm is developed for solving the latter problem when it is not feasible to explicitly assemble the interface operator. When implemented on local memory multiprocessors, the proposed methodology requires less interprocessor communication than the classical method of substructuring. It is also suitable for parallel/vector computers with shared memory and compares favorably with factorization based parallel direct methods.

Farhat, C.↗

NASA NTRS1992

Estimation of excitation energy of diatomic molecules in expanding nonequilibrium flows

The energy contained in the highly excited vibrational and rotational states in a diatomic gas in a thermochemical nonequilibrium state during expansion is estimated. The estimation is made on the assumption that the populations of the vibrational and rotational states, when normalized by their respective equilibrium values, are describable by simple functions containing no more than four arbitrary parameters. A cubic polynomial, a logarithmic-cubic polynomial, and a bimodal step function are used for this purpose. The four parameters are determined by imposing conditions known at the ground state and the dissociation limit and the mass conservation law. The energy in excess of that accounted for by assuming a Boltzmann distribution of these states, defined here as excess excitation energy, is calculated for N2, O2, NO, CO, OH, and H2. A calculation made for a typical nozzle flow shows that the excess energy may reach 6 percent of the total enthalpy of the flow, and that the flow velocity may decrease by as much as 4 percent due to the nonequilibrium excitation phenomenon.

Park, Chul↗

NASA NTRS1993

Positivity-preserving numerical schemes for multidimensional advection

This report describes the construction of an explicit, single time-step, conservative, finite-volume method for multidimensional advective flow, based on a uniformly third-order polynomial interpolation algorithm (UTOPIA). Particular attention is paid to the problem of flow-to-grid angle-dependent, anisotropic distortion typical of one-dimensional schemes used component-wise. The third-order multidimensional scheme automatically includes certain cross-difference terms that guarantee good isotropy (and stability). However, above first-order, polynomial-based advection schemes do not preserve positivity (the multidimensional analogue of monotonicity). For this reason, a multidimensional generalization of the first author's universal flux-limiter is sought. This is a very challenging problem. A simple flux-limiter can be found; but this introduces strong anisotropic distortion. A more sophisticated technique, limiting part of the flux and then restoring the isotropy-maintaining cross-terms afterwards, gives more satisfactory results. Test cases are confined to two dimensions; three-dimensional extensions are briefly discussed.

Leonard, B. P.↗

NASA NTRS1992

Design of an essentially non-oscillatory reconstruction procedure in finite-element type meshes

An essentially non oscillatory reconstruction for functions defined on finite element type meshes is designed. Two related problems are studied: the interpolation of possibly unsmooth multivariate functions on arbitary meshes and the reconstruction of a function from its averages in the control volumes surrounding the nodes of the mesh. Concerning the first problem, the behavior of the highest coefficients of two polynomial interpolations of a function that may admit discontinuities of locally regular curves is studied: the Lagrange interpolation and an approximation such that the mean of the polynomial on any control volume is equal to that of the function to be approximated. This enables the best stencil for the approximation to be chosen. The choice of the smallest possible number of stencils is addressed. Concerning the reconstruction problem, two methods were studied: one based on an adaptation of the so called reconstruction via deconvolution method to irregular meshes and one that lies on the approximation on the mean as defined above. The first method is conservative up to a quadrature formula and the second one is exactly conservative. The two methods have the expected order of accuracy, but the second one is much less expensive than the first one. Some numerical examples are given which demonstrate the efficiency of the reconstruction.

Abgrall, Remi↗

NASA NTRS1991

A fast algorithm for image-based ranging

Image-based ranging has emerged as a critical issue in the low altitude operation of flight vehicles such as rotorcraft and planetary landers. These flight regimes require ranging systems for recovering the geometry of the terrain and obstacles for use with guidance algorithms. The development of a ranging equation combining image irradiance together with various order spatial partial derivatives and the vehicle motion parameters is discussed. The ranging equation is in the form of a polynomial in scene depth. Two-dimensional linear filters are then used to compute the coefficients of this polynomial to result in a fast image-based ranging algorithm. Performance of the algorithm is demonstrated using laboratory images.

Menon, P. K. A.↗

NASA NTRS1993

Random interactions in higher order neural networks

Recurrent networks of polynomial threshold elements with random symmetric interactions are studied. Precise asymptotic estimates are derived for the expected number of fixed points as a function of the margin of stability. In particular, it is shown that there is a critical range of margins of stability (depending on the degree of polynomial interaction) such that the expected number of fixed points with margins below the critical range grows exponentially with the number of nodes in the network, while the expected number of fixed points with margins above the critical range decreases exponentially with the number of nodes in the network. The random energy model is also briefly examined and links with higher order neural networks and higher order spin glass models made explicit.

Baldi, Pierre↗

NASA NTRS1992

Symbolic discrete event system specification

Extending discrete event modeling formalisms to facilitate greater symbol manipulation capabilities is important to further their use in intelligent control and design of high autonomy systems. An extension to the DEVS formalism that facilitates symbolic expression of event times by extending the time base from the real numbers to the field of linear polynomials over the reals is defined. A simulation algorithm is developed to generate the branching trajectories resulting from the underlying nondeterminism. To efficiently manage symbolic constraints, a consistency checking algorithm for linear polynomial constraints based on feasibility checking algorithms borrowed from linear programming has been developed. The extended formalism offers a convenient means to conduct multiple, simultaneous explorations of model behaviors. Examples of application are given with concentration on fault model analysis.

Zeigler, Bernard P.↗