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 1,405 records · Page 78

Neural network classification of questionable EGRET events

High energy gamma rays (greater than 20 MeV) pair producing in the spark chamber of the Energetic Gamma Ray Telescope Experiment (EGRET) give rise to a characteristic but highly variable 3-D locus of spark sites, which must be processed to decide whether the event is to be included in the database. A significant fraction (about 15 percent or 10(exp 4) events/day) of the candidate events cannot be categorized (accept/reject) by an automated rule-based procedure; they are therefore tagged, and must be examined and classified manually by a team of expert analysts. We describe a feedforward, back-propagation neural network approach to the classification of the questionable events. The algorithm computes a set of coefficients using representative exemplars drawn from the preclassified set of questionable events. These coefficients map a given input event into a decision vector that, ideally, describes the correct disposition of the event. The net's accuracy is then tested using a different subset of preclassified events. Preliminary results demonstrate the net's ability to correctly classify a large proportion of the events for some categories of questionables. Current work includes the use of much larger training sets to improve the accuracy of the net.

Meetre, C. A.↗

Using single buffers and data reorganization to implement a multi-megasample fast Fourier transform

Data ordering in large fast Fourier transforms (FFT's) is both conceptually and implementationally difficult. Discribed here is a method of visualizing data orderings as vectors of address bits, which enables the engineer to use more efficient data orderings and reduce double-buffer memory designs. Also detailed are the difficulties and algorithmic solutions involved in FFT lengths up to 4 megasamples (Msamples) and sample rates up to 80 MHz.

Brown, R. D.↗

Optimizing interplanetary trajectories with deep space maneuvers

Analysis of interplanetary trajectories is a crucial area for both manned and unmanned missions of the Space Exploration Initiative. A deep space maneuver (DSM) can improve a trajectory in much the same way as a planetary swingby. However, instead of using a gravitational field to alter the trajectory, the on-board propulsion system of the spacecraft is used when the vehicle is not near a planet. The purpose is to develop an algorithm to determine where and when to use deep space maneuvers to reduce the cost of a trajectory. The approach taken to solve this problem uses primer vector theory in combination with a non-linear optimizing program to minimize Delta(V). A set of necessary conditions on the primer vector is shown to indicate whether a deep space maneuver will be beneficial. Deep space maneuvers are applied to a round trip mission to Mars to determine their effect on the launch opportunities. Other studies which were performed include cycler trajectories and Mars mission abort scenarios. It was found that the software developed was able to locate quickly DSM's which lower the total Delta(V) on these trajectories.

Navagh, John↗

Small Orbital Stereo Tracking Camera Technology Development

On-Orbit Small Debris Tracking and Characterization is a technical gap in the current National Space Situational Awareness necessary to safeguard orbital assets and crew. This poses a major risk of MOD damage to ISS and Exploration vehicles. In 2015 this technology was added to NASA's Office of Chief Technologist roadmap. For missions flying in or assembled in or staging from LEO, the physical threat to vehicle and crew is needed in order to properly design the proper level of MOD impact shielding and proper mission design restrictions. Need to verify debris flux and size population versus ground RADAR tracking. Use of ISS for In-Situ Orbital Debris Tracking development provides attitude, power, data and orbital access without a dedicated spacecraft or restricted operations on-board a host vehicle as a secondary payload. Sensor Applicable to in-situ measuring orbital debris in flux and population in other orbits or on other vehicles. Could enhance safety on and around ISS. Some technologies extensible to monitoring of extraterrestrial debris as well to help accomplish this, new technologies must be developed quickly. The Small Orbital Stereo Tracking Camera is one such up and coming technology. It consists of flying a pair of intensified megapixel telephoto cameras to evaluate Orbital Debris (OD) monitoring in proximity of International Space Station. It will demonstrate on-orbit optical tracking (in situ) of various sized objects versus ground RADAR tracking and small OD models. The cameras are based on Flight Proven Advanced Video Guidance Sensor pixel to spot algorithms (Orbital Express) and military targeting cameras. And by using twin cameras we can provide Stereo images for ranging & mission redundancy. When pointed into the orbital velocity vector (RAM), objects approaching or near the stereo camera set can be differentiated from the stars moving upward in background.

Bryan, Tom↗

Small Orbital Stereo Tracking Camera Technology Development

On-Orbit Small Debris Tracking and Characterization is a technical gap in the current National Space Situational Awareness necessary to safeguard orbital assets and crew. This poses a major risk of MOD damage to ISS and Exploration vehicles. In 2015 this technology was added to NASA's Office of Chief Technologist roadmap. For missions flying in or assembled in or staging from LEO, the physical threat to vehicle and crew is needed in order to properly design the proper level of MOD impact shielding and proper mission design restrictions. Need to verify debris flux and size population versus ground RADAR tracking. Use of ISS for In-Situ Orbital Debris Tracking development provides attitude, power, data and orbital access without a dedicated spacecraft or restricted operations on-board a host vehicle as a secondary payload. Sensor Applicable to in-situ measuring orbital debris in flux and population in other orbits or on other vehicles. Could enhance safety on and around ISS. Some technologies extensible to monitoring of extraterrestrial debris as well To help accomplish this, new technologies must be developed quickly. The Small Orbital Stereo Tracking Camera is one such up and coming technology. It consists of flying a pair of intensified megapixel telephoto cameras to evaluate Orbital Debris (OD) monitoring in proximity of International Space Station. It will demonstrate on-orbit optical tracking (in situ) of various sized objects versus ground RADAR tracking and small OD models. The cameras are based on Flight Proven Advanced Video Guidance Sensor pixel to spot algorithms (Orbital Express) and military targeting cameras. And by using twin cameras we can provide Stereo images for ranging & mission redundancy. When pointed into the orbital velocity vector (RAM), objects approaching or near the stereo camera set can be differentiated from the stars moving upward in background.

Bryan, Tom↗

Cloud Thermodynamic Phase Detection with Polarimetrically Sensitive Passive Sky Radiometers

The primary goal of this project has been to investigate if ground-based visible and near-infrared passive radiometers that have polarization sensitivity can determine the thermodynamic phase of overlying clouds, i.e. if they are comprised of liquid droplets or ice particles. While this knowledge is important by itself for our understanding of the global climate, it can also help improve cloud property retrieval algorithms that use total (unpolarized) radiance to determine Cloud Optical Depth (COD). This is a potentially unexploited capability of some instruments in the NASA Aerosol Robotic Network (AERONET), which, if practical, could expand the products of that global instrument network at minimal additional cost. We performed simulations that found, for zenith observations, cloud thermodynamic phase is often expressed in the sign of the Q component of the Stokes polarization vector. We chose our reference frame as the plane containing solar and observation vectors, so the sign of Q indicates the polarization direction, parallel (negative) or perpendicular (positive) to that plane. Since the quantity of polarization is inversely proportional to COD, optically thin clouds are most likely to create a signal greater than instrument noise. Besides COD and instrument accuracy, other important factors for the determination of cloud thermodynamic phase are the solar and observation geometry (scattering angles between 40 and 60 degrees are best), and the properties of ice particles (pristine particles may have halos or other features that make them difficult to distinguish from water droplets at specific scattering angles, while extreme ice crystal aspect ratios polarize more than compact particles). We tested the conclusions of our simulations using data from polarimetrically sensitive versions of the Cimel 318 sun photometerradiometer that comprise AERONET. Most algorithms that exploit Cimel polarized observations use the Degree of Linear Polarization (DoLP), not the individual Stokes vector elements (such as Q). For this reason, we had no information about the accuracy of Cimel observed Q and the potential for cloud phase determination. Indeed, comparisons to ceilometer observations with a single polarized spectral channel version of the Cimel at a site in the Netherlands showed little correlation. Comparisons to Lidar observations with a more recently developed, multi-wavelength polarized Cimel in Maryland, USA, show more promise. This divergence between simulations and observations has prompted us to begin the development of a small test instrument called the Sky Polarization Radiometric Instrument for Test and Evaluation (SPRITE). This instrument is specifically devoted to the accurate observation of Q, and the testing of calibration and uncertainty assessment techniques, with the ultimate goal of understanding the practical feasibility of these measurements.

Knobelspiesse, Kirk D.↗

How to Estimate Attitude from Vector Observations

The most robust estimators minimizing Wahba's loss function are Davenport's q method and the Singular Value Decomposition (SVD) method. The q method is faster than the SVD method with three or more measurements. The other algorithms are less robust since they solve the characteristic polynomial equation to find the maximum eigenvalue of Davenport's K matrix. They are only preferable when speed or processor power is an important consideration. Of these, Fast Optimal Attitude Matrix (FOAM) is the most robust and faster than the q method. Robustness is only an issue for measurements with widely differing accuracies, so the fastest algorithms, Quaternion ESTimator (QUEST), EStimator of the Optimal Quaternion (ESOQ), and ESOQ2, are well suited to star sensor applications.

Markley, F. Landis↗

Controls Algorithms, Models, and Stability Assessments of the RCS and TVC systems on Mars Ascent Vehicle

This paper presents a control systems overview of the Mars Ascent Vehicle (MAV) control design and stability analysis with two separate control methods: Thrust Vector Control (TVC) based control using main engine thrust and Reaction Control System (RCS) via thrusters. A pole-placement TVC controller is proposed to address quickly peaking thrust produced by the MAV solid propulsion engine. The controllerutilizes real-time parameter estimation to calculate control gains using an online pole-placement method. The pole-placement technique allows the controller to maintain constant stability margins throughout the flight under changing parameters and rapidly peaking thrust. A mathematical stability proof via Lyapunov inequality and Nichols method is demonstrated to support the stability of the method. In addition to the TVC control, a phase-plane based RCS control logic is applied to the vehicle for roll control during ascent and all axes during coast phases of flight. The logic implemented is an on-off type logic that applies pre-determined thrusters firings in reference to boundary parameters of pointing and rate error chosen to balance desired pointing with stability. A describing function methodology is applied to the non-linear phase plane loop response to determine linear stability across all flight phases. The controller additionally applies command alteration logic to output signals to account for RCS hardware limitations. The following paper will provide the methodology for controller implementation of the TVC and RCS, and provide a summary of results of the MAV performance applying the aforementioned control design.

Han Woong Bae↗

Pushing memory bandwidth limitations through efficient implementations of Block-Krylov space solvers on GPUs

Lattice quantum chromodynamics simulations in nuclear physics have benefited from a tremendous number of algorithmic advances such as multigrid and eigenvector deflation. These improve the time to solution but do not alleviate the intrinsic memory-bandwidth constraints of the matrix-vector operation dominating iterative solvers. Batching this operation for multiple vectors and exploiting cache and register blocking can yield a super-linear speed up. Block-Krylov solvers can naturally take advantage of such batched matrix-vector operations, further reducing the iterations to solution by sharing the Krylov space between solves. However, practical implementations typically suffer from the quadratic scaling in the number of vector-vector operations. Here, using the QUDA library, we present an implementation of a block-CG solver on NVIDIA GPUs which reduces the memory-bandwidth complexity of vector-vector operations from quadratic to linear. We present results for the HISQ discretization, showing a 5x speedup compared to highly-optimized independent Krylov solves on NVIDIA's SaturnV cluster.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗

Classification of Arnold-Beltrami flows and their hidden symmetries

In the context of mathematical hydrodynamics, we consider the group theory structure which underlies the so named ABC flows introduced by Beltrami, Arnold and Childress. Main reference points are Arnold’s theorem stating that, for flows taking place on compact three manifolds ℳ{sub 3}, the only velocity fields able to produce chaotic streamlines are those satisfying Beltrami equation and the modern topological conception of contact structures, each of which admits a representative contact one-form also satisfying Beltrami equation. We advocate that Beltrami equation is nothing else but the eigenstate equation for the first order Laplace-Beltrami operator ★{sub g }d, which can be solved by using time-honored harmonic analysis. Taking for ℳ{sub 3}, a torus T {sup 3} constructed as ℝ{sup 3}/Λ, where Λ is a crystallographic lattice, we present a general algorithm to construct solutions of the Beltrami equation which utilizes as main ingredient the orbits under the action of the point group B {sub A }of three-vectors in the momentum lattice *Λ. Inspired by the crystallographic construction of space groups, we introduce the new notion of a Universal Classifying Group GA{sub Λ} which contains all space groups as proper subgroups. We show that the ★{sub g }d eigenfunctions are naturally arranged into irreducible representations of GA{sub Λ} and by means of a systematic use of the branching rules with respect to various possible subgroups H{sub i}⊂GA{sub Λ} we search and find Beltrami fields with non trivial hidden symmetries. In the case of the cubic lattice the point group is the proper octahedral group O{sub 24} and the Universal Classifying Group GA{sub cubic} is a finite group G{sub 1536} of order |G{sub 1536}| = 1536 which we study in full detail deriving all of its 37 irreducible representations and the associated character table. We show that the O{sub 24} orbits in the cubic lattice are arranged into 48 equivalence classes, the parameters of the corresponding Beltrami vector fields filling all the 37 irreducible representations of G{sub 1536}. In this way we obtain an exhaustive classification of all generalized ABC-flows and of their hidden symmetries. We make several conceptual comments about the need of a field-theory yielding Beltrami equation as a field equation and/or an instanton equation and on the possible relation of Arnold-Beltrami flows with (supersymmetric) Chern-Simons gauge theories. We also suggest linear generalizations of Beltrami equation to higher odd-dimensions that are different from the non-linear one proposed by Arnold and possibly make contact with M-theory and the geometry of flux-compactifications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

GridPACK™ : A Framework for Developing Power Grid Simulations on High-Performance Computing Platforms

This paper describes the GridPACK™ framework, which is designed to help power grid engineers develop modeling software capable of running on high performance computers. The framework makes extensive use of software templates to provide high level functionality while at the same time allowing developers the freedom to express whatever models and algorithms they are using. GridPACK™ contains modules for setting up distributed power grid networks, assigning buses and branches with arbitrary behaviors to the network, creating distributed matrices and vectors and using parallel linear and non-linear solvers to solve algebraic equations. It also provides mappers to create matrices and vectors based on properties of the network and functionality to support IO and to mana

Palmer, Bruce J.↗

Light Water Reactor Sustainability Program Status of Adaptive Surrogates within the RAVEN framework

The RAVEN code has been under development at the Idaho National Laboratory since 2012. Its main goal is to create a multi-purpose platform for the deploying of all the capabilities needed for Probabilistic Risk Assessment, uncertainty quantification, data mining analysis and optimization studies. RAVEN has demonstrated a good level of maturity in terms of state-of-art and advanced analysis methodologies. Indeed, in the past year the RAVEN code has been released as open-source project and is available to download (raven.inl.gov) free of charge. The main subject of this report is to show the activities that have been recently accomplished with respect the adaptive surrogate modeling: Implementation of the metric system for the assessment of surrogate model validity; Implementation of cross-validation techniques for the global assessment of surrogate models; Implementation of an automatic infrastructure for switching between a high-fidelity model (e.g. physical code) and a surrogate or set of surrogates; Implementation of a scheme for automatic optimization of surrogate model parameters. The aim of this document is to report the status of the development of methods, within the RAVEN framework, to assess the validity of the predictive capabilities of surrogate models. Indeed, after the construction of a surrogate tight to a certain physical model, it is crucial to assess the goodness of its representation, in order to be confident with its prediction. A cross-validation technique has been employed. This report will highlight the implementation details and proof its correct implementation by an application example. The implementation of a way to assess the predictive capabilities of a surrogate allowed the construction of a RAVEN new entity named “HybridModel” that is aimed to switch between an high-fidelity code and its linked surrogate. In addition, leveraging the optimization algorithms that have been implemented in RAVEN last fiscal year, a new scheme has been developed for automatic tuning of the surrogates’ parameters (e.g. penalty factors in support vector machines).

97 MATHEMATICS AND COMPUTING↗

L-BFGS Class Implementation in C++

This report presents a header-only C++ class implementation of the Limited-memory BroydenFletcher-Goldfarb-Shanno (L-BFGS) algorithm. The L-BFGS method is a general purpose quasi-Netwon optimization method that builds an approximation of the descent direction from consecutive iterate and gradient vectors. The limited-memory aspect stems from the replacement of the N × N approximation matrix of the original BFGS method with M vectors of length N. An example usage of the class is included along with the reference source code.

97 MATHEMATICS AND COMPUTING↗

Massively parallel neurocomputing for aerospace applications

An innovative hybrid, analog-digital charge-domain technology, for the massively parallel VLSI implementation of certain large scale matrix-vector operations, has recently been introduced. It employs arrays of Charge Coupled/Charge Injection Device cells holding an analog matrix of charge, which process digital vectors in parallel by means of binary, non-destructive charge transfer operations. The impact of this technology on massively parallel processing is discussed. Fundamentally new classes of algorithms, specifically designed for this emerging technology, as applied to signal processing, are derived.

Fijany, Amir↗