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 991 records · Page 55

Size reduction of complex networks preserving modularity

The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionality. The best approaches to the identification of modular structure are based on the optimization of a quality function known as modularity. However this optimization is a hard task provided that the computational complexity of the problem is in the NP-hard class. Here we propose an exact method for reducing the size of weighted (directed and undirected) complex networks while maintaining invariant its modularity. This size reduction allows the heuristic algorithms that optimize modularity for a better exploration of the modularity landscape. We compare the modularity obtained in several real complex-networks by using the Extremal Optimization algorithm, before and after the size reduction, showing the improvement obtained. We speculate that the proposed analytical size reduction could be extended to an exact coarse graining of the network in the scope of real-space renormalization.

97 MATHEMATICS AND COMPUTING↗

PETSc/TAO Users Manual V.3.21

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations (PDEs) and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for implementing large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and optimizers that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started ). The library is organized hierarchically, enabling users to employ the abstraction level most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users.

97 MATHEMATICS AND COMPUTING↗

Numerical results on the short-range spin correlation functions in the ground state of the two-dimensional Hubbard model

Optical lattice experiments with ultracold fermion atoms and quantum gas microscopy have recently realized direct measurements of magnetic correlations at the site-resolved level. We calculate the short-range spin-correlation functions in the ground state of the two-dimensional repulsive Hubbard model with the auxiliary-field quantum Monte Carlo (AFQMC) method. The results are numerically exact at half filling where the fermion sign problem is absent. Away from half filling, we employ the constrained path AFQMC approach to eliminate the exponential computational scaling from the sign problem. The constraint employs unrestricted Hartree-Fock trial wave functions with an effective interaction strength U, which is optimized self-consistently within AFQMC. Large supercells are studied, with twist averaged boundary conditions as needed, to reach the thermodynamic limit. We find that the nearest-neighbor spin correlation always increases with the interaction strength U , contrary to the finite-temperature behavior where a maximum is reached at a finite U value. We also observe a change of sign in the next-nearest-neighbor spin correlation with increasing density, which is a consequence of the buildup of the long-range antiferromagnetic correlation. Finally, we expect the results presented in this paper to serve as a benchmark as lower temperatures are reached in ultracold atom experiments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Massively parallel electrical conductivity imaging of the subsurface: Applications to hydrocarbon exploration

Three-dimensional (3D) geophysical imaging is now receiving considerable attention for electrical conductivity mapping of potential offshore oil and gas reservoirs. The imaging technology employs controlled source electromagnetic (CSEM) and magnetotelluric (MT) fields and treats geological media exhibiting transverse anisotropy. Moreover when combined with established seismic methods, direct imaging of reservoir fluids is possible. Because of the size of the 3D conductivity imaging problem, strategies are required exploiting computational parallelism and optimal meshing. The algorithm thus developed has been shown to scale to tens of thousands of processors. In one imaging experiment, 32,768 tasks/processors on the IBM Watson Research Blue Gene/L supercomputer were successfully utilized. Over a 24 hour period we were able to image a large scale field data set that previously required over four months of processing time on distributed clusters based on Intel or AMD processors utilizing 1024 tasks on an InfiniBand fabric. Electrical conductivity imaging using massively parallel computational resources produces results that cannot be obtained otherwise and are consistent with timeframes required for practical exploration problems.

54 ENVIRONMENTAL SCIENCES↗

Binarity and the abundance discrepancy problem in planetary nebulae

The discrepancy between abundances computed using optical recombination lines and collisionally excited lines is a major unresolved problem in nebular astrophysics. Here, we show that the largest abundance discrepancies are reached in planetary nebulae with close binary central stars. We illustrate this using deep spectroscopy of three nebulae with a post common-envelope (CE) binary star. Abell 46 and Ou 5 have O{sup 2+}/H{sup +} abundance discrepancy factors larger than 50, and as high as 300 in the inner regions of Abell 46. Abell 63 has a smaller discrepancy factor around 10, which is still above the typical values in ionized nebulae. Our spectroscopic analysis supports previous conclusions that, in addition to “standard” hot (T{sub e} ∼ 10{sup 4} K) gas, there exists a colder (T{sub e} ∼ 10{sup 3} K), ionized component that is highly enriched in heavy elements. These nebulae have low ionized masses, between 10{sup −3} and 10{sup −1} M{sub ⊙} depending on the adopted electron densities and temperatures. Since the much more massive red giant envelope is expected to be entirely ejected in the CE phase, the currently observed nebulae would be produced much later, during post-CE mass loss episodes when the envelope has already dispersed. These observations add constraints to the abundance discrepancy problem. We revise possible explanations. Some explanations are naturally linked to binarity such as, for instance, high-metallicity nova ejecta, but it is difficult at this stage to depict an evolutionary scenario consistent with all of the observed properties. We also introduce the hypothesis that these nebulae are the result of tidal destruction, accretion, and ejection of Jupiter-like planets.

79 ASTRONOMY AND ASTROPHYSICS↗

Availability Assessment Based Case-Sensitive Power System Restoration Strategy

Increasingly frequent severe weather events in recent years threaten the security of power systems and result in major power outages throughout the world. The development of reasonable power system restoration (PSR) solutions is therefore urgently needed to speed up the recovery of the power supply while at the same time steering clear of vulnerable and risky equipment. This paper aims to develop a case-sensitive PSR model for power transmission systems that can adjust restoration solutions according to the evaluated availability of outage equipment in specific blackout scenarios and weather conditions. A novel PSR model that integrates the startup of generating units, formulation of the restoration network, renewable energy sources, and availability assessment of devices is proposed. A reformulated model is also proposed to relieve the computational burden of complex PSR problems. The availability of outage equipment is comprehensively assessed based on historical operating records, fault diagnosis results, and weather conditions. The assessed availability results are sensitive to the characteristics of real blackout cases and will support system operators generate case-sensitive PSR solutions while mitigating the vulnerable equipment. The feasibility and effectiveness of the proposed PSR model and its reformulations are verified through case studies.

availability assessment↗

Continuous-variable teleportation of a negative Wigner function

Teleportation is a basic primitive for quantum communication and quantum computing. We address the problem of continuous-variable (unconditional and conditional) teleportation of a pure single-photon state and a mixed attenuated single-photon state generally in a nonunity-gain regime. Our figure of merit is the maximum negativity of the Wigner function, which demonstrates a highly nonclassical feature of the teleported state. We find that the negativity of the Wigner function of the single-photon state can be unconditionally teleported for an arbitrarily weak squeezed state used to create the entangled state shared in teleportation. In contrast, for the attenuated single-photon state there is a strict threshold squeezing one has to surpass to successfully teleport the negativity of its Wigner function. The conditional teleportation allows one to approach perfect transmission of the single photon for an arbitrarily low squeezing at a cost of decrease of the success rate. In contrast, for the attenuated single photon state, conditional teleportation cannot overcome the squeezing threshold of the unconditional teleportation and it approaches negativity of the input state only if the squeezing increases simultaneously. However, as soon as the threshold squeezing is surpassed, conditional teleportation still pronouncedly outperforms the unconditional one. The main consequences for quantum communication and quantum computing with continuous variables are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resilient Computing with Dynamical Systems

We reformulate fundamental numerical problems to run on novel hardware inspired by the brain. Such "neuromorphie hardware consumes less energy per computation, promising a means to augment next-generation exascale computers. However, their programming model is radically different from floating-point machines, with fewer guarantees about precision and communication. The approach is to pass each given problem through a sequence of transformations (algorithmic "reductions") which change it from conventional form into a dynamical system, then ultimately into a spiking neural network. Results for the eigenvalue problem are presented, showing that the dynamical system formulation is feasible.

97 MATHEMATICS AND COMPUTING↗

COHORT: Coordination of Heterogeneous Thermostatically Controlled Loads for Demand Flexibility

Demand flexibility is increasingly important for power grids. Careful coordination of thermostatically controlled loads (TCLs) can modulate energy demand, decrease operating costs, and increase grid resiliency. We propose a novel distributed control framework for the Coordination Of HeterOgeneous Residential Thermostatically controlled loads (COHORT). COHORT is a practical, scalable, and versatile solution that coordinates a population of TCLs to jointly optimize a grid-level objective, while satisfying each TCL’s end-use requirements and operational constraints. To achieve that, we decompose the grid-scale problem into subproblems and coordi- nate their solutions to find the global optimum using the alternating direction method of multipliers (ADMM). The TCLs’ local problems are distributed to and computed in parallel at each TCL, making COHORT highly scalable and privacy-preserving. While each TCL poses combinatorial and non-convex constraints, we characterize these constraints as a convex set through relaxation, thereby making COHORT computationally viable over long planning horizons. After coordination, each TCL is responsible for its own control and tracks the agreed-upon power trajectory with its preferred strategy. In this work, we translate continuous power back to discrete on/off actuation, using pulse width modulation. COHORT is generalizable to a wide range of grid objectives, which we demonstrate through three distinct use cases: generation following, minimizing ramping, and peak load curtailment. In a notable experiment, we validated our approach through a hardware-in-the-loop simulation, including a real-world air conditioner (AC) controlled via a smart thermostat, and simulated instances of ACs modeled after real-world data traces. During the 15-day experimental period, COHORT reduced daily peak loads by an average of 12.5% and maintained comfortable temperatures.

demand response↗

An MPI/OpenACC implementation of a high-order electromagnetics solver with GPUDirect communication

We present performance results and an analysis of a message passing interface (MPI)/OpenACC implementation of an electromagnetic solver based on a spectral-element discontinuous Galerkin discretization of the time-dependent Maxwell equations. The OpenACC implementation covers all solution routines, including a highly tuned element-by-element operator evaluation and a GPUDirect gather–scatter kernel to effect nearest neighbor flux exchanges. Modifications are designed to make effective use of vectorization, streaming, and data management. Performance results using up to 16,384 graphics processing units of the Cray XK7 supercomputer Titan show more than 2.5× speedup over central processing unit-only performance on the same number of nodes (262,144 MPI ranks) for problem sizes of up to 6.9 billion grid points. We discuss performance-enhancement strategies and the overall potential of GPU-based computing for this class of problems.

Computer Science↗

Presto 4.18 user's guide.

Presto is a Lagrangian, three-dimensional explicit, transient dynamics code that is used to analyze solids subjected to large, suddenly applied loads. The code is designed for a parallel computing environment and for problems with large deformations, nonlinear material behavior, and contact. Presto also has a versatile element library that incorporates both continuum elements and structural elements. This user's guide describes the input for Presto that gives users access to all the current functionality in the code. The environment in which Presto is built allows it to be coupled with other engineering analysis codes. Using a concept called scope, the input structure reflects the fact that Presto can be used in a coupled environment. The user's guide describes how scope is implemented from the outermost to the innermost scopes. Within a given scope, the descriptions of input commands are grouped based on functionality of the code. For example, all material input command lines are described in a chapter of the user's guide for all the material models that can be used in Presto.

99 GENERAL AND MISCELLANEOUS↗

Presto 2.9 user's guide.

Presto is a Lagrangian, three-dimensional explicit, transient dynamics code that is used to analyze solids subjected to large, suddenly applied loads. The code is designed for a parallel computing environment and for problems with large deformations, nonlinear material behavior, and contact. Presto also has a versatile element library that incorporates both continuum elements and structural elements. This user's guide describes the input for Presto that gives users access to all the current functionality in the code. The environment in which Presto is built allows it to be coupled with other engineering analysis codes. Using a concept called scope, the input structure reflects the fact that Presto can be used in a coupled environment. The user's guide describes how scope is implemented from the outermost to the innermost scopes. Within a given scope, the descriptions of input commands are grouped based on functionality of the code. For example, all material input command lines are described in a chapter of the user's guide for all the material models that can be used in Presto.

36 MATERIALS SCIENCE↗

Energy decay of solutions to the Cauchy problem for a nondissipative wave equation

In this paper, we consider energy decay for nondissipative wave equation in unbounded domain (the usual energy is not decreasing). We use an approach introduced by Guesmia, which leads to decay estimates (known in the dissipative case) when the integral inequalities method by Komornik [Exact Controllability and Stabilization. The Multiplier Method. Masson-Wiley, Paris, 1994] cannot be applied due to the lack of dissipativity. First, we study the stability of a wave equation with a weak nonlinear dissipative term based on the equation: u{sup ''}-{Delta}{sub x}u+{lambda}{sup 2}(x)u+{sigma}(t)g(u{sup '})+{theta}(t)h({nabla}{sub x}u)=0 in IR{sup n}. We consider the general case with a function h satisfying a smallness condition, and we obtain decay of solutions under weak growth assumptions on the feedback function and without any control of the sign of the derivative of the energy related to the above equation. In the second case, we consider the case h({nabla}u) =-{nabla}{Phi}{nabla}u. We prove some precise decay estimates of equivalent energy.

97 MATHEMATICS AND COMPUTING↗

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗

Advancing quantum simulations of the nuclear shell model with Gray-code–based resource-efficient protocols

Background: Some of the computational limitations in solving the nuclear many-body problem could be overcome by utilizing quantum computers. The nuclear shell-model calculations providing deeper insights into the properties of atomic nuclei are one such case with high demand for resources, as the size of the Hilbert space grows exponentially with the number of particles involved. Quantum algorithms are being developed to overcome these challenges and advance such calculations. Purpose: To develop quantum circuits for the nuclear shell-model, leveraging the capabilities of noisy intermediate-scale quantum (NISQ) devices. Here, we aim to minimize resource requirements (specifically in terms of qubits and gates) and strive to reduce the impact of noise by employing relevant mitigation techniques. Methods: We achieve noise resilience by designing an optimized Ansatz for the variational quantum eigensolver (VQE) based on Givens rotations and incorporating qubit-ADAPT-VQE in combination with variational quantum deflation (VQD) to compute ground and excited states, incorporating the zero-noise extrapolation mitigation technique. Furthermore, the qubit requirements are significantly reduced by mapping the basis states to qubits using Gray-code encoding and generalizing transformations of fermionic operators to efficiently represent many-body states. Results: By employing the resource-efficient protocols, we achieve the ground and excited state energy levels of 38 Ar and 6 Li with better accuracy. These energy levels are presented for noiseless simulations, noisy conditions, and after applying noise mitigation techniques. Results are compared for Jordan-Wigner and Gray-code encoding using VQE, qubit-ADAPT-VQE, and VQD. Conclusions: Our work highlights the potential of resource-efficient protocols to leverage the full potential of NISQ devices in scaling the nuclear shell model calculations, offering a pathway toward more complex quantum simulations in nuclear physics. This approach establishes a framework for studying other nuclear systems with improved quantum resource efficiency, marking a significant advancement in applying quantum computing to realistic nuclear physics applications.

Physics - Nuclear physics and radiation physics↗

PARALLEL IMPLEMENTATION OF THE TOPAZ OPACITY CODE: ISSUES IN LOAD-BALANCING

The TOPAZ opacity code explicitly includes configuration term structure in the calculation of bound-bound radiative transitions. This approach involves myriad spectral lines and requires the large computational capabilities of parallel processing computers. It is important, however, to make use of these resources efficiently. For example, an increase in the number of processors should yield a comparable reduction in computational time. This proportional 'speedup' indicates that very large problems can be addressed with massively parallel computers. Opacity codes can readily take advantage of parallel architecture since many intermediate calculations are independent. On the other hand, since the different tasks entail significantly disparate computational effort, load-balancing issues emerge so that parallel efficiency does not occur naturally. Several schemes to distribute the labor among processors are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulation of Subsurface Multiphase Contaminant Extraction Using a Bioslurping Well Model

Subsurface simulation of multiphase extraction from wells is notoriously difficult. Explicit representation of well geometry requires small grid resolution, potentially leading to large computational demands. To reduce the problem dimensionality, multiphase extraction is mostly modeled using vertically-averaged approaches. In this paper, a multiphase well model approach is presented as an alternative to simplify the application. The well model, a multiphase extension of the classic Peaceman model, has been implemented in the STOMP simulator. The numerical solution approach accounts for local conditions and gradients in the exchange of fluids between the well and the aquifer. Advantages of this well model implementation include the option to simulate the effects of well characteristics and operation. Simulations were conducted investigating the effects of extraction location, applied vacuum pressure, and a number of hydraulic properties. The obtained results were all consistent and logical. A major outcome of the test simulations is that, in contrast with common recommendations to extract from either the gas-NAPL or the NAPL-aqueous phase interface, the optimum extraction location should be in between these two levels. Further, the new model implementation was also used to simulate extraction at a field site in Brazil. The simulation shows a good match with the field data, suggesting that the new STOMP well module may correctly represent oil removal. The field simulations depend on the quality of the site conceptual model, including the porous media and contaminant properties and the boundary and extraction conditions adopted. The new module may potentially be used to design field applications and analyze extraction data.

42 ENGINEERING↗

The pilot way to Grid resources using glideinWMS

Grid computing has become very popular in big and widespread scientific communities with high computing demands, like high energy physics. Computing resources are being distributed over many independent sites with only a thin layer of Grid middleware shared between them. This deployment model has proven to be very convenient for computing resource providers, but has introduced several problems for the users of the system, the three major being the complexity of job scheduling, the nonuniformity of computer resources, and the lack of good job monitoring. Pilot jobs address all the above problems by creating a virtual private computing pool on top of Grid resources. This paper presents both the general pilot concept, as well as a concrete implementation, called glideinWMS, deployed in the Open Science Grid.

99 GENERAL AND MISCELLANEOUS↗