Search NASA⌕ Search

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.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Design Under Uncertainty for Conceptual Aircraft Design Leveraging Analytical Gradients

The purpose of this paper is to extend previously demonstrated methodologies for design under uncertainty, leveraging analytical gradients to higher fidelity analysis for use in conceptual aircraft design. Previous work developed methods to generate analytical derivatives through polynomial chaos expansion, eliminating the need to estimate derivatives via complex step or finite difference. In this research, the authors build upon the methods to include physics-based aircraft design codes for aircraft design under uncertainty. This extends the previous work’s case study, which employed analytical aerodynamics and Breguet range estimations for wing design, to a higher fidelity level. In addition, this work extends previous work on interface development between the Uncertainty Quantification with Polynomial Chaos Expansion (UQPCE) software and Model-Based Systems Analysis and Engineering (MBSA&E) frameworks. This paper will discuss the development work necessary to perform multidisciplinary design under uncertainty as well as demonstrate the mechanics of interfacing UQPCE and conceptual aircraft design tools such as NASA’s Aviary code. In a case study, a conceptual aircraft design under uncertainty was conducted and compared against a traditional deterministic design. When given information about the uncertainty space from UQPCE, the optimizer was able to shape the output distribution and produce a more robust design

UQ↗
NASA NTRSDate not supplied

Design Under Uncertainty for Conceptual Aircraft Design Leveraging Analytical Gradients

The purpose of this paper is to extend previously demonstrated methodologies for design under uncertainty, leveraging analytical gradients to higher fidelity analysis for use in conceptual aircraft design. Previous work developed methods to generate analytical derivatives through polynomial chaos expansion, eliminating the need to estimate derivatives via complex step or finite difference. In this research, the authors build upon the methods to include physics-based aircraft design codes for aircraft design under uncertainty. This extends the previous work’s case study, which employed analytical aerodynamics and Breguet range estimations for wing design, to a higher fidelity level. In addition, this work extends previous work on interface development between the Uncertainty Quantification with Polynomial Chaos Expansion (UQPCE) software and Model-Based Systems Analysis and Engineering (MBSA&E) frameworks. This paper will discuss the development work necessary to perform multidisciplinary design under uncertainty as well as demonstrate the mechanics of interfacing UQPCE and conceptual aircraft design tools such as NASA’s Aviary code. In a case study, a conceptual aircraft design under uncertainty was conducted and compared against a traditional deterministic design. When given information about the uncertainty space from UQPCE, the optimizer was able to shape the output distribution and produce a more robust design.

UQ↗
NASA NTRS1966

Computation research

Least squares method used in linearizing roots of polynomial and to derive approximations

APPROXIMATION METHOD↗
NASA NTRS1999

Quantum Algorithms

This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.

Quantum Algorithms polynomial time algorithm Hamil↗
NASA NTRS2007

Optimizations of a Hardware Decoder for Deep-Space Optical Communications

The National Aeronautics and Space Administration has developed a capacity approaching modulation and coding scheme that comprises a serial concatenation of an inner accumulate pulse-position modulation (PPM) and an outer convolutional code [or serially concatenated PPM (SCPPM)] for deep-space optical communications. Decoding of this code uses the turbo principle. However, due to the nonbinary property of SCPPM, a straightforward application of classical turbo decoding is very inefficient. Here, we present various optimizations applicable in hardware implementation of the SCPPM decoder. More specifically, we feature a Super Gamma computation to efficiently handle parallel trellis edges, a pipeline-friendly 'maxstar top-2' circuit that reduces the max-only approximation penalty, a low-latency cyclic redundancy check circuit for window-based decoders, and a high-speed algorithmic polynomial interleaver that leads to memory savings. Using the featured optimizations, we implement a 6.72 megabits-per-second (Mbps) SCPPM decoder on a single field-programmable gate array (FPGA). Compared to the current data rate of 256 kilobits per second from Mars, the SCPPM coded scheme represents a throughput increase of more than twenty-six fold. Extension to a 50-Mbps decoder on a board with multiple FPGAs follows naturally. We show through hardware simulations that the SCPPM coded system can operate within 1 dB of the Shannon capacity at nominal operating conditions.

quadratic polynomial interleaver↗
NASA NTRSDate not supplied

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

This paper presents a receding horizon model predictive control variation of the combined Bernstein polynomial optimal reciprocal collision avoidance (ORCA) differential dynamic programming (COBRA-DDP) algorithm for AAM vehicles. Collision avoidance in combination with effective trajectory replanning are expected to be core components of AAM vehicles operating within a crowded airspace. This environment necessitates the use of real-time trajectory planning algorithms that are capable of planning around large amounts of stationary and moving obstacles. Previous work on COBRA-DDP demonstrated the capability of the algorithm to produce dynamically feasible trajectories for AAM vehicles and general collision avoidance. This paper improves upon the previous work by increasing the number of stationary and moving obstacles, implementing a variation of COBRA-DDP that lends itself to real-time application. These advancements are demonstrated on a vertical takeoff and landing (VTOL) vehicle simulation with highly nonlinear vehicle dynamics.

COBRA-DDP↗
NASA NTRSDate not supplied

COBRA-DDP: Trajectory Generation and Collision Avoidance Augmentations for eVTOL Vehicles

This paper presents a receding horizon model predictive control variation of the combined Bernstein polynomial optimal reciprocal collision avoidance (ORCA) differential dynamic programming (COBRA-DDP) algorithm for AAM vehicles. Collision avoidance in combination with effective trajectory replanning are expected to be core components of AAM vehicles operating within a crowded airspace. This environment necessitates the use of real-time trajectory planning algorithms that are capable of planning around large amounts of stationary and moving obstacles. Previous work on COBRA-DDP demonstrated the capability of the algorithm to produce dynamically feasible trajectories for AAM vehicles and general collision avoidance. This paper improves upon the previous work by increasing the number of stationary and moving obstacles, implementing a variation of COBRA-DDP that lends itself to real-time application. These advancements are demonstrated on a vertical takeoff and landing (VTOL) vehicle simulation with highly nonlinear vehicle dynamics.

COBRA-DDP↗
NASA NTRS1965

A Method of Implementing Cutoff Conditions for Saturn V Lunar Missions Out of Earth Parking Orbit Assuming a Continuous Ground Launch Window

A method of implementing Saturn V lunar missions from an earth parking orbit is presented. The ground launch window is assumed continuous over a four and one-half hour period. The iterative guidance scheme combined with a set of auxiliary equations that define suitable S-IVB cutoff conditions, is the approach taken. The four inputs to the equations that define cutoff conditions are represented as simple third-degree polynomials as a function of ignition time. Errors at lunar arrival caused by the separate and combined effects of the guidance equations, cutoff conditions, hypersurface errors, and input representations are shown. Vehicle performance variations and parking orbit injection errors are included as perturbations. Appendix I explains how aim vectors were computed for the cutoff equations. Appendix II presents all guidance equations and related implementation procedures. Appendix III gives the derivation of the auxiliary cutoff equations. No error at lunar arrival was large enough to require a midcourse correction greater than one meter per second assuming a transfer time of three days and the midcourse correction occurs five hours after injection. Since this result is insignificant when compared to expected hardware errors, the implementation procedures presented are adequate to define cutoff conditions for Saturn V lunar missions.

PARKING ORBIT↗
NASA NTRS1965

Notes on System Theory, Volume VII

System theory - matrices, feedback control system, network synthesis, set theory, stability, shift registers, coding, theorem proving, polynomial roots, channels, and signal flow graphs

FEEDBACK CONTROL SYSTEM↗