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,603 records · Page 89

A decoupled recursive approach for constrained flexible multibody system dynamics

A variational-vector calculus approach is employed to derive a recursive formulation for dynamic analysis of flexible multibody systems. Kinematic relationships for adjacent flexible bodies are derived in a companion paper, using a state vector notation that represents translational and rotational components simultaneously. Cartesian generalized coordinates are assigned for all body and joint reference frames, to explicitly formulate deformation kinematics under small deformation kinematics and an efficient flexible dynamics recursive algorithm is developed. Dynamic analysis of a closed loop robot is performed to illustrate efficiency of the algorithm.

Lai, Hao-Jan↗

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↗

Using machine learning to predict the correlation of spectra using SDSS magnitudes as an improvement to the Locus Algorithm

The Locus Algorithm is a new technique to improve the quality of differential photometry by optimising the choices of reference stars. At the heart of this algorithm is a routine to assess how good each potential reference star is by comparing its SDSS magnitude values to those of the target star. In this way, the difference in wavelength-dependent effects of the Earth’s atmospheric scattering between target and reference can be minimised. This paper sets out a new way to estimate the quality of each reference star using machine learning. A random subset of stars from SDSS with spectra was chosen. For each one, a suitable reference star, also with a spectrum, was chosen. The correlation between the two spectra in the SDSS r band (between 550 nm and 700 nm) was taken to be the gold-standard measure of how well they match up for differential photometry. The five SDSS magnitude values for each of these stars were used as predictors. A number of supervised machine learning models were constructed on a training set of the stars and were each evaluated on a testing set. The model using Support Vector Regression had the best performance of these models. It was then tested on a final, hold-out, validation set of stars to get an unbiased measure of its performance. With an R 2 of 0.62, the SVR model presents enhanced performance for the Locus Algorithm technique.

79 ASTRONOMY AND ASTROPHYSICS↗

Pseudo-automatic Determination of Coronal Mass Ejections’ Kinematics in 3D

Coronal mass ejection (CME) events are among the main drivers of geomagnetic disturbances, and hence play a central role in the Sun–Earth system. Their monitoring and, in particular, the determination of their speed and direction of propagation are key issues for the forecasting of space weather near to Earth. We have implemented a method to track CME events in three dimensions by combining triangulation and tie-pointing analysis with a supervised computer vision algorithm. This novel approach does not rely on any geometric constraint, and eliminates the need for visual identification of the CME boundaries. We applied our method to 17 CME events observed simultaneously by the twin Solar Terrestrial Relations Observatory ( STEREO ) COR2 coronagraph imagers from 2008 December to 2011 November in order to obtain their 3D kinematical characterization (i.e., the velocity vector) along with their morphological properties. About ten of these events have already been analyzed using other methodologies. In these cases, we carried out a thorough comparison with our results and found that, in spite of the different nature and spatial coverage range of the other methods with respect to CORSET3D, the majority of the results agree. We found, however, that three events exhibited discrepancies in the magnitude of the velocity vector, four in the longitudinal direction of propagation, and in only one case was there a discrepancy in latitude. The discrepancies appeared in those cases where quasi-simultaneous, quasi-co-located events were observed in the coronagraphs’ fields of view.

79 ASTRONOMY AND ASTROPHYSICS↗

Performance Comparison of Machine Learning Models for Ultrasonic Nondestructive Evaluation of Alkali-Silica Reaction in Concrete

Alkali-silica reaction (ASR) causes concrete degradation, leading to cracking, rebar corrosion, and reduced structural integrity, which raises safety concerns. Ultrasonic nondestructive evaluation (NDE) effectively assesses concrete properties and monitors ASR progression. However, its deployment and analysis require specialized expertise and subjective interpretation. As computational power increases, artificial intelligence (AI) and machine learning (ML) algorithms are increasingly being used to automate NDE data analysis across various industries for AI-assisted automation. Regulatory agencies are adapting to this technological shift, prompting a need to evaluate current ML technologies’ capabilities and limitations in assessing concrete material properties and damage. This report presents a comparative analysis of four ML regression models for predicting concrete material damage induced by ASR expansion using long-term ultrasonic data monitoring. The models investigated include linear regression (LR), support vector regression (SVR), shallow neural networks (NN), and deep neural networks (DNN). LR, SVR, and shallow NN models use features extracted from ultrasonic signals, whereas the DNN model processes time-domain ultrasonic signals and frequency spectra directly. The study systematically compared the models’ performance from various perspectives, including model input, prediction performance, and generalization ability. The findings indicate significant variability in model performance, with some ML algorithms achieving very high or very low prediction accuracy depending on the preprocessing and feature engineering (extraction and selection) applied. Key insights include the observation that shallow ML models (LR, SVR, and shallow NNs) require meticulous preprocessing and feature extraction to achieve high accuracy. In contrast, the DNN model, although it bypasses the need for feature engineering, necessitates extensive preprocessing to mitigate noise and computational demands. The SVR model emerged as the top performer among the shallow models, and the DNN model exhibited superior performance on specific datasets but struggled with generalization across specimens from different batches. Additionally, the SVR model is sensitive to temperature variations, whereas the DNN model is robust in this regard. Using recurrent neural networks is recommended for future ASR expansion prediction studies. Recurrent neural networks’ inherent ability to capture temporal dependencies and long-term patterns makes them well suited for analyzing sequential ultrasonic monitoring data. Overall, the results and conclusions of this study could provide insights into the capabilities and effectiveness of ML when applied to ultrasonic NDE data and help identify best practices for using ML for ultrasonic NDE of concrete material properties.

36 MATERIALS SCIENCE↗

Three-dimensional gravity modeling and focusing inversion using rectangular meshes.

Rectangular grid cells are commonly used for the geophysical modeling of gravity anomalies, owing to their flexibility in constructing complex models. The straightforward handling of cubic cells in gravity inversion algorithms allows for a flexible imposition of model regularization constraints, which are generally essential in the inversion of static potential field data. The first part of this paper provides a review of commonly used expressions for calculating the gravity of a right polygonal prism, both for gravity and gradiometry, where the formulas of Plouff and Forsberg are adapted. The formulas can be cast into general forms practical for implementation. In the second part, a weighting scheme for resolution enhancement at depth is presented. Modelling the earth using highly digitized meshes, depth weighting schemes are typically applied to the model objective functional, subject to minimizing the data misfit. The scheme proposed here involves a non-linear conjugate gradient inversion scheme with a weighting function applied to the non-linear conjugate gradient scheme's gradient vector of the objective functional. The low depth resolution due to the quick decay of the gravity kernel functions is counteracted by suppressing the search directions in the parameter space that would lead to near-surface concentrations of gravity anomalies. Further, a density parameter transformation function enabling the imposition of lower and upper bounding constraints is employed. Using synthetic data from models of varying complexity and a field data set, it is demonstrated that, given an adequate depth weighting function, the gravity inversion in the transform space can recover geologically meaningful models requiring a minimum of prior information and user interaction.

54 ENVIRONMENTAL SCIENCES↗

SU-D-18A-01: Tumor Motion Tracking with a Regional Deformable Registration Model for Four Dimensional Radiation Treatment of Lung Cancer

Purpose: To develop a tumor motion model from four-dimensional computed tomography (4DCT) of thoracic patients and demonstrate its impact on 4D radiation therapy simulation. Methods: A regional deformable image registration algorithm was introduced to extract tumor motion out of patient's breathing cycle. The gross target volume (GTV) was manually delineated on a selected phase of 4DCT and a subregion with 10mm margin supplemented to the GTV was created on the Eclipse treatment planning system (Varian Medical Systems, Palo Alto, CA). Together with 4DCT the structures were exported into an inhouse research platform. A free form B-Spline deformable registration was carried out to map the subregion to other respiratory phases. The displacement vector fields were employed to propagate GTV contours with which the center of mass (CoM) of the GTV was computed for each breathing phase of 4DCT. The resultant GTV motion and its volumetric shape are utilized to facilitate 4D treatment planning. Five lung cancer patients undergoing stereotactic body radiation therapy were enrolled and their 4DCT sets were included in the study. Results: Application of the algorithm to five thoracic patients indicates that clinically satisfactory outcomes were achievable with a spatial accuracy better than 2mm for GTV contour propagation between adjacent phases, and 3mm between opposite phases. The GTV CoM was found to be in the range of 2.0mm through 2.5cm, depending upon the tumor location. Compared to the traditional whole image based registration, the computation of the regional model was found to be an order of magnitude more efficient. Conclusion: A regional deformable registration model was implemented to extract tumor motion. It will have widespread application in 4D radiation treatment planning in the future to maximally utilize the available spatial-tempo information.

60 APPLIED LIFE SCIENCES↗

ZMPY3D: accelerating protein structure volume analysis through vectorized 3D Zernike moments and Python-based GPU integration

Abstract Motivation Volumetric 3D object analyses are being applied in research fields such as structural bioinformatics, biophysics, and structural biology, with potential integration of artificial intelligence/machine learning (AI/ML) techniques. One such method, 3D Zernike moments, has proven valuable in analyzing protein structures (e.g., protein fold classification, protein–protein interaction analysis, and molecular dynamics simulations). Their compactness and efficiency make them amenable to large-scale analyses. Established methods for deriving 3D Zernike moments, however, can be inefficient, particularly when higher order terms are required, hindering broader applications. As the volume of experimental and computationally-predicted protein structure information continues to increase, structural biology has become a “big data” science requiring more efficient analysis tools. Results This application note presents a Python-based software package, ZMPY3D, to accelerate computation of 3D Zernike moments by vectorizing the mathematical formulae and using graphical processing units (GPUs). The package offers popular GPU-supported libraries such as CuPy and TensorFlow together with NumPy implementations, aiming to improve computational efficiency, adaptability, and flexibility in future algorithm development. The ZMPY3D package can be installed via PyPI, and the source code is available from GitHub. Volumetric-based protein 3D structural similarity scores and transform matrix of superposition functionalities have both been implemented, creating a powerful computational tool that will allow the research community to amalgamate 3D Zernike moments with existing AI/ML tools, to advance research and education in protein structure bioinformatics. Availability and implementation ZMPY3D, implemented in Python, is available on GitHub (https://github.com/tawssie/ZMPY3D) and PyPI, released under the GPL License.

Lai, Jhih-Siang (ORCID:0000000156775890)↗

Diffraction pattern simulation of cellulose fibrils using distributed and quantized pair distances

Intensity simulation of X-ray scattering from large twisted cellulose molecular fibrils is important in understanding the impact of chemical or physical treatments on structural properties such as twisting or coiling. This paper describes a highly efficient method for the simulation of X-ray diffraction patterns from complex fibrils using atom-type-specific pair-distance quantization. Pair distances are sorted into arrays which are labelled by atom type. Histograms of pair distances in each array are computed and binned and the resulting population distributions are used to represent the whole pair-distance data set. These quantized pair-distance arrays are used with a modified and vectorized Debye formula to simulate diffraction patterns. This approach utilizes fewer pair distances in each iteration, and atomic scattering factors are moved outside the iteration since the arrays are labelled by atom type. As a result, this algorithm significantly reduces the computation time while maintaining the accuracy of diffraction pattern simulation, making possible the simulation of diffraction patterns from large twisted fibrils in a relatively short period of time, as is required for model testing and refinement.

09 BIOMASS FUELS↗

Gaussian Process Regression for Aggregate Baseline Load Forecasting

Demand response (DR) is one of the most effective ways to maintain the reliability and improve the flexibility of power systems. Accurate forecasts of baseline loads are essential for DR programs. In the era of big data, machine learning-based approaches present a unique opportunity for baseline load forecasting. Thus, this paper presents a machine learning-based approach using a relatively less explored algorithm, Gaussian process regression (GPR), to forecast aggregate baseline loads. As such, a dataset was generated using a set of EnergyPlus simulations. Using the generated dataset, a GPR-based forecasting model was developed. In addition, support vector regression (SVR)-, artificial neural network (ANN)-, and averaging-based models were developed as baseline models for comparison. These models were compared in terms of accuracy, simplicity, and integrity. The prediction performance of the models showed that the GPR-based model is more accurate and reliable than the others. Such high performance shows the potential of the GPR in baseline load forecasting. GPR, therefore, can be used for DR applications.

Amasyali, Kadir↗

CLUSTERING-BASED FEATURE LEARNING ON VARIABLE STARS

The success of automatic classification of variable stars depends strongly on the lightcurve representation. Usually, lightcurves are represented as a vector of many descriptors designed by astronomers called features. These descriptors are expensive in terms of computing, require substantial research effort to develop, and do not guarantee a good classification. Today, lightcurve representation is not entirely automatic; algorithms must be designed and manually tuned up for every survey. The amounts of data that will be generated in the future mean astronomers must develop scalable and automated analysis pipelines. In this work we present a feature learning algorithm designed for variable objects. Our method works by extracting a large number of lightcurve subsequences from a given set, which are then clustered to find common local patterns in the time series. Representatives of these common patterns are then used to transform lightcurves of a labeled set into a new representation that can be used to train a classifier. The proposed algorithm learns the features from both labeled and unlabeled lightcurves, overcoming the bias using only labeled data. We test our method on data sets from the Massive Compact Halo Object survey and the Optical Gravitational Lensing Experiment; the results show that our classification performance is as good as and in some cases better than the performance achieved using traditional statistical features, while the computational cost is significantly lower. With these promising results, we believe that our method constitutes a significant step toward the automation of the lightcurve classification pipeline.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗