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 271 records · Page 15

GloVe C++ v. 1.0

This code implements the GloVe algorithm for learning word vectors from a text corpus. It uses a modern C++ approach. This algorithm is described in the open literature in the referenced paper by Pennington, Jeffrey, Richard Socher, and Christopher D. Manning.

Cox, Jonathan A.↗

Decentralized Microgrid Protection Through Relative Fault Direction Classification: Preprint

Protection in inverter-based resources (IBRs) dominated microgrids generally face significant challenges due to the low fault current and inconsistent fault behaviors from IBRs. Recently, machine learning-based approaches have attracted considerable attention to address these challenges. This paper introduces a novel decentralized protection strategy for microgrids. The proposed method decomposes the protection challenge into several distributed learning tasks, enabling individual relays to autonomously determine the direction of faults using a binary classification framework based on support vector machine (SVM) algorithms. Following the distributed fault direction estimation, classifier outcomes are shared among neighboring relays, facilitating a local decision-making process to ascertain the presence of faults within the neighborhood. Finally, a tripping signal is generated based on the classifier results of each relay to operate the circuit breaker. To test and validate this approach, a 100% renewable microgrid model is simulated in MATLAB/Simulink. In the numerical analysis, the application of SVM classifiers in our approach yields impressive results: an average relay classification accuracy of 98%, and a 96% accuracy in circuit breaker control. These findings highlight the potential of machine-learning-based approaches in enhancing the efficiency and reliability of microgrid protection systems.

decentralized algorithm↗

Differential sampling for fast frequency acquisition via adaptive extended least squares algorithm

This paper presents a differential signal model along with appropriate sampling techinques for least squares estimation of the frequency and frequency derivatives and possibly the phase and amplitude of a sinusoid received in the presence of noise. The proposed algorithm is recursive in mesurements and thus the computational requirement increases only linearly with the number of measurements. The dimension of the state vector in the proposed algorithm does not depend upon the number of measurements and is quite small, typically around four. This is an advantage when compared to previous algorithms wherein the dimension of the state vector increases monotonically with the product of the frequency uncertainty and the observation period. Such a computational simplification may possibly result in some loss of optimality. However, by applying the sampling techniques of the paper such a possible loss in optimality can made small.

Kumar, Rajendra↗

SPOTTED STAR LIGHT CURVES WITH ENHANCED PRECISION

The nearly continuous timewise coverage of recent photometric surveys is free of the large gaps that compromise attempts to follow starspot growth and decay as well as motions, thereby giving incentive to improve computational precision for modeled spots. Due to the wide variety of star systems in the surveys, such improvement should apply to light/velocity curve models that accurately include all the main phenomena of close binaries and rotating single stars. The vector fractional area (VFA) algorithm that is introduced here represents surface elements by small sets of position vectors so as to allow accurate computation of circle-triangle overlap by spherical geometry. When computed by VFA, spots introduce essentially no noticeable scatter in light curves at the level of one part in 10,000. VFA has been put into the Wilson-Devinney light/velocity curve program and all logic and mathematics are given so as to facilitate entry into other such programs. Advantages of precise spot computation include improved statistics of spot motions and aging, reduced computation time (intrinsic precision relaxes needs for grid fineness), noise-free illustration of spot effects in figures, and help in guarding against false positives in exoplanet searches, where spots could approximately mimic transiting planets in unusual circumstances. A simple spot growth and decay template quantifies time profiles, and specifics of its utilization in differential corrections solutions are given. Computational strategies are discussed, the overall process is tested in simulations via solutions of synthetic light curve data, and essential simulation results are described. An efficient time smearing facility by Gaussian quadrature can deal with Kepler mission data that are in 30 minute time bins.

79 ASTRONOMY AND ASTROPHYSICS↗

A parameter estimation algorithm for spatial sine testing - Theory and evaluation

This paper presents the theory and an evaluation of a spatial sine testing parameter estimation algorithm that uses directly the measured forced mode of vibration and the measured force vector. The parameter estimation algorithm uses an ARMA model and a recursive QR algorithm is applied for data reduction. In this first evaluation, the algorithm has been applied to a frequency response matrix (which is a particular set of forced mode of vibration) using a sliding frequency window. The objective of the sliding frequency window is to execute the analysis simultaneously with the data acquisition. Since the pole values and the modal density are obtained from this analysis during the acquisition, the analysis information can be used to help determine the forcing vectors during the experimental data acquisition.

Rost, R. W.↗

Iterative ramp sharpening for structure signature-preserving simplification of images

In this paper, we present a simple and heuristic ramp sharpening algorithm that achieves local contrast enhancement of vector-valued images. The proposed algorithm performs a local comparison of intensity values as well as gradient strength and directional information derived from the gradient structure tensor so that the sharpening is applied only for pixels found on the ramps around true edges. This way, the contrast between objects and regions separated by a ramp is enhanced correspondingly, avoiding ringing artefacts. It is found that applying this technique in an iterative manner on blurred imagery produces sharpening preserving both structure and signature of the image. The final approach reaches a good compromise between complexity and effectiveness for image simplification, enhancing in an efficient manner the image details and maintaining the overall image appearance.

97 MATHEMATICS AND COMPUTING↗

Testing of the Support Vector Machine for Binary-Class Classification

The Support Vector Machine is a powerful algorithm, useful in classifying data in to species. The Support Vector Machines implemented in this research were used as classifiers for the final stage in a Multistage Autonomous Target Recognition system. A single kernel SVM known as SVMlight, and a modified version known as a Support Vector Machine with K-Means Clustering were used. These SVM algorithms were tested as classifiers under varying conditions. Image noise levels varied, and the orientation of the targets changed. The classifiers were then optimized to demonstrate their maximum potential as classifiers. Results demonstrate the reliability of SMV as a method for classification. From trial to trial, SVM produces consistent results

autonomous target recognition systemr↗

Extending the eigCG algorithm to non-symmetric linear systems with multiple right-hand sides

For Hermitian positive definite linear systems and eigenvalue problems, the eigCG algorithm is a memory efficient algorithm that solves the linear system and simultaneously computes some of its eigenvalues. The algorithm is based on the Conjugate-Gradient (CG) algorithm, however, it uses only a window of the vectors generated by the CG algorithm to compute approximate eigenvalues. The number and accuracy of the eigenvectors can be increased by solving more right-hand sides. For Hermitian systems with multiple right-hand sides, the computed eigenvectors can be used to speed up the solution of subsequent systems. The algorithm was tested on Lattice QCD problems by solving the normal equations and was shown to give large speed up factors and to remove the critical slowing down as we approach light quark masses. Here, an extension to the non-symmetric case based on the two-sided Lanczos algorithm is given. The new algorithm is tested on Lattice QCD problems and is shown to give promising results. We also study the removal of the critical slowing down and compare results with those of the eigCG algorithm. We also discuss the case when the system is gamma5-Hermitian.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient solution of parabolic equations by Krylov approximation methods

Numerical techniques for solving parabolic equations by the method of lines is addressed. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace. Thus, the resulting approximation consists of applying an evolution operator of a very small dimension to a known vector which is, in turn, computed accurately by exploiting well-known rational approximations to the exponential. Because the rational approximation is only applied to a small matrix, the only operations required with the original large matrix are matrix-by-vector multiplications, and as a result the algorithm can easily be parallelized and vectorized. Some relevant approximation and stability issues are discussed. We present some numerical experiments with the method and compare its performance with a few explicit and implicit algorithms.

Gallopoulos, E.↗

Plane wave transport method for low symmetry lattices and its application

The existing first-principles plane wave transport method implementation \cite{,choi-1,qe} has the limitation that it only allows transport directions along lattice vectors perpendicular to the basal plane formed by two other lattice vectors. We generalize the algorithm to low symmetry, nonorthogonal lattices thus allowing solution to problems in which the transport direction is not along any lattice vectors. As an application, we calculate the transmission and reflection coefficients, and determine interface resistance of various grain boundaries in crystalline copper.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

SU-F-BRF-09: A Non-Rigid Point Matching Method for Accurate Bladder Dose Summation in Cervical Cancer HDR Brachytherapy

Purpose: To propose and validate a deformable point matching scheme for surface deformation to facilitate accurate bladder dose summation for fractionated HDR cervical cancer treatment. Method: A deformable point matching scheme based on the thin plate spline robust point matching (TPSRPM) algorithm is proposed for bladder surface registration. The surface of bladders segmented from fractional CT images is extracted and discretized with triangular surface mesh. Deformation between the two bladder surfaces are obtained by matching the two meshes' vertices via the TPS-RPM algorithm, and the deformation vector fields (DVFs) characteristic of this deformation is estimated by B-spline approximation. Numerically, the algorithm is quantitatively compared with the Demons algorithm using five clinical cervical cancer cases by several metrics: vertex-to-vertex distance (VVD), Hausdorff distance (HD), percent error (PE), and conformity index (CI). Experimentally, the algorithm is validated on a balloon phantom with 12 surface fiducial markers. The balloon is inflated with different amount of water, and the displacement of fiducial markers is benchmarked as ground truth to study TPS-RPM calculated DVFs' accuracy. Results: In numerical evaluation, the mean VVD is 3.7(±2.0) mm after Demons, and 1.3(±0.9) mm after TPS-RPM. The mean HD is 14.4 mm after Demons, and 5.3mm after TPS-RPM. The mean PE is 101.7% after Demons and decreases to 18.7% after TPS-RPM. The mean CI is 0.63 after Demons, and increases to 0.90 after TPS-RPM. In the phantom study, the mean Euclidean distance of the fiducials is 7.4±3.0mm and 4.2±1.8mm after Demons and TPS-RPM, respectively. Conclusions: The bladder wall deformation is more accurate using the feature-based TPS-RPM algorithm than the intensity-based Demons algorithm, indicating that TPS-RPM has the potential for accurate bladder dose deformation and dose summation for multi-fractional cervical HDR brachytherapy. This work is supported in part by the National Natural ScienceFoundation of China (no 30970866 and no 81301940)

60 APPLIED LIFE SCIENCES↗

Large Photospheric Doppler Shift in Solar Active Region 12673: I. Field-Aligned Flows

Delta (δ) sunspots sometimes host fast photospheric flows along the central magnetic polarity inversion line (PIL). Here we study the strong Doppler shift signature in the central penumbral light bridge of solar active region NOAA 12673. Observations from the Helioseismic and Magnetic Imager (HMI) indicate highly sheared, strong magnetic fields. Large Doppler shifts up to 3.2 km s −1 appeared during the formation of the light bridge and persisted for about 16 hours. A new velocity estimator, called DAVE4VMwDV, reveals fast converging and shearing motion along the PIL from HMI vector magnetograms, and recovers the observed Doppler signal much better than an old version of the algorithm. The inferred velocity vectors are largely (anti-)parallel to the inclined magnetic fields, suggesting that the observed Doppler shift contains significant contribution from the projected, field-aligned flows. High-resolution observations from the Hinode/Spectro-Polarimeter (SP) further exhibit a clear correlation between the Doppler velocity and the cosine of the magnetic inclination, which is in agreement with HMI results and consistent with a field-aligned flow of about 9.6 km s −1 . The complex Stokes profiles suggest significant gradients of physical variables along the line of sight. We discuss the implications on the δ-spot magnetic structure and the flow-driving mechanism.

Solar active region magnetic fields↗

Reducing the Volume of NASA Earth-Science Data

A computer program reduces data generated by NASA Earth-science missions into representative clusters characterized by centroids and membership information, thereby reducing the large volume of data to a level more amenable to analysis. The program effects an autonomous data-reduction/clustering process to produce a representative distribution and joint relationships of the data, without assuming a specific type of distribution and relationship and without resorting to domain-specific knowledge about the data. The program implements a combination of a data-reduction algorithm known as the entropy-constrained vector quantization (ECVQ) and an optimization algorithm known as the differential evolution (DE). The combination of algorithms generates the Pareto front of clustering solutions that presents the compromise between the quality of the reduced data and the degree of reduction. Similar prior data-reduction computer programs utilize only a clustering algorithm, the parameters of which are tuned manually by users. In the present program, autonomous optimization of the parameters by means of the DE supplants the manual tuning of the parameters. Thus, the program determines the best set of clustering solutions without human intervention.

Lee, Seungwon↗

Extreme-Scale Algorithms & Software Resilience (EASIR) Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures

This project addresses both communication-avoiding algorithms, and reproducible floating-point computation. Communication, i.e. moving data, either between levels of memory or processors over a network, is much more expensive per operation than arithmetic (measured in time or energy), so we seek algorithms that greatly reduce communication. We developed many new algorithms for both dense and sparse, and both direct and iterative linear algebra, attaining new communication lower bounds, and getting large speedups in many cases. We also extended this work in several ways: (1) We minimize writes separately from reads, since writes may be much more expensive than reads on emerging memory technologies, like Flash, sometimes doing asymptotically fewer writes than reads. (2) We extend the lower bounds and optimal algorithms to arbitrary algorithms that may be expressed as perfectly nested loops accessing arrays, where the array subscripts may be arbitrary affine functions of the loop indices (eg A(i), B(i,j+k, k+3*m-7, …) etc.). (3) We extend our communication-avoiding approach to some machine learning algorithms, such as support vector machines. This work has won a number of awards. We also address reproducible floating-point computation. We define reproducibility to mean getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should ideally not change the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociativity of floating point addition, makes attaining reproducibility a challenge even for simple operations like summing a vector of numbers, or more complicated operations like the Basic Linear Algebra Subprograms (BLAS). We describe an algorithm that computes a reproducible sum of floating point numbers, independent of the order of summation. The algorithm depends only on a subset of the IEEE Floating Point Standard 754-2008, uses just 6 words to represent a “reproducible accumulator,” and requires just one read-only pass over the data, or one reduction in parallel. New instructions based on this work are being considered for inclusion in the future IEEE 754-2018 floating-point standard, and new reproducible BLAS are being considered for the next version of the BLAS standard.

97 MATHEMATICS AND COMPUTING↗

A multistage time-stepping scheme for the thin-layer Navier-Stokes equations

A finite-volume scheme for numerical integration of the Euler equations was extended to allow solution of the thin-layer Navier-Stokes equations in two and three dimensions. The extended algorithm, which is based on a class of four-stage Runge-Kutta time-stepping schemes, was made numerically efficient through the following convergence acceleration technique: (1) local time stepping, (2) enthalpy damping, and (3) residual smoothing. Also, the high degree of vectorization possible with the algorithm has yielded an efficient program for vector processors. The scheme was evaluated by solving laminar and turbulent flows. Numerical results have compared well with either theoretical or other numerical solutions and/or experimental data.

Swanson, R. C., Jr.↗

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

A description is presented for a new explicit algorithm for solving the transonic small-disturbance potential equation on the STAR-100 computer. The STAR computer has a 'pipeline' type of processor which is very efficient in doing arithmetic operations on long vectors. Unfortunately, the successive line over-relaxation method, which represents the best method for solving the considered equation, is not suitable for vector-arithmetic procedures. The described algorithm, however, can be vectorized to make an employment of the STAR-100 possible. It is found that a use of the new algorithm for solving the equation on the STAR-100 computer can almost halve the computer time required for this type of computation when compared to successive line over-relaxation on the CYBER 175 computer.

Keller, J. D.↗

Determination of the coronal magnetic field from vector magnetograph data

A new algorithm was developed, tested, and applied to determine coronal magnetic fields above solar active regions. The coronal field above NOAA active region AR5747 was successfully estimated on 20 Oct. 1989 from data taken at the Mees Solar Observatory of the Univ. of Hawaii. It was shown that observational data can be used to obtain realistic estimates of coronal magnetic fields. The model has significantly extended the realism with which the coronal magnetic field can be inferred from observations. The understanding of coronal phenomena will be greatly advanced by a reliable technique, such as the one presented, for deducing the detailed spatial structure of the coronal field. The payoff from major current and proposed NASA observational efforts is heavily dependent on the success with which the coronal field can be inferred from vector magnetograms. In particular, the present inability to reliably obtain the coronal field has been a major obstacle to the theoretical advancement of solar flare theory and prediction. The results have shown that the evolutional algorithm can be used to estimate coronal magnetic fields.

Mikic, Zoran↗