Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics & Computing”

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,009 records · Page 56

Electricity Capacity Expansion Modeling, Analysis, and Visualization. A Summary of High-Renewable Modeling Experience for China

Mathematical and computational models are widely used for the analysis and design of both physical and financial systems. Modeling the electric grid is of particular importance to China for three reasons. First, power-sector assets are expensive and long-lived, and they are critical to any country's development. China's electric load, transmission, and other energy-related infrastructure are expected to continue to grow rapidly; therefore it is crucial to understand and help plan for the future in which those assets will operate (NDRC ERI 2015). Second, China has dramatically increased its deployment of renewable energy (RE), and is likely to continue further accelerating such deployment over the coming decades. Careful planning and assessment of the various aspects (technical, economic, social, and political) of integrating a large amount of renewables on the grid is required. Third, companies need the tools to develop a strategy for their own involvement in the power market China is now developing, and to enable a possible transition to an efficient and high RE future.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

RELAP-7 Theory Manual

This document summarizes the physical models and mathematical formulations used in the RELAP-7 code.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Linear Solvers Overview

This document presents an overview of various mathematical solvers.

97 MATHEMATICS AND COMPUTING↗

Electricity Capacity Expansion Modeling, Analysis, and Visualization: A Summary of High-Renewable Modeling Experiences (Chinese Translation)

This is the Chinese translation of NREL/TP-6A20-64831. Mathematical and computational models are widely used for the analysis and design of both physical and financial systems. Modeling the electric grid is of particular importance to China for three reasons. First, power-sector assets are expensive and long-lived, and they are critical to any country's development. China's electric load, transmission, and other energy-related infrastructure are expected to continue to grow rapidly; therefore it is crucial to understand and help plan for the future in which those assets will operate. Second, China has dramatically increased its deployment of renewable energy (RE), and is likely to continue further accelerating such deployment over the coming decades. Careful planning and assessment of the various aspects (technical, economic, social, and political) of integrating a large amount of renewables on the grid is required. Third, companies need the tools to develop a strategy for their own involvement in the power market China is now developing, and to enable a possible transition to an efficient and high RE future.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Contextual Multi-armed Bandits under Feature Uncertainty

We study contextual multi-armed bandit problems under linear realizability on rewards and uncertainty (or noise) on features. For the case of identical noise on features across actions, we propose an algorithm, coined NLinRel, having O(T⁷/₈(log(dT)+K√d)) regret bound for T rounds, K actions, and d-dimensional feature vectors. Next, for the case of non-identical noise, we observe that popular linear hypotheses including NLinRel are impossible to achieve such sub-linear regret. Instead, under assumption of Gaussian feature vectors, we prove that a greedy algorithm has O(T²/₃√log d)regret bound with respect to the optimal linear hypothesis. Utilizing our theoretical understanding on the Gaussian case, we also design a practical variant of NLinRel, coined Universal-NLinRel, for arbitrary feature distributions. It first runs NLinRel for finding the ‘true’ coefficient vector using feature uncertainties and then adjust it to minimize its regret using the statistical feature information. We justify the performance of Universal-NLinRel on both synthetic and real-world datasets.

97 MATHEMATICS AND COMPUTING↗

Fast Approximate Union Volume in High Dimensions with Line Samples

The classical problem of calculating the volume of the union of d-dimensional balls is known as "Union Volume." We present line-sampling approximation algorithms for Union Volume. Our methods may be extended to other Boolean operations, such as setminus; or to other shapes, such as hyper-rectangles. The deterministic, exact approaches for Union Volume do not scale well to high dimensions. However, we adapt several of these exact approaches to approximation algorithms based on sampling. We perform local sampling within each ball using lines. We have several variations, depending on how the overlapping volume is partitioned, and depending on whether radial, axis-aligned, or other line patterns are used. Our variations fall within the family of Monte Carlo sampling, and hence have about the same theoretical convergence rate, 1 /$\sqrt{M}$, where M is the number of samples. In our limited experiments, line-sampling proved more accurate per unit work than point samples, because a line sample provides more information, and the analytic equation for a sphere makes the calculation almost as fast. We performed a limited empirical study of the efficiency of these variations. We suggest a more extensive study for future work. We speculate that different ball arrangements, differentiated by the distribution of overlaps in terms of volume and degree, will benefit the most from patterns of line samples that preferentially capture those overlaps. Acknowledgement We thank Karl Bringman for explaining his BF-ApproxUnion (ApproxUnion) algorithm [3] to us. We thank Josiah Manson for pointing out that spoke darts oversample the center and we might get a better answer by uniform sampling. We thank Vijay Natarajan for suggesting random chord sampling. The authors are grateful to Brian Adams, Keith Dalbey, and Vicente Romero for useful technical discussions. This work was sponsored by the Laboratory Directed Research and Development (LDRD) Program at Sandia National Laboratories. This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research (ASCR), Applied Mathematics Program. Sandia National Laboratories is a multi-mission laboratory managed and operated by National Technology and Engineering Solutions of Sandia, LLC., a wholly owned subsidiary of Honeywell International, Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

97 MATHEMATICS AND COMPUTING↗

Design, analysis and numerical experiments for the virtual element p and hp approximations of elliptic eigenvalue problems

We discuss the p- and the hp-versions of the virtual element method for the approximation of the eigenvalues of elliptic operators with a potential term on polygonal meshes. An application of this model is provided by the Schr¨odinger equation with a pseudo-potential term. We present in details the analysis of the p-version of the method, proving the exponential convergence in the case of analytic eigenfunctions. The theoretical results are supplied with a wide set of experiments. We also show numerically that, in the case of eigenfunctions with finite Sobolev regularity, an exponential approximation of the eigenvalues in terms of the cubic root of the number of degrees of freedom can be obtained by employing hp-refinements. Importantly, the geometric flexibility of polygonal meshes is exploited in the construction of the hp-spaces.

97 MATHEMATICS AND COMPUTING↗

The Potential of Quantum Annealing for Rapid Solution Structure Identification [Slides]

This presentation covers a framework for categorizing heuristics including neighborhood size, iterated local search, and performance metrics. The question, "How does Quantum Annealing stack up?" is addressed through Random with Fields (RANF-1), Biased Ferromagnet (BFM), and Corrupted Biased Ferromagnet (CBFM). Concluding thoughts are then given.

97 MATHEMATICS AND COMPUTING↗

Nonequilibrium Physics of Multiphase Flow in Porous Media: Wettability and Disorder

Carbon capture and geologic storage, dissociation of methane hydrates in permafrost, enhanced oil recovery, and water dropout in low-temperature fuel cells, all have something in common: two or more fluids flow simultaneously through a porous medium; and the displacement of one fluid by another is often unstable (either due to gravity or viscous forces). Yet, our ability to model multiphase flow in porous media has remained a challenge. The traditional equations are unable to predict, explain, or even reproduce, the formation of the complex patterns observed in experiments. The overarching goal of the project is to develop new physical understanding of the role of wettability and disorder in multiphase flow through permeable media, and to develop new mathematical and computational models at the pore scale and at the continuum scale.

58 GEOSCIENCES↗

Remapping of Data Between One-Dimensional Meshes

In this report we present two approaches to data remapping between one-dimensional meshes implemented with the c++ programming language. Our goal was to test the performance of two search algorithms, linear and binary, and verify the accuracy of our implementations of the two methods. We first introduce the concept of data remap and meshing components, as well as their various uses. We then delve into the differences between point-wise and conservative remap, the algorithms used in the implementations, and lastly confirm the implementations work as intended when given various inputs. We expect that, after profiling, the binary search algorithm will be more efficient than the linear algorithm for sorted sets of data, the point-wise remap implementation to accurately approximate the data transfer between two meshes, and the conservative remap implementation to conserve the area underneath the curve of two distinct meshes.

97 MATHEMATICS AND COMPUTING↗

Data Remapping Between One-Dimensional Meshes [Slides]

Two different remapping algorithms were implemented: point wise (node-to-node date remapping) and conservative (conserves the area under the curve. The performance of both linear and binary searches were studied and it was found that the binary search was more efficient.

97 MATHEMATICS AND COMPUTING↗