Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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 937 records · Page 52

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗

Short-term solar irradiance forecasting via satellite/model coupling

Here, the short-term (0-3 h) prediction of solar insolation for renewable energy production is a problem well-suited to satellite-based techniques. The spatial, spectral, temporal and radiometric resolution of instrumentation hosted on the geostationary platform allows these satellites to describe the current cloud spatial distribution and optical properties. These properties relate directly to the transient properties of the downwelling solar irradiance at the surface, which come in the form of 'ramps' that pose a central challenge to energy load balancing in a spatially distributed network of solar farms. The short-term evolution of the cloud field may be approximated to first order simply as translational, but care must be taken in how the advection is handled and where the impacts are assigned. In this research, we describe how geostationary satellite observations are used with operational cloud masking and retrieval algorithms, wind field data from Numerical Weather Prediction (NWP), and radiative transfer calculations to produce short-term forecasts of solar insolation for applications in solar power generation. The scheme utilizes retrieved cloud properties to group pixels into contiguous cloud objects whose future positions are predicted using four-dimensional (space + time) model wind fields, selecting steering levels corresponding to the cloud height properties of each cloud group. The shadows associated with these clouds are adjusted for sensor viewing parallax displacement and combined with solar geometry and terrain height to determine the actual location of cloud shadows. For mid/high-level clouds at mid-latitudes and high solar zenith angles, the combined displacements from these geometric considerations are non-negligible. The cloud information is used to initialize a radiative transfer model that computes the direct and diffuse-sky solar insolation at both shadow locations and intervening clear-sky regions. Here, we describe the formulation of the algorithm and validate its performance against Surface Radiation (SURFRAD; Augustine et al., 2000, 2005) network observations. Typical errors range from 8.5% to 17.2% depending on the complexity of cloud regimes, and an operational demonstration outperformed persistence-based forecasting of Global Horizontal Irradiance (GHI) under all conditions by ~10 W/m 2 .

14 SOLAR ENERGY↗

Sampling two-dimensional isometric tensor network states

Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

Dumitrescu, Eugene [ORNL] (ORCID:0000000158519567)↗

Real-time nonlinear optimization as a generalized equation.

We establish results for the problem of tracking a time-dependent manifold arising in real-time optimization by casting this as a parametric generalized equation. We demonstrate that if points along a solution manifold are consistently strongly regular, it is possible to track the manifold approximately by solving a single linear complementarity problem (LCP) at each time step. We derive sufficient conditions guaranteeing that the tracking error remains bounded to second order with the size of the time step even if the LCP is solved only approximately. We use these results to derive a fast, augmented Lagrangian tracking algorithm and demonstrate the developments through a numerical case study.

36 MATERIALS SCIENCE↗

Optimizing luminescent solar concentrator design

Luminescent Solar Concentrators (LSCs) use fluorescent materials and light guides to convert direct and diffuse sunlight into concentrated wavelength-shifted light that produces electrical power in small photovoltaic (PV) cells with the goal of significantly reducing the cost of solar energy utilization. In this paper we present an optimization analysis based on the implementation of a genetic algorithm (GA) subroutine to a numerical ray-tracing Monte Carlo model of an LSC, SIMSOLAR-P. The initial use of the GA implementation in SIMSOLAR-P is to find the optimal parameters of a hypothetical ‘‘perfect luminescent material’’ that obeys the Kennard Stepanov (K-S) thermodynamic relationship between emission and absorption. The optimization balances the efficiency losses in the wavelength shift and PV conversion with the efficiency losses due to re-scattering of light out of the collector. The theoretical limits of efficiency are provided for one, two and three layer configurations; the results show that a single layer configuration is far from optimal and adding a second layer in the LSC with wavelength shifted material in the near infrared region significantly increases the power output, while the gain in power by adding a third layer is relatively small. Here, the results of this study provide a theoretical upper limit to the performance of an LSC and give guidance for the properties required for luminescent materials, such as quantum nanocrystals, to operate efficiently in planar LSC configurations

14 SOLAR ENERGY↗

Two-stage minimax stochastic unit commitment

The study proposes a stochastic optimisation approach based on discrete scenarios and the minimax criterion to deal with demand uncertainty in the two-stage unit commitment problem. To avoid making an over-conservative decision, the approach is designed to assign a probability-based weight to each demand scenario and provide a unit commitment schedule that minimises the maximum possible-weighted generation cost. Unit commitment is determined in the first stage and the economic dispatch under the scenario that corresponds to the maximum possible-weighted generation cost is determined in the second stage. The problem is formulated as a type of min-max-min mixed integer programming model. By introducing an auxiliary variable, the model is further transformed into a minimisation problem. A Benders decomposition algorithm is developed to solve the problem. The Benders master problem determines the unit commitment decision, while the Benders subproblem determines the dispatch decision. Multiple Benders feasibility cuts are constructed when the Benders subproblem is infeasible. Valid inequalities are derived to improve the lower bound provided by the Benders master problem. Numerical results show the performance of the algorithm.

Che, Ping↗

A new scheme of causal viscous hydrodynamics for relativistic heavy-ion collisions: A Riemann solver for quark–gluon plasma

In this article, we present a state-of-the-art algorithm for solving the relativistic viscous hydrodynamics equation with the QCD equation of state. The numerical method is based on the second-order Godunov method and has less numerical dissipation, which is crucial in describing of quark–gluon plasma in high-energy heavy-ion collisions. We apply the algorithm to several numerical test problems such as sound wave propagation, shock tube and blast wave problems. In sound wave propagation, the intrinsic numerical viscosity is measured and its explicit expression is shown, which is the second-order of spatial resolution both in the presence and absence of physical viscosity. The expression of the numerical viscosity can be used to determine the maximum cell size in order to accurately measure the effect of physical viscosity in the numerical simulation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Machine Learning Calabi–Yau Metrics

We apply machine learning to the problem of finding numerical Calabi–Yau metrics. Building on Donaldson's algorithm for calculating balanced metrics on Kähler manifolds, we combine conventional curve fitting and machine-learning techniques to numerically approximate Ricci-flat metrics. We show that machine learning is able to predict the Calabi–Yau metric and quantities associated with it, such as its determinant, having seen only a small sample of training data. Using this in conjunction with a straightforward curve fitting routine, we demonstrate that it is possible to find highly accurate numerical metrics much more quickly than by using Donaldson's algorithm alone, with our new machine-learning algorithm decreasing the time required by between one and two orders of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Online eco-routing for electric vehicles using combinatorial multi-armed bandit with estimated covariance

Identifying energy-efficient routes in real-time has significant implications for the energy-optimal operations of electric vehicles (EVs). Here, this study proposes a novel model for EV online eco-routing problem, which obtains the minimal expected energy consumption paths (MECPs) for multiple origin-destination (OD) pairs simultaneously. Specifically, we formulate the routing problem as a bandit problem and solve it with online algorithms. We extend the algorithms by implementing a path elimination mechanism to reduce the candidate path set and introducing the variance and covariance of the energy consumption to reduce the uncertainties. The numerical results show that the proposed algorithms can efficiently obtain near-optimal MECPs, and the solution is significantly better than the widely used shortest trip time path algorithm (STTP) and shortest trip distance path algorithm (SDP). The variation considering link energy covariance and path elimination generates paths that save 4.1% of energy compared to the SDP and 5.4% to the STTP.

33 ADVANCED PROPULSION SYSTEMS↗

Numerical estimation of the relative entropy of entanglement

We propose a practical algorithm for the calculation of the relative entropy of entanglement (REE), defined as the minimum relative entropy between a state and the set of states with positive partial transpose. Our algorithm is based on a practical semidefinite cutting plane approach. In low dimensions the implementation of the algorithm in matlab provides an estimation for the REE with an absolute error smaller than 10{sup -3}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Robust Load Shedding Strategy for Microgrid Islanding Transition

A microgrid is a group of interconnected loads and distributed energy resources. It can operate in either gridconnected mode to exchange energy with the main grid or run autonomously as an island in emergency mode. However, the transition of microgrid from grid-connected mode to islanded mode is usually associated with excessive load (or generation), which should be shed (or spilled). Under this condition, this paper proposes an robust load shedding strategy for microgrid islanding transition, which takes into account the uncertainties of renewable generation in the microgrid and guarantees the balance between load and generation after islanding. A robust optimization model is formulated to minimize the total operation cost, including fuel cost and penalty for load shedding. The proposed robust load shedding strategy works as a backup plan and updates at a prescribed interval. It assures a feasible operating point after islanding given the uncertainty of renewable generation. The proposed algorithm is demonstrated on a simulated microgrid consisting of a wind turbine, a PV panel, a battery, two distributed generators (DGs), a critical load and a interruptible load. Numerical simulation results validate the proposed algorithm.

Liu, Guodong↗

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗

Simulated Half-Precision Implementation of Blocked QR Factorization and Graph Clustering Applications

We explored half-precision implementation of blocked QR algorithms with the following motivations: 1. New GPUs perform fast half-precision arithmetic (4 to 16 times as fast as doubleprecision). 2. QR factorization is a basic linear algebra tool useful for many physics and data analysis applications. 3. Communication-avoiding, parallelizable QR algorithms already exist for talland- skinny matrices. While the standard QR algorithms are highly unstable in half-precision, our numerical simulations show that the Tall-and-Skinny QR (TSQR) algorithm can improve the backward error of QR factorization. When using subspace iteration for graph clustering applications, half-precision accuracy in forming the eigenspace is sufficient for clustering with high precision and recall for some medium-scale benchmark problems. Note that all half-precision arithmetic were simulated with conversions to single-precision floats. Therefore, the results from this work are somewhat optimistic.

97 MATHEMATICS AND COMPUTING↗

Identifying Defects with Guided Algorithms in Bragg Coherent Diffractive Imaging

In this study, crystallographic defects such as dislocations can significantly alter material properties and functionality. However, imaging these imperfections during operation remains challenging due to the short length scales involved and the reactive environments of interest. Bragg coherent diffractive imaging (BCDI) has emerged as a powerful tool capable of identifying dislocations, twin domains, and other defects in 3D detail with nanometer spatial resolution within nanocrystals and grains in reactive environments. However, BCDI relies on phase retrieval algorithms that can fail to accurately reconstruct the defect network. Here, we use numerical simulations to explore different guided phase retrieval algorithms for imaging defective crystals using BCDI. We explore different defect types, defect densities, Bragg peaks, and guided algorithm fitness metrics as a function of signal-to-noise ratio. Based on these results, we offer a general prescription for phasing of defective crystals with no a prior knowledge.

36 MATERIALS SCIENCE↗

Polar Liquid Cloud Base Detection Algorithms for High Spectral Resolution or Micropulse Lidar Data

Liquid layers in clouds affect their microphysical processes, as well as the atmospheric energy budget. However, explicit liquid cloud base height (LCBH) detection algorithms using ground-based instruments (e.g., lidars) are currently absent in the literature. Most studies use either fixed lidar parameter thresholds or cloud base height data products that do not distinguish between ice and liquid, all of which might introduce inconsistencies and errors in the resolved LCBHs. In this paper, two LCBH detection algorithms are presented; the first algorithm uses the high spectral resolution lidar (HSRL) data, and yields satisfactory results. The second algorithm incorporates micropulse lidar (MPL) data for the LCBH detection. A 1-year long comparison of data gathered at Barrow, Alaska, and McMurdo Station, Antarctica, which includes other cloud base detection methodologies (ceilometer, MPL value-added product cloud base height, LCBHs detected using a fixed MPL depolarization threshold) emphasize the merits of the MPL algorithm.

Silber, Israel↗

An h-adaptive mesh method for Boltzmann-BGK/hydrodynamics coupling

We introduce a coupled method for hydrodynamic and kinetic equations on 2-dimensional h-adaptive meshes. We adopt the Euler equations with a fast kinetic solver in the region near thermodynamical equilibrium, while use the Boltzmann-BGK equation in kinetic regions where fluids are far from equilibrium. A buffer zone is created around the kinetic regions, on which a gradually varying numerical flux is adopted. Based on the property of a continuously discretized cut-off function which describes how the flux varies, the coupling will be conservative. In order for the conservative 2-dimensional specularly reflective boundary condition to be implemented conveniently, the discrete Maxwellian is approximated by a high order continuous formula with improved accuracy on a disc instead of on a square domain. The h-adaptive method can work smoothly with a time-split numerical scheme. Through h-adaptation, the cell number is greatly reduced. This method is particularly suitable for problems with hydrodynamics breakdown on only a small part of the whole domain, so that the total efficiency of the algorithm can be greatly improved. Three numerical examples are presented to validate the proposed method and demonstrate its efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resilience and fault tolerance in high-performance computing for numerical weather and climate prediction

Progress in numerical weather and climate prediction accuracy greatly depends on the growth of the available computing power. As the number of cores in top computing facilities pushes into the millions, increased average frequency of hardware and software failures forces users to review their algorithms and systems in order to protect simulations from breakdown. This report surveys hardware, application-level and algorithm-level resilience approaches of particular relevance to time-critical numerical weather and climate prediction systems. A selection of applicable existing strategies is analysed, featuring interpolation-restart and compressed checkpointing for the numerical schemes, in-memory checkpointing, user-level failure mitigation and backup-based methods for the systems. Numerical examples showcase the performance of the techniques in addressing faults, with particular emphasis on iterative solvers for linear systems, a staple of atmospheric fluid flow solvers. The potential impact of these strategies is discussed in relation to current development of numerical weather prediction algorithms and systems towards the exascale. Trade-offs between performance, efficiency and effectiveness of resiliency strategies are analysed and some recommendations outlined for future developments.

54 ENVIRONMENTAL SCIENCES↗

On the Search for Low W 0

The magnitude of the vacuum expectation value of the Gukov-Vafa-Witten superpotential |W o | plays a central role in the phenomenology of type IIB flux compactifications. Recent analytical constructions have shown that perturbatively flat vacua can be used to obtain very low values of |W o |. We present systematic algorithms to carry out exhaustive numerical searches for such vacua. Here we also analyse them in the statistical context, as part of the entire ensemble of type IIB flux vacua at low |W o |. Our preliminary analysis indicates that these perturbatively flat vacua are statistically sparse in the whole set of vacua at low |W o | as calculated by Denef and Douglas. Two-moduli examples are used to illustrate these more general findings in specific settings. We find that these simple (two moduli) cases are good examples for existence proofs but they do not feature a large statistical tuning freedom for phenomenological applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗