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 397 records · Page 22

Taking a quantum leap in time to solution for simulations of high-Tc superconductors

We present a new quantum cluster algorithm to simulate models of high-Tc superconductors. This algorithm extends current methods with continuous lattice self-energies, thereby removing artificial long-range correlations. This cures the fermionic sign problem in the underlying quantum Monte Carlo solver for large clusters and realistic values of the Coulomb interaction in the entire temperature range of interest. We find that the new algorithm improves time-to-solution by nine orders of magnitude compared to current, state of the art quantum cluster simulations. An efficient implementation is given, which ports to multi-core as well as hybrid CPU-GPU systems. Running on 18,600 nodes on ORNL's Titan supercomputer enables us to compute a converged value of Tc/t = 0.053 ± 0.0014 for a 28 site cluster in the 2D Hubbard model with U/t = 7 at 10% hole doping. Typical simulations on Titan sustain between 9.2 and 15.4 petaflops (double precision measured over full run), depending on configuration and parameters used.

42 ENGINEERING↗

Digital Electronics and Their Application to Beta Decay Spectroscopy

Significant advantages can be obtained through the application of digital electronics to nuclear physics experiments by replacing the traditional timing and shaping circuits by numerical algorithms implemented in real time. One example demonstrating the power of digital techniques is the achievement of a low-energy threshold, <50 keV, for the detection of beta-decay electrons in a thick Si detector. Such a low beta detection threshold would dramatically improve the detection efficiency in standard beta decay correlation experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Online multi-objective particle accelerator optimization of the AWAKE electron beam line for simultaneous emittance and orbit control

Multi-objective optimization is important for particle accelerators where various competing objectives must be satisfied routinely such as, for example, transverse emittance vs bunch length. We develop and demonstrate an online multi-time scale multi-objective optimization algorithm that performs real time feedback on particle accelerators. We demonstrate the ability to simultaneously minimize the emittance and maintain a reference trajectory of a beam in the electron beamline in CERN’s Advanced Proton Driven Plasma Wakefield Acceleration Experiment.

43 PARTICLE ACCELERATORS↗

Numerical solution of the time dependent neutron transport equation by the method of the characteristics

This study presents three numerical algorithms to solve the time dependent neutron transport equation by the method of the characteristics. The algorithms have been developed taking into account delayed neutrons and they have been implemented into the novel MCART code, which solves the neutron transport equation for two-dimensional geometry and an arbitrary number of energy groups. The MCART code uses regular mesh for the representation of the spatial domain, it models up-scattering, and takes advantage of OPENMP and OPENGL algorithms for parallel computing and plotting, respectively. The code has been benchmarked with the multiplication factor results of a Boiling Water Reactor, with the analytical results for a prompt jump transient in an infinite medium, and with PARTISN and TDTORT results for cross section and source transients. The numerical simulations have shown that only two numerical algorithms are stable for small time steps.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Investigating the limits of PET/CT imaging at very low true count rates and high random fractions in ion-beam therapy monitoring

Purpose: External beam radiotherapy with protons and heavier ions enables a tighter conformation of the applied dose to arbitrarily shaped tumor volumes with respect to photons, but is more sensitive to uncertainties in the radiotherapeutic treatment chain. Consequently, an independent verification of the applied treatment is highly desirable. For this purpose, the irradiation-induced β{sup +}-emitter distribution within the patient is detected shortly after irradiation by a commercial full-ring positron emission tomography/x-ray computed tomography (PET/CT) scanner installed next to the treatment rooms at the Heidelberg Ion-Beam Therapy Center (HIT). A major challenge to this approach is posed by the small number of detected coincidences. This contribution aims at characterizing the performance of the used PET/CT device and identifying the best-performing reconstruction algorithm under the particular statistical conditions of PET-based treatment monitoring. Moreover, this study addresses the impact of radiation background from the intrinsically radioactive lutetium-oxyorthosilicate (LSO)-based detectors at low counts. Methods: The authors have acquired 30 subsequent PET scans of a cylindrical phantom emulating a patientlike activity pattern and spanning the entire patient counting regime in terms of true coincidences and random fractions (RFs). Accuracy and precision of activity quantification, image noise, and geometrical fidelity of the scanner have been investigated for various reconstruction algorithms and settings in order to identify a practical, well-suited reconstruction scheme for PET-based treatment verification. Truncated listmode data have been utilized for separating the effects of small true count numbers and high RFs on the reconstructed images. A corresponding simulation study enabled extending the results to an even wider range of counting statistics and to additionally investigate the impact of scatter coincidences. Eventually, the recommended reconstruction scheme has been applied to exemplary postirradiation patient data-sets. Results: Among the investigated reconstruction options, the overall best results in terms of image noise, activity quantification, and accurate geometrical recovery were achieved using the ordered subset expectation maximization reconstruction algorithm with time-of-flight (TOF) and point-spread function (PSF) information. For this algorithm, reasonably accurate (better than 5%) and precise (uncertainty of the mean activity below 10%) imaging can be provided down to 80 000 true coincidences at 96% RF. Image noise and geometrical fidelity are generally improved for fewer iterations. The main limitation for PET-based treatment monitoring has been identified in the small number of true coincidences, rather than the high intrinsic random background. Application of the optimized reconstruction scheme to patient data-sets results in a 25% − 50% reduced image noise at a comparable activity quantification accuracy and an improved geometrical performance with respect to the formerly used reconstruction scheme at HIT, adopted from nuclear medicine applications. Conclusions: Under the poor statistical conditions in PET-based treatment monitoring, improved results can be achieved by considering PSF and TOF information during image reconstruction and by applying less iterations than in conventional nuclear medicine imaging. Geometrical fidelity and image noise are mainly limited by the low number of true coincidences, not the high LSO-related random background. The retrieved results might also impact other emerging PET applications at low counting statistics.

60 APPLIED LIFE SCIENCES↗

Parallel time integration software

This package implements an optimal-scaling multigrid solver for the (non) linear systems that arise from the discretization of problems with evolutionary behavior. Typically, solution algorithms for evolution equations are based on a time-marching approach, solving sequentially for one time step after the other. Parallelism in these traditional time-integrarion techniques is limited to spatial parallelism. However, current trends in computer architectures are leading twards system with more, but not faster. processors. Therefore, faster compute speeds must come from greater parallelism. One approach to achieve parallelism in time is with multigrid, but extending classical multigrid methods for elliptic poerators to this setting is a significant achievement. In this software, we implement a non-intrusive, optimal-scaling time-parallel method based on multigrid reduction techniques. The examples in the package demonstrate optimality of our multigrid-reduction-in-time algorithm (MGRIT) for solving a variety of parabolic equations in two and three sparial dimensions. These examples can also be used to show that MGRIT can achieve significant speedup in comparison to sequential time marching on modern architectures.

Source record↗

Parallel time integration software

This package implements an optimal-scaling multigrid solver for the (non) linear systems that arise from the discretization of problems with evolutionary behavior. Typically, solution algorithms for evolution equations are based on a time-marching approach, solving sequentially for one time step after the other. Parallelism in these traditional time-integrarion techniques is limited to spatial parallelism. However, current trends in computer architectures are leading twards system with more, but not faster. processors. Therefore, faster compute speeds must come from greater parallelism. One approach to achieve parallelism in time is with multigrid, but extending classical multigrid methods for elliptic poerators to this setting is a significant achievement. In this software, we implement a non-intrusive, optimal-scaling time-parallel method based on multigrid reduction techniques. The examples in the package demonstrate optimality of our multigrid-reduction-in-time algorithm (MGRIT) for solving a variety of parabolic equations in two and three sparial dimensions. These examples can also be used to show that MGRIT can achieve significant speedup in comparison to sequential time marching on modern architectures.

Source record↗

PEBBLES Mechanics Simulation Speedup

Pebble bed reactors contain large numbers of spherical fuel elements arranged randomly. Determining the motion and location of these fuel elements is required for calculating certain parameters of pebble bed reactor operation. These simulations involve hundreds of thousands of pebbles and involve determining the entire core motion as pebbles are recirculated. Single processor algorithms for this are insufficient since they would take decades to centuries of wall-clock time. This paper describes the process of parallelizing and speeding up the PEBBLES pebble mechanics simulation code. Both shared memory programming with the Open Multi-Processing API and distributed memory programming with the Message Passing Interface API are used in simultaneously in this process. A new shared memory lock-less linear time collision detection algorithm is described. This method allows faster detection of pebbles in contact than generic methods. These combine to make full recirculations on AVR sized reactors possible in months of wall clock time.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Enhanced computational efficiency in the direct determination of the two-electron reduced density matrix from the anti-Hermitian contracted Schrödinger equation with application to ground and excited states of conjugated π-systems

Determination of the two-electron reduced density matrix (2-RDM) from the solution of the anti-Hermitian contracted Schrödinger equation (ACSE) yields accurate energies and properties for both ground and excited states. Here, we develop a more efficient method to solving the ACSE that uses second-order information to select a more optimal step towards the solution. Calculations on the ground and excited states of water, hydrogen fluoride, and conjugated π systems show that the improved ACSE algorithm is 10-20 times faster than the previous ACSE algorithm. The ACSE can treat both single- and multi-reference electron correlation with the initial 2-RDM from a complete-active-space self-consistent-field (CASSCF) calculation. Using the improved algorithm, we explore the relationship between truncation of the active space in the CASSCF calculation and the accuracy of the energy and 2-RDM from the ACSE calculation. The accuracy of the ACSE, we find, is less sensitive to the size of the active space than the accuracy of other wavefunction methods, which is useful when large active space calculations are computationally infeasible.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms

Energy-efficient routing in wireless sensor networks has attracted attention from researchers in both academia and industry, most recently motivated by the opportunity to use software-defined network-inspired approaches. These problems are NP-hard, with algorithms needing computation time that scales faster than polynomials in the problem size. Consequently, heuristic algorithms are used in practice, which are unable to guarantee optimally. In this article, we show proof-of-principle for the use of a quantum annealing processor instead of a classical processor, to find optimal or nearly optimal solutions very quickly. Our preliminary results for small networks show that this approach using quantum computing has great promise and may open the door for other significant improvements in the efficacy of network algorithms.

42 ENGINEERING↗

Self-potential monitoring of a salt plume

Nonintrusively monitoring the spread of contaminants in real time with a geophysical method is an important task in hydrogeophysics. We have developed a sandbox experiment showing that the self-potential method can locate both the source of leakage and the front of a contaminant plume. We monitored the leakage of a plume of salty water from a hole at the bottom of a small tank located at the top of a main sandbox. Initially, the sand was saturated by tap water. At a given time, a hole was opened at the bottom of the tank, allowing the salty water to migrate by diffusion and buoyancy-driven flow in the main sandbox. The bottom of the sandbox contained a network of 32 nonpolarizing silver-silver chloride electrodes with amplifiers, connected to a multichannel voltmeter. The self-potential response associated withthe migration of the salt plume in the sandbox was recorded over time. A self-potential anomaly was observed with amplitude varying from a few millivolts at the start of the leak to a few tens of millivolts after a few minutes. The self-potential data were inverted using a time-lapse tomographic algorithm to reconstruct the position of the volumetric source current density over time. A positive volumetric source current density was associated with the position of the leak at the bottom of the leaking tank, whereas a negative volumetric source current density was associated with the salinity front moving down inside the sandbox. These poles were well reproduced by performing a finite-element simulation of the problem. Using this information, we estimated the speed of the salt plume sinking inside the sandbox. Therefore, the self-potential method can be used to track, in real time, the position of the front of a contaminant plume in a porous material.

54 ENVIRONMENTAL SCIENCES↗

Near-Field Imaging of Shallow Chemical Detonations in Granite using Change Detection Methods of Borehole Seismic Data

As part of the Source Physics Experiment (SPE) Phase I shallow chemical detonation series, multiple surface and borehole active-source seismic campaigns were executed to perform high resolution imaging of seismic velocity changes in the granitic substrate. Cross-correlation data processing methods were implemented to efficiently and robustly perform semi-automated change detection of first-arrival times between campaigns. The change detection algorithm updates the arrival times, and consequently the velocity model, of each campaign. The resulting tomographic imagery reveals the evolution of the subsurface velocity structure as the detonations progressed.

42 ENGINEERING↗

Near-Field Imaging of Shallow Chemical Detonations in Granite using Change Detection Methods of Borehole Seismic Data

As part of the Source Physics Experiment (SPE) Phase I shallow chemical detonation series, multiple surface and borehole active-source seismic campaigns were executed to perform high-resolution imaging of seismic velocity changes in the granitic substrate. Cross-correlation data processing methods were implemented to efficiently and robustly perform semi-automated change detection of first-arrival times between campaigns. The change detection algorithm updates the arrival times, and consequently the velocity model, of each campaign. The resulting tomographic imagery reveals the evolution of the subsurface velocity structure as the detonations progressed.

42 ENGINEERING↗