Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 901 records · Page 50

GX: a GPU-native gyrokinetic turbulence code for tokamak and stellarator design

GX is a code designed to solve the nonlinear gyrokinetic system for low-frequency turbulence in magnetized plasmas, particularly tokamaks and stellarators. In GX, our primary motivation and target is a fast gyrokinetic solver that can be used for fusion reactor design and optimization along with wide-ranging physics exploration. Here, this has led to several code and algorithm design decisions, specifically chosen to prioritize time to solution. First, we have used a discretization algorithm that is pseudospectral in the entire phase space, including a Laguerre–Hermite pseudospectral formulation of velocity space, which allows for smooth interpolation between coarse gyrofluid-like resolutions and finer conventional gyrokinetic resolutions and efficient evaluation of a model collision operator. Additionally, we have built GX to natively target graphics processors (GPUs), which are among the fastest computational platforms available today. Finally, we have taken advantage of the reactor-relevant limit of small $\rho _*$ by using the radially local flux-tube approach. In this paper we present details about the gyrokinetic system and the numerical algorithms used in GX to solve the system. We then present several numerical benchmarks against established gyrokinetic codes in both tokamak and stellarator magnetic geometries to verify that GX correctly simulates gyrokinetic turbulence in the small $\rho _*$. Moreover, we show that the convergence properties of the Laguerre–Hermite spectral velocity formulation are quite favourable for nonlinear problems of interest. Coupled with GPU acceleration, which we also investigate with scaling studies, this enables GX to be able to produce useful turbulence simulations in minutes on one (or a few) GPUs and higher fidelity results in a few hours using several GPUs. GX is open-source software that is ready for fusion reactor design studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

RADIO PULSAR BINARIES IN GLOBULAR CLUSTERS: THEIR ORBITAL ECCENTRICITIES AND STELLAR INTERACTIONS

High sensitivity searches of globular clusters (GCs) for radio pulsars by improved pulsar search algorithms and sustained pulsar timing observations have so far yielded some 140 pulsars in more than two dozen GCs. The observed distribution of orbital eccentricity and period of binary radio pulsars in GCs have imprints of the past interaction between single pulsars and binary systems or of binary pulsars and single passing noncompact stars. It is seen that GCs have different groups of pulsars. These may have arisen out of exchange or merger of a component of the binary with the incoming star or a 'fly-by' in which the original binary remains intact but undergoes a change of eccentricity and orbital period. We consider the genesis of the distribution of pulsars using analytical and computational tools such as STARLAB, which performs numerical scattering experiments with direct N-body integration. Cluster pulsars with intermediate eccentricities can mostly be accounted for by fly-bys, whereas those with high eccentricities are likely to be the result of exchanges and/or mergers of single stars with the binary companion of the pulsar, although there are a few objects which do not easily fit into this description. The corresponding distribution for galactic field pulsars shows notable differences from the GC pulsar orbital period and eccentricity distribution. The long orbital period pulsars in the galactic field with frozen out low eccentricities are largely missing from the GCs, and we show that the ionization of these systems in GCs cannot alone account for the peculiarities.

79 ASTRONOMY AND ASTROPHYSICS↗

Accelerated Distributed Energy Management for Microgrids

This paper considers the optimal energy management for a microgrid. The goal of optimal energy management is to minimize the total generation cost while meeting total demand and satisfying individual generator output limits. To achieve this goal, we develop a distributed algorithm based on the consensus theory and gradient estimation technique. Compared to the existing algorithms with diminishing step-sizes, the proposed algorithm enjoys a faster convergence speed due to the fixed step-size, and thus increases the computation speed, and reduces the computation and communication burden. The proposed distributed algorithm is applicable to both fixed and time-varying directed communication networks. We show that the convergence of the proposed distributed algorithm is achieved if the fixed communication network is strongly connected, or if the time-varying communication network is uniformly jointly strongly connected. Numerical simulation results are used to illustrate and demonstrate the effectiveness of the proposed algorithm.

Du, Wen↗

Scheme for stabilising the phase and arrival time of ultrashort laser pulses in a coherent beam combining fibre system

An algorithm has been demonstrated for simultaneously measuring the phase and arrival time of optical pulses relative to pulses in a reference channel using one detector array. Based on this algorithm, a simple optoelectronic pulse phase and arrival time stabilisation scheme has been designed for operation in a coherent beam combining fibre system for ultrashort pulses (including chirped ones). We have studied the performance of the stabilisation scheme. In particular, we have reached a phase measurement rate of 25 000 cps, demonstrated an ∼ 2 kHz limiting phase stabilisation frequency in a feedback loop, and obtained an arrival time measurement accuracy of ∼ 5 % of the transform-limited pulse duration at a measurement rate of 5 cps. In experiments concerned with coherent beam combining for two channels of a pulsed fibre system at a wavelength of 1030 nm, we have demonstrated phase stabilisation with an accuracy better than λ/100 and delay setting accuracy of 10 fs at a transform-limited pulse duration of ∼ 200 fs and obtained 94 % beam combining efficiency. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

FY09 Advanced Instrumentation and Active Interrogation Research for Safeguards

Multiple small-scale projects have been undertaken to investigate advanced instrumentation solutions for safeguard measurement challenges associated with advanced fuel cycle facilities and next-generation fuel reprocessing installations. These activities are in support of the U.S. Department of Energy's Fuel Cycle Research and Development program and its Materials Protection, Accounting, and Control for Transmutation (MPACT) campaign. 1) Work was performed in a collaboration with the University of Michigan (Prof. Sara Pozzi, co-PI) to investigate the use of liquid-scintillator radiation detectors for assaying mixed-oxide (MOX) fuel, to characterize its composition and to develop advanced digital pulse-shape discrimination algorithms for performing time-correlation measurements in the MOX fuel environment. This work included both simulations and experiments and has shown that these techniques may provide a valuable approach for use within advanced safeguard measurement scenarios. 2) Work was conducted in a collaboration with Oak Ridge National Laboratory (Dr. Paul Hausladen, co-PI) to evaluate the strengths and weaknesses of the fast-neutron coded-aperture imaging technique for locating and characterizing fissile material, and as a tool for performing hold-up measurements in fissile material handling facilities. This work involved experiments at Idaho National Laboratory, using MOX fuel and uranium metal, in both passive and active interrogation configurations. A complete analysis has not yet been completed but preliminary results suggest several potential uses for the fast neutron imaging technique. 3) Work was carried out to identify measurement approaches for determining nitric acid concentration in the range of 1 – 4 M and beyond. This work included laboratory measurements to investigate the suitability of prompt-gamma neutron activation analysis for this measurement and product reviews of other commercial solutions. Ultrasonic density analysis appears to be the best candidate technology for determining nitric acid concentrations but the PGNAA approach may also be applicable. 4) Work was also carried out to begin investigating the use of remote UV imaging to detect air-ionization induced by alpha particle emission from plutonium. This approach has been shown elsewhere as a useful tool for detecting and quantifying plutonium contamination and has the potential of providing a unique and powerful approach for quantifying hold-up in reprocessing facilities. Based on these simple scoping experiments the potential far-reaching capabilities of the measurement are clear.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SmartApps: Middle-ware for Adaptive Applications on Reconfigurable Platforms

There are several reasons why the performance of current distributed and heterogeneous systems is often disappointing. For example, the characteristics of the application may be input sensitive and evolve during execution causing dramatic changes in memory reference patterns, resource requirements, or degree of concurrency between different phases of the computation. Or, the system may change dynamically with nodes failing or appearing, some network links severed and other links established with different latencies and bandwidths. Another important reason for poor performance is the fairly compartmentalized approach to optimization: applications, compilers, operating systems and hardware configurations are designed and optimized in isolation and without the knowledge of instance specific information and needs of a running application. There is too little information flow across these boundaries and no global optimization is even attempted. For example, most operating systems services like paging, virtual-to-physical page mapping, I/O, or data layout in disks, provide little or no application customization. Similarly, the off-the-shelf hardware used by most commercial systems is optimized to give best average-case performance. To address this problem, we have proposed application-centric computing, or Smart Applications (SAS). In the SAS executable, the compiler embeds most run-time system services, and a performance-optimizing feedback loop that monitors the application's performance and adaptively reconfigures the application and the OS/system platform. At run-time, after incorporating the code's input and determining the system's resources and state, the SAS performs an *instance* specific optimization, which is more tractable than a global generic optimization between application, OS and system. The overriding philosophy of SAS is ``measure, compare, and adapt if beneficial.'' That is, the application will continually monitor its performance and the available resources to determine if, and by how much, performance could be improved if the application was restructured. Then, if the potential performance benefit outweighs the projected overhead costs, the application will restructure itself and the underlying system accordingly. The SAS framework includes performance monitoring and modeling components and mechanisms for performing the actual restructuring at various levels including: (i) algorithmic adaptation, (ii) run-time software optimization (e.g., input sensitivity analysis, etc.), (iii) tuning reconfigurable OS services (scheduling policy, page size, etc), and (iv) system configuration (e.g., selecting which, and how many, computational resources to use). SmartApps is being developed in the STAPL infrastructure. STAPL (the Standard Template Adaptive Parallel Library) is a framework for developing highly-optimizable, adaptable, and portable parallel and distributed applications. It consists of a relatively new and still evolving collection of generic parallel algorithms and distributed containers and a run-time system (RTS) through which the application and compiler interact with the OS and hardware.

97 MATHEMATICS AND COMPUTING↗

Adaptive Runtime Features For Distributed Graph Algorithms

Performance of distributed graph algorithms can benefit greatly by forming rapport between algorithmic abstraction and the underlying runtime system that is responsible for scheduling work and exchanging messages. However, due to their dynamic and irregular nature of computation, distributed graph algorithms written in different programming models impose varying degree of workload pressure on the runtime. To cope with such vastly different workload characteristics, a runtime has to make several trade-offs. One such trade-off arises, for example, when the runtime scheduler has to choose among alternatives such as whether to execute algorithmic work, or progress the network by probing network buffers, or throttle sending messages (termed flow control). This tradeoff decides between optimizing the throughput of a runtime scheduler by increasing the rate of execution of algorithmic work, and reducing the latency of the network messages. Another trade-off exists when a decision has to be made about when to send aggregated messages in buffers (message coalescing). This decision chooses between trading off latency for network bandwidth and vice versa. At any instant, such trade-offs emphasize either on improving the quantity of work being executed (by maximizing the scheduler throughput) or on improving the quality of work (by prioritizing better work). However, encoding static policies for different runtime features (such as flow control, coalescing) can prevent graph algorithms from achieving their full potential, thus can undermine the actual performance of a distributed graph algorithm . In this paper, we investigate runtime support for distributed graph algorithms in the context of two paradigms: variants of wellknown Bulk-Synchronous Parallel model and asynchronous programming model. We explore generic runtime features such as message coalescing (aggregation) and flow control and show that execution policies of these features need to be adjusted over time to make a positive impact on the execution time of a distributed graph algorithm. Since synchronous and asynchronous graph algorithms have different workload characteristics, not all of such runtime features may be good candidates for adaptation. Each of these algorithmic paradigms may require different set of features to be adapted over time. We demonstrate which set of feature(s) can be useful in each case to achieve the right balance of work in the runtime layer. Existing implementation of different graph algorithms can benefit from adapting dynamic policies in the underlying runtime.

Firoz, Jesun S.↗

Mixed time slicing in path integral simulations

A simple and efficient scheme is presented for using different time slices for different degrees of freedom in path integral calculations. This method bridges the gap between full quantization and the standard mixed quantum-classical (MQC) scheme and, therefore, still provides quantum mechanical effects in the less-quantized variables. Underlying the algorithm is the notion that time slices (beads) may be 'collapsed' in a manner that preserves quantization in the less quantum mechanical degrees of freedom. The method is shown to be analogous to multiple-time step integration techniques in classical molecular dynamics. The algorithm and its associated error are demonstrated on model systems containing coupled high- and low-frequency modes; results indicate that convergence of quantum mechanical observables can be achieved with disparate bead numbers in the different modes. Cost estimates indicate that this procedure, much like the MQC method, is most efficient for only a relatively few quantum mechanical degrees of freedom, such as proton transfer. In this regime, however, the cost of a fully quantum mechanical simulation is determined by the quantization of the least quantum mechanical degrees of freedom.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A high-order WENO-limited finite-volume algorithm for atmospheric flow using the ADER-differential transform time discretization

A high-order-accurate weighted essentially non-oscillatory (WENO) limited upwind finite-volume scheme is detailed for the compressible, nonhydrostatic, inviscid Euler equations using an arbitrary derivatives (ADER) time-stepping scheme based on differential transforms (DTs). A second-order-accurate alternating Strang dimensional splitting is compared against multidimensional simulation with 2D transport using solid body rotation of various data. The two were found to give nearly identical accuracy in orthogonal, Cartesian coordinates. Orders of convergence are demonstrated at up to ninth-order accuracy with 2D transport. 1D transport is used to confirm that error decreases monotonically with increasing order of accuracy with WENO limiting even for discontinuous data. Further, WENO limiting always decreased the error compared with simulation without limiting in the L 1 norm. A series of standard 2D compressible nonhydrostatic Euler equation test cases were validated against previous results from literature. Finally, it was demonstrated that increasing the order of accuracy led to better resolved features and increased power for kinetic energy at small wavelengths.

54 ENVIRONMENTAL SCIENCES↗

Search for the pair production of long-lived supersymmetric partners of the tau lepton in proton-proton collisions at $\sqrt{s}=13$ TeV

Gauge-mediated supersymmetry-breaking models provide a strong motivation to search for a supersymmetric partner of the tau lepton (stau) with a macroscopic lifetime. Long-lived stau decays produce tau leptons that are displaced from the primary proton-proton interaction vertex, leading to an unconventional signature. This paper presents a search for the direct production of long-lived staus decaying within the CMS tracker volume in proton-proton collisions at $\sqrt{s}=13$ TeV, performed for the first time with an identification algorithm based on a graph neural network dedicated to displaced tau leptons. The data sample, corresponding to an integrated luminosity of 138 fb −1 , was recorded with the CMS experiment at the CERN LHC between 2016 and 2018. This search excludes, at 95% confidence level, stau masses, m~ τ , in the 126–260 (90–425) GeV range for a proper decay length of 50 mm in the maximally mixed (mass-degenerate) scenario, while for m~ τ = 200 GeV, stau proper decay lengths are excluded in the range 21–94 (6–333) mm. These results improve the exclusion limits compared to previous searches, and extend the parameter space explored in the context of supersymmetry.

Hadron-Hadron Scattering↗

CT urography: how to optimize the technique

Purpose: Computed tomography urography (CTU) has emerged as the modality of choice for imaging the urinary tract within the past few decades. It is a powerful tool that enables detailed anatomic evaluation of the urinary tract in order to identify primary urothelial malignancies, benign urinary tract conditions, and associated abdominopelvic pathologies. As such, there have been extensive efforts to optimize CTU protocol. Methods: This article reviews the published literature on CTU protocol optimization, including contrast bolus timing, dose reduction, reconstruction algorithms, and ancillary practices. Conclusion: There have been many advances in CTU techniques, which allow for imaging diagnosis of a wide spectrum of diseases while minimizing radiation dose and maximizing urinary tract distension and opacification.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Field–potential finite-difference time-domain (FiPo FDTD) technique for computational electromagnetics

Modeling light–matter interactions at the nanoscale requires accurate handling of coupled quantum and electromagnetic systems. This coupling requires information about the electric scalar potential Φ and the magnetic vector potential A, which are not typically calculated in standard computational electromagnetics implementations. To that end, we have developed a field–potential finite-difference time-domain (FiPo FDTD) algorithm, which solves a set of first-order equations for Φ and A alongside equations for the electric and magnetic fields E and H. The FiPo Basic code is essentially conventional FDTD, but with an added module that calculates the potentials. The FiPo Hybrid code self-consistently calculates both fields and potentials and is particularly suitable for coupling with quantum electronic transport solvers because it can be sourced by the potentials themselves. To terminate the domain and mimic infinite space, we have derived and implemented a convolutional perfectly matched layer (CPML) absorbing boundary condition for FiPo FDTD whose performance is on par with state-of-the-art CPMLs for standard FDTD. We present FiPo simulation results on several example systems.

Avazpour, L. [University of Wisconsin-Madison, WI ↗

Effective construction of eigenvectors for a class of singular sparse matrices

Fundamental results and an efficient algorithm for constructing eigenvectors corresponding to non-zero eigenvalues of matrices with zero rows and/or columns are developed. The formulation is built on the relation between eigenvectors of such matrices and the eigenvectors of their submatrices after removing all zero rows and columns. While being easily utilized, the algorithm decreases the computation time needed for numerical eigenanalysis, and resolves potential numerical eigensolver instabilities.

97 MATHEMATICS AND COMPUTING↗

Enhancing flexibility for climate change using seasonal energy storage (aquifer thermal energy storage) in distributed energy systems

Long-term energy storage is expected to play a vital role in the deep decarbonization of building energy sectors, while enhancing the flexibility of buildings to withstand future climate variations. However, it is challenging to design distributed multi-energy systems (DMES) while taking into account the uncertainties introduced by climate change, since stochastic optimization of such systems is difficult. The present study introduces a stochastic optimization model to address this bottleneck, taking into account DMES including aquifer thermal energy storage (ATES) as the long-term thermal storage. For the first time, a novel optimization algorithm links ATES with the DMES optimization model with the support of a simplified geotechnical model. Subsequently, a case study was conducted, focusing on a residential district in Chicago where the impact of future climate condition, energy demand, and solar and wind energy potentials were evaluated using Weather Research and Forecasting (WRF) data (up to 2080) and the EnergyPlus model. The study revealed that ATES is an attractive way to improve the renewable energy penetration level and minimize the dependence on fossil fuels with reasonable support from the grid to assist the fluctuations in both demand and generation. Furthermore, ATES notably reduces fuel consumption and dependence while greatly enhancing the flexibility of the energy system to withstand fluctuations in demand and renewable energy generation brought by future climate variations. These qualities will make ATES an important part of distributed energy systems, even though it is not currently the lowest cost alternative due to lack of technology maturity. Furthermore, the design platform introduced in the present study can be used to design DMES enhancing flexibility to accommodate future climate variations.

25 ENERGY STORAGE↗

On domain symmetry and its use in homogenization

The present study focuses on solving partial differential equations in domains exhibiting symmetries and periodic boundary conditions for the purpose of homogenization. We show in a systematic manner how the symmetry can be exploited to significantly reduce the complexity of the problem and the computational burden. This is especially relevant in inverse problems, when one needs to solve the partial differential equation (the primal problem) many times in an optimization algorithm. The main motivation of our study is inverse homogenization used to design architected composite materials with novel properties which are being fabricated at ever increasing rates thanks to recent advances in additive manufacturing. For example, one may optimize the morphology of a two-phase composite unit cell to achieve isotropic homogenized properties with maximal bulk modulus and minimal Poisson ratio. Typically, the isotropy is enforced by applying constraints to the optimization problem. However, in two dimensions, one can alternatively optimize the morphology of an equilateral triangle and then rotate and reflect the triangle to form a space filling D 3 symmetric hexagonal unit cell that necessarily exhibits isotropic homogenized properties. One can further use this D 3 symmetry to reduce the computational expense by performing the “unit strain” periodic boundary condition simulations on the single triangle symmetry sector rather than the six fold larger hexagon. In this paper we use group representation theory to derive the necessary periodic boundary conditions on the symmetry sectors of unit cells. The developments are done in a general setting, and specialized to the two-dimensional dihedral symmetries of the abelian D 2 , i.e. orthotropic, square unit cell and nonabelian D 3 , i.e. trigonal, hexagon unit cell. We then demonstrate how this theory can be applied by evaluating the homogenized properties of a two-phase planar composite over the triangle symmetry sector of a D 3 symmetric hexagonal unit cell.

36 MATERIALS SCIENCE↗

Improved treatment of exact exchange in Quantum ESPRESSO

Here, we present an algorithm and implementation for the parallel computation of exact exchange in Quantum ESPRESSO (QE) that exhibits greatly improved strong scaling. QE is an open-source software package for electronic structure calculations using plane wave density functional theory, and supports the use of local, semi-local, and hybrid DFT functionals. Wider application of hybrid functionals is desirable for the improved simulation of electronic band energy alignments and thermodynamic properties, but the computational complexity of evaluating the exact exchange potential limits the practical application of hybrid functionals to large systems and requires efficient implementations. We demonstrate that existing implementations of hybrid DFT that utilize a single data structure for both the local and exact exchange regions of the code are significantly limited in the degree of parallelization achievable. We present a band-pair parallelization approach, in which the calculation of exact exchange is parallelized and evaluated independently from the parallelization of the remainder of the calculation, with the wavefunction data being efficiently transformed on-the-fly into a form that is optimal for each part of the calculation. For a 64 water molecule supercell, our new algorithm reduces the overall time to solution by nearly an order of magnitude.

97 MATHEMATICS AND COMPUTING↗

ED-cPSD: Fast Phase-Size Distribution via Sequential Erosion-Dilation

The Erosion-Dilation continuous Phase-Size Distribution, ED-cPSD, is an application for calculating continuous pore and particle-size distribution from digital reconstructions and/or image-based structural data. It is based on the erosion-dilation continuous phase-size distribution method. A continuous size distribution is a measure of the probability density of finding a particle or pore of a certain size. These distributions are of interest in any field of study involving porous media, including but not limited to electrochemistry, petroleum engineering, geology, and food science. The algorithm behind the software provides a computationally efficient way to calculate phase-size distributions for large domains. For a 3D battery electrode reconstruction with 1.3 x 10 8 voxels, the particle size distribution is derived in under 2 min on a desktop, while also retaining flexibility and computational efficiency for HPC-scale multi-threading. The software can handle structures with over 10 9 voxels. The algorithm is roughly 280 times faster than a previous version on the same task.

Characterization↗