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

Spectral (Finite) Volume Method for One Dimensional Euler Equations

Consider a mesh of unstructured triangular cells. Each cell is called a Spectral Volume (SV), denoted by Si, which is further partitioned into subcells named Control Volumes (CVs), indicated by C(sub i,j). To represent the solution as a polynomial of degree m in two dimensions (2D) we need N = (m+1)(m+2)/2 pieces of independent information, or degrees of freedom (DOFs). The DOFs in a SV method are the volume-averaged mean variables at the N CVs. For example, to build a quadratic reconstruction in 2D, we need at least (2+1)(3+1)/2 = 6 DOFs. There are numerous ways of partitioning a SV, and not every partition is admissible in the sense that the partition may not be capable of producing a degree m polynomial. Once N mean solutions in the CVs of a SV are given, a unique polynomial reconstruction can be obtained.

Wang, Z. J.↗
NASA NTRS1980

Application of an advanced trajectory optimization method to ramjet propelled missiles

The mission performance characteristics of ramjet-propelled missiles are highly dependent upon the trajectory flown. Integration of the trajectory profile with the ramjet propulsion system performance characteristics to achieve optimal missile performance is very complex. Past trajectory optimization methods have been extremely problem dependent and require a high degree of familiarity to achieve success. A general computer code (CTOP) has been applied to ramjet-powered missiles to compute open-loop optimal trajectories. CTOP employs Chebyshev polynomial representations of the states and controls. This allows a transformation of the continuous optimal control problem to one of parameter optimization. With this method, the trajectory boundary conditions are always satisfied. State dynamics and path constraints are enforced via penalty functions. The presented results include solutions to minimum fuel-to-climb, minimum time-to-climb, and minimum time-to-target intercept problems.

Paris, S. W.↗
NASA NTRS1990

An improved method to determine vibration damping of materials and structural components

The present, improved frequency-domain technique for vibration-damping estimation involves the fitting of a 'best curve' for the measured frequency-response data near a resonance by means of a least-squares error criterion. The damping ratio and the undamped natural frequency are then computed using the coefficients of the rational fraction polynomial that had been determined on the basis of the curve-fitting technique. Attention is given to the results of this method's application to damping measurements for graphite-reinforced epoxy composites. The results obtained are superior to those of the 'half-power points' method.

Rao, Mohan D.↗
DOE OSTI2025

Efficient sparse state preparation via quantum walks

Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work, we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla-free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.

dynamic continuous time quantum walks↗
NASA NTRS1979

Recurrence relations for computing with modified divided differences

Modified divided differences (MDD) provide a good way of representing a polynomial passing through points with unequally spaced abscissas. This note gives recurrence relations for computing coefficients in either the monomial or Chebyshev basis from the MDD coefficients, and for computing the MDD coefficients for either the differentiated or the integrated polynomial. The latter operation is likely to be useful if MDD are used in a method for solving stiff differential equations.

Krogh, F. T.↗
NASA NTRS1986

Three-dimensional vibrations of twisted cantilevered parallelepipeds

A large number of references dealing with the vibrations of twisted, cantilevered beams and plates exist in the literature. These works show considerable disagreement concerning the effect of twist angle upon frequencies. The present work is the first three-dimensional study of the problem. Displacement components are assumed in the form of algebraic polynomials which satisfy the fixed face conditions exactly, and which are mathematically complete. The Ritz method is then applied. Accurate frequencies are calculated for twisted thick plates and are compared with ones obtained recently by others using beam, shell, and finite element theory.

Leissa, A.↗
NASA NTRS1988

Numerical solution of large nonsymmetric eigenvalue problems

Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures and preconditionings, for computing a small number of eigenvalues and eigenvectors or Schur vectors of large sparse matrices. The most effective techniques for solving realistic problems from applications are those methods based on some form of preconditioning and one of several Krylov subspace techniques, such as Arnoldi's method or Lanczos procedure. Two forms of preconditioning are considered: shift-and-invert and polynomial acceleration. The latter presents some advantages for parallel/vector processing but may be ineffective if eigenvalues inside the spectrum are sought. Some algorithmic details are provided that improve the reliability and effectiveness of these techniques.

Saad, Youcef↗
NASA NTRS2003

Wind Tunnel Database Development using Modern Experiment Design and Multivariate Orthogonal Functions

A wind tunnel experiment for characterizing the aerodynamic and propulsion forces and moments acting on a research model airplane is described. The model airplane called the Free-flying Airplane for Sub-scale Experimental Research (FASER), is a modified off-the-shelf radio-controlled model airplane, with 7 ft wingspan, a tractor propeller driven by an electric motor, and aerobatic capability. FASER was tested in the NASA Langley 12-foot Low-Speed Wind Tunnel, using a combination of traditional sweeps and modern experiment design. Power level was included as an independent variable in the wind tunnel test, to allow characterization of power effects on aerodynamic forces and moments. A modeling technique that employs multivariate orthogonal functions was used to develop accurate analytic models for the aerodynamic and propulsion force and moment coefficient dependencies from the wind tunnel data. Efficient methods for generating orthogonal modeling functions, expanding the orthogonal modeling functions in terms of ordinary polynomial functions, and analytical orthogonal blocking were developed and discussed. The resulting models comprise a set of smooth, differentiable functions for the non-dimensional aerodynamic force and moment coefficients in terms of ordinary polynomials in the independent variables, suitable for nonlinear aircraft simulation.

Morelli, Eugene A.↗
DOE OSTI2025

Quantitative Trade-Off in Distributed Secondary Control for Autonomous AC Microgrids

In this paper, we propose to quantify the trade-off between voltage regulation and reactive power sharing in autonomous AC microgrids with distributed secondary control. It is known that voltage regulation and reactive power sharing in droop-controlled autonomous AC microgrids are two conflicting control objectives that present a natural trade-off between voltage regulation towards the voltage magnitude reference and reactive power sharing accuracy. This trade-off is commonly shown qualitatively without sufficient quantification. In this work, to quantify the trade-off between the two objectives, we focus on distributed secondary control and utilize regression and polynomial surface fitting to identify the requisite parameter area to satisfy the predefined error bands for voltage magnitude regulation and reactive power sharing. Extensive case studies are presented to validate the proposed method.

autonomous AC microgrids↗
NASA NTRS1989

Efficient computer algebra algorithms for polynomial matrices in control design

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

Baras, J. S.↗
NASA NTRSDate not supplied

Uncertainty Estimates for Fitting Zernike Polynomials to Discrete Data

Zernike polynomials are a widely used metric in modern optical analysis. They conveniently represent surfaces as a series of weighted terms corresponding to various optical aberrations. Ideally, each term is independent of others in the series, but Zernike polynomials lose this property when working with sets of discrete data. This gives rise to uncertainty in each polynomial’s actual contribution and affects metrology and simulation estimates of their relative weights. Several factors influencing these estimates are the number and arrangement of sample locations, the method for calculating the weights, and the total number of Zernike terms used in the calculation. Discussed is the uncertainty associated with linear regression using random sampling. Other topics reviewed are complex Zernike polynomials and vector spaces of functions.

Zernike Polynomials↗
NASA NTRS1972

Simplified methods for interpreting the effect of transfer-function zeros on the transient response of aircraft

Two simple methods are outlined for evaluating the effect of transfer-function zeros on the system time response. The pole effects can also be evaluated. These methods are useful for simplified analysis or creating design criteria in terms of desirable regions of pole-zero locations. The type of transfer function studied is limited to those linear systems. Corresponding to ordinary longitudinal or lateral aircraft transfer functions, the denominator polynomial is of fourth order and the numerator of third order at most. With the longitudinal motion of the aircraft as an example, the methods are used in the evaluation of optimal regulator control with respect to a particular performance index structure.

Onken, R.↗
NASA NTRS1980

A general panel method for the analysis and design of arbitrary configurations in incompressible flows

A method for solving the linear integral equations of incompressible potential flow in three dimensions is presented. Both analysis (Neumann) and design (Dirichlet) boundary conditions are treated in a unified approach to the general flow problem. The method is an influence coefficient scheme which employs source and doublet panels as boundary surfaces. Curved panels possessing singularity strengths, which vary as polynomials are used, and all influence coefficients are derived in closed form. These and other features combine to produce an efficient scheme which is not only versatile but eminently suited to the practical realities of a user-oriented environment. A wide variety of numerical results demonstrating the method is presented.

Johnson, F. T.↗
NASA NTRS1997

LQR Control of Thin Shell Dynamics: Formulation and Numerical Implementation

A PDE-based feedback control method for thin cylindrical shells with surface-mounted piezoceramic actuators is presented. Donnell-Mushtari equations modified to incorporate both passive and active piezoceramic patch contributions are used to model the system dynamics. The well-posedness of this model and the associated LQR problem with an unbounded input operator are established through analytic semigroup theory. The model is discretized using a Galerkin expansion with basis functions constructed from Fourier polynomials tensored with cubic splines, and convergence criteria for the associated approximate LQR problem are established. The effectiveness of the method for attenuating the coupled longitudinal, circumferential and transverse shell displacements is illustrated through a set of numerical examples.

delRosario, R. C. H.↗
DOE OSTI2026

Adaptive spectra-to-exposure conversion using ridge regularized polynomial response models

Real-time gamma spectra-to-exposure conversion in aerial and ground monitoring commonly relies on calibration-derived, detector- or system-specific conversion coefficients that are assumed to generalize across operational environments. In practice, deployment specific differences in spectral composition and transport conditions can introduce systematic bias relative to reference instruments, motivating methods that adapt coefficients using minimal field supervision while explicitly limiting overfitting. In this work, we present a conservative coefficient adaptation framework that updates a baseline polynomial energy-weighting function using ridge-regularized regression, with leave-one-out cross-validation (LOOCV) used to select the regularization strength. The findings support ridge-constrained minimal-supervision adaptation as a practical mechanism to suppress site-specific bias without destabilizing a calibration-derived baseline.

61 RADIATION PROTECTION AND DOSIMETRY↗
NASA NTRS1980

The spectral opacity of triatomic carbon measured in a graphite tube furnace over the 280 to 600 nm wavelength range

The paper presents the measurements of linear triatomic carbon opacity (C3) made in a graphite tube furnace to extend the wavelength range of Brewer and Engelke (1962) to the 280-600 nm range. An electrooptical method was used to determine C3 absorption in argon at 2720 to 3060 K; a quartic polynomial regression expression was derived to provide a complete temperature profile from pyrometer measurements. The C3 spectra were plotted for several opacity levels. It was concluded that the extension of the spectral range to the near u.v. levels made it easier to identify C3 particles.

Snow, W. L.↗
NASA NTRS1983

Spectral multigrid methods for elliptic equations 2

A detailed description of spectral multigrid methods is provided. This includes the interpolation and coarse-grid operators for both periodic and Dirichlet problems. The spectral methods for periodic problems use Fourier series and those for Dirichlet problems are based upon Chebyshev polynomials. An improved preconditioning for Dirichlet problems is given. Numerical examples and practical advice are included.

Zang, T. A.↗