Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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,207 records · Page 67

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimating building simulation parameters via Bayesian structure learning

Many key building design policies are made using sophisticated computer simulations such as EnergyPlus (E+), the DOE flagship whole-building energy simulation engine. E+ and other sophisticated computer simulations have several major problems. The two main issues are 1) gaps between the simulation model and the actual structure, and 2) limitations of the modeling engine's capabilities. Currently, these problems are addressed by having an engineer manually calibrate simulation parameters to real world data or using algorithmic optimization methods to adjust the building parameters. However, some simulations engines, like E+, are computationally expensive, which makes repeatedly evaluating the simulation engine costly. This work explores addressing this issue by automatically discovering the simulation's internal input and output dependencies from ~20 Gigabytes of E+ simulation data, future extensions will use ~200 Terabytes of E+ simulation data. The model is validated by inferring building parameters for E+ simulations with ground truth building parameters. Our results indicate that the model accurately represents parameter means with some deviation from the means, but does not support inferring parameter values that exist on the distribution's tail.

Edwards, Richard E.↗

Estimating Building Simulation Parameters via Bayesian Structure Learning

Many key building design policies are made using sophisticated computer simulations such as EnergyPlus (E+), the DOE flagship whole-building energy simulation engine. E+ and other sophisticated computer simulations have several major problems. The two main issues are 1) gaps between the simulation model and the actual structure, and 2) limitations of the modeling engine's capabilities. Currently, these problems are addressed by having an engineer manually calibrate simulation parameters to real world data or using algorithmic optimization methods to adjust the building parameters. However, some simulations engines, like E+, are computationally expensive, which makes repeatedly evaluating the simulation engine costly. This work explores addressing this issue by automatically discovering the simulation's internal input and output dependencies from 20 Gigabytes of E+ simulation data, future extensions will use 200 Terabytes of E+ simulation data. The model is validated by inferring building parameters for E+ simulations with ground truth building parameters. Our results indicate that the model accurately represents parameter means with some deviation from the means, but does not support inferring parameter values that exist on the distribution's tail.

Energy Modeling↗

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗

High-throughput cancer hypothesis testing with an integrated PhysiCell-EMEWS workflow

BackgroundCancer is a complex, multiscale dynamical system, with interactions between tumor cells and non-cancerous host systems. Therapies act on this combined cancer-host system, sometimes with unexpected results. Systematic investigation of mechanistic computational models can augment traditional laboratory and clinical studies, helping identify the factors driving a treatment's success or failure. However, given the uncertainties regarding the underlying biology, these multiscale computational models can take many potential forms, in addition to encompassing high-dimensional parameter spaces. Therefore, the exploration of these models is computationally challenging. We propose that integrating two existing technologiesone to aid the construction of multiscale agent-based models, the other developed to enhance model exploration and optimizationcan provide a computational means for high-throughput hypothesis testing, and eventually, optimization.ResultsIn this paper, we introduce a high throughput computing (HTC) framework that integrates a mechanistic 3-D multicellular simulator (PhysiCell) with an extreme-scale model exploration platform (EMEWS) to investigate high-dimensional parameter spaces. We show early results in applying PhysiCell-EMEWS to 3-D cancer immunotherapy and show insights on therapeutic failure. We describe a generalized PhysiCell-EMEWS workflow for high-throughput cancer hypothesis testing, where hundreds or thousands of mechanistic simulations are compared against data-driven error metrics to perform hypothesis optimization.ConclusionsWhile key notational and computational challenges remain, mechanistic agent-based models and high-throughput model exploration environments can be combined to systematically and rapidly explore key problems in cancer. These high-throughput computational experiments can improve our understanding of the underlying biology, drive future experiments, and ultimately inform clinical practice.

Agent-based model↗

Modeling tangential injection into ideal tubular flames

This paper provides the theoretical basis for modeling tangential injection into ideal tubular flames. For most practical tubular combustors, the present formulation provides significant advantages compared to the traditional model formulation. The mass, momentum, and energy associated with tangential injectors are represented as Gaussian-shaped source terms in the appropriate conservation equations. Incorporating the source terms alters the governing equations, but does not affect the similarity properties associated with ideal tubular flow. The system of equations form a nonlinear boundary-value problem, which can be solved computationally. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advances and opportunities in materials science for scalable quantum computing

We report that by harnessing unique quantum mechanical phenomena, such as superposition and entanglement, quantum computers offer the possibility to drastically outperform classical computers for certain classes of problems. The realization of this potential, however, presents a substantial challenge, because noise and imperfections associated with the materials used to fabricate devices can obscure the delicate quantum mechanical effects that enable quantum computing. Hence, progress in synthesis, characterization, and modeling of materials for quantum computing have driven many exciting advances in recent years and will become increasingly important in the years to come. As progressively more complex, multi-qubit systems come online, and as significant government and industrial investment drives research forward, new challenges and opportunities for materials science continue to emerge. The articles in this issue survey the current state of materials science progress and obstacles for some leading quantum computing platforms; opportunities for deeper involvement by materials scientists abound. Ultimate realization of the full potential of quantum computers will require a multidisciplinary effort spanning many traditional areas of expertise.

36 MATERIALS SCIENCE↗

The parallelism motifs of genomic data analysis

Genomic datasets are growing dramatically as the cost of sequencing continues to decline and small sequencing devices become available. Enormous community databases store and share these data with the research community, but some of these genomic data analysis problems require large-scale computational platforms to meet both the memory and computational requirements. These applications differ from scientific simulations that dominate the workload on high-end parallel systems today and place different requirements on programming support, software libraries and parallel architectural design. For example, they involve irregular communication patterns such as asynchronous updates to shared data structures. We consider several problems in high-performance genomics analysis, including alignment, profiling, clustering and assembly for both single genomes and metagenomes. We identify some of the common computational patterns or ‘motifs’ that help inform parallelization strategies and compare our motifs to some of the established lists, arguing that at least two key patterns, sorting and hashing, are missing. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.

59 BASIC BIOLOGICAL SCIENCES↗

Extension and Demonstration of NEAMS Multiphysics Tools to Lead-Cooled, Sodium-Cooled, and Molten Salt Fast Reactor Applications

The SHARP toolkit is a high-fidelity reactor simulation tool developed under the U.S. Department of Energy, Office of Nuclear Energy Advanced Modeling and Simulation (NEAMS) Campaign. SHARP toolkit is comprised of the neutronics module PROTEUS thermal hydraulics module Nek5000, and structural mechanics module Diablo. During FY17 and FY18, the PROTEUS and Nek5000 components of SHARP were applied to solve challenging sodium-cooled fast reactor (SFR) problems. In particular, selected hot channel factors (HCF) for a prototype metal-fueled SFR design (the AFR-100) were analyzed in high fidelity, and the “SHARP zooming capability” for SFRs was developed and demonstrated to reduce computational expense for full core problems in cases where detailed data is needed in selected fuel assemblies. After the previous success applying SHARP to challenging SFR problems, the focus in FY19 expanded to additional fast reactor applications: lead cooled fast reactors (LFR), sodium cooled fast reactors (SFR), and fast molten salt reactors (MSR). The specific technical tasks were (1) assessment of hot channel factors for LFR, for which no data currently exists, (2) implementation of a gamma transport capability in the PROTEUS solvers to extend the zooming capability to non-fueled assemblies, (3) demonstration of zooming capability in assemblies of the Versatile Test Reactor (VTR), and (4) development of a new coupled capability for simulating fast MSRs, specifically modeling precursor transport inside and outside the core. The progress on tasks (1) and (3) are discussed primarily in this document. Tasks (2) and (4) are briefly mentioned in this document, and the interested reader is referred to separate reports for detailed information. First-of-a-kind hot channel factor (HCF) estimation for LFR with high fidelity codes (PROTEUS/Nek5000) was successfully demonstrated in this study. Selected HCF were computed and compared with SFR data (AFR-100, EBR-II). The findings confirm that different reactor types, design parameters and uncertainties lead to different HCFs. Careful estimation of HCF for a specific design is necessary to obtain appropriate HCFs. In addition to improvement in HCF accuracy, high fidelity tools generate data to help the designer better understand the mechanism of the impact from these uncertainties. For example, the impact of cladding thickness manufacturing tolerance resulted in non-intuitive effects in the corner pins of the LFR assembly. This procedure of computing HCF using high fidelity models shows promise and flexibility for being repeated for any arbitrary reactor of choice, since these tools are targeted to solve many reactor types and geometries. Progress was made towards extending the previously demonstrated SHARP zooming capability to non-fueled SFR assemblies. In particular, a gamma transport capability was implemented in both high fidelity PROTEUS solvers in order to accurately account for heat deposition caused by gamma particles, which accounts for ~10% of total core power. Neutronics verification cases were carried out for a candidate Versatile Test Reactor (VTR) design using the new gamma transport capability in PROTEUS. Comparisons were made with continuous energy MCNP calculations and shown to agree well. The models for the full core design with heterogeneous control and fuel assemblies is in progress and will be completed in FY20. In the fast molten salt reactor (MSR) domain, a new capability was developed to model the flow of neutron precursors both inside and outside of the core, which impacts the effective delayed neutron fraction of the system. The PROTEUS-SN and PROTEUS-NODAL solvers were coupled to Nek5000 in order to simulate precursor flow. The workflows were demonstrated on test problems. The fast MSR modeling capability was supported under two other work packages, and comprehensive details are included in a separate report.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Demonstration of NEAMS Multiphysics Tools for Fast Reactor Applications

The SHARP toolkit is a high-fidelity reactor simulation tool developed under the U.S. Department of Energy, Office of Nuclear Energy Advanced Modeling and Simulation (NEAMS) Campaign. SHARP toolkit is comprised of the neutronics module PROTEUS thermal hydraulics module Nek5000, and structural mechanics module Diablo. During FY17 and FY18, the PROTEUS and Nek5000 components of SHARP were applied to solve challenging sodium-cooled fast reactor (SFR) problems. In particular, selected hot channel factors (HCF) for a prototype metal-fueled SFR design (the AFR-100) were analyzed in high fidelity, and the “SHARP zooming capability” for SFRs was developed and demonstrated to reduce computational expense for full core problems in cases where detailed data is needed in selected fuel assemblies. After the previous success applying SHARP to challenging SFR problems, the focus in FY19 and FY20 expanded to additional fast reactor applications including lead cooled fast reactors (LFR) and sodium cooled fast reactors (SFR). The specific technical tasks were (1) assessment of hot channel factors for LFR, for which no data currently exists, and (2) demonstration of zooming capability in assemblies of the Versatile Test Reactor (VTR). First-of-a-kind hot channel factor (HCF) estimation for LFR with high fidelity codes (PROTEUS/Nek5000) was successfully demonstrated in this study which began in FY19 and continued in FY20. Selected HCF were computed and compared with SFR data (AFR-100, EBR-II). The findings confirm that different reactor types, design parameters and uncertainties lead to different HCFs. Careful estimation of HCF for a specific design is necessary to obtain appropriate HCFs. In addition to improvement in HCF accuracy, high fidelity tools generate data to help the designer better understand the mechanism of the impact from these uncertainties. For example, the impact of cladding thickness manufacturing tolerance resulted in non-intuitive effects in the corner pins of the LFR assembly. This procedure of computing HCF using high fidelity models shows promise and flexibility for being repeated for any arbitrary reactor of choice. Along with the application on SFR and LFR, the capability of the tools has also been matured to deal with different reactor types and designs. Progress was made towards extending the previously demonstrated SHARP zooming capability to non-fueled SFR assemblies. In particular, in FY19 a gamma transport capability was implemented in both high fidelity PROTEUS solvers in order to accurately account for heat deposition caused by gamma particles, which accounts for ~10% of total core power. Neutronics verification cases were carried out for a candidate Versatile Test Reactor (VTR) design using the new gamma transport capability in PROTEUS. Comparisons were made with continuous energy MCNP calculations and shown to agree well. The models for the full core design with heterogeneous control and fuel assemblies is in progress for PROTEUS-SN and completed with MCNP. The MCNP power distributions were transferred to Nek5000 to perform thermal hydraulic calculations of the control and fuel assembly.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Computational and analytical comparison of flux discretizations for the semiconductor device equations beyond Boltzmann statistics

We compare three thermodynamically consistent numerical fluxes known in the literature, appearing in a Voronoï finite volume discretization of the van Roosbroeck system with general charge carrier statistics. Our discussion includes an extension of the Scharfetter–Gummel scheme to non-Boltzmann (e.g. Fermi–Dirac) statistics. It is based on the analytical solution of a two-point boundary value problem obtained by projecting the continuous differential equation onto the interval between neighboring collocation points. Hence, it serves as a reference flux. The exact solution of the boundary value problem can be approximated by computationally cheaper fluxes which modify certain physical quantities. One alternative scheme averages the nonlinear diffusion (caused by the non-Boltzmann nature of the problem), another one modifies the effective density of states. To study the differences between these three schemes, we analyze the Taylor expansions, derive an error estimate, visualize the flux error and show how the schemes perform for a carefully designed p-i-n benchmark simulation. We present strong evidence that the flux discretization based on averaging the nonlinear diffusion has an edge over the scheme based on modifying the effective density of states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast update algorithm for the quantum Monte Carlo simulation of the Hubbard model

This paper presents an efficient algorithm for computing the transition probability in auxiliary field quantum Monte Carlo simulations of strongly correlated electron systems using a Hubbard model. This algorithm is based on a low rank updating of the underlying linear algebra problem, and results in significant computational savings. The computational complexity of computing the transition probability and Green s function update reduces to O(k2) during the kth step, where k is the number of accepted spin flips, and results in an algorithm that is faster than the competing delayed update algorithm. Moreover, this algorithm is orders of magnitude faster than traditional algorithms that use naive updating of the Green s function matrix.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current state-of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be implemented in a high-performance but general way in XBraid and explored for more complicated problems. We will additionally research, as time allows, improvements to these techniques, as well as multigrid relaxation techniques based on Least Squares Shadowing (LSS by Wang) and a nonintrusive block tridiagonal solver based on MGRIT, called TriMGRIT.

97 MATHEMATICS AND COMPUTING↗

Automated searching for quantum subsystem codes

Quantum error correction allows for faulty quantum systems to behave in an effectively error-free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to active quantum error-correcting schemes as well as to the design of self-correcting quantum memories. Previous approaches for investigating these codes have focused on applying theoretical analysis to look for interesting codes and to investigate their properties. In this paper we present an alternative approach that uses computational analysis to accomplish the same goals. Specifically, we present an algorithm that computes the optimal quantum subsystem code that can be implemented given an arbitrary set of measurement operators that are tensor products of Pauli operators. We then demonstrate the utility of this algorithm by performing a systematic investigation of the quantum subsystem codes that exist in the setting where the interactions are limited to two-body interactions between neighbors on lattices derived from the convex uniform tilings of the plane.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

eXascale PRogramming Environment and System Software (XPRESS)

Exascale systems, with a thousand times the compute capacity of today’s leading edge petascale computers, are expected to emerge during the next decade. Their software systems will need to facilitate the exploitation of exceptional amounts of concurrency in applications, and ensure that jobs continue to run despite the occurrence of system failures and other kinds of hard and soft errors. Adapting computations at runtime to cope with changes in the execution environment, as well as to improve power and performance characteristics, is likely to become the norm. As a result, considerable innovation is required to develop system support to meet the needs of future computing platforms. The XPRESS project aims to develop and prototype a revolutionary software system for extreme-­scale computing for both exascale and strong­scaled problems. The XPRESS collaborative research project will advance the state-­of-­the-­art in high performance computing and enable exascale computing for current and future DOE mission-­critical applications and supporting systems. The goals of the XPRESS research project are to: A. enable exascale performance capability for DOE applications, both current and future, B. develop and deliver a practical computing system software X-­stack, OpenX, for future practical DOE exascale computing systems, and C. provide programming methods and environments for effective means of expressing application and system software for portable exascale system execution.

97 MATHEMATICS AND COMPUTING↗

PlantCV v2: Image analysis software for high-throughput plant phenotyping

Systems for collecting image data in conjunction with computer vision techniques are a powerful tool for increasing the temporal resolution at which plant phenotypes can be measured non-destructively. Computational tools that are flexible and extendable are needed to address the diversity of plant phenotyping problems. We previously described the Plant Computer Vision (PlantCV) software package, which is an image processing toolkit for plant phenotyping analysis. The goal of the PlantCV project is to develop a set of modular, reusable, and repurposable tools for plant image analysis that are open-source and community-developed. Here in this paper we present the details and rationale for major developments in the second major release of PlantCV. In addition to overall improvements in the organization of the PlantCV project, new functionality includes a set of new image processing and normalization tools, support for analyzing images that include multiple plants, leaf segmentation, landmark identification tools for morphometrics, and modules for machine learning.

59 BASIC BIOLOGICAL SCIENCES↗

A Computationally Efficient Algorithm for Computing Convex Hull Prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may execute side payments when a participant’s cost is not covered through energy sale settlements from locational marginal pricing schemes, or when a participant incurs lost opportunity costs to follow the dispatch signal. Convex hull pricing minimizes these and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. However, computing convex hull prices involves solving either a large-scale linear program - which in turn requires explicit descriptions of market participants’ convex hulls -or the Lagrangian dual of the corresponding non-convex scheduling problem. Here, we propose a computationally feasible and industrially scalable Benders decomposition approach to computing convex hull prices at least an order of magnitude faster than the current state-of-the-art while leveraging recent advances in convex hull formulations for thermal generating units.

61 RADIATION PROTECTION AND DOSIMETRY↗

An elementary optical logic circuit for quantum computing: a review

The classical computing has already done wonders with computation, however limitations on speed and security of transmitted information is endorsing novel computation techniques. Quantum computing is expected to resolve complex problems especially for unachievable speed with best possible secure communication. The logic gates for two Quantum bits (qubits) are one of the most important part of information processing in Quantum computing. Although photons are the best candidates for the processing of qubit but they need lots of nonlinear coupling to perform logic operations. Recent developments in the field of integrated optics showing promising signs for the development of Quantum networks and Quantum computation. In this article we have reviewed the technology of handling polarization encoded Qubit to perform logic operations and interconnections of logic circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗