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,333 records · Page 74

A Novel Matching Formulation for Startup Costs in Unit Commitment

We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both the proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. The proposed formulation is tested empirically against existing formulations on large-scale unit commitment instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening reduces the computational burden in comparison to existing formulations, especially for UC instances with large variability in net-load due to renewables production.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

Novikau, I [Lawrence Livermore National Laboratory↗

Application of quantum mechanics/molecular mechanics methods in the study of enzymatic reaction mechanisms

Quantum mechanics/molecular mechanics ( QM / MM ) methods offer a very appealing option for the computational study of enzymatic reaction mechanisms, by separating the problem into two parts that can be treated with different computational methods. Hence, in a QM / MM formalism, the part of the system in which catalysis actually occurs and that involves the active site, substrates and directly participating amino acid residues is treated at an adequate quantum mechanical level to describe the chemistry taking place. For the remaining of the enzyme, which does not participate directly in the reaction, but that typically involves a much larger number of atoms, molecular mechanics is employed, traditionally through the application of a biomolecular force field. When applied with care, QM / MM methods can be used with great advantage in comparing, at a structural and energetic level, different mechanistic proposals, discarding mechanistic alternatives and proposing new mechanistic pathways that are consistent with the available experimental data. With time, diverse flavors within the QM / MM methods have emerged, differing in a variety of technical and conceptual aspects. Hence present alternatives differ between additive and subtractive QM / MM schemes, the type of boundary schemes, and the way in which the electrostatic interactions between the two regions are accounted for. Also, single‐conformation QM / MM , multi‐ PES approaches, and QM / MM Molecular Dynamics coexist today, each type with its own advantages and limitations. This review focuses on the application of QM / MM methods in the study of enzymatic reaction mechanisms, briefly presenting also the most important technical aspects involved in these calculations. Particular attention is dedicated to the application of the single‐conformation QM / MM , multi‐ PES QM / MM studies, and QM / MM‐FEP methods and to the advantages and disadvantages of the different types of QM / MM . Recent breakthroughs are also introduced. A selection of hand‐picked examples is used to illustrate such features. WIREs Comput Mol Sci 2017, 7:e1281. doi: 10.1002/wcms.1281 This article is categorized under: Structure and Mechanism > Computational Biochemistry and Biophysics Structure and Mechanism > Reaction Mechanisms and Catalysis Electronic Structure Theory > Combined QM/MM Methods

Sousa, Sérgio Filipe↗

Solvability of Nonlinear Inverse Problem for Hyperbolic Equation

We consider the nonlinear inverse problem for a second order hyperbolic equation with unknown coefficient depending on the time. We establish the existence and uniqueness of regular solutions which are used for constructing a soltuion to the inverse problem under consideration.

97 MATHEMATICS AND COMPUTING↗

Probing the structure of complex solids using a distributed computing approach-Applications in zeolite science

We demonstrate the viability of distributed computing techniques employing idle desktop computers in investigating complex structural problems in solids. Through the use of a combined Monte Carlo and energy minimisation method, we show how a large parameter space can be effectively scanned. By controlling the generation and running of different configurations through a database engine, we are able to not only analyse the data 'on the fly' but also direct the running of jobs and the algorithms for generating further structures. As an exemplar case, we probe the distribution of Al and extra-framework cations in the structure of the zeolite Mordenite. We compare our computed unit cells with experiment and find that whilst there is excellent correlation between computed and experimentally derived unit cell volumes, cation positioning and short-range Al ordering (i.e. near neighbour environment), there remains some discrepancy in the distribution of Al throughout the framework. We also show that stability-structure correlations only become apparent once a sufficiently large sample is used. - Graphical Abstract: Aluminium distributions in zeolites are determined using e-science methods. Highlights: > Use of e-science methods to search configurationally space. > Automated control of space searching. > Identify key structural features conveying stability. > Improved correlation of computed structures with experimental data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum algorithms for conformal bootstrap

With the help of recent developments in quantum algorithms for semidefinite programming, we discuss the possibility for quantum speedup for the numerical conformal bootstrap in conformal field theory. We show that quantum algorithms may have significant improvement in the computational performance for several numerical bootstrap problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Duality-Free Decomposition Based Data-Driven Stochastic Security-Constrained Unit Commitment

To incorporate the superiority of both stochastic and robust approaches, a data-driven stochastic optimization is employed to solve the security-constrained unit commitment model. This approach makes the most use of the historical data to generate a set of possible probability distributions for wind power outputs and then it optimizes the unit commitment under the worst-case probability distribution. However, this model suffers from huge computational burden, as a large number of scenarios are considered. To tackle this issue, a duality-free decomposition method is proposed in this paper. This approach does not require doing duality, which can save a large set of dual variables and constraints, and therefore reduces the computational burden. In addition, the inner max-min problem has a special mathematical structure, where the scenarios have the similar constraint. Thus, the max-min problem can be decomposed into independent sub-problems to be solved in parallel, which further improves the computational efficiency. A numerical study on an IEEE 118-bus system with practical data of a wind power system has demonstrated the effectiveness of the proposal.

42 ENGINEERING↗

Non-smooth Bayesian optimization in tuning scientific applications

Tuning algorithmic parameters to optimize the performance of large, complicated computational codes is an important problem involving finding the optima and identifying regimes defined by non-smooth boundaries in black-box functions. Within the Bayesian optimization framework, the Gaussian process surrogate model produces smooth mean functions, but functions in the tuning problem are often non-smooth, which is exacerbated by the fact that we usually have limited sequential samples from the black-box function. Here, motivated by these issues encountered in tuning, we propose a novel Gaussian process model called a clustered Gaussian process (cGP), where the components are dynamically updated by clustering. In our studies, the performance of cGP can be better than stationary GPs in nearly 90% of the experiments and better than non-stationary GPs in nearly 70% of the repeated experiments while requiring less computational cost. cGP provides a novel approach for dynamic GP, computes more efficiently than recursive partitioning, and discovers non-smoothness regimes. We provide extensive experiments including high-performance computing (HPC) and industrial simulation functions to show the effectiveness of our methods.

97 MATHEMATICS AND COMPUTING↗

PHYSICS OF ECLIPSING BINARIES. II. TOWARD THE INCREASED MODEL FIDELITY

The precision of photometric and spectroscopic observations has been systematically improved in the last decade, mostly thanks to space-borne photometric missions and ground-based spectrographs dedicated to finding exoplanets. The field of eclipsing binary stars strongly benefited from this development. Eclipsing binaries serve as critical tools for determining fundamental stellar properties (masses, radii, temperatures, and luminosities), yet the models are not capable of reproducing observed data well, either because of the missing physics or because of insufficient precision. This led to a predicament where radiative and dynamical effects, insofar buried in noise, started showing up routinely in the data, but were not accounted for in the models. PHOEBE (PHysics Of Eclipsing BinariEs; http://phoebe-project.org) is an open source modeling code for computing theoretical light and radial velocity curves that addresses both problems by incorporating missing physics and by increasing the computational fidelity. In particular, we discuss triangulation as a superior surface discretization algorithm, meshing of rotating single stars, light travel time effects, advanced phase computation, volume conservation in eccentric orbits, and improved computation of local intensity across the stellar surfaces that includes the photon-weighted mode, the enhanced limb darkening treatment, the better reflection treatment, and Doppler boosting. Here we present the concepts on which PHOEBE is built and proofs of concept that demonstrate the increased model fidelity.

79 ASTRONOMY AND ASTROPHYSICS↗

How Gamification will change Business Intelligence

In 1958, William Higginbotham was part of the Brookhaven National Laboratory (BNL) Instrumentation Division. In those days, BNL hosted a visitors day each fall. This was an opportunity for thousands of visitors to come and tour the lab and get a better understanding of the capabilities and operations at a nuclear research facility. William Higinbotham wanted to do something that would impress the audience as well as demonstrate the capabilities of the instrumentation division. Higinbotham came up with an idea that would allow the audience to play a simulated game of table tennis. By utilizing an analog computer and an oscilloscope, Higinbotham created the first publically available video game. The game was very simple and simulated the vertical side of a tennis court, the edge of the floor with the edge of the net perpendicular, on a screen. Each player had a button and a rotating knob. Rotating the knob would change the angle of the bar controlling the ball; pressing the button sent the ball toward the opposite side of the court. If the ball hit the net, it rebounded at an unexpected angle. If the ball went over and was not hit back, it would hit the floor and bounce again at a natural angle. If it disappeared off the screen, a reset button could be pressed, causing the ball to reappear and remain stationary until the user pressed the button to send the ball flying back across the net. Higginbotham recounted that "it was a simple design. Back then, analog computers were used to work out all kinds of mechanical problems. They didn't have the accuracy of digital computers, which were very crude at the time, but then you don't need a great deal of precision to play TV games. " The game was wildly successful and Higinbotham could tell from the crowd’s reaction that he had developed something very special. From the days of Higinbotham’s rudimentary version of the classic game Pong, video games have matured and become much more complex. Not only has the technology advanced, allowing for better graphics, sound and game play, but also significant research has been done in the area of game mechanics. “Game mechanics are rule based systems that facilitate and encourage a user to explore and learn the properties of their possibility space through the use of feedback mechanisms.” (Koster, 2004) As these game mechanics become better understood, they are being applied to areas outside of the realm of video game development. Game mechanics have become the basis for understanding the psychological drivers of users in the digital world. Business Intelligence, part of this digital experience, can learn some great lessons in how to engage users and revolutionize the user experience through the application of these game mechanics. In the tradition of BNL’s innovative spirit and as a sister laboratory in the Department of Energy laboratory complex, Idaho National Laboratory (INL) looks to determine how we can enhance the user experience through the effective application of game mechanics to Business Intelligence to meet the needs of our business.

99 GENERAL AND MISCELLANEOUS↗

Eject, crash, or survive: Using machine learning to predict orbital instability of exoplanetary systems

Astronomers throughout history, including titans like Kepler and Newton, have tackled planetary dynamics and orbital instability. Despite strides taken in research, understanding the evolution of planetary orbits remains an intricate, computationally expensive, and analytically unsolved problem. I apply machine learning classification methods to numerical simulations of planetary systems in order to predict the long-term fate of the planet - whether the planet remains in a stable orbit or not. My method uses the first 41.1 years (≤ 500 orbits) of data from a planet’s simulation to calculate 17 dynamically-motivated metrics; I trained my classifier on these features to predict a planet’s stability after 107 years. At 84.33%, my classifier was comparable in accuracy to pre-existing literature, despite using significantly less computational power than most other methods. In my research, I found that the standard deviation of eccentricity, mass ratios for neighboring planets, and semi-major axis ratio with the outer planet neighbor to be the most predictive features of instability. I propose reasons for the importance of these features, their role in planetary dynamics, as well as possible explanations for why some planets were misclassified. By understanding the important metrics of instability and reasons for misclassification, we can begin to understand more about system architectures, orbital motion and dynamics, and the formation and evolution of the exoplanetary systems. This is applicable in our own Solar System, and with exoplanet discovery missions such as TESS, this research becomes especially relevant in understanding the new exoplanetary systems we discover.

79 ASTRONOMY AND ASTROPHYSICS↗

Eject, crash, or survive: Using machine learning to predict orbital instability of exoplanetary systems

Astronomers throughout history, including titans like Kepler and Newton, have tackled planetary dynamics and orbital instability. Despite strides taken in research, understanding the evolution of planetary orbits remains an intricate, computationally expensive, and analytically unsolved problem. I apply machine learning classification methods to numerical simulations of planetary systems in order to predict the long-term fate of the planet - whether the planet remains in a stable orbit or not. My method uses the first 41.1 years (≤ 500 orbits) of data from a planet’s simulation to calculate 17 dynamically-motivated metrics; I trained my classifier on these features to predict a planet’s stability after 107 years. At 84.33%, my classifier was comparable in accuracy to pre-existing literature, despite using significantly less computational power than most other methods. In my research, I found that the standard deviation of eccentricity, mass ratios for neighboring planets, and semi-major axis ratio with the outer planet neighbor to be the most predictive features of instability. I propose reasons for the importance of these features, their role in planetary dynamics, as well as possible explanations for why some planets were misclassified. By understanding the important metrics of instability and reasons for misclassification, we can begin to understand more about system architectures, orbital motion and dynamics, and the formation and evolution of the exoplanetary systems. This is applicable in our own Solar System, and with exoplanet discovery missions such as TESS, this research becomes especially relevant in understanding the new exoplanetary systems we discover.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗

Generalized Perturbation Theory-Free Sensitivity Analysis for Eigenvalue Problems

Generalized perturbation theory (GPT) has been recognized as the most computationally efficient approach for performing sensitivity analysis for models with many input parameters, which renders forward sensitivity analysis computationally overwhelming. In critical systems, GPT involves the solution of the adjoint form of the eigenvalue problem with a response-dependent fixed source. Although conceptually simple to implement, most neutronics codes that can solve the adjoint eigenvalue problem do not have a GPT capability unless envisioned during code development. We introduce in this manuscript a reduced-order modeling approach based on subspace methods that requires the solution of the fundamental adjoint equations but allows the generation of response sensitivities without the need to set up GPT equations, and that provides an estimate of the error resulting from the reduction. Moreover, the new approach solves the eigenvalue problem independently of the number or type of responses. This allows for an efficient computation of sensitivities when many responses are required. This paper introduces the theory and implementation details of the GPT-free approach and describes how the errors could be estimated as part of the analysis. The applicability is demonstrated by estimating the variations in the flux distribution everywhere in the phase space of a fast critical sphere and a high-temperature gas-cooled reactor prismatic lattice. The variations generated by the GPT-free approach are benchmarked to the exact variations generated by direct forward perturbations.

99 GENERAL AND MISCELLANEOUS↗

Model dynamics for quantum computing

A model master equation suitable for quantum computing dynamics is presented. In an ideal quantum computer (QC), a system of qubits evolves in time unitarily and, by virtue of their entanglement, interfere quantum mechanically to solve otherwise intractable problems. In the real situation, a QC is subject to decoherence and attenuation effects due to interaction with an environment and with possible short-term random disturbances and gate deficiencies. The stability of a QC under such attacks is a key issue for the development of realistic devices. We assume that the influence of the environment can be incorporated by a master equation that includes unitary evolution with gates, supplemented by a Lindblad term. Lindblad operators of various types are explored; namely, steady, pulsed, gate friction, and measurement operators. In the master equation, we use the Lindblad term to describe short time intrusions by random Lindblad pulses. The phenomenological master equation is then extended to include a nonlinear Beretta term that describes the evolution of a closed system with increasing entropy. An external Bath environment is stipulated by a fixed temperature in two different ways. Here we explore the case of a simple one-qubit system in preparation for generalization to multi-qubit, qutrit and hybrid qubit–qutrit systems. This model master equation can be used to test the stability of memory and the efficacy of quantum gates. The properties of such hybrid master equations are explored, with emphasis on the role of thermal equilibrium and entropy constraints. Several significant properties of time-dependent qubit evolution are revealed by this simple study. - Highlights: • General realistic density matrix evolution model shown for one qubit. • Unitary pulses & bias yield quantum gates without harmful phase accumulations. • Gate friction, dissipation included by random Lindblad noise pulses. • Bath & entropy terms yield equilibrium; test algorithms, gates act on Larmor grid. • Measurement modeled by strong, fast Lindblad pulses.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CHARM-SYCL: New Unified Programming Environment for Multiple Accelerator Types

Addressing performance portability across diverse accelerator architectures has emerged as a major challenge in the development of application and programming systems for high-performance computing environments. Although recent programming systems that focus on performance portability have significantly improved productivity in an effort to meet this challenge, the problem becomes notably more complex when compute nodes are equipped with multiple accelerator types—each with unique performance attributes, optimal data layout, and binary formats. To navigate the intricacies of multi-accelerator programming, we propose CHARM-SYCL as an extension of our CHARM multi-accelerator execution environment [27]. This environment will combine our SYCL-based performance-portability programming front end with a back end for extremely heterogeneous architectures as implemented with the IRIS runtime from Oak Ridge National Laboratory. Our preliminary evaluation indicates potential productivity boost and reasonable performance compared to vendor-specific programming system and runtimes.

Fujita, Norihisa↗

HamPerf: A Hamiltonian-Oriented Approach to Quantum Benchmarking

Quantum computing technologies are undergoing rapid development. The different qubit modalities being considered for quantum computing each have their strengths and weaknesses, making it challenging to compare their performance relative to each other and the state-of-the-art in classical high-performance computing. To better understand the utility of a given quantum processor and to assess when and how it will be able to advance the frontiers of computational science, researchers need a robust approach to quantum benchmarking. A variety of approaches have been proposed, many of which characterize the presence of noise in current quantum devices. These efforts include component-level performance metrics, such as randomized benchmarking and gate set tomography; high-level application-dependent metrics; and devicelevel metrics, such as the Quantum Volume. However, it remains unclear how low-level metrics, such as fidelities and decoherence times, and global device metrics, such as Quantum Volume, relate to the computational utility and practical limitations of quantum processors to solve useful problems. In this paper, we describe our Hamiltonian-oriented approach to quantum benchmarking called HamPerf. Where previous application-dependent approaches specify a suite of benchmarking circuits inspired by applications, we place the problem Hamiltonian at the center. Our strategy allows us to probe the computational performance of a quantum processor on standardized and relevant problem sets, agnostic of the algorithms and hardware used to solve them; it also provides fundamental insights into how device characteristics correlate with computational utility.

Butko, Anastasiia↗