Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms and Theoretical Developments”

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 343 records · Page 19

Three dimensional boundary conditions in supersonic flow

A theoretical analysis of the flow pattern at a solid surface in three dimensional supersonic flow is presented. The additional information necessary to overcome the nonuniqueness associated with the body tangency condition in three dimensions was developed. The analysis is based on the fact that three dimensional waves propagate locally exactly as they do in axisymmetric flow when viewed in the osculating plane to the streamline. The supersonic flow over an infinite swept corner is examined by both the classical solution and the three dimensional solution in the osculating plane and the results are shown to be identical. A simple numerical algorithm is proposed which accounts for the three wave surfaces that interact at a solid boundary.

Rudman, S.↗

Rocket engine failure detection using system identification techiques

The theoretical foundation and application of two univariate failure detection algorithms to Space Shuttle Main Engine (SSME) test firing data is presented. Both algorithms were applied to data collected during steady state operation of the engine. One algorithm, the time series algorithm, is based on time series techniques and involves the computation of autoregressive models. Times series techniques have been previously applied to SSME data. The second algorithm is based on standard signal processing techniques. It consists of tracking the variations in the average signal power with time. The average signal power algorithm is a newly proposed SSME failure detection algorithm. Seven nominal test firings were used to develop failure indication thresholds for each algorithm. These thresholds were tested using four anomalous firings and one additional nominal firing. Both algorithms provided significantly earlier failure indication times than did the current redline limit system. Neither algorithm gave false failure indications for the nominal firing. The strengths and weaknesses of the two algorithms are discussed and compared. The average signal algorithm was found to have several advantages over the time series algorithm.

Meyer, Claudia M.↗

Rocket engine failure detection using system identification techniques

The theoretical foundation and application of two univariate failure detection algorithms to Space Shuttle Main Engine (SSME) test firing data is presented. Both algorithms were applied to data collected during steady state operation of the engine. One algorithm, the time series algorithm, is based on time series techniques and involves the computation of autoregressive models. Time series techniques have been previously applied to SSME data. The second algorithm is based on standard signal processing techniques. It consists of tracking the variations in the average signal power with time. The average signal power algorithm is a newly proposed SSME failure detection algorithm. Seven nominal test firings were used to develop failure indication thresholds for each algorithm. These thresholds were tested using four anomalous firings and one additional nominal firing. Both algorithms provided significantly earlier failure indication times than did the current redline limit system. Neither algorithm gave false failure indications for the nominal firing. The strengths and weaknesses of the two algorithms are discussed and compared. The average signal algorithm was found to have several advantages over the time series algorithm.

Meyer, Claudia M.↗

Nonlinear Behavior of a Typical Airfoil Section with Control Surface Freeplay: A Numerical and Experimental Study

A three degree-of-freedom aeroelastic typical section with control surface freeplay is modeled theoretically as a system of piecewise linear state-space models. The system response is determined by time marching of the governing equations using a standard Runge-Kutta algorithm in conjunction with Henon's method for integrating a system of equations to a prescribed surface of phase space section. Henon's method is used to locate the "switching points" accurately and efficiently as the system moves from one linear region into another. An experimental model which closely approximates the three degree-of-freedom, typical section in two-dimensional, incompressible flow has been created to validate the theoretical model. Consideration is given to modeling realistically the structural damping present in the experimental system. The effect of the freeplay on the system response is examined numerically and experimentally. The development of the state-space model offers a low-order, computationally efficient means of modeling fully the freeplay nonlinearity and may offer advantages in future research which will investigate the effects of freeplay on the control of flutter in the typical section.

Conner, M. D.↗

Assessment of Error in Synoptic-Scale Diagnostics Derived from Wind Profiler and Radiosonde Network Data

A topic of current practical interest is the accurate characterization of the synoptic-scale atmospheric state from wind profiler and radiosonde network observations. We have examined several related and commonly applied objective analysis techniques for performing this characterization and considered their associated level of uncertainty both from a theoretical and a practical standpoint. A case study is presented where two wind profiler triangles with nearly identical centroids and no common vertices produced strikingly different results during a 43-h period. We conclude that the uncertainty in objectively analyzed quantities can easily be as large as the expected synoptic-scale signal. In order to quantify the statistical precision of the algorithms, we conducted a realistic observing system simulation experiment using output from a mesoscale model. A simple parameterization for estimating the uncertainty in horizontal gradient quantities in terms of known errors in the objectively analyzed wind components and temperature is developed from these results.

Mace, Gerald G.↗

Control system design for flexible structures using data models

The dynamics and control of flexible aerospace structures exercises many of the engineering disciplines. In recent years there has been considerable research in the developing and tailoring of control system design techniques for these structures. This problem involves designing a control system for a multi-input, multi-output (MIMO) system that satisfies various performance criteria, such as vibration suppression, disturbance and noise rejection, attitude control and slewing control. Considerable progress has been made and demonstrated in control system design techniques for these structures. The key to designing control systems for these structures that meet stringent performance requirements is an accurate model. It has become apparent that theoretically and finite-element generated models do not provide the needed accuracy; almost all successful demonstrations of control system design techniques have involved using test results for fine-tuning a model or for extracting a model using system ID techniques. This paper describes past and ongoing efforts at Ohio University and NASA MSFC to design controllers using 'data models.' The basic philosophy of this approach is to start with a stabilizing controller and frequency response data that describes the plant; then, iteratively vary the free parameters of the controller so that performance measures become closer to satisfying design specifications. The frequency response data can be either experimentally derived or analytically derived. One 'design-with-data' algorithm presented in this paper is called the Compensator Improvement Program (CIP). The current CIP designs controllers for MIMO systems so that classical gain, phase, and attenuation margins are achieved. The center-piece of the CIP algorithm is the constraint improvement technique which is used to calculate a parameter change vector that guarantees an improvement in all unsatisfied, feasible performance metrics from iteration to iteration. The paper also presents a recently demonstrated CIP-type algorithm, called the Model and Data Oriented Computer-Aided Design System (MADCADS), developed for achieving H(sub infinity) type design specifications using data models. Control system design for the NASA/MSFC Single Structure Control Facility are demonstrated for both CIP and MADCADS. Advantages of design-with-data algorithms over techniques that require analytical plant models are also presented.

Irwin, R. Dennis↗

Hydrogen density mapping in biomolecular crystals through dynamic nuclear polarization

Many fundamental biological processes, including those in photosynthetic reaction centers and enzyme active sites, involve charge and energy transfer, bond cleavage, protonation and hydrogen bonding. Because H atoms play such central roles in these reactions, accurately determining their positions is essential. Yet, conventional X-ray crystallography primarily resolves the heavy atoms in biological structures and provides limited insight into hydrogen, even at atomic resolution. Neutron macromolecular crystallography (NMC) overcomes this limitation by offering exceptional sensitivity to hydrogen and deuterium. Here, we present a theoretical framework for the development of dynamic nuclear polarization NMC (DNP-NMC) techniques, which exploit the alignment of neutron and proton nuclear spins to enhance and tune the hydrogen signal contribution. The DNP-NMC approach advances the resolution of H atoms within biomolecular crystals, whether bound to protein residues or present in solvent. The method establishes key relationships for the coherent structure factor of polarized neutron scattering from hydrogenous matter. It theoretically achieves full accuracy in phase reconstruction and offers a path to improve neutron structure determination, achieving accuracies exceeding ≳80% by incorporating titration states. Using a variant of the hybrid input/output phase-retrieval algorithm, it allows recovery of the hydrogen density with ≳90% phase accuracy. In conclusion, we further discuss sources of experimental uncertainty for the upcoming DNP-enabled, quasi-Laue IMAGINE-X experiment at Oak Ridge National Laboratory's High Flux Isotope Reactor.

dynamic nuclear polarization↗

Simultaneous Retrieval of Selected Optical Water Quality Indicators From Landsat-8, Sentinel-2, and Sentinel-3

Constructing multi-source satellite-derived water quality (WQ) products in inland and nearshore coastal waters from the past, present, and future missions is a long-standing challenge. Despite inherent differences in sensors’ spectral capability, spatial sampling, and radiometric performance, research efforts focused on formulating, implementing, and validating universal WQ algorithms continue to evolve. This research extends a recently developed machine-learning (ML) model, i.e., Mixture Density Networks (MDNs) (Pahlevan et al., 2020; Smith et al., 2021), to the inverse problem of simultaneously retrieving WQ indicators, including chlorophyll-a (Chla), Total Suspended Solids (TSS), and the absorption by Colored Dissolved Organic Matter at 440 nm (a cdom (440)), across a wide array of aquatic ecosystems. We use a database of in situ measurements to train and optimize MDN models developed for the relevant spectral measurements (400–800 nm) of the Operational Land Imager (OLI), MultiSpectral Instrument (MSI), and Ocean and Land Color Instrument (OLCI) aboard the Landsat-8, Sentinel-2, and Sentinel-3 missions, respectively. Our two performance assessment approaches, namely hold-out and leave-one-out, suggest significant, albeit varying degrees of improvements with respect to second-best algorithms, depending on the sensor and WQ indicator (e.g., 68%, 75%, 117% improvements based on the hold-out method for Chla, TSS, and a cdom (440), respectively from MSI-like spectra). Using these two assessment methods, we provide theoretical upper and lower bounds on model performance when evaluating similar and/or out-of-sample datasets. To evaluate multi-mission product consistency across broad spatial scales, map products are demonstrated for three near-concurrent OLI, MSI, and OLCI acquisitions. Overall, estimated TSS and a cdom (440) from these three missions are consistent within the uncertainty of the model, but Chla maps from MSI and OLCI achieve greater accuracy than those from OLI. By applying two different atmospheric correction processors to OLI and MSI images, we also conduct matchup analyses to quantify the sensitivity of the MDN model and best-practice algorithms to uncertainties in reflectance products. Our model is less or equally sensitive to these uncertainties compared to other algorithms. Recognizing their uncertainties, MDN models can be applied as a global algorithm to enable harmonized retrievals of Chla, TSS, and a cdom (440) in various aquatic ecosystems from multi-source satellite imagery. Local and/or regional ML models tuned with an apt data distribution (e.g., a subset of our dataset) should nevertheless be expected to outperform our global model.

Machine learning↗

Super Resolution Image Enhancement for a Flash Lidar: Back Projection Method

In this paper a new image processing technique for flash LIDAR data is presented as a potential tool to enable safe and precise spacecraft landings in future robotic or crewed lunar and planetary missions. Flash LIDARs can generate, in real-time, range data that can be interpreted as a 3-dimensional (3-D) image and transformed into a corresponding digital elevation map (DEM). The NASA Autonomous Landing and Hazard Avoidance (ALHAT) project is capitalizing on this new technology by developing, testing and analyzing flash LIDARs to detect hazardous terrain features such as craters, rocks, and slopes during the descent phase of spacecraft landings. Using a flash LIDAR for this application looks very promising, however through theoretical and simulation analysis the ALHAT team has determined that a single frame, or mosaic, of flash LIDAR data may not be sufficient to build a landing site DEM with acceptable spatial resolution, precision, size, or for a mosaic, in time, to meet current system requirements. One way to overcome this potential limitation is by enhancing the flash LIDAR output images. We propose a new super-resolution algorithm applicable to flash LIDAR range data that will create a DEM with sufficient accuracy, precision and size to meet current ALHAT requirements. The performance of our super-resolution algorithm is analyzed by processing data generated during a series of simulation runs by a high fidelity model of a flash LIDAR imaging a high resolution synthetic lunar elevation map. The flash LIDAR model is attached to a simulated spacecraft by a gimbal that points the LIDAR to a target landing site. For each simulation run, a sequence of flash LIDAR frames is recorded and processed as the spacecraft descends toward the landing site. Each run has a different trajectory profile with varying LIDAR look angles of the terrain. We process the output LIDAR frames using our SR algorithm and the results show that the achieved level of accuracy and precision of the SR generated landing site DEM is more than adequate for detecting hazardous terrain features and identifying safe areas.

Bulyshev, Alexander↗

Theoretical analysis of the electrical aspects of the basic electro-impulse problem in aircraft de-icing applications

A method of modelling a system consisting of a cylindrical coil with its axis perpendicular to a metal plate of finite thickness, and a simple electrical circuit for producing a transient current in the coil, is discussed in the context of using such a system for de-icing aircraft surfaces. A transmission line model of the coil and metal plate is developed as the heart of the system model. It is shown that this transmission model is central to calculation of the coil impedance, the coil current, the magnetic fields established on the surfaces of the metal plate, and the resultant total force between the coil and the plate. FORTRAN algorithms were developed for numerical calculation of each of these quantities, and the algorithms were applied to an experimental prototype system in which these quantities had been measured. Good agreement is seen to exist between the predicted and measured results.

Henderson, Robert A.↗

Software Development Technologies for Reactive, Real-Time, and Hybrid Systems: Summary of Research

This research is directed towards the implementation of a comprehensive deductive-algorithmic environment (toolkit) for the development and verification of high assurance reactive systems, especially concurrent, real-time, and hybrid systems. For this, we have designed and implemented the STCP (Stanford Temporal Prover) verification system. Reactive systems have an ongoing interaction with their environment, and their computations are infinite sequences of states. A large number of systems can be seen as reactive systems, including hardware, concurrent programs, network protocols, and embedded systems. Temporal logic provides a convenient language for expressing properties of reactive systems. A temporal verification methodology provides procedures for proving that a given system satisfies a given temporal property. The research covered necessary theoretical foundations as well as implementation and application issues.

Manna, Zohar↗

Introduction to Quantum Computing

Quantum computing offers the potential to revolutionize high-performance computing by providing a means to solve certain computational problems asymptotically faster than any classical computer. Quantum computing has advanced recently from merely a theoretical possibility to engineered reality, including commercial entities offering early prototype quantum processors, both special-purpose quantum annealers and general-purpose gate-model processors. The media have been showcasing each new development and implicitly conveying the message that quantum-computing ubiquity is nigh. Here, we will respond to this hype and provide an overview of the exciting but still early state of the field. In this tutorial, we introduce participants to the computational models that give quantum computing its immense computational power. We examine the thought processes that programmers need to map problems to quantum computers. And we discuss hardware and algorithmic challenges that must be overcome before quantum computing becomes a component of every software developer's repertoire.

Quantum computing↗

Introduction to Quantum Computing

Quantum computing offers the potential to revolutionize high-performance computing by providing a means to solve certain computational problems asymptotically faster than any classical computer. Quantum computing has advanced recently from merely a theoretical possibility to engineered reality, including commercial entities offering early prototype quantum processors, both special-purpose quantum annealers and general-purpose gate-model processors. The media have been showcasing each new development and implicitly conveying the message that quantum-computing ubiquity is nigh. Here, we will respond to this hype and provide an overview of the exciting but still early state of the field. In this tutorial, we introduce participants to the computational models that give quantum computing its immense computational power. We examine the thought processes that programmers need to map problems to quantum computers. And we discuss hardware and algorithmic challenges that must be overcome before quantum computing becomes a component of every software developer's repertoire. (Update of 2022 slides)

Quantum computing↗

Advanced fuel fusion, phase space engineering, and structure-preserving geometric algorithms

Non-thermal advanced fuel fusion trades the requirement of a large amount of recirculating tritium in the system for that of large recirculating power. Phase space engineering technologies utilizing externally injected electromagnetic fields can be applied to meet the challenge of maintaining non-thermal particle distributions at a reasonable cost. The physical processes of the phase space engineering are studied from a theoretical and algorithmic perspective. It is emphasized that the operational space of phase space engineering is limited by the underpinning symplectic dynamics of charged particles. The phase space incompressibility according to the Liouville theorem is just one of many constraints, and Gromov's non-squeezing theorem determines the minimum footprint of the charged particles on every conjugate phase space plane. In this sense and level of sophistication, the mathematical abstraction of phase space engineering is symplectic topology. To simulate the processes of phase space engineering, such as the Maxwell demon and electromagnetic energy extraction, and to accurately calculate the minimum footprints of charged particles, recently developed structure-preserving geometric algorithms can be used. The family of algorithms conserves exactly, on discretized spacetime, symplecticity and thus incompressibility, non-squeezability, and symplectic capacities. The algorithms apply to the dynamics of charged particles under the influence of external electromagnetic fields as well as the charged particle–electromagnetic field system governed by the Vlasov–Maxwell equations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Self-Directed Cooperative Planetary Rovers

The project is concerned with the development of decision-theoretic techniques to optimize the scientific return of planetary rovers. Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such resources as operation time, power, storage capacity, and communication bandwidth. Moreover, the limited computational resources of the rover limit the complexity of on-line planning and scheduling. We have developed a comprehensive solution to this problem that involves high-level tools to describe a mission; a compiler that maps a mission description and additional probabilistic models of the components of the rover into a Markov decision problem; and algorithms for solving the rover control problem that are sensitive to the limited computational resources and high-level of uncertainty in this domain.

Zilberstein, Shlomo↗

Aerocapture Trajectory Design for Uranus Orbiter

Introduction: The recently released National Academies Planetary Science and Astrobiology Decadal Survey 2023-2032 [1] identified the Ice Giants as the top priority science destination. While the survey acknowledged the potential for either a Uranus Orbiter and Probe (UOP) mission or a Neptune-Triton Odyssey mission, it ultimately identified the former as the highest priority new flagship mission. UOP missions calls for a launch window of opportunity between 2031-2038 with 12-15 year interplanetary cruise time along with a fully-propulsive Uranus Orbit Insertion burn on the order of a few km/s. However, a mission to Uranus with the same science payload could utilize aerocapture for orbit insertion to achieve both a significant reduction in the interplanetary cruise time and reduction in propulsive burn costs. Why Aerocapture: Aerocapture is a promising propellant and time-saving orbital insertion technique for planetary destinations with an atmosphere. Although not flight-proven, previous aerocapture systems studies in the literature have demonstrated both the validity and robustness of the technique at various planetary destinations. With respect to the Ice Giant planets, Neptune has seen more of the analysis in the literature. For science missions at Neptune, aerocapture can enable 1.4 times more delivered mass to orbit than an all-propulsive mission for the same launch vehicle while reducing interplanetary cruise times by more than 3 years [2] Additionally with modern guidance and control, Neptune aerocapture with blunt-body aeroshells is realizable [3][4]. There are limited papers in the literature investigating Uranus aerocapture with those available providing a preliminary feasibility assessment [5]. Consequently, the two-year funded NASA Space Technology Mission Directorate (STMD)-funded project, titled Aerocapture System as an Enabling Technology for Ice Giants Missions, aims to mature the analysis and technology state of Uranus aerocapture. Trajectory Design: This paper presents the current state of the trajectory design in support of the new aerocapture project. The project design philosophy is inspired from recent Neptune aerocapture studies, which employed modern guidance and control, in the sense that blunt-body aeroshells are analyzed. An assessment of the theoretical flight path angle corridor width is conducted for a range of ballistic coefficients and lift-to-drag ratios for both Space Launch System and Falcon Heavy Launch Vehicle interplanetary trajectory solutions. The results from the corridor width assessment provide an assessment of the aerocapture design-space and qualitative metrics on trajectory design considerations. The Program to Optimize Simulated Trajectories II (POST2) is utilized to run Monte Carlo simulations of Uranus aerocapture three-degree-of-freedom bank angle modulated trajectories using a closed-loop numerical-predictor corrector guidance algorithm. UranusGRAM 2021 is utilized as the atmospheric model [6]. A Uranus-developed aerodatabase, originally derived from Mars Science Laboratory (MSL), is utilized to provide vehicle aerodynamics over a wide range of hypersonic flow regimes. A MSL-derived 70 deg 4.5m diameter sphere-cone aeroshell that houses the UOP payload mass is assumed. Robustness testing and performance analysis is conducted, including the assessment of entry state errors, atmosphere density variations, and aerodynamic dispersions. Post-aerocapture Delta-V and aerothermal statistics are formulated into propellant mass and TPS requirements. The results presented in the paper will demonstrate the trajectory viability of Uranus aerocapture. Preliminary Results: Preliminary trajectory design results indicates successful Uranus aerocapture with a blunt-body aeroshell housing the same payload mass as the UOP mission from an Earth-to-Uranus interplanetary trajectory arriving in less than 7 years. From this interplanetary trajectory, aerocapture provides an orbit insertion Delta-V capability of 6.9 km/s requiring less than 300 m/s for post-aerocapture correction burns (15% of wet mass allocated to propellant). To put this into perspective, the UOP study utilized an Earth-to-Uranus trajectory that arrives in 13 years and requires more than 1000 m/s for fully-propulsive orbit insertion (40% of wet mass allocated to propellant). Achieving the same 6.9 km/s Delta-V capability fully-propulsively is mass prohibitive (97% of wet mass allocated to propellant). Nevertheless, aerocapture has the potential to reduce interplanetary transit times to Uranus by half while delivering the same payload mass to orbit in a reduced propellant mass footprint.

Rohan Deshmukh↗

Multiprocessing on supercomputers for computational aerodynamics

Little use is made of multiple processors available on current supercomputers (computers with a theoretical peak performance capability equal to 100 MFLOPS or more) to improve turnaround time in computational aerodynamics. The productivity of a computer user is directly related to this turnaround time. In a time-sharing environment, such improvement in this speed is achieved when multiple processors are used efficiently to execute an algorithm. The concept of multiple instructions and multiple data (MIMD) is applied through multitasking via a strategy that requires relatively minor modifications to an existing code for a single processor. This approach maps the available memory to multiple processors, exploiting the C-Fortran-Unix interface. The existing code is mapped without the need for developing a new algorithm. The procedure for building a code utilizing this approach is automated with the Unix stream editor.

Yarrow, Maurice↗

mu analysis with real parametric uncertainty

The authors give a broad overview, from a LFT (linear fractional transformation)/mu perspective, of some of the theoretical and practical issues associated with robustness in the presence of real parametric uncertainty, with a focus on computation. Recent results on the properties of mu in the mixed case are reviewed, including issues of NP completeness, continuity, computation of bounds, the equivalence of mu and its bounds, and some direct comparisons with Kharitonov-type analysis methods. In addition, some advances in the computational aspects of the problem, including a novel branch and bound algorithm, are briefly presented together with numerical results. The results suggest that while the mixed mu problem may have inherently combinatoric worst-case behavior, practical algorithms with modest computational requirements can be developed for problems of medium size (less than 100 parameters) that are of engineering interest.

Young, Peter M.↗