Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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,495 records · Page 83

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

High-order entropy-based closures for linear transport in slab geometry II: A computational study of the optimization problem

We present a numerical algorithm to implement entropy-based (M{sub N}) moment models in the context of a simple, linear kinetic equation for particles moving through a material slab. The closure for these models - as is the case for all entropy-based models - is derived through the solution of constrained, convex optimization problem. The algorithm has two components. The first component is a discretization of the moment equations which preserves the set of realizable moments, thereby ensuring that the optimization problem has a solution (in exact arithmetic). The discretization is a second-order kinetic scheme which uses MUSCL-type limiting in space and a strong-stability-preserving, Runge-Kutta time integrator. The second component of the algorithm is a Newton-based solver for the dual optimization problem, which uses an adaptive quadrature to evaluate integrals in the dual objective and its derivatives. The accuracy of the numerical solution to the dual problem plays a key role in the time step restriction for the kinetic scheme. We study in detail the difficulties in the dual problem that arise near the boundary of realizable moments, where quadrature formulas are less reliable and the Hessian of the dual objection function is highly ill-conditioned. Extensive numerical experiments are performed to illustrate these difficulties. In cases where the dual problem becomes 'too difficult' to solve numerically, we propose a regularization technique to artificially move moments away from the realizable boundary in a way that still preserves local particle concentrations. We present results of numerical simulations for two challenging test problems in order to quantify the characteristics of the optimization solver and to investigate when and how frequently the regularization is needed.

99 GENERAL AND MISCELLANEOUS↗

Geographic variations in lowermost mantle structure from the ray parameters and decay constants of core-diffracted waves: CMBR Structure From P diff and S diff

We propose an array-based approach for constraining seismic velocity structure in the lowermost mantle by measuring the frequency dependence of the ray parameter p and decay constant γ for core-diffracted waves (P diff and SH diff ). The approach uses an iterative multichannel cross-correlation algorithm that solves for relative arrival times and amplitudes of core-diffracted waveforms from multiple peaks in normalized correlograms from pairs of coazimuthal stations. The approach is applied to 60 m b ≥ 5.8 earthquakes for P diff and 36 for SH diff during 2001–2002, with nearly 50,000 unique profile station pairs with epicentral-distance differences of Δd ≥ 10° and azimuth differences of Δφ ≤ 10°, sampling a significant portion of the lowermost mantle. Cap-averaging the resulting ray parameter estimates produces geographic variations that are largely consistent with the distribution of lowermost mantle large low-velocity provinces and seismically fast slab-accumulation regions seen in seismic tomography models, whose locations also greatly influence the geographic distribution of heat flow out of the core. Geographic variations in station-pair diffracted-wave decay constants differ from those of the ray parameters, suggesting that variations in the decay of core-diffracted waves are more linked to lowermost mantle seismic velocity gradients than absolute values of seismic velocity. The ray parameters and decay constants of core-diffracted waves are strongly frequency-dependent, and these frequency variations also vary significantly with geographic location. Combining lateral and vertical seismic-velocity variations with mineral-physics data on elasticity and conductivity of lowermost mantle species can provide constraints on D" composition and CMB heat flux.

58 GEOSCIENCES↗

MPMC and MCMD: Free High-Performance Simulation Software for Atomistic Systems

Advancements in parallel computing and hardware have allowed computational exploration of chemical systems of interest with unprecendented accuracy and efficiency. The typical development of molecular simulation software is initially inspired by a particular scientific inquiry. The softwares presented herein, MPMC (Massively Parallel Monte Carlo) and MCMD (Monte Carlo/Molecular Dynamics) were born out of a pursuit to simulate condensed phase physical and chemical interactions in porous materials. MPMC first began in 2005 and has been used for dozens of published results in the literature but has not yet been introduced in a standalone paper. MCMD is a more recent expansion and re-write with some published work, focused on adding molecular dynamics algorithms for transport and other time-dependent properties of chemical systems. Each software functions as a standalone with some unique and other overlapping features. Here, a driving aim of this work is to consider periodic, long-range polarization effects in classical simulation, and both codes are optimized to perform such calculations. Sample results will be presented which highlight methodically that inclusion of explicit polarization produces simulation results with predictive power which in general are in greater agreement with experiment than non-polarizable analogous simulations.

97 MATHEMATICS AND COMPUTING↗

Priority-BF: A Task Manager for Priority-Based Scheduling

The increasing demand for computational resources, particularly in High-Performance Computing environments, necessitates to rethink how we handle job scheduling strategies. This work addresses the challenge of managing concurrent jobs with differing priorities on overloaded parallel systems, where strict QoS constraints are often difficult for users to define. Our solution relies on a qualitative description of priorities and pulls from two key approaches: the Easy-BF algorithm and the Conservative Backfilling algorithms. This solution improves the response time for high-priority jobs by 50% without affecting the overall system utilization. We show its applicability in several critical scenarios such as High-Performance Computing (HPC) resource management and in-situ computing.

Gainaru, Ana [ORNL]↗

Computational complexity of the landscape II—Cosmological considerations

We propose a new approach for multiverse analysis based on computational complexity, which leads to a new family of “computational” measure factors. By defining a cosmology as a space–time containing a vacuum with specified properties (for example small cosmological constant) together with rules for how time evolution will produce the vacuum, we can associate global time in a multiverse with clock time on a supercomputer which simulates it. We argue for a principle of “limited computational complexity” governing early universe dynamics as simulated by this supercomputer, which translates to a global measure for regulating the infinities of eternal inflation. The rules for time evolution can be thought of as a search algorithm, whose details should be constrained by a stronger principle of “minimal computational complexity”. Unlike previously studied global measures, ours avoids standard equilibrium considerations and the well-known problems of Boltzmann Brains and the youngness paradox. We also give various definitions of the computational complexity of a cosmology, and argue that there are only a few natural complexity classes.

79 ASTRONOMY AND ASTROPHYSICS↗

Distributed model predictive control for coordinated, grid-interactive buildings

Continued focus on reducing carbon emissions and improving energy efficiency requires buildings to become grid-interactive and not just behave as static consumers. A distributed model predictive control (DMPC) algorithm known as Limited-Communication (LC) DMPC is modified to enable grid-interactive buildings. A grid-aggregator subsystem is added that allows for a bulk grid power reference signal to be followed while the individual building subsystems also achieve their local comfort objectives. The LC-DMPC algorithm is applied for the first time to systems with multiple buildings. Adequate power tracking is shown for different simulation scenarios involving heterogeneous buildings, and next steps are discussed.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Learning model combining convolutional deep neural network with a self-attention mechanism for AC optimal power flow

Alternating current optimal power flow (OPF) analysis is critical for efficient and reliable operation of power systems. For large systems or repetitive computations, the traditional methods such as the direct and gradient methods, or non-traditional methods, such as the genetic algorithm and simulating annealing, are time-consuming and unsuitable for real-time computing. The work in this paper proposes a novel framework to obtain the optimal solution of power flow in real-time using a combination of convolutional neural networks and a self-attention mechanism. All parameters of the power networks are rearranged in an image-like shape of a multi-channel image where each channel is a two-dimensional matrix. The proposed approach is adaptive with every input size of power systems as well as frequent variations of network topologies without intervention to the framework core. The encompassment of all power system contexts in which all parameters of internal elements, generation costs, and topology information are included, contributes to the higher accuracy of inference compared to other current machine-learning-based OPF-solving methods. Besides, the proposed framework established on ubiquitous platforms is effortlessly integrated into current infrastructures of power systems, and the great efficiency along with the computation speed may serve as a critical point for practical implications, such as enabling faster decision-making during real-time operations, predicting system contingencies, and remedial actions based on an offline pre-trained model. Furthermore, this supervised learning process is applied to the dataset of four case studies of meshed power systems: the IEEE 5-bus system (IEEE-5), the IEEE 30-bus system (IEEE-30), the IEEE 39-bus system (IEEE-39), and the IEEE 57-bus system (IEEE-57) to prove the efficacy of the proposed method.

42 ENGINEERING↗

Accelerating a fluvial incision and landscape evolution model with parallelism

Solving inverse problems, performing sensitivity analyses, and achieving statistical rigour in landscape evolution models require running many model realizations. Parallel computation is necessary to achieve this in a reasonable time. However, no previous landscape evolution algorithm is able to leverage modern parallelism. In this report, I describe an algorithm that can utilize the parallel potential of GPUs and many-core processors, in addition to working well in serial. The new algorithm runs 43× faster (70 s vs. 3000 s on a 10,000×10,000 input) than the previous state-of-the-art and exhibits sublinear scaling with input size. I also identify key techniques for multiple flow direction routing and quickly eliminating landscape depressions and local minima. Complete, well-commented, easily adaptable source code for all versions of the algorithm is available on Github and Zenodo.

58 GEOSCIENCES↗

Information content of spatially distributed ground-based measurements for hydrologic-parameter calibration in mixed rain-snow mountain headwaters

Parameters in hydrologic models used in mixed rain-snow regions are often uncertain to calibrate and overfitted on streamflow. To contribute addressing these challenges, we used an algorithm that assesses modeling performances through time (Dynamic Identifiability Analysis) to quantify the information content of spatially distributed ground-based measurements for identifying optimal parameter values in the Precipitation Runoff Modeling System (PRMS) model. Including spatially distributed ground-based measurements in Identifiability Analysis allowed us to unambiguously estimate more parameter values than only using streamflow (seven parameters instead of two out of a pool of thirty-three). Peaks in information gain were obtained when using dew-point temperature to identify precipitation phase-partitioning parameters. Multi-attribute identifiability analysis also yielded optimal parameter values that were temporally less variable than those estimated using streamflow alone. Overall, identifying parameter values using ground-based measurements improved the simulation of key drivers of the surface-water budget, such as air temperature and precipitation-phase partitioning. However, parameters simulating surface-to-subsurface mass fluxes like snow accumulation and melt or evapotranspiration were poorly identified by any attribute and so emerged as key sources of predictive uncertainty for this distributed-parameter hydrologic model. In conclusion, this work demonstrates the value of expanded ground-based measurements for identifying parameters in distributed-parameter hydrologic models and so diagnosing their conceptual uncertainty across the water budget.

54 ENVIRONMENTAL SCIENCES↗

Fast GPU 3D diffeomorphic image registration

3D image registration is one of the most fundamental and computationally expensive operations in medical image analysis. Here, we present a mixed-precision, Gauss–Newton–Krylov solver for diffeomorphic registration of two images. Our work extends the publicly available CLAIRE library to GPU architectures. Despite the importance of image registration, only a few implementations of large deformation diffeomorphic registration packages support GPUs. Our contributions are new algorithms to significantly reduce the run time of the two main computational kernels in CLAIRE: calculation of derivatives and scattered-data interpolation. Additionally, we deploy (i) highly-optimized, mixed-precision GPU-kernels for the evaluation of scattered-data interpolation, (ii) replace Fast-Fourier-Transform (FFT)-based first-order derivatives with optimized 8th-order finite differences, and (iii) compare with state-of-the-art CPU and GPU implementations. As a highlight, we demonstrate that we can register clinical images in less than 6 s on a single NVIDIA Tesla V100. This amounts to over 20 speed-up over the current version of CLAIRE and over 30 speed-up over existing GPU implementations.

97 MATHEMATICS AND COMPUTING↗

Efficient Fresnel zoneplate pattern data preparation for high-resolution nanofabrication

A Fresnel zoneplate is a diffractive optical element consisting of concentric rings (zones) for which the transmitted light produces a focal spot that is used in all wavelength regimes, including X-rays. The pattern of transmission openings determines the location of the spot and the sub-half wavelength size of the openings can adjust the intensity. Today, very general transmission zoneplate patterns are used for many special imaging and image compensation purposes. Manufacturing zoneplates require a zoneplate pattern file, which precisely describes the size, shape, and contour of the rings based on the desired optical properties of the lens. Generating such a pattern requires the delicate balance of achieving the required optical performance while maintaining manageable file sizes and computation times. Here we describe a new algorithm meeting these needs. In conclusion, by precisely controlling the number of shapes in each zone, the algorithm simultaneously optimizes the desired optical tolerances with the pattern file size.

47 OTHER INSTRUMENTATION↗

The Power of Many: An Ensemble Approach to Spectral Similarity

Quantifying the similarity between two mass spectra─a known reference mass spectrum and an unidentified sample mass spectrum─is at the heart of compound identification workflows in gas chromatography–mass spectrometry (GC-MS). The reference spectrum most like the sample is assigned as its identification (provided some quantitative similarity threshold is met, e.g., 80%) and thus accurately measuring similarity is essential. Significant research has gone toward developing metrics for this purpose, each of which has attempted to improve upon existing methods by incorporating GC-MS-specific information (e.g., peak ratios or retention times) or adopting various statistical and algorithmic frameworks. While this active development has led to a plethora of similarity metrics with demonstrated value across different contexts, the unfortunate consequence has been confusion surrounding which metric should be used as a global standard. No such metric is currently accepted as the standard method because different metrics have demonstrated optimal performance in different contexts. In this work, we propose an ensemble approach to spectral similarity scoring that combines the collective information from across existing similarity metrics to form an improved, globally representative similarity metric as a step toward establishing a global standard method. In conclusion, the resulting ensemble metrics are evaluated on over 88,000 spectra of varying complexity and demonstrate improved abilities to accurately rank the correct reference spectrum as the top-matching candidate for a sample relative to the rankings generated by individual similarity scores.

Carbohydrates↗

Accelerating the discovery of materials for clean energy in the era of smart automation

The discovery and development of novel materials in the field of energy are essential to accelerate the transition to a low-carbon economy. Bringing recent technological innovations in automation, robotics and computer science together with current approaches in chemistry, materials synthesis and characterization will act as a catalyst for revolutionizing traditional research and development in both industry and academia. This Perspective provides a vision for an integrated artificial intelligence approach towards autonomous materials discovery, which, in our opinion, will emerge within the next 5 to 10 years. The approach we discuss requires the integration of the following tools, which have already seen substantial development to date: high-throughput virtual screening, automated synthesis planning, automated laboratories and machine learning algorithms. In addition to reducing the time to deployment of new materials by an order of magnitude, this integrated approach is expected to lower the cost associated with the initial discovery. Furthermore, the price of the final products (for example, solar panels, batteries and electric vehicles) will also decrease. This in turn will enable industries and governments to meet more ambitious targets in terms of reducing greenhouse gas emissions at a faster pace.

36 MATERIALS SCIENCE↗

Very Forward Calorimetry at the LHC--Recent results from ATLAS

We present first results from the ATLAS Zero Degree Calorimeters (ZDC) based on 7 TeV pp collision data recorded in 2010. The ZDC coverage of {+-}{approx}350 {mu}rad about the forward direction makes possible the measurement of neutral particles (primarily {pi}{sup 0}'s and neutrons) over the kinematic region x{sub F} > or approx. 0.1 and out to p{sub T} < or approx. 1.2 GeV/c at large x{sub F}. The ATLAS ZDC is unique in that it provides a complete image of both electromagnetic and hadronic showers. This is illustrated with the reconstruction of {pi}{sup 0}'s with energies of 0.7-3.5 TeV. We also discuss the waveform reconstruction algorithm which has allowed good time-of-flight resolution on leading neutrons emerging from the collisions despite the sparse (40 MHz) sampling of the calorimeter signals used.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Event triggering in the IceCube data acquisition system

In order to detect cosmic ray air showers and neutrinos, the software data acquisition (DAQ) system of the IceCube Neutrino Observatory forms triggers on patterns of Cherenkov light deposition in the detector based on temporal and/or spatial coincidences. Here we describe the algorithms used for triggering, as well as the fast merging algorithm used to combine the time-ordered hit streams from the optical modules. We also present recently implemented and planned modifications of the DAQ that take advantage of our newly upgraded multi-core computer systems at the South Pole.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing

In this note, we use ideas of Farhi et al. [Int. J. Quantum. Inf. 6, 503 (2008) and Quantum Inf. Comput. 11, 840 (2011)] who link a lower bound on the run time of their quantum adiabatic search algorithm to an upper bound on the energy gap above the ground-state of the generators of this algorithm. We apply these ideas to the quantum random energy model (QREM). Our main result is a simple proof of the conjectured exponential vanishing of the energy gap of the QREM.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Velocity diffusion of energetic electrons in the solar wind

Particle diffusion in velocity space is studied on the basis of 1D simulations of Langmuir turbulence generated by electron beams in solar wind plasmas. Using a large amount of particle trajectories calculated with a great accuracy and over long times and analyzing them with statistical algorithms, the diffusion coefficients of particles in wave packets are estimated, as well as their relation to the waves’ intensities and spectra and their dependence on the average level of background plasma density fluctuations. Results are compared with analytical solutions provided by the quasilinear theory of weak turbulence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗