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 883 records · Page 49

ICASE semiannual report, April 1 - September 30, 1989

The Institute conducts unclassified basic research in applied mathematics, numerical analysis, and computer science in order to extend and improve problem-solving capabilities in science and engineering, particularly in aeronautics and space. The major categories of the current Institute for Computer Applications in Science and Engineering (ICASE) research program are: (1) numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; (2) control and parameter identification problems, with emphasis on effective numerical methods; (3) computational problems in engineering and the physical sciences, particularly fluid dynamics, acoustics, and structural analysis; and (4) computer systems and software, especially vector and parallel computers. ICASE reports are considered to be primarily preprints of manuscripts that have been submitted to appropriate research journals or that are to appear in conference proceedings.

Source record↗

Design and Implementation of the PALM-3000 Real-Time Control System

This paper reflects, from a computational perspective, on the experience gathered in designing and implementing realtime control of the PALM-3000 adaptive optics system currently in operation at the Palomar Observatory. We review the algorithms that serve as functional requirements driving the architecture developed, and describe key design issues and solutions that contributed to the system's low compute-latency. Additionally, we describe an implementation of dense matrix-vector-multiplication for wavefront reconstruction that exceeds 95% of the maximum sustained achievable bandwidth on NVIDIA Geforce 8800GTX GPU.

PALM-3000↗

Analysis and application of minimum variance discrete time system identification

An on-line minimum variance parameter identifier is developed which embodies both accuracy and computational efficiency. The formulation results in a linear estimation problem with both additive and multiplicative noise. The resulting filter which utilizes both the covariance of the parameter vector itself and the covariance of the error in identification is proven to be mean square convergent and mean square consistent. The MV parameter identification scheme is then used to construct a stable state and parameter estimation algorithm.

Kaufman, H.↗

An iterative algorithm for objective wind field analysis

Three different algorithms for objective wind field analysis were tested on the same set of initial conditions: Dickerson-Sasaki's 'strong constraint' algorithm, a fixed-vorticity algorithm, and a newly proposed fixed-station-velocity algorithm. The three methods are compared with respect to the degree of minimization of wind divergence and the accuracy of wind data at a measured station. The first two techniques, though they reduce wind divergence, produce wind vectors substantially different from the observed values. The proposed iterative scheme is similar to Endlich's (1967) procedure for treating a macroscale wind field, and minimizes divergence while retaining the observed wind vectors.

Liu, C. Y.↗

Analysis and application of minimum variance discrete time system identification

An on-line minimum variance parameter identifier is developed which embodies both accuracy and computational efficiency. The formulation results in a linear estimation problem with both additive and multiplicative noise. The resulting filter which utilizes both the covariance of the parameter vector itself and the covariance of the error in identification is proven to be mean square convergent and mean square consistent. The MV parameter identification scheme is then used to construct a stable state and parameter estimation algorithm.

Kotob, S.↗

Adaptation of a program for nonlinear finite element analysis to the CDC STAR 100 computer

The conversion of a nonlinear finite element program to the CDC STAR 100 pipeline computer is discussed. The program called DYCAST was developed for the crash simulation of structures. Initial results with the STAR 100 computer indicated that significant gains in computation time are possible for operations on gloval arrays. However, for element level computations that do not lend themselves easily to long vector processing, the STAR 100 was slower than comparable scalar computers. On this basis it is concluded that in order for pipeline computers to impact the economic feasibility of large nonlinear analyses it is absolutely essential that algorithms be devised to improve the efficiency of element level computations.

Pifko, A. B.↗

A study on the sensitivity and simultaneous adjustment of a hoop-column antenna surface

The results of a recent surface adjustment of the 15-meter diameter hoop-column antenna are presented. A least-squares differential algorithm is used to adjust the surface shape as close as possible to a perfect parabola. Since the desired perfect parabola is not uniquely known a priori, parameters of the perfect parabola are included in the design vector along with the cable length changes. As an extension to an earlier study, lateral sensitivity is included in the least-squares adjustment procedure. In addition, the effect of cable length uncertainties on the surface RMS error is considered and an error bound is derived. The results in this study indicate an improvement over earlier studies. The sensitivity analysis provided a quantitative measure of the needed accuracy of the cable adjustments in the laboratory. Recommendations are included to further enhance shape adjustment.

Lim, Kyong Been↗

Parallel Simulation of Unsteady Turbulent Flames

Time-accurate simulation of turbulent flames in high Reynolds number flows is a challenging task since both fluid dynamics and combustion must be modeled accurately. To numerically simulate this phenomenon, very large computer resources (both time and memory) are required. Although current vector supercomputers are capable of providing adequate resources for simulations of this nature, the high cost and their limited availability, makes practical use of such machines less than satisfactory. At the same time, the explicit time integration algorithms used in unsteady flow simulations often possess a very high degree of parallelism, making them very amenable to efficient implementation on large-scale parallel computers. Under these circumstances, distributed memory parallel computers offer an excellent near-term solution for greatly increased computational speed and memory, at a cost that may render the unsteady simulations of the type discussed above more feasible and affordable.This paper discusses the study of unsteady turbulent flames using a simulation algorithm that is capable of retaining high parallel efficiency on distributed memory parallel architectures. Numerical studies are carried out using large-eddy simulation (LES). In LES, the scales larger than the grid are computed using a time- and space-accurate scheme, while the unresolved small scales are modeled using eddy viscosity based subgrid models. This is acceptable for the moment/energy closure since the small scales primarily provide a dissipative mechanism for the energy transferred from the large scales. However, for combustion to occur, the species must first undergo mixing at the small scales and then come into molecular contact. Therefore, global models cannot be used. Recently, a new model for turbulent combustion was developed, in which the combustion is modeled, within the subgrid (small-scales) using a methodology that simulates the mixing and the molecular transport and the chemical kinetics within each LES grid cell. Finite-rate kinetics can be included without any closure and this approach actually provides a means to predict the turbulent rates and the turbulent flame speed. The subgrid combustion model requires resolution of the local time scales associated with small-scale mixing, molecular diffusion and chemical kinetics and, therefore, within each grid cell, a significant amount of computations must be carried out before the large-scale (LES resolved) effects are incorporated. Therefore, this approach is uniquely suited for parallel processing and has been implemented on various systems such as: Intel Paragon, IBM SP-2, Cray T3D and SGI Power Challenge (PC) using the system independent Message Passing Interface (MPI) compiler. In this paper, timing data on these machines is reported along with some characteristic results.

Menon, Suresh↗

Lessons Learned from Assimilating Altimeter Data into a Coupled General Circulation Model with the GMAO Augmented Ensemble Kalman Filter

Satellite altimetry measurements have provided global, evenly distributed observations of the ocean surface since 1993. However, the difficulties introduced by the presence of model biases and the requirement that data assimilation systems extrapolate the sea surface height (SSH) information to the subsurface in order to estimate the temperature, salinity and currents make it difficult to optimally exploit these measurements. This talk investigates the potential of the altimetry data assimilation once the biases are accounted for with an ad hoc bias estimation scheme. Either steady-state or state-dependent multivariate background-error covariances from an ensemble of model integrations are used to address the problem of extrapolating the information to the sub-surface. The GMAO ocean data assimilation system applied to an ensemble of coupled model instances using the GEOS-5 AGCM coupled to MOM4 is used in the investigation. To model the background error covariances, the system relies on a hybrid ensemble approach in which a small number of dynamically evolved model trajectories is augmented on the one hand with past instances of the state vector along each trajectory and, on the other, with a steady state ensemble of error estimates from a time series of short-term model forecasts. A state-dependent adaptive error-covariance localization and inflation algorithm controls how the SSH information is extrapolated to the sub-surface. A two-step predictor corrector approach is used to assimilate future information. Independent (not-assimilated) temperature and salinity observations from Argo floats are used to validate the assimilation. A two-step projection method in which the system first calculates a SSH increment and then projects this increment vertically onto the temperature, salt and current fields is found to be most effective in reconstructing the sub-surface information. The performance of the system in reconstructing the sub-surface fields is particularly impressive for temperature, but not as satisfactory for salt.

Keppenne, Christian↗

CFD Extraction Tool for TecPlot From DPLR Solutions

This invention is a TecPlot macro of a computer program in the TecPlot programming language that processes data from DPLR solutions in TecPlot format. DPLR (Data-Parallel Line Relaxation) is a NASA computational fluid dynamics (CFD) code, and TecPlot is a commercial CFD post-processing tool. The Tec- Plot data is in SI units (same as DPLR output). The invention converts the SI units into British units. The macro modifies the TecPlot data with unit conversions, and adds some extra calculations. After unit conversions, the macro cuts a slice, and adds vectors on the current plot for output format. The macro can also process surface solutions. Existing solutions use manual conversion and superposition. The conversion is complicated because it must be applied to a range of inter-related scalars and vectors to describe a 2D or 3D flow field. It processes the CFD solution to create superposition/comparison of scalars and vectors. The existing manual solution is cumbersome, open to errors, slow, and cannot be inserted into an automated process. This invention is quick and easy to use, and can be inserted into an automated data-processing algorithm.

Norman, David↗

Performance and Portability of a Linear Solver Across Emerging Architectures

A linear solver algorithm used by a large-scale unstructured-grid computational fluid dynamics application is examined for a broad range of familiar and emerging architectures. Efficient implementation of a linear solver is challenging on recent CPUs offering vector architectures. Vector loads and stores are essential to effectively utilize available memory bandwidth on CPUs, and maintaining performance across different CPUs can be difficult in the face of varying vector lengths offered by each. A similar challenge occurs on GPU architectures, where it is essential to have coalesced memory accesses to utilize memory bandwidth effectively. In this work, we demonstrate that restructuring a computation, and possibly data layout, with regard to architecture is essential to achieve optimal performance by establishing a performance benchmark for each target architecture in a low level language such as vector intrinsics or CUDA. In doing so, we demonstrate how a linear solver kernel can be mapped to Intel® Xeon™ and Xeon Phi™, Marvell® ThunderX2®, NEC® SX-Aurora™ TSUBASA Vector Engine, and NVIDIA® and AMD® GPUs. We further demonstrate that the required code restructuring can be achieved in higher level programming environments such as OpenACC, OCCA, and Intel® OneAPI™/SYCL, and that each generally results in optimal performance on the target architecture. Relative performance metrics for all implementations are shown, and subjective ratings for ease of implementation and optimization are suggested.

Programming models↗

Numerical algorithms for finite element computations on concurrent processors

The work of several graduate students which relate to the NASA grant is briefly summarized. One student has worked on a detailed analysis of the so-called ijk forms of Gaussian elemination and Cholesky factorization on concurrent processors. Another student has worked on the vectorization of the incomplete Cholesky conjugate method on the CYBER 205. Two more students implemented various versions of Gaussian elimination and Cholesky factorization on the FLEX/32.

Ortega, J. M.↗

Design and Calibration of Autonomous Coherent Doppler Lidar for Space Missions

Developed a new algorithm for the simulation of three dimensional homogeneous turbulent velocity fields. For typical atmospheric conditions it is impossible to produce a simulated velocity field that simultaneously satisfy a given spatial correlation and the corresponding spatial spectrum because of spectral aliasing. The new algorithms produce a turbulent velocity field which has accurate spatial correlations which is required for performance predictions from space-based systems. Developed a new algorithm for extracting the spatial statistics of the atmospheric velocity field using coherent Doppler lidar. The performance of the algorithm was compared with past methods and the new algorithm produces useful results for space-based data, which was not possible before. Developed new methods for verification of the errors in ground-based and space-based Doppler lidar wind measurements. These new methods do not require independent in situ data. This is an important issue for the verification of space-based Doppler lidar measurements of the global wind field. The performance of the new algorithm was compared with past results for both space-based and ground-based operation. The new algorithm has the best performance and is the only algorithm that performed satisfactory for spacebased operation. The performance of coherent Doppler lidar for a space missions with various scanning geometries was determined using computer simulation which contained the effects of random instrumental velocity errors, wind shear, wind variability along the range-gate and from shot-to-shot, and random variations in atmospheric aerosol backscatter over the measurement volume. The bias in the velocity estimates was small and the accuracy in the is typically less than 0.5 m/s for high signal conditions. For a large number of shot per velocity estimate, the threshold signal level for acceptable estimates is proportional to the number of shots to the minus one half power. This agrees with previous results determined for ground-based measurements. The use of multi-element optical detectors for autonomous operation of coherent Doppler lidar was shown to be a very promising technique. Optimal detector geometries were determined by computer simulation of performance: for ground-based testing with a fixed calibration target and for space-based operation using the random surface returns. The effects of refractive turbulence on ground-based calibration of coherent Doppler lidar was determined by computer simulations and compared with theoretical predictions. New techniques were required to correctly predict performance for the focused beam geometry commonly used for verification of space-based operation. An improved velocity estimator was evaluated for space-based applications were signal shot measurements are used to produce vector wind measurements. This permits more accurate measurements when the signal level is not known a priori or not available from multiple shot measurements. The average Doppler lidar signal spectrum including the effects of velocity turbulence was derived and calculated. This permits new estimation algorithms for turbulence based on spectral estimates. In situ atmospheric measurements were conducted and analyzed using an instrumented kite-platform. This work helps provide the required in situ data for verification of Doppler lidar velocity statistics.

Frehlich, Rod G.↗

Ground-Support Algorithms for Simulation, Processing, and Calibration of Barnes Static Earth Sensor Measurements: Applications to Tropical Rainfall Measuring Mission Observatory

New algorithms are described covering the simulation, processing, and calibration of penetration angles of the Barnes static Earth sensor assembly (SESA) as implemented in the Goddard Space Flight Center Flight Dynamics Division ground support system for the Tropical Rainfall Measuring Mission (TRMM) Observatory. The new treatment involves a detailed analysis of the measurements by individual quadrants. It is shown that, to a good approximation, individual quadrant misalignments can be treated simply as penetration angle biases. Simple formulas suitable for real-time applications are introduced for computing quadrant-dependent effects. The simulator generates penetration angles by solving a quadratic equation with coefficients uniquely determined by the spacecraft's position and the quadrant's orientation in GeoCentric Inertial (GCI) coordinates. Measurement processing for attitude determination is based on linearized equations obtained by expanding the coefficients of the aforementioned quadratic equation as a Taylor series in both the Earth oblateness coefficient (alpha approx. 1/150) and the angle between the pointing axis and the geodetic nadir vector. A simple formula relating a measured value of the penetration angle to the deviation of the Earth-pointed axis from the geodetic nadir vector is derived. It is shown that even near the very edge of the quadrant's Field Of View (FOV), attitude errors resulting from quadratic effects are a few hundredths of a degree, which is small compared to the attitude determination accuracy requirement (0.18 degree, 3 sigma) of TRMM. Calibration of SESA measurements is complicated by a first-order filtering used in the TRMM onboard algorithm to compute penetration angles from raw voltages. A simple calibration scheme is introduced where these complications are avoided by treating penetration angles as the primary raw measurements, which are adjusted using biases and scale factors. In addition to three misalignment parameters, the calibration state vector contains only two average penetration angle biases (one per each pair of opposite quadrants) since, because of the very narrow sensor FOV (+/- 2.6 degrees), differences between biases of the penetration angles measured by opposite quadrants cannot be distinguished from roll and pitch sensor misalignments. After calibration, the estimated misalignments and average penetration angle biases are converted to the four penetration angle biases and to the yaw misalignment angle. The resultant biases and the estimated scale factors are finally used to update the coefficients necessary for onboard computations of penetration angles from measured voltages.

Natanson, G. A.↗

Application of high-performance computing to numerical simulation of human movement

We have examined the feasibility of using massively-parallel and vector-processing supercomputers to solve large-scale optimization problems for human movement. Specifically, we compared the computational expense of determining the optimal controls for the single support phase of gait using a conventional serial machine (SGI Iris 4D25), a MIMD parallel machine (Intel iPSC/860), and a parallel-vector-processing machine (Cray Y-MP 8/864). With the human body modeled as a 14 degree-of-freedom linkage actuated by 46 musculotendinous units, computation of the optimal controls for gait could take up to 3 months of CPU time on the Iris. Both the Cray and the Intel are able to reduce this time to practical levels. The optimal solution for gait can be found with about 77 hours of CPU on the Cray and with about 88 hours of CPU on the Intel. Although the overall speeds of the Cray and the Intel were found to be similar, the unique capabilities of each machine are better suited to different portions of the computational algorithm used. The Intel was best suited to computing the derivatives of the performance criterion and the constraints whereas the Cray was best suited to parameter optimization of the controls. These results suggest that the ideal computer architecture for solving very large-scale optimal control problems is a hybrid system in which a vector-processing machine is integrated into the communication network of a MIMD parallel machine.

NASA Discipline Musculoskeletal↗

The importance of nonlinearity on the higher harmonic control of helicopter vibration

The effect of nonlinearity on the higher harmonic control (HHC) of helicopter vibration is investigated using a nonlinear aeroelastic simulation. A nonlinear solution is proposed which relates the HHC inputs to vibration outputs on the basis of a Volterra functional series. The Volterra series solution is shown to reduce to a vector polynomial equation relating HHC inputs to vibration outputs at any harmonic frequency. The nonlinear transfer relationship is identified from a nonlinear vibration analysis computer program, and the identification model is examined in detail. Improvements to current HHC algorithms are presented, and several Kalman filter divergence problems are quantified.

Molusis, J. A.↗

Automatic calibration of space based manipulators and mechanisms

Four tasks in manipulator kinematic calibration are summarized. Calibration of a seven degree of freedom manipulator was simulated. A calibration model is presented that can be applied on a closed-loop robot. It is an expansion of open-loop kinematic calibration algorithms subject to constraints. A closed-loop robot with a five-bar linkage transmission was tested. Results show that the algorithm converges within a few iterations. The concept of model differences is formalized. Differences are categorized as structural and numerical, with emphasis on the structural. The work demonstrates that geometric manipulators can be visualized as points in a vector space with the dimension of the space depending solely on the number and type of manipulator joint. Visualizing parameters in a kinematic model as the coordinates locating the manipulator in vector space enables a standard evaluation of the models. Key results include a derivation of the maximum number of parameters necessary for models, a formal discussion on the inclusion of extra parameters, and a method to predetermine a minimum model structure for a kinematic manipulator. A technique is presented that enables single point sensors to gather sufficient information to complete a calibration.

Everett, Louis J.↗

Principled halftoning based on human vision models

When models of human vision adequately measure the relative quality of candidate halftonings of an image, the problem of halftoning the image becomes equivalent to the search problem of finding a halftone that optimizes the quality metric. Because of the vast number of possible halftones, and the complexity of image quality measures, this principled approach has usually been put aside in favor of fast algorithms that seem to perform well. We find that the principled approach can lead to a range of useful halftoning algorithms, as we trade off speed for quality by varying the complexity of the quality measure and the thoroughness of the search. High quality halftones can be obtained reasonably quickly, for example, by using as a measure the vector length of the error image filtered by a contrast sensitivity function, and, as the search procedure, the sequential adjustment of individual pixels to improve the quality measure. If computational resources permit, simulated annealing can find nearly optimal solutions.

Mulligan, Jeffrey B.↗