Exascale Algorithms for Generalized MPI_Comm_split
Abstract not provided
SEARCH · Engineering Papers
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.
Abstract not provided
Not Available
Two Monte Carlo algorithms originally proposed by Zimmerman and Zimmerman and Adams for particle transport through a binary stochastic mixture are numerically compared using a standard set of planar geometry benchmark problems. In addition to previously-published comparisons of the ensemble-averaged probabilities of reflection and transmission, we include comparisons of detailed ensemble-averaged total and material scalar flux distributions. Because not all benchmark scalar flux distribution data used to produce plots in previous publications remains available, we have independently regenerated the benchmark solutions including scalar flux distributions. Both Monte Carlo transport algorithms robustly produce physically-realistic scalar flux distributions for the transport problems examined. The first algorithm reproduces the standard Levermore-Pomraning model results for the probabilities of reflection and transmission. The second algorithm generally produces significantly more accurate probabilities of reflection and transmission and also significantly more accurate total and material scalar flux distributions.
An implicit multi-dimensional particle-in-cell (PIC) code is developed to study the interaction of ultrashort pulse lasers with matter. The algorithm is based on current density decomposition and is only marginally more complicated compared to explicit PIC codes, but it completely eliminates grid heating and possesses good energy conserving properties with relaxed time step and grid resolution. This is demonstrated in a test case study, in which high-energy protons are generated from a thin carbon foil at solid density using linear and circular polarizations. The grid heating rate is estimated to be 1-10 eV/ps.
Abstract Not Provided
Abstract not provided.
Explore the source record for details and available documents.
We present a unifying framework to study physical systems which exhibit topological quantum order (TQO). The major guiding principle behind our approach is that of symmetries and entanglement. These symmetries may be actual symmetries of the Hamiltonian characterizing the system, or emergent symmetries. To this end, we introduce the concept of low-dimensional Gauge-like symmetries (GLSs), and the physical conservation laws (including topological terms, fractionalization, and the absence of quasi-particle excitations) which emerge from them. We prove then sufficient conditions for TQO at both zero and finite temperatures. The physical engine for TQO are topological defects associated with the restoration of GLSs. These defects propagate freely through the system and enforce TQO. Our results are strongest for gapped systems with continuous GLSs. At zero temperature, selection rules associated with the GLSs enable us to systematically construct general states with TQO; these selection rules do not rely on the existence of a finite gap between the ground states to all other excited states. Indices associated with these symmetries correspond to different topological sectors. All currently known examples of TQO display GLSs. Other systems exhibiting such symmetries include Hamiltonians depicting orbital-dependent spin-exchange and Jahn-Teller effects in transition metal orbital compounds, short-range frustrated Klein spin models, and p+ip superconducting arrays. The symmetry based framework discussed herein allows us to go beyond standard topological field theories and systematically engineer new physical models with finite temperature TQO (both Abelian and non-Abelian). Furthermore, we analyze the insufficiency of entanglement entropy (we introduce SU(N) Klein models on small world networks to make the argument even sharper), spectral structures, maximal string correlators, and fractionalization in establishing TQO. We show that Kitaev's Toric code model and Wen's plaquette model are equivalent and reduce, by a duality mapping, to an Ising chain, demonstrating that despite the spectral gap in these systems the toric operator expectation values may vanish once thermal fluctuations are present. This illustrates the fact that the quantum states themselves in a particular (operator language) representation encode TQO and that the duality mappings, being non-local in the original representation, disentangle the order. We present a general algorithm for the construction of long-range string and brane orders in general systems with entangled ground states; this algorithm relies on general ground states selection rules and becomes of the broadest applicability in gapped systems in arbitrary dimensions. We exactly recast some known non-local string correlators in terms of local correlation functions. We discuss relations to problems in graph theory.
Tomography has made a radical impact on diverse fields ranging from the study of 3D atomic arrangements in matter to the study of human health in medicine. Despite its very diverse applications, the core of tomography remains the same, that is, a mathematical method must be implemented to reconstruct the 3D structure of an object from a number of 2D projections. Here, we present the mathematical implementation of a tomographic algorithm, termed GENeralized Fourier Iterative REconstruction (GENFIRE), for high-resolution 3D reconstruction from a limited number of 2D projections. GENFIRE first assembles a 3D Fourier grid with oversampling and then iterates between real and reciprocal space to search for a global solution that is concurrently consistent with the measured data and general physical constraints. The algorithm requires minimal human intervention and also incorporates angular refinement to reduce the tilt angle error. We demonstrate that GENFIRE can produce superior results relative to several other popular tomographic reconstruction techniques through numerical simulations and by experimentally reconstructing the 3D structure of a porous material and a frozen-hydrated marine cyanobacterium. As a result, equipped with a graphical user interface, GENFIRE is freely available from our website and is expected to find broad applications across different disciplines.
State-of-the-art atomic and optical clocks have the great potential to precisely test fundamental physical assumptions and enhance our understanding of nature. Their widespread applications require us to rigorously deduce the relativistic frequency shift in the framework of general relativity. One interesting question for clocks is tidal field effect which contains variously periodic variations. By introducing tidally deformed Earth, the general algorithms for clock and frequency comparisons are derived. We investigate the effects of external gravitational bodies and Earth’s tidal deformation on the ground- and space-based clocks. The orbital elements of satellite and locations of laboratory are introduced for corresponding clocks, in which the secular and long-period terms and short-period terms are subsequently presented. These effects called tidal clock effects produce the non-negligible contributions in the modern clock experiments and can be directly evaluated from our parameterized formulas. In addition, we also demonstrate for tidal clock effects the position and distance dependences, as well as periodicity. These tidal effects and dependences can provide valuable information for the clock comparison experiments.
The goal of this work is to develop a fast computed tomography (CT) reconstruction algorithm based on graphics processing units (GPU) that achieves significant improvement over traditional central processing unit (CPU) based implementations. The main challenge in developing a CT algorithm that is capable of handling very large datasets is parallelizing the algorithm in such a way that data transfer does not hinder performance of the reconstruction algorithm. General Purpose Graphics Processing (GPGPU) is a new technology that the Science and Technology (S&T) community is starting to adopt in many fields where CPU-based computing is the norm. GPGPU programming requires a new approach to algorithm development that utilizes massively multi-threaded environments. Multi-threaded algorithms in general are difficult to optimize since performance bottlenecks occur that are non-existent in single-threaded algorithms such as memory latencies. If an efficient GPU-based CT reconstruction algorithm can be developed; computational times could be improved by a factor of 20. Additionally, cost benefits will be realized as commodity graphics hardware could potentially replace expensive supercomputers and high-end workstations. This project will take advantage of the CUDA programming environment and attempt to parallelize the task in such a way that multiple slices of the reconstruction volume are computed simultaneously. This work will also take advantage of the GPU memory by utilizing asynchronous memory transfers, GPU texture memory, and (when possible) pinned host memory so that the memory transfer bottleneck inherent to GPGPU is amortized. Additionally, this work will take advantage of GPU-specific hardware (i.e. fast texture memory, pixel-pipelines, hardware interpolators, and varying memory hierarchy) that will allow for additional performance improvements.
We developed a general algorithm for online optimization of accelerator performance, i.e., online tuning, using the performance measure as the objective function. This method, named robust conjugate direction search (RCDS), combines the conjugate direction set approach of Powell's method with a robust line optimizer which considers the random noise in bracketing the minimum and uses parabolic fit of data points that uniformly sample the bracketed zone. Moreover, it is much more robust against noise than traditional algorithms and is therefore suitable for online application. Simulation and experimental studies have been carried out to demonstrate the strength of the new algorithm.
We develop a general algorithm for the analysis the spectral stability of generalized multistage Runge–Kutta methods of various orders of accuracy as applied to the numerical integration with respect to time of an initial-boundary-value problem for the second-order parabolic equation. The expression for the function of spectral stability is obtained in two alternative forms: on the basis of matrix relations and in the determinant form. We study specific realizations of various generalized explicit Runge–Kutta methods and their spectral stability. It is shown that all explicit generalized Runge–Kutta methods possess the property of conditional spectral stability and the property of conditional monotonicity of the numerical solution in time whose violation leads to the appearance of false oscillations of the approximate solution. The stability function for these methods is polynomial. It is shown that the application of two-stage generalized explicit Runge–Kutta methods leads to the appearance of predictor-corrector-type schemes. In the case of nonstationary one-dimensional heat-conduction problem, on the basis of a one-stage generalized Runge–Kutta method, we obtain the classical two-layer conditionally stable explicit finite-difference scheme on a four-point template. It is demonstrated that the five-stage generalized Runge–Kutta–Merson method is characterized by the weakest condition of spectral stability as compared with all investigated explicit generalized Runge–Kutta methods.
We present our development of a series of efficient computation algorithms, generally usable to calculate light diffraction and particularly for speckle pattern simulation. We use mainly the scalar diffraction theory in the form of Rayleigh-Sommerfeld diffraction formula and its Fresnel approximation. Our algorithms are based on a special form of the convolution theorem and the Fast Fourier Transform. They are able to evaluate the diffraction formula much faster than by direct computation and we have circumvented the restrictions regarding the relative sizes of the input and output domains, met on commonly used procedures. Moreover, the input and output planes can be tilted each to other and the output domain can be off-axis shifted.
Solomon has developed a methodology to determine a large optimum point where availability meets maintenance spending for Powder River Basin (PRB) coal-fired units. Using a database of sufficient size and composition across various operating ranges, Solomon generated an algorithm that predicts the relationship between maintenance spending and availability. Coupling this generalized algorithm with a unit-specific market-loss curve determines the optimum spending for a facility. The article presents the results of the analysis, how this methodology can be applied to develop optimum operating and financial targets for specific units and markets and a process to achieve those targets. It also describes how this methodology can be used for other types of fossil-fired technologies and future enhancements to the analysis. 5 figs.
A new method, which enables one to solve some diffraction problems, is put forth. The technique is based on a relation between the diffracted and scattered geometric optics waves at the transition boundaries. The concept of initial waves is also used instead of the incident field. The general algorithm of the method is outlined and applied to the diffraction problems of waves by perfect electric conductor half-screen, resistive half-plane and impedance sheet junction.