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 901 records · Page 50

Rapid Optimization Library

ROL provides interfaces to and implementations of algorithms for gradient-based unconstrained and constrained optimization. ROL can be used to optimize the response of any client simulation code that evaluates scalar-valued response functions. If the client code can provide gradient information for the response function, ROL will take advantage of it, resulting in faster runtimes. ROL's interfaces are matrix-free, in other words ROL only uses evaluations of scalar-valued and vector-valued functions. ROL can be used to solve optimal design problems and inverse problems based on a variety of simulation software.

Kouri, DrewKouri↗

Rapid Optimization Library

ROL provides interfaces to and implementations of algorithms for gradient-based unconstrained and constrained optimization. ROL can be used to optimize the response of any client simulation code that evaluates scalar-valued response functions. If the client code can provide gradient information for the response function, ROL will take advantage of it, resulting in faster runtimes. ROL's interfaces are matrix-free, in other words ROL only uses evaluations of scalar-valued and vector-valued functions. ROL can be used to solve optimal design problems and inverse problems based on a variety of simulation software.

Denis Rldzal, Drew Kouri↗

A Novel Machine Learning Algorithm for Planetary Boundary Layer Height Estimation Using AERI Measurement Data

Accurately determining the height of the planetary boundary layer (PBL) is important since it can affect the climate, weather, and air quality. Ground-based infrared hyperspectral remote sensing is an effective way to obtain this parameter. Compared with radiosonde measurements, its temporal resolution is much higher. In this study, a method to retrieve the PBL height (PBLH) from the ground-based infrared hyperspectral radiance data is proposed based on machine learning. In this method, the channels that are sensitive to temperature and humidity profiles are selected as the feature vectors, and the PBLHs derived from radiosonde are taken as the true values. The support vector machine (SVM) is applied to train and test the data set, and the parameters are optimized in the process. The data set collected at the Atmospheric Radiation Measurement (ARM) program Southern Great Plains (SGP) from 2012 to 2015 is analyzed. The instruments used in this letter include Atmospheric Emitted Radiance Interferometer (AERI), Vaisala CL31 ceilometer, and radiosonde. It shows that the root mean square error (RMSE) between the PBLHs calculated by the proposed method using AERI data and those from radiosonde data can be within 370 m, and the square correlation coefficient (SCC) is greater than 0.7. Compared with the PBLHs derived from the ceilometer, it can be found that the new method is more stable and less affected by clouds.

54 ENVIRONMENTAL SCIENCES↗

Search for Technicolor Particles Produced in Association with a W Boson at CDF

We present a search for the technicolor particles {rho}{sub T} and pi{sub T} in the process pp->{rho}{sub T}->W{pi}{sub T} at a center of mass energy of sq root(s)=1.96 TeV. The search uses a data sample corresponding to approximately 1.9 fb{sup -1} of integrated luminosity accumulated by the CDF II detector at the Fermilab Tevatron. The event signature we consider is W->l{nu} and {pi}{sub T}->bb, bc or bu depending on the {pi}{sub T} charge. We select events with a single high-p{sub T} electron or muon, large missing transverse energy, and two jets. Jets corresponding to bottom quarks are identified with multiple b-tagging algorithms. The observed number of events and the invariant mass distributions are consistent with the standard model background expectations, and we exclude a region at 95% confidence level in the {rho}{sub T}-{pi}{sub T} mass plane. As a result, a large fraction of the region m({rho}{sub T})=180-250 GeV/c{sup 2} and m({pi}{sub T})=95-145 GeV/c{sup 2} is excluded.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

VTK-m: Visualization for the Exascale Era and Beyond

A recent trend in modern high-performance computing is the increasing use of hybrid architectures, where the vast majority of performance comes from accelerators. Modern accelerators are based on Graphics Processing Units (GPU) that contain many low power cores that in their aggregate provides an extremely high computation rate. Current and future CPU processors are requiring more explicit parallelism as each successive version of the hardware packs in more cores, and technologies like hyperthreading and vector operations require even more parallel processing to leverage each core’s full potential. As an example, the Frontier supercomputer installed at Oak Ridge National Laboratories recently hit a record breaking 1.1 exaflops1 on the LINPACK HPC benchmark [Shoemaker 2022]. The system contains 37632 AMD MI250x GPUs which requires more than half a billion threads to keep the system fully utilized [Khizeran 2022].VTK-m is a toolkit of scientific visualization algorithms for these emerging processor architectures. VTK-m supports the fine-grained concurrency for data analysis and visualization algorithms required to drive extreme scale computing by providing abstract models for data and execution that can be applied to a variety of algorithms across many different processor architectures.

Bolstad, Mark↗

A C++ TPSA/DA Library with Python Wrapper

Truncated power series algebra (TPSA) or differential algebra (DA) is often used by accelerator physicists to generate a transfer map of a dynamic system. The map then can be used in dynamic analysis of the system or in particle tracking study. TPSA/DA can also be used in some fast algorithms, eg. the fast multipole method, for collective effect simulation. This paper reports a new TPSA/DA library written in C++. This library is developed based on Dr. Lingyun Yang?s TPSA code, which has been used in MAD-X and PTC. Compared with the original code, the updated version has the following changes: (1) The memory management has been revised to improve the efficiency; (2) A new data type of DA vector is defined and supported by most frequently used operators; (3) Support of inverse trigonometric functions and hyperbolic functions for the DA vector has been added; (4) function composition is revised for better efficiency; (5) a python wrapper is provided. The code is hosted at github and available to the public.

Zhang, Y.↗

Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding

In this study, the exponential increase in data over the last decade presents a significant challenge to analytics efforts that seek to process and interpret such data for various applications. Neural-inspired computing approaches are being developed in order to leverage the computational properties of the analog, low-power data processing observed in biological systems. Analog resistive memory crossbars can perform a parallel read or a vector-matrix multiplication as well as a parallel write or a rank-1 update with high computational efficiency. For an N × N crossbar, these two kernels can be O(N) more energy efficient than a conventional digital memory-based architecture. If the read operation is noise limited, the energy to read a column can be independent of the crossbar size (O(1)). These two kernels form the basis of many neuromorphic algorithms such as image, text, and speech recognition. For instance, these kernels can be applied to a neural sparse coding algorithm to give an O(N) reduction in energy for the entire algorithm when run with finite precision. Sparse coding is a rich problem with a host of applications including computer vision, object tracking, and more generally unsupervised learning.

97 MATHEMATICS AND COMPUTING↗

Thermodynamic and Magnetic Properties of the Two-Dimensional Anisotropic Ising Model with Competing Interactions

The two-dimensional anisotropic Ising model with competing interactions is studied on a square lattice by Monte Carlo methods using the Wang–Landau algorithm. The temperature dependences of the main thermodynamic and magnetic parameters are calculated. The distinctive features of temperature dependences of these parameters for different values of the competing interaction are shown. The dependences of the wave number of modulated structures on the ratio of exchange interaction parameters are plotted. The phase diagram of the model is built. The coordinates of the Lifshits point and the localization region of the phases with different wave vector values are calculated by interpolating phase boundaries of the d-iagram.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Reconstructing high-dimensional Hilbert-valued functions via compressed sensing

We present and analyze a novel sparse polynomial technique for approximating high-dimensional Hilbert-valued functions, with application to parameterized partial differential equations (PDEs) with deterministic and stochastic inputs. Our theoretical framework treats the function approximation problem as a joint sparse recovery problem, where the set of jointly sparse vectors is possibly infinite. To achieve the simultaneous reconstruction of Hilbert-valued functions in both parametric domain and Hilbert space, we propose a novel mixed-norm based `1 regularization method that exploits both energy and sparsity. Our approach requires extensions of concepts such as the restricted isometry and null space properties, allowing us to prove recovery guarantees for sparse Hilbert-valued function reconstruction. We complement the enclosed theory with an algorithm for Hilbert-valued recovery, based on standard forward-backward algorithm, meanwhile establishing its strong convergence in the considered infinite-dimensional setting. Finally, we demonstrate the minimal sample complexity requirements of our approach, relative to other popular methods, with numerical experiments approximating the solutions of high-dimensional parameterized elliptic PDEs.

Dexter, Nick↗

AN AUTOMATIC DETECTION METHOD FOR EXTREME-ULTRAVIOLET DIMMINGS ASSOCIATED WITH SMALL-SCALE ERUPTION

Small-scale extreme-ultraviolet (EUV) dimming often surrounds sites of energy release in the quiet Sun. This paper describes a method for the automatic detection of these small-scale EUV dimmings using a feature-based classifier. The method is demonstrated using sequences of 171 Angstrom-Sign images taken by the STEREO/Extreme UltraViolet Imager (EUVI) on 2007 June 13 and by Solar Dynamics Observatory/Atmospheric Imaging Assembly on 2010 August 27. The feature identification relies on recognizing structure in sequences of space-time 171 Angstrom-Sign images using the Zernike moments of the images. The Zernike moments space-time slices with events and non-events are distinctive enough to be separated using a support vector machine (SVM) classifier. The SVM is trained using 150 events and 700 non-event space-time slices. We find a total of 1217 events in the EUVI images and 2064 events in the AIA images on the days studied. Most of the events are found between latitudes -35 Degree-Sign and +35 Degree-Sign . The sizes and expansion speeds of central dimming regions are extracted using a region grow algorithm. The histograms of the sizes in both EUVI and AIA follow a steep power law with slope of about -5. The AIA slope extends to smaller sizes before turning over. The mean velocity of 1325 dimming regions seen by AIA is found to be about 14 km s{sup -1}.

79 ASTRONOMY AND ASTROPHYSICS↗

Behavior and mechanisms of Doppler wind lidar error in complex terrain: stable flow case study at Perdigão

A numerical experiment is carried out investigating the magnitude of biases in ground-based lidar measurements in complex flow conditions. Biases assessed include those arising from flow curvature and from the interaction of turbulence with the wind field reconstruction (WFR) algorithms used by a WindCube lidars and anemometers. RANS-CFD and WRF-LES simulations were performed for the Perdig˜ao Field Experiment site for a range of atmospheric conditions. Virtual anemometer and lidar data were generated for four locations: two near exposed ridge tops and two in low-speed regions in the valley. The LES data at these four locations show that the scalar inflation terms (the relation between scalar and vector averaged wind speed) for virtual lidar and virtual cups agree very well with predictions using perturbation theory. While the lidar errors vary greatly with location and height, the contribution from the flow curvature tends to be larger than the differences arising from scalar inflation. For one lidar/mast pair near the ridge top, comparisons between simulations and measurements are carried out for a resonant mountain wave event on June 14th, 2017, and for the whole duration of the Perdigão campaign for winds perpendicular to the ridges. The lidar error during the mountain wave, a period of strong stability and low inversion height, is significantly larger than the campaign average. The sensitivity of the lidar error to atmospheric stability is confirmed by the RANS simulations, which suggests strong sensitivity of flow curvature error to stability conditions and to the shape of the wind speed profile near the top of the boundary layer.

17 WIND ENERGY↗

Robust Online Sequential RVFLNs for Data Modeling of Dynamic Time-Varying Systems with Application of an Ironmaking Blast Furnace

In a world where the increasing complexity of modern industrial processes brings difficulties for accurate mathematical modeling, taking advantage of data has become an efficient solution to complex dynamic process modeling issue. In this paper, we develop a novel robust online sequential version of random vector functional-link networks (RVFLNs) for data-driven modeling of dynamic time-varying system and applied it in a blast furnace (BF) ironmaking process. First, to overcome the time-varying dynamics of process and to enable the RVFLNs to learn online with avoiding data saturation, an improved online sequential version of RVFLNs (OS-RFVLNs) is first presented by online sequential learning with forgetting factor. This improved OS-RVFLNs algorithm is not only suitable for the real-time and large data transfer situation, but also can adjust the sensitivity of the algorithm to different samples with the help of the introduced forgetting factor. Second, since the output weights of the improved OS-RVFLNs as well as other RVFLNs algorithms are obtained by the least squares approach, a robustness problem may occur when the training dataset is contaminated with various outliers. To solve this problem, a Cauchy distribution weighted M-estimator is introduced to improve the robustness of the improved OS- RVFLNs. For this proposed robust OS-RVFLNs (R-OS- RVFLNs), since the weights of different outlier data are properly determined by the Cauchy distribution function, their corresponding contribution on modeling can be properly distinguished. Thus robust and better modeling results can be achieved. Experiments using actual industrial data of BF ironmaking process and comparative studies have demonstrated that the proposed method produces a better estimation accuracy and stronger robustness than other methods.

Blast furnace (BF), Modelling, Dynamic systems↗

Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut

Finding high-quality parameters is a central obstacle to using the quantum approximate optimization algorithm (QAOA). Previous work partially addresses this issue for QAOA on unweighted MaxCut problems by leveraging similarities in the objective landscape among different problem instances. However, we show that the more general weighted MaxCut problem has significantly modified objective landscapes, with a proliferation of poor local optima. Our main contribution is a simple rescaling scheme that overcomes these deleterious effects of weights. Here we show that for a given QAOA depth, a single “typical” vector of QAOA parameters can be successfully transferred to weighted MaxCut instances. This transfer leads to a median decrease in the approximation ratio of only 2.0 percentage points relative to a considerably more expensive direct optimization on a dataset of 34,701 instances with up to 20 nodes and multiple weight distributions. This decrease can be reduced to 1.2 percentage points at the cost of only 10 additional QAOA circuit evaluations with parameters sampled from a pretrained metadistribution, or the transferred parameters can be used as a starting point for a single local optimization run to obtain approximation ratios equivalent to those achieved by exhaustive optimization in 96.35% of our cases.

97 MATHEMATICS AND COMPUTING↗

Diverse Power Iteration Embeddings and Its Applications

Abstract—Spectral Embedding is one of the most effective dimension reduction algorithms in data mining. However, its computation complexity has to be mitigated in order to apply it for real-world large scale data analysis. Many researches have been focusing on developing approximate spectral embeddings which are more efficient, but meanwhile far less effective. This paper proposes Diverse Power Iteration Embeddings (DPIE), which not only retains the similar efficiency of power iteration methods but also produces a series of diverse and more effective embedding vectors. We test this novel method by applying it to various data mining applications (e.g. clustering, anomaly detection and feature selection) and evaluating their performance improvements. The experimental results show our proposed DPIE is more effective than popular spectral approximation methods, and obtains the similar quality of classic spectral embedding derived from eigen-decompositions. Moreover it is extremely fast on big data applications. For example in terms of clustering result, DPIE achieves as good as 95% of classic spectral clustering on the complex datasets but 4000+ times faster in limited memory environment.

97 MATHEMATICS AND COMPUTING↗

Soft bootstrap and supersymmetry

The soft bootstrap is an on-shell method to constrain the landscape of effective field theories (EFTs) of massless particles via the consistency of the low-energy S-matrix. Given assumptions on the on-shell data (particle spectra, linear symmetries, and low-energy theorems), the soft bootstrap is an efficient algorithm for determining the possible consistency of an EFT with those properties. The implementation of the soft bootstrap uses the recently discovered method of soft subtracted recursion. We derive a precise criterion for the validity of these recursion relations and show that they fail exactly when the assumed symmetries can be trivially realized by independent operators in the effective action. We use this to show that the possible pure (real and complex) scalar, fermion, and vector exceptional EFTs are highly constrained. Next, we prove how the soft behavior of states in a supermultiplet must be related and illustrate the results in extended supergravity. We demonstrate the power of the soft bootstrap in two applications. First, for the \( \mathcal{N} \) = 1 and \( \mathcal{N} \) = 2 C P 1 nonlinear sigma models, we show that on-shell constructibility establishes the emergence of accidental IR symmetries. This includes a new on-shell perspective on the interplay between \( \mathcal{N} \) = 2 supersymmetry, low-energy theorems, and electromagnetic duality. We also show that \( \mathcal{N} \) = 2 supersymmetry requires 3-point interactions with the photon that make the soft behavior of the scalar O (1) instead of vanishing, despite the underlying symmetric coset. Second, we study Galileon theories, including aspects of supersymmetrization, the possibility of a vector-scalar Galileon EFT, and the existence of higher-derivative corrections preserving the enhanced special Galileon symmetry. The latter is addressed both by soft bootstrap and by application of double-copy/KLT relations applied to higher-derivative corrections of chiral perturbation theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An implicit barotropic mode solver for MPAS-ocean using a modern Fortran solver interface

Here, we demonstrate use of a modern Fortran solver interface to manage solver algorithms for an implicit barotropic mode solver in the Model for Predictions Across Scales-Ocean (MPAS-O). ForTrilinos, a Fortran interface to Trilinos that contains a large collection of solver capabilities written in C++, has been implemented in MPAS-O to provide access to a suite of linear solver options. By virtue of the simplified wrapper and interface generator (SWIG) automation tool that generates modern Fortran interfaces to C++ code, we were able to implement the Fortran solver interface in MPAS-O using a familiar Fortran coding style while minimizing performance degradation. The ForTrilinos solver interface is written within MPAS-O’s time stepping modules as a subroutine in conjunction with MPAS-O code. Applied to an idealized ocean and a high-resolution realistic ocean test case, parallel performance of ForTrilinos solvers is examined. It is found that parallel scalability of the ForTrilinos solvers is highly dependent on the number of global synchronization points per solver iteration in each iterative solver algorithm. ForTrilinos solvers perform best compared to the Fortran hand-crafted (FHC) solver when the amount of work per processor is large enough. However, parallel scalability is better with the FHC solver and so when the work per core is modest FHC outperforms ForTrilinos. The intercomparison between the ForTrilinos and FHC solvers reveals that this performance hit in the ForTrilinos solver mostly comes from the global synchronization process, while suggesting that the matrix-vector multiplication process in the FHC solver needs to be optimized for better performance.

97 MATHEMATICS AND COMPUTING↗

Locally adaptive activation functions with slope recovery for deep and physics-informed neural networks

Here we propose two approaches of locally adaptive activation functions namely, layer-wise and neuron-wise locally adaptive activation functions, which improve the performance of deep and physics-informed neural networks. The local adaptation of activation function is achieved by introducing a scalable parameter in each layer (layer-wise) and for every neuron (neuron-wise) separately, and then optimizing it using a variant of stochastic gradient descent algorithm. In order to further increase the training speed, an activation slope-based slope recovery term is added in the loss function, which further accelerates convergence, thereby reducing the training cost. On the theoretical side, we prove that in the proposed method, the gradient descent algorithms are not attracted to sub-optimal critical points or local minima under practical conditions on the initialization and learning rate, and that the gradient dynamics of the proposed method is not achievable by base methods with any (adaptive) learning rates. We further show that the adaptive activation methods accelerate the convergence by implicitly multiplying conditioning matrices to the gradient of the base method without any explicit computation of the conditioning matrix and the matrix–vector product. The different adaptive activation functions are shown to induce different implicit conditioning matrices. Furthermore, the proposed methods with the slope recovery are shown to accelerate the training process.

97 MATHEMATICS AND COMPUTING↗

Parallel seed-based approach to multiple protein structure similarities detection

Finding similarities between protein structures is a crucial task in molecular biology. Most of the existing tools require proteins to be aligned in order-preserving way and only find single alignments even when multiple similar regions exist. We propose a new seed-based approach that discovers multiple pairs of similar regions. Its computational complexity is polynomial and it comes with a quality guarantee—the returned alignments have both root mean squared deviations (coordinate-based as well as internal-distances based) lower than a given threshold, if such exist. We do not require the alignments to be order preserving (i.e., we consider nonsequential alignments), which makes our algorithm suitable for detecting similar domains when comparing multidomain proteins as well as to detect structural repetitions within a single protein. Because the search space for nonsequential alignments is much larger than for sequential ones, the computational burden is addressed by extensive use of parallel computing techniques: a coarse-grain level parallelism making use of available CPU cores for computation and a fine-grain level parallelism exploiting bit-level concurrency as well as vector instructions.

59 BASIC BIOLOGICAL SCIENCES↗