Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer applications”

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,585 records · Page 88

Topological defects and topological materials

We report that defects in materials that interpolate between two orientation states such as domain walls and those which relate to some kind of material discontinuity, e.g. dislocations and disclinations, comprise topological defects. Noncoplanar vector arrangements, e.g. vortices, skyrmions, and possibly monopole-like excitations, also belong to this family of defects. Presence of such defects affects many of the macroscopic properties of materials, for example electronic transport and strength. Materials in which topological aspects, e.g. edge or surface states, affect the electronic, transport and other properties can be described as topological materials. Topological insulators, topological superconductors and certain Dirac materials, e.g. graphene and Weyl semimetals, belong to this class of materials. Lastly, these materials possess unusual functionalities potentially useful in a variety of information processing and quantum computation based applications.

36 MATERIALS SCIENCE↗

MODULES FOR EXPERIMENTS IN STELLAR ASTROPHYSICS (MESA)

Stellar physics and evolution calculations enable a broad range of research in astrophysics. Modules for Experiments in Stellar Astrophysics (MESA) is a suite of open source, robust, efficient, thread-safe libraries for a wide range of applications in computational stellar astrophysics. A one-dimensional stellar evolution module, MESAstar, combines many of the numerical and physics modules for simulations of a wide range of stellar evolution scenarios ranging from very low mass to massive stars, including advanced evolutionary phases. MESAstar solves the fully coupled structure and composition equations simultaneously. It uses adaptive mesh refinement and sophisticated timestep controls, and supports shared memory parallelism based on OpenMP. State-of-the-art modules provide equation of state, opacity, nuclear reaction rates, element diffusion data, and atmosphere boundary conditions. Each module is constructed as a separate Fortran 95 library with its own explicitly defined public interface to facilitate independent development. Several detailed examples indicate the extensive verification and testing that is continuously performed and demonstrate the wide range of capabilities that MESA possesses. These examples include evolutionary tracks of very low mass stars, brown dwarfs, and gas giant planets to very old ages; the complete evolutionary track of a 1 M {sub sun} star from the pre-main sequence (PMS) to a cooling white dwarf; the solar sound speed profile; the evolution of intermediate-mass stars through the He-core burning phase and thermal pulses on the He-shell burning asymptotic giant branch phase; the interior structure of slowly pulsating B Stars and Beta Cepheids; the complete evolutionary tracks of massive stars from the PMS to the onset of core collapse; mass transfer from stars undergoing Roche lobe overflow; and the evolution of helium accretion onto a neutron star. MESA can be downloaded from the project Web site (http://mesa.sourceforge.net/).

79 ASTRONOMY AND ASTROPHYSICS↗

Path integral factorization and the gravitational effective action

Abstract We discuss the factorization and continuity properties of fields in the Euclidean gravitational path integral with higher dimension operators constructed from powers of the Riemann tensor. We construct the boundary terms corresponding to the microcanonical ensemble and show that the saddle point approximation to the path integral with a quasilocal energy constraint generally yields a saddle point with discontinuous temperature. This extends a previous result for the Euclidean Schwarzschild–de Sitter geometry in Einstein gravity and shows that it is robust against at least some types of quantum corrections from heavy fields. As an application, we compute the entropy of SdS in D = 4 using the BTZ method. Our result matches the entropy calculated using Wald’s formula.

Astronomy & Astrophysics↗

Observational measures of halo properties beyond mass

Different properties of dark matter haloes, including growth rate, concentration, interaction history, and spin, correlate with environment in unique, scale-dependent ways. While these halo properties are not directly observable, galaxies will inherit their host haloes’ correlations with environment. In this paper, we show how these characteristic environmental signatures allow using measurements of galaxy environment to constrain which dark matter halo properties are most tightly connected to observable galaxy properties. Here, we show that different halo properties beyond mass imprint distinct scale-dependent signatures in both the galaxy two-point correlation function and the distribution of distances to galaxies’ kth nearest neighbours, with features strong enough to be accessible even with low-resolution (e.g. grism) spectroscopy at higher redshifts. As an application, we compute observed two-point correlation functions for galaxies binned by half-mass radius at $z$ = 0 from the Sloan Digital Sky Survey, showing that classic galaxy size models (i.e. galaxy size being proportional to halo spin) as well as other recent proposals show significant tensions with observational data. We show that the agreement with observed clustering can be improved with a simple empirical model in which galaxy size correlates with halo growth.

79 ASTRONOMY AND ASTROPHYSICS↗

Universal clustering of dark matter in phase space

We have recently introduced a novel statistical measure of dark matter clustering in phase space, the particle phase-space average density (P 2 SAD). In a two-paper series, we studied the structure of P 2 SAD in the Milky Way-size Aquarius haloes, constructed a physically motivated model to describe it, and illustrated its potential as a powerful tool to predict signals sensitive to the nanostructure of dark matter haloes. In this work, we report a remarkable universality of the clustering of dark matter in phase space as measured by P 2 SAD within the subhaloes of host haloes across different environments covering a range from dwarf-size to cluster-size haloes (10 10 –10 15 M ⊙ ). Simulations show that the universality of P 2 SAD holds for more than seven orders of magnitude, over a 2D phase space, covering over three orders of magnitude in distance/velocity, with a simple functional form that can be described by our model. Invoking the universality of P 2 SAD, we can accurately predict the non-linear power spectrum of dark matter at small scales all the way down to the decoupling mass limit of cold dark matter particles. As an application, we compute the subhalo boost to the annihilation of dark matter in a wide range of host halo masses.

79 ASTRONOMY AND ASTROPHYSICS↗

Selection Metric for Photovoltaic Materials Screening Based on Detailed-Balance Analysis

The success of recently discovered absorber materials for photovoltaic applications has been generating increasing interest in systematic materials screening over the last years. However, the key for a successful materials screening is a suitable selection metric that goes beyond the Shockley-Queisser theory that determines the thermodynamic efficiency limit of an absorber material solely by its band-gap energy. Here, we develop a selection metric to quantify the potential photovoltaic efficiency of a material. Our approach is compatible with detailed balance and applicable in computational and experimental materials screening. We use the complex refractive index to calculate radiative and nonradiative efficiency limits and the respective optimal thickness in the high mobility limit. We also compare our model to the widely applied selection metric by Yu and Zunger [Phys. Rev. Lett. 108, 068701 (2012)] with respect to their dependence on thickness, internal luminescence quantum efficiency, and refractive index. Finally, the model is applied to complex refractive indices calculated via electronic structure theory.

14 SOLAR ENERGY↗

Conserved Killing charges of quadratic curvature gravity theories in arbitrary backgrounds

We extend the Abbott-Deser-Tekin procedure of defining conserved quantities of asymptotically constant-curvature spacetimes, and give an analogous expression for the conserved charges of geometries that are solutions of quadratic curvature gravity models in generic D dimensions and that have arbitrary asymptotes possessing at least one Killing isometry. We show that the resulting charge expression correctly reduces to its counterpart when the background is taken to be a space of constant curvature and, moreover, is background gauge invariant. As applications, we compute and comment on the energies of two specific examples: the three-dimensional Lifshitz black hole and a five-dimensional companion of the first, whose energy has never been calculated before.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time transients in the quantum corrected Newtonian potential induced by a massless nonminimally coupled scalar field

We calculate the one-loop graviton vacuum polarization induced by a massless, nonminimally coupled scalar field on Minkowski background. We make use of the Schwinger-Keldysh formalism, which allows us to study time dependent phenomena. As an application we compute the leading quantum correction to the Newtonian potential of a point particle. The novel aspect of the calculation is the use of the Schwinger-Keldysh formalism, within which we calculate the time transients induced by switching on the graviton-scalar coupling.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Accelerating Subsurface Transport Simulation on Heterogeneous Clusters

Reactive transport numerical models simulate chemical and microbiological reactions that occur along a flowpath. These models have to compute reactions for a large number of locations. They solve the set of ordinary differential equations (ODEs) that describes the reaction for each location through the Newton-Raphson technique. This technique involves computing a Jacobian matrix and a residual vector for each set of equation, and then solving iteratively the linearized system by performing Gaussian Elimination and LU decomposition until convergence. STOMP, a well known subsurface flow simulation tool, employs matrices with sizes in the order of 100x100 elements and, for numerical accuracy, LU factorization with full pivoting instead of the faster partial pivoting. Modern high performance computing systems are heterogeneous machines whose nodes integrate both CPUs and GPUs, exposing unprecedented amounts of parallelism. To exploit all their computational power, applications must use both the types of processing elements. For the case of subsurface flow simulation, this mainly requires implementing efficient batched LU-based solvers and identifying efficient solutions for enabling load balancing among the different processors of the system. In this paper we discuss two approaches that allows scaling STOMP's performance on heterogeneous clusters. We initially identify the challenges in implementing batched LU-based solvers for small matrices on GPUs, and propose an implementation that fulfills STOMP's requirements. We compare this implementation to other existing solutions. Then, we combine the batched GPU solver with an OpenMP-based CPU solver, and present an adaptive load balancer that dynamically distributes the linear systems to solve between the two components inside a node. We show how these approaches, integrated into the full application, provide speed ups from 6 to 7 times on large problems, executed on up to 16 nodes of a cluster with two AMD Opteron 6272 and a Tesla M2090 per node.

GPU↗

Collective I/O Tuning Using Analytical and Machine-Learning Models

The ever larger demand of scientific applications for computation and data is currently driving a continuous increase in scale of parallel computers. The inherent complexity of scaling up a computing systems in terms of both hardware and software stack exposes an increasing number of factors impacting the performance and complicating the process of optimization. In particular, the optimization of parallel I/O has become increasingly challenging due to increasing storage hierarchy and well known performance variability of shared storage systems. This paper focuses on model-based autotuning of the two-phase collective I/O algorithm from a popular MPI distribution on the Blue Gene/Q architecture. We propose a novel hybrid model, constructed as a composition of analytical models for communication and storage operations and black-box models for the performance of the individual operations. We perform an in-depth study of the complexity involved in performance modeling including architecture, software stack and noise. In particular we address this challenges of modeling the performance of shared storage systems by building a benchmark that helps synthesizing factors such as topology, file caching, and noise. The experimental results show that the hybrid approach produces significantly better results than state-of-the-art machine learning approaches and shows a higher robustness to noise, at the cost of a higher modeling complexity

I/O performance modeling↗

GMH: A Message Passing Toolkit for GPU Clusters

Driven by the market demand for high-definition 3D graphics, commodity graphics processing units (GPUs) have evolved into highly parallel, multi-threaded, many-core processors, which are ideal for data parallel computing. Many applications have been ported to run on a single GPU with tremendous speedups using general C-style programming languages such as CUDA. However, large applications require multiple GPUs and demand explicit message passing. This paper presents a message passing toolkit, called GMH (GPU Message Handler), on NVIDIA GPUs. This toolkit utilizes a data-parallel thread group as a way to map multiple GPUs on a single host to an MPI rank, and introduces a notion of virtual GPUs as a way to bind a thread to a GPU automatically. This toolkit provides high performance MPI style point-to-point and collective communication, but more importantly, facilitates event-driven APIs to allow an application to be managed and executed by the toolkit at runtime.

99 GENERAL AND MISCELLANEOUS↗

Distributed-memory Parallel Algorithms for Matching and Coloring

Graph matching and coloring constitute two fundamental classes of combinatorial problems having numerous established as well as emerging applications in computational science and engineering, high-performance computing, and informatics. We provide a snapshot of an on-going work on the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical problems from these classes, edge-weighted matching and distance-1 vertex coloring. Graph algorithms in general have low concurrency and poor data locality, making it challenging to achieve scalability on massively parallel machines. We overcome this challenge by employing a variety of techniques, including approximation, speculation and iteration, optimized communication, and randomization, in concert. We present preliminary results on weak and strong scalability studies conducted on an IBM Blue Gene/P machine employing up to tens of thousands of processors. The results show that the algorithms hold strong potential for computing at petascale.

Combinatorial scientific computing↗

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multi-threaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0x and 6.8x on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3x over the multi-thread encoder on two 28-core Xeon Platinum 8280 CPUs.

Tian, Jiannan↗

Numerical Simulations of Noisy Variational Quantum Eigensolver Ansatz Circuits

This is a case study of the variational quantum eigensolver (VQE) method using numerical simulations to test the influence of noise on the accuracy of the underlying circuit ansatz. We investigate a computational chemistry application of VQE to calculate the electronic ground state and its energy for Sodium Hydride (NaH), a prototypical two-electron problem. Using a one-parameter ansatz derived from unitary coupled cluster (UCC) theory, we simulate the effects of noise on the energy expectation value and variance with respect to the ansatz parameter. These numerical simulations provide insights into the accuracy of the prepared quantum state and the efficiency of the classical optimizer that iteratively refines the ansatz. We conduct a comparative study between analytical results derived for the UCC ansatz in the absence of noise and the noisy numerical simulation results obtained using an isotropic depolarizing noise model for each gate. We also compare the relative increase in noise on logically equivalent UCC ansatz circuits generated by randomized compiling. Notably, we observe that the intrinsic variance in the energy due to the simplicity of the ansatz itself compares with the noise induced by the bare circuit.

Gowrishankar, Meenambika↗

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗

How Excitation Conditions Alter the Afterglow Characteristics of CsI:Tl,Sm Microcolumnar Films

Combining high light output with the microcolumnar structure, the CsI:Tl films significantly reduce the need for painful tradeoff between thickness (hence, stopping power) and spatial resolution. But both films and monocrystals share two important deficiencies that hinder their use in many high-speed imaging and computed tomography applications: a persistent afterglow and hysteresis. These properties receive the primary attention of this investigation. In our earlier work, we reported that codoping with Sm 2+ brings about a significant reduction in the afterglow of CsI:Tl. Here, focusing on the microcolumnar films, we examine this afterglow-suppressive effect over a wide range of exposure times, from milliseconds to seconds, and at temperatures between 0 °C and 60 °C. Our measurements reveal well-defined dependences on both parameters. At room temperature (20 °C), defined as the normal operating condition, a 10-ms X-ray pulse leaves an afterglow from the standard (Sm-free) CsI:Tl of about 1% at 2 ms after the end of the pulse, changing little as a function of pulselength. Doping with Sm 2+ , however, reduces that afterglow by at least an order of magnitude, although somewhat less so after longer (100 and 1000 ms) pulses. When we change the temperature, however, we find markedly different behavior. Here, we find that a temperature increase of only 60°, without changing the pulselength, cuts the afterglow of standard CsI:Tl films by a factor of 20. However, films of codoped CsI:Tl,Sm, whose afterglow has already been suppressed by the presence of Sm 2+ , show much less change as a function of either temperature or pulse duration. It is the presence of Sm 2+ that makes the biggest difference. As for hysteresis, we again see an improvement, with the performance of the codoped CsI:Tl,Sm films bettering that of the standard (Sm-free) films. After an exposure of 300 mR, the change in light output falls to within 1% of the original after 1 min, whereas standard CsI:Tl films require 30 min to reach the same level.

42 ENGINEERING↗

TROPHY: A Topologically Robust Physics-Informed Tracking Framework for Tropical Cyclones

Tropical cyclones (TCs) are among the most destructive weather systems. Realistically and efficiently detecting and tracking TCs are critical for assessing their impacts and risks. In particular, the eye is a signature feature of a mature TC. Therefore, knowing the eyes’ locations and movements is crucial for both operational weather forecasts and climate risk assessments. Recently, a multilevel robustness framework has been introduced to study the critical points of time-varying vector fields. The framework quantifies the robustness (i.e., structural stability) of critical points across varying neighborhoods. By relating the multilevel robustness with critical point tracking, the framework has demonstrated its potential in cyclone tracking. An advantage is that it identifies cyclonic features using only 2D wind vector fields, which is encouraging as most tracking algorithms require multiple dynamic and thermodynamic variables at different altitudes. A disadvantage is that the framework does not scale well computationally for datasets containing a large number of cyclones. Herein this paper introduces a topologically robust physics-informed tracking framework (TROPHY) for TC tracking. The main idea is to integrate physical knowledge of TC to drastically improve the computational efficiency of multilevel robustness framework for large-scale climate datasets. First, during preprocessing, we propose a physics-informed feature selection strategy to filter 90% of critical points that are short-lived and have low stability, thus preserving good candidates for TC tracking. Second, during in-processing, we impose constraints during the multilevel robustness computation to focus only on physics-informed neighborhoods of TCs. We apply TROPHY to 30 years of 2D wind fields from reanalysis data in ERA5 and generate a number of TC tracks. In comparison with the observed tracks, we demonstrate that TROPHY can capture TC characteristics (e.g., frequency, intensity, duration, latitudes with maximum intensity, and genesis) that are comparable to and sometimes even better than a well-validated TC tracking algorithm that requires multiple dynamic and thermodynamic scalar fields.

97 MATHEMATICS AND COMPUTING↗

Location generalizability of image-based air quality models

This paper is to be submitted at the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) Computer Vision for Earth Observation workshop. The full paper abstract is below: The ability to rapidly quantify atmospheric pollutants is important both for global emissions monitoring and for mitigating the adverse effects that follow a hazardous chemical release. In the aftermath of a chemical release, imagery is often the only available resource to assess local conditions. Recent work has demonstrated initial success in predicting particulate matter pollution from imagery; however, these results are tied to a specific site and do not generalize to new geographic locations. In this work, we seek to understand how easily deep learning models generalize to new locations in the context of image-based air quality assessments, targeting two distinct tasks: (1) broad measures of particulate matter pollution, and (2) the mass of a given chemical released in hazardous plumes. For the latter, we focus on sulfur dioxide, a toxic aerosol and a major component of particulate matter pollution caused by industrial fossil fuel consumption. To develop a model that operates in the widest possible range of environments, we test different training strategies, including the use of new geolocation foundation models. The best performing models achieve >80% accuracy when evaluating unseen imagery at previously seen sites, but we find significant drops in performance when evaluating imagery from unseen sites, at best 65%. Additionally, we present the public release of the National Parks Air Quality Index Dataset, a new medium-sized dataset that pairs imagery with sensor-based air quality measurements at 15 different national parks.

Byler, Eleanor B. [BATTELLE (PACIFIC NW LAB)]↗