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 685 records · Page 38

A prescription of Winograd's discrete Fourier transform algorithm

A detailed and complete description of Winograd's discrete Fourier transform algorithm (DFT) is presented omitting all proofs and derivations. The algorithm begins with the transfer of data from the input vector array to the working array where the actual transformation takes place, otherwise known as input scrambling and output unscrambling. The third array holds constraints required in the transformation stage that are evaluated in the precomputation stage. The algorithm is made up of several FORTRAN subroutines which are not to be confused with practical software algorithmic implementation since they are designed for clarity and not for speed.

Zohar, S.↗

Algorithms and programming tools for image processing on the MPP, part 2

A number of algorithms were developed for image warping and pyramid image filtering. Techniques were investigated for the parallel processing of a large number of independent irregular shaped regions on the MPP. In addition some utilities for dealing with very long vectors and for sorting were developed. Documentation pages for the algorithms which are available for distribution are given. The performance of the MPP for a number of basic data manipulations was determined. From these results it is possible to predict the efficiency of the MPP for a number of algorithms and applications. The Parallel Pascal development system, which is a portable programming environment for the MPP, was improved and better documentation including a tutorial was written. This environment allows programs for the MPP to be developed on any conventional computer system; it consists of a set of system programs and a library of general purpose Parallel Pascal functions. The algorithms were tested on the MPP and a presentation on the development system was made to the MPP users group. The UNIX version of the Parallel Pascal System was distributed to a number of new sites.

Reeves, Anthony P.↗

Numerical solution of 2D-vector tomography problem using the method of approximate inverse

We propose a numerical solution of reconstruction problem of a two-dimensional vector field in a unit disk from the known values of the longitudinal and transverse ray transforms. The algorithm is based on the method of approximate inverse. Numerical simulations confirm that the proposed method yields good results of reconstruction of vector fields.

97 MATHEMATICS AND COMPUTING↗

An assessment of 'shuffle algorithm' collision mechanics for particle simulations

Among the algorithms for collision mechanics used at present, the 'shuffle algorithm' of Baganoff (McDonald and Baganoff, 1988; Baganoff and McDonald, 1990) not only allows efficient vectorization, but also discretizes the possible outcomes of a collision. To assess the applicability of the shuffle algorithm, a simulation was performed of flows in monoatomic gases and the calculated characteristics of shock waves was compared with those obtained using a commonly employed isotropic scattering law. It is shown that, in general, the shuffle algorithm adequately represents the collision mechanics in cases when the goal of calculations are mean profiles of density and temperature.

Feiereisen, William J.↗

Use of the NLPQLP Sequential Quadratic Programming Algorithm to Solve Rotorcraft Aeromechanical Constrained Optimisation Problems

Optimization of the control vector, configuration and aerodynamic surface design potentially offers significant performance enhancement to rotorcraft systems. These analyses indicated that non-linear programming methods that solve a sequence of related quadratic-programming sub-problems could be used successfully to solve these problems. Accordingly, a license for one of the latest versions of Professor Schittkowski's very successful Sequential Quadratic Programming NLPQLP software was obtained and used to experiment and analyze typical optimization problems of the type encountered in various rotorcraft wind tunnel and flight tests. Emphasis was directed toward obtaining efficiency, robustness and speed in computation.

Use of the NLPQLP↗

Machine learning and algebraic approaches towards complete matter spectra in 4d F-theory

Motivated by engineering vector-like (Higgs) pairs in the spectrum of 4d F-theory compactifications, we combine machine learning and algebraic geometry techniques to analyze line bundle cohomologies on families of holomorphic curves. To quantify jumps of these cohomologies, we first generate 1.8 million pairs of line bundles and curves embedded in dP 3 , for which we compute the cohomologies. A white-box machine learning approach trained on this data provides intuition for jumps due to curve splittings, which we use to construct additional vector-like Higgs-pairs in an F-Theory toy model. We also find that, in order to explain quantitatively the full dataset, further tools from algebraic geometry, in particular Brill-Noether theory, are required. Using these ingredients, we introduce a diagrammatic way to express cohomology jumps across the parameter space of each family of matter curves, which reflects a stratification of the F-theory complex structure moduli space in terms of the vector-like spectrum. Furthermore, these insights provide an algorithmically efficient way to estimate the possible cohomology dimensions across the entire parameter space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Occupancy prediction through machine learning and data fusion of environmental sensing and Wi-Fi sensing in buildings

Occupancy information is crucial to building facility design, operation, and energy efficiency. Many studies propose the use of environmental sensors (such as carbon dioxide, air temperature, and relative humidity sensors) and radio-frequency sensors (Wi-Fi networks) to monitor, assess, and predict occupancy information for buildings. As many methods have been developed and a variety of sensory data sources are available, establishing a proper selection of model and data source is critical to the successful implementation of occupancy prediction systems. This study compared three popular machine learning algorithms, including k-nearest neighbors (kNN), support vector machine (SVM), and artificial neural network (ANN), combined with three data sources, including environmental data, Wi-Fi data, and fused data, to optimize the occupancy models’ performance in various scenarios. Three error measurement metrics, the mean average error (MAE), mean average percentage error (MAPE), and root mean squared error (RMSE), have been employed to compare the models’ accuracies. Examined with an on-site experiment, the results suggest that the ANN-based model with fused data has the best performance, while the SVM model is more suitable with Wi-Fi data. The results also indicate that, comparing with independent data sources, the fused data set does not necessarily improve model accuracy but shows a better robustness for occupancy prediction.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization

In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton method is considered to solve constrained optimization problems. In particular, dynamic optimization problems, which are known to be highly expensive, are the focus. A memory efficient semismooth Newton algorithm is introduced for these problems. The source of efficiency and inexactness is the randomized matrix sketching. Further, applications to optimization problems constrained by partial differential equations are also considered.

97 MATHEMATICS AND COMPUTING↗

Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Processors and GPUs

For over a decade now, physical and energy constraints have limited clock speed improvements in commodity microprocessors. Instead, chipmakers have been pushed into producing lower-power, multi-core processors such as Graphical Processing Units (GPU), ARM CPUs, and Intel MICs. Broad-based efforts from manufacturers and developers have been devoted to making these processors user-friendly enough to perform general computations. However, extracting performance from a larger number of cores, as well as specialized vector or SIMD units, requires special care in algorithm design and code optimization. One of the most computationally challenging problems in high-energy particle experiments is finding and fitting the charged-particle tracks during event reconstruction. This is expected to become by far the dominant problem at the High-Luminosity Large Hadron Collider (HL-LHC), for example. Today the most common track finding methods are those based on the Kalman filter. Experience with Kalman techniques on real tracking detector systems has shown that they are robust and provide high physics performance. This is why they are currently in use at the LHC, both in the trigger and offine. Previously we reported on the significant parallel speedups that resulted from our investigations to adapt Kalman filters to track fitting and track building on Intel Xeon and Xeon Phi. Here, we discuss our progresses toward the understanding of these processors and the new developments to port the Kalman filter to NVIDIA GPUs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

TROPHY: A Topologically Robust Physics-Informed Tracking Framework for Tropical Cyclones

Tropical cyclones (TCs) are among the most destructive weather systems. Realistically and efficiently detecting and tracking TCs are critical for assessing their impacts and risks. In particular, the eye is a signature feature of a mature TC. Therefore, knowing the eyes’ locations and movements is crucial for both operational weather forecasts and climate risk assessments. Recently, a multilevel robustness framework has been introduced to study the critical points of time-varying vector fields. The framework quantifies the robustness (i.e., structural stability) of critical points across varying neighborhoods. By relating the multilevel robustness with critical point tracking, the framework has demonstrated its potential in cyclone tracking. An advantage is that it identifies cyclonic features using only 2D wind vector fields, which is encouraging as most tracking algorithms require multiple dynamic and thermodynamic variables at different altitudes. A disadvantage is that the framework does not scale well computationally for datasets containing a large number of cyclones. Herein this paper introduces a topologically robust physics-informed tracking framework (TROPHY) for TC tracking. The main idea is to integrate physical knowledge of TC to drastically improve the computational efficiency of multilevel robustness framework for large-scale climate datasets. First, during preprocessing, we propose a physics-informed feature selection strategy to filter 90% of critical points that are short-lived and have low stability, thus preserving good candidates for TC tracking. Second, during in-processing, we impose constraints during the multilevel robustness computation to focus only on physics-informed neighborhoods of TCs. We apply TROPHY to 30 years of 2D wind fields from reanalysis data in ERA5 and generate a number of TC tracks. In comparison with the observed tracks, we demonstrate that TROPHY can capture TC characteristics (e.g., frequency, intensity, duration, latitudes with maximum intensity, and genesis) that are comparable to and sometimes even better than a well-validated TC tracking algorithm that requires multiple dynamic and thermodynamic scalar fields.

97 MATHEMATICS AND COMPUTING↗

Segmenting water and shadow regions within WorldView imagery using local binary patterns

Many shadow detection algorithms pertaining to remotely sensed imagery exist. Several of these algorithms exploit the spectral characteristics of shadows within imagery to identify shaded regions. However, these algorithms can have problems when water is also present within the imagery because water shares similar spectral characteristics with shadows. Many of these algorithms are applied to small image subsets instead of the image as a whole and frequently are applied to urban environments that require additional use of the normalized difference water index or other features to affect the removal of water from the shadow mask. This diversity of the image scene content coupled with the complexity and wide variety of environmental conditions that satellite imagery can acquire makes reliably separating shadow and water within larger images a complex problem. Thresholding various spectral indices to produce segmentation maps can be challenging when large, complex, and often imbalanced scenes are captured, which may require manual adjustment of algorithmic parameters for different image areas. Here, we present a methodology that makes use of the near-infrared channel using a watershed segmentation algorithm, local binary pattern measurements, and a support vector machine to classify shadow and water within a full WorldView scene. Results are promising with initial accuracies above 97% for both shadow and water.

47 OTHER INSTRUMENTATION↗

Carrier Transport and Related Effects in Detectors of the Cryogenic Dark Matter Search

The Cryogenic Dark Matter Search (CDMS) is searching for weakly-interacting massive particles (WIMPS), which could explain the dark matter problem in cosmology and particle physics. By simultaneously measuring signals from deposited charge and the energy in nonequilibrium phonons created by particle interactions in intrinsic germanium crystals at a temperature of 40 mK, a signature response for each event is produced. This response, combined with phonon pulse-shape information, allows CDMS to actively discriminate candidate WIMP interactions with nuclei from electromagnetic radioactive background which interacts with electrons. The challenges associated with these techniques are unique. Carrier scattering is dominated by the spontaneous emission of Luke-Neganov phonons due to zeropoint fluctuations of the lattice ions. Drift fields are maintained at only a few V/cm, else these emitted phonons would dominate the phonons of the original interaction. The dominant systematic issues with CDMS detectors are due to the effects of space charge accumulation. It has been an open question how space charge accrues, and by which of several potential recombination and ionization processes. In this work, we have simulated the transport of electrons and holes in germanium under CDMS conditions. We have implemented both a traditional Monte Carlo technique based on carrier energy, followed later by a novel Monte Carlo algorithm with scattering rates defined and sampled by vector momentum. This vector-based method provides for a full anisotropic simulation of carrier transport including free-fight acceleration with an anisotropic mass, and anisotropic scattering rates. With knowledge of steady state carrier dynamics as a function of applied field, the results of our Monte Carlo simulations allow us to make a wide variety of predictions for energy dependent processes for both electrons and holes. Such processes include carrier capture by charged impurities, neutral impurities, static dipoles, and capture forming "anion" (D - /A + ) states. We also generate predictions for impact ionization of shallow impurities and of impact "neutralization" of D - /A + states. We use measurements of carrier capture performed on CDMS detectors to validate a plausible model for electron and hole capture due to neutral shallow impurities and their charged D - /A + states. This model, along with carrier drift and diffusion parameters from Monte Carlo simulation, can be used as the foundation for simulations of space charge evolution in CDMS detectors, simultaneously solving continuity equations with Poisson's equation.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Machine Learning with Gradient-Based Optimization of Nuclear Waste Vitrification with Uncertainties and Constraints

Gekko is an optimization suite in Python that solves optimization problems involving mixed-integer, nonlinear, and differential equations. The purpose of this study is to integrate common Machine Learning (ML) algorithms such as Gaussian Process Regression (GPR), support vector regression (SVR), and artificial neural network (ANN) models into Gekko to solve data based optimization problems. Uncertainty quantification (UQ) is used alongside ML for better decision making. These methods include ensemble methods, model-specific methods, conformal predictions, and the delta method. An optimization problem involving nuclear waste vitrification is presented to demonstrate the benefit of ML in this field. ML models are compared against the current partial quadratic mixture (PQM) model in an optimization problem in Gekko. GPR with conformal uncertainty was chosen as the best substitute model as it had a lower mean squared error of 0.0025 compared to 0.018 and more confidently predicted a higher waste loading of 37.5 wt% compared to 34 wt%. The example problem shows that these tools can be used in similar industry settings where easier use and better performance is needed over classical approaches. Future works with these tools include expanding them with other regression models and UQ methods, and exploration into other optimization problems or dynamic control.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Preliminary study of the use of the STAR-100 computer for transonic flow calculations

An explicit method for solving the transonic small-disturbance potential equation is presented. This algorithm, which is suitable for the new vector-processor computers such as the CDC STAR-100, is compared to successive line over-relaxation (SLOR) on a simple test problem. The convergence rate of the explicit scheme is slower than that of SLOR, however, the efficiency of the explicit scheme on the STAR-100 computer is sufficient to overcome the slower convergence rate and allow an overall speedup compared to SLOR on the CYBER 175 computer.

Keller, J. D.↗

A feasibility study of a 3-D finite element solution scheme for aeroengine duct acoustics

The advantage from development of a 3-D model of aeroengine duct acoustics is the ability to analyze axial and circumferential liner segmentation simultaneously. The feasibility of a 3-D duct acoustics model was investigated using Galerkin or least squares element formulations combined with Gaussian elimination, successive over-relaxation, or conjugate gradient solution algorithms on conventional scalar computers and on a vector machine. A least squares element formulation combined with a conjugate gradient solver on a CDC Star vector computer initially appeared to have great promise, but severe difficulties were encountered with matrix ill-conditioning. These difficulties in conditioning rendered this technique impractical for realistic problems.

Abrahamson, A. L.↗

Dynamic scheduling of runway operations

Automated ATM/C decision making is discussed. Runway scheduling and flight plan generator algorithms are considered. Terminal area geometry, ATM/C schematics, vector controller display and simulation work are reported.

Pararas, J.↗

A highly optimized vectorized code for Monte Carlo simulations of SU(3) lattice gauge theories

New methods are introduced for improving the performance of the vectorized Monte Carlo SU(3) lattice gauge theory algorithm using the CDC CYBER 205. Structure, algorithm and programming considerations are discussed. The performance achieved for a 16(4) lattice on a 2-pipe system may be phrased in terms of the link update time or overall MFLOPS rates. For 32-bit arithmetic, it is 36.3 microsecond/link for 8 hits per iteration (40.9 microsecond for 10 hits) or 101.5 MFLOPS.

Barkai, D.↗

Robot arm dynamic model reduction for control

General methods are described by which the mathematical complexities of explicit and exact state equations of robot arms can be reduced to a simplified and compact state equation representation without introducing significant errors into the robot arm dynamic model. The model reduction methods are based on homogeneous coordinates and on the Langrangian algorithm for robot arm dynamics, and utilize matrix, vector and numeric analysis techniques. The derivation of differential vector representation of centripetal and Coriolis forces which has not yet been established in the literature is presented.

Bejczy, A. K.↗