Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast algorithm”

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 667 records · Page 37

A combined algorithm for minimum time slewing of flexible spacecraft

The use of Pontryagin's Maximum Principle for the large-angle slewing of large flexible structures usually results in the so-called two-point boundary-value problem (TPBVP), in which many requirements (e.g., minimum time, small flexible amplitude, and limited control powers, etc.) must be satisfied simultaneously. The successful solution of this problem depends largely on the use of an efficient numerical computational algorithm. There are many candidate algorithms available for his problem (e.g., quasilinearization, gradient, and shooting, etc.). In this paper, a proposed algorithm, which combines the quasilinearization method with a time shortening technique and a shooting method, is applied to the minimum-time, three-dimensional, and large-angle maneuver of flexible spacecraft, particularly the orbiting Spacecraft Control Laboratory Experiment (SCOLE) configuration. Theoretically, the nonlinear TPBVP can be solved only through the shooting method to find the 'exact' switching times for the bang-bang controls. However, computationally, a suitable guess for the missing initial costates is crucial because the convergence range of the unknown initial costates is usually narrow, especially for systems with high dimensions and when a multi-bang-bang control strategy is needed. On the other hand, the problems of near minimum time attitude maneuver of general rigid spacecraft and fast slewing of flexible spacecraft have been examined by the authors through a numerical approach based on the quasilinearization algorithm with a time shortening technique. Computational results have demonstrated its broad convergence range and insensitivity to initial costate choices. Consequently, a combined approach is naturally suggested here to solve the minimum time slewing problem. That is, in the computational process, the quasilinearization method is used first to obtain a near minimum time solution. Then, the acquired converged initial costates from the quasilinearization approach are transformed (tailored) to and used as the initial costate guess for starting the shooting method. Finally, the shooting method takes over the remaining calculations until the minimum-time solution converges. The nonlinear equations of motion of the SCOLE are formulated by using Lagrange's equations, with the mast modeled as a continuous beam subject to three-dimensional deformations. The numerical results will be presented and some related computational issues will also be discussed.

Bainum, P. M.↗

Space station static and dynamic analyses using parallel methods

Algorithms for high-performance parallel computers are applied to perform static analyses of large-scale Space Station finite-element models (FEMs). Several parallel-vector algorithms under development at NASA Langley are assessed. Sparse matrix solvers were found to be more efficient than banded symmetric or iterative solvers for the static analysis of large-scale applications. In addition, new sparse and 'out-of-core' solvers were found superior to substructure (superelement) techniques which require significant additional cost and time to perform static condensation during global FEM matrix generation as well as the subsequent recovery and expansion. A method to extend the fast parallel static solution techniques to reduce the computation time for dynamic analysis is also described. The resulting static and dynamic algorithms offer design economy for preliminary multidisciplinary design optimization and FEM validation against test modes. The algorithms are being optimized for parallel computers to solve one-million degrees-of-freedom (DOF) FEMs. The high-performance computers at NASA afforded effective software development, testing, efficient and accurate solution with timely system response and graphical interpretation of results rarely found in industry. Based on the author's experience, similar cooperation between industry and government should be encouraged for similar large-scale projects in the future.

Gupta, V.↗

Performance of a Space-Based Wavelet Compressor for Plasma Count Data on the MMS Fast Plasma Investigation

Data compression has been a staple of imaging instruments for years. Recently, plasma measurements have utilized compression with relatively low compression ratios. The Fast Plasma Investigation (FPI) on board the Magnetospheric Multiscale (MMS) mission generates data roughly 100 times faster than previous plasma instruments, requiring a higher compression ratio to fit within the telemetry allocation. This study investigates the performance of a space-based compression standard employing a Discrete Wavelet Transform and a Bit Plane Encoder (DWT/BPE) in compressing FPI plasma count data. Data from the first 6 months of FPI operation are analyzed to explore the error modes evident in the data and how to adapt to them. While approximately half of the Dual Electron Spectrometer (DES) maps had some level of loss, it was found that there is little effect on the plasma moments and that errors present in individual sky maps are typically minor. The majority of Dual Ion Spectrometer burst sky maps compressed in a lossless fashion, with no error introduced during compression. Because of induced compression error, the size limit for DES burst images has been increased for Phase 1B. Additionally, it was found that the floating point compression mode yielded better results when images have significant compression error, leading to floating point mode being used for the fast survey mode of operation for Phase 1B. Despite the suggested tweaks, it was found that wavelet-based compression, and a DWT/BPE algorithm in particular, is highly suitable to data compression for plasma measurement instruments and can be recommended for future missions.

plasma↗

Multitasking domain decomposition fast Poisson solvers on the Cray Y-MP

The results of multitasking implementation of a domain decomposition fast Poisson solver on eight processors of the Cray Y-MP are presented. The object of this research is to study the performance of domain decomposition methods on a Cray supercomputer and to analyze the performance of different multitasking techniques using highly parallel algorithms. Two implementations of multitasking are considered: macrotasking (parallelism at the subroutine level) and microtasking (parallelism at the do-loop level). A conventional FFT-based fast Poisson solver is also multitasked. The results of different implementations are compared and analyzed. A speedup of over 7.4 on the Cray Y-MP running in a dedicated environment is achieved for all cases.

Chan, Tony F.↗

Trajectory Specification Applied to Terminal Airspace

Despite major efforts to automate air traffic control (ATC), it is still performed by humans today. The complexity and safety-criticality of ATC makes it very difficult to safely automate, but it must be automated to increase airspace capacity (the density of traffic that can be safely managed) and airport throughput (the number of arrivals and departures that an airport can safely handle in a given period of time) beyond what is possible with human controllers. This paper presents the Trajectory Specification (TS) concept, which can help to safely automate ATC. TS is a method of specifying aircraft trajectories such that the position at any given time in flight is restricted to a precisely defined bounding space, removing all ambiguity as to where the flight is allowed to be. The bounding space or volume is determined by tolerances relative to a reference trajectory (position as a function of time). The tolerances are dynamic and are based on the aircraft navigation capabilities and the traffic situation. The tolerances can be a piecewise linear function of time or distance along the route, allowing the tolerances to vary as needed, typically increasing with time for departures and decreasing for arrivals. A Trajectory Specification Language (TSL) is proposed for communicating trajectories from aircraft to ATC as requests and from ATC to aircraft as assignments. The TS concept requires a new generation of airborne Flight Management Systems (FMS) that understand the TSL and can fly the assigned trajectories, but this paper focuses on the ATC functions and the prototype ATC algorithms and software that were developed to test the TS concept. Assuming conformance, TS can guarantee safe separation for an arbitrary length of time even in the event of an ATC system or communication outage. It can help to achieve the high level of safety and reliability needed for ATC automation, and it can also reduce the reliance on ATC backup systems for tactical conflict detection and resolution during normal operation. TS can be applied to any controlled airspace, including enroute, terminal, and urban airspace, but this paper presents algorithms and software for arrival spacing and conflict detection and resolution in the terminal airspace serving a major airport. In a fast-time simulation of a full day of traffic in a major terminal airspace, all conflicts were resolved in near real time, demonstrating the computational feasibility and the preliminary operational feasibility of the TS concept. This paper is a compilation of previous papers, and it adds significant information that was omitted from those papers due to length limitations. It also updates some of the results of those earlier papers due to algorithm refinements and corrections of minor software errors.

air traffic control, trajectory↗

Multivariate interactive digital analysis system /MIDAS/ - A new fast multispectral recognition system

The MIDAS system is a prototype, multiple-pipeline digital processor mechanizing the multivariate-Gaussian, maximum-likelihood decision algorithm operating at 200,000 pixels/second. It incorporates displays and film printer equipment under control of a general purpose midi-computer and possesses sufficient flexibility that operational versions of the equipment may be subsequently specified as subsets of the system.

Kriegler, F.↗

Distributed Fast Motion Planning for Spacecraft Swarms in Cluttered Environments using Spherical Expansions and Sequence of Convex Optimization Problems

This paper presents a novel guidance algorithm for spacecraft swarms in an environment cluttered with many obstacles like a debris field or the asteroid belt. The objective of this algorithm is to reconfigure the swarm to a desired formation in a distributed manner while minimizing fuel and avoiding collisions among themselves and with the obstacles. The agents first use a spherical-expansion-based sampling algorithm to cooperatively explore the workspace and find paths to the desired terminal positions. Using a distributed assignment algorithm, the agents converge on an optimal assignment of the target locations in the desired formation. Then each agent generates a locally optimal trajectory from its current location to its terminal position by solving a sequence of convex optimization problems. As the agent moves along this trajectory, it receives the position of other agents and updates its trajectory to avoid collisions with other agents and the obstacles. Thus the swarm achieves the desired formation in a distributed manner while avoiding collisions. Moreover, this algorithm is computationally efficient, therefore it can be implemented onboard resource-constrained spacecraft. Simulations results show that the proposed distributed algorithm can be used by a spacecraft swarm to reconfigure a desired formation around an asteroid in a collision-free manner.

Bandyopadhyay, Saptarshi↗

A Fuel-Efficient Conflict Resolution Maneuver for Separation Assurance

Automated separation assurance algorithms are envisioned to play an integral role in accommodating the forecasted increase in demand of the National Airspace System. Developing a robust, reliable, air traffic management system involves safely increasing efficiency and throughput while considering the potential impact on users. This experiment seeks to evaluate the benefit of augmenting a conflict detection and resolution algorithm to consider a fuel efficient, Zero-Delay Direct-To maneuver, when resolving a given conflict based on either minimum fuel burn or minimum delay. A total of twelve conditions were tested in a fast-time simulation conducted in three airspace regions with mixed aircraft types and light weather. Results show that inclusion of this maneuver has no appreciable effect on the ability of the algorithm to safely detect and resolve conflicts. The results further suggest that enabling the Zero-Delay Direct-To maneuver significantly increases the cumulative fuel burn savings when choosing resolution based on minimum fuel burn while marginally increasing the average delay per resolution.

Bowe, Aisha Ruth↗

Extracting Periodic Signals From Irregularly Sampled Data

Successive approximations formed in Fourier space. Algorithm extracts periodic signals from sparse, irregularly sampled sets of measurement data. Pertains to data processed via fast Fourier transforms (FFTs). Data represents signal components with initially unknown frequencies spanning large spectral range and includes frequencies not integer multiples of minimum FFT frequency.

Wilcox, Jaroslava Z.↗

Loop Heat Pipe Transient Behavior Using Heat Source Temperature for Set Point Control with Thermoelectric Converter on Reservoir

The LHP operating temperature is governed by the saturation temperature of its reservoir. Controlling the reservoir saturation temperature is commonly done by cold biasing the reservoir and using electrical heaters to provide the required control power. With this method, the loop operating temperature can be controlled within 0.5K or better. However, because the thermal resistance that exists between the heat source and the LHP evaporator, the heat source temperature will vary with its heat output even if the LHP operating temperature is kept constant. Since maintaining a constant heat source temperature is of most interest, a question often raised is whether the heat source temperature can be used for LHP set point temperature control. A test program with a miniature LHP was carried out to investigate the effects on the LHP operation when the control temperature sensor was placed on the heat source instead of the reservoir. In these tests, the LHP reservoir was cold-biased and was heated by a control heater. Test results show that it was feasible to use the heat source temperature for feedback control of the LHP operation. In particular, when a thermoelectric converter was used as the reservoir control heater, the heat source temperature could be maintained within a tight range using a proportional-integral-derivative or on/off control algorithm. Moreover, because the TEC could provide both heating and cooling to the reservoir, temperature oscillations during fast transients such as loop startup could be eliminated or substantially reduced when compared to using an electrical heater as the control heater.

Ku, Jentung↗

Fpack and Funpack Utilities for FITS Image Compression and Uncompression

Fpack is a utility program for optimally compressing images in the FITS (Flexible Image Transport System) data format (see http://fits.gsfc.nasa.gov). The associated funpack program restores the compressed image file back to its original state (as long as a lossless compression algorithm is used). These programs may be run from the host operating system command line and are analogous to the gzip and gunzip utility programs except that they are optimized for FITS format images and offer a wider choice of compression algorithms. Fpack stores the compressed image using the FITS tiled image compression convention (see http://fits.gsfc.nasa.gov/fits_registry.html). Under this convention, the image is first divided into a user-configurable grid of rectangular tiles, and then each tile is individually compressed and stored in a variable-length array column in a FITS binary table. By default, fpack usually adopts a row-by-row tiling pattern. The FITS image header keywords remain uncompressed for fast access by FITS reading and writing software. The tiled image compression convention can in principle support any number of different compression algorithms. The fpack and funpack utilities call on routines in the CFITSIO library (http://hesarc.gsfc.nasa.gov/fitsio) to perform the actual compression and uncompression of the FITS images, which currently supports the GZIP, Rice, H-compress, and PLIO IRAF pixel list compression algorithms.

Pence, W.↗

NASA SETI microwave observing project: Sky Survey element

The SETI Sky Survey Observing Program is one of two complimentary strategies that NASA plans to use in its microwave Search for Extraterrestrial Intelligence (SETI). The primary objective of the sky survey is to search the entire sky over the frequency range of 1.0 to 10.0 GHz for evidence of narrow band signals of extraterrestrial intelligent origin. Frequency resolutions of 30 Hz or narrower will be used across the entire band. Spectrum analyzers with upwards of ten million channels are required to keep the survey time approximately 6 years. Data rates in excess of 10 megabits per second will be generated in the data taking process. Sophisticated data processing techniques will be required to determine the ever changing receiver baselines, and to detect and archive potential SETI signals. Existing radio telescopes, including several of NASA's Deep Space Network (DSN) 34 meter antennas located at Goldstone, CA and Tidbinbilla, Australia will be used for the observations. The JPL has the primary responsibility to develop and carry out the sky survey. In order to lay the foundation for the full scale SETI Sky Survey, a prototype system is being developed at the JPL. The system will be installed at the new 34-m high efficiency antenna at the Deep Space Station (DSS) 13 research and development station, Goldstone, CA, where it will be used to initiate the observational phase of the NASA SETI Sky Survey. It is anticipated that the early observations will be useful to test signal detection algorithms, scan strategies, and radio frequency interference rejection schemes. The SETI specific elements of the prototype system are: (1) the Wide Band Spectrum Analyzer (WBSA); a 2-million channel fast Fourier transformation (FFT) spectrum analyzer which covers an instantaneous bandpass of 40 MHz; (2) the signal detection processor; and (3) the SETI Sky Survey Manager, a network-based C-language environment that provides observatory control, performs data acquisition and analysis algorithms. A high level description of the prototype hardware and software systems will be given and the current status of the system development will be reported.

Klein, M. J.↗

A preliminary study of relaxation methods for the inviscid conservative gasdynamics equations using flux splitting

Plus minus flux vector split schemes are combined with the multigrid relaxation method to obtain fast rates of iterative (or steady state) convergence. On model nonlifting biconvex airfoil flow, steady state convergence is obtained using multigrid in 40 iteractions for subsonic cases and in 120 iterations for transonic cases. A 65 x 33 stretched grid is used. However, the multigrid scheme used here (and there are numerous variations) sometimes could not be made to work for transonic cases with a large number of supersonic points. Moreover, the multigrid method is only several times faster than the conventional algorithm which itself could perhaps be accelerated by other means. Nethertheless, with proper adjustment the multigrid method will ultimately lead to very fast rates of iterative convergence.

Steger, J. L.↗

Fast Conceptual Cost Estimating of Aerospace Projects Using Historical Information

Accurate estimates can be created in less than a minute by applying powerful techniques and algorithms to create an Excel-based parametric cost model. In five easy steps you will learn how to normalize your company 's historical cost data to the new project parameters. This paper provides a complete, easy-to-understand, step by step how-to guide. Such a guide does not seem to currently exist. Over 2,000 hours of research, data collection, and trial and error, and thousands of lines of Excel Visual Basic Application (VBA) code were invested in developing these methods. While VBA is not required to use this information, it increases the power and aesthetics of the model. Implementing all of the steps described, while not required, will increase the accuracy of the results.

Butts, Glenn↗

Distributed and collaborative synthetic environments

Fast graphics workstations and increased computing power, together with improved interface technologies, have created new and diverse possibilities for developing and interacting with synthetic environments. A synthetic environment system is generally characterized by input/output devices that constitute the interface between the human senses and the synthetic environment generated by the computer; and a computation system running a real-time simulation of the environment. A basic need of a synthetic environment system is that of giving the user a plausible reproduction of the visual aspect of the objects with which he is interacting. The goal of our Shastra research project is to provide a substrate of geometric data structures and algorithms which allow the distributed construction and modification of the environment, efficient querying of objects attributes, collaborative interaction with the environment, fast computation of collision detection and visibility information for efficient dynamic simulation and real-time scene display. In particular, we address the following issues: (1) A geometric framework for modeling and visualizing synthetic environments and interacting with them. We highlight the functions required for the geometric engine of a synthetic environment system. (2) A distribution and collaboration substrate that supports construction, modification, and interaction with synthetic environments on networked desktop machines.

Bajaj, Chandrajit L.↗

Autonomous star referenced attitude determination

A general star pattern recognition algorithm has been used to develop JPL's redundant, microcomputer-equipped ASTROS II CCD star tracker into a full-sky autonomous star tracker (FAST), capable of determining its attitude about all three axes without requiring any a priori attitude knowledge. A large field of view allows the number of guide stars in the all-sky data-base of the tracker to be limited to a manageable number, while high accuracy ensures that the pattern formed by the observed guide stars is unique. The recognition algorithm can also be used for automating the acquisition of celestial targets by astronomy telescopes, for autonomously updating the attitude of gyro-based attitude control systems, and for automating ground-based attitude recognition. Using both Monte Carlo simulations and a quasi-analytical method, it is shown that the general recognition algorithm and a less software-intensive special algorithm can be used to reliably automate the acquisition of celestial targets by astronomy telescopes.

Van Bezooijen, R. W. H.↗

Dynamic Mode Decomposition of Unsteady Pressure-Sensitive Paint Measurements for the NASA Unitary Plan Wind Tunnel Tests

This paper discusses the Dynamic Mode Decomposition (DMD) of the Unsteady Pressure-Sensitive Paint (uPSP) measurements, which were collected with four Phantom high-speed cameras at a constant sample frequency in the Ascent Transient Aerodynamics Test (ATAT) of the Space Launch System (SLS) Block 1 cargo vehicle with the Unitary Plan Wind Tunnel (UPWT) 11-by-11-foot Transonic Wind Tunnel in September 2019 at NASA Ames Research Center. The conventional DMD algorithm is based on the Singular Value Decomposition (SVD). For the data with zero mean, the DMD is equivalent to the Discrete Fourier Transform (DFT). Since the uPSP is mainly used to determine the unsteady property of the aerodynamic flow, the DMD of the uPSP measurements is implemented in two steps: (1) subtract the mean value from the uPSP measurement; (2) apply the Fast Fourier Transform (FFT) on the resulting data with zero mean. The DMD of the uPSP measurements with FFT has two advantages: (1) the FFT algorithm is well known for its computational efficiency, therefore, compared to the SVD-based DMD algorithm, the DMD with FFT reduces the computation time; (2) the DMD with FFT can be easily implemented in parallel processing. The DMD outputs were generated with the execution in parallel of a code in C, with libraries of FFTW for FFT and MPI/OpenMP for parallel processing, on the NASA Pleiades supercomputer. In this paper, the results of DMD of the uPSP measurements in the tests of Mach sweep runs of the SLS ATAT are presented, and the effectiveness of the DMD of the uPSP measurements in the diagnosis of the unsteady, aerodynamic phenomena is demonstrated. The work described in this paper is a part of NASA’s development of a new state-of-the-art uPSP capability in production wind tunnels. Funding for this research was provided by the NASA Aeroscience Evaluation and Test Capabilities Project.

Pressure-Sensitive Paint↗

Texture measurements for the automatic classification of imagery

The stated purpose is to demonstrate the applicability of texture measurements for making distinctions between classes of imagery. Multispectral images obtained from aircraft and satellites have been successfully delineated into land use classes on the basis of density in the different spectral bands. However, spatial patterns can add additional information to improve classification accuracy. A comparison is made between the results obtained using five texture algorithms for separating land use classes using ERTS imagery. The transforms evaluated are the Karhunen-Loeve, the fast Fourier, the Walsh-Hadamard, the Slant, and a digital matched filter.

Kirvida, L.↗