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 469 records · Page 26

Generalized Multiscale Inversion for Heterogeneous Problems

In this work, we propose a generalized multiscale inversion algorithm for heterogeneous problems that aims at solving an inverse problem on a computational coarse grid. Previous inversion techniques for multiscale problems seek a coarse-grid medium properties, e.g., permeability and conductivity, and by doing so, they assume that there exists a homogenized representation of the underlying fine-scale permeability field on a coarse grid. Generally such assumptions do not hold for highly heterogeneous fields, e.g., fracture media or channelized fields, where the width of channels are very small compared to the scale of coarse grids. In these cases, grid refinement can lead to many degrees of freedom, and thus numerically unattractive to apply. The proposed algorithm is based on the Generalized Multiscale Finite Element Method (GMsFEM), which uses local spectral problems to identify non-localized features, i.e., channels (high-conductivity inclusions that connect the boundaries of the coarse-grid block). The inclusion of these features in the coarse space enables one to achieve a good accuracy. The approach is valid under the assumption that the solution can be well represented in a reduced-dimensional space spanned by multiscale basis functions. In practice, these basis functions are non-observable as we do not identify the fine-scale features of the permeability field. Our inversion algorithm finds the discretization parameters of the resulting system on the coarse grid. By doing so, we identify the appropriate coarse-grid parameters representing the permeability field instead of fine-grid permeability field. We illustrate the potential of the approach by numerical results for fractured media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational transport methodology based on decomposition of a problem domain into transport and diffusive subdomains

A large class of radiative transfer and particle transport problems contain highly diffusive regions. It is possible to reduce computational costs by solving a diffusion problem in diffusive subdomains instead of the transport equation. This enables one to decrease the dimensionality of the transport problem. In this paper we present a methodology for decomposition of a spatial domain of a transport problem into transport and diffusion subregions. We develop methods for solving one-group problems in 1D slab geometry. To identify and locate diffusive regions, we develop metrics for measuring transport effects that are based on the quasidiffusion (Eddington) factor. We present the results of test problems that demonstrate the accuracy of the proposed methodology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PhILMs: Collaboratory on Mathematics and Physics-Informed Learning Machines for Multiscale and Multiphysics Problems

The landscape of computational science and engineering is continually evolving, with the challenge of high-dimensional regression problems standing as a significant hurdle in numerous scientific endeavors. Addressing this challenge, our research, funded by this award, has led to the development of an innovative computational framework known as Probabilistic Partition of Unity Networks (PPOU-Nets). This initiative represents a collaborative effort to harness the potential of mathematics and physics-informed machine learning in tackling multiscale and multiphysics problems prevalent in high-dimensional spaces. Through this work, we have proposed a novel methodology that seamlessly integrates adaptive dimensionality reduction and a mixture of experts model, thereby facilitating a more efficient and accurate approximation of complex functions. This research effort has not only advanced the state of computational science but also opened new avenues for exploration in quantum computing and beyond. This report outlines the motivation, methodology, key findings, and implications of our work, underscoring our contributions to the broader scientific community and the potential pathways for future research.

97 MATHEMATICS AND COMPUTING↗

2019 Budget Request for the DOE Computational Science Graduate Fellowship (CSGF) Grant

The Department of Energy Computational Science Graduate Fellowship (DOE CSGF) is necessary to meet the continual challenging national workforce needs that arise as computational science and engineering problems continue to grow in scope and complexity. Computational science and engineering (CSE) is a multidisciplinary approach that uses scientific computing to solve practical problems methods and to supply technical tools across the scientific discovery spectrum. In particular, the DOE CSGF emphasizes high-performance computing (HPC) that enables CSE that advances science and engineering in directions important to the DOE and the economy in general. Over the past half-century, HPC has been an essential tool for DOE’s success. During this period, important missions, such as nuclear stockpile stewardship, have turned to HPC as an essential technology. Entire science disciplines, such as biology and cosmology, have been transformed through the augmentation of scientific observation via HPC. At government laboratories and in industry, DOE CSGF alumni are helping push traditional HPC boundaries while contributing to discoveries in high-energy physics, renewable energy, fusion-reactor design, additive manufacturing, nanomaterials for next-generation batteries and transistors, and turbine and advanced nuclear reactor modeling. In addition, HPC is used to address national health needs that will eventually point to cures both by helping cancer researchers manage and analyze huge troves of data, by simulating biological mechanisms, and by accelerating drug development — including continuing to rise to the challenge of pandemic-related research. A 2023 report from the ASCAC Subcommittee on American Competitiveness and Innovation to the ASCR office, “Can the United States Maintain Its Leadership in High-Performance Computing?” says of the Program, “The CSGF program provides a barometer for disciplines that will be of interest to future DOE computing.” An explosion in scientific and technological data has driven the need for increasingly sophisticated HPC to transform those data into scientific understanding. With access to more and more data and the proliferation of HPC, Machine Learning and Artificial Intelligence are experiencing a renaissance, complementing the now well-established use of computational simulation. Indeed, in its September 2020 subcommittee report on “AI/ML, Data Intensive Science and High-Performance Computing”, the DOE Advanced Scientific Computing Advisory Committee (ASCAC) explicitly called for a fellowship program to train computational and data scientists to tackle exascale and data-intensive computing challenges. This collaboration of empirical and theory-based modeling will increasingly inform federal policymakers whose decisions affect American society and future generations, and it requires highly skilled and intellectually agile computational scientists who can support the fast-moving DOE National Laboratory research environment. In fact, the DOE CSGF program has explicitly and consistently addressed this need.

97 MATHEMATICS AND COMPUTING↗

The complexity of NISQ

Abstract The recent proliferation of NISQ devices has made it imperative to understand their power. In this work, we define and study the complexity class , which encapsulates problems that can be efficiently solved by a classical computer with access to noisy quantum circuits. We establish super-polynomial separations in the complexity among classical computation, , and fault-tolerant quantum computation to solve some problems based on modifications of Simon’s problems. We then consider the power of for three well-studied problems. For unstructured search, we prove that cannot achieve a Grover-like quadratic speedup over classical computers. For the Bernstein-Vazirani problem, we show that only needs a number of queries logarithmic in what is required for classical computers. Finally, for a quantum state learning problem, we prove that is exponentially weaker than classical computers with access to noiseless constant-depth quantum circuits.

42 ENGINEERING↗

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗

Physics-Informed Neural Network Method for Forward and Backward Advection-Dispersion Equations

Advection-dispersion equations (ADEs) are commonly used to describe transport phenomena in porous media. Even though mature discretization-based numerical methods for ADEs exist, some challenges still remain, especially when it comes to solving advection-dominated forward ADEs and diffusion-dominated backward ADEs. The latter problem usually arises in the source identification context and leads to numerically unstable grid-based solutions that require a form of regularization or should be treated as an inverse problem that is computationally more expensive because it requires solving the forward problem multiple times. In this study, we propose a discretization-free approach based on the physics-informed neural network (PINN) method for solving coupled ADE and Darcy flow equations with space-dependent hydraulic conductivity. In this approach, the hydraulic conductivity, hydraulic head, and concentration fields are approximated with deep neural networks (DNNs). We assume that the conductivity field is given by its values on a grid, and we use these values to train the conductivity DNN. The head and concentration DNNs are trained by minimizing the residuals of the flow equation and ADE and using the initial and boundary conditions as additional constraints. The PINN method is applied to one- and two-dimensional forward ADE problems, where its performance for various P\'{e}clet numbers ($Pe$) is compared with the analytical and numerical solutions. We find that the PINN method is accurate with errors of less than 1\% and outperforms some conventional discretization-based methods for $Pe$ larger that 100. Next, we demonstrate that the PINN method remains accurate for the backward ADEs, with the relative errors in most cases staying under 5\% compared to the reference concentration field. Finally, we show that when available, the concentration measurements can be easily incorporated in the PINN method and significantly improve (by more than 50\% in the considered cases) the accuracy of the PINN solution of the backward ADE.

He, Qizhi↗

QuGAN: A Quantum State Fidelity based Generative Adversarial Network

In the recent years, Generative Adversarial Networks (GANs) have been arguably one of the largest strides forward in Deep Learning. Many papers illustrate the use of GANs to accomplish extremely impressive goals, such as text-to-image or image augmentation. Specifically, GANs have seen this success in the computer vision domain. However, GANs are not without their own set of problems. GANs are computationally expensive, sometimes computationally prohibitive, and can suffer a multitude of convergence problems. As research on classical GANs continues to push the topic further, a branch of GANs, namely Quantum GANs, has seen research interest in the past years. In this work, we intend to push this research further with an illustration of a Quantum GAN architecture that provide stable convergence of the model and is extended onto real data sets. Furthermore, unlike many other Quantum GANs out there, our model's GAN architecture runs the discriminator and the generator primarily on Quantum hardware through the use of a Quantum-based similarity metric. When compared to the very few other Quantum GAN papers, our architecture leads to significantly better results in almost all aspects.

Stein, Samuel A.↗

BEYONDPLANCK II. CMB mapmaking through Gibbs sampling

We present a Gibbs sampling solution to the mapmaking problem for cosmic microwave background (CMB) measurements that builds on existing destriping methodology. Gibbs sampling breaks the computationally heavy destriping problem into two separate steps: noise filtering and map binning. Considered as two separate steps, both are computationally much cheaper than solving the combined problem. This provides a huge performance benefit as compared to traditional methods and it allows us, for the first time, to bring the destriping baseline length to a single sample. Here, we applied the Gibbs procedure to simulated Planck 30 GHz data. We find that gaps in the time-ordered data are handled efficiently by filling them in with simulated noise as part of the Gibbs process. The Gibbs procedure yields a chain of map samples, from which we are able to compute the posterior mean as a best-estimate map. The variation in the chain provides information on the correlated residual noise, without the need to construct a full noise covariance matrix. However, if only a single maximum-likelihood frequency map estimate is required, we find that traditional conjugate gradient solvers converge much faster than a Gibbs sampler in terms of the total number of iterations. The conceptual advantages of the Gibbs sampling approach lies in statistically well-defined error propagation and systematic error correction. This methodology thus forms the conceptual basis for the mapmaking algorithm employed in the BEYONDPLANCK framework, which implements the first end-to-end Bayesian analysis pipeline for CMB observations.

79 ASTRONOMY AND ASTROPHYSICS↗

On‐site surrogates for large‐scale calibration

Abstract Motivated by a computer model calibration problem from the oil and gas industry, involving the design of a honeycomb seal, we develop a new Bayesian methodology to cope with limitations in the canonical apparatus stemming from several factors. We propose a new strategy of on‐site design and surrogate modeling for a computer simulator acting on a high‐dimensional input space that, although relatively speedy, is prone to numerical instabilities, missing data, and nonstationary dynamics. Our aim is to strike a balance between data‐faithful modeling and computational tractability in a calibration framework—tailoring the computer model to a limited field experiment. Situating our on‐site surrogates within the canonical calibration apparatus requires updates to that framework. We describe a novel yet intuitive Bayesian setup that carefully decomposes otherwise prohibitively large matrices by exploiting the sparse blockwise structure. Empirical illustrations demonstrate that this approach performs well on toy data and our motivating honeycomb example.

Huang, Jiangeng↗

ARPA-E Grid Optimization (GO) Competition Challenge 1

The ARPA-E Grid Optimization (GO) Competition Challenge 1, from 2018 to 2019, focused on the basic Security Constrained AC Optimal Power Flow problem (SCOPF) for a single time period. The Challenge utilized sets of unique datasets generated by the ARPA-E GRID DATA program. Each dataset consisted of a collection of power system network models of different sizes with associated operating scenarios (snapshots in time defining instantaneous power demand, renewable generation, generator and line availability, etc.). The datasets were of two types: Real-Time, which included starting-point information, and Online, which did not. Week-Ahead data is also provided for some cases but was not used in the Competition. Although most datasets were synthetic and generated by GRIDDATA, a few came from industry and were only used in the Final Event. All synthetic Input Data and Team Results for the GO Competition Challenge 1 for the Sandbox, Trial Events 1 to 3, and the Final Event along with problem, format, scoring and rules descriptions are available here. Data for industry scenarios will not be made public. Challenge 1, a minimization problem, required two computational steps. Solver 1 or Code 1 solved the base SCOPF problem under a strict wall clock time limit, as would be the case in industry, and reported the base case operating point as output, which was used to compute the Objective Function value that was used as the scenario score. The feasibility of the solution was provided by the Solver 2 or Code 2, which solves the power flow problem for all contingencies based on the results from Solver 1. This is not normally done in industry, so the time limits were relaxed. In fact, there were no time limits for Trial Event 1. This proved to be a mistake, with some codes running for more than 90 hours, and a time limit of 2 seconds per contingency was imposed for all other events. Entrants were free to use their own Solver 2 or use an open-source version provided by the Competition. Containers, such as Docker, were considered to improve the portability of codes, but none that could reliably support a multi-node parallel computing environment, e.g., MPI, could be found. For more information on the competition and challenge see the "GO Competition Challenge 1 Information" and "GO Competition Challenge 1 Additional Information" resources below.

ACOPF↗

SUPPORT OF NEW COMPUTER HARDWARE AT LUCH'S MC&A SYSTEM: PROBLEMS AND A SOLUTION

Abstract Microsoft Windows NT 4.0 operating system is the only software product certified in Russia for using in MC&A systems. In the paper a solution for allowing the installation of this outdated operating system on new computers is discussed. The solution has been successfully tested and has been in use at Luch's network since March 2008. Furthermore, it is being recommended for other Russian enterprises for the same purpose. Introduction Typically, the software part of a nuclear material control and accounting (MC&A) system consists of an operating system (OS), database management systems (DBMS), accounting program itself and database of nuclear materials. Russian regulations require the operating system and database for MC&A be certified for information security, and the whole system must pass an accreditation. Historically, the only certified operating system for MC&A still continues to be Microsoft Windows NT 4.0 Server/Workstation. Attempts to certify newer versions of Windows failed. Luch, like most other Russian sites, uses Microsoft Windows NT 4.0 and SQL Server 6.5. Luch's specialists have developed an application (LuchMAS) for accounting purposes. Starting from about 2004, some problems appeared in Luch's accounting system. They were related to the complexity of installing Windows NT 4.0 on new computers. At first, it was possible to solve the problem choosing computer equipment that is compatible with Windows NT 4.0 or selecting certain operating system settings. Over time, the problem worsened and now it is almost impossible to install Windows NT 4.0 on new computers. The reason is the lack of hardware drivers in the outdated operating system. The problem was serious enough that it could have affected the long-term sustainability of Luch's MC&A system if adequate alternate measures were not developed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A Homotopy-Based Method for Robust Computation of Controlling Unstable Equilibrium Points

This paper proposes a homotopy-based method for efficiently computing and precisely determining controlling unstable equilibrium points (CUEPs) in transient stability analysis and screening using direct methods. The proposed method is intended to overcome potential numerical convergence problems associated with computing CUEPs. These convergence problems are mostly due to irregularities in the region of convergence of CUEPs which make it difficult to determine suitable initial points. The most commonly used initial points in computing CUEPs are minimum gradient points (MGPs) on the stability boundary which in turn rely on the determination of exit points (EPs-points at which sustained-fault trajectories exit system stability boundaries). However, determination of MGPs and EPs are computationally involved and sophisticated numerical methods have been introduced such as stability-boundary-following procedure and shadowing method to correct the solution trajectory. The proposed method does not depend on MGPs and also does not require accurate EPs. The proposed method maps the solution from EPs to the CUEPs. The proposed method is applied on several known systems including the NE 39 bus system and the reduced WECC system and the results are provided. The results are compared with the traditional methods such as Boundary of stability region based CUEP method (BCU method).

42 ENGINEERING↗

Total variation-based neutron computed tomography

We perform the neutron computed tomography reconstruction problem via an inverse problem formulation with a total variation penalty. In the case of highly under-resolved angular measurements, the total variation penalty suppresses high-frequency artifacts which appear in filtered back projections. Here, in order to efficiently compute solutions for this problem, we implement a variation of the split Bregman algorithm; due to the error-forgetting nature of the algorithm, the computational cost of updating can be significantly reduced via very inexact approximate linear solvers. We present the effectiveness of the algorithm in the significantly low-angular sampling case using synthetic test problems as well as data obtained from a high flux neutron source. Finally, the algorithm removes artifacts and can even roughly capture small features when an extremely low number of angles are used.

97 MATHEMATICS AND COMPUTING↗

Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

97 MATHEMATICS AND COMPUTING↗

Dimensionality reduction of the many-body problem using coupled-cluster subsystem flow equations: classical and quantum computing perspective

We discuss reduced-scaling strategies employing recently introduced sub-system embedding sub-algebras coupled-cluster formalism (SES-CC) to describe many-body systems. These strategies utilize properties of the SES-CC formulations where the equations describing certain classes of sub- systems can be integrated into a computational flows composed coupled eigenvalue problems of reduced dimensionality. Additionally, these flows can be defined at the level of the CC Ansatz defined by selected classes of cluster amplitudes, which define the wave function ”memory” of possible partitionings of the many-body system into constituent sub-systems. One of the possible ways of solving these coupled problems is through implementing procedures, where the information is passed between the sub-systems in a self-consistent manner. As a special case, we consider local flow formulations where the so-called local character of correlation effects can be closely related to properties of sub-system embedding sub-algebras employing localized molecular basis. We also generalize flow equations to the time domain and to downfolding methods utilizing double exponential unitary CC Ansatz (DUCC), where reduced dimensionality of constituent sub-problems offer a possibility of efficient utilization of limited quantum resources in modeling realistic systems.

Electron correlation, quantum chemistry, quantum c↗

Parallel scalability of Hartree–Fock calculations

Quantum chemistry is increasingly performed using large cluster computers consisting of multiple interconnected nodes. For a fixed molecular problem, the efficiency of a calculation usually decreases as more nodes are used, due to the cost of communication between the nodes. This paper empirically investigates the parallel scalability of Hartree–Fock calculations. The construction of the Fock matrix and the density matrix calculation are analyzed separately. For the former, we use a parallelization of Fock matrix construction based on a static partitioning of work followed by a work stealing phase. For the latter, we use density matrix purification from the linear scaling methods literature, but without using sparsity. When using large numbers of nodes for moderately sized problems, density matrix computations are network-bandwidth bound, making purification methods potentially faster than eigendecomposition methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mitigating Depolarizing Noise on Quantum Computers with Noise-Estimation Circuits

A significant problem for current quantum computers is noise. While there are many distinct noise channels, the depolarizing noise model often appropriately describes average noise for large circuits involving many qubits and gates. We present a method to mitigate the depolarizing noise by first estimating its rate with a noise-estimation circuit and then correcting the output of the target circuit using the estimated rate. The method is experimentally validated on the simulation of the Heisenberg model. We find that our approach in combination with readout-error correction, randomized compiling, and zero-noise extrapolation produces results close to exact results even for circuits containing hundreds of CNOT gates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗