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 163 records · Page 9

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↗

Speeding up Particle Track Reconstruction in the CMS Detector using a Vectorized and Parallelized Kalman Filter Algorithm

Building particle tracks is the most computationally intense step of event reconstruction at the LHC. With the increased instantaneous luminosity and associated increase in pileup expected from the High-Luminosity LHC, the computational challenge of track finding and fitting requires novel solutions. The current track reconstruction algorithms used at the LHC are based on Kalman filter methods that achieve good physics performance. By adapting the Kalman filter techniques for use on many-core SIMD architectures such as the Intel Xeon and Intel Xeon Phi and (to a limited degree) NVIDIA GPUs, we are able to obtain significant speedups and comparable physics performance. New optimizations, including a dedicated post-processing step to remove duplicate tracks, have improved the algorithm's performance even further. Here we report on the current structure and performance of the code and future plans for the algorithm.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Grid-based minimization at scale: Feldman-Cousins corrections for SBN

We present a computational model for the construction of Feldman-Cousins (FC) corrections frequently used in High Energy Physics (HEP) analysis. The program contains a grid-based minimization and is written in C++. Our algorithms exploit vectorization through Eigen3, yielding a single-core speed-up of 350 compared to the original implementation, and achieve MPI data parallelism by using DIY. We demonstrate the application to scale very well at High Performance Computing (HPC) sites. We use HDF5 in conjunction with HighFive to write results of the calculation to file.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reconstruction of Charged Particle Tracks in Realistic Detector Geometry Using a Vectorized and Parallelized Kalman Filter Algorithm

One of the most computationally challenging problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is finding and fitting particle tracks during event reconstruction. Algorithms used at the LHC today rely on Kalman filtering, which builds physical trajectories incrementally while incorporating material e ects and error estimation. Recognizing the need for faster computational throughput, we have adapted Kalman-filterbased methods for highly parallel, many-core SIMD and SIMT architectures that are now prevalent in high-performance hardware. Previously we observed significant parallel speedups, with physics performance comparable to CMS standard tracking, on Intel Xeon, Intel Xeon Phi, and (to a limited extent) NVIDIA GPUs. While early tests were based on artificial events occurring inside an idealized barrel detector, we showed subsequently that our mkFit software builds tracks successfully from complex simulated events (including detector pileup) occurring inside a geometrically accurate representation of the CMS-2017 tracker. Here, we report on advances in both the computational and physics performance of mkFit, as well as progress toward integration with CMS production software. Recently we have improved the overall eciency of the algorithm by preserving short track candidates at a relatively early stage rather than attempting to extend them over many layers. Moreover, mkFit formerly produced an excess of duplicate tracks; these are now explicitly removed in an additional processing step. We demonstrate that with these enhancements, mkFit becomes a suitable choice for the first iteration of CMS tracking, and eventually for later iterations as well. We plan to test this capability in the CMS High Level Trigger during Run 3 of the LHC, with an ultimate goal of using it in both the CMS HLT and oine reconstruction for the HL-LHC CMS tracker.

Cerati, Giuseppe↗

SU-E-J-115: Correlation of Displacement Vector Fields Calculated by Deformable Image Registration Algorithms with Motion Parameters of CT Images with Well-Defined Targets and Controlled-Motion

Purpose: To investigate correlation of displacement vector fields (DVF) calculated by deformable image registration algorithms with motion parameters in helical axial and cone-beam CT images with motion artifacts. Methods: A mobile thorax phantom with well-known targets with different sizes that were made from water-equivalent material and inserted in foam to simulate lung lesions. The thorax phantom was imaged with helical, axial and cone-beam CT. The phantom was moved with a cyclic motion with different motion amplitudes and frequencies along the superior-inferior direction. Different deformable image registration algorithms including demons, fast demons, Horn-Shunck and iterative-optical-flow from the DIRART software were used to deform CT images for the phantom with different motion patterns. The CT images of the mobile phantom were deformed to CT images of the stationary phantom. Results: The values of displacement vectors calculated by deformable image registration algorithm correlated strongly with motion amplitude where large displacement vectors were calculated for CT images with large motion amplitudes. For example, the maximal displacement vectors were nearly equal to the motion amplitudes (5mm, 10mm or 20mm) at interfaces between the mobile targets lung tissue, while the minimal displacement vectors were nearly equal to negative the motion amplitudes. The maximal and minimal displacement vectors matched with edges of the blurred targets along the Z-axis (motion-direction), while DVF’s were small in the other directions. This indicates that the blurred edges by phantom motion were shifted largely to match with the actual target edge. These shifts were nearly equal to the motion amplitude. Conclusions: The DVF from deformable-image registration algorithms correlated well with motion amplitude of well-defined mobile targets. This can be used to extract motion parameters such as amplitude. However, as motion amplitudes increased, image artifacts increased significantly and that limited image quality and poor correlation between the motion amplitude and DVF was obtained.

60 APPLIED LIFE SCIENCES↗

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.↗

Automatic Classification of Biological Targets in a Tidal Channel Using a Multibeam Sonar

Multibeam sonars are widely used for environmental monitoring of fauna at marine renewable energy sites. However, they can rapidly accrue vast volumes of data, which poses a challenge for data processing. Here, using data from a deployment in a tidal channel with peak currents of 1–2 m s –1 , we demonstrate the data-reduction benefits of real-time automatic classification of targets detected and tracked in multibeam sonar data. First, we evaluate classification capabilities for three machine learning algorithms: random forests, support vector machines, and k-nearest neighbors. For each algorithm, a hill-climbing search optimizes a set of hand-engineered attributes that describe tracked targets. Here, the random forest algorithm is found to be most effective—in postprocessing, discriminating between biological and nonbiological targets with a recall rate of 0.97 and a precision of 0.60. In addition, 89% of biological targets are correctly classified as either seals, diving birds, fish schools, or small targets. Model dependence on the volume of training data is evaluated. Second, a real-time implementation of the model is shown to distinguish between biological targets and nonbiological targets with nearly the same performance as in postprocessing. From this, we make general recommendations for implementing real-time classification of biological targets in multibeam sonar data and the transferability of trained models.

16 TIDAL AND WAVE POWER↗

Training SVMs without offset

We develop, analyze, and test a training algorithm for support vector machine cla.'>sifiers without offset. Key features of this algorithm are a new stopping criterion and a set of working set selection strategies that, although inexpensive, do not lead to substantially more iterations than the optimal working set selection strategy. For these working set strategies, we establish convergence rates that coincide with the best known rates for SYMs with offset. We further conduct various experiments that investigate both the run time behavior and the performed iterations of the new training algorithm. It turns out, that the new algorithm needs less iterations and run-time than standard training algorithms for SYMs with offset.

97 MATHEMATICS AND COMPUTING↗

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.↗

Magnetoacoustic tomography with magnetic induction for high-resolution bioimepedance imaging through vector source reconstruction under the static field of MRI magnet

Purpose: Magnetoacoustic tomography with magnetic induction (MAT-MI) is an imaging modality to reconstruct the electrical conductivity of biological tissue based on the acoustic measurements of Lorentz force induced tissue vibration. This study presents the feasibility of the authors' new MAT-MI system and vector source imaging algorithm to perform a complete reconstruction of the conductivity distribution of real biological tissues with ultrasound spatial resolution. Methods: In the present study, using ultrasound beamformation, imaging point spread functions are designed to reconstruct the induced vector source in the object which is used to estimate the object conductivity distribution. Both numerical studies and phantom experiments are performed to demonstrate the merits of the proposed method. Also, through the numerical simulations, the full width half maximum of the imaging point spread function is calculated to estimate of the spatial resolution. The tissue phantom experiments are performed with a MAT-MI imaging system in the static field of a 9.4 T magnetic resonance imaging magnet. Results: The image reconstruction through vector beamformation in the numerical and experimental studies gives a reliable estimate of the conductivity distribution in the object with a ∼1.5 mm spatial resolution corresponding to the imaging system frequency of 500 kHz ultrasound. In addition, the experiment results suggest that MAT-MI under high static magnetic field environment is able to reconstruct images of tissue-mimicking gel phantoms and real tissue samples with reliable conductivity contrast. Conclusions: The results demonstrate that MAT-MI is able to image the electrical conductivity properties of biological tissues with better than 2 mm spatial resolution at 500 kHz, and the imaging with MAT-MI under a high static magnetic field environment is able to provide improved imaging contrast for biological tissue conductivity reconstruction.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

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.↗