Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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 109 records · Page 6

Open-Source Software for Modeling of Nanoelectronic Devices

The Nanoelectronic Modeling 3-D (NEMO 3-D) computer program has been upgraded to open-source status through elimination of license-restricted components. The present version functions equivalently to the version reported in "Software for Numerical Modeling of Nanoelectronic Devices" (NPO-30520), NASA Tech Briefs, Vol. 27, No. 11 (November 2003), page 37. To recapitulate: NEMO 3-D performs numerical modeling of the electronic transport and structural properties of a semiconductor device that has overall dimensions of the order of tens of nanometers. The underlying mathematical model represents the quantum-mechanical behavior of the device resolved to the atomistic level of granularity. NEMO 3-D solves the applicable quantum matrix equation on a Beowulf-class cluster computer by use of a parallel-processing matrix vector multiplication algorithm coupled to a Lanczos and/or Rayleigh-Ritz algorithm that solves for eigenvalues. A prior upgrade of NEMO 3-D incorporated a capability for a strain treatment, parameterized for bulk material properties of GaAs and InAs, for two tight-binding submodels. NEMO 3-D has been demonstrated in atomistic analyses of effects of disorder in alloys and, in particular, in bulk In(x)Ga(1-x)As and in In(0.6)Ga(0.4)As quantum dots.

Oyafuso, Fabiano↗

Numerical Modeling of Nanoelectronic Devices

Nanoelectronic Modeling 3-D (NEMO 3-D) is a computer program for numerical modeling of the electronic structure properties of a semiconductor device that is embodied in a crystal containing as many as 16 million atoms in an arbitrary configuration and that has overall dimensions of the order of tens of nanometers. The underlying mathematical model represents the quantummechanical behavior of the device resolved to the atomistic level of granularity. The system of electrons in the device is represented by a sparse Hamiltonian matrix that contains hundreds of millions of terms. NEMO 3-D solves the matrix equation on a Beowulf-class cluster computer, by use of a parallel-processing matrix vector multiplication algorithm coupled to a Lanczos and/or Rayleigh-Ritz algorithm that solves for eigenvalues. In a recent update of NEMO 3-D, a new strain treatment, parameterized for bulk material properties of GaAs and InAs, was developed for two tight-binding submodels. The utility of the NEMO 3-D was demonstrated in an atomistic analysis of the effects of disorder in alloys and, in particular, in bulk In(x)Ga(l-x)As and in In0.6Ga0.4As quantum dots.

Klimeck, Gerhard↗

Space Launch System Implementation of Adaptive Augmenting Control

Given the complex structural dynamics, challenging ascent performance requirements, and rigorous flight certification constraints owing to its manned capability, the NASA Space Launch System (SLS) launch vehicle requires a proven thrust vector control algorithm design with highly optimized parameters to robustly demonstrate stable and high performance flight. On its development path to preliminary design review (PDR), the stability of the SLS flight control system has been challenged by significant vehicle flexibility, aerodynamics, and sloshing propellant dynamics. While the design has been able to meet all robust stability criteria, it has done so with little excess margin. Through significant development work, an adaptive augmenting control (AAC) algorithm previously presented by Orr and VanZwieten, has been shown to extend the envelope of failures and flight anomalies for which the SLS control system can accommodate while maintaining a direct link to flight control stability criteria (e.g. gain & phase margin). In this paper, the work performed to mature the AAC algorithm as a baseline component of the SLS flight control system is presented. The progress to date has brought the algorithm design to the PDR level of maturity. The algorithm has been extended to augment the SLS digital 3-axis autopilot, including existing load-relief elements, and necessary steps for integration with the production flight software prototype have been implemented. Several updates to the adaptive algorithm to increase its performance, decrease its sensitivity to expected external commands, and safeguard against limitations in the digital implementation are discussed with illustrating results. Monte Carlo simulations and selected stressing case results are shown to demonstrate the algorithm's ability to increase the robustness of the integrated SLS flight control system.

VanZwieten, Tannen S.↗

Space Launch System Implementation of Adaptive Augmenting Control

Given the complex structural dynamics, challenging ascent performance requirements, and rigorous flight certification constraints owing to its manned capability, the NASA Space Launch System (SLS) launch vehicle requires a proven thrust vector control algorithm design with highly optimized parameters to provide stable and high-performance flight. On its development path to Preliminary Design Review (PDR), the SLS flight control system has been challenged by significant vehicle flexibility, aerodynamics, and sloshing propellant. While the design has been able to meet all robust stability criteria, it has done so with little excess margin. Through significant development work, an Adaptive Augmenting Control (AAC) algorithm has been shown to extend the envelope of failures and flight anomalies the SLS control system can accommodate while maintaining a direct link to flight control stability criteria such as classical gain and phase margin. In this paper, the work performed to mature the AAC algorithm as a baseline component of the SLS flight control system is presented. The progress to date has brought the algorithm design to the PDR level of maturity. The algorithm has been extended to augment the full SLS digital 3-axis autopilot, including existing load-relief elements, and the necessary steps for integration with the production flight software prototype have been implemented. Several updates which have been made to the adaptive algorithm to increase its performance, decrease its sensitivity to expected external commands, and safeguard against limitations in the digital implementation are discussed with illustrating results. Monte Carlo simulations and selected stressing case results are also shown to demonstrate the algorithm's ability to increase the robustness of the integrated SLS flight control system.

Wall, John H.↗

Preliminary Design of the Guidance, Navigation, and Control System of the Altair Lunar Lander

Guidance, Navigation, and Control (GN&C) is the measurement and control of spacecraft position, velocity, and attitude in support of mission objectives. This paper provides an overview of a preliminary design of the GN&C system of the Lunar Lander Altair. Key functions performed by the GN&C system in various mission phases will first be described. A set of placeholder GN&C sensors that is needed to support these functions is next described. To meet Crew safety requirements, there must be high degrees of redundancy in the selected sensor configuration. Two sets of thrusters, one on the Ascent Module (AM) and the other on the Descent Module (DM), will be used by the GN&C system. The DM thrusters will be used, among other purposes, to perform course correction burns during the Trans-lunar Coast. The AM thrusters will be used, among other purposes, to perform precise angular and translational controls of the ascent module in order to dock the ascent module with Orion. Navigation is the process of measurement and control of the spacecraft's "state" (both the position and velocity vectors of the spacecraft). Tracking data from the Earth-Based Ground System (tracking antennas) as well as data from onboard optical sensors will be used to estimate the vehicle state. A driving navigation requirement is to land Altair on the Moon with a landing accuracy that is better than 1 km (radial 95%). Preliminary performance of the Altair GN&C design, relative to this and other navigation requirements, will be given. Guidance is the onboard process that uses the estimated state vector, crew inputs, and pre-computed reference trajectories to guide both the rotational and the translational motions of the spacecraft during powered flight phases. Design objectives of reference trajectories for various mission phases vary. For example, the reference trajectory for the descent "approach" phase (the last 3-4 minutes before touchdown) will sacrifice fuel utilization efficiency in order to provide landing site visibility for both the crew and the terrain hazard detection sensor system. One output of Guidance is the steering angle commands sent to the 2 degree-of-freedom (dof) gimbal actuation system of the descent engine. The engine gimbal actuation system is controlled by a Thrust Vector Control algorithm that is designed taking into account the large quantities of sloshing liquids in tanks mounted on Altair. In this early design phase of Altair, the GN&C system is described only briefly in this paper and the emphasis is on the GN&C architecture (that is still evolving). Multiple companion papers will provide details that are related to navigation, optical navigation, guidance, fuel sloshing, rendezvous and docking, machine-pilot interactions, and others. The similarities and differences of GN&C designs for Lunar and Mars landers are briefly compared.

Lee, Allan Y.↗

Encke-Beta Predictor for Orion Burn Targeting and Guidance

The state vector prediction algorithm selected for Orion on-board targeting and guidance is known as the Encke-Beta method. Encke-Beta uses a universal anomaly (beta) as the independent variable, valid for circular, elliptical, parabolic, and hyperbolic orbits. The variable, related to the change in eccentric anomaly, results in integration steps that cover smaller arcs of the trajectory at or near perigee, when velocity is higher. Some burns in the EM-1 and EM-2 mission plans are much longer than burns executed with the Apollo and Space Shuttle vehicles. Burn length, as well as hyperbolic trajectories, has driven the use of the Encke-Beta numerical predictor by the predictor/corrector guidance algorithm in place of legacy analytic thrust and gravity integrals.

Robinson, Shane↗

Using Machine-Learning Methods and Expert Prediction Probabilities to Forecast Solar Flares

It has long been known that studying connection between solar flares and properties of magnetic field in active regions is very important for understanding the flare physics and developing space weather forecasts. The Helioseismic and Magnetic Imager onboard the Solar Dynamics Observatory (SDO/HMI) obtains tremendous amounts of magnetic field data products. However the operational NOAA Space Weather Prediction Center (SWPC) forecasts of solar flares still represent prediction probabilities issued by the experts. In this research we investigate the possibilities to enhance the daily operational flare forecasts performed at the SWPC by developing a synergy of the expert predictions and physics-based criteria, and by employing machine-learning methods. Among the physics-based criteria we consider the descriptors of the Polarity Inversion Line (PIL) and Space weather HMI Active Region Patches (SHARP), and derive from them daily characteristics of the entire Sun. We also consider the daily descriptors of the GOES Soft X-Ray (SXR) 1-8 Angstroms flux such as the flare history of the previous days and averaged X-Ray flux. We estimate the effectiveness in separation of flaring and non-flaring cases for each characteristic, as well as for the expert prediction probabilities, and find that some PIL, SHARP and SXR descriptors are as effective as the expert prediction probabilities and should be considered to issue the flare forecast. Finally, we train and test several Machine-Learning classification algorithms (Support Vector Classifiers with various kernel functions, k-Nearest Neighbor Classifier, Random Forest Classifier, and Neural Networks) using the most effective descriptors and expert prediction probabilities, and compare the obtained predictions with the current SWPC forecasts.

Machine-Learning↗

Synthetic Tracking on a Small Telescope

Synthetic tracking uses high speed (up to 10 Hz) low noise (<2e-) large format sensors ~16 Mpix along with a multi-vector shift/add algorithm that coadds multiple image frames to increase the signal to noise ratio (SNR) needed to detect (if present) multiple moving objects in the field of view (FOV). We published the application of synthetic tracking to look for asteroids in 2014 (Shao 2014), but recently have applied it more as well to Earth orbiting objects. We have begun testing the data processing graphical processing unit (GPU) array with a small telescope, a 28 cm Celestron RASA telescope and a low cost low noise 16 Mpix CMOS camera at a dark site in California. This system is now operational with a 2 sqdeg FOV and a limiting magnitude between ~16-17.5 stellar magnitudes (mag) depending on a number of observational parameters for short integration times. The instrument can be used to search for NEOs, where we use much longer integration times to get sensitivity ~ 20.5 mag (at new moon). Synthetic tracking provides significant improvements in both sensitivity and astrometric accuracy.

Turyshev, Slava G.↗

Space-Borne Cloud-Native Satellite-Derived Bathymetry (SDB) Models Using ICESat-2 And Sentinel-2

Shallow nearshore coastal waters provide a wealth of societal, economic and ecosystem services, yet their topographic structure is poorly mapped due to a reliance upon expensive and time intensive methods. Space‐borne bathymetric mapping has helped address these issues, but has remained largely dependent upon in situ measurements. Here we fuse ICESat‐2 lidar data with Sentinel‐2 optical imagery, within the Google Earth Engine cloud platform, to create openly available spatially continuous high‐resolution bathymetric maps at regional‐to‐national scales in Florida, Crete and Bermuda. ICESat‐2 bathymetric classified photons are used to train three Satellite Derived Bathymetry (SDB) methods, including Lyzenga, Stumpf and Support Vector Regression algorithms. For each study site the Lyzenga algorithm yielded the lowest RMSE (approx. 10‐15%) when compared with validation data. We demonstrate a means of using ICESat‐2 for both model calibration and validation, thus cementing a pathway for fully space‐borne estimates of nearshore bathymetry in shallow, clear water environments.

N. Thomas↗

Parallel-vector unsymmetric Eigen-Solver on high performance computers

The popular QR algorithm for solving all eigenvalues of an unsymmetric matrix is reviewed. Among the basic components in the QR algorithm, it was concluded from this study, that the reduction of an unsymmetric matrix to a Hessenberg form (before applying the QR algorithm itself) can be done effectively by exploiting the vector speed and multiple processors offered by modern high-performance computers. Numerical examples of several test cases have indicated that the proposed parallel-vector algorithm for converting a given unsymmetric matrix to a Hessenberg form offers computational advantages over the existing algorithm. The time saving obtained by the proposed methods is increased as the problem size increased.

Nguyen, Duc T.↗

Attitude determination using vector observations: A fast optimal matrix algorithm

The attitude matrix minimizing Wahba's loss function is computed directly by a method that is competitive with the fastest known algorithm for finding this optimal estimate. The method also provides an estimate of the attitude error covariance matrix. Analysis of the special case of two vector observations identifies those cases for which the TRIAD or algebraic method minimizes Wahba's loss function.

Markley, F. Landis↗

Attitude determination using vector observations - A fast optimal matrix algorithm

The attitude matrix minimizing Wahba's loss function is computed directly by a method that is competitive with the fastest known algorithm for finding this optimal estimate. The method also provides an estimate of the attitude error covariance matrix. Analysis of the special case of two vector observations identifies those cases for which the TRIAD or algebraic method minimizes Wahba's loss function.

Markley, F. L.↗

The Seasat-A satellite scatterometer - The geophysical evaluation of remotely sensed wind vectors over the ocean

A description is given of the algorithm used to convert Seasat-A satellite microwave scatterometer measurements of ocean normalized radar cross section to the neutral stability vector wind at 19.5 m height, as well as to compare these winds with high-quality surface observations. The wind vector algorithm used an empirical normalized radar cross section model function to describe the ocean normalized radar cross section's dependence on the 19.5-m neutral stability wind vector. In addition, two model functions were evaluated by means of an independent set of in situ surface wind observations from the Joint Air Sea Interaction experiment (JASIN). Better results were produced by these comparisons than the stipulated Seasat wind speed and direction accuracy specifications of + or - 2 m/sec and + or - 20 deg, respectively, over the 0-16 m/sec range of winds observed during JASIN.

Jones, W. L.↗

Accommodating Sensor Uncertainty in the Cones Method: Polycones and Fuzzycones

The "cones method" is an analytical algorithm to combine a pair of angle observations into a common vector. Two new algorithms have been developed to optimize the "cones method" solutions when more than two observation angles are available and when estimates of measurement uncertainties can be made. The polycones algorithm consists of determining a simple weighted average of the solution vectors over all possible pairs of measurements with the weights determined from the measurement uncertainty. The Fuzzycones method finds the vector of maximum probability. Both of these methods have been implemented and tested and both reduce errors in computed vector positions.

Hashmall, Joseph A.↗

Skin Friction Measurement on a Swept NACA 0015 Wing Using Oil Film Interferometry

An application of oil film interferometry (OFI) to measure skin friction on the 3D flow over an NACA 0015 airfoil with 30° of sweep is presented. Local flow direction must be known to apply OFI to complex 3D flows such as this. A recently developed surface flow vector extraction method was integrated into the OFI analysis algorithm. Surface flow vectors were used to calculate the surface streamlines and hence provided local flow direction to the OFI analysis. After calibration using photogrammetry, the surface flow vectors also enabled decomposition of the skin friction coefficient into different components (such as chordwise and spanwise). The presented method successfully measured skin friction at locations with different flow characteristics such as high skin friction regions, strong spanwise flow regions, and 3D flow separated regions. In the current OFI analysis, multiple interferogram images acquired at different times were analyzed for the same location. The multiple interferogram analysis enabled averaging, which reduced the scatter the skin friction data. The results presented herein demonstrate the capability of the current approach, thereby extending OFI skin friction measurements to complex 3D flows.

Skin friction measurement↗

Skin Friction Measurement on a Swept NACA 0015 Wing Using Oil Film Interferometry

An application of oil film interferometry (OFI) to measure skin friction on the 3D flow over an NACA 0015 airfoil with 30° of sweep is presented. Local flow direction must be known to apply OFI to complex 3D flows such as this. A recently developed surface flow vector extraction method was integrated into the OFI analysis algorithm. Surface flow vectors were used to calculate the surface streamlines and hence provided local flow direction to the OFI analysis. After calibration using photogrammetry, the surface flow vectors also enabled decomposition of the skin friction coefficient into different components (such as chordwise and spanwise). The presented method successfully measured skin friction at locations with different flow characteristics such as high skin friction regions, strong spanwise flow regions, and 3D flow separated regions. In the current OFI analysis, multiple interferogram images acquired at different times were analyzed for the same location. The multiple interferogram analysis enabled averaging, which reduced the scatter the skin friction data. The results presented herein demonstrate the capability of the current approach, thereby extending OFI skin friction measurements to complex 3D flows.

Skin friction measurement↗

Three-axis attitude determination from vector observations

Two computationally efficient algorithms are presented for determining three-axis attitude from two or more vector observations. The first of these, the TRIAD algorithm, provides a deterministic (i.e., nonoptimal) solution for the attitude based on two vector observations. The second, the QUEST algorithm, is an optimal algorithm which determines the attitude that achieves the best weighted overlap of an arbitrary number of reference and observation vectors. Analytical expressions are given for the covariance matrices for the two algorithms using a fairly realistic model for the measurement errors. The mathematical relationship of the two algorithms and their relative merits are discussed and numerical examples are given. The advantage of computing the covariance matrix in the body frame rather than in the inertial frame (e.g., in terms of Euler angles) is emphasized. These results are valuable when a single-frame attitude must be computed frequently. They will also be useful to the mission analyst or spacecraft engineer for the evaluation of launch-window constraints or of attitude accuracies for different attitude sensor configurations.

Shuster, M. D.↗

Convergence and stability properties of minimal polynomial and reduced rank extrapolation algorithms

The minimal polynomial and reduced rank extrapolation algorithms are two acceleration of convergence methods for sequences of vectors. In a recent survey these methods were tested and compared with the scalar, vector, topological epsilon algorithms, and were observed to be more efficient than the latter. It was also observed that the two methods have similar convergence properties. The convergence and stability properties of these methods are analyzed and the performance of the acceleration methods when applied to a class of vector sequences that includes those sequences obtained from systems of linear equations by using matrix iterative methods is discussed.

Sidi, A.↗