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,531 records · Page 85

Solution of partial differential equations on vector and parallel computers

The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed.

Ortega, J. M.↗

Summary of research in applied mathematics, numerical analysis, and computer sciences

The major categories of current ICASE research programs addressed include: numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; control and parameter identification problems, with emphasis on effective numerical methods; computational problems in engineering and physical sciences, particularly fluid dynamics, acoustics, and structural analysis; and computer systems and software, especially vector and parallel computers.

Source record↗

Solution of partial differential equations on vector and parallel computers

The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed.

Ortega, J. M.↗

Comparison of velocity estimates from advanced very high resolution radiometer in the Coastal Transition Zone

Two methods of estimating surface velocity vectors from AVHRR data are applied to the same set of images and the results are compared with in situ and altimeter measurements. The first technique utilizes an automated feature-tracking algorithm and the second uses an inversion of the heat equation. The two methods were comparable in their degree of agreement with the in situ data, giving velocity magnitudes that were 30 to 50 percent less than drifter and acoustic Doppler current profiler velocities measured at 15 to 20 m depth, with rms directional differences of about 60 degrees.

Kelly, Kathryn A.↗

Efficient Cache use for Stencil Operations on Structured Discretization Grids

We derive tight bounds on the cache misses for evaluation of explicit stencil operators on structured grids. Our lower bound is based on the isoperimetrical property of the discrete octahedron. Our upper bound is based on a good surface to volume ratio of a parallelepiped spanned by a reduced basis of the interference lattice of a grid. Measurements show that our algorithm typically reduces the number of cache misses by a factor of three, relative to a compiler optimized code. We show that stencil calculations on grids whose interference lattice have a short vector feature abnormally high numbers of cache misses. We call such grids unfavorable and suggest to avoid these in computations by appropriate padding. By direct measurements on a MIPS R10000 processor we show a good correlation between abnormally high numbers of cache misses and unfavorable three-dimensional grids.

Frumkin, Michael↗

Computing for Aiming a Spaceborne Bistatic-Radar Transmitter

BISTAT is a computer program for use in aiming a spaceborne bistatic-radar transmitting antenna at a remote planet that has an atmosphere, such that after refraction by the atmosphere and reflection from the surface of the planet, the radar signal travels toward a receiver on Earth. BISTAT includes an algorithm that neglects atmospheric refraction and calculates a specular-reflection point for a spacecraft at a given location. The specular-reflection point is then used as an initial guess for a modified limb-track algorithm that takes atmospheric refraction into account. The output of BISTAT for all spacecraft positions of interest constitutes a pointing profile; the output data are in the form of an inertial-vector file and a Doppler-residual file. The inertial-vector file is used to command the attitude of the spacecraft; the Doppler-residual file is used to determine a downlink frequency file for the receiver.

Rappaport, Nicole↗

Understanding and Utilizing PBL Height Data from Multiple Observing Systems in the GEOS System

The accuracy of PBL height simulation is a key issue in many applications including forecasting near surface meteorology and air quality, however, it is a very challenging problem due to the lack of not only comprehensive, global Planetary Boundary Layer (PBL) observations but also a strategy and infrastructure to utilize PBL height data from a variety of sensors. Following the designation of PBL as an incubation class observable in the 2017 Decadal Survey, the PBL Incubation Study Team Report [14] made clear that “a future global PBL observing system requires modeling and data assimilation as essential components.” There is an urgent need for global modeling development in order to utilize Program of Record (POR) observations, assess their impacts, and identify gaps to be filled by future PBL missions. Our overall objective is to develop PBL data assimilation capabilities in the NASA Global Earth Observing System (GEOS), focusing on PBL height from multiple observing systems, to support the assessment and use of future PBL observations. The NASA GEOS system is composed of the GEOS global atmospheric general circulation model (AGCM) and the atmospheric data assimilation system (ADAS). The PBL parameterizations include the “Lock” K-profile scheme driven by surface and cloud-top buoyancy fluxes ([4]), and the “Louis” local scheme for stable conditions based on the Richardson number ([5]). Above the mixed layer defined by the Lock surface plume, shallow cumulus convection is represented by the mass flux scheme of [9]. Additional parameterizations are summarized in [1]. The ADAS employs the hybrid 4D Ensemble- Variational (EnVar) configuration ([15]), with the ensemble providing flow-dependent background error covariance information. The resultant analysis increments are fed back to the forecast model through the 4D incremental analysis update (IAU) approach ([11]). In this study, PBL height data are being or have been generated from radiosondes, GNSS RO, satellite (CATS, CALIPSO and ICESat-2) and ground-based (MPLNET) lidars, and wind profiler. Investigations have been conducted to specify quality marks for PBL height retrievals for the data assimilation purpose. These PBL height data have different strengths and weaknesses ([2], [3], [6], [7], [8], [10]), and the satellite PBL height data provide better global coverage and complement in-situ PBL height data. Radiosondes offer high accuracy and in situ measurement of temperature and humidity profiles, but with poor spatio-temporal sampling. The in-situ observing systems like MPLNET and wind profiler provide long history of PBL height records at each station. The GNSS RO based PBL height is retrieved based on the sharp gradients in refractivity profile that represent the fine vertical structure of temperature and moisture changes above the PBL. However, not all RO refractivity profiles reach the surface depending on location and regime, and RO refractivity retrievals can be negatively biased below 2km. The PBL height data from satellite lidars provide high resolution along track PBL height retrievals, but over land they are affected by previous day convective PBL aerosol and strongly associated with mixing layer and retrievals cannot be made below thick, attenuating clouds. A successful assimilation of PBL height data requires a thorough understanding of the observing method and the retrieval algorithm for each observing system in order to use the PBL height data from multiple observing systems properly. Due to the sensitivity of PBL height data to the observing method and choice of algorithm, it is important to use a model definition appropriate for each observation type to compute differences between PBL height data and model PBL height (OmFs). The GEOS model currently includes two PBL height definitions suitable for direct comparison with observed PBL height, and additional definitions are being added in this study. Evaluation of different model PBL height definitions is underway. Meanwhile, efforts have been made in the GEOS data assimilation system to develop PBL height data assimilation capability. PBL height data can be assimilated using two different approaches. The traditional approach is to construct an observation operator and its tangent linear and adjoint, which link control variables to PBL height data from each observing system. This observation operator can be very complicated, e.g., the lidar-based PBL height observation operator includes the backscatter lidar forward observation operator, the algorithm to derive PBL height from attenuated total backscatter, interpolation, and calculations handling the mismatch between observed and model scales. The other approach is to augment PBL height to the control variable vector, and it is adopted in this study. The latter approach was also used in previous studies, e.g., the assimilation of PBL height data from radiosonde and aircraft in the Real Time Mesoscale Analysis (RTMA) system for a dispersion modelling study ([13]); the PBL height assimilation study using lidar PBL height data at Greensburg, Kansas for a field campaign ([12]). The PBL height assimilation from multiple observing systems in this study allows us to take advantage of the diverse PBL height data that provide much better global coverage collectively under different meteorological conditions and with different temporal and spatial scales. As all the PBL heights are tightly coupled with the PBL thermodynamic variables, the strong correlations, which are provided by the 4D ensemble forecast, enable PBL height data from various sources to interact and combine coherently and provide additional information for PBL temperature and moisture fields. The results of comparisons among PBL height data from different sources and the evaluation of the model PBL height definitions with the PBL height data will be presented, and the PBL height data synergy strategies and preliminary results will also be discussed at the conference.

Y. Zhu↗

Human-like agents with posture planning ability

Human body models are geometric structures which may be ultimately controlled by kinematically manipulating their joints, but for animation, it is desirable to control them in terms of task-level goals. We address a fundamental problem in achieving task-level postural goals: controlling massively redundant degrees of freedom. We reduce the degrees of freedom by introducing significant control points and vectors, e.g., pelvis forward vector, palm up vector, and torso up vector, etc. This reduced set of parameters are used to enumerate primitive motions and motion dependencies among them, and thus to select from a small set of alternative postures (e.g., bend vs. squat to lower shoulder height). A plan for a given goal is found by incrementally constructing a goal/constraint set based on the given goal, motion dependencies, collision avoidance requirements, and discovered failures. Global postures satisfying a given goal/constraint set are determined with the help of incremental mental simulation which uses a robust inverse kinematics algorithm. The contributions of the present work are: (1) There is no need to specify beforehand the final goal configuration, which is unrealistic for the human body, and (2) the degrees of freedom problem becomes easier by representing body configurations in terms of 'lumped' control parameters, that is, control points and vectors.

Jung, Moon R.↗

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗

Performance of Advanced Signal Processing and Pattern Recognition Algorithms Using Raw Data from Ultrasonic Guided Waves and Fiber Optics Transducers

The Light Water Reactor Sustainability Program was initiated to evaluate technologies that could be used to perform online monitoring of piping and other secondary system structural components in commercial nuclear power plants. These online monitoring systems have the potential to identify when a more detailed inspection is needed using real-time measurements, rather than at a pre-determined inspection interval. This transition to condition-based, risk-informed automated maintenance will contribute to a significant reduction of operations and maintenance costs that account for most nuclear power generation costs. This report describes the current state of research related to ultrasonic guided wave testing and its application to detecting defects in commercial nuclear power plants. The report analyzes the applicability of the guided wave technology to secondary piping systems, as well as studying the potential for expanding the range of guided wave technology to include bent piping and other piping components. The ultrasonic guided waves can inspect long stretches of straight piping; however, more complex geometries such as elbows, welds, and tees are causing spurious reflections and coherent noise, which significantly decreases the sensitivity of the technique. To deal with these limitations, high-definition fiber optic sensors are applied to complex piping geometries, and advanced machine learning algorithms are used to detect deviations from healthy states. This report also analyzes the performance of advanced signal processing and machine learning-based pattern recognition algorithms in detecting defects in secondary structures. It is demonstrated on guided wave data collected at nuclear power plants that the independent component analysis can separate different coherent noise components and segregate them from useful signals. It also demonstrates that advanced machine learning techniques, such as neural networks, support vector machines, and deep learning networks, can detect minor defects present in inspected structures. Recommendation about the applicability of advanced machine learning techniques to online piping monitoring are also given.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A transition matrix approach to the Davenport gryo calibration scheme

The in-flight gyro calibration scheme commonly used by NASA Goddard Space Flight Center (GSFC) attitude ground support teams closely follows an original version of the Davenport algorithm developed in the late seventies. Its basic idea is to minimize the least-squares differences between attitudes gyro- propagated over the course of a maneuver and those determined using post- maneuver sensor measurements. The paper represents the scheme in a recursive form by combining necessary partials into a rectangular matrix, which is propagated in exactly the same way as a Kalman filters square transition matrix. The nontrivial structure of the propagation matrix arises from the fact that attitude errors are not included in the state vector, and therefore their derivatives with respect to estimated a parameters do not appear in the transition matrix gyro defined in the conventional way. In cases when the required accuracy can be achieved by a single iteration, representation of the Davenport gyro calibration scheme in a recursive form allows one to discard each gyro measurement immediately after it was used to propagate the attitude and state transition matrix. Another advantage of the new approach is that it utilizes the same expression for the error sensitivity matrix as that used by the Kalman filter. As a result the suggested modification of the Davenport algorithm made it possible to reuse software modules implemented in the Kalman filter estimator, where both attitude errors and gyro calibration parameters are included in the state vector. The new approach has been implemented in the ground calibration utilities used to support the Tropical Rainfall Measuring Mission (TRMM). The paper analyzes some preliminary results of gyro calibration performed by the TRMM ground attitude support team. It is demonstrated that an effect of the second iteration on estimated values of calibration parameters is negligibly small, and therefore there is no need to store processed gyro data. This opens a promising opportunity for onboard implementation of the suggested recursive procedure by combining, it with the Kalman filter used to obtain necessary attitude solutions at the beginning and end of each maneuver.

Natanson, G. A.↗

Coupling strategies for high-speed aeroheating problems.

A common purpose for performing an aerodynamic analysis is to calculate the resulting loads on a solid body immersed in the flow. Pressure or heat loads are often of interest for characterizing the structural integrity or thermal survivability of the structure. This document describes two algorithms for tightly coupling the mass, momentum and energy conservation equations for a compressible fluid and the energy conservation equation for heat transfer through a solid. We categorize both approaches as monolithically coupled, where the conservation equations for the fluid and the solid are assembled into a single residual vector. Newton's method is then used to solve the resulting nonlinear system of equations. These approaches are in contrast to other popular coupling schemes such as staggered coupling methods were each discipline is solved individually and loads are passed between as boundary conditions, and demonstrates the viability of the monolithic approach for aeroheating problems.

99 GENERAL AND MISCELLANEOUS↗

SU-E-T-422: Fast Analytical Beamlet Optimization for Volumetric Intensity-Modulated Arc Therapy

Purpose: To implement a fast optimization algorithm on CPU/GPU heterogeneous computing platform and to obtain an optimal fluence for a given target dose distribution from the pre-calculated beamlets in an analytical approach. Methods: The 2D target dose distribution was modeled as an n-dimensional vector and estimated by a linear combination of independent basis vectors. The basis set was composed of the pre-calculated beamlet dose distributions at every 6 degrees of gantry angle and the cost function was set as the magnitude square of the vector difference between the target and the estimated dose distribution. The optimal weighting of the basis, which corresponds to the optimal fluence, was obtained analytically by the least square method. Those basis vectors with a positive weighting were selected for entering into the next level of optimization. Totally, 7 levels of optimization were implemented in the study.Ten head-and-neck and ten prostate carcinoma cases were selected for the study and mapped to a round water phantom with a diameter of 20cm. The Matlab computation was performed in a heterogeneous programming environment with Intel i7 CPU and NVIDIA Geforce 840M GPU. Results: In all selected cases, the estimated dose distribution was in a good agreement with the given target dose distribution and their correlation coefficients were found to be in the range of 0.9992 to 0.9997. Their root-mean-square error was monotonically decreasing and converging after 7 cycles of optimization. The computation took only about 10 seconds and the optimal fluence maps at each gantry angle throughout an arc were quickly obtained. Conclusion: An analytical approach is derived for finding the optimal fluence for a given target dose distribution and a fast optimization algorithm implemented on the CPU/GPU heterogeneous computing environment greatly reduces the optimization time.

60 APPLIED LIFE SCIENCES↗

CM5, a Pre-Swarm Comprehensive Geomagnetic Field Model Derived from Over 12 Yr of CHAMP, Orsted, SAC-C and Observatory Data

A comprehensive magnetic field model named CM5 has been derived from CHAMP, Ørsted and SAC-C satellite and observatory hourly-means data from 2000 August to 2013 January using the Swarm Level-2 Comprehensive Inversion (CI) algorithm. Swarm is a recently launched constellation of three satellites to map the Earth's magnetic field. The CI technique includes several interesting features such as the bias mitigation scheme known as Selective Infinite Variance Weighting (SIVW), a new treatment for attitude error in satellite vector measurements, and the inclusion of 3-D conductivity for ionospheric induction. SIVW has allowed for a much improved lithospheric field recovery over CM4 by exploiting CHAMP along-track difference data yielding resolution levels up to spherical harmonic degree 107, and has allowed for the successful extraction of the oceanic M2 tidal magnetic field from quiet, nightside data. The 3-D induction now captures anomalous Solar-quiet features in coastal observatory daily records. CM5 provides a satisfactory, continuous description of the major magnetic fields in the near-Earth region over this time span, and its lithospheric, ionospheric and oceanic M2 tidal constituents may be used as validation tools for future Swarm Level-2 products coming from the CI algorithm and other dedicated product algorithms.

modelling and interpretation↗

A Test Generation Framework for Distributed Fault-Tolerant Algorithms

Heavyweight formal methods such as theorem proving have been successfully applied to the analysis of safety critical fault-tolerant systems. Typically, the models and proofs performed during such analysis do not inform the testing process of actual implementations. We propose a framework for generating test vectors from specifications written in the Prototype Verification System (PVS). The methodology uses a translator to produce a Java prototype from a PVS specification. Symbolic (Java) PathFinder is then employed to generate a collection of test cases. A small example is employed to illustrate how the framework can be used in practice.

Goodloe, Alwyn↗

Implementation of High-Order Multireference Coupled-Cluster Methods on Intel Many Integrated Core Architecture

Here we discuss the implementation of multireference coupled-cluster formalism with singles, doubles, and noniterative triples (MRCCSD(T)), which is capable of taking advantage of the processing power of the Intel Xeon Phi coprocessor. We discuss the integration of two levels of parallelism underlying the MRCCSD(T) implementation with computational kernels designed to offload the computationally intensive parts of the MRCCSD(T) formalism to Intel Xeon Phi coprocessors. Special attention is given to the enhancement of the parallel performance by task reordering that has improved load balancing in the noniterative part of the MRCCSD(T) calculations. We also discuss aspects regarding efficient optimization and vectorization strategies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast Parallel Tensor Times Same Vector for Hypergraphs

Hypergraphs are a popular paradigm to rep- resent complex real-world networks exhibiting multi-way relationships of varying sizes. Mining centrality in hyper- graphs via symmetric adjacency tensors has only recently become computationally feasible for large and complex datasets. To enable scalable computation of these and related hypergraph analytics, here we focus on the Sparse Symmetric Tensor Times Same Vector (S3TTVC) oper- ation. We introduce the Compound Compressed Sparse Symmetric (CCSS) format, an extension of the compact CSS format for hypergraphs of varying hyperedge sizes and present a shared-memory parallel algorithm to compute S3TTVC. We experimentally show S3TTVC computation using the CCSS format achieves better performance than the naive baseline, and is subsequently more performant for hypergraph H-eigenvector centrality.

Shivakumar, Shruti↗