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,279 records · Page 71

A comparison of acceleration methods for solving the neutron transport k-eigenvalue problem

Over the past several years a number of papers have been written describing modern techniques for numerically computing the dominant eigenvalue of the neutron transport criticality problem. These methods fall into two distinct categories. The first category of methods rewrite the multi-group k-eigenvalue problem as a nonlinear system of equations and solve the resulting system using either a Jacobian-Free Newton–Krylov (JFNK) method or Nonlinear Krylov Acceleration (NKA), a variant of Anderson Acceleration. These methods are generally successful in significantly reducing the number of transport sweeps required to compute the dominant eigenvalue. The second category of methods utilize Moment-Based Acceleration (or High-Order/Low-Order (HOLO) Acceleration). These methods solve a sequence of modified diffusion eigenvalue problems whose solutions converge to the solution of the original transport eigenvalue problem. This second class of methods is, in our experience, always superior to the first, as most of the computational work is eliminated by the acceleration from the LO diffusion system. In this paper, we review each of these methods. Our computational results support our claim that the choice of which nonlinear solver to use, JFNK or NKA, should be secondary. The primary computational savings result from the implementation of a HOLO algorithm. We display computational results for a series of challenging multi-dimensional test problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Analysis Platform for Multiscale Hydrogeologic Modeling with Emphasis on Hybrid Multiscale Methods

One of the most significant challenges facing hydrogeologic modelers is the disparity between those spatial and temporal scales at which fundamental flow, transport and reaction processes can best be understood and quantified (e.g., microscopic to pore scales, seconds to days) and those at which practical model predictions are needed (e.g., plume to aquifer scales, years to centuries). While the multiscale nature of hydrogeologic problems is widely recognized, technological limitations in computational and characterization restrict most practical modeling efforts to fairly coarse representations of heterogeneous properties and processes. For some modern problems, the necessary level of simplification is such that model parameters may lose physical meaning and model predictive ability is questionable for any conditions other than those to which the model was calibrated. Recently, there has been broad interest across a wide range of scientific and engineering disciplines in simulation approaches that more rigorously account for the multiscale nature of systems of interest. In this paper, we review a number of such approaches and propose a classification scheme for defining different types of multiscale simulation methods and those classes of problems to which they are most applicable. Our classification scheme is presented in terms of a flow chart (Multiscale Analysis Platform or MAP), and defines several different motifs of multiscale simulation. Within each motif, the member methods are reviewed and example applications are discussed. We focus attention on hybrid multiscale methods, in which two or more models with different physics described at fundamentally different scales are directly coupled within a single simulation. Very recently these methods have begun to be applied to groundwater flow and transport simulations, and we discuss these applications in the context of our classification scheme. As computational and characterization capabilities continue to improve, we envision that hybrid multiscale modeling will become more common and may become a viable alternative to conventional single-scale models in the near future.

Environmental Molecular Sciences Laboratory↗

Global Sensitivity Measures from Given Data

Simulation models support managers in the solution of complex problems. International agencies recommend uncertainty and global sensitivity methods as best practice in the audit, validation and application of scientific codes. However, numerical complexity, especially in the presence of a high number of factors, induces analysts to employ less informative but numerically cheaper methods. This work introduces a design for estimating global sensitivity indices from given data (including simulation input–output data), at the minimum computational cost. We address the problem starting with a statistic based on the L1-norm. A formal definition of the estimators is provided and corresponding consistency theorems are proved. The determination of confidence intervals through a bias-reducing bootstrap estimator is investigated. The strategy is applied in the identification of the key drivers of uncertainty for the complex computer code developed at the National Aeronautics and Space Administration (NASA) assessing the risk of lunar space missions. We also introduce a symmetry result that enables the estimation of global sensitivity measures to datasets produced outside a conventional input–output functional framework.

99 GENERAL AND MISCELLANEOUS↗

Dynamics of Qubits in the Field of Unipolar Pulses: Magnus Propagator, Generalized Area Theorem, and Motion on Groups

The problem of speeding up quantum computations through controlling the states of qubits by short large-amplitude unipolar pulses is discussed. A new method is proposed to describe the dynamics of qubits that is based on the Magnus representation for the evolution operator (propagator) of qubits, which allows one to find a solution to the quantum control problem outside the framework of perturbation theory. The evolution of the states of a multiqubit system is represented as a motion on a special unitary group SU(N), similar to the rotation of the Bloch vector on the group SU(2) in the case of a single qubit. As an example, unitary transformations of single-qubit states under different excitation modes are considered. A general formula is found that establishes a relation between the shape of a pulse and the result of its action, similar to the well-known “area theorem” for Rabi pulses. The effect of unipolar pulses on a two-qubit system is analyzed in detail. Two situations are considered: first, a symmetric configuration, when the parameters of qubits do not differ and are acted upon by the same magnetic field from a fluxon, and second, when the configuration of levels arises in which, for one of the qubits, a transition to the nearest level becomes possible under perturbation. The general case of two interacting qubits—a four-level system—is considered analytically. A direct numerical simulation of the dynamics of a multiqubit system is performed to estimate the accuracy of approximation, and fidelity is used as a criterion of accuracy of operations. It is shown that the expressions obtained for the propagator allow one to formulate conditions for the pulse parameters that are necessary to perform logical operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

From NWChem to NWChemEx: Evolving with the Computational Chemistry Landscape

Since the advent of the first computers, chemists have been at the forefront of using computers to understand and solve complex chemical problems. As the hardware and software have evolved, so have the theoretical and computational chemistry methods and algorithms. Parallel computers clearly changed the common computing paradigm in the late 1970s and 80s, and the field has again seen a paradigm shift with the advent of graphical processing units. This review explores the challenges and some of the solutions in transforming software from the terascale to the petascale and now to the upcoming exascale computers. While discussing the field in general, NWChem and its redesign, NWChemEx, will be highlighted as one of the early codesign projects to take advantage of massively parallel computers and emerging software standards to enable large scientific challenges to be tackled.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Deformation accommodating periodic computational domain for a uniform velocity gradient

Many multiscale methods for granular materials use periodic computational domains to consider particle scale interactions and then calculate the stress to drive the continuum scale calculations. For problems involving large material deformations, the computation domain often needs to be reinitialized because of the distortion, causing the loss of the history information of the system. This work introduces an algorithm to accommodate a large deformation of the material while maintaining the computational domain cuboid to avoid the domain reinitialization during the computation. The algorithm uses a rotating frame of reference, in which the velocity gradient can be represented by an upper triangular matrix. The deformation caused by the upper triangular matrix is treated by the image system implied in the periodicity to maintain the computational domain cuboid. The effect from the rotation of the reference frame is considered using the inertial forces. Finally, simulations of simple and pure shear motions are carried out to illustrate the algorithm.

42 ENGINEERING↗

Formulating the r-mode Problem for Slowly Rotating Neutron Stars

We revisit the problem of inertial r-modes in stratified stars, drawing on a more precise description of the composition stratification in a mature neutron star. The results highlight issues with the traditional approach to the problem, leading us to rethink the computational strategy for the r-modes of nonbarotropic neutron stars. We outline two strategies for dealing with the problem. For moderate to slowly rotating neutron stars the only viable alternative may be to approach the problem numerically from the outset, while a meaningful slow-rotation calculation can be carried out for the fastest known spinning stars (which may be close to being driven unstable by the emission of gravitational waves). We demonstrate that the latter approach leads to a problem close, but not identical, to that for barotropic inertial modes. We also suggest that these reformulations of the problem likely resolve the long-standing problem of singular behavior associated with a corotation point in rotating relativistic neutron stars. This issue needs to be resolved in order to guide future gravitational-wave searches.

79 ASTRONOMY AND ASTROPHYSICS↗

Evaluation of vectorized Monte Carlo algorithms on GPUs for a neutron Eigenvalue problem

Conventional Monte Carlo (MC) methods for radiation transport computations are 'history-based', which means that one particle history at a time is tracked. Simulations based on such methods suffer from thread divergence on the graphics processing unit (GPU), which severely affects the performance of GPUs. To circumvent this limitation, event-based vectorized MC algorithms can be utilized. A versatile software test-bed, called ARCHER - Accelerated Radiation-transport Computations in Heterogeneous Environments - was used for this study. ARCHER facilitates the development and testing of a MC code based on the vectorized MC algorithm implemented on GPUs by using NVIDIA's Compute Unified Device Architecture (CUDA). The ARCHER{sub GPU} code was designed to solve a neutron eigenvalue problem and was tested on a NVIDIA Tesla M2090 Fermi card. We found that although the vectorized MC method significantly reduces the occurrence of divergent branching and enhances the warp execution efficiency, the overall simulation speed is ten times slower than the conventional history-based MC method on GPUs. By analyzing detailed GPU profiling information from ARCHER, we discovered that the main reason was the large amount of global memory transactions, causing severe memory access latency. Several possible solutions to alleviate the memory latency issue are discussed. (authors)

97 MATHEMATICS AND COMPUTING↗

Near-Optimal Performance of Stochastic Model Predictive Control

Here, this article presents a regret analysis for stochastic model predictive control (SMPC) in linear systems with quadratic performance index and additive and multiplicative uncertainties. Under a finite support assumption, the problem can be cast as a finite-dimensional quadratic program, but the problem becomes quickly intractable as the problem size grows exponentially in the horizon length. SMPC aims to compute approximate solutions by solving a sequence of problems with truncated prediction horizons and committing the solution in a receding-horizon fashion. Although this approach is widely used in practice, its performance relative to the optimal solution is not well understood. This article reports for the first time a rigorous near-optimal performance guarantee of SMPC: under stabilizability and detectability conditions, the regret of SMPC is exponentially small in the prediction horizon length, allowing SMPC to achieve near-optimal performance at a substantially reduced computational expense.

93E20, 93B45↗

Method of Distributions for Two‐Phase Flow in Heterogeneous Porous Media

Abstract Multiscale heterogeneity and insufficient characterization data for a specific subsurface formation of interest render predictions of multi‐phase fluid flow in geologic formations highly uncertain. Quantification of the uncertainty propagation from the geomodel to the fluid‐flow response is typically done within a probabilistic framework. This task is computationally demanding due to, for example, the slow convergence of Monte Carlo simulations (MCS), especially when computing the tails of a distribution that are necessary for risk assessment and decision‐making under uncertainty. The frozen streamlines method (FROST) accelerates probabilistic predictions of immiscible two‐phase fluid flow problems; however, FROST relies on MCS to compute the travel‐time distribution, which is then used to perform the transport (phase saturation) computations. To alleviate this computational bottleneck, we replace MCS with a deterministic equation for the cumulative distribution function (CDF) of travel time. The resulting CDF‐FROST approach yields the CDF of the saturation field without resorting to sampling‐based strategies. Our numerical experiments demonstrate the high accuracy of CDF‐FROST in computing the CDFs of both saturation and travel time. For the same accuracy, it is about 5 and 10 times faster than FROST and MCS, respectively.

Yang, Hyung Jun↗

Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the Viability of Quantum Annealers to Solve Fluid Flows

This paper explores the suitability of upcoming novel computing technologies, particularly adiabatic annealing based quantum computers, to solve fluid dynamics problems that form a critical component of several science and engineering applications. For our experiments, we start with a well-studied one-dimensional simple flow problem, and provide a framework to convert such problems in continuum to a form amenable for deployment on such quantum annealers. Since the DWave annealer returns multiple states sampling the energy landscape of the problem, we explore multiple solution selection strategies to approximate the solution of the problem. We analyze the continuum solutions obtained both qualitatively and quantitatively as well as their sensitivities to the particular solution selection scheme.

42 ENGINEERING↗

SPARTAN (Scalable Probabilistic Application Reconfigurable Tensor Autonomous Network)

The technical founder of Ludwig Computing Inc has been competitively selected for support by Cyclotron Road, a U.S. Department of Energy (DOE) Advanced Manufacturing Office (AMO) Lab-Embedded Entrepreneurship Program (LEEP) through an approved merit review process. Ludwig Computing Inc, supported by the U.S. Department of Energy's Advanced Manufacturing Office through the Cyclotron Road program, has investigated the advantages of probabilistic computing for real-world compute-intensive applications. This research adds to the understanding of alternative computing paradigms by exploring a unique hardware-software co-design that integrates quantum computing methods with nature-inspired problem-solving techniques. The project's focus on areas such as combinatorial optimization, graph analytics, and machine learning demonstrates the potential for significant advancements in computational efficiency and performance. By harnessing natural randomness to streamline large circuits into fewer devices, Ludwig's approach enables massive parallelism, potentially offering higher throughput, speed, and energy efficiency compared to conventional hardware solutions. This work benefits the public by paving the way for more efficient computing solutions that could address complex real-world problems while potentially reducing energy consumption in data-intensive industries.

97 MATHEMATICS AND COMPUTING↗

A reconstructed discontinuous Galerkin method for the compressible Navier-Stokes equations on three-dimensional hybrid grids

A reconstructed discontinuous Galerkin (rDG(P1P2)) method, originally introduced for the compressible Euler equations, is developed for the solution of the compressible Navier–Stokes equations on 3D hybrid grids. In this method, a piecewise quadratic polynomial solution is obtained from the underlying piecewise linear DG solution using a hierarchical Weighted Essentially Non-Oscillatory (WENO) reconstruction. The reconstructed quadratic polynomial solution is then used for the computation of the inviscid fluxes and the viscous fluxes using the second formulation of Bassi and Reay (Bassi–Rebay II). The developed rDG(P 1 P 2 ) method is used to compute a variety of flow problems to assess its accuracy, efficiency, and robustness. Additionally, the numerical results demonstrate that the rDG(P 1 P 2 ) method is able to achieve the designed third-order of accuracy at a cost slightly higher than its underlying second-order DG method, outperform the third order DG method in terms of both computing costs and storage requirements, and obtain reliable and accurate solutions to the direct numerical simulation (DNS) of compressible turbulent flows.

42 ENGINEERING↗

Theory and numerics of subspace approximation of eigenvalue problems

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.

Eigenvalue problems↗

PETSc Users Manual (Rev. 3.13)

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear solvers, nonlinear solvers, and time integrators that may be used in application codes written in Fortran, C, C++, and Python. PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than \rolling them" yourself.

97 MATHEMATICS AND COMPUTING↗

Strengthened MILP formulation for certain gas turbine unit commitment problems

In this study, we derive a strengthened MILP formulation for certain gas turbine unit commitment problems, in which the ramping rates are no smaller than the minimum generation amounts. This type of gas turbines can usually start-up faster and have a larger ramping rate, as compared to the traditional coal-fired power plants. Recently, the number of this type of gas turbines increases significantly due to affordable gas prices and their scheduling flexibilities to accommodate intermittent renewable energy generation. In this study, several new families of strong valid inequalities are developed to help reduce the computational time to solve these types of problems. Meanwhile, the validity and facet-defining proofs are provided for certain inequalities. Finally, numerical experiments on a modified IEEE 118-bus system and the power system data based on recent studies verify the effectiveness of applying our formulation to model and solve this type of gas turbine unit commitment problems, including reducing the computational time to obtain an optimal solution or obtaining a much smaller optimality gap, as compared to the default CPLEX, when the time limit is reached with no optimal solutions obtained.

24 POWER TRANSMISSION AND DISTRIBUTION↗